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.cpp238 const size_t numShards = 256; in forEachClass() local
239 size_t step = chunks.size() / numShards; in forEachClass()
240 size_t boundaries[numShards + 1]; in forEachClass()
242 boundaries[numShards] = chunks.size(); in forEachClass()
243 parallelFor(1, numShards, [&](size_t i) { in forEachClass()
246 parallelFor(1, numShards + 1, [&](size_t i) { in forEachClass()
/freebsd/contrib/llvm-project/lld/ELF/
H A DOutputSections.cpp408 const size_t numShards = shardsIn.size(); in maybeCompress() local
409 auto shardsOut = std::make_unique<SmallVector<uint8_t, 0>[]>(numShards); in maybeCompress()
416 parallelFor(0, numShards, [&](size_t i) { in maybeCompress()
439 for (size_t i = 0; i != numShards; ++i) in maybeCompress()
454 auto shardsAdler = std::make_unique<uint32_t[]>(numShards); in maybeCompress()
455 parallelFor(0, numShards, [&](size_t i) { in maybeCompress()
457 i != numShards - 1 ? Z_SYNC_FLUSH : Z_FINISH); in maybeCompress()
464 for (size_t i = 0; i != numShards; ++i) { in maybeCompress()
478 compressed.numShards = numShards; in maybeCompress()
516 auto offsets = std::make_unique<size_t[]>(compressed.numShards); in writeTo()
[all …]
H A DICF.cpp430 const size_t numShards = 256; in parallelForEachClass() local
431 size_t step = sections.size() / numShards; in parallelForEachClass()
432 size_t boundaries[numShards + 1]; in parallelForEachClass()
434 boundaries[numShards] = sections.size(); in parallelForEachClass()
436 parallelFor(1, numShards, [&](size_t i) { in parallelForEachClass()
440 parallelFor(1, numShards + 1, [&](size_t i) { in parallelForEachClass()
H A DOutputSections.h27 uint32_t numShards = 0; member
H A DSyntheticSections.cpp57 constexpr size_t MergeNoTailSection::numShards; member in MergeNoTailSection
3113 bit_floor(std::min<size_t>(ctx.arg.threadCount, numShards)); in computeEntryPool()
3114 const size_t shift = 32 - countr_zero(numShards); in computeEntryPool()
3116 DenseMap<CachedHashStringRef, size_t> maps[numShards]; in computeEntryPool()
3157 uint32_t offsets[numShards]; in computeEntryPool()
3158 parallelFor(0, numShards, [&](size_t shard) { in computeEntryPool()
3174 parallelFor(1, numShards, [&](size_t shard) { in computeEntryPool()
3185 parallelFor(0, numShards, [&](size_t shard) { in computeEntryPool()
3204 return {offsets[numShards - 1], num}; in computeEntryPool()
3517 constexpr size_t numShards = 32; in createSymbols() local
[all …]
H A DSyntheticSections.h920 static constexpr size_t numShards = 32; variable
921 SmallVector<NameEntry, 0> nameVecs[numShards];
1139 return hash >> (31 - llvm::countr_zero(numShards)); in getShardId()
1146 constexpr static size_t numShards = 32; variable
1148 size_t shardOffsets[numShards];