Changeset 6f95000
- Timestamp:
- Mar 16, 2017, 6:14:27 PM (7 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc
- Children:
- 395fc37
- Parents:
- d6d747d
- Location:
- src
- Files:
-
- 10 edited
Legend:
- Unmodified
- Added
- Removed
-
src/GenPoly/ScrubTyVars.cc
rd6d747d r6f95000 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : T ue May 19 16:42:42 201513 // Update Count : 212 // Last Modified On : Thu Mar 16 15:44:27 2017 13 // Update Count : 3 14 14 // 15 15 … … 109 109 if ( Type *dynType = shouldScrub( pointer->get_base() ) ) { 110 110 Type *ret = dynType->acceptMutator( *this ); 111 ret->get_qualifiers() += pointer->get_qualifiers();111 ret->get_qualifiers() |= pointer->get_qualifiers(); 112 112 pointer->set_base( 0 ); 113 113 delete pointer; -
src/Parser/DeclarationNode.cc
rd6d747d r6f95000 10 10 // Created On : Sat May 16 12:34:05 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Mar 16 09:10:57201713 // Update Count : 10 0712 // Last Modified On : Thu Mar 16 17:16:31 2017 13 // Update Count : 1014 14 14 // 15 15 … … 19 19 #include <algorithm> 20 20 #include <cassert> 21 #include <strings.h> // ffs22 21 23 22 #include "TypeData.h" … … 243 242 244 243 DeclarationNode * DeclarationNode::newAggregate( Aggregate kind, const string * name, ExpressionNode * actuals, DeclarationNode * fields, bool body ) { 244 assert( name ); 245 245 DeclarationNode * newnode = new DeclarationNode; 246 246 newnode->type = new TypeData( TypeData::Aggregate ); 247 247 newnode->type->aggregate.kind = kind; 248 if ( name ) { 249 newnode->type->aggregate.name = name; 250 } else { // anonymous aggregate ? 251 newnode->type->aggregate.name = new string( anonymous.newName() ); 252 } // if 248 newnode->type->aggregate.name = name; 253 249 newnode->type->aggregate.actuals = actuals; 254 250 newnode->type->aggregate.fields = fields; … … 258 254 259 255 DeclarationNode * DeclarationNode::newEnum( string * name, DeclarationNode * constants, bool body ) { 256 assert( name ); 260 257 DeclarationNode * newnode = new DeclarationNode; 261 258 newnode->type = new TypeData( TypeData::Enum ); 262 if ( name ) { 263 newnode->type->enumeration.name = name; 264 } else { // anonymous aggregate ? 265 newnode->type->enumeration.name = new string( anonymous.newName() ); 266 } // if 259 newnode->type->enumeration.name = name; 267 260 newnode->type->enumeration.constants = constants; 268 261 newnode->type->enumeration.body = body; … … 436 429 const Type::Qualifiers qsrc = src->qualifiers, qdst = dst->qualifiers; // optimization 437 430 438 if ( (qsrc .val & qdst.val) != 0 ) {// duplicates ?431 if ( (qsrc & qdst).any() ) { // duplicates ? 439 432 for ( unsigned int i = 0; i < Type::NumTypeQualifier; i += 1 ) { // find duplicates 440 433 if ( qsrc[i] && qdst[i] ) { … … 446 439 447 440 void DeclarationNode::checkSpecifiers( DeclarationNode * src ) { 448 if ( (funcSpecs .val & src->funcSpecs.val) != 0 ) {// duplicates ?441 if ( (funcSpecs & src->funcSpecs).any() ) { // duplicates ? 449 442 for ( unsigned int i = 0; i < Type::NumFuncSpecifier; i += 1 ) { // find duplicates 450 443 if ( funcSpecs[i] && src->funcSpecs[i] ) { … … 455 448 456 449 if ( storageClasses.any() && src->storageClasses.any() ) { // any reason to check ? 457 if ( (storageClasses .val & src->storageClasses.val ) != 0) { // duplicates ?450 if ( (storageClasses & src->storageClasses ).any() ) { // duplicates ? 458 451 for ( unsigned int i = 0; i < Type::NumStorageClass; i += 1 ) { // find duplicates 459 452 if ( storageClasses[i] && src->storageClasses[i] ) { … … 463 456 // src is the new item being added and has a single bit 464 457 } else if ( ! src->storageClasses.is_threadlocal ) { // conflict ? 465 appendError( error, string( "conflicting " ) + Type::StorageClasses::Names[ ffs( storageClasses.val ) - 1] +466 " & " + Type::StorageClasses::Names[ ffs( src->storageClasses.val ) - 1] );467 src->storageClasses. val = 0; // FIX to preserve invariant of one basic storage specifier458 appendError( error, string( "conflicting " ) + Type::StorageClasses::Names[storageClasses.ffs()] + 459 " & " + Type::StorageClasses::Names[src->storageClasses.ffs()] ); 460 src->storageClasses.reset(); // FIX to preserve invariant of one basic storage specifier 468 461 } // if 469 462 } // if … … 473 466 474 467 DeclarationNode * DeclarationNode::copySpecifiers( DeclarationNode * q ) { 475 funcSpecs .val |= q->funcSpecs.val;476 storageClasses .val |= q->storageClasses.val;468 funcSpecs |= q->funcSpecs; 469 storageClasses |= q->storageClasses; 477 470 478 471 for ( Attribute *attr: reverseIterate( q->attributes ) ) { … … 497 490 src = nullptr; 498 491 } else { 499 dst->qualifiers += src->qualifiers;492 dst->qualifiers |= src->qualifiers; 500 493 } // if 501 494 } // addQualifiersToType … … 555 548 switch ( dst->kind ) { 556 549 case TypeData::Unknown: 557 src->qualifiers += dst->qualifiers;550 src->qualifiers |= dst->qualifiers; 558 551 dst = src; 559 552 src = nullptr; 560 553 break; 561 554 case TypeData::Basic: 562 dst->qualifiers += src->qualifiers;555 dst->qualifiers |= src->qualifiers; 563 556 if ( src->kind != TypeData::Unknown ) { 564 557 assert( src->kind == TypeData::Basic ); … … 596 589 dst->base->aggInst.params = maybeClone( src->aggregate.actuals ); 597 590 } // if 598 dst->base->qualifiers += src->qualifiers;591 dst->base->qualifiers |= src->qualifiers; 599 592 src = nullptr; 600 593 break; … … 628 621 type->aggInst.hoistType = o->type->enumeration.body; 629 622 } // if 630 type->qualifiers += o->type->qualifiers;623 type->qualifiers |= o->type->qualifiers; 631 624 } else { 632 625 type = o->type; … … 784 777 p->type->base->aggInst.params = maybeClone( type->aggregate.actuals ); 785 778 } // if 786 p->type->base->qualifiers += type->qualifiers;779 p->type->base->qualifiers |= type->qualifiers; 787 780 break; 788 781 … … 821 814 lastArray->base->aggInst.params = maybeClone( type->aggregate.actuals ); 822 815 } // if 823 lastArray->base->qualifiers += type->qualifiers;816 lastArray->base->qualifiers |= type->qualifiers; 824 817 break; 825 818 default: -
src/Parser/parser.yy
rd6d747d r6f95000 10 10 // Created On : Sat Sep 1 20:22:55 2001 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Mar 16 08:36:17201713 // Update Count : 231 012 // Last Modified On : Thu Mar 16 12:57:03 2017 13 // Update Count : 2316 14 14 // 15 15 … … 1608 1608 aggregate_type: // struct, union 1609 1609 aggregate_key attribute_list_opt '{' field_declaration_list '}' 1610 { $$ = DeclarationNode::newAggregate( $1, n ullptr, nullptr, $4, true )->addQualifiers( $2 ); }1610 { $$ = DeclarationNode::newAggregate( $1, new string( DeclarationNode::anonymous.newName() ), nullptr, $4, true )->addQualifiers( $2 ); } 1611 1611 | aggregate_key attribute_list_opt no_attr_identifier_or_type_name 1612 1612 { typedefTable.makeTypedef( *$3 ); } … … 1614 1614 { $$ = DeclarationNode::newAggregate( $1, $3, nullptr, $6, true )->addQualifiers( $2 ); } 1615 1615 | aggregate_key attribute_list_opt '(' type_name_list ')' '{' field_declaration_list '}' // CFA 1616 { $$ = DeclarationNode::newAggregate( $1, n ullptr, $4, $7, false )->addQualifiers( $2 ); }1616 { $$ = DeclarationNode::newAggregate( $1, new string( DeclarationNode::anonymous.newName() ), $4, $7, false )->addQualifiers( $2 ); } 1617 1617 | aggregate_type_nobody 1618 1618 ; … … 1684 1684 // empty 1685 1685 { $$ = DeclarationNode::newName( 0 ); /* XXX */ } // CFA, no field name 1686 // '@' // empty1687 // { $$ = DeclarationNode::newName( 0 ); /* XXX */} // CFA, no field name1686 // '@' 1687 // { $$ = DeclarationNode::newName( new string( DeclarationNode::anonymous.newName() ) ); } // CFA, no field name 1688 1688 | bit_subrange_size // no field name 1689 1689 { $$ = DeclarationNode::newBitfield( $1 ); } … … 1711 1711 enum_type: // enum 1712 1712 ENUM attribute_list_opt '{' enumerator_list comma_opt '}' 1713 { $$ = DeclarationNode::newEnum( n ullptr, $4, true )->addQualifiers( $2 ); }1713 { $$ = DeclarationNode::newEnum( new string( DeclarationNode::anonymous.newName() ), $4, true )->addQualifiers( $2 ); } 1714 1714 | ENUM attribute_list_opt no_attr_identifier_or_type_name 1715 1715 { typedefTable.makeTypedef( *$3 ); } -
src/ResolvExpr/CommonType.cc
rd6d747d r6f95000 10 10 // Created On : Sun May 17 06:59:27 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Wed Mar 2 17:35:34 201613 // Update Count : 312 // Last Modified On : Thu Mar 16 16:24:31 2017 13 // Update Count : 7 14 14 // 15 15 … … 71 71 if ( unifyExact( type1, type->get_base(), env, have, need, newOpen, indexer ) ) { 72 72 result = type1->clone(); 73 result->get_qualifiers() = tq1 +tq2;73 result->get_qualifiers() = tq1 | tq2; 74 74 } // if 75 75 type1->get_qualifiers() = tq1; … … 133 133 BasicType::Kind newType = combinedType[ basicType->get_kind() ][ otherBasic->get_kind() ]; 134 134 if ( ( ( newType == basicType->get_kind() && basicType->get_qualifiers() >= otherBasic->get_qualifiers() ) || widenFirst ) && ( ( newType == otherBasic->get_kind() && basicType->get_qualifiers() <= otherBasic->get_qualifiers() ) || widenSecond ) ) { 135 result = new BasicType( basicType->get_qualifiers() +otherBasic->get_qualifiers(), newType );135 result = new BasicType( basicType->get_qualifiers() | otherBasic->get_qualifiers(), newType ); 136 136 } // if 137 137 } else if ( dynamic_cast< EnumInstType * > ( type2 ) || dynamic_cast< ZeroType* >( type2 ) || dynamic_cast< OneType* >( type2 ) ) { … … 139 139 BasicType::Kind newType = combinedType[ basicType->get_kind() ][ BasicType::SignedInt ]; 140 140 if ( ( ( newType == basicType->get_kind() && basicType->get_qualifiers() >= type2->get_qualifiers() ) || widenFirst ) && ( ( newType != basicType->get_kind() && basicType->get_qualifiers() <= type2->get_qualifiers() ) || widenSecond ) ) { 141 result = new BasicType( basicType->get_qualifiers() +type2->get_qualifiers(), newType );141 result = new BasicType( basicType->get_qualifiers() | type2->get_qualifiers(), newType ); 142 142 } // if 143 143 } // if … … 154 154 } 155 155 result = voidPointer->clone(); 156 result->get_qualifiers() += otherPointer->get_qualifiers();156 result->get_qualifiers() |= otherPointer->get_qualifiers(); 157 157 } 158 158 … … 176 176 result = otherPointer->clone(); 177 177 } // if 178 result->get_qualifiers() = tq1 +tq2;178 result->get_qualifiers() = tq1 | tq2; 179 179 } else { 180 180 /// std::cout << "place for ptr-to-type" << std::endl; … … 185 185 } else if ( widenSecond && dynamic_cast< ZeroType* >( type2 ) ) { 186 186 result = pointerType->clone(); 187 result->get_qualifiers() += type2->get_qualifiers();187 result->get_qualifiers() |= type2->get_qualifiers(); 188 188 } // if 189 189 } … … 230 230 if ( unifyExact( type->get_base(), type2, env, have, need, newOpen, indexer ) ) { 231 231 result = type2->clone(); 232 result->get_qualifiers() = tq1 +tq2;232 result->get_qualifiers() = tq1 | tq2; 233 233 } // if 234 234 type2->get_qualifiers() = tq2; … … 250 250 if ( widenSecond || zeroType->get_qualifiers() <= type2->get_qualifiers() ) { 251 251 result = type2->clone(); 252 result->get_qualifiers() += zeroType->get_qualifiers();252 result->get_qualifiers() |= zeroType->get_qualifiers(); 253 253 } 254 254 } else if ( widenSecond && dynamic_cast< OneType* >( type2 ) ) { 255 255 result = new BasicType( zeroType->get_qualifiers(), BasicType::SignedInt ); 256 result->get_qualifiers() += type2->get_qualifiers();256 result->get_qualifiers() |= type2->get_qualifiers(); 257 257 } 258 258 } … … 264 264 if ( widenSecond || oneType->get_qualifiers() <= type2->get_qualifiers() ) { 265 265 result = type2->clone(); 266 result->get_qualifiers() += oneType->get_qualifiers();266 result->get_qualifiers() |= oneType->get_qualifiers(); 267 267 } 268 268 } else if ( widenSecond && dynamic_cast< ZeroType* >( type2 ) ) { 269 269 result = new BasicType( oneType->get_qualifiers(), BasicType::SignedInt ); 270 result->get_qualifiers() += type2->get_qualifiers();270 result->get_qualifiers() |= type2->get_qualifiers(); 271 271 } 272 272 } -
src/ResolvExpr/Unify.cc
rd6d747d r6f95000 10 10 // Created On : Sun May 17 12:27:10 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Mar 16 07:59:59201713 // Update Count : 4 012 // Last Modified On : Thu Mar 16 16:22:54 2017 13 // Update Count : 42 14 14 // 15 15 … … 353 353 #endif 354 354 if ( ( common = commonType( type1, type2, widenMode.widenFirst, widenMode.widenSecond, indexer, env, openVars ) ) ) { 355 common->get_qualifiers() = tq1 +tq2;355 common->get_qualifiers() = tq1 | tq2; 356 356 #ifdef DEBUG 357 357 std::cerr << "unifyInexact: common type is "; … … 370 370 if ( ( tq1 > tq2 || widenMode.widenFirst ) && ( tq2 > tq1 || widenMode.widenSecond ) ) { 371 371 common = type1->clone(); 372 common->get_qualifiers() = tq1 +tq2;372 common->get_qualifiers() = tq1 | tq2; 373 373 result = true; 374 374 } else { -
src/SymTab/ImplementationType.cc
rd6d747d r6f95000 10 10 // Created On : Sun May 17 21:32:01 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Wed Mar 2 17:31:20 201613 // Update Count : 312 // Last Modified On : Thu Mar 16 15:54:08 2017 13 // Update Count : 4 14 14 // 15 15 … … 105 105 if ( typeDecl && typeDecl->get_base() ) { 106 106 Type *base = implementationType( typeDecl->get_base(), indexer ); 107 base->get_qualifiers() += inst->get_qualifiers();107 base->get_qualifiers() |= inst->get_qualifiers(); 108 108 result = base; 109 109 } // if … … 114 114 for ( std::list< Type* >::iterator i = tupleType->get_types().begin(); i != tupleType->get_types().end(); ++i ) { 115 115 Type *implType = implementationType( *i, indexer ); 116 implType->get_qualifiers() += tupleType->get_qualifiers();116 implType->get_qualifiers() |= tupleType->get_qualifiers(); 117 117 newType->get_types().push_back( implType ); 118 118 } // for -
src/SymTab/Validate.cc
rd6d747d r6f95000 10 10 // Created On : Sun May 17 21:50:04 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Mar 16 08:02:54201713 // Update Count : 35 112 // Last Modified On : Thu Mar 16 16:39:15 2017 13 // Update Count : 353 14 14 // 15 15 … … 611 611 if ( def != typedefNames.end() ) { 612 612 Type *ret = def->second.first->get_base()->clone(); 613 ret->get_qualifiers() += typeInst->get_qualifiers();613 ret->get_qualifiers() |= typeInst->get_qualifiers(); 614 614 // place instance parameters on the typedef'd type 615 615 if ( ! typeInst->get_parameters().empty() ) { … … 656 656 // hence the type-name "screen" must be defined. 657 657 // Note, qualifiers on the typedef are superfluous for the forward declaration. 658 if ( StructInstType *aggDecl = dynamic_cast< StructInstType * >( tyDecl->get_base() ) ) { 658 659 Type *designatorType = tyDecl->get_base()->stripDeclarator(); 660 if ( StructInstType *aggDecl = dynamic_cast< StructInstType * >( designatorType ) ) { 659 661 return new StructDecl( aggDecl->get_name() ); 660 } else if ( UnionInstType *aggDecl = dynamic_cast< UnionInstType * >( tyDecl->get_base()) ) {662 } else if ( UnionInstType *aggDecl = dynamic_cast< UnionInstType * >( designatorType ) ) { 661 663 return new UnionDecl( aggDecl->get_name() ); 662 } else if ( EnumInstType *enumDecl = dynamic_cast< EnumInstType * >( tyDecl->get_base()) ) {664 } else if ( EnumInstType *enumDecl = dynamic_cast< EnumInstType * >( designatorType ) ) { 663 665 return new EnumDecl( enumDecl->get_name() ); 664 666 } else { -
src/SynTree/Type.cc
rd6d747d r6f95000 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Mar 16 1 0:25:06201713 // Update Count : 2 312 // Last Modified On : Thu Mar 16 16:25:49 2017 13 // Update Count : 27 14 14 // 15 15 … … 19 19 #include "Declaration.h" 20 20 #include "Attribute.h" 21 #include "InitTweak/InitTweak.h" 21 22 #include "Common/utility.h" 22 23 … … 64 65 const char * Type::Qualifiers::Names[] = { "const", "restrict", "volatile", "lvalue", "mutex", "_Atomic" }; 65 66 67 Type *Type::stripDeclarator() { 68 Type * type = this; 69 while ( Type * at = InitTweak::getPointerBase( type ) ) { 70 type = at; 71 } 72 return type; 73 } 74 66 75 void Type::print( std::ostream &os, int indent ) const { 67 76 if ( ! forall.empty() ) { -
src/SynTree/Type.h
rd6d747d r6f95000 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Mar 16 1 2:11:50201713 // Update Count : 1 1612 // Last Modified On : Thu Mar 16 17:44:11 2017 13 // Update Count : 135 14 14 // 15 15 … … 21 21 #include "SynTree.h" 22 22 #include "Visitor.h" 23 #include <strings.h> // ffs 23 24 24 25 class Type : public BaseSyntaxNode { 25 26 public: 26 #define CommonBF( N ) \ 27 // Simulate inheritance because union does not allow it. 28 #define BFCommon( BFType, N ) \ 27 29 bool operator[]( unsigned int i ) const { return val & (1 << i); } \ 28 30 bool any() const { return val != 0; } \ 31 void reset() { val = 0; } \ 32 int ffs() { return ::ffs( val ) - 1; } \ 29 33 static const char * Names[]; \ 34 BFType operator&=( BFType other ) { \ 35 val &= other.val; return *this; \ 36 } \ 37 BFType operator&( BFType other ) const { \ 38 BFType q = other; \ 39 q &= *this; \ 40 return q; \ 41 } \ 42 BFType operator|=( BFType other ) { \ 43 val |= other.val; return *this; \ 44 } \ 45 BFType operator|( BFType other ) const { \ 46 BFType q = other; \ 47 q |= *this; \ 48 return q; \ 49 } \ 50 BFType operator-=( BFType other ) { \ 51 val &= ~other.val; return *this; \ 52 } \ 30 53 void print( std::ostream & os ) const { \ 31 54 if ( (*this).any() ) { \ … … 50 73 FuncSpecifiers() : val( 0 ) {} 51 74 FuncSpecifiers( unsigned int val ) : val( val ) {} 52 CommonBF( NumFuncSpecifier ) 75 bool operator==( FuncSpecifiers other ) const { return val == other.val; } 76 bool operator!=( FuncSpecifiers other ) const { return val != other.val; } 77 BFCommon( FuncSpecifiers, NumFuncSpecifier ) 53 78 }; // FuncSpecifiers 54 79 … … 66 91 StorageClasses() : val( 0 ) {} 67 92 StorageClasses( unsigned int val ) : val( val ) {} 68 CommonBF( NumStorageClass ) 93 bool operator==( StorageClasses other ) const { return val == other.val; } 94 bool operator!=( StorageClasses other ) const { return val != other.val; } 95 BFCommon( StorageClasses, NumStorageClass ) 69 96 }; // StorageClasses 70 97 … … 92 119 bool operator<=( Qualifiers other ) const { 93 120 return isConst <= other.isConst && isVolatile <= other.isVolatile && 94 isMutex == other.isMutex && isAtomic == other.isAtomic;121 isMutex >= other.isMutex && isAtomic == other.isAtomic; 95 122 } 96 bool operator>=( Qualifiers other ) const { 97 return isConst >= other.isConst && isVolatile >= other.isVolatile && 98 isMutex == other.isMutex && isAtomic == other.isAtomic; 99 } 100 bool operator<( Qualifiers other ) const { 101 return *this != other && *this <= other; 102 } 103 bool operator>( Qualifiers other ) const { 104 return *this != other && *this >= other; 105 } 106 Qualifiers operator&=( Type::Qualifiers other ) { 107 val &= other.val; return *this; 108 } 109 Qualifiers operator+=( Qualifiers other ) { 110 val |= other.val; return *this; 111 } 112 Qualifiers operator-=( Qualifiers other ) { 113 val &= ~other.val; return *this; 114 } 115 Qualifiers operator+( Qualifiers other ) const { 116 Qualifiers q = other; 117 q += *this; 118 return q; 119 } 120 CommonBF( NumTypeQualifier ) 123 bool operator<( Qualifiers other ) const { return *this != other && *this <= other; } 124 bool operator>=( Qualifiers other ) const { return ! (*this < other); } 125 bool operator>( Qualifiers other ) const { return *this != other && *this >= other; } 126 BFCommon( Qualifiers, NumTypeQualifier ) 121 127 }; // Qualifiers 122 128 … … 147 153 virtual bool isVoid() const { return size() == 0; } 148 154 virtual Type * getComponent( unsigned i ) { assertf( size() == 1 && i == 0, "Type::getComponent was called with size %d and index %d\n", size(), i ); return this; } 155 156 Type *stripDeclarator(); 149 157 150 158 virtual bool isComplete() const { return true; } -
src/SynTree/TypeSubstitution.cc
rd6d747d r6f95000 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Rob Schluntz12 // Last Modified On : T ue Apr 26 11:15:29 201613 // Update Count : 311 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Mar 16 15:54:35 2017 13 // Update Count : 4 14 14 // 15 15 … … 127 127 subCount++; 128 128 Type *newtype = i->second->clone(); 129 newtype->get_qualifiers() += inst->get_qualifiers();129 newtype->get_qualifiers() |= inst->get_qualifiers(); 130 130 delete inst; 131 131 return newtype;
Note: See TracChangeset
for help on using the changeset viewer.