Lines Matching full:above
48 /// The index for the set "above" current
49 StratifiedIndex Above;
57 StratifiedLink() : Above(SetSentinel), Below(SetSentinel) {}
60 bool hasAbove() const { return Above != SetSentinel; }
63 void clearAbove() { Above = SetSentinel; }
73 /// above or below another. In CFL Alias Analysis, this gives us an indication
79 /// Sets may also have attributes (as noted above). These attributes are
131 /// This builder has a notion of some value A being above, below, or with some
133 /// > The `A above B` relationship implies that there is a reference edge
135 /// > The `A below B` relationship is the opposite of `A above B`. It implies
150 /// - %a below %ap & %ap above %a
151 /// - %ap below %app & %app above %ap
157 /// ...Which state that the only MayAlias relationship in the above program is
168 /// Which, because %ipp ends up *both* above and below %ip, is fun.
174 /// and %ipp. In short, the resulting StratifiedSet from the above code would be
185 /// Set above it, the set below it, and whether the current set has been
211 Link.Above = I;
233 return Link.Above;
265 /// Prefer the above functions to calling things directly on what's returned
291 auto &Above = linksAt(Link.Above);
292 auto Iter = Remaps.find(Above.Number);
294 Link.Above = Iter->second;
320 Idx = Link->Above;
364 /// set above "Main". There are some cases where this is not possible (see
365 /// above), so we merge them such that ToAdd and Main are in the same set.
372 auto Above = linksAt(Index).getAbove();
373 return addAtMerging(ToAdd, Above);
378 /// above), so we merge them such that ToAdd and Main are in the same set.
456 // CASE 1: If the set at `Idx1` is above or below `Idx2`, we need to merge
471 /// traversing above or below the set at `Idx2`.
477 // Merging everything above LinksInto then proceeding to merge everything
495 // > If both have links above, deal with those next.
