source: src/SymTab/Mangler.cc@ 8360977

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors ctor deferred_resn demangler enum forall-pointer-decay gc_noraii jacob/cs343-translation jenkins-sandbox memory new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum resolv-new string with_gc
Last change on this file since 8360977 was 8360977, checked in by Aaron Moss <a3moss@…>, 10 years ago

Mangler now mangles parameters to generic types
  • Property mode set to 100644
File size: 8.5 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// Mangler.cc --
8//
9// Author : Richard C. Bilson
10// Created On : Sun May 17 21:40:29 2015
11// Last Modified By : Rob Schluntz
12// Last Modified On : Wed Aug 19 15:52:24 2015
13// Update Count : 19
14//
15
16#include <cassert>
17#include <string>
18#include <algorithm>
19#include <iterator>
20#include <functional>
21#include <set>
22
23#include "SynTree/Declaration.h"
24#include "SynTree/Type.h"
25#include "SynTree/Expression.h"
26#include "SynTree/Initializer.h"
27#include "SynTree/Statement.h"
28#include "Mangler.h"
29#include "CodeGen/OperatorTable.h"
30
31namespace SymTab {
32 Mangler::Mangler( bool mangleOverridable, bool includeQualifiers )
33 : nextVarNum( 0 ), isTopLevel( true ), mangleOverridable( mangleOverridable ), includeQualifiers(includeQualifiers) {}
34
35 Mangler::Mangler( const Mangler &rhs ) : mangleName() {
36 varNums = rhs.varNums;
37 nextVarNum = rhs.nextVarNum;
38 isTopLevel = rhs.isTopLevel;
39 mangleOverridable = rhs.mangleOverridable;
40 includeQualifiers = rhs.includeQualifiers;
41 }
42
43 void Mangler::mangleDecl( DeclarationWithType *declaration ) {
44 bool wasTopLevel = isTopLevel;
45 if ( isTopLevel ) {
46 varNums.clear();
47 nextVarNum = 0;
48 isTopLevel = false;
49 } // if
50 mangleName << "__";
51 CodeGen::OperatorInfo opInfo;
52 if ( operatorLookup( declaration->get_name(), opInfo ) ) {
53 mangleName << opInfo.outputName;
54 } else {
55 mangleName << declaration->get_name();
56 } // if
57 mangleName << "__";
58 maybeAccept( declaration->get_type(), *this );
59 if ( mangleOverridable && LinkageSpec::isOverridable( declaration->get_linkage() ) ) {
60 // want to be able to override autogenerated and intrinsic routines,
61 // so they need a different name mangling
62 if ( declaration->get_linkage() == LinkageSpec::AutoGen ) {
63 mangleName << "autogen__";
64 } else if ( declaration->get_linkage() == LinkageSpec::Intrinsic ) {
65 mangleName << "intrinsic__";
66 } else {
67 // if we add another kind of overridable function, this has to change
68 assert( false );
69 } // if
70 }
71 isTopLevel = wasTopLevel;
72 }
73
74 void Mangler::visit( ObjectDecl *declaration ) {
75 mangleDecl( declaration );
76 }
77
78 void Mangler::visit( FunctionDecl *declaration ) {
79 mangleDecl( declaration );
80 }
81
82 void Mangler::visit( VoidType *voidType ) {
83 printQualifiers( voidType );
84 mangleName << "v";
85 }
86
87 void Mangler::visit( BasicType *basicType ) {
88 static const char *btLetter[] = {
89 "b", // Bool
90 "c", // Char
91 "Sc", // SignedChar
92 "Uc", // UnsignedChar
93 "s", // ShortSignedInt
94 "Us", // ShortUnsignedInt
95 "i", // SignedInt
96 "Ui", // UnsignedInt
97 "l", // LongSignedInt
98 "Ul", // LongUnsignedInt
99 "q", // LongLongSignedInt
100 "Uq", // LongLongUnsignedInt
101 "f", // Float
102 "d", // Double
103 "r", // LongDouble
104 "Xf", // FloatComplex
105 "Xd", // DoubleComplex
106 "Xr", // LongDoubleComplex
107 "If", // FloatImaginary
108 "Id", // DoubleImaginary
109 "Ir", // LongDoubleImaginary
110 };
111
112 printQualifiers( basicType );
113 mangleName << btLetter[ basicType->get_kind() ];
114 }
115
116 void Mangler::visit( PointerType *pointerType ) {
117 printQualifiers( pointerType );
118 mangleName << "P";
119 maybeAccept( pointerType->get_base(), *this );
120 }
121
122 void Mangler::visit( ArrayType *arrayType ) {
123 // TODO: encode dimension
124 printQualifiers( arrayType );
125 mangleName << "A0";
126 maybeAccept( arrayType->get_base(), *this );
127 }
128
129 namespace {
130 inline std::list< Type* > getTypes( const std::list< DeclarationWithType* > decls ) {
131 std::list< Type* > ret;
132 std::transform( decls.begin(), decls.end(), std::back_inserter( ret ),
133 std::mem_fun( &DeclarationWithType::get_type ) );
134 return ret;
135 }
136 }
137
138 void Mangler::visit( FunctionType *functionType ) {
139 printQualifiers( functionType );
140 mangleName << "F";
141 std::list< Type* > returnTypes = getTypes( functionType->get_returnVals() );
142 acceptAll( returnTypes, *this );
143 mangleName << "_";
144 std::list< Type* > paramTypes = getTypes( functionType->get_parameters() );
145 acceptAll( paramTypes, *this );
146 mangleName << "_";
147 }
148
149 void Mangler::mangleRef( ReferenceToType *refType, std::string prefix ) {
150 printQualifiers( refType );
151
152 mangleName << ( refType->get_name().length() + prefix.length() ) << prefix << refType->get_name();
153 }
154
155 void Mangler::mangleGenericRef( ReferenceToType *refType, std::string prefix ) {
156 printQualifiers( refType );
157
158 std::ostringstream oldName( mangleName.str() );
159 mangleName.clear();
160
161 mangleName << prefix << refType->get_name();
162
163 std::list< Expression* >& params = refType->get_parameters();
164 if ( ! params.empty() ) {
165 mangleName << "_";
166 std::list< Type* > paramTypes;
167 for ( std::list< Expression* >::const_iterator param = params.begin(); param != params.end(); ++param ) {
168 TypeExpr *paramType = dynamic_cast< TypeExpr* >( *param );
169 assert(paramType && "Aggregate parameters should be type expressions");
170 paramTypes.push_back( paramType->get_type() );
171 }
172 acceptAll( paramTypes, *this );
173 mangleName << "_";
174 }
175
176 oldName << mangleName.str().length() << mangleName.str();
177 mangleName.str( oldName.str() );
178 }
179
180 void Mangler::visit( StructInstType *aggregateUseType ) {
181 mangleGenericRef( aggregateUseType, "s" );
182 }
183
184 void Mangler::visit( UnionInstType *aggregateUseType ) {
185 mangleGenericRef( aggregateUseType, "u" );
186 }
187
188 void Mangler::visit( EnumInstType *aggregateUseType ) {
189 mangleRef( aggregateUseType, "e" );
190 }
191
192 void Mangler::visit( TypeInstType *typeInst ) {
193 VarMapType::iterator varNum = varNums.find( typeInst->get_name() );
194 if ( varNum == varNums.end() ) {
195 mangleRef( typeInst, "t" );
196 } else {
197 printQualifiers( typeInst );
198 std::ostringstream numStream;
199 numStream << varNum->second.first;
200 switch ( (TypeDecl::Kind )varNum->second.second ) {
201 case TypeDecl::Any:
202 mangleName << "t";
203 break;
204 case TypeDecl::Dtype:
205 mangleName << "d";
206 break;
207 case TypeDecl::Ftype:
208 mangleName << "f";
209 break;
210 } // switch
211 mangleName << numStream.str();
212 } // if
213 }
214
215 void Mangler::visit( TupleType *tupleType ) {
216 printQualifiers( tupleType );
217 mangleName << "T";
218 acceptAll( tupleType->get_types(), *this );
219 mangleName << "_";
220 }
221
222 void Mangler::visit( TypeDecl *decl ) {
223 static const char *typePrefix[] = { "BT", "BD", "BF" };
224 mangleName << typePrefix[ decl->get_kind() ] << ( decl->get_name().length() + 1 ) << decl->get_name();
225 }
226
227 void printVarMap( const std::map< std::string, std::pair< int, int > > &varMap, std::ostream &os ) {
228 for ( std::map< std::string, std::pair< int, int > >::const_iterator i = varMap.begin(); i != varMap.end(); ++i ) {
229 os << i->first << "(" << i->second.first << "/" << i->second.second << ")" << std::endl;
230 } // for
231 }
232
233 void Mangler::printQualifiers( Type *type ) {
234 // skip if not including qualifiers
235 if ( ! includeQualifiers ) return;
236
237 if ( ! type->get_forall().empty() ) {
238 std::list< std::string > assertionNames;
239 int tcount = 0, dcount = 0, fcount = 0;
240 mangleName << "A";
241 for ( std::list< TypeDecl* >::iterator i = type->get_forall().begin(); i != type->get_forall().end(); ++i ) {
242 switch ( (*i)->get_kind() ) {
243 case TypeDecl::Any:
244 tcount++;
245 break;
246 case TypeDecl::Dtype:
247 dcount++;
248 break;
249 case TypeDecl::Ftype:
250 fcount++;
251 break;
252 } // switch
253 varNums[ (*i )->get_name() ] = std::pair< int, int >( nextVarNum++, (int )(*i )->get_kind() );
254 for ( std::list< DeclarationWithType* >::iterator assert = (*i )->get_assertions().begin(); assert != (*i )->get_assertions().end(); ++assert ) {
255 Mangler sub_mangler( mangleOverridable, includeQualifiers );
256 sub_mangler.nextVarNum = nextVarNum;
257 sub_mangler.isTopLevel = false;
258 sub_mangler.varNums = varNums;
259 (*assert)->accept( sub_mangler );
260 assertionNames.push_back( sub_mangler.mangleName.str() );
261 } // for
262 } // for
263 mangleName << tcount << "_" << dcount << "_" << fcount << "_";
264 std::copy( assertionNames.begin(), assertionNames.end(), std::ostream_iterator< std::string >( mangleName, "" ) );
265 mangleName << "_";
266 } // if
267 if ( type->get_isConst() ) {
268 mangleName << "C";
269 } // if
270 if ( type->get_isVolatile() ) {
271 mangleName << "V";
272 } // if
273 if ( type->get_isRestrict() ) {
274 mangleName << "R";
275 } // if
276 if ( type->get_isLvalue() ) {
277 mangleName << "L";
278 } // if
279 if ( type->get_isAtomic() ) {
280 mangleName << "A";
281 } // if
282 }
283} // namespace SymTab
284
285// Local Variables: //
286// tab-width: 4 //
287// mode: c++ //
288// compile-command: "make install" //
289// End: //
Note: See TracBrowser for help on using the repository browser.