[b87a5ed] | 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 | // DeclarationNode.cc -- |
---|
| 8 | // |
---|
| 9 | // Author : Rodolfo G. Esteves |
---|
| 10 | // Created On : Sat May 16 12:34:05 2015 |
---|
[1db21619] | 11 | // Last Modified By : Peter A. Buhr |
---|
[4040425] | 12 | // Last Modified On : Wed Mar 2 17:26:24 2016 |
---|
| 13 | // Update Count : 134 |
---|
[b87a5ed] | 14 | // |
---|
| 15 | |
---|
[51b7345] | 16 | #include <string> |
---|
| 17 | #include <list> |
---|
| 18 | #include <iterator> |
---|
| 19 | #include <algorithm> |
---|
| 20 | #include <cassert> |
---|
| 21 | |
---|
| 22 | #include "TypeData.h" |
---|
[bdd516a] | 23 | |
---|
[68cd1ce] | 24 | #include "SynTree/Declaration.h" |
---|
| 25 | #include "SynTree/Expression.h" |
---|
[51b7345] | 26 | |
---|
[de62360d] | 27 | #include "Parser.h" |
---|
| 28 | #include "TypedefTable.h" |
---|
| 29 | extern TypedefTable typedefTable; |
---|
| 30 | |
---|
[51b7345] | 31 | using namespace std; |
---|
| 32 | |
---|
[bdd516a] | 33 | // These must remain in the same order as the corresponding DeclarationNode enumerations. |
---|
[68cd1ce] | 34 | const char *DeclarationNode::storageName[] = { "extern", "static", "auto", "register", "inline", "fortran", "_Noreturn", "_Thread_local", "" }; |
---|
[bdd516a] | 35 | const char *DeclarationNode::qualifierName[] = { "const", "restrict", "volatile", "lvalue", "_Atomic" }; |
---|
[90c3b1c] | 36 | const char *DeclarationNode::basicTypeName[] = { "char", "int", "float", "double", "void", "_Bool", "_Complex", "_Imaginary", }; |
---|
[68cd1ce] | 37 | const char *DeclarationNode::modifierName[] = { "signed", "unsigned", "short", "long" }; |
---|
| 38 | const char *DeclarationNode::aggregateName[] = { "struct", "union", "context" }; |
---|
[51b7345] | 39 | const char *DeclarationNode::typeClassName[] = { "type", "dtype", "ftype" }; |
---|
[90c3b1c] | 40 | const char *DeclarationNode::builtinTypeName[] = { "__builtin_va_list" }; |
---|
[51b7345] | 41 | |
---|
| 42 | UniqueName DeclarationNode::anonymous( "__anonymous" ); |
---|
| 43 | |
---|
| 44 | extern LinkageSpec::Type linkage; /* defined in cfa.y */ |
---|
| 45 | |
---|
[3848e0e] | 46 | DeclarationNode *DeclarationNode::clone() const { |
---|
[b87a5ed] | 47 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 48 | newnode->type = maybeClone( type ); |
---|
| 49 | newnode->name = name; |
---|
| 50 | newnode->storageClasses = storageClasses; |
---|
| 51 | newnode->bitfieldWidth = maybeClone( bitfieldWidth ); |
---|
| 52 | newnode->hasEllipsis = hasEllipsis; |
---|
| 53 | newnode->initializer = initializer; |
---|
| 54 | newnode->next = maybeClone( next ); |
---|
| 55 | newnode->linkage = linkage; |
---|
| 56 | return newnode; |
---|
[3848e0e] | 57 | } |
---|
| 58 | |
---|
| 59 | DeclarationNode::DeclarationNode() : type( 0 ), bitfieldWidth( 0 ), initializer( 0 ), hasEllipsis( false ), linkage( ::linkage ) { |
---|
| 60 | } |
---|
| 61 | |
---|
| 62 | DeclarationNode::~DeclarationNode() { |
---|
[b87a5ed] | 63 | delete type; |
---|
| 64 | delete bitfieldWidth; |
---|
| 65 | delete initializer; |
---|
[3848e0e] | 66 | } |
---|
| 67 | |
---|
| 68 | bool DeclarationNode::get_hasEllipsis() const { |
---|
[b87a5ed] | 69 | return hasEllipsis; |
---|
[3848e0e] | 70 | } |
---|
| 71 | |
---|
| 72 | void DeclarationNode::print( std::ostream &os, int indent ) const { |
---|
[59db689] | 73 | os << string( indent, ' ' ); |
---|
[b87a5ed] | 74 | if ( name == "" ) { |
---|
| 75 | os << "unnamed: "; |
---|
| 76 | } else { |
---|
| 77 | os << name << ": "; |
---|
[68cd1ce] | 78 | } // if |
---|
[51b7345] | 79 | |
---|
[b87a5ed] | 80 | if ( linkage != LinkageSpec::Cforall ) { |
---|
| 81 | os << LinkageSpec::toString( linkage ) << " "; |
---|
[68cd1ce] | 82 | } // if |
---|
[3848e0e] | 83 | |
---|
[68cd1ce] | 84 | printEnums( storageClasses.begin(), storageClasses.end(), DeclarationNode::storageName, os ); |
---|
[b87a5ed] | 85 | if ( type ) { |
---|
| 86 | type->print( os, indent ); |
---|
| 87 | } else { |
---|
| 88 | os << "untyped entity "; |
---|
[68cd1ce] | 89 | } // if |
---|
[3848e0e] | 90 | |
---|
[b87a5ed] | 91 | if ( bitfieldWidth ) { |
---|
[59db689] | 92 | os << endl << string( indent + 2, ' ' ) << "with bitfield width "; |
---|
[b87a5ed] | 93 | bitfieldWidth->printOneLine( os ); |
---|
[68cd1ce] | 94 | } // if |
---|
[3848e0e] | 95 | |
---|
[b87a5ed] | 96 | if ( initializer != 0 ) { |
---|
[59db689] | 97 | os << endl << string( indent + 2, ' ' ) << "with initializer "; |
---|
[b87a5ed] | 98 | initializer->printOneLine( os ); |
---|
[68cd1ce] | 99 | } // if |
---|
[3848e0e] | 100 | |
---|
[b87a5ed] | 101 | os << endl; |
---|
[51b7345] | 102 | } |
---|
| 103 | |
---|
[3848e0e] | 104 | void DeclarationNode::printList( std::ostream &os, int indent ) const { |
---|
[b87a5ed] | 105 | ParseNode::printList( os, indent ); |
---|
| 106 | if ( hasEllipsis ) { |
---|
| 107 | os << string( indent, ' ' ) << "and a variable number of other arguments" << endl; |
---|
[68cd1ce] | 108 | } // if |
---|
[51b7345] | 109 | } |
---|
| 110 | |
---|
[d9a0e76] | 111 | DeclarationNode *DeclarationNode::newFunction( std::string *name, DeclarationNode *ret, DeclarationNode *param, StatementNode *body, bool newStyle ) { |
---|
[b87a5ed] | 112 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 113 | newnode->name = assign_strptr( name ); |
---|
[3848e0e] | 114 | |
---|
[b87a5ed] | 115 | newnode->type = new TypeData( TypeData::Function ); |
---|
| 116 | newnode->type->function->params = param; |
---|
| 117 | newnode->type->function->newStyle = newStyle; |
---|
| 118 | newnode->type->function->body = body; |
---|
[3848e0e] | 119 | |
---|
[b87a5ed] | 120 | if ( body ) { |
---|
| 121 | newnode->type->function->hasBody = true; |
---|
[68cd1ce] | 122 | } // if |
---|
[51b7345] | 123 | |
---|
[b87a5ed] | 124 | if ( ret ) { |
---|
| 125 | newnode->type->base = ret->type; |
---|
| 126 | ret->type = 0; |
---|
| 127 | delete ret; |
---|
[68cd1ce] | 128 | } // if |
---|
[51b7345] | 129 | |
---|
[b87a5ed] | 130 | return newnode; |
---|
[3848e0e] | 131 | } |
---|
| 132 | |
---|
| 133 | DeclarationNode *DeclarationNode::newQualifier( Qualifier q ) { |
---|
[b87a5ed] | 134 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 135 | newnode->type = new TypeData(); |
---|
| 136 | newnode->type->qualifiers.push_back( q ); |
---|
| 137 | return newnode; |
---|
[3848e0e] | 138 | } |
---|
| 139 | |
---|
[68cd1ce] | 140 | DeclarationNode *DeclarationNode::newStorageClass( DeclarationNode::StorageClass sc ) { |
---|
[b87a5ed] | 141 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 142 | newnode->storageClasses.push_back( sc ); |
---|
| 143 | return newnode; |
---|
[3848e0e] | 144 | } |
---|
| 145 | |
---|
| 146 | DeclarationNode *DeclarationNode::newBasicType( BasicType bt ) { |
---|
[b87a5ed] | 147 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 148 | newnode->type = new TypeData( TypeData::Basic ); |
---|
| 149 | newnode->type->basic->typeSpec.push_back( bt ); |
---|
| 150 | return newnode; |
---|
[3848e0e] | 151 | } |
---|
| 152 | |
---|
[90c3b1c] | 153 | DeclarationNode *DeclarationNode::newBuiltinType( BuiltinType bt ) { |
---|
| 154 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 155 | newnode->type = new TypeData( TypeData::Builtin ); |
---|
| 156 | newnode->type->builtin->type = bt; |
---|
| 157 | return newnode; |
---|
| 158 | } |
---|
| 159 | |
---|
[3848e0e] | 160 | DeclarationNode *DeclarationNode::newModifier( Modifier mod ) { |
---|
[b87a5ed] | 161 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 162 | newnode->type = new TypeData( TypeData::Basic ); |
---|
| 163 | newnode->type->basic->modifiers.push_back( mod ); |
---|
| 164 | return newnode; |
---|
[3848e0e] | 165 | } |
---|
| 166 | |
---|
[59db689] | 167 | DeclarationNode *DeclarationNode::newForall( DeclarationNode *forall ) { |
---|
[b87a5ed] | 168 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 169 | newnode->type = new TypeData( TypeData::Unknown ); |
---|
| 170 | newnode->type->forall = forall; |
---|
| 171 | return newnode; |
---|
[3848e0e] | 172 | } |
---|
| 173 | |
---|
[59db689] | 174 | DeclarationNode *DeclarationNode::newFromTypedef( std::string *name ) { |
---|
[b87a5ed] | 175 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 176 | newnode->type = new TypeData( TypeData::SymbolicInst ); |
---|
| 177 | newnode->type->symbolic->name = assign_strptr( name ); |
---|
| 178 | newnode->type->symbolic->isTypedef = true; |
---|
| 179 | newnode->type->symbolic->params = 0; |
---|
| 180 | return newnode; |
---|
[3848e0e] | 181 | } |
---|
| 182 | |
---|
[2871210] | 183 | DeclarationNode *DeclarationNode::newAggregate( Aggregate kind, const std::string *name, ExpressionNode *actuals, DeclarationNode *fields ) { |
---|
[b87a5ed] | 184 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 185 | newnode->type = new TypeData( TypeData::Aggregate ); |
---|
| 186 | newnode->type->aggregate->kind = kind; |
---|
| 187 | newnode->type->aggregate->name = assign_strptr( name ); |
---|
[2871210] | 188 | if ( newnode->type->aggregate->name == "" ) { // anonymous aggregate ? |
---|
[b87a5ed] | 189 | newnode->type->aggregate->name = DeclarationNode::anonymous.newName(); |
---|
[2871210] | 190 | } else { |
---|
| 191 | // SKULLDUGGERY: generate a typedef for the aggregate name so that the aggregate does not have to be qualified |
---|
| 192 | // by "struct" |
---|
| 193 | typedefTable.addToEnclosingScope( newnode->type->aggregate->name, TypedefTable::TD ); |
---|
| 194 | DeclarationNode *typedf = new DeclarationNode; |
---|
| 195 | typedf->name = newnode->type->aggregate->name; |
---|
| 196 | newnode->appendList( typedf->addType( newnode->clone() )->addTypedef() ); |
---|
[68cd1ce] | 197 | } // if |
---|
[b87a5ed] | 198 | newnode->type->aggregate->actuals = actuals; |
---|
[721f17a] | 199 | newnode->type->aggregate->fields = fields; |
---|
[b87a5ed] | 200 | return newnode; |
---|
[3848e0e] | 201 | } |
---|
| 202 | |
---|
| 203 | DeclarationNode *DeclarationNode::newEnum( std::string *name, DeclarationNode *constants ) { |
---|
[b87a5ed] | 204 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 205 | newnode->name = assign_strptr( name ); |
---|
| 206 | newnode->type = new TypeData( TypeData::Enum ); |
---|
| 207 | newnode->type->enumeration->name = newnode->name; |
---|
[2871210] | 208 | if ( newnode->type->enumeration->name == "" ) { // anonymous enumeration ? |
---|
[b87a5ed] | 209 | newnode->type->enumeration->name = DeclarationNode::anonymous.newName(); |
---|
[2871210] | 210 | } else { |
---|
| 211 | // SKULLDUGGERY: generate a typedef for the enumeration name so that the enumeration does not have to be |
---|
| 212 | // qualified by "enum" |
---|
| 213 | typedefTable.addToEnclosingScope( newnode->type->enumeration->name, TypedefTable::TD ); |
---|
| 214 | DeclarationNode *typedf = new DeclarationNode; |
---|
| 215 | typedf->name = newnode->type->enumeration->name; |
---|
| 216 | newnode->appendList( typedf->addType( newnode->clone() )->addTypedef() ); |
---|
[68cd1ce] | 217 | } // if |
---|
[b87a5ed] | 218 | newnode->type->enumeration->constants = constants; |
---|
| 219 | return newnode; |
---|
[3848e0e] | 220 | } |
---|
| 221 | |
---|
[59db689] | 222 | DeclarationNode *DeclarationNode::newEnumConstant( std::string *name, ExpressionNode *constant ) { |
---|
[b87a5ed] | 223 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 224 | newnode->name = assign_strptr( name ); |
---|
[90c3b1c] | 225 | newnode->enumeratorValue = constant; |
---|
[b87a5ed] | 226 | return newnode; |
---|
[3848e0e] | 227 | } |
---|
| 228 | |
---|
[59db689] | 229 | DeclarationNode *DeclarationNode::newName( std::string *name ) { |
---|
[b87a5ed] | 230 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 231 | newnode->name = assign_strptr( name ); |
---|
| 232 | return newnode; |
---|
[3848e0e] | 233 | } |
---|
| 234 | |
---|
[59db689] | 235 | DeclarationNode *DeclarationNode::newFromTypeGen( std::string *name, ExpressionNode *params ) { |
---|
[b87a5ed] | 236 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 237 | newnode->type = new TypeData( TypeData::SymbolicInst ); |
---|
| 238 | newnode->type->symbolic->name = assign_strptr( name ); |
---|
| 239 | newnode->type->symbolic->isTypedef = false; |
---|
| 240 | newnode->type->symbolic->actuals = params; |
---|
| 241 | return newnode; |
---|
[3848e0e] | 242 | } |
---|
| 243 | |
---|
[59db689] | 244 | DeclarationNode *DeclarationNode::newTypeParam( TypeClass tc, std::string *name ) { |
---|
[b87a5ed] | 245 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 246 | newnode->name = assign_strptr( name ); |
---|
| 247 | newnode->type = new TypeData( TypeData::Variable ); |
---|
| 248 | newnode->type->variable->tyClass = tc; |
---|
| 249 | newnode->type->variable->name = newnode->name; |
---|
| 250 | return newnode; |
---|
[3848e0e] | 251 | } |
---|
| 252 | |
---|
[4040425] | 253 | DeclarationNode *DeclarationNode::newTrait( std::string *name, DeclarationNode *params, DeclarationNode *asserts ) { |
---|
[b87a5ed] | 254 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 255 | newnode->type = new TypeData( TypeData::Aggregate ); |
---|
[4040425] | 256 | newnode->type->aggregate->kind = Trait; |
---|
[b87a5ed] | 257 | newnode->type->aggregate->params = params; |
---|
[721f17a] | 258 | newnode->type->aggregate->fields = asserts; |
---|
[b87a5ed] | 259 | newnode->type->aggregate->name = assign_strptr( name ); |
---|
| 260 | return newnode; |
---|
[3848e0e] | 261 | } |
---|
| 262 | |
---|
[4040425] | 263 | DeclarationNode *DeclarationNode::newTraitUse( std::string *name, ExpressionNode *params ) { |
---|
[b87a5ed] | 264 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 265 | newnode->type = new TypeData( TypeData::AggregateInst ); |
---|
| 266 | newnode->type->aggInst->aggregate = new TypeData( TypeData::Aggregate ); |
---|
[4040425] | 267 | newnode->type->aggInst->aggregate->aggregate->kind = Trait; |
---|
[b87a5ed] | 268 | newnode->type->aggInst->aggregate->aggregate->name = assign_strptr( name ); |
---|
| 269 | newnode->type->aggInst->params = params; |
---|
| 270 | return newnode; |
---|
[3848e0e] | 271 | } |
---|
| 272 | |
---|
| 273 | DeclarationNode *DeclarationNode::newTypeDecl( std::string *name, DeclarationNode *typeParams ) { |
---|
[b87a5ed] | 274 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 275 | newnode->name = assign_strptr( name ); |
---|
| 276 | newnode->type = new TypeData( TypeData::Symbolic ); |
---|
| 277 | newnode->type->symbolic->isTypedef = false; |
---|
| 278 | newnode->type->symbolic->params = typeParams; |
---|
| 279 | newnode->type->symbolic->name = newnode->name; |
---|
| 280 | return newnode; |
---|
[3848e0e] | 281 | } |
---|
| 282 | |
---|
| 283 | DeclarationNode *DeclarationNode::newPointer( DeclarationNode *qualifiers ) { |
---|
[b87a5ed] | 284 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 285 | newnode->type = new TypeData( TypeData::Pointer ); |
---|
| 286 | return newnode->addQualifiers( qualifiers ); |
---|
[3848e0e] | 287 | } |
---|
| 288 | |
---|
| 289 | DeclarationNode *DeclarationNode::newArray( ExpressionNode *size, DeclarationNode *qualifiers, bool isStatic ) { |
---|
[b87a5ed] | 290 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 291 | newnode->type = new TypeData( TypeData::Array ); |
---|
| 292 | newnode->type->array->dimension = size; |
---|
| 293 | newnode->type->array->isStatic = isStatic; |
---|
[71bd8c6] | 294 | if ( newnode->type->array->dimension == 0 || dynamic_cast<ConstantNode *>( newnode->type->array->dimension ) ) { |
---|
| 295 | newnode->type->array->isVarLen = false; |
---|
| 296 | } else { |
---|
| 297 | newnode->type->array->isVarLen = true; |
---|
| 298 | } // if |
---|
[b87a5ed] | 299 | return newnode->addQualifiers( qualifiers ); |
---|
[3848e0e] | 300 | } |
---|
| 301 | |
---|
| 302 | DeclarationNode *DeclarationNode::newVarArray( DeclarationNode *qualifiers ) { |
---|
[b87a5ed] | 303 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 304 | newnode->type = new TypeData( TypeData::Array ); |
---|
| 305 | newnode->type->array->dimension = 0; |
---|
| 306 | newnode->type->array->isStatic = false; |
---|
| 307 | newnode->type->array->isVarLen = true; |
---|
| 308 | return newnode->addQualifiers( qualifiers ); |
---|
[3848e0e] | 309 | } |
---|
| 310 | |
---|
| 311 | DeclarationNode *DeclarationNode::newBitfield( ExpressionNode *size ) { |
---|
[b87a5ed] | 312 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 313 | newnode->bitfieldWidth = size; |
---|
| 314 | return newnode; |
---|
[3848e0e] | 315 | } |
---|
| 316 | |
---|
| 317 | DeclarationNode *DeclarationNode::newTuple( DeclarationNode *members ) { |
---|
[b87a5ed] | 318 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 319 | newnode->type = new TypeData( TypeData::Tuple ); |
---|
| 320 | newnode->type->tuple->members = members; |
---|
| 321 | return newnode; |
---|
[3848e0e] | 322 | } |
---|
| 323 | |
---|
| 324 | DeclarationNode *DeclarationNode::newTypeof( ExpressionNode *expr ) { |
---|
[b87a5ed] | 325 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 326 | newnode->type = new TypeData( TypeData::Typeof ); |
---|
| 327 | newnode->type->typeexpr->expr = expr; |
---|
| 328 | return newnode; |
---|
[3848e0e] | 329 | } |
---|
| 330 | |
---|
| 331 | DeclarationNode *DeclarationNode::newAttr( std::string *name, ExpressionNode *expr ) { |
---|
[b87a5ed] | 332 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 333 | newnode->type = new TypeData( TypeData::Attr ); |
---|
| 334 | newnode->type->attr->name = assign_strptr( name ); |
---|
| 335 | newnode->type->attr->expr = expr; |
---|
| 336 | return newnode; |
---|
[3848e0e] | 337 | } |
---|
| 338 | |
---|
| 339 | DeclarationNode *DeclarationNode::newAttr( std::string *name, DeclarationNode *type ) { |
---|
[b87a5ed] | 340 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 341 | newnode->type = new TypeData( TypeData::Attr ); |
---|
| 342 | newnode->type->attr->name = assign_strptr( name ); |
---|
| 343 | newnode->type->attr->type = type; |
---|
| 344 | return newnode; |
---|
[3848e0e] | 345 | } |
---|
| 346 | |
---|
| 347 | static void addQualifiersToType( TypeData *&src, TypeData *dst ) { |
---|
[b87a5ed] | 348 | if ( src && dst ) { |
---|
| 349 | if ( src->forall && dst->kind == TypeData::Function ) { |
---|
| 350 | if ( dst->forall ) { |
---|
| 351 | dst->forall->appendList( src->forall ); |
---|
| 352 | } else { |
---|
| 353 | dst->forall = src->forall; |
---|
[68cd1ce] | 354 | } // if |
---|
[b87a5ed] | 355 | src->forall = 0; |
---|
[68cd1ce] | 356 | } // if |
---|
[b87a5ed] | 357 | if ( dst->base ) { |
---|
| 358 | addQualifiersToType( src, dst->base ); |
---|
| 359 | } else if ( dst->kind == TypeData::Function ) { |
---|
| 360 | dst->base = src; |
---|
| 361 | src = 0; |
---|
| 362 | } else { |
---|
| 363 | dst->qualifiers.splice( dst->qualifiers.end(), src->qualifiers ); |
---|
[68cd1ce] | 364 | } // if |
---|
| 365 | } // if |
---|
[3848e0e] | 366 | } |
---|
[b87a5ed] | 367 | |
---|
[3848e0e] | 368 | DeclarationNode *DeclarationNode::addQualifiers( DeclarationNode *q ) { |
---|
[b87a5ed] | 369 | if ( q ) { |
---|
| 370 | storageClasses.splice( storageClasses.end(), q->storageClasses ); |
---|
| 371 | if ( q->type ) { |
---|
| 372 | if ( ! type ) { |
---|
| 373 | type = new TypeData; |
---|
[68cd1ce] | 374 | } // if |
---|
[b87a5ed] | 375 | addQualifiersToType( q->type, type ); |
---|
| 376 | if ( q->type && q->type->forall ) { |
---|
| 377 | if ( type->forall ) { |
---|
| 378 | type->forall->appendList( q->type->forall ); |
---|
| 379 | } else { |
---|
[68cd1ce] | 380 | if ( type->kind == TypeData::Aggregate ) { |
---|
| 381 | type->aggregate->params = q->type->forall; |
---|
[721f17a] | 382 | // change implicit typedef from TYPEDEFname to TYPEGENname |
---|
| 383 | typedefTable.changeKind( type->aggregate->name, TypedefTable::TG ); |
---|
[68cd1ce] | 384 | } else { |
---|
| 385 | type->forall = q->type->forall; |
---|
| 386 | } // if |
---|
| 387 | } // if |
---|
[b87a5ed] | 388 | q->type->forall = 0; |
---|
[68cd1ce] | 389 | } // if |
---|
| 390 | } // if |
---|
| 391 | } // if |
---|
[b87a5ed] | 392 | delete q; |
---|
| 393 | return this; |
---|
[3848e0e] | 394 | } |
---|
| 395 | |
---|
| 396 | DeclarationNode *DeclarationNode::copyStorageClasses( DeclarationNode *q ) { |
---|
[b87a5ed] | 397 | storageClasses = q->storageClasses; |
---|
| 398 | return this; |
---|
[3848e0e] | 399 | } |
---|
| 400 | |
---|
| 401 | static void addTypeToType( TypeData *&src, TypeData *&dst ) { |
---|
[b87a5ed] | 402 | if ( src && dst ) { |
---|
| 403 | if ( src->forall && dst->kind == TypeData::Function ) { |
---|
| 404 | if ( dst->forall ) { |
---|
| 405 | dst->forall->appendList( src->forall ); |
---|
| 406 | } else { |
---|
| 407 | dst->forall = src->forall; |
---|
[68cd1ce] | 408 | } // if |
---|
[b87a5ed] | 409 | src->forall = 0; |
---|
[68cd1ce] | 410 | } // if |
---|
[b87a5ed] | 411 | if ( dst->base ) { |
---|
| 412 | addTypeToType( src, dst->base ); |
---|
| 413 | } else { |
---|
| 414 | switch ( dst->kind ) { |
---|
| 415 | case TypeData::Unknown: |
---|
| 416 | src->qualifiers.splice( src->qualifiers.end(), dst->qualifiers ); |
---|
| 417 | dst = src; |
---|
| 418 | src = 0; |
---|
| 419 | break; |
---|
| 420 | case TypeData::Basic: |
---|
| 421 | dst->qualifiers.splice( dst->qualifiers.end(), src->qualifiers ); |
---|
| 422 | if ( src->kind != TypeData::Unknown ) { |
---|
| 423 | assert( src->kind == TypeData::Basic ); |
---|
| 424 | dst->basic->modifiers.splice( dst->basic->modifiers.end(), src->basic->modifiers ); |
---|
| 425 | dst->basic->typeSpec.splice( dst->basic->typeSpec.end(), src->basic->typeSpec ); |
---|
[68cd1ce] | 426 | } // if |
---|
[b87a5ed] | 427 | break; |
---|
| 428 | default: |
---|
| 429 | switch ( src->kind ) { |
---|
| 430 | case TypeData::Aggregate: |
---|
| 431 | case TypeData::Enum: |
---|
| 432 | dst->base = new TypeData( TypeData::AggregateInst ); |
---|
| 433 | dst->base->aggInst->aggregate = src; |
---|
| 434 | if ( src->kind == TypeData::Aggregate ) { |
---|
| 435 | dst->base->aggInst->params = maybeClone( src->aggregate->actuals ); |
---|
[68cd1ce] | 436 | } // if |
---|
[b87a5ed] | 437 | dst->base->qualifiers.splice( dst->base->qualifiers.end(), src->qualifiers ); |
---|
| 438 | src = 0; |
---|
| 439 | break; |
---|
| 440 | default: |
---|
| 441 | if ( dst->forall ) { |
---|
| 442 | dst->forall->appendList( src->forall ); |
---|
| 443 | } else { |
---|
| 444 | dst->forall = src->forall; |
---|
[68cd1ce] | 445 | } // if |
---|
[b87a5ed] | 446 | src->forall = 0; |
---|
| 447 | dst->base = src; |
---|
| 448 | src = 0; |
---|
[68cd1ce] | 449 | } // switch |
---|
| 450 | } // switch |
---|
| 451 | } // if |
---|
| 452 | } // if |
---|
[3848e0e] | 453 | } |
---|
| 454 | |
---|
| 455 | DeclarationNode *DeclarationNode::addType( DeclarationNode *o ) { |
---|
[b87a5ed] | 456 | if ( o ) { |
---|
| 457 | storageClasses.splice( storageClasses.end(), o->storageClasses ); |
---|
| 458 | if ( o->type ) { |
---|
| 459 | if ( ! type ) { |
---|
| 460 | if ( o->type->kind == TypeData::Aggregate || o->type->kind == TypeData::Enum ) { |
---|
| 461 | type = new TypeData( TypeData::AggregateInst ); |
---|
| 462 | type->aggInst->aggregate = o->type; |
---|
| 463 | if ( o->type->kind == TypeData::Aggregate ) { |
---|
| 464 | type->aggInst->params = maybeClone( o->type->aggregate->actuals ); |
---|
[68cd1ce] | 465 | } // if |
---|
[b87a5ed] | 466 | type->qualifiers.splice( type->qualifiers.end(), o->type->qualifiers ); |
---|
| 467 | } else { |
---|
| 468 | type = o->type; |
---|
[68cd1ce] | 469 | } // if |
---|
[b87a5ed] | 470 | o->type = 0; |
---|
| 471 | } else { |
---|
| 472 | addTypeToType( o->type, type ); |
---|
[68cd1ce] | 473 | } // if |
---|
| 474 | } // if |
---|
[b87a5ed] | 475 | if ( o->bitfieldWidth ) { |
---|
| 476 | bitfieldWidth = o->bitfieldWidth; |
---|
[68cd1ce] | 477 | } // if |
---|
[71bd8c6] | 478 | |
---|
| 479 | // there may be typedefs chained onto the type |
---|
| 480 | if ( o->get_link() ) { |
---|
| 481 | set_link( o->get_link()->clone() ); |
---|
[1db21619] | 482 | } // if |
---|
[68cd1ce] | 483 | } // if |
---|
[b87a5ed] | 484 | delete o; |
---|
| 485 | return this; |
---|
[3848e0e] | 486 | } |
---|
| 487 | |
---|
| 488 | DeclarationNode *DeclarationNode::addTypedef() { |
---|
[b87a5ed] | 489 | TypeData *newtype = new TypeData( TypeData::Symbolic ); |
---|
| 490 | newtype->symbolic->params = 0; |
---|
| 491 | newtype->symbolic->isTypedef = true; |
---|
| 492 | newtype->symbolic->name = name; |
---|
| 493 | newtype->base = type; |
---|
| 494 | type = newtype; |
---|
| 495 | return this; |
---|
[3848e0e] | 496 | } |
---|
| 497 | |
---|
[59db689] | 498 | DeclarationNode *DeclarationNode::addAssertions( DeclarationNode *assertions ) { |
---|
[b87a5ed] | 499 | assert( type ); |
---|
| 500 | switch ( type->kind ) { |
---|
| 501 | case TypeData::Symbolic: |
---|
| 502 | if ( type->symbolic->assertions ) { |
---|
| 503 | type->symbolic->assertions->appendList( assertions ); |
---|
| 504 | } else { |
---|
| 505 | type->symbolic->assertions = assertions; |
---|
[68cd1ce] | 506 | } // if |
---|
[b87a5ed] | 507 | break; |
---|
| 508 | case TypeData::Variable: |
---|
| 509 | if ( type->variable->assertions ) { |
---|
| 510 | type->variable->assertions->appendList( assertions ); |
---|
| 511 | } else { |
---|
| 512 | type->variable->assertions = assertions; |
---|
[68cd1ce] | 513 | } // if |
---|
[b87a5ed] | 514 | break; |
---|
| 515 | default: |
---|
| 516 | assert( false ); |
---|
[68cd1ce] | 517 | } // switch |
---|
[b87a5ed] | 518 | |
---|
| 519 | return this; |
---|
[51b7345] | 520 | } |
---|
| 521 | |
---|
[59db689] | 522 | DeclarationNode *DeclarationNode::addName( std::string *newname ) { |
---|
[b87a5ed] | 523 | name = assign_strptr( newname ); |
---|
| 524 | return this; |
---|
[51b7345] | 525 | } |
---|
| 526 | |
---|
[3848e0e] | 527 | DeclarationNode *DeclarationNode::addBitfield( ExpressionNode *size ) { |
---|
[b87a5ed] | 528 | bitfieldWidth = size; |
---|
| 529 | return this; |
---|
[51b7345] | 530 | } |
---|
| 531 | |
---|
[3848e0e] | 532 | DeclarationNode *DeclarationNode::addVarArgs() { |
---|
[b87a5ed] | 533 | assert( type ); |
---|
| 534 | hasEllipsis = true; |
---|
| 535 | return this; |
---|
[51b7345] | 536 | } |
---|
| 537 | |
---|
[3848e0e] | 538 | DeclarationNode *DeclarationNode::addFunctionBody( StatementNode *body ) { |
---|
[b87a5ed] | 539 | assert( type ); |
---|
| 540 | assert( type->kind == TypeData::Function ); |
---|
| 541 | assert( type->function->body == 0 ); |
---|
| 542 | type->function->body = body; |
---|
| 543 | type->function->hasBody = true; |
---|
| 544 | return this; |
---|
[51b7345] | 545 | } |
---|
| 546 | |
---|
[3848e0e] | 547 | DeclarationNode *DeclarationNode::addOldDeclList( DeclarationNode *list ) { |
---|
[b87a5ed] | 548 | assert( type ); |
---|
| 549 | assert( type->kind == TypeData::Function ); |
---|
| 550 | assert( type->function->oldDeclList == 0 ); |
---|
| 551 | type->function->oldDeclList = list; |
---|
| 552 | return this; |
---|
[51b7345] | 553 | } |
---|
| 554 | |
---|
[68cd1ce] | 555 | static void setBase( TypeData *&type, TypeData *newType ) { |
---|
[b87a5ed] | 556 | if ( type ) { |
---|
| 557 | TypeData *prevBase = type; |
---|
| 558 | TypeData *curBase = type->base; |
---|
[a32b204] | 559 | while ( curBase != 0 ) { |
---|
[b87a5ed] | 560 | prevBase = curBase; |
---|
| 561 | curBase = curBase->base; |
---|
[68cd1ce] | 562 | } // while |
---|
[b87a5ed] | 563 | prevBase->base = newType; |
---|
| 564 | } else { |
---|
| 565 | type = newType; |
---|
[68cd1ce] | 566 | } // if |
---|
[3848e0e] | 567 | } |
---|
| 568 | |
---|
| 569 | DeclarationNode *DeclarationNode::addPointer( DeclarationNode *p ) { |
---|
[b87a5ed] | 570 | if ( p ) { |
---|
| 571 | assert( p->type->kind == TypeData::Pointer ); |
---|
| 572 | setBase( type, p->type ); |
---|
| 573 | p->type = 0; |
---|
| 574 | delete p; |
---|
[68cd1ce] | 575 | } // if |
---|
[b87a5ed] | 576 | return this; |
---|
[3848e0e] | 577 | } |
---|
| 578 | |
---|
| 579 | DeclarationNode *DeclarationNode::addArray( DeclarationNode *a ) { |
---|
[b87a5ed] | 580 | if ( a ) { |
---|
| 581 | assert( a->type->kind == TypeData::Array ); |
---|
| 582 | setBase( type, a->type ); |
---|
| 583 | a->type = 0; |
---|
| 584 | delete a; |
---|
[68cd1ce] | 585 | } // if |
---|
[b87a5ed] | 586 | return this; |
---|
[51b7345] | 587 | } |
---|
| 588 | |
---|
[3848e0e] | 589 | DeclarationNode *DeclarationNode::addNewPointer( DeclarationNode *p ) { |
---|
[b87a5ed] | 590 | if ( p ) { |
---|
| 591 | assert( p->type->kind == TypeData::Pointer ); |
---|
| 592 | if ( type ) { |
---|
| 593 | switch ( type->kind ) { |
---|
| 594 | case TypeData::Aggregate: |
---|
| 595 | case TypeData::Enum: |
---|
| 596 | p->type->base = new TypeData( TypeData::AggregateInst ); |
---|
| 597 | p->type->base->aggInst->aggregate = type; |
---|
| 598 | if ( type->kind == TypeData::Aggregate ) { |
---|
| 599 | p->type->base->aggInst->params = maybeClone( type->aggregate->actuals ); |
---|
[68cd1ce] | 600 | } // if |
---|
[b87a5ed] | 601 | p->type->base->qualifiers.splice( p->type->base->qualifiers.end(), type->qualifiers ); |
---|
| 602 | break; |
---|
| 603 | |
---|
| 604 | default: |
---|
| 605 | p->type->base = type; |
---|
[68cd1ce] | 606 | } // switch |
---|
[b87a5ed] | 607 | type = 0; |
---|
[68cd1ce] | 608 | } // if |
---|
[b87a5ed] | 609 | delete this; |
---|
| 610 | return p; |
---|
| 611 | } else { |
---|
| 612 | return this; |
---|
[68cd1ce] | 613 | } // if |
---|
[51b7345] | 614 | } |
---|
| 615 | |
---|
[3848e0e] | 616 | static TypeData *findLast( TypeData *a ) { |
---|
[b87a5ed] | 617 | assert( a ); |
---|
| 618 | TypeData *cur = a; |
---|
[a32b204] | 619 | while ( cur->base ) { |
---|
[b87a5ed] | 620 | cur = cur->base; |
---|
[68cd1ce] | 621 | } // while |
---|
[b87a5ed] | 622 | return cur; |
---|
[3848e0e] | 623 | } |
---|
| 624 | |
---|
| 625 | DeclarationNode *DeclarationNode::addNewArray( DeclarationNode *a ) { |
---|
[b87a5ed] | 626 | if ( a ) { |
---|
| 627 | assert( a->type->kind == TypeData::Array ); |
---|
| 628 | TypeData *lastArray = findLast( a->type ); |
---|
| 629 | if ( type ) { |
---|
| 630 | switch ( type->kind ) { |
---|
| 631 | case TypeData::Aggregate: |
---|
| 632 | case TypeData::Enum: |
---|
| 633 | lastArray->base = new TypeData( TypeData::AggregateInst ); |
---|
| 634 | lastArray->base->aggInst->aggregate = type; |
---|
| 635 | if ( type->kind == TypeData::Aggregate ) { |
---|
| 636 | lastArray->base->aggInst->params = maybeClone( type->aggregate->actuals ); |
---|
[68cd1ce] | 637 | } // if |
---|
[b87a5ed] | 638 | lastArray->base->qualifiers.splice( lastArray->base->qualifiers.end(), type->qualifiers ); |
---|
| 639 | break; |
---|
| 640 | default: |
---|
| 641 | lastArray->base = type; |
---|
[68cd1ce] | 642 | } // switch |
---|
[b87a5ed] | 643 | type = 0; |
---|
[68cd1ce] | 644 | } // if |
---|
[b87a5ed] | 645 | delete this; |
---|
| 646 | return a; |
---|
| 647 | } else { |
---|
| 648 | return this; |
---|
[68cd1ce] | 649 | } // if |
---|
[51b7345] | 650 | } |
---|
[3848e0e] | 651 | |
---|
| 652 | DeclarationNode *DeclarationNode::addParamList( DeclarationNode *params ) { |
---|
[b87a5ed] | 653 | TypeData *ftype = new TypeData( TypeData::Function ); |
---|
| 654 | ftype->function->params = params; |
---|
| 655 | setBase( type, ftype ); |
---|
| 656 | return this; |
---|
[3848e0e] | 657 | } |
---|
| 658 | |
---|
| 659 | static TypeData *addIdListToType( TypeData *type, DeclarationNode *ids ) { |
---|
[b87a5ed] | 660 | if ( type ) { |
---|
| 661 | if ( type->kind != TypeData::Function ) { |
---|
| 662 | type->base = addIdListToType( type->base, ids ); |
---|
| 663 | } else { |
---|
| 664 | type->function->idList = ids; |
---|
[68cd1ce] | 665 | } // if |
---|
[b87a5ed] | 666 | return type; |
---|
[3848e0e] | 667 | } else { |
---|
[b87a5ed] | 668 | TypeData *newtype = new TypeData( TypeData::Function ); |
---|
| 669 | newtype->function->idList = ids; |
---|
| 670 | return newtype; |
---|
[68cd1ce] | 671 | } // if |
---|
[3848e0e] | 672 | } |
---|
[b87a5ed] | 673 | |
---|
[3848e0e] | 674 | DeclarationNode *DeclarationNode::addIdList( DeclarationNode *ids ) { |
---|
[b87a5ed] | 675 | type = addIdListToType( type, ids ); |
---|
| 676 | return this; |
---|
[3848e0e] | 677 | } |
---|
| 678 | |
---|
| 679 | DeclarationNode *DeclarationNode::addInitializer( InitializerNode *init ) { |
---|
[b87a5ed] | 680 | //assert |
---|
| 681 | initializer = init; |
---|
| 682 | return this; |
---|
[3848e0e] | 683 | } |
---|
| 684 | |
---|
| 685 | DeclarationNode *DeclarationNode::cloneBaseType( string *newName ) { |
---|
[b87a5ed] | 686 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 687 | TypeData *srcType = type; |
---|
[a32b204] | 688 | while ( srcType->base ) { |
---|
[b87a5ed] | 689 | srcType = srcType->base; |
---|
[68cd1ce] | 690 | } // while |
---|
[b87a5ed] | 691 | newnode->type = maybeClone( srcType ); |
---|
| 692 | if ( newnode->type->kind == TypeData::AggregateInst ) { |
---|
| 693 | // don't duplicate members |
---|
| 694 | if ( newnode->type->aggInst->aggregate->kind == TypeData::Enum ) { |
---|
| 695 | delete newnode->type->aggInst->aggregate->enumeration->constants; |
---|
| 696 | newnode->type->aggInst->aggregate->enumeration->constants = 0; |
---|
| 697 | } else { |
---|
| 698 | assert( newnode->type->aggInst->aggregate->kind == TypeData::Aggregate ); |
---|
[721f17a] | 699 | delete newnode->type->aggInst->aggregate->aggregate->fields; |
---|
| 700 | newnode->type->aggInst->aggregate->aggregate->fields = 0; |
---|
[68cd1ce] | 701 | } // if |
---|
| 702 | } // if |
---|
[b87a5ed] | 703 | newnode->type->forall = maybeClone( type->forall ); |
---|
| 704 | newnode->storageClasses = storageClasses; |
---|
| 705 | newnode->name = assign_strptr( newName ); |
---|
| 706 | return newnode; |
---|
[3848e0e] | 707 | } |
---|
| 708 | |
---|
| 709 | DeclarationNode *DeclarationNode::cloneBaseType( DeclarationNode *o ) { |
---|
[b87a5ed] | 710 | if ( o ) { |
---|
| 711 | o->storageClasses.insert( o->storageClasses.end(), storageClasses.begin(), storageClasses.end() ); |
---|
| 712 | if ( type ) { |
---|
| 713 | TypeData *srcType = type; |
---|
[a32b204] | 714 | while ( srcType->base ) { |
---|
[b87a5ed] | 715 | srcType = srcType->base; |
---|
[68cd1ce] | 716 | } // while |
---|
[b87a5ed] | 717 | TypeData *newType = srcType->clone(); |
---|
| 718 | if ( newType->kind == TypeData::AggregateInst ) { |
---|
| 719 | // don't duplicate members |
---|
| 720 | if ( newType->aggInst->aggregate->kind == TypeData::Enum ) { |
---|
| 721 | delete newType->aggInst->aggregate->enumeration->constants; |
---|
| 722 | newType->aggInst->aggregate->enumeration->constants = 0; |
---|
| 723 | } else { |
---|
| 724 | assert( newType->aggInst->aggregate->kind == TypeData::Aggregate ); |
---|
[721f17a] | 725 | delete newType->aggInst->aggregate->aggregate->fields; |
---|
| 726 | newType->aggInst->aggregate->aggregate->fields = 0; |
---|
[68cd1ce] | 727 | } // if |
---|
| 728 | } // if |
---|
[b87a5ed] | 729 | newType->forall = maybeClone( type->forall ); |
---|
| 730 | if ( ! o->type ) { |
---|
| 731 | o->type = newType; |
---|
| 732 | } else { |
---|
| 733 | addTypeToType( newType, o->type ); |
---|
| 734 | delete newType; |
---|
[68cd1ce] | 735 | } // if |
---|
| 736 | } // if |
---|
| 737 | } // if |
---|
[b87a5ed] | 738 | return o; |
---|
[3848e0e] | 739 | } |
---|
| 740 | |
---|
| 741 | DeclarationNode *DeclarationNode::cloneType( string *newName ) { |
---|
[b87a5ed] | 742 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 743 | newnode->type = maybeClone( type ); |
---|
| 744 | newnode->storageClasses = storageClasses; |
---|
| 745 | newnode->name = assign_strptr( newName ); |
---|
| 746 | return newnode; |
---|
[3848e0e] | 747 | } |
---|
| 748 | |
---|
| 749 | DeclarationNode *DeclarationNode::cloneType( DeclarationNode *o ) { |
---|
[b87a5ed] | 750 | if ( o ) { |
---|
| 751 | o->storageClasses.insert( o->storageClasses.end(), storageClasses.begin(), storageClasses.end() ); |
---|
| 752 | if ( type ) { |
---|
| 753 | TypeData *newType = type->clone(); |
---|
| 754 | if ( ! o->type ) { |
---|
| 755 | o->type = newType; |
---|
| 756 | } else { |
---|
| 757 | addTypeToType( newType, o->type ); |
---|
| 758 | delete newType; |
---|
[68cd1ce] | 759 | } // if |
---|
| 760 | } // if |
---|
| 761 | } // if |
---|
[b87a5ed] | 762 | return o; |
---|
[51b7345] | 763 | } |
---|
| 764 | |
---|
[3848e0e] | 765 | DeclarationNode *DeclarationNode::appendList( DeclarationNode *node ) { |
---|
[b87a5ed] | 766 | if ( node != 0 ) { |
---|
| 767 | set_link( node ); |
---|
[68cd1ce] | 768 | } // if |
---|
[b87a5ed] | 769 | return this; |
---|
[51b7345] | 770 | } |
---|
| 771 | |
---|
[3848e0e] | 772 | DeclarationNode *DeclarationNode::extractAggregate() const { |
---|
[b87a5ed] | 773 | if ( type ) { |
---|
| 774 | TypeData *ret = type->extractAggregate(); |
---|
| 775 | if ( ret ) { |
---|
| 776 | DeclarationNode *newnode = new DeclarationNode; |
---|
| 777 | newnode->type = ret; |
---|
| 778 | return newnode; |
---|
[843054c2] | 779 | } // if |
---|
| 780 | } // if |
---|
| 781 | return 0; |
---|
[3848e0e] | 782 | } |
---|
| 783 | |
---|
[a61fea9a] | 784 | void buildList( const DeclarationNode *firstNode, std::list< Declaration * > &outputList ) { |
---|
[b87a5ed] | 785 | SemanticError errors; |
---|
[59db689] | 786 | std::back_insert_iterator< std::list< Declaration *> > out( outputList ); |
---|
[b87a5ed] | 787 | const DeclarationNode *cur = firstNode; |
---|
[a32b204] | 788 | while ( cur ) { |
---|
[b87a5ed] | 789 | try { |
---|
| 790 | if ( DeclarationNode *extr = cur->extractAggregate() ) { |
---|
| 791 | // handle the case where a structure declaration is contained within an object or type declaration |
---|
| 792 | Declaration *decl = extr->build(); |
---|
| 793 | if ( decl ) { |
---|
| 794 | *out++ = decl; |
---|
[843054c2] | 795 | } // if |
---|
| 796 | } // if |
---|
[b87a5ed] | 797 | Declaration *decl = cur->build(); |
---|
| 798 | if ( decl ) { |
---|
| 799 | *out++ = decl; |
---|
[843054c2] | 800 | } // if |
---|
[b87a5ed] | 801 | } catch( SemanticError &e ) { |
---|
| 802 | errors.append( e ); |
---|
[843054c2] | 803 | } // try |
---|
[90c3b1c] | 804 | cur = dynamic_cast<DeclarationNode *>( cur->get_link() ); |
---|
[843054c2] | 805 | } // while |
---|
[b87a5ed] | 806 | if ( ! errors.isEmpty() ) { |
---|
| 807 | throw errors; |
---|
[843054c2] | 808 | } // if |
---|
[3848e0e] | 809 | } |
---|
| 810 | |
---|
[59db689] | 811 | void buildList( const DeclarationNode *firstNode, std::list< DeclarationWithType *> &outputList ) { |
---|
[b87a5ed] | 812 | SemanticError errors; |
---|
[59db689] | 813 | std::back_insert_iterator< std::list< DeclarationWithType *> > out( outputList ); |
---|
[b87a5ed] | 814 | const DeclarationNode *cur = firstNode; |
---|
[a32b204] | 815 | while ( cur ) { |
---|
[b87a5ed] | 816 | try { |
---|
[3848e0e] | 817 | /// if ( DeclarationNode *extr = cur->extractAggregate() ) { |
---|
[51b7345] | 818 | /// // handle the case where a structure declaration is contained within an object or type |
---|
| 819 | /// // declaration |
---|
| 820 | /// Declaration *decl = extr->build(); |
---|
[3848e0e] | 821 | /// if ( decl ) { |
---|
| 822 | /// *out++ = decl; |
---|
[51b7345] | 823 | /// } |
---|
| 824 | /// } |
---|
[b87a5ed] | 825 | Declaration *decl = cur->build(); |
---|
| 826 | if ( decl ) { |
---|
[59db689] | 827 | if ( DeclarationWithType *dwt = dynamic_cast< DeclarationWithType *>( decl ) ) { |
---|
[b87a5ed] | 828 | *out++ = dwt; |
---|
[59db689] | 829 | } else if ( StructDecl *agg = dynamic_cast< StructDecl *>( decl ) ) { |
---|
[b87a5ed] | 830 | StructInstType *inst = new StructInstType( Type::Qualifiers(), agg->get_name() ); |
---|
[68cd1ce] | 831 | *out++ = new ObjectDecl( "", DeclarationNode::NoStorageClass, linkage, 0, inst, 0 ); |
---|
[b87a5ed] | 832 | delete agg; |
---|
[59db689] | 833 | } else if ( UnionDecl *agg = dynamic_cast< UnionDecl *>( decl ) ) { |
---|
[b87a5ed] | 834 | UnionInstType *inst = new UnionInstType( Type::Qualifiers(), agg->get_name() ); |
---|
[68cd1ce] | 835 | *out++ = new ObjectDecl( "", DeclarationNode::NoStorageClass, linkage, 0, inst, 0 ); |
---|
[843054c2] | 836 | } // if |
---|
| 837 | } // if |
---|
[b87a5ed] | 838 | } catch( SemanticError &e ) { |
---|
| 839 | errors.append( e ); |
---|
[843054c2] | 840 | } // try |
---|
[59db689] | 841 | cur = dynamic_cast< DeclarationNode *>( cur->get_link() ); |
---|
[843054c2] | 842 | } // while |
---|
[b87a5ed] | 843 | if ( ! errors.isEmpty() ) { |
---|
| 844 | throw errors; |
---|
[843054c2] | 845 | } // if |
---|
[3848e0e] | 846 | } |
---|
| 847 | |
---|
[59db689] | 848 | void buildTypeList( const DeclarationNode *firstNode, std::list< Type *> &outputList ) { |
---|
[b87a5ed] | 849 | SemanticError errors; |
---|
[59db689] | 850 | std::back_insert_iterator< std::list< Type *> > out( outputList ); |
---|
[b87a5ed] | 851 | const DeclarationNode *cur = firstNode; |
---|
[a32b204] | 852 | while ( cur ) { |
---|
[b87a5ed] | 853 | try { |
---|
| 854 | *out++ = cur->buildType(); |
---|
| 855 | } catch( SemanticError &e ) { |
---|
| 856 | errors.append( e ); |
---|
[843054c2] | 857 | } // try |
---|
[59db689] | 858 | cur = dynamic_cast< DeclarationNode *>( cur->get_link() ); |
---|
[843054c2] | 859 | } // while |
---|
[b87a5ed] | 860 | if ( ! errors.isEmpty() ) { |
---|
| 861 | throw errors; |
---|
[843054c2] | 862 | } // if |
---|
[51b7345] | 863 | } |
---|
| 864 | |
---|
[3848e0e] | 865 | Declaration *DeclarationNode::build() const { |
---|
[843054c2] | 866 | if ( type ) { |
---|
[de62360d] | 867 | Declaration *newDecl = type->buildDecl( name, buildStorageClass(), maybeBuild< Expression >( bitfieldWidth ), buildFuncSpecifier( Inline ), buildFuncSpecifier( Noreturn ), linkage, maybeBuild< Initializer >(initializer) ); |
---|
[b87a5ed] | 868 | return newDecl; |
---|
[843054c2] | 869 | } // if |
---|
[de62360d] | 870 | if ( ! buildFuncSpecifier( Inline ) && ! buildFuncSpecifier( Noreturn ) ) { |
---|
[843054c2] | 871 | return new ObjectDecl( name, buildStorageClass(), linkage, maybeBuild< Expression >( bitfieldWidth ), 0, maybeBuild< Initializer >( initializer ) ); |
---|
| 872 | } // if |
---|
[de62360d] | 873 | throw SemanticError( "invalid function specifier in declaration of ", this ); |
---|
[51b7345] | 874 | } |
---|
| 875 | |
---|
[3848e0e] | 876 | Type *DeclarationNode::buildType() const { |
---|
[b87a5ed] | 877 | assert( type ); |
---|
[51b7345] | 878 | |
---|
[b87a5ed] | 879 | switch ( type->kind ) { |
---|
| 880 | case TypeData::Enum: |
---|
| 881 | return new EnumInstType( type->buildQualifiers(), type->enumeration->name ); |
---|
| 882 | case TypeData::Aggregate: { |
---|
| 883 | ReferenceToType *ret; |
---|
| 884 | switch ( type->aggregate->kind ) { |
---|
| 885 | case DeclarationNode::Struct: |
---|
| 886 | ret = new StructInstType( type->buildQualifiers(), type->aggregate->name ); |
---|
| 887 | break; |
---|
| 888 | case DeclarationNode::Union: |
---|
| 889 | ret = new UnionInstType( type->buildQualifiers(), type->aggregate->name ); |
---|
| 890 | break; |
---|
[4040425] | 891 | case DeclarationNode::Trait: |
---|
| 892 | ret = new TraitInstType( type->buildQualifiers(), type->aggregate->name ); |
---|
[b87a5ed] | 893 | break; |
---|
| 894 | default: |
---|
| 895 | assert( false ); |
---|
| 896 | } // switch |
---|
| 897 | buildList( type->aggregate->actuals, ret->get_parameters() ); |
---|
| 898 | return ret; |
---|
| 899 | } |
---|
| 900 | case TypeData::Symbolic: { |
---|
| 901 | TypeInstType *ret = new TypeInstType( type->buildQualifiers(), type->symbolic->name, false ); |
---|
| 902 | buildList( type->symbolic->actuals, ret->get_parameters() ); |
---|
| 903 | return ret; |
---|
| 904 | } |
---|
| 905 | default: |
---|
| 906 | return type->build(); |
---|
| 907 | } // switch |
---|
[3848e0e] | 908 | } |
---|
| 909 | |
---|
[68cd1ce] | 910 | DeclarationNode::StorageClass DeclarationNode::buildStorageClass() const { |
---|
| 911 | DeclarationNode::StorageClass ret = DeclarationNode::NoStorageClass; |
---|
| 912 | for ( std::list< DeclarationNode::StorageClass >::const_iterator i = storageClasses.begin(); i != storageClasses.end(); ++i ) { |
---|
| 913 | if ( *i == DeclarationNode::Inline || *i == DeclarationNode::Noreturn ) continue; // ignore function specifiers |
---|
| 914 | if ( ret != DeclarationNode::NoStorageClass ) { // already have a valid storage class ? |
---|
[b87a5ed] | 915 | throw SemanticError( "invalid combination of storage classes in declaration of ", this ); |
---|
[68cd1ce] | 916 | } // if |
---|
| 917 | ret = *i; |
---|
| 918 | } // for |
---|
[b87a5ed] | 919 | return ret; |
---|
[51b7345] | 920 | } |
---|
| 921 | |
---|
[de62360d] | 922 | bool DeclarationNode::buildFuncSpecifier( DeclarationNode::StorageClass key ) const { |
---|
| 923 | std::list< DeclarationNode::StorageClass >::const_iterator first = std::find( storageClasses.begin(), storageClasses.end(), key ); |
---|
| 924 | if ( first == storageClasses.end() ) return false; // not found |
---|
| 925 | first = std::find( ++first, storageClasses.end(), key ); // found |
---|
| 926 | if ( first == storageClasses.end() ) return true; // not found again |
---|
| 927 | throw SemanticError( "duplicate function specifier in declaration of ", this ); |
---|
[51b7345] | 928 | } |
---|
[b87a5ed] | 929 | |
---|
| 930 | // Local Variables: // |
---|
| 931 | // tab-width: 4 // |
---|
| 932 | // mode: c++ // |
---|
| 933 | // compile-command: "make install" // |
---|
| 934 | // End: // |
---|