reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
211 std::stable_partition(sections.begin() + begin + 1, 212 sections.begin() + end, [&](InputSection *s) { 214 return equalsConstant(sections[begin], s); 215 return equalsVariable(sections[begin], s); 217 size_t mid = bound - sections.begin(); 223 sections[i]->eqClass[next] = mid; 368 uint32_t eqClass = sections[begin]->eqClass[current]; 370 if (eqClass != sections[i]->eqClass[current]) 395 if (!threadsEnabled || sections.size() < 1024) { 396 forEachClassRange(0, sections.size(), fn); 409 size_t step = sections.size() / numShards; 412 boundaries[numShards] = sections.size(); 415 boundaries[i] = findBoundary((i - 1) * step, sections.size()); 452 sections.push_back(s); 456 parallelForEach(sections, [&](InputSection *s) { 461 parallelForEach(sections, [&](InputSection *s) { 471 llvm::stable_sort(sections, [](const InputSection *a, const InputSection *b) { 488 forEachClassRange(0, sections.size(), [&](size_t begin, size_t end) { 491 print("selected section " + toString(sections[begin])); 493 print(" removing identical section " + toString(sections[i])); 494 sections[begin]->replace(sections[i]); 494 sections[begin]->replace(sections[i]); 499 for (InputSection *isec : sections[i]->dependentSections)