[a32b204] | 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 | // |
---|
[41a2620] | 7 | // Unify.cc -- |
---|
[a32b204] | 8 | // |
---|
| 9 | // Author : Richard C. Bilson |
---|
| 10 | // Created On : Sun May 17 12:27:10 2015 |
---|
[07de76b] | 11 | // Last Modified By : Peter A. Buhr |
---|
| 12 | // Last Modified On : Fri Dec 13 23:43:05 2019 |
---|
| 13 | // Update Count : 46 |
---|
[a32b204] | 14 | // |
---|
[51b7345] | 15 | |
---|
[f474e91] | 16 | #include "Unify.h" |
---|
| 17 | |
---|
[d76c588] | 18 | #include <cassert> // for assertf, assert |
---|
| 19 | #include <iterator> // for back_insert_iterator, back_inserter |
---|
| 20 | #include <map> // for _Rb_tree_const_iterator, _Rb_tree_i... |
---|
| 21 | #include <memory> // for unique_ptr |
---|
| 22 | #include <set> // for set |
---|
| 23 | #include <string> // for string, operator==, operator!=, bas... |
---|
| 24 | #include <utility> // for pair, move |
---|
[54e41b3] | 25 | #include <vector> |
---|
[51b7345] | 26 | |
---|
[2890212] | 27 | #include "AST/Copy.hpp" |
---|
[f474e91] | 28 | #include "AST/Decl.hpp" |
---|
[54e41b3] | 29 | #include "AST/Node.hpp" |
---|
[f474e91] | 30 | #include "AST/Pass.hpp" |
---|
[2890212] | 31 | #include "AST/Print.hpp" |
---|
[54e41b3] | 32 | #include "AST/Type.hpp" |
---|
[d76c588] | 33 | #include "AST/TypeEnvironment.hpp" |
---|
| 34 | #include "Common/PassVisitor.h" // for PassVisitor |
---|
| 35 | #include "FindOpenVars.h" // for findOpenVars |
---|
[07de76b] | 36 | #include "SynTree/LinkageSpec.h" // for C |
---|
[d76c588] | 37 | #include "SynTree/Constant.h" // for Constant |
---|
| 38 | #include "SynTree/Declaration.h" // for TypeDecl, TypeDecl::Data, Declarati... |
---|
| 39 | #include "SynTree/Expression.h" // for TypeExpr, Expression, ConstantExpr |
---|
| 40 | #include "SynTree/Mutator.h" // for Mutator |
---|
| 41 | #include "SynTree/Type.h" // for Type, TypeInstType, FunctionType |
---|
| 42 | #include "SynTree/Visitor.h" // for Visitor |
---|
| 43 | #include "Tuples/Tuples.h" // for isTtype |
---|
| 44 | #include "TypeEnvironment.h" // for EqvClass, AssertionSet, OpenVarSet |
---|
| 45 | #include "typeops.h" // for flatten, occurs, commonType |
---|
[ea6332d] | 46 | |
---|
[f474e91] | 47 | namespace ast { |
---|
| 48 | class SymbolTable; |
---|
| 49 | } |
---|
| 50 | |
---|
[ea6332d] | 51 | namespace SymTab { |
---|
| 52 | class Indexer; |
---|
| 53 | } // namespace SymTab |
---|
[51b7345] | 54 | |
---|
[1cbca6e] | 55 | // #define DEBUG |
---|
[51b7345] | 56 | |
---|
| 57 | namespace ResolvExpr { |
---|
| 58 | |
---|
[f474e91] | 59 | struct Unify_old : public WithShortCircuiting { |
---|
| 60 | Unify_old( Type *type2, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, const OpenVarSet &openVars, WidenMode widen, const SymTab::Indexer &indexer ); |
---|
[41a2620] | 61 | |
---|
[a32b204] | 62 | bool get_result() const { return result; } |
---|
| 63 | |
---|
[36a2367] | 64 | void previsit( BaseSyntaxNode * ) { visit_children = false; } |
---|
| 65 | |
---|
| 66 | void postvisit( VoidType * voidType ); |
---|
| 67 | void postvisit( BasicType * basicType ); |
---|
| 68 | void postvisit( PointerType * pointerType ); |
---|
| 69 | void postvisit( ArrayType * arrayType ); |
---|
| 70 | void postvisit( ReferenceType * refType ); |
---|
| 71 | void postvisit( FunctionType * functionType ); |
---|
| 72 | void postvisit( StructInstType * aggregateUseType ); |
---|
| 73 | void postvisit( UnionInstType * aggregateUseType ); |
---|
| 74 | void postvisit( EnumInstType * aggregateUseType ); |
---|
| 75 | void postvisit( TraitInstType * aggregateUseType ); |
---|
| 76 | void postvisit( TypeInstType * aggregateUseType ); |
---|
| 77 | void postvisit( TupleType * tupleType ); |
---|
| 78 | void postvisit( VarArgsType * varArgsType ); |
---|
| 79 | void postvisit( ZeroType * zeroType ); |
---|
| 80 | void postvisit( OneType * oneType ); |
---|
| 81 | |
---|
| 82 | private: |
---|
[a32b204] | 83 | template< typename RefType > void handleRefType( RefType *inst, Type *other ); |
---|
[02ec390] | 84 | template< typename RefType > void handleGenericRefType( RefType *inst, Type *other ); |
---|
[a32b204] | 85 | |
---|
| 86 | bool result; |
---|
| 87 | Type *type2; // inherited |
---|
| 88 | TypeEnvironment &env; |
---|
| 89 | AssertionSet &needAssertions; |
---|
| 90 | AssertionSet &haveAssertions; |
---|
| 91 | const OpenVarSet &openVars; |
---|
[f474e91] | 92 | WidenMode widen; |
---|
[a32b204] | 93 | const SymTab::Indexer &indexer; |
---|
| 94 | }; |
---|
| 95 | |
---|
[eb50842] | 96 | /// Attempts an inexact unification of type1 and type2. |
---|
| 97 | /// Returns false if no such unification; if the types can be unified, sets common (unless they unify exactly and have identical type qualifiers) |
---|
[f474e91] | 98 | bool unifyInexact( Type *type1, Type *type2, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, const OpenVarSet &openVars, WidenMode widen, const SymTab::Indexer &indexer, Type *&common ); |
---|
| 99 | bool unifyExact( Type *type1, Type *type2, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, const OpenVarSet &openVars, WidenMode widen, const SymTab::Indexer &indexer ); |
---|
| 100 | |
---|
[7870799] | 101 | bool unifyExact( |
---|
| 102 | const ast::Type * type1, const ast::Type * type2, ast::TypeEnvironment & env, |
---|
| 103 | ast::AssertionSet & need, ast::AssertionSet & have, const ast::OpenVarSet & open, |
---|
[f474e91] | 104 | WidenMode widen, const ast::SymbolTable & symtab ); |
---|
[41a2620] | 105 | |
---|
[6f096d2] | 106 | bool typesCompatible( const Type * first, const Type * second, const SymTab::Indexer & indexer, const TypeEnvironment & env ) { |
---|
[a32b204] | 107 | TypeEnvironment newEnv; |
---|
[1cbca6e] | 108 | OpenVarSet openVars, closedVars; // added closedVars |
---|
[a32b204] | 109 | AssertionSet needAssertions, haveAssertions; |
---|
[6f096d2] | 110 | Type * newFirst = first->clone(), * newSecond = second->clone(); |
---|
[a32b204] | 111 | env.apply( newFirst ); |
---|
| 112 | env.apply( newSecond ); |
---|
[1cbca6e] | 113 | |
---|
| 114 | // do we need to do this? Seems like we do, types should be able to be compatible if they |
---|
| 115 | // have free variables that can unify |
---|
| 116 | findOpenVars( newFirst, openVars, closedVars, needAssertions, haveAssertions, false ); |
---|
| 117 | findOpenVars( newSecond, openVars, closedVars, needAssertions, haveAssertions, true ); |
---|
| 118 | |
---|
[a32b204] | 119 | bool result = unifyExact( newFirst, newSecond, newEnv, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 120 | delete newFirst; |
---|
| 121 | delete newSecond; |
---|
| 122 | return result; |
---|
| 123 | } |
---|
| 124 | |
---|
[7870799] | 125 | bool typesCompatible( |
---|
| 126 | const ast::Type * first, const ast::Type * second, const ast::SymbolTable & symtab, |
---|
[d76c588] | 127 | const ast::TypeEnvironment & env ) { |
---|
[f474e91] | 128 | ast::TypeEnvironment newEnv; |
---|
| 129 | ast::OpenVarSet open, closed; |
---|
| 130 | ast::AssertionSet need, have; |
---|
| 131 | |
---|
| 132 | ast::ptr<ast::Type> newFirst{ first }, newSecond{ second }; |
---|
| 133 | env.apply( newFirst ); |
---|
| 134 | env.apply( newSecond ); |
---|
| 135 | |
---|
| 136 | findOpenVars( newFirst, open, closed, need, have, FirstClosed ); |
---|
| 137 | findOpenVars( newSecond, open, closed, need, have, FirstOpen ); |
---|
| 138 | |
---|
[2890212] | 139 | return unifyExact(newFirst, newSecond, newEnv, need, have, open, noWiden(), symtab ); |
---|
[d76c588] | 140 | } |
---|
| 141 | |
---|
[7870799] | 142 | bool typesCompatibleIgnoreQualifiers( const Type * first, const Type * second, const SymTab::Indexer &indexer, const TypeEnvironment &env ) { |
---|
[a32b204] | 143 | TypeEnvironment newEnv; |
---|
| 144 | OpenVarSet openVars; |
---|
| 145 | AssertionSet needAssertions, haveAssertions; |
---|
| 146 | Type *newFirst = first->clone(), *newSecond = second->clone(); |
---|
| 147 | env.apply( newFirst ); |
---|
| 148 | env.apply( newSecond ); |
---|
| 149 | newFirst->get_qualifiers() = Type::Qualifiers(); |
---|
| 150 | newSecond->get_qualifiers() = Type::Qualifiers(); |
---|
[2890212] | 151 | |
---|
[a32b204] | 152 | bool result = unifyExact( newFirst, newSecond, newEnv, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 153 | delete newFirst; |
---|
| 154 | delete newSecond; |
---|
| 155 | return result; |
---|
| 156 | } |
---|
| 157 | |
---|
[7870799] | 158 | bool typesCompatibleIgnoreQualifiers( |
---|
| 159 | const ast::Type * first, const ast::Type * second, const ast::SymbolTable & symtab, |
---|
[d76c588] | 160 | const ast::TypeEnvironment & env ) { |
---|
[f474e91] | 161 | ast::TypeEnvironment newEnv; |
---|
| 162 | ast::OpenVarSet open; |
---|
| 163 | ast::AssertionSet need, have; |
---|
[7870799] | 164 | |
---|
[2890212] | 165 | ast::Type * newFirst = shallowCopy( first ); |
---|
| 166 | ast::Type * newSecond = shallowCopy( second ); |
---|
| 167 | newFirst ->qualifiers = {}; |
---|
| 168 | newSecond->qualifiers = {}; |
---|
[f49b3fc] | 169 | ast::ptr< ast::Type > t1_(newFirst ); |
---|
| 170 | ast::ptr< ast::Type > t2_(newSecond); |
---|
[f474e91] | 171 | |
---|
[c7f834e] | 172 | ast::ptr< ast::Type > subFirst = env.apply(newFirst).node; |
---|
| 173 | ast::ptr< ast::Type > subSecond = env.apply(newSecond).node; |
---|
| 174 | |
---|
[7870799] | 175 | return unifyExact( |
---|
[c7f834e] | 176 | subFirst, |
---|
| 177 | subSecond, |
---|
[2890212] | 178 | newEnv, need, have, open, noWiden(), symtab ); |
---|
[d76c588] | 179 | } |
---|
| 180 | |
---|
[a32b204] | 181 | bool unify( Type *type1, Type *type2, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, OpenVarSet &openVars, const SymTab::Indexer &indexer ) { |
---|
| 182 | OpenVarSet closedVars; |
---|
| 183 | findOpenVars( type1, openVars, closedVars, needAssertions, haveAssertions, false ); |
---|
| 184 | findOpenVars( type2, openVars, closedVars, needAssertions, haveAssertions, true ); |
---|
| 185 | Type *commonType = 0; |
---|
| 186 | if ( unifyInexact( type1, type2, env, needAssertions, haveAssertions, openVars, WidenMode( true, true ), indexer, commonType ) ) { |
---|
| 187 | if ( commonType ) { |
---|
| 188 | delete commonType; |
---|
| 189 | } // if |
---|
| 190 | return true; |
---|
| 191 | } else { |
---|
| 192 | return false; |
---|
| 193 | } // if |
---|
| 194 | } |
---|
| 195 | |
---|
| 196 | bool unify( Type *type1, Type *type2, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, OpenVarSet &openVars, const SymTab::Indexer &indexer, Type *&commonType ) { |
---|
| 197 | OpenVarSet closedVars; |
---|
| 198 | findOpenVars( type1, openVars, closedVars, needAssertions, haveAssertions, false ); |
---|
| 199 | findOpenVars( type2, openVars, closedVars, needAssertions, haveAssertions, true ); |
---|
| 200 | return unifyInexact( type1, type2, env, needAssertions, haveAssertions, openVars, WidenMode( true, true ), indexer, commonType ); |
---|
| 201 | } |
---|
| 202 | |
---|
[f474e91] | 203 | bool unifyExact( Type *type1, Type *type2, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, const OpenVarSet &openVars, WidenMode widen, const SymTab::Indexer &indexer ) { |
---|
[51b7345] | 204 | #ifdef DEBUG |
---|
[a32b204] | 205 | TypeEnvironment debugEnv( env ); |
---|
[51b7345] | 206 | #endif |
---|
[eb50842] | 207 | if ( type1->get_qualifiers() != type2->get_qualifiers() ) { |
---|
| 208 | return false; |
---|
| 209 | } |
---|
| 210 | |
---|
[a32b204] | 211 | bool result; |
---|
| 212 | TypeInstType *var1 = dynamic_cast< TypeInstType* >( type1 ); |
---|
| 213 | TypeInstType *var2 = dynamic_cast< TypeInstType* >( type2 ); |
---|
| 214 | OpenVarSet::const_iterator entry1, entry2; |
---|
| 215 | if ( var1 ) { |
---|
| 216 | entry1 = openVars.find( var1->get_name() ); |
---|
| 217 | } // if |
---|
| 218 | if ( var2 ) { |
---|
| 219 | entry2 = openVars.find( var2->get_name() ); |
---|
| 220 | } // if |
---|
| 221 | bool isopen1 = var1 && ( entry1 != openVars.end() ); |
---|
| 222 | bool isopen2 = var2 && ( entry2 != openVars.end() ); |
---|
[eb50842] | 223 | |
---|
[7a63486] | 224 | if ( isopen1 && isopen2 ) { |
---|
| 225 | if ( entry1->second.kind != entry2->second.kind ) { |
---|
| 226 | result = false; |
---|
| 227 | } else { |
---|
[4139e3d] | 228 | result = env.bindVarToVar( |
---|
| 229 | var1, var2, TypeDecl::Data{ entry1->second, entry2->second }, needAssertions, |
---|
[f474e91] | 230 | haveAssertions, openVars, widen, indexer ); |
---|
[7a63486] | 231 | } |
---|
[a32b204] | 232 | } else if ( isopen1 ) { |
---|
[f474e91] | 233 | result = env.bindVar( var1, type2, entry1->second, needAssertions, haveAssertions, openVars, widen, indexer ); |
---|
| 234 | } else if ( isopen2 ) { // TODO: swap widen values in call, since type positions are flipped? |
---|
| 235 | result = env.bindVar( var2, type1, entry2->second, needAssertions, haveAssertions, openVars, widen, indexer ); |
---|
[a32b204] | 236 | } else { |
---|
[f474e91] | 237 | PassVisitor<Unify_old> comparator( type2, env, needAssertions, haveAssertions, openVars, widen, indexer ); |
---|
[a32b204] | 238 | type1->accept( comparator ); |
---|
[36a2367] | 239 | result = comparator.pass.get_result(); |
---|
[a32b204] | 240 | } // if |
---|
[51b7345] | 241 | #ifdef DEBUG |
---|
[2c57025] | 242 | std::cerr << "============ unifyExact" << std::endl; |
---|
| 243 | std::cerr << "type1 is "; |
---|
| 244 | type1->print( std::cerr ); |
---|
| 245 | std::cerr << std::endl << "type2 is "; |
---|
| 246 | type2->print( std::cerr ); |
---|
| 247 | std::cerr << std::endl << "openVars are "; |
---|
| 248 | printOpenVarSet( openVars, std::cerr, 8 ); |
---|
| 249 | std::cerr << std::endl << "input env is " << std::endl; |
---|
| 250 | debugEnv.print( std::cerr, 8 ); |
---|
| 251 | std::cerr << std::endl << "result env is " << std::endl; |
---|
| 252 | env.print( std::cerr, 8 ); |
---|
| 253 | std::cerr << "result is " << result << std::endl; |
---|
[51b7345] | 254 | #endif |
---|
[a32b204] | 255 | return result; |
---|
| 256 | } |
---|
| 257 | |
---|
| 258 | bool unifyExact( Type *type1, Type *type2, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, OpenVarSet &openVars, const SymTab::Indexer &indexer ) { |
---|
| 259 | return unifyExact( type1, type2, env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 260 | } |
---|
| 261 | |
---|
[f474e91] | 262 | bool unifyInexact( Type *type1, Type *type2, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, const OpenVarSet &openVars, WidenMode widen, const SymTab::Indexer &indexer, Type *&common ) { |
---|
[a32b204] | 263 | Type::Qualifiers tq1 = type1->get_qualifiers(), tq2 = type2->get_qualifiers(); |
---|
| 264 | type1->get_qualifiers() = Type::Qualifiers(); |
---|
| 265 | type2->get_qualifiers() = Type::Qualifiers(); |
---|
| 266 | bool result; |
---|
[51b7345] | 267 | #ifdef DEBUG |
---|
[2c57025] | 268 | std::cerr << "unifyInexact type 1 is "; |
---|
| 269 | type1->print( std::cerr ); |
---|
[0b150ec] | 270 | std::cerr << " type 2 is "; |
---|
[2c57025] | 271 | type2->print( std::cerr ); |
---|
| 272 | std::cerr << std::endl; |
---|
[51b7345] | 273 | #endif |
---|
[f474e91] | 274 | if ( ! unifyExact( type1, type2, env, needAssertions, haveAssertions, openVars, widen, indexer ) ) { |
---|
[51b7345] | 275 | #ifdef DEBUG |
---|
[2c57025] | 276 | std::cerr << "unifyInexact: no exact unification found" << std::endl; |
---|
[51b7345] | 277 | #endif |
---|
[f474e91] | 278 | if ( ( common = commonType( type1, type2, widen.first, widen.second, indexer, env, openVars ) ) ) { |
---|
[3315e3d] | 279 | common->tq = tq1.unify( tq2 ); |
---|
[51b7345] | 280 | #ifdef DEBUG |
---|
[2c57025] | 281 | std::cerr << "unifyInexact: common type is "; |
---|
| 282 | common->print( std::cerr ); |
---|
| 283 | std::cerr << std::endl; |
---|
[51b7345] | 284 | #endif |
---|
[a32b204] | 285 | result = true; |
---|
| 286 | } else { |
---|
[51b7345] | 287 | #ifdef DEBUG |
---|
[2c57025] | 288 | std::cerr << "unifyInexact: no common type found" << std::endl; |
---|
[51b7345] | 289 | #endif |
---|
[a32b204] | 290 | result = false; |
---|
| 291 | } // if |
---|
| 292 | } else { |
---|
| 293 | if ( tq1 != tq2 ) { |
---|
[f474e91] | 294 | if ( ( tq1 > tq2 || widen.first ) && ( tq2 > tq1 || widen.second ) ) { |
---|
[a32b204] | 295 | common = type1->clone(); |
---|
[3315e3d] | 296 | common->tq = tq1.unify( tq2 ); |
---|
[a32b204] | 297 | result = true; |
---|
| 298 | } else { |
---|
| 299 | result = false; |
---|
| 300 | } // if |
---|
| 301 | } else { |
---|
[e6cee92] | 302 | common = type1->clone(); |
---|
[3315e3d] | 303 | common->tq = tq1.unify( tq2 ); |
---|
[a32b204] | 304 | result = true; |
---|
| 305 | } // if |
---|
| 306 | } // if |
---|
| 307 | type1->get_qualifiers() = tq1; |
---|
| 308 | type2->get_qualifiers() = tq2; |
---|
| 309 | return result; |
---|
| 310 | } |
---|
| 311 | |
---|
[f474e91] | 312 | Unify_old::Unify_old( Type *type2, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, const OpenVarSet &openVars, WidenMode widen, const SymTab::Indexer &indexer ) |
---|
| 313 | : result( false ), type2( type2 ), env( env ), needAssertions( needAssertions ), haveAssertions( haveAssertions ), openVars( openVars ), widen( widen ), indexer( indexer ) { |
---|
[d76c588] | 314 | } |
---|
| 315 | |
---|
[f474e91] | 316 | void Unify_old::postvisit( __attribute__((unused)) VoidType *voidType) { |
---|
[a32b204] | 317 | result = dynamic_cast< VoidType* >( type2 ); |
---|
| 318 | } |
---|
| 319 | |
---|
[f474e91] | 320 | void Unify_old::postvisit(BasicType *basicType) { |
---|
[a32b204] | 321 | if ( BasicType *otherBasic = dynamic_cast< BasicType* >( type2 ) ) { |
---|
| 322 | result = basicType->get_kind() == otherBasic->get_kind(); |
---|
| 323 | } // if |
---|
| 324 | } |
---|
| 325 | |
---|
| 326 | void markAssertionSet( AssertionSet &assertions, DeclarationWithType *assert ) { |
---|
| 327 | AssertionSet::iterator i = assertions.find( assert ); |
---|
| 328 | if ( i != assertions.end() ) { |
---|
[6c3a988f] | 329 | i->second.isUsed = true; |
---|
[a32b204] | 330 | } // if |
---|
| 331 | } |
---|
| 332 | |
---|
| 333 | void markAssertions( AssertionSet &assertion1, AssertionSet &assertion2, Type *type ) { |
---|
[aefcc3b] | 334 | for ( std::list< TypeDecl* >::const_iterator tyvar = type->get_forall().begin(); tyvar != type->get_forall().end(); ++tyvar ) { |
---|
[a32b204] | 335 | for ( std::list< DeclarationWithType* >::const_iterator assert = (*tyvar)->get_assertions().begin(); assert != (*tyvar)->get_assertions().end(); ++assert ) { |
---|
| 336 | markAssertionSet( assertion1, *assert ); |
---|
| 337 | markAssertionSet( assertion2, *assert ); |
---|
| 338 | } // for |
---|
| 339 | } // for |
---|
| 340 | } |
---|
| 341 | |
---|
[f474e91] | 342 | void Unify_old::postvisit(PointerType *pointerType) { |
---|
[a32b204] | 343 | if ( PointerType *otherPointer = dynamic_cast< PointerType* >( type2 ) ) { |
---|
| 344 | result = unifyExact( pointerType->get_base(), otherPointer->get_base(), env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 345 | markAssertions( haveAssertions, needAssertions, pointerType ); |
---|
| 346 | markAssertions( haveAssertions, needAssertions, otherPointer ); |
---|
| 347 | } // if |
---|
| 348 | } |
---|
| 349 | |
---|
[f474e91] | 350 | void Unify_old::postvisit(ReferenceType *refType) { |
---|
[ce8c12f] | 351 | if ( ReferenceType *otherRef = dynamic_cast< ReferenceType* >( type2 ) ) { |
---|
| 352 | result = unifyExact( refType->get_base(), otherRef->get_base(), env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 353 | markAssertions( haveAssertions, needAssertions, refType ); |
---|
| 354 | markAssertions( haveAssertions, needAssertions, otherRef ); |
---|
| 355 | } // if |
---|
| 356 | } |
---|
| 357 | |
---|
[f474e91] | 358 | void Unify_old::postvisit(ArrayType *arrayType) { |
---|
[a32b204] | 359 | ArrayType *otherArray = dynamic_cast< ArrayType* >( type2 ); |
---|
[1cbca6e] | 360 | // to unify, array types must both be VLA or both not VLA |
---|
| 361 | // and must both have a dimension expression or not have a dimension |
---|
[41a2620] | 362 | if ( otherArray && arrayType->get_isVarLen() == otherArray->get_isVarLen() ) { |
---|
[1cbca6e] | 363 | |
---|
| 364 | if ( ! arrayType->get_isVarLen() && ! otherArray->get_isVarLen() && |
---|
| 365 | arrayType->get_dimension() != 0 && otherArray->get_dimension() != 0 ) { |
---|
| 366 | ConstantExpr * ce1 = dynamic_cast< ConstantExpr * >( arrayType->get_dimension() ); |
---|
| 367 | ConstantExpr * ce2 = dynamic_cast< ConstantExpr * >( otherArray->get_dimension() ); |
---|
[41a2620] | 368 | // see C11 Reference Manual 6.7.6.2.6 |
---|
| 369 | // two array types with size specifiers that are integer constant expressions are |
---|
| 370 | // compatible if both size specifiers have the same constant value |
---|
| 371 | if ( ce1 && ce2 ) { |
---|
| 372 | Constant * c1 = ce1->get_constant(); |
---|
| 373 | Constant * c2 = ce2->get_constant(); |
---|
| 374 | |
---|
| 375 | if ( c1->get_value() != c2->get_value() ) { |
---|
| 376 | // does not unify if the dimension is different |
---|
| 377 | return; |
---|
| 378 | } |
---|
[1cbca6e] | 379 | } |
---|
| 380 | } |
---|
| 381 | |
---|
[a32b204] | 382 | result = unifyExact( arrayType->get_base(), otherArray->get_base(), env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 383 | } // if |
---|
| 384 | } |
---|
| 385 | |
---|
[f3b0a07] | 386 | template< typename Iterator, typename Func > |
---|
| 387 | std::unique_ptr<Type> combineTypes( Iterator begin, Iterator end, Func & toType ) { |
---|
[53e3b4a] | 388 | std::list< Type * > types; |
---|
| 389 | for ( ; begin != end; ++begin ) { |
---|
[64eae56] | 390 | // it's guaranteed that a ttype variable will be bound to a flat tuple, so ensure that this results in a flat tuple |
---|
[f3b0a07] | 391 | flatten( toType( *begin ), back_inserter( types ) ); |
---|
[53e3b4a] | 392 | } |
---|
[6c3a988f] | 393 | return std::unique_ptr<Type>( new TupleType( Type::Qualifiers(), types ) ); |
---|
[53e3b4a] | 394 | } |
---|
| 395 | |
---|
[a32b204] | 396 | template< typename Iterator1, typename Iterator2 > |
---|
| 397 | bool unifyDeclList( Iterator1 list1Begin, Iterator1 list1End, Iterator2 list2Begin, Iterator2 list2End, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, const OpenVarSet &openVars, const SymTab::Indexer &indexer ) { |
---|
[f3b0a07] | 398 | auto get_type = [](DeclarationWithType * dwt){ return dwt->get_type(); }; |
---|
[a32b204] | 399 | for ( ; list1Begin != list1End && list2Begin != list2End; ++list1Begin, ++list2Begin ) { |
---|
[53e3b4a] | 400 | Type * t1 = (*list1Begin)->get_type(); |
---|
| 401 | Type * t2 = (*list2Begin)->get_type(); |
---|
| 402 | bool isTtype1 = Tuples::isTtype( t1 ); |
---|
| 403 | bool isTtype2 = Tuples::isTtype( t2 ); |
---|
[6c3a988f] | 404 | // xxx - assumes ttype must be last parameter |
---|
| 405 | // xxx - there may be a nice way to refactor this, but be careful because the argument positioning might matter in some cases. |
---|
[53e3b4a] | 406 | if ( isTtype1 && ! isTtype2 ) { |
---|
| 407 | // combine all of the things in list2, then unify |
---|
[f3b0a07] | 408 | return unifyExact( t1, combineTypes( list2Begin, list2End, get_type ).get(), env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
[53e3b4a] | 409 | } else if ( isTtype2 && ! isTtype1 ) { |
---|
| 410 | // combine all of the things in list1, then unify |
---|
[f3b0a07] | 411 | return unifyExact( combineTypes( list1Begin, list1End, get_type ).get(), t2, env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
[53e3b4a] | 412 | } else if ( ! unifyExact( t1, t2, env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ) ) { |
---|
[a32b204] | 413 | return false; |
---|
| 414 | } // if |
---|
| 415 | } // for |
---|
[6c3a988f] | 416 | // may get to the end of one argument list before the end of the other. This is only okay when the other is a ttype |
---|
[4c8621ac] | 417 | if ( list1Begin != list1End ) { |
---|
| 418 | // try unifying empty tuple type with ttype |
---|
| 419 | Type * t1 = (*list1Begin)->get_type(); |
---|
| 420 | if ( Tuples::isTtype( t1 ) ) { |
---|
[f3b0a07] | 421 | return unifyExact( t1, combineTypes( list2Begin, list2End, get_type ).get(), env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
[4c8621ac] | 422 | } else return false; |
---|
| 423 | } else if ( list2Begin != list2End ) { |
---|
| 424 | // try unifying empty tuple type with ttype |
---|
| 425 | Type * t2 = (*list2Begin)->get_type(); |
---|
| 426 | if ( Tuples::isTtype( t2 ) ) { |
---|
[f3b0a07] | 427 | return unifyExact( combineTypes( list1Begin, list1End, get_type ).get(), t2, env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
[4c8621ac] | 428 | } else return false; |
---|
[a32b204] | 429 | } else { |
---|
| 430 | return true; |
---|
| 431 | } // if |
---|
| 432 | } |
---|
| 433 | |
---|
[6c3a988f] | 434 | /// Finds ttypes and replaces them with their expansion, if known. |
---|
| 435 | /// This needs to be done so that satisfying ttype assertions is easier. |
---|
| 436 | /// If this isn't done then argument lists can have wildly different |
---|
| 437 | /// size and structure, when they should be compatible. |
---|
[f474e91] | 438 | struct TtypeExpander_old : public WithShortCircuiting { |
---|
[3096ec1] | 439 | TypeEnvironment & tenv; |
---|
[f474e91] | 440 | TtypeExpander_old( TypeEnvironment & tenv ) : tenv( tenv ) {} |
---|
[3096ec1] | 441 | void premutate( TypeInstType * ) { visit_children = false; } |
---|
| 442 | Type * postmutate( TypeInstType * typeInst ) { |
---|
[00ac42e] | 443 | if ( const EqvClass *eqvClass = tenv.lookup( typeInst->get_name() ) ) { |
---|
| 444 | // expand ttype parameter into its actual type |
---|
| 445 | if ( eqvClass->data.kind == TypeDecl::Ttype && eqvClass->type ) { |
---|
| 446 | delete typeInst; |
---|
| 447 | return eqvClass->type->clone(); |
---|
[6c3a988f] | 448 | } |
---|
| 449 | } |
---|
| 450 | return typeInst; |
---|
| 451 | } |
---|
| 452 | }; |
---|
| 453 | |
---|
| 454 | /// flattens a list of declarations, so that each tuple type has a single declaration. |
---|
| 455 | /// makes use of TtypeExpander to ensure ttypes are flat as well. |
---|
| 456 | void flattenList( std::list< DeclarationWithType * > src, std::list< DeclarationWithType * > & dst, TypeEnvironment & env ) { |
---|
| 457 | dst.clear(); |
---|
| 458 | for ( DeclarationWithType * dcl : src ) { |
---|
[f474e91] | 459 | PassVisitor<TtypeExpander_old> expander( env ); |
---|
[6c3a988f] | 460 | dcl->acceptMutator( expander ); |
---|
| 461 | std::list< Type * > types; |
---|
| 462 | flatten( dcl->get_type(), back_inserter( types ) ); |
---|
| 463 | for ( Type * t : types ) { |
---|
[1dcd52a3] | 464 | // outermost const, volatile, _Atomic qualifiers in parameters should not play a role in the unification of function types, since they do not determine whether a function is callable. |
---|
| 465 | // Note: MUST consider at least mutex qualifier, since functions can be overloaded on outermost mutex and a mutex function has different requirements than a non-mutex function. |
---|
| 466 | t->get_qualifiers() -= Type::Qualifiers(Type::Const | Type::Volatile | Type::Atomic); |
---|
| 467 | |
---|
[68fe077a] | 468 | dst.push_back( new ObjectDecl( "", Type::StorageClasses(), LinkageSpec::C, nullptr, t, nullptr ) ); |
---|
[6c3a988f] | 469 | } |
---|
| 470 | delete dcl; |
---|
| 471 | } |
---|
| 472 | } |
---|
| 473 | |
---|
[f474e91] | 474 | void Unify_old::postvisit(FunctionType *functionType) { |
---|
[a32b204] | 475 | FunctionType *otherFunction = dynamic_cast< FunctionType* >( type2 ); |
---|
| 476 | if ( otherFunction && functionType->get_isVarArgs() == otherFunction->get_isVarArgs() ) { |
---|
[6c3a988f] | 477 | // flatten the parameter lists for both functions so that tuple structure |
---|
| 478 | // doesn't affect unification. Must be a clone so that the types don't change. |
---|
| 479 | std::unique_ptr<FunctionType> flatFunc( functionType->clone() ); |
---|
| 480 | std::unique_ptr<FunctionType> flatOther( otherFunction->clone() ); |
---|
| 481 | flattenList( flatFunc->get_parameters(), flatFunc->get_parameters(), env ); |
---|
| 482 | flattenList( flatOther->get_parameters(), flatOther->get_parameters(), env ); |
---|
| 483 | |
---|
[53e3b4a] | 484 | // sizes don't have to match if ttypes are involved; need to be more precise wrt where the ttype is to prevent errors |
---|
[7870799] | 485 | if ( |
---|
| 486 | (flatFunc->parameters.size() == flatOther->parameters.size() && |
---|
| 487 | flatFunc->returnVals.size() == flatOther->returnVals.size()) |
---|
| 488 | || flatFunc->isTtype() |
---|
| 489 | || flatOther->isTtype() |
---|
[f474e91] | 490 | ) { |
---|
[538334a] | 491 | if ( unifyDeclList( flatFunc->parameters.begin(), flatFunc->parameters.end(), flatOther->parameters.begin(), flatOther->parameters.end(), env, needAssertions, haveAssertions, openVars, indexer ) ) { |
---|
| 492 | if ( unifyDeclList( flatFunc->returnVals.begin(), flatFunc->returnVals.end(), flatOther->returnVals.begin(), flatOther->returnVals.end(), env, needAssertions, haveAssertions, openVars, indexer ) ) { |
---|
[1cbca6e] | 493 | |
---|
[6c3a988f] | 494 | // the original types must be used in mark assertions, since pointer comparisons are used |
---|
[03da511] | 495 | markAssertions( haveAssertions, needAssertions, functionType ); |
---|
| 496 | markAssertions( haveAssertions, needAssertions, otherFunction ); |
---|
[41a2620] | 497 | |
---|
[03da511] | 498 | result = true; |
---|
| 499 | } // if |
---|
[a32b204] | 500 | } // if |
---|
| 501 | } // if |
---|
| 502 | } // if |
---|
| 503 | } |
---|
| 504 | |
---|
| 505 | template< typename RefType > |
---|
[f474e91] | 506 | void Unify_old::handleRefType( RefType *inst, Type *other ) { |
---|
[02ec390] | 507 | // check that other type is compatible and named the same |
---|
[a32b204] | 508 | RefType *otherStruct = dynamic_cast< RefType* >( other ); |
---|
[538334a] | 509 | result = otherStruct && inst->name == otherStruct->name; |
---|
[02ec390] | 510 | } |
---|
| 511 | |
---|
| 512 | template< typename RefType > |
---|
[f474e91] | 513 | void Unify_old::handleGenericRefType( RefType *inst, Type *other ) { |
---|
[02ec390] | 514 | // Check that other type is compatible and named the same |
---|
| 515 | handleRefType( inst, other ); |
---|
| 516 | if ( ! result ) return; |
---|
[f5234f3] | 517 | // Check that parameters of types unify, if any |
---|
[538334a] | 518 | std::list< Expression* > params = inst->parameters; |
---|
| 519 | std::list< Expression* > otherParams = ((RefType*)other)->parameters; |
---|
[f5234f3] | 520 | |
---|
| 521 | std::list< Expression* >::const_iterator it = params.begin(), jt = otherParams.begin(); |
---|
| 522 | for ( ; it != params.end() && jt != otherParams.end(); ++it, ++jt ) { |
---|
| 523 | TypeExpr *param = dynamic_cast< TypeExpr* >(*it); |
---|
[b2daebd4] | 524 | assertf(param, "Aggregate parameters should be type expressions"); |
---|
[f5234f3] | 525 | TypeExpr *otherParam = dynamic_cast< TypeExpr* >(*jt); |
---|
[b2daebd4] | 526 | assertf(otherParam, "Aggregate parameters should be type expressions"); |
---|
[ce8c12f] | 527 | |
---|
[b2daebd4] | 528 | Type* paramTy = param->get_type(); |
---|
| 529 | Type* otherParamTy = otherParam->get_type(); |
---|
[f5234f3] | 530 | |
---|
[b2daebd4] | 531 | bool tupleParam = Tuples::isTtype( paramTy ); |
---|
| 532 | bool otherTupleParam = Tuples::isTtype( otherParamTy ); |
---|
| 533 | |
---|
| 534 | if ( tupleParam && otherTupleParam ) { |
---|
| 535 | ++it; ++jt; // skip ttype parameters for break |
---|
| 536 | } else if ( tupleParam ) { |
---|
| 537 | // bundle other parameters into tuple to match |
---|
[62423350] | 538 | std::list< Type * > binderTypes; |
---|
[b2daebd4] | 539 | |
---|
| 540 | do { |
---|
[62423350] | 541 | binderTypes.push_back( otherParam->get_type()->clone() ); |
---|
[b2daebd4] | 542 | ++jt; |
---|
| 543 | |
---|
| 544 | if ( jt == otherParams.end() ) break; |
---|
| 545 | |
---|
| 546 | otherParam = dynamic_cast< TypeExpr* >(*jt); |
---|
| 547 | assertf(otherParam, "Aggregate parameters should be type expressions"); |
---|
| 548 | } while (true); |
---|
| 549 | |
---|
[62423350] | 550 | otherParamTy = new TupleType{ paramTy->get_qualifiers(), binderTypes }; |
---|
[b2daebd4] | 551 | ++it; // skip ttype parameter for break |
---|
| 552 | } else if ( otherTupleParam ) { |
---|
| 553 | // bundle parameters into tuple to match other |
---|
[62423350] | 554 | std::list< Type * > binderTypes; |
---|
[b2daebd4] | 555 | |
---|
| 556 | do { |
---|
[62423350] | 557 | binderTypes.push_back( param->get_type()->clone() ); |
---|
[b2daebd4] | 558 | ++it; |
---|
| 559 | |
---|
| 560 | if ( it == params.end() ) break; |
---|
| 561 | |
---|
| 562 | param = dynamic_cast< TypeExpr* >(*it); |
---|
| 563 | assertf(param, "Aggregate parameters should be type expressions"); |
---|
| 564 | } while (true); |
---|
| 565 | |
---|
[62423350] | 566 | paramTy = new TupleType{ otherParamTy->get_qualifiers(), binderTypes }; |
---|
[b2daebd4] | 567 | ++jt; // skip ttype parameter for break |
---|
| 568 | } |
---|
| 569 | |
---|
| 570 | if ( ! unifyExact( paramTy, otherParamTy, env, needAssertions, haveAssertions, openVars, WidenMode(false, false), indexer ) ) { |
---|
[02ec390] | 571 | result = false; |
---|
| 572 | return; |
---|
| 573 | } |
---|
[b2daebd4] | 574 | |
---|
| 575 | // ttype parameter should be last |
---|
| 576 | if ( tupleParam || otherTupleParam ) break; |
---|
[02ec390] | 577 | } |
---|
[f5234f3] | 578 | result = ( it == params.end() && jt == otherParams.end() ); |
---|
[02ec390] | 579 | } |
---|
[a32b204] | 580 | |
---|
[f474e91] | 581 | void Unify_old::postvisit(StructInstType *structInst) { |
---|
[02ec390] | 582 | handleGenericRefType( structInst, type2 ); |
---|
[a32b204] | 583 | } |
---|
| 584 | |
---|
[f474e91] | 585 | void Unify_old::postvisit(UnionInstType *unionInst) { |
---|
[02ec390] | 586 | handleGenericRefType( unionInst, type2 ); |
---|
[a32b204] | 587 | } |
---|
| 588 | |
---|
[f474e91] | 589 | void Unify_old::postvisit(EnumInstType *enumInst) { |
---|
[a32b204] | 590 | handleRefType( enumInst, type2 ); |
---|
| 591 | } |
---|
| 592 | |
---|
[f474e91] | 593 | void Unify_old::postvisit(TraitInstType *contextInst) { |
---|
[a32b204] | 594 | handleRefType( contextInst, type2 ); |
---|
| 595 | } |
---|
| 596 | |
---|
[f474e91] | 597 | void Unify_old::postvisit(TypeInstType *typeInst) { |
---|
[a32b204] | 598 | assert( openVars.find( typeInst->get_name() ) == openVars.end() ); |
---|
| 599 | TypeInstType *otherInst = dynamic_cast< TypeInstType* >( type2 ); |
---|
| 600 | if ( otherInst && typeInst->get_name() == otherInst->get_name() ) { |
---|
| 601 | result = true; |
---|
[51b7345] | 602 | /// } else { |
---|
| 603 | /// NamedTypeDecl *nt = indexer.lookupType( typeInst->get_name() ); |
---|
[a32b204] | 604 | /// if ( nt ) { |
---|
[51b7345] | 605 | /// TypeDecl *type = dynamic_cast< TypeDecl* >( nt ); |
---|
| 606 | /// assert( type ); |
---|
[a32b204] | 607 | /// if ( type->get_base() ) { |
---|
[51b7345] | 608 | /// result = unifyExact( type->get_base(), typeInst, env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 609 | /// } |
---|
| 610 | /// } |
---|
[a32b204] | 611 | } // if |
---|
| 612 | } |
---|
| 613 | |
---|
| 614 | template< typename Iterator1, typename Iterator2 > |
---|
[c77fd8b] | 615 | bool unifyList( Iterator1 list1Begin, Iterator1 list1End, Iterator2 list2Begin, Iterator2 list2End, TypeEnvironment &env, AssertionSet &needAssertions, AssertionSet &haveAssertions, const OpenVarSet &openVars, const SymTab::Indexer &indexer ) { |
---|
[f3b0a07] | 616 | auto get_type = [](Type * t) { return t; }; |
---|
[a32b204] | 617 | for ( ; list1Begin != list1End && list2Begin != list2End; ++list1Begin, ++list2Begin ) { |
---|
[f3b0a07] | 618 | Type * t1 = *list1Begin; |
---|
| 619 | Type * t2 = *list2Begin; |
---|
| 620 | bool isTtype1 = Tuples::isTtype( t1 ); |
---|
| 621 | bool isTtype2 = Tuples::isTtype( t2 ); |
---|
| 622 | // xxx - assumes ttype must be last parameter |
---|
| 623 | // xxx - there may be a nice way to refactor this, but be careful because the argument positioning might matter in some cases. |
---|
| 624 | if ( isTtype1 && ! isTtype2 ) { |
---|
| 625 | // combine all of the things in list2, then unify |
---|
| 626 | return unifyExact( t1, combineTypes( list2Begin, list2End, get_type ).get(), env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 627 | } else if ( isTtype2 && ! isTtype1 ) { |
---|
| 628 | // combine all of the things in list1, then unify |
---|
| 629 | return unifyExact( combineTypes( list1Begin, list1End, get_type ).get(), t2, env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 630 | } else if ( ! unifyExact( t1, t2, env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ) ) { |
---|
[a32b204] | 631 | return false; |
---|
[f3b0a07] | 632 | } // if |
---|
| 633 | |
---|
[a32b204] | 634 | } // for |
---|
[f3b0a07] | 635 | if ( list1Begin != list1End ) { |
---|
| 636 | // try unifying empty tuple type with ttype |
---|
| 637 | Type * t1 = *list1Begin; |
---|
| 638 | if ( Tuples::isTtype( t1 ) ) { |
---|
| 639 | return unifyExact( t1, combineTypes( list2Begin, list2End, get_type ).get(), env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 640 | } else return false; |
---|
| 641 | } else if ( list2Begin != list2End ) { |
---|
| 642 | // try unifying empty tuple type with ttype |
---|
| 643 | Type * t2 = *list2Begin; |
---|
| 644 | if ( Tuples::isTtype( t2 ) ) { |
---|
| 645 | return unifyExact( combineTypes( list1Begin, list1End, get_type ).get(), t2, env, needAssertions, haveAssertions, openVars, WidenMode( false, false ), indexer ); |
---|
| 646 | } else return false; |
---|
[a32b204] | 647 | } else { |
---|
| 648 | return true; |
---|
[f3b0a07] | 649 | } // if |
---|
[a32b204] | 650 | } |
---|
| 651 | |
---|
[f474e91] | 652 | void Unify_old::postvisit(TupleType *tupleType) { |
---|
[a32b204] | 653 | if ( TupleType *otherTuple = dynamic_cast< TupleType* >( type2 ) ) { |
---|
[f3b0a07] | 654 | std::unique_ptr<TupleType> flat1( tupleType->clone() ); |
---|
| 655 | std::unique_ptr<TupleType> flat2( otherTuple->clone() ); |
---|
| 656 | std::list<Type *> types1, types2; |
---|
| 657 | |
---|
[f474e91] | 658 | PassVisitor<TtypeExpander_old> expander( env ); |
---|
[f3b0a07] | 659 | flat1->acceptMutator( expander ); |
---|
| 660 | flat2->acceptMutator( expander ); |
---|
| 661 | |
---|
| 662 | flatten( flat1.get(), back_inserter( types1 ) ); |
---|
| 663 | flatten( flat2.get(), back_inserter( types2 ) ); |
---|
| 664 | |
---|
[c77fd8b] | 665 | result = unifyList( types1.begin(), types1.end(), types2.begin(), types2.end(), env, needAssertions, haveAssertions, openVars, indexer ); |
---|
[a32b204] | 666 | } // if |
---|
| 667 | } |
---|
[51b7345] | 668 | |
---|
[f474e91] | 669 | void Unify_old::postvisit( __attribute__((unused)) VarArgsType *varArgsType ) { |
---|
[44b7088] | 670 | result = dynamic_cast< VarArgsType* >( type2 ); |
---|
| 671 | } |
---|
| 672 | |
---|
[f474e91] | 673 | void Unify_old::postvisit( __attribute__((unused)) ZeroType *zeroType ) { |
---|
[89e6ffc] | 674 | result = dynamic_cast< ZeroType* >( type2 ); |
---|
| 675 | } |
---|
| 676 | |
---|
[f474e91] | 677 | void Unify_old::postvisit( __attribute__((unused)) OneType *oneType ) { |
---|
[89e6ffc] | 678 | result = dynamic_cast< OneType* >( type2 ); |
---|
| 679 | } |
---|
| 680 | |
---|
[906e24d] | 681 | Type * extractResultType( FunctionType * function ) { |
---|
| 682 | if ( function->get_returnVals().size() == 0 ) { |
---|
| 683 | return new VoidType( Type::Qualifiers() ); |
---|
| 684 | } else if ( function->get_returnVals().size() == 1 ) { |
---|
| 685 | return function->get_returnVals().front()->get_type()->clone(); |
---|
| 686 | } else { |
---|
[62423350] | 687 | std::list< Type * > types; |
---|
[906e24d] | 688 | for ( DeclarationWithType * decl : function->get_returnVals() ) { |
---|
[62423350] | 689 | types.push_back( decl->get_type()->clone() ); |
---|
[906e24d] | 690 | } // for |
---|
[62423350] | 691 | return new TupleType( Type::Qualifiers(), types ); |
---|
[906e24d] | 692 | } |
---|
| 693 | } |
---|
[54e41b3] | 694 | |
---|
[ee574a2] | 695 | class Unify_new final : public ast::WithShortCircuiting { |
---|
[f474e91] | 696 | const ast::Type * type2; |
---|
| 697 | ast::TypeEnvironment & tenv; |
---|
| 698 | ast::AssertionSet & need; |
---|
| 699 | ast::AssertionSet & have; |
---|
| 700 | const ast::OpenVarSet & open; |
---|
| 701 | WidenMode widen; |
---|
| 702 | const ast::SymbolTable & symtab; |
---|
| 703 | public: |
---|
[c15085d] | 704 | static size_t traceId; |
---|
[f474e91] | 705 | bool result; |
---|
| 706 | |
---|
[7870799] | 707 | Unify_new( |
---|
| 708 | const ast::Type * type2, ast::TypeEnvironment & env, ast::AssertionSet & need, |
---|
| 709 | ast::AssertionSet & have, const ast::OpenVarSet & open, WidenMode widen, |
---|
[f474e91] | 710 | const ast::SymbolTable & symtab ) |
---|
[7870799] | 711 | : type2(type2), tenv(env), need(need), have(have), open(open), widen(widen), |
---|
[f474e91] | 712 | symtab(symtab), result(false) {} |
---|
| 713 | |
---|
| 714 | void previsit( const ast::Node * ) { visit_children = false; } |
---|
[7870799] | 715 | |
---|
[ee574a2] | 716 | void postvisit( const ast::VoidType * ) { |
---|
[f474e91] | 717 | result = dynamic_cast< const ast::VoidType * >( type2 ); |
---|
| 718 | } |
---|
| 719 | |
---|
[ee574a2] | 720 | void postvisit( const ast::BasicType * basic ) { |
---|
[f474e91] | 721 | if ( auto basic2 = dynamic_cast< const ast::BasicType * >( type2 ) ) { |
---|
| 722 | result = basic->kind == basic2->kind; |
---|
| 723 | } |
---|
| 724 | } |
---|
| 725 | |
---|
[ee574a2] | 726 | void postvisit( const ast::PointerType * pointer ) { |
---|
[f474e91] | 727 | if ( auto pointer2 = dynamic_cast< const ast::PointerType * >( type2 ) ) { |
---|
[7870799] | 728 | result = unifyExact( |
---|
| 729 | pointer->base, pointer2->base, tenv, need, have, open, |
---|
[ee574a2] | 730 | noWiden(), symtab ); |
---|
[f474e91] | 731 | } |
---|
| 732 | } |
---|
| 733 | |
---|
[ee574a2] | 734 | void postvisit( const ast::ArrayType * array ) { |
---|
[f474e91] | 735 | auto array2 = dynamic_cast< const ast::ArrayType * >( type2 ); |
---|
| 736 | if ( ! array2 ) return; |
---|
| 737 | |
---|
[7870799] | 738 | // to unify, array types must both be VLA or both not VLA and both must have a |
---|
[f474e91] | 739 | // dimension expression or not have a dimension |
---|
| 740 | if ( array->isVarLen != array2->isVarLen ) return; |
---|
[7870799] | 741 | if ( ! array->isVarLen && ! array2->isVarLen |
---|
[f474e91] | 742 | && array->dimension && array2->dimension ) { |
---|
| 743 | auto ce1 = array->dimension.as< ast::ConstantExpr >(); |
---|
| 744 | auto ce2 = array2->dimension.as< ast::ConstantExpr >(); |
---|
| 745 | |
---|
| 746 | // see C11 Reference Manual 6.7.6.2.6 |
---|
[7870799] | 747 | // two array types with size specifiers that are integer constant expressions are |
---|
[f474e91] | 748 | // compatible if both size specifiers have the same constant value |
---|
| 749 | if ( ce1 && ce2 && ce1->intValue() != ce2->intValue() ) return; |
---|
| 750 | } |
---|
| 751 | |
---|
[7870799] | 752 | result = unifyExact( |
---|
| 753 | array->base, array2->base, tenv, need, have, open, noWiden(), |
---|
[f474e91] | 754 | symtab ); |
---|
| 755 | } |
---|
| 756 | |
---|
[ee574a2] | 757 | void postvisit( const ast::ReferenceType * ref ) { |
---|
[f474e91] | 758 | if ( auto ref2 = dynamic_cast< const ast::ReferenceType * >( type2 ) ) { |
---|
[7870799] | 759 | result = unifyExact( |
---|
| 760 | ref->base, ref2->base, tenv, need, have, open, noWiden(), |
---|
[f474e91] | 761 | symtab ); |
---|
| 762 | } |
---|
| 763 | } |
---|
| 764 | |
---|
| 765 | private: |
---|
| 766 | /// Replaces ttype variables with their bound types. |
---|
[7870799] | 767 | /// If this isn't done when satifying ttype assertions, then argument lists can have |
---|
[f474e91] | 768 | /// different size and structure when they should be compatible. |
---|
| 769 | struct TtypeExpander_new : public ast::WithShortCircuiting { |
---|
| 770 | ast::TypeEnvironment & tenv; |
---|
| 771 | |
---|
| 772 | TtypeExpander_new( ast::TypeEnvironment & env ) : tenv( env ) {} |
---|
| 773 | |
---|
[ee574a2] | 774 | const ast::Type * postvisit( const ast::TypeInstType * typeInst ) { |
---|
[f474e91] | 775 | if ( const ast::EqvClass * clz = tenv.lookup( typeInst->name ) ) { |
---|
| 776 | // expand ttype parameter into its actual type |
---|
[07de76b] | 777 | if ( clz->data.kind == ast::TypeDecl::Ttype && clz->bound ) { |
---|
[f474e91] | 778 | return clz->bound; |
---|
| 779 | } |
---|
| 780 | } |
---|
| 781 | return typeInst; |
---|
| 782 | } |
---|
| 783 | }; |
---|
| 784 | |
---|
| 785 | /// returns flattened version of `src` |
---|
| 786 | static std::vector< ast::ptr< ast::DeclWithType > > flattenList( |
---|
| 787 | const std::vector< ast::ptr< ast::DeclWithType > > & src, ast::TypeEnvironment & env |
---|
| 788 | ) { |
---|
| 789 | std::vector< ast::ptr< ast::DeclWithType > > dst; |
---|
| 790 | dst.reserve( src.size() ); |
---|
| 791 | for ( const ast::DeclWithType * d : src ) { |
---|
| 792 | ast::Pass<TtypeExpander_new> expander{ env }; |
---|
| 793 | d = d->accept( expander ); |
---|
| 794 | auto types = flatten( d->get_type() ); |
---|
| 795 | for ( ast::ptr< ast::Type > & t : types ) { |
---|
[7870799] | 796 | // outermost const, volatile, _Atomic qualifiers in parameters should not play |
---|
| 797 | // a role in the unification of function types, since they do not determine |
---|
[f474e91] | 798 | // whether a function is callable. |
---|
[7870799] | 799 | // NOTE: **must** consider at least mutex qualifier, since functions can be |
---|
| 800 | // overloaded on outermost mutex and a mutex function has different |
---|
[f474e91] | 801 | // requirements than a non-mutex function |
---|
[ee574a2] | 802 | remove_qualifiers( t, ast::CV::Const | ast::CV::Volatile | ast::CV::Atomic ); |
---|
[f474e91] | 803 | dst.emplace_back( new ast::ObjectDecl{ d->location, "", t } ); |
---|
| 804 | } |
---|
| 805 | } |
---|
| 806 | return dst; |
---|
| 807 | } |
---|
| 808 | |
---|
| 809 | /// Creates a tuple type based on a list of DeclWithType |
---|
| 810 | template< typename Iter > |
---|
| 811 | static ast::ptr< ast::Type > tupleFromDecls( Iter crnt, Iter end ) { |
---|
| 812 | std::vector< ast::ptr< ast::Type > > types; |
---|
| 813 | while ( crnt != end ) { |
---|
[7870799] | 814 | // it is guaranteed that a ttype variable will be bound to a flat tuple, so ensure |
---|
[f474e91] | 815 | // that this results in a flat tuple |
---|
| 816 | flatten( (*crnt)->get_type(), types ); |
---|
| 817 | |
---|
| 818 | ++crnt; |
---|
| 819 | } |
---|
| 820 | |
---|
| 821 | return { new ast::TupleType{ std::move(types) } }; |
---|
| 822 | } |
---|
| 823 | |
---|
| 824 | template< typename Iter > |
---|
[7870799] | 825 | static bool unifyDeclList( |
---|
| 826 | Iter crnt1, Iter end1, Iter crnt2, Iter end2, ast::TypeEnvironment & env, |
---|
| 827 | ast::AssertionSet & need, ast::AssertionSet & have, const ast::OpenVarSet & open, |
---|
[f474e91] | 828 | const ast::SymbolTable & symtab |
---|
| 829 | ) { |
---|
| 830 | while ( crnt1 != end1 && crnt2 != end2 ) { |
---|
| 831 | const ast::Type * t1 = (*crnt1)->get_type(); |
---|
| 832 | const ast::Type * t2 = (*crnt2)->get_type(); |
---|
| 833 | bool isTuple1 = Tuples::isTtype( t1 ); |
---|
| 834 | bool isTuple2 = Tuples::isTtype( t2 ); |
---|
| 835 | |
---|
| 836 | // assumes here that ttype *must* be last parameter |
---|
| 837 | if ( isTuple1 && ! isTuple2 ) { |
---|
| 838 | // combine remainder of list2, then unify |
---|
[7870799] | 839 | return unifyExact( |
---|
| 840 | t1, tupleFromDecls( crnt2, end2 ), env, need, have, open, |
---|
[ee574a2] | 841 | noWiden(), symtab ); |
---|
[f474e91] | 842 | } else if ( ! isTuple1 && isTuple2 ) { |
---|
| 843 | // combine remainder of list1, then unify |
---|
[7870799] | 844 | return unifyExact( |
---|
| 845 | tupleFromDecls( crnt1, end1 ), t2, env, need, have, open, |
---|
[ee574a2] | 846 | noWiden(), symtab ); |
---|
[f474e91] | 847 | } |
---|
| 848 | |
---|
[7870799] | 849 | if ( ! unifyExact( |
---|
| 850 | t1, t2, env, need, have, open, noWiden(), symtab ) |
---|
[f474e91] | 851 | ) return false; |
---|
| 852 | |
---|
| 853 | ++crnt1; ++crnt2; |
---|
| 854 | } |
---|
| 855 | |
---|
[7870799] | 856 | // May get to the end of one argument list before the other. This is only okay if the |
---|
[f474e91] | 857 | // other is a ttype |
---|
| 858 | if ( crnt1 != end1 ) { |
---|
| 859 | // try unifying empty tuple with ttype |
---|
| 860 | const ast::Type * t1 = (*crnt1)->get_type(); |
---|
| 861 | if ( ! Tuples::isTtype( t1 ) ) return false; |
---|
[7870799] | 862 | return unifyExact( |
---|
| 863 | t1, tupleFromDecls( crnt2, end2 ), env, need, have, open, |
---|
[ee574a2] | 864 | noWiden(), symtab ); |
---|
[f474e91] | 865 | } else if ( crnt2 != end2 ) { |
---|
| 866 | // try unifying empty tuple with ttype |
---|
| 867 | const ast::Type * t2 = (*crnt2)->get_type(); |
---|
| 868 | if ( ! Tuples::isTtype( t2 ) ) return false; |
---|
[7870799] | 869 | return unifyExact( |
---|
| 870 | tupleFromDecls( crnt1, end1 ), t2, env, need, have, open, |
---|
[ee574a2] | 871 | noWiden(), symtab ); |
---|
[f474e91] | 872 | } |
---|
| 873 | |
---|
| 874 | return true; |
---|
| 875 | } |
---|
| 876 | |
---|
[7870799] | 877 | static bool unifyDeclList( |
---|
| 878 | const std::vector< ast::ptr< ast::DeclWithType > > & list1, |
---|
| 879 | const std::vector< ast::ptr< ast::DeclWithType > > & list2, |
---|
| 880 | ast::TypeEnvironment & env, ast::AssertionSet & need, ast::AssertionSet & have, |
---|
[f474e91] | 881 | const ast::OpenVarSet & open, const ast::SymbolTable & symtab |
---|
| 882 | ) { |
---|
[7870799] | 883 | return unifyDeclList( |
---|
| 884 | list1.begin(), list1.end(), list2.begin(), list2.end(), env, need, have, open, |
---|
[f474e91] | 885 | symtab ); |
---|
| 886 | } |
---|
| 887 | |
---|
| 888 | static void markAssertionSet( ast::AssertionSet & assns, const ast::DeclWithType * assn ) { |
---|
| 889 | auto i = assns.find( assn ); |
---|
| 890 | if ( i != assns.end() ) { |
---|
| 891 | i->second.isUsed = true; |
---|
| 892 | } |
---|
| 893 | } |
---|
| 894 | |
---|
| 895 | /// mark all assertions in `type` used in both `assn1` and `assn2` |
---|
[7870799] | 896 | static void markAssertions( |
---|
| 897 | ast::AssertionSet & assn1, ast::AssertionSet & assn2, |
---|
| 898 | const ast::ParameterizedType * type |
---|
[f474e91] | 899 | ) { |
---|
| 900 | for ( const auto & tyvar : type->forall ) { |
---|
| 901 | for ( const ast::DeclWithType * assert : tyvar->assertions ) { |
---|
| 902 | markAssertionSet( assn1, assert ); |
---|
| 903 | markAssertionSet( assn2, assert ); |
---|
| 904 | } |
---|
| 905 | } |
---|
| 906 | } |
---|
| 907 | |
---|
| 908 | public: |
---|
[ee574a2] | 909 | void postvisit( const ast::FunctionType * func ) { |
---|
[f474e91] | 910 | auto func2 = dynamic_cast< const ast::FunctionType * >( type2 ); |
---|
| 911 | if ( ! func2 ) return; |
---|
| 912 | |
---|
| 913 | if ( func->isVarArgs != func2->isVarArgs ) return; |
---|
[7870799] | 914 | |
---|
| 915 | // Flatten the parameter lists for both functions so that tuple structure does not |
---|
[f474e91] | 916 | // affect unification. Does not actually mutate function parameters. |
---|
| 917 | auto params = flattenList( func->params, tenv ); |
---|
| 918 | auto params2 = flattenList( func2->params, tenv ); |
---|
| 919 | |
---|
[7870799] | 920 | // sizes don't have to match if ttypes are involved; need to be more precise w.r.t. |
---|
[f474e91] | 921 | // where the ttype is to prevent errors |
---|
[7870799] | 922 | if ( |
---|
[f474e91] | 923 | ( params.size() != params2.size() || func->returns.size() != func2->returns.size() ) |
---|
| 924 | && ! func->isTtype() |
---|
| 925 | && ! func2->isTtype() |
---|
| 926 | ) return; |
---|
| 927 | |
---|
| 928 | if ( ! unifyDeclList( params, params2, tenv, need, have, open, symtab ) ) return; |
---|
[7870799] | 929 | if ( ! unifyDeclList( |
---|
[f474e91] | 930 | func->returns, func2->returns, tenv, need, have, open, symtab ) ) return; |
---|
[7870799] | 931 | |
---|
[f474e91] | 932 | markAssertions( have, need, func ); |
---|
| 933 | markAssertions( have, need, func2 ); |
---|
| 934 | |
---|
| 935 | result = true; |
---|
| 936 | } |
---|
[7870799] | 937 | |
---|
[f474e91] | 938 | private: |
---|
[90ce35aa] | 939 | // Returns: other, cast as XInstType |
---|
| 940 | // Assigns this->result: whether types are compatible (up to generic parameters) |
---|
| 941 | template< typename XInstType > |
---|
| 942 | const XInstType * handleRefType( const XInstType * inst, const ast::Type * other ) { |
---|
[f474e91] | 943 | // check that the other type is compatible and named the same |
---|
[90ce35aa] | 944 | auto otherInst = dynamic_cast< const XInstType * >( other ); |
---|
| 945 | this->result = otherInst && inst->name == otherInst->name; |
---|
[f474e91] | 946 | return otherInst; |
---|
| 947 | } |
---|
| 948 | |
---|
| 949 | /// Creates a tuple type based on a list of TypeExpr |
---|
| 950 | template< typename Iter > |
---|
[7870799] | 951 | static const ast::Type * tupleFromExprs( |
---|
[f474e91] | 952 | const ast::TypeExpr * param, Iter & crnt, Iter end, ast::CV::Qualifiers qs |
---|
| 953 | ) { |
---|
| 954 | std::vector< ast::ptr< ast::Type > > types; |
---|
| 955 | do { |
---|
| 956 | types.emplace_back( param->type ); |
---|
| 957 | |
---|
| 958 | ++crnt; |
---|
| 959 | if ( crnt == end ) break; |
---|
| 960 | param = strict_dynamic_cast< const ast::TypeExpr * >( crnt->get() ); |
---|
| 961 | } while(true); |
---|
| 962 | |
---|
| 963 | return new ast::TupleType{ std::move(types), qs }; |
---|
| 964 | } |
---|
| 965 | |
---|
[90ce35aa] | 966 | template< typename XInstType > |
---|
| 967 | void handleGenericRefType( const XInstType * inst, const ast::Type * other ) { |
---|
[f474e91] | 968 | // check that other type is compatible and named the same |
---|
[90ce35aa] | 969 | const XInstType * otherInst = handleRefType( inst, other ); |
---|
| 970 | if ( ! this->result ) return; |
---|
[7870799] | 971 | |
---|
[f474e91] | 972 | // check that parameters of types unify, if any |
---|
| 973 | const std::vector< ast::ptr< ast::Expr > > & params = inst->params; |
---|
[90ce35aa] | 974 | const std::vector< ast::ptr< ast::Expr > > & params2 = otherInst->params; |
---|
[f474e91] | 975 | |
---|
| 976 | auto it = params.begin(); |
---|
| 977 | auto jt = params2.begin(); |
---|
| 978 | for ( ; it != params.end() && jt != params2.end(); ++it, ++jt ) { |
---|
| 979 | auto param = strict_dynamic_cast< const ast::TypeExpr * >( it->get() ); |
---|
| 980 | auto param2 = strict_dynamic_cast< const ast::TypeExpr * >( jt->get() ); |
---|
| 981 | |
---|
| 982 | ast::ptr< ast::Type > pty = param->type; |
---|
| 983 | ast::ptr< ast::Type > pty2 = param2->type; |
---|
| 984 | |
---|
| 985 | bool isTuple = Tuples::isTtype( pty ); |
---|
| 986 | bool isTuple2 = Tuples::isTtype( pty2 ); |
---|
| 987 | |
---|
| 988 | if ( isTuple && isTuple2 ) { |
---|
| 989 | ++it; ++jt; // skip ttype parameters before break |
---|
| 990 | } else if ( isTuple ) { |
---|
| 991 | // bundle remaining params into tuple |
---|
| 992 | pty2 = tupleFromExprs( param2, jt, params2.end(), pty->qualifiers ); |
---|
| 993 | ++it; // skip ttype parameter for break |
---|
| 994 | } else if ( isTuple2 ) { |
---|
| 995 | // bundle remaining params into tuple |
---|
| 996 | pty = tupleFromExprs( param, it, params.end(), pty2->qualifiers ); |
---|
| 997 | ++jt; // skip ttype parameter for break |
---|
| 998 | } |
---|
| 999 | |
---|
[7870799] | 1000 | if ( ! unifyExact( |
---|
[ee574a2] | 1001 | pty, pty2, tenv, need, have, open, noWiden(), symtab ) ) { |
---|
[f474e91] | 1002 | result = false; |
---|
| 1003 | return; |
---|
| 1004 | } |
---|
| 1005 | |
---|
| 1006 | // ttype parameter should be last |
---|
| 1007 | if ( isTuple || isTuple2 ) break; |
---|
| 1008 | } |
---|
| 1009 | result = it == params.end() && jt == params2.end(); |
---|
| 1010 | } |
---|
| 1011 | |
---|
| 1012 | public: |
---|
[ee574a2] | 1013 | void postvisit( const ast::StructInstType * aggrType ) { |
---|
[f474e91] | 1014 | handleGenericRefType( aggrType, type2 ); |
---|
| 1015 | } |
---|
| 1016 | |
---|
[ee574a2] | 1017 | void postvisit( const ast::UnionInstType * aggrType ) { |
---|
[f474e91] | 1018 | handleGenericRefType( aggrType, type2 ); |
---|
| 1019 | } |
---|
| 1020 | |
---|
[ee574a2] | 1021 | void postvisit( const ast::EnumInstType * aggrType ) { |
---|
[f474e91] | 1022 | handleRefType( aggrType, type2 ); |
---|
| 1023 | } |
---|
| 1024 | |
---|
[ee574a2] | 1025 | void postvisit( const ast::TraitInstType * aggrType ) { |
---|
[f474e91] | 1026 | handleRefType( aggrType, type2 ); |
---|
| 1027 | } |
---|
| 1028 | |
---|
[ee574a2] | 1029 | void postvisit( const ast::TypeInstType * typeInst ) { |
---|
[f474e91] | 1030 | assert( open.find( typeInst->name ) == open.end() ); |
---|
| 1031 | handleRefType( typeInst, type2 ); |
---|
| 1032 | } |
---|
| 1033 | |
---|
| 1034 | private: |
---|
| 1035 | /// Creates a tuple type based on a list of Type |
---|
[7870799] | 1036 | static ast::ptr< ast::Type > tupleFromTypes( |
---|
[f474e91] | 1037 | const std::vector< ast::ptr< ast::Type > > & tys |
---|
| 1038 | ) { |
---|
| 1039 | std::vector< ast::ptr< ast::Type > > out; |
---|
| 1040 | for ( const ast::Type * ty : tys ) { |
---|
[7870799] | 1041 | // it is guaranteed that a ttype variable will be bound to a flat tuple, so ensure |
---|
[f474e91] | 1042 | // that this results in a flat tuple |
---|
| 1043 | flatten( ty, out ); |
---|
| 1044 | } |
---|
| 1045 | |
---|
| 1046 | return { new ast::TupleType{ std::move(out) } }; |
---|
| 1047 | } |
---|
| 1048 | |
---|
[7870799] | 1049 | static bool unifyList( |
---|
| 1050 | const std::vector< ast::ptr< ast::Type > > & list1, |
---|
| 1051 | const std::vector< ast::ptr< ast::Type > > & list2, ast::TypeEnvironment & env, |
---|
| 1052 | ast::AssertionSet & need, ast::AssertionSet & have, const ast::OpenVarSet & open, |
---|
[f474e91] | 1053 | const ast::SymbolTable & symtab |
---|
| 1054 | ) { |
---|
| 1055 | auto crnt1 = list1.begin(); |
---|
| 1056 | auto crnt2 = list2.begin(); |
---|
| 1057 | while ( crnt1 != list1.end() && crnt2 != list2.end() ) { |
---|
| 1058 | const ast::Type * t1 = *crnt1; |
---|
| 1059 | const ast::Type * t2 = *crnt2; |
---|
| 1060 | bool isTuple1 = Tuples::isTtype( t1 ); |
---|
| 1061 | bool isTuple2 = Tuples::isTtype( t2 ); |
---|
| 1062 | |
---|
| 1063 | // assumes ttype must be last parameter |
---|
| 1064 | if ( isTuple1 && ! isTuple2 ) { |
---|
| 1065 | // combine entirety of list2, then unify |
---|
[7870799] | 1066 | return unifyExact( |
---|
| 1067 | t1, tupleFromTypes( list2 ), env, need, have, open, |
---|
[ee574a2] | 1068 | noWiden(), symtab ); |
---|
[f474e91] | 1069 | } else if ( ! isTuple1 && isTuple2 ) { |
---|
| 1070 | // combine entirety of list1, then unify |
---|
| 1071 | return unifyExact( |
---|
[7870799] | 1072 | tupleFromTypes( list1 ), t2, env, need, have, open, |
---|
[ee574a2] | 1073 | noWiden(), symtab ); |
---|
[f474e91] | 1074 | } |
---|
| 1075 | |
---|
[7870799] | 1076 | if ( ! unifyExact( |
---|
| 1077 | t1, t2, env, need, have, open, noWiden(), symtab ) |
---|
[f474e91] | 1078 | ) return false; |
---|
| 1079 | |
---|
| 1080 | ++crnt1; ++crnt2; |
---|
| 1081 | } |
---|
| 1082 | |
---|
| 1083 | if ( crnt1 != list1.end() ) { |
---|
| 1084 | // try unifying empty tuple type with ttype |
---|
| 1085 | const ast::Type * t1 = *crnt1; |
---|
| 1086 | if ( ! Tuples::isTtype( t1 ) ) return false; |
---|
[7870799] | 1087 | // xxx - this doesn't generate an empty tuple, contrary to comment; both ported |
---|
[f474e91] | 1088 | // from Rob's code |
---|
[7870799] | 1089 | return unifyExact( |
---|
| 1090 | t1, tupleFromTypes( list2 ), env, need, have, open, |
---|
[ee574a2] | 1091 | noWiden(), symtab ); |
---|
[f474e91] | 1092 | } else if ( crnt2 != list2.end() ) { |
---|
| 1093 | // try unifying empty tuple with ttype |
---|
| 1094 | const ast::Type * t2 = *crnt2; |
---|
| 1095 | if ( ! Tuples::isTtype( t2 ) ) return false; |
---|
[7870799] | 1096 | // xxx - this doesn't generate an empty tuple, contrary to comment; both ported |
---|
[f474e91] | 1097 | // from Rob's code |
---|
| 1098 | return unifyExact( |
---|
[7870799] | 1099 | tupleFromTypes( list1 ), t2, env, need, have, open, |
---|
[ee574a2] | 1100 | noWiden(), symtab ); |
---|
[f474e91] | 1101 | } |
---|
| 1102 | |
---|
| 1103 | return true; |
---|
| 1104 | } |
---|
| 1105 | |
---|
| 1106 | public: |
---|
[ee574a2] | 1107 | void postvisit( const ast::TupleType * tuple ) { |
---|
[f474e91] | 1108 | auto tuple2 = dynamic_cast< const ast::TupleType * >( type2 ); |
---|
| 1109 | if ( ! tuple2 ) return; |
---|
| 1110 | |
---|
| 1111 | ast::Pass<TtypeExpander_new> expander{ tenv }; |
---|
| 1112 | const ast::Type * flat = tuple->accept( expander ); |
---|
| 1113 | const ast::Type * flat2 = tuple2->accept( expander ); |
---|
| 1114 | |
---|
| 1115 | auto types = flatten( flat ); |
---|
| 1116 | auto types2 = flatten( flat2 ); |
---|
| 1117 | |
---|
| 1118 | result = unifyList( types, types2, tenv, need, have, open, symtab ); |
---|
| 1119 | } |
---|
| 1120 | |
---|
[ee574a2] | 1121 | void postvisit( const ast::VarArgsType * ) { |
---|
[f474e91] | 1122 | result = dynamic_cast< const ast::VarArgsType * >( type2 ); |
---|
| 1123 | } |
---|
| 1124 | |
---|
[ee574a2] | 1125 | void postvisit( const ast::ZeroType * ) { |
---|
[f474e91] | 1126 | result = dynamic_cast< const ast::ZeroType * >( type2 ); |
---|
| 1127 | } |
---|
| 1128 | |
---|
[ee574a2] | 1129 | void postvisit( const ast::OneType * ) { |
---|
[f474e91] | 1130 | result = dynamic_cast< const ast::OneType * >( type2 ); |
---|
[7870799] | 1131 | } |
---|
[f474e91] | 1132 | |
---|
| 1133 | private: |
---|
| 1134 | template< typename RefType > void handleRefType( RefType *inst, Type *other ); |
---|
| 1135 | template< typename RefType > void handleGenericRefType( RefType *inst, Type *other ); |
---|
| 1136 | }; |
---|
| 1137 | |
---|
[c15085d] | 1138 | size_t Unify_new::traceId = Stats::Heap::new_stacktrace_id("Unify_new"); |
---|
[7870799] | 1139 | bool unify( |
---|
| 1140 | const ast::ptr<ast::Type> & type1, const ast::ptr<ast::Type> & type2, |
---|
| 1141 | ast::TypeEnvironment & env, ast::AssertionSet & need, ast::AssertionSet & have, |
---|
[2773ab8] | 1142 | ast::OpenVarSet & open, const ast::SymbolTable & symtab |
---|
| 1143 | ) { |
---|
| 1144 | ast::ptr<ast::Type> common; |
---|
| 1145 | return unify( type1, type2, env, need, have, open, symtab, common ); |
---|
| 1146 | } |
---|
| 1147 | |
---|
[7870799] | 1148 | bool unify( |
---|
| 1149 | const ast::ptr<ast::Type> & type1, const ast::ptr<ast::Type> & type2, |
---|
| 1150 | ast::TypeEnvironment & env, ast::AssertionSet & need, ast::AssertionSet & have, |
---|
| 1151 | ast::OpenVarSet & open, const ast::SymbolTable & symtab, ast::ptr<ast::Type> & common |
---|
[ee574a2] | 1152 | ) { |
---|
| 1153 | ast::OpenVarSet closed; |
---|
| 1154 | findOpenVars( type1, open, closed, need, have, FirstClosed ); |
---|
| 1155 | findOpenVars( type2, open, closed, need, have, FirstOpen ); |
---|
[7870799] | 1156 | return unifyInexact( |
---|
[ee574a2] | 1157 | type1, type2, env, need, have, open, WidenMode{ true, true }, symtab, common ); |
---|
| 1158 | } |
---|
| 1159 | |
---|
[7870799] | 1160 | bool unifyExact( |
---|
| 1161 | const ast::Type * type1, const ast::Type * type2, ast::TypeEnvironment & env, |
---|
| 1162 | ast::AssertionSet & need, ast::AssertionSet & have, const ast::OpenVarSet & open, |
---|
[f474e91] | 1163 | WidenMode widen, const ast::SymbolTable & symtab |
---|
| 1164 | ) { |
---|
| 1165 | if ( type1->qualifiers != type2->qualifiers ) return false; |
---|
| 1166 | |
---|
| 1167 | auto var1 = dynamic_cast< const ast::TypeInstType * >( type1 ); |
---|
| 1168 | auto var2 = dynamic_cast< const ast::TypeInstType * >( type2 ); |
---|
[7870799] | 1169 | ast::OpenVarSet::const_iterator |
---|
| 1170 | entry1 = var1 ? open.find( var1->name ) : open.end(), |
---|
[f474e91] | 1171 | entry2 = var2 ? open.find( var2->name ) : open.end(); |
---|
| 1172 | bool isopen1 = entry1 != open.end(); |
---|
| 1173 | bool isopen2 = entry2 != open.end(); |
---|
| 1174 | |
---|
| 1175 | if ( isopen1 && isopen2 ) { |
---|
| 1176 | if ( entry1->second.kind != entry2->second.kind ) return false; |
---|
[7870799] | 1177 | return env.bindVarToVar( |
---|
| 1178 | var1, var2, ast::TypeDecl::Data{ entry1->second, entry2->second }, need, have, |
---|
[f474e91] | 1179 | open, widen, symtab ); |
---|
| 1180 | } else if ( isopen1 ) { |
---|
| 1181 | return env.bindVar( var1, type2, entry1->second, need, have, open, widen, symtab ); |
---|
| 1182 | } else if ( isopen2 ) { |
---|
| 1183 | return env.bindVar( var2, type1, entry2->second, need, have, open, widen, symtab ); |
---|
| 1184 | } else { |
---|
| 1185 | ast::Pass<Unify_new> comparator{ type2, env, need, have, open, widen, symtab }; |
---|
| 1186 | type1->accept( comparator ); |
---|
| 1187 | return comparator.pass.result; |
---|
| 1188 | } |
---|
| 1189 | } |
---|
| 1190 | |
---|
[7870799] | 1191 | bool unifyInexact( |
---|
| 1192 | const ast::ptr<ast::Type> & type1, const ast::ptr<ast::Type> & type2, |
---|
| 1193 | ast::TypeEnvironment & env, ast::AssertionSet & need, ast::AssertionSet & have, |
---|
| 1194 | const ast::OpenVarSet & open, WidenMode widen, const ast::SymbolTable & symtab, |
---|
| 1195 | ast::ptr<ast::Type> & common |
---|
[f474e91] | 1196 | ) { |
---|
| 1197 | ast::CV::Qualifiers q1 = type1->qualifiers, q2 = type2->qualifiers; |
---|
[7870799] | 1198 | |
---|
| 1199 | // force t1 and t2 to be cloned if their qualifiers must be stripped, so that type1 and |
---|
[f474e91] | 1200 | // type2 are left unchanged; calling convention forces type{1,2}->strong_ref >= 1 |
---|
[2890212] | 1201 | ast::Type * t1 = shallowCopy(type1.get()); |
---|
| 1202 | ast::Type * t2 = shallowCopy(type2.get()); |
---|
| 1203 | t1->qualifiers = {}; |
---|
| 1204 | t2->qualifiers = {}; |
---|
[f49b3fc] | 1205 | ast::ptr< ast::Type > t1_(t1); |
---|
| 1206 | ast::ptr< ast::Type > t2_(t2); |
---|
[7870799] | 1207 | |
---|
[f474e91] | 1208 | if ( unifyExact( t1, t2, env, need, have, open, widen, symtab ) ) { |
---|
| 1209 | // if exact unification on unqualified types, try to merge qualifiers |
---|
| 1210 | if ( q1 == q2 || ( ( q1 > q2 || widen.first ) && ( q2 > q1 || widen.second ) ) ) { |
---|
[2890212] | 1211 | t1->qualifiers = q1 | q2; |
---|
| 1212 | common = t1; |
---|
[f474e91] | 1213 | return true; |
---|
| 1214 | } else { |
---|
| 1215 | return false; |
---|
| 1216 | } |
---|
| 1217 | |
---|
| 1218 | } else if (( common = commonType( t1, t2, widen, symtab, env, open ) )) { |
---|
| 1219 | // no exact unification, but common type |
---|
[2890212] | 1220 | auto c = shallowCopy(common.get()); |
---|
| 1221 | c->qualifiers = q1 | q2; |
---|
| 1222 | common = c; |
---|
[f474e91] | 1223 | return true; |
---|
| 1224 | } else { |
---|
| 1225 | return false; |
---|
| 1226 | } |
---|
| 1227 | } |
---|
| 1228 | |
---|
[54e41b3] | 1229 | ast::ptr<ast::Type> extractResultType( const ast::FunctionType * func ) { |
---|
[4139e3d] | 1230 | if ( func->returns.empty() ) return new ast::VoidType{}; |
---|
| 1231 | if ( func->returns.size() == 1 ) return func->returns[0]->get_type(); |
---|
| 1232 | |
---|
| 1233 | std::vector<ast::ptr<ast::Type>> tys; |
---|
| 1234 | for ( const ast::DeclWithType * decl : func->returns ) { |
---|
| 1235 | tys.emplace_back( decl->get_type() ); |
---|
| 1236 | } |
---|
| 1237 | return new ast::TupleType{ std::move(tys) }; |
---|
[54e41b3] | 1238 | } |
---|
[51b7345] | 1239 | } // namespace ResolvExpr |
---|
[a32b204] | 1240 | |
---|
| 1241 | // Local Variables: // |
---|
| 1242 | // tab-width: 4 // |
---|
| 1243 | // mode: c++ // |
---|
| 1244 | // compile-command: "make install" // |
---|
| 1245 | // End: // |
---|