Context Navigation

Resolver.cc @ b726084

ADTaaron-thesisarm-ehast-experimentalcleanup-dtorsdeferred_resndemanglerenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprnew-envno_listpersistent-indexerpthread-emulationqualifiedEnumresolv-newwith_gc

Last change on this file since b726084 was b726084, checked in by Rob Schluntz <rschlunt@…>, 8 years ago

Merge branch 'master' into tuples

Conflicts:

src/ControlStruct/LabelTypeChecker.cc
src/InitTweak/FixInit.cc
src/ResolvExpr/Resolver.cc
src/Tuples/TupleAssignment.cc
src/Tuples/TupleAssignment.h

Property mode set to 100644

File size: 20.2 KB

Line
1	//
2	// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3	//
4	// The contents of this file are covered under the licence agreement in the
5	// file "LICENCE" distributed with Cforall.
6	//
7	// Resolver.cc --
8	//
9	// Author : Richard C. Bilson
10	// Created On : Sun May 17 12:17:01 2015
11	// Last Modified By : Peter A. Buhr
12	// Last Modified On : Tue Jul 12 17:45:42 2016
13	// Update Count : 204
14	//
15
16	#include "Resolver.h"
17	#include "AlternativeFinder.h"
18	#include "Alternative.h"
19	#include "RenameVars.h"
20	#include "ResolveTypeof.h"
21	#include "typeops.h"
22	#include "SynTree/Statement.h"
23	#include "SynTree/Type.h"
24	#include "SynTree/Expression.h"
25	#include "SynTree/Initializer.h"
26	#include "SymTab/Indexer.h"
27	#include "SymTab/Autogen.h"
28	#include "Common/utility.h"
29	#include "InitTweak/InitTweak.h"
30
31	#include <iostream>
32	using namespace std;
33
34	namespace ResolvExpr {
35	class Resolver final : public SymTab::Indexer {
36	public:
37	Resolver() : SymTab::Indexer( false ) {}
38
39	using SymTab::Indexer::visit;
40	virtual void visit( FunctionDecl *functionDecl ) override;
41	virtual void visit( ObjectDecl *functionDecl ) override;
42	virtual void visit( TypeDecl *typeDecl ) override;
43	virtual void visit( EnumDecl * enumDecl ) override;
44
45	virtual void visit( ArrayType * at ) override;
46	virtual void visit( PointerType * at ) override;
47
48	virtual void visit( ExprStmt *exprStmt ) override;
49	virtual void visit( AsmExpr *asmExpr ) override;
50	virtual void visit( AsmStmt *asmStmt ) override;
51	virtual void visit( IfStmt *ifStmt ) override;
52	virtual void visit( WhileStmt *whileStmt ) override;
53	virtual void visit( ForStmt *forStmt ) override;
54	virtual void visit( SwitchStmt *switchStmt ) override;
55	virtual void visit( CaseStmt *caseStmt ) override;
56	virtual void visit( BranchStmt *branchStmt ) override;
57	virtual void visit( ReturnStmt *returnStmt ) override;
58
59	virtual void visit( SingleInit *singleInit ) override;
60	virtual void visit( ListInit *listInit ) override;
61	virtual void visit( ConstructorInit *ctorInit ) override;
62	private:
63	typedef std::list< Initializer * >::iterator InitIterator;
64
65	template< typename PtrType >
66	void handlePtrType( PtrType * type );
67
68	void resolveAggrInit( AggregateDecl *, InitIterator &, InitIterator & );
69	void resolveSingleAggrInit( Declaration *, InitIterator &, InitIterator & );
70	void fallbackInit( ConstructorInit * ctorInit );
71
72	Type * functionReturn = nullptr;
73	Type *initContext = nullptr;
74	Type *switchType = nullptr;
75	bool inEnumDecl = false;
76	};
77
78	void resolve( std::list< Declaration * > translationUnit ) {
79	Resolver resolver;
80	acceptAll( translationUnit, resolver );
81	#if 0
82	resolver.print( cerr );
83	for ( std::list< Declaration * >::iterator i = translationUnit.begin(); i != translationUnit.end(); ++i ) {
84	(*i)->print( std::cerr );
85	(*i)->accept( resolver );
86	} // for
87	#endif
88	}
89
90	Expression resolveInVoidContext( Expression expr, const SymTab::Indexer &indexer ) {
91	TypeEnvironment env;
92	return resolveInVoidContext( expr, indexer, env );
93	}
94
95
96	namespace {
97	void finishExpr( Expression *expr, const TypeEnvironment &env ) {
98	expr->set_env( new TypeSubstitution );
99	env.makeSubstitution( *expr->get_env() );
100	}
101	} // namespace
102
103	Expression findVoidExpression( Expression untyped, const SymTab::Indexer &indexer ) {
104	global_renamer.reset();
105	TypeEnvironment env;
106	Expression *newExpr = resolveInVoidContext( untyped, indexer, env );
107	finishExpr( newExpr, env );
108	return newExpr;
109	}
110
111	namespace {
112	Expression findSingleExpression( Expression untyped, const SymTab::Indexer &indexer ) {
113	TypeEnvironment env;
114	AlternativeFinder finder( indexer, env );
115	finder.find( untyped );
116	#if 0
117	if ( finder.get_alternatives().size() != 1 ) {
118	std::cout << "untyped expr is ";
119	untyped->print( std::cout );
120	std::cout << std::endl << "alternatives are:";
121	for ( std::list< Alternative >::const_iterator i = finder.get_alternatives().begin(); i != finder.get_alternatives().end(); ++i ) {
122	i->print( std::cout );
123	} // for
124	} // if
125	#endif
126	assert( finder.get_alternatives().size() == 1 );
127	Alternative &choice = finder.get_alternatives().front();
128	Expression *newExpr = choice.expr->clone();
129	finishExpr( newExpr, choice.env );
130	return newExpr;
131	}
132
133	bool isIntegralType( Type *type ) {
134	if ( dynamic_cast< EnumInstType * >( type ) ) {
135	return true;
136	} else if ( BasicType bt = dynamic_cast< BasicType >( type ) ) {
137	return bt->isInteger();
138	} else if ( dynamic_cast< ZeroType* >( type ) != nullptr \|\| dynamic_cast< OneType* >( type ) != nullptr ) {
139	return true;
140	} else {
141	return false;
142	} // if
143	}
144
145	Expression findIntegralExpression( Expression untyped, const SymTab::Indexer &indexer ) {
146	TypeEnvironment env;
147	AlternativeFinder finder( indexer, env );
148	finder.find( untyped );
149	#if 0
150	if ( finder.get_alternatives().size() != 1 ) {
151	std::cout << "untyped expr is ";
152	untyped->print( std::cout );
153	std::cout << std::endl << "alternatives are:";
154	for ( std::list< Alternative >::const_iterator i = finder.get_alternatives().begin(); i != finder.get_alternatives().end(); ++i ) {
155	i->print( std::cout );
156	} // for
157	} // if
158	#endif
159	Expression *newExpr = 0;
160	const TypeEnvironment *newEnv = 0;
161	for ( AltList::const_iterator i = finder.get_alternatives().begin(); i != finder.get_alternatives().end(); ++i ) {
162	if ( i->expr->get_result()->size() == 1 && isIntegralType( i->expr->get_result() ) ) {
163	if ( newExpr ) {
164	throw SemanticError( "Too many interpretations for case control expression", untyped );
165	} else {
166	newExpr = i->expr->clone();
167	newEnv = &i->env;
168	} // if
169	} // if
170	} // for
171	if ( ! newExpr ) {
172	throw SemanticError( "No interpretations for case control expression", untyped );
173	} // if
174	finishExpr( newExpr, *newEnv );
175	return newExpr;
176	}
177
178	}
179
180	void Resolver::visit( ObjectDecl *objectDecl ) {
181	Type new_type = resolveTypeof( objectDecl->get_type(), this );
182	objectDecl->set_type( new_type );
183	// To handle initialization of routine pointers, e.g., int (*fp)(int) = foo(), means that class-variable
184	// initContext is changed multiple time because the LHS is analysed twice. The second analysis changes
185	// initContext because of a function type can contain object declarations in the return and parameter types. So
186	// each value of initContext is retained, so the type on the first analysis is preserved and used for selecting
187	// the RHS.
188	Type *temp = initContext;
189	initContext = new_type;
190	if ( inEnumDecl && dynamic_cast< EnumInstType * >( initContext ) ) {
191	// enumerator initializers should not use the enum type to initialize, since
192	// the enum type is still incomplete at this point. Use signed int instead.
193	initContext = new BasicType( Type::Qualifiers(), BasicType::SignedInt );
194	}
195	SymTab::Indexer::visit( objectDecl );
196	if ( inEnumDecl && dynamic_cast< EnumInstType * >( initContext ) ) {
197	// delete newly created signed int type
198	delete initContext;
199	}
200	initContext = temp;
201	}
202
203	template< typename PtrType >
204	void Resolver::handlePtrType( PtrType * type ) {
205	if ( type->get_dimension() ) {
206	CastExpr *castExpr = new CastExpr( type->get_dimension(), SymTab::SizeType->clone() );
207	Expression newExpr = findSingleExpression( castExpr, this );
208	delete type->get_dimension();
209	type->set_dimension( newExpr );
210	}
211	}
212
213	void Resolver::visit( ArrayType * at ) {
214	handlePtrType( at );
215	Visitor::visit( at );
216	}
217
218	void Resolver::visit( PointerType * pt ) {
219	handlePtrType( pt );
220	Visitor::visit( pt );
221	}
222
223	void Resolver::visit( TypeDecl *typeDecl ) {
224	if ( typeDecl->get_base() ) {
225	Type new_type = resolveTypeof( typeDecl->get_base(), this );
226	typeDecl->set_base( new_type );
227	} // if
228	SymTab::Indexer::visit( typeDecl );
229	}
230
231	void Resolver::visit( FunctionDecl *functionDecl ) {
232	#if 0
233	std::cout << "resolver visiting functiondecl ";
234	functionDecl->print( std::cout );
235	std::cout << std::endl;
236	#endif
237	Type new_type = resolveTypeof( functionDecl->get_type(), this );
238	functionDecl->set_type( new_type );
239	ValueGuard< Type * > oldFunctionReturn( functionReturn );
240	functionReturn = ResolvExpr::extractResultType( functionDecl->get_functionType() );
241	SymTab::Indexer::visit( functionDecl );
242	}
243
244	void Resolver::visit( EnumDecl * enumDecl ) {
245	// in case we decide to allow nested enums
246	bool oldInEnumDecl = inEnumDecl;
247	inEnumDecl = true;
248	SymTab::Indexer::visit( enumDecl );
249	inEnumDecl = oldInEnumDecl;
250	}
251
252	void Resolver::visit( ExprStmt *exprStmt ) {
253	if ( exprStmt->get_expr() ) {
254	Expression newExpr = findVoidExpression( exprStmt->get_expr(), this );
255	delete exprStmt->get_expr();
256	exprStmt->set_expr( newExpr );
257	} // if
258	}
259
260	void Resolver::visit( AsmExpr *asmExpr ) {
261	Expression newExpr = findVoidExpression( asmExpr->get_operand(), this );
262	delete asmExpr->get_operand();
263	asmExpr->set_operand( newExpr );
264	if ( asmExpr->get_inout() ) {
265	newExpr = findVoidExpression( asmExpr->get_inout(), *this );
266	delete asmExpr->get_inout();
267	asmExpr->set_inout( newExpr );
268	} // if
269	}
270
271	void Resolver::visit( AsmStmt *asmStmt ) {
272	acceptAll( asmStmt->get_input(), *this);
273	acceptAll( asmStmt->get_output(), *this);
274	}
275
276	void Resolver::visit( IfStmt *ifStmt ) {
277	Expression newExpr = findSingleExpression( ifStmt->get_condition(), this );
278	delete ifStmt->get_condition();
279	ifStmt->set_condition( newExpr );
280	Visitor::visit( ifStmt );
281	}
282
283	void Resolver::visit( WhileStmt *whileStmt ) {
284	Expression newExpr = findSingleExpression( whileStmt->get_condition(), this );
285	delete whileStmt->get_condition();
286	whileStmt->set_condition( newExpr );
287	Visitor::visit( whileStmt );
288	}
289
290	void Resolver::visit( ForStmt *forStmt ) {
291	SymTab::Indexer::visit( forStmt );
292
293	if ( forStmt->get_condition() ) {
294	Expression * newExpr = findSingleExpression( forStmt->get_condition(), *this );
295	delete forStmt->get_condition();
296	forStmt->set_condition( newExpr );
297	} // if
298
299	if ( forStmt->get_increment() ) {
300	Expression * newExpr = findVoidExpression( forStmt->get_increment(), *this );
301	delete forStmt->get_increment();
302	forStmt->set_increment( newExpr );
303	} // if
304	}
305
306	template< typename SwitchClass >
307	void handleSwitchStmt( SwitchClass *switchStmt, SymTab::Indexer &visitor ) {
308	Expression *newExpr;
309	newExpr = findIntegralExpression( switchStmt->get_condition(), visitor );
310	delete switchStmt->get_condition();
311	switchStmt->set_condition( newExpr );
312
313	visitor.Visitor::visit( switchStmt );
314	}
315
316	void Resolver::visit( SwitchStmt *switchStmt ) {
317	handleSwitchStmt( switchStmt, *this );
318	}
319
320	void Resolver::visit( CaseStmt *caseStmt ) {
321	Visitor::visit( caseStmt );
322	}
323
324	void Resolver::visit( BranchStmt *branchStmt ) {
325	// must resolve the argument for a computed goto
326	if ( branchStmt->get_type() == BranchStmt::Goto ) { // check for computed goto statement
327	if ( Expression * arg = branchStmt->get_computedTarget() ) {
328	VoidType v = Type::Qualifiers(); // cast to void * for the alternative finder
329	PointerType pt( Type::Qualifiers(), v.clone() );
330	CastExpr * castExpr = new CastExpr( arg, pt.clone() );
331	Expression * newExpr = findSingleExpression( castExpr, *this ); // find best expression
332	branchStmt->set_target( newExpr );
333	} // if
334	} // if
335	}
336
337	void Resolver::visit( ReturnStmt *returnStmt ) {
338	if ( returnStmt->get_expr() ) {
339	CastExpr *castExpr = new CastExpr( returnStmt->get_expr(), functionReturn->clone() );
340	Expression newExpr = findSingleExpression( castExpr, this );
341	delete castExpr;
342	returnStmt->set_expr( newExpr );
343	} // if
344	}
345
346	template< typename T >
347	bool isCharType( T t ) {
348	if ( BasicType * bt = dynamic_cast< BasicType * >( t ) ) {
349	return bt->get_kind() == BasicType::Char \|\| bt->get_kind() == BasicType::SignedChar \|\|
350	bt->get_kind() == BasicType::UnsignedChar;
351	}
352	return false;
353	}
354
355	void Resolver::visit( SingleInit *singleInit ) {
356	if ( singleInit->get_value() ) {
357	#if 0
358	if (NameExpr * ne = dynamic_cast<NameExpr*>(singleInit->get_value())) {
359	string n = ne->get_name();
360	if (n == "0") {
361	initContext = new BasicType(Type::Qualifiers(),
362	BasicType::SignedInt);
363	} else {
364	DeclarationWithType * decl = lookupId( n );
365	initContext = decl->get_type();
366	}
367	} else if (ConstantExpr * e =
368	dynamic_cast<ConstantExpr*>(singleInit->get_value())) {
369	Constant *c = e->get_constant();
370	initContext = c->get_type();
371	} else {
372	assert(0);
373	}
374	#endif
375	CastExpr *castExpr = new CastExpr( singleInit->get_value(), initContext->clone() );
376	Expression newExpr = findSingleExpression( castExpr, this );
377	delete castExpr;
378	singleInit->set_value( newExpr );
379
380	// check if initializing type is char[]
381	if ( ArrayType * at = dynamic_cast< ArrayType * >( initContext ) ) {
382	if ( isCharType( at->get_base() ) ) {
383	// check if the resolved type is char *
384	if ( PointerType * pt = dynamic_cast< PointerType *>( newExpr->get_result() ) ) {
385	if ( isCharType( pt->get_base() ) ) {
386	// strip cast if we're initializing a char[] with a char *, e.g. char x[] = "hello";
387	CastExpr ce = dynamic_cast< CastExpr >( newExpr );
388	singleInit->set_value( ce->get_arg() );
389	ce->set_arg( NULL );
390	delete ce;
391	}
392	}
393	}
394	}
395	} // if
396	// singleInit->get_value()->accept( *this );
397	}
398
399	void Resolver::resolveSingleAggrInit( Declaration * dcl, InitIterator & init, InitIterator & initEnd ) {
400	DeclarationWithType * dt = dynamic_cast< DeclarationWithType * >( dcl );
401	assert( dt );
402	initContext = dt->get_type();
403	try {
404	if ( init == initEnd ) return; // stop when there are no more initializers
405	(init)->accept( this );
406	++init; // made it past an initializer
407	} catch( SemanticError & ) {
408	// need to delve deeper, if you can
409	if ( StructInstType * sit = dynamic_cast< StructInstType * >( dt->get_type() ) ) {
410	resolveAggrInit( sit->get_baseStruct(), init, initEnd );
411	} else if ( UnionInstType * uit = dynamic_cast< UnionInstType * >( dt->get_type() ) ) {
412	resolveAggrInit( uit->get_baseUnion(), init, initEnd );
413	} else {
414	// member is not an aggregate type, so can't go any deeper
415
416	// might need to rethink what is being thrown
417	throw;
418	} // if
419	}
420	}
421
422	void Resolver::resolveAggrInit( AggregateDecl * aggr, InitIterator & init, InitIterator & initEnd ) {
423	if ( StructDecl * st = dynamic_cast< StructDecl * >( aggr ) ) {
424	// want to resolve each initializer to the members of the struct,
425	// but if there are more initializers than members we should stop
426	list< Declaration * >::iterator it = st->get_members().begin();
427	for ( ; it != st->get_members().end(); ++it) {
428	resolveSingleAggrInit( *it, init, initEnd );
429	}
430	} else if ( UnionDecl * un = dynamic_cast< UnionDecl * >( aggr ) ) {
431	// only resolve to the first member of a union
432	resolveSingleAggrInit( *un->get_members().begin(), init, initEnd );
433	} // if
434	}
435
436	void Resolver::visit( ListInit * listInit ) {
437	InitIterator iter = listInit->begin();
438	InitIterator end = listInit->end();
439
440	if ( ArrayType * at = dynamic_cast< ArrayType * >( initContext ) ) {
441	// resolve each member to the base type of the array
442	for ( ; iter != end; ++iter ) {
443	initContext = at->get_base();
444	(iter)->accept( this );
445	} // for
446	} else if ( TupleType * tt = dynamic_cast< TupleType * > ( initContext ) ) {
447	for ( Type * t : *tt ) {
448	if ( iter == end ) break;
449	initContext = t;
450	(iter++)->accept( this );
451	}
452	} else if ( StructInstType * st = dynamic_cast< StructInstType * >( initContext ) ) {
453	resolveAggrInit( st->get_baseStruct(), iter, end );
454	} else if ( UnionInstType * st = dynamic_cast< UnionInstType * >( initContext ) ) {
455	resolveAggrInit( st->get_baseUnion(), iter, end );
456	} else if ( TypeInstType * tt = dynamic_cast< TypeInstType * >( initContext ) ) {
457	Type * base = tt->get_baseType()->get_base();
458	if ( base ) {
459	// know the implementation type, so try using that as the initContext
460	initContext = base;
461	visit( listInit );
462	} else {
463	// missing implementation type -- might be an unknown type variable, so try proceeding with the current init context
464	Visitor::visit( listInit );
465	}
466	} else {
467	assert( dynamic_cast< BasicType * >( initContext ) \|\| dynamic_cast< PointerType * >( initContext )
468	\|\| dynamic_cast< ZeroType * >( initContext ) \|\| dynamic_cast< OneType * >( initContext ) );
469	// basic types are handled here
470	Visitor::visit( listInit );
471	}
472
473	#if 0
474	if ( ArrayType at = dynamic_cast<ArrayType>(initContext) ) {
475	std::list<Initializer *>::iterator iter( listInit->begin_initializers() );
476	for ( ; iter != listInit->end_initializers(); ++iter ) {
477	initContext = at->get_base();
478	(iter)->accept( this );
479	} // for
480	} else if ( StructInstType st = dynamic_cast<StructInstType>(initContext) ) {
481	StructDecl *baseStruct = st->get_baseStruct();
482	std::list<Declaration *>::iterator iter1( baseStruct->get_members().begin() );
483	std::list<Initializer *>::iterator iter2( listInit->begin_initializers() );
484	for ( ; iter1 != baseStruct->get_members().end() && iter2 != listInit->end_initializers(); ++iter2 ) {
485	if ( (*iter2)->get_designators().empty() ) {
486	DeclarationWithType dt = dynamic_cast<DeclarationWithType >( *iter1 );
487	initContext = dt->get_type();
488	(iter2)->accept( this );
489	++iter1;
490	} else {
491	StructDecl *st = baseStruct;
492	iter1 = st->get_members().begin();
493	std::list<Expression >::iterator iter3( (iter2)->get_designators().begin() );
494	for ( ; iter3 != (*iter2)->get_designators().end(); ++iter3 ) {
495	NameExpr key = dynamic_cast<NameExpr >( *iter3 );
496	assert( key );
497	for ( ; iter1 != st->get_members().end(); ++iter1 ) {
498	if ( key->get_name() == (*iter1)->get_name() ) {
499	(*iter1)->print( cout );
500	cout << key->get_name() << endl;
501	ObjectDecl fred = dynamic_cast<ObjectDecl >( *iter1 );
502	assert( fred );
503	StructInstType mary = dynamic_cast<StructInstType>( fred->get_type() );
504	assert( mary );
505	st = mary->get_baseStruct();
506	iter1 = st->get_members().begin();
507	break;
508	} // if
509	} // for
510	} // for
511	ObjectDecl fred = dynamic_cast<ObjectDecl >( *iter1 );
512	assert( fred );
513	initContext = fred->get_type();
514	(listInit->begin_initializers())->accept( this );
515	} // if
516	} // for
517	} else if ( UnionInstType st = dynamic_cast<UnionInstType>(initContext) ) {
518	DeclarationWithType dt = dynamic_cast<DeclarationWithType >( *st->get_baseUnion()->get_members().begin() );
519	initContext = dt->get_type();
520	(listInit->begin_initializers())->accept( this );
521	} // if
522	#endif
523	}
524
525	// ConstructorInit - fall back on C-style initializer
526	void Resolver::fallbackInit( ConstructorInit * ctorInit ) {
527	// could not find valid constructor, or found an intrinsic constructor
528	// fall back on C-style initializer
529	delete ctorInit->get_ctor();
530	ctorInit->set_ctor( NULL );
531	delete ctorInit->get_dtor();
532	ctorInit->set_dtor( NULL );
533	maybeAccept( ctorInit->get_init(), *this );
534	}
535
536	void Resolver::visit( ConstructorInit *ctorInit ) {
537	// xxx - fallback init has been removed => remove fallbackInit function and remove complexity from FixInit and remove C-init from ConstructorInit
538	maybeAccept( ctorInit->get_ctor(), *this );
539	maybeAccept( ctorInit->get_dtor(), *this );
540
541	// found a constructor - can get rid of C-style initializer
542	delete ctorInit->get_init();
543	ctorInit->set_init( NULL );
544
545	// intrinsic single parameter constructors and destructors do nothing. Since this was
546	// implicitly generated, there's no way for it to have side effects, so get rid of it
547	// to clean up generated code.
548	if ( InitTweak::isIntrinsicSingleArgCallStmt( ctorInit->get_ctor() ) ) {
549	delete ctorInit->get_ctor();
550	ctorInit->set_ctor( NULL );
551	}
552
553	if ( InitTweak::isIntrinsicSingleArgCallStmt( ctorInit->get_dtor() ) ) {
554	delete ctorInit->get_dtor();
555	ctorInit->set_dtor( NULL );
556	}
557
558	// xxx - todo -- what about arrays?
559	// if ( dtor == NULL && InitTweak::isIntrinsicCallStmt( ctorInit->get_ctor() ) ) {
560	// // can reduce the constructor down to a SingleInit using the
561	// // second argument from the ctor call, since
562	// delete ctorInit->get_ctor();
563	// ctorInit->set_ctor( NULL );
564
565	// Expression * arg =
566	// ctorInit->set_init( new SingleInit( arg ) );
567	// }
568	}
569	} // namespace ResolvExpr
570
571	// Local Variables: //
572	// tab-width: 4 //
573	// mode: c++ //
574	// compile-command: "make install" //
575	// End: //

Note: See TracBrowser for help on using the repository browser.

Context Navigation

source: src/ResolvExpr/Resolver.cc @ b726084

Download in other formats: