Home | History | Annotate | Download | only in Analysis

Lines Matching defs:AS

42     AliasSet *AS;
47 : Val(V), PrevInList(0), NextInList(0), AS(0), Size(0),
53 bool hasAliasSet() const { return AS != 0; }
84 assert(AS && "No AliasSet yet!");
85 if (AS->Forward) {
86 AliasSet *OldAS = AS;
87 AS = OldAS->getForwardedTarget(AST);
88 AS->addRef();
91 return AS;
94 void setAliasSet(AliasSet *as) {
95 assert(AS == 0 && "Already have an alias set!");
96 AS = as;
102 if (AS->PtrListEnd == &NextInList) {
103 AS->PtrListEnd = PrevInList;
104 assert(*AS->PtrListEnd == 0 && "List not terminated right!");
124 /// ModRef as necessary.
166 /// isForwardingAliasSet - Return true if this alias set should be ignored as
172 void mergeSetIn(AliasSet &AS, AliasSetTracker &AST);
223 // to serve as a sentinel.
229 AliasSet(const AliasSet &AS); // do not implement
230 void operator=(const AliasSet &AS); // do not implement
238 /// destination set. This also implements the union-find collapsing as well.
276 inline raw_ostream& operator<<(raw_ostream &OS, const AliasSet &AS) {
277 AS.print(OS);
344 void remove(AliasSet &AS);
407 void removeAliasSet(AliasSet *AS);
422 AliasSet &AS = getAliasSetForPointer(P, Size, TBAAInfo, &NewSet);
423 AS.AccessTy |= E;
424 return AS;