96     Links = std::move(Other.Links);
101                  std::vector<StratifiedLink> Links)  in StratifiedSets()  argument
102       : Values(std::move(Map)), Links(std::move(Links)) {}  in StratifiedSets()
113     return Links[Index];  in getLink()
118   std::vector<StratifiedLink> Links;  variable
120   bool inbounds(StratifiedIndex Idx) const { return Idx < Links.size(); }  in inbounds()
280     for (auto &Link : Links) {  in finalizeSets()
316   static void propagateAttrs(std::vector<StratifiedLink> &Links) {  in propagateAttrs()  argument
317     const auto getHighestParentAbove = [&Links](StratifiedIndex Idx) {  in propagateAttrs()
318       const auto *Link = &Links[Idx];  in propagateAttrs()
321         Link = &Links[Idx];  in propagateAttrs()
327     for (unsigned I = 0, E = Links.size(); I < E; ++I) {  in propagateAttrs()
332       while (Links[CurrentIndex].hasBelow()) {  in propagateAttrs()
333         auto &CurrentBits = Links[CurrentIndex].Attrs;  in propagateAttrs()
334         auto NextIndex = Links[CurrentIndex].Below;  in propagateAttrs()
335         auto &NextBits = Links[NextIndex].Attrs;  in propagateAttrs()
349     Links.clear();  in build()
404   std::vector<BuilderLink> Links;  variable
427     auto *Start = &Links[Index];  in linksAt()
433       Current = &Links[Current->getRemapIndex()];  in linksAt()
441       auto *Next = &Links[Current->getRemapIndex()];  in linksAt()
582     Links[Set].setBelow(At);  in addLinkBelow()
583     Links[At].setAbove(Set);  in addLinkBelow()
589     Links[At].setBelow(Set);  in addLinkAbove()
590     Links[Set].setAbove(At);  in addLinkAbove()
597     auto Link = Links.size();  in addLinks()
598     Links.push_back(BuilderLink(Link));  in addLinks()
602   bool inbounds(StratifiedIndex N) const { return N < Links.size(); }  in inbounds()