Lines Matching full:sets
26 // in order to transform the graph into sets of variables that may alias in
147 StratifiedSets<Value *> Sets;
152 : Sets(std::move(S)), ReturnedValues(std::move(RV)) {}
178 /// If a function's sets are currently being built, it is marked
181 /// that simply has empty sets.
362 // Gets whether the sets at Index1 above, below, or equal to the sets at
364 static Optional<Level> getIndexRelation(const StratifiedSets<Value *> &Sets,
370 const auto *Current = &Sets.getLink(Index1);
374 Current = &Sets.getLink(Current->Below);
377 Current = &Sets.getLink(Index1);
381 Current = &Sets.getLink(Current->Above);
413 auto &Sets = Info.Sets;
418 auto MaybeInfo = Sets.find(&Param);
433 auto MaybeInfo = Sets.find(RetVals[X]);
438 auto RetAttrs = Sets.getLink(RetInfo.Index).Attrs;
439 auto ParamAttrs = Sets.getLink(ParamInfo.Index).Attrs;
441 getIndexRelation(Sets, ParamInfo.Index, RetInfo.Index);
458 // (Technically, the proper sets
464 auto &MainAttrs = Sets.getLink(MainInfo.Index).Attrs;
468 auto &SubAttrs = Sets.getLink(SubInfo.Index).Attrs;
470 getIndexRelation(Sets, MainInfo.Index, SubInfo.Index);
770 // Notes whether it would be pointless to add the given Value to our sets.
967 // sets, e.g. in
1112 auto &Sets = MaybeInfo->Sets;
1113 auto MaybeA = Sets.find(ValA);
1117 auto MaybeB = Sets.find(ValB);
1123 auto AttrsA = Sets.getLink(SetA.Index).Attrs;
1124 auto AttrsB = Sets.getLink(SetB.Index).Attrs;
1133 // the sets has no values that could legally be altered by changing the value
