51   std::vector<ConcatInputSection *> icfInputs;  member in ICF
60   icfInputs.assign(inputs.begin(), inputs.end());  in ICF()
237   uint64_t beginHash = icfInputs[begin]->icfEqClass[icfPass % 2];  in findBoundary()
239     if (beginHash != icfInputs[i]->icfEqClass[icfPass % 2])  in findBoundary()
259   if (icfInputs.size() < threadingThreshold) {  in forEachClass()
260     forEachClassRange(0, icfInputs.size(), func);  in forEachClass()
269   size_t step = icfInputs.size() / shards;  in forEachClass()
272   boundaries[shards] = icfInputs.size();  in forEachClass()
274     boundaries[i] = findBoundary((i - 1) * step, icfInputs.size());  in forEachClass()
287     parallelForEach(icfInputs, [&](ConcatInputSection *isec) {  in run()
314       icfInputs, [](const ConcatInputSection *a, const ConcatInputSection *b) {  in run()
338     ConcatInputSection *beginIsec = icfInputs[begin];  in run()
340       beginIsec->foldIdentical(icfInputs[i]);  in run()
350         icfInputs.begin() + begin + 1, icfInputs.begin() + end,  in segregate()
352           return (this->*equals)(icfInputs[begin], isec);  in segregate()
354     size_t mid = bound - icfInputs.begin();  in segregate()
359       icfInputs[i]->icfEqClass[(icfPass + 1) % 2] = mid;  in segregate()