Home
last modified time | relevance | path

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

/llvm-project-15.0.7/mlir/lib/Support/
H A DStorageUniquer.cpp120 size_t numShards = 8) in ParametricStorageUniquer() argument
121 : shards(new std::atomic<Shard *>[numShards]), numShards(numShards), in ParametricStorageUniquer()
123 assert(llvm::isPowerOf2_64(numShards) && in ParametricStorageUniquer()
125 for (size_t i = 0; i < numShards; i++) in ParametricStorageUniquer()
130 for (size_t i = 0; i != numShards; ++i) { in ~ParametricStorageUniquer()
183 unsigned shardNum = hashValue & (numShards - 1); in getShard()
202 for (size_t i = 0; i != numShards; ++i) { in getShardFor()
222 size_t numShards; member in __anon95dc17a30111::ParametricStorageUniquer
232 size_t numShards = 0)
/llvm-project-15.0.7/lld/COFF/
H A DICF.cpp231 const size_t numShards = 256; in forEachClass() local
232 size_t step = chunks.size() / numShards; in forEachClass()
233 size_t boundaries[numShards + 1]; in forEachClass()
235 boundaries[numShards] = chunks.size(); in forEachClass()
236 parallelFor(1, numShards, [&](size_t i) { in forEachClass()
239 parallelFor(1, numShards + 1, [&](size_t i) { in forEachClass()
/llvm-project-15.0.7/lld/ELF/
H A DOutputSections.cpp346 const size_t numShards = shardsIn.size(); in maybeCompress() local
351 auto shardsOut = std::make_unique<SmallVector<uint8_t, 0>[]>(numShards); in maybeCompress()
352 auto shardsAdler = std::make_unique<uint32_t[]>(numShards); in maybeCompress()
353 parallelFor(0, numShards, [&](size_t i) { in maybeCompress()
355 i != numShards - 1 ? Z_SYNC_FLUSH : Z_FINISH); in maybeCompress()
363 for (size_t i = 0; i != numShards; ++i) { in maybeCompress()
370 compressed.numShards = numShards; in maybeCompress()
405 auto offsets = std::make_unique<size_t[]>(compressed.numShards); in writeTo()
407 for (size_t i = 1; i != compressed.numShards; ++i) in writeTo()
412 parallelFor(0, compressed.numShards, [&](size_t i) { in writeTo()
H A DICF.cpp419 const size_t numShards = 256; in forEachClass() local
420 size_t step = sections.size() / numShards; in forEachClass()
421 size_t boundaries[numShards + 1]; in forEachClass()
423 boundaries[numShards] = sections.size(); in forEachClass()
425 parallelFor(1, numShards, [&](size_t i) { in forEachClass()
429 parallelFor(1, numShards + 1, [&](size_t i) { in forEachClass()
H A DOutputSections.h25 uint32_t numShards = 0; member
H A DSyntheticSections.cpp56 constexpr size_t MergeNoTailSection::numShards; member in MergeNoTailSection
2834 constexpr size_t numShards = 32; in createSymbols() local
2838 numShards)); in createSymbols()
2843 size_t shift = 32 - countTrailingZeros(numShards); in createSymbols()
2846 auto symbols = std::make_unique<SmallVector<GdbSymbol, 0>[]>(numShards); in createSymbols()
2871 for (ArrayRef<GdbSymbol> v : makeArrayRef(symbols.get(), numShards)) in createSymbols()
2879 makeMutableArrayRef(symbols.get(), numShards)) in createSymbols()
3294 parallelFor(0, numShards, in writeTo()
3308 for (size_t i = 0; i < numShards; ++i) in finalizeContents()
3316 numShards)); in finalizeContents()
[all …]
H A DSyntheticSections.h961 return hash >> (31 - llvm::countTrailingZeros(numShards)); in getShardId()
968 constexpr static size_t numShards = 32; variable
970 size_t shardOffsets[numShards];
/llvm-project-15.0.7/llvm/utils/lit/lit/
H A Dcl_arguments.py230 if opts.numShards or opts.runShard:
231 if not opts.numShards or not opts.runShard:
233 if opts.runShard > opts.numShards:
235 opts.shard = (opts.runShard, opts.numShards)