61   std::vector<SectionChunk *> chunks;  member in lld::coff::ICF
109         chunks.begin() + begin + 1, chunks.begin() + end, [&](SectionChunk *s) {  in segregate()
111             return equalsConstant(chunks[begin], s);  in segregate()
112           return equalsVariable(chunks[begin], s);  in segregate()
114     size_t mid = bound - chunks.begin();  in segregate()
119       chunks[i]->eqClass[(cnt + 1) % 2] = mid;  in segregate()
201     if (chunks[begin]->eqClass[cnt % 2] != chunks[i]->eqClass[cnt % 2])  in findBoundary()
219   if (chunks.size() < 1024) {  in forEachClass()
220     forEachClassRange(0, chunks.size(), fn);  in forEachClass()
230   size_t step = chunks.size() / numShards;  in forEachClass()
233   boundaries[numShards] = chunks.size();  in forEachClass()
235     boundaries[i] = findBoundary((i - 1) * step, chunks.size());  in forEachClass()
256         chunks.push_back(sc);  in run()
270   parallelForEach(chunks, [&](SectionChunk *sc) {  in run()
277     parallelForEach(chunks, [&](SectionChunk *sc) {  in run()
289   llvm::stable_sort(chunks, [](const SectionChunk *a, const SectionChunk *b) {  in run()
310     log("Selected " + chunks[begin]->getDebugName());  in run()
312       log("  Removed " + chunks[i]->getDebugName());  in run()
313       chunks[begin]->replace(chunks[i]);  in run()