Searched refs:AliasSets (Results 1 – 3 of 3) sorted by relevance
117 AliasSets.erase(AS); in removeAliasSet()122 assert(AliasSets.empty() && "Tracker not empty"); in removeAliasSet()294 AliasSets.clear(); in clear()392 AliasSets.push_back(new AliasSet()); in getAliasSetFor()393 AliasSets.back().addPointer(*this, Entry, Size, AAInfo, true); in getAliasSetFor()394 return AliasSets.back(); in getAliasSetFor()452 AliasSets.push_back(new AliasSet()); in addUnknown()453 AliasSets.back().addUnknownInst(Inst, AA); in addUnknown()605 AliasSets.push_back(new AliasSet()); in mergeAllAliasSets()606 AliasAnyAS = &AliasSets.back(); in mergeAllAliasSets()[all …]
348 ilist<AliasSet> AliasSets; variable388 const ilist<AliasSet> &getAliasSets() const { return AliasSets; } in getAliasSets()414 const_iterator begin() const { return AliasSets.begin(); } in begin()415 const_iterator end() const { return AliasSets.end(); } in end()417 iterator begin() { return AliasSets.begin(); } in begin()418 iterator end() { return AliasSets.end(); } in end()
466 uses the union-find algorithm to efficiently merge AliasSets when a pointer is