source: src/SymTab/Mangler.cc@ 917f93c5

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

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