40   std::vector<ConcatInputSection *> icfInputs;  member in ICF
44   icfInputs.assign(inputs.begin(), inputs.end());  in ICF()
185   uint64_t beginHash = icfInputs[begin]->icfEqClass[icfPass % 2];  in findBoundary()
187     if (beginHash != icfInputs[i]->icfEqClass[icfPass % 2])  in findBoundary()
207   if (icfInputs.size() < threadingThreshold) {  in forEachClass()
208     forEachClassRange(0, icfInputs.size(), func);  in forEachClass()
217   size_t step = icfInputs.size() / shards;  in forEachClass()
220   boundaries[shards] = icfInputs.size();  in forEachClass()
222     boundaries[i] = findBoundary((i - 1) * step, icfInputs.size());  in forEachClass()
235     parallelForEach(icfInputs, [&](ConcatInputSection *isec) {  in run()
261       icfInputs, [](const ConcatInputSection *a, const ConcatInputSection *b) {  in run()
280     ConcatInputSection *beginIsec = icfInputs[begin];  in run()
282       beginIsec->foldIdentical(icfInputs[i]);  in run()
294     auto bound = std::stable_partition(icfInputs.begin() + begin + 1,  in segregate()
295                                        icfInputs.begin() + end,  in segregate()
297                                          return equals(icfInputs[begin], isec);  in segregate()
299     size_t mid = bound - icfInputs.begin();  in segregate()
304       icfInputs[i]->icfEqClass[(icfPass + 1) % 2] = mid;  in segregate()