196       return Link.hasAbove();  in hasAbove()
201       return Link.hasBelow();  in hasBelow()
206       Link.Below = I;  in setBelow()
211       Link.Above = I;  in setAbove()
216       Link.clearBelow();  in clearBelow()
221       Link.clearAbove();  in clearAbove()
227       return Link.Below;  in getBelow()
233       return Link.Above;  in getAbove()
238       return Link.Attrs;  in getAttrs()
243       Link.Attrs |= Other;  in setAttrs()
268     const StratifiedLink &getLink() const { return Link; }  in getLink()
271     StratifiedLink Link;
280     for (auto &Link : Links) {  in finalizeSets()
281       if (Link.isRemapped())  in finalizeSets()
285       Remaps.insert(std::make_pair(Link.Number, Number));  in finalizeSets()
286       StratLinks.push_back(Link.getLink());  in finalizeSets()
289     for (auto &Link : StratLinks) {  in finalizeSets()
290       if (Link.hasAbove()) {  in finalizeSets()
291         auto &Above = linksAt(Link.Above);  in finalizeSets()
294         Link.Above = Iter->second;  in finalizeSets()
297       if (Link.hasBelow()) {  in finalizeSets()
298         auto &Below = linksAt(Link.Below);  in finalizeSets()
301         Link.Below = Iter->second;  in finalizeSets()
307       auto &Link = linksAt(Info.Index);  in finalizeSets()  local
308       auto Iter = Remaps.find(Link.Number);  in finalizeSets()
318       const auto *Link = &Links[Idx];  in propagateAttrs()  local
319       while (Link->hasAbove()) {  in propagateAttrs()
320         Idx = Link->Above;  in propagateAttrs()
321         Link = &Links[Idx];  in propagateAttrs()
398     auto &Link = linksAt(Info->Index);  in noteAttributes()  local
399     Link.setAttrs(NewAttrs);  in noteAttributes()
576     auto &Link = linksAt(Info->Index);  in indexOf()  local
577     return Link.Number;  in indexOf()
597     auto Link = Links.size();  in addLinks()  local
598     Links.push_back(BuilderLink(Link));  in addLinks()
599     return Link;  in addLinks()