Searched refs:numShards (Results 1 - 4 of 4) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/lld/COFF/
H A DICF.cpp227 const size_t numShards = 256; local
228 size_t step = chunks.size() / numShards;
229 size_t boundaries[numShards + 1];
231 boundaries[numShards] = chunks.size();
232 parallelForEachN(1, numShards, [&](size_t i) {
235 parallelForEachN(1, numShards + 1, [&](size_t i) {
/freebsd-13-stable/contrib/llvm-project/lld/ELF/
H A DICF.cpp416 const size_t numShards = 256; local
417 size_t step = sections.size() / numShards;
418 size_t boundaries[numShards + 1];
420 boundaries[numShards] = sections.size();
422 parallelForEachN(1, numShards, [&](size_t i) {
426 parallelForEachN(1, numShards + 1, [&](size_t i) {
H A DSyntheticSections.h920 return hash >> (31 - llvm::countTrailingZeros(numShards));
927 constexpr static size_t numShards = 32; member in class:lld::elf::final
929 size_t shardOffsets[numShards];
H A DSyntheticSections.cpp57 constexpr size_t MergeNoTailSection::numShards;
2747 constexpr size_t numShards = 32;
2751 numShards));
2754 std::vector<DenseMap<CachedHashStringRef, size_t>> map(numShards);
2755 size_t shift = 32 - countTrailingZeros(numShards);
2758 std::vector<std::vector<GdbSymbol>> symbols(numShards);
3185 for (size_t i = 0; i < numShards; ++i)
3199 for (size_t i = 0; i < numShards; ++i)
3207 numShards));
3224 for (size_t i = 0; i < numShards;
[all...]

Completed in 54 milliseconds