Searched refs:AliasSets (Results 1 – 3 of 3) sorted by relevance
113 AliasSets.erase(AS); in removeAliasSet()118 assert(AliasSets.empty() && "Tracker not empty"); in removeAliasSet()265 AliasSets.clear(); in clear()363 AliasSets.push_back(new AliasSet()); in getAliasSetFor()364 AliasSets.back().addPointer(*this, Entry, Size, AAInfo, true); in getAliasSetFor()365 return AliasSets.back(); in getAliasSetFor()423 AliasSets.push_back(new AliasSet()); in addUnknown()424 AliasSets.back().addUnknownInst(Inst, AA); in addUnknown()576 AliasSets.push_back(new AliasSet()); in mergeAllAliasSets()577 AliasAnyAS = &AliasSets.back(); in mergeAllAliasSets()[all …]
341 ilist<AliasSet> AliasSets; variable381 const ilist<AliasSet> &getAliasSets() const { return AliasSets; } in getAliasSets()407 const_iterator begin() const { return AliasSets.begin(); } in begin()408 const_iterator end() const { return AliasSets.end(); } in end()410 iterator begin() { return AliasSets.begin(); } in begin()411 iterator end() { return AliasSets.end(); } in end()
466 uses the union-find algorithm to efficiently merge AliasSets when a pointer is