125   std::vector<InputSection *> sections;  member in __anon665142570111::ICF
214         std::stable_partition(sections.begin() + begin + 1,  in segregate()
215                               sections.begin() + end, [&](InputSection *s) {  in segregate()
217                                   return equalsConstant(sections[begin], s);  in segregate()
218                                 return equalsVariable(sections[begin], s);  in segregate()
220     size_t mid = bound - sections.begin();  in segregate()
227       sections[i]->eqClass[next] = eqClassBase + mid;  in segregate()
379   uint32_t eqClass = sections[begin]->eqClass[current];  in findBoundary()
381     if (eqClass != sections[i]->eqClass[current])  in findBoundary()
406   if (parallel::strategy.ThreadsRequested == 1 || sections.size() < 1024) {  in forEachClass()
407     forEachClassRange(0, sections.size(), fn);  in forEachClass()
420   size_t step = sections.size() / numShards;  in forEachClass()
423   boundaries[numShards] = sections.size();  in forEachClass()
426     boundaries[i] = findBoundary((i - 1) * step, sections.size());  in forEachClass()
483         sections.push_back(s);  in run()
492   parallelForEach(sections, [&](InputSection *s) {  in run()
501     parallelForEach(sections, [&](InputSection *s) {  in run()
511   llvm::stable_sort(sections, [](const InputSection *a, const InputSection *b) {  in run()
534   forEachClassRange(0, sections.size(), [&](size_t begin, size_t end) {  in run()
537     print("selected section " + toString(sections[begin]));  in run()
539       print("  removing identical section " + toString(sections[i]));  in run()
540       sections[begin]->replace(sections[i]);  in run()
545       for (InputSection *isec : sections[i]->dependentSections)  in run()
556           llvm::erase_if(isd->sections,  in run()