Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/lld/MachO/
H A DICF.cpp268 const size_t shards = 256; in forEachClass() local
269 size_t step = icfInputs.size() / shards; in forEachClass()
270 size_t boundaries[shards + 1]; in forEachClass()
272 boundaries[shards] = icfInputs.size(); in forEachClass()
273 parallelFor(1, shards, [&](size_t i) { in forEachClass()
276 parallelFor(1, shards + 1, [&](size_t i) { in forEachClass()
/freebsd/contrib/llvm-project/lld/ELF/
H A DOutputSections.cpp460 compressed.shards = std::move(shardsOut); in maybeCompress()
492 if (compressed.shards) { in writeTo()
509 offsets[i] = offsets[i - 1] + compressed.shards[i - 1].size(); in writeTo()
511 memcpy(buf + offsets[i], compressed.shards[i].data(), in writeTo()
512 compressed.shards[i].size()); in writeTo()
H A DOutputSections.h25 std::unique_ptr<SmallVector<uint8_t, 0>[]> shards; member
H A DSyntheticSections.cpp3890 [&](size_t i) { shards[i].write(buf + shardOffsets[i]); }); in writeTo()
3904 shards.emplace_back(StringTableBuilder::RAW, llvm::Align(addralign)); in finalizeContents()
3919 sec->pieces[i].outputOff = shards[shardId].add(sec->getData(i)); in finalizeContents()
3927 shards[i].finalizeInOrder(); in finalizeContents()
3928 if (shards[i].getSize() > 0) in finalizeContents()
3931 off += shards[i].getSize(); in finalizeContents()
H A DSyntheticSections.h1131 SmallVector<llvm::StringTableBuilder, 0> shards; variable
/freebsd/contrib/googletest/docs/
H A Dadvanced.md1989 1. Allocate a number of machines (shards) to run the tests.
1991 number of shards. It must be the same for all shards.
1993 of the shard. Different shards must be assigned different indices, which
1995 1. Run the same test program on all shards. When GoogleTest sees the above two
1997 Across all shards, each test function in the program will be run exactly
1999 1. Wait for all shards to finish, then collect and report the results.
2026 shards, but here's one possible scenario: