Searched refs:AliasSets (Results 1 – 3 of 3) sorted by relevance
112 AliasSets.erase(AS); in removeAliasSet()117 assert(AliasSets.empty() && "Tracker not empty"); in removeAliasSet()266 AliasSets.clear(); in clear()364 AliasSets.push_back(new AliasSet()); in getAliasSetFor()365 AliasSets.back().addPointer(*this, Entry, Size, AAInfo, true); in getAliasSetFor()366 return AliasSets.back(); in getAliasSetFor()424 AliasSets.push_back(new AliasSet()); in addUnknown()425 AliasSets.back().addUnknownInst(Inst, AA); in addUnknown()525 AliasSets.push_back(new AliasSet()); in mergeAllAliasSets()526 AliasAnyAS = &AliasSets.back(); in mergeAllAliasSets()[all …]
308 ilist<AliasSet> AliasSets; variable347 const ilist<AliasSet> &getAliasSets() const { return AliasSets; } in getAliasSets()361 const_iterator begin() const { return AliasSets.begin(); } in begin()362 const_iterator end() const { return AliasSets.end(); } in end()364 iterator begin() { return AliasSets.begin(); } in begin()365 iterator end() { return AliasSets.end(); } in end()
476 uses the union-find algorithm to efficiently merge AliasSets when a pointer is