Lines Matching full:below
51 /// The link for the set "below" current
52 StratifiedIndex Below; member
57 StratifiedLink() : Above(SetSentinel), Below(SetSentinel) {} in StratifiedLink()
59 bool hasBelow() const { return Below != SetSentinel; } in hasBelow()
62 void clearBelow() { Below = SetSentinel; } in clearBelow()
73 /// above or below another. In CFL Alias Analysis, this gives us an indication
74 /// of how two variables are related; if the set of variable A is below a set
84 /// below set A.
131 /// This builder has a notion of some value A being above, below, or with some
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
168 /// Which, because %ipp ends up *both* above and below %ip, is fun.
185 /// Set above it, the set below it, and whether the current set has been
206 Link.Below = I; in setBelow()
227 return Link.Below; in getBelow()
298 auto &Below = linksAt(Link.Below); in finalizeSets() local
299 auto Iter = Remaps.find(Below.Number); in finalizeSets()
301 Link.Below = Iter->second; in finalizeSets()
315 /// Link.externals will be set in all Link.externals "below" it.
334 auto NextIndex = Links[CurrentIndex].Below; in propagateAttrs()
377 /// set below "Main". There are some cases where this is not possible (see
385 auto Below = linksAt(Index).getBelow(); in addBelow() local
386 return addAtMerging(ToAdd, Below); in addBelow()
456 // CASE 1: If the set at `Idx1` is above or below `Idx2`, we need to merge in merge()
471 /// traversing above or below the set at `Idx2`.
478 // below LinksInto becomes problematic, so we go as far "up" as possible! in mergeDirect()
491 // > If neither has links below, stop. in mergeDirect()
492 // > If only `LinksInto` has links below, stop. in mergeDirect()
493 // > If only `LinksFrom` has links below, reset `LinksInto.Below` to in mergeDirect()
494 // match `LinksFrom.Below` in mergeDirect()