Home
last modified time | relevance | path

Searched refs:numShards (Results 1 – 6 of 6) sorted by relevance

/freebsd/contrib/llvm-project/lld/COFF/
H A DICF.cpp242 const size_t numShards = 256; in forEachClass() local
243 size_t step = chunks.size() / numShards; in forEachClass()
244 size_t boundaries[numShards + 1]; in forEachClass()
246 boundaries[numShards] = chunks.size(); in forEachClass()
247 parallelFor(1, numShards, [&](size_t i) { in forEachClass()
250 parallelFor(1, numShards + 1, [&](size_t i) { in forEachClass()
/freebsd/contrib/llvm-project/lld/ELF/
H A DOutputSections.cpp391 const size_t numShards = shardsIn.size(); in maybeCompress() local
392 auto shardsOut = std::make_unique<SmallVector<uint8_t, 0>[]>(numShards); in maybeCompress()
399 parallelFor(0, numShards, [&](size_t i) { in maybeCompress()
422 for (size_t i = 0; i != numShards; ++i) in maybeCompress()
437 auto shardsAdler = std::make_unique<uint32_t[]>(numShards); in maybeCompress()
438 parallelFor(0, numShards, [&](size_t i) { in maybeCompress()
440 i != numShards - 1 ? Z_SYNC_FLUSH : Z_FINISH); in maybeCompress()
447 for (size_t i = 0; i != numShards; ++i) { in maybeCompress()
461 compressed.numShards = numShards; in maybeCompress()
499 auto offsets = std::make_unique<size_t[]>(compressed.numShards); in writeTo()
[all …]
H A DICF.cpp427 const size_t numShards = 256; in forEachClass() local
428 size_t step = sections.size() / numShards; in forEachClass()
429 size_t boundaries[numShards + 1]; in forEachClass()
431 boundaries[numShards] = sections.size(); in forEachClass()
433 parallelFor(1, numShards, [&](size_t i) { in forEachClass()
437 parallelFor(1, numShards + 1, [&](size_t i) { in forEachClass()
H A DSyntheticSections.cpp60 constexpr size_t MergeNoTailSection::numShards; member in MergeNoTailSection
3025 bit_floor(std::min<size_t>(config->threadCount, numShards)); in computeEntryPool()
3026 const size_t shift = 32 - countr_zero(numShards); in computeEntryPool()
3028 DenseMap<CachedHashStringRef, size_t> maps[numShards]; in computeEntryPool()
3069 uint32_t offsets[numShards]; in computeEntryPool()
3070 parallelFor(0, numShards, [&](size_t shard) { in computeEntryPool()
3086 parallelFor(1, numShards, [&](size_t shard) { in computeEntryPool()
3097 parallelFor(0, numShards, [&](size_t shard) { in computeEntryPool()
3116 return {offsets[numShards - 1], num}; in computeEntryPool()
3427 constexpr size_t numShards = 32; in createSymbols() local
[all …]
H A DOutputSections.h27 uint32_t numShards = 0; member
H A DSyntheticSections.h905 static constexpr size_t numShards = 32; variable
906 SmallVector<NameEntry, 0> nameVecs[numShards];
1123 return hash >> (31 - llvm::countr_zero(numShards)); in getShardId()
1130 constexpr static size_t numShards = 32; variable
1132 size_t shardOffsets[numShards];