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.cpp361 const size_t shards = 256; in forEachClass() local
362 size_t step = icfInputs.size() / shards; in forEachClass()
363 size_t boundaries[shards + 1]; in forEachClass()
365 boundaries[shards] = icfInputs.size(); in forEachClass()
366 parallelFor(1, shards, [&](size_t i) { in forEachClass()
369 parallelFor(1, shards + 1, [&](size_t i) { in forEachClass()
/freebsd/contrib/llvm-project/lld/ELF/
H A DOutputSections.cpp477 compressed.shards = std::move(shardsOut); in maybeCompress()
509 if (compressed.shards) { in writeTo()
526 offsets[i] = offsets[i - 1] + compressed.shards[i - 1].size(); in writeTo()
528 memcpy(buf + offsets[i], compressed.shards[i].data(), in writeTo()
529 compressed.shards[i].size()); in writeTo()
H A DOutputSections.h25 std::unique_ptr<SmallVector<uint8_t, 0>[]> shards; member
H A DSyntheticSections.cpp3981 [&](size_t i) { shards[i].write(buf + shardOffsets[i]); }); in writeTo()
3995 shards.emplace_back(StringTableBuilder::RAW, llvm::Align(addralign)); in finalizeContents()
4010 sec->pieces[i].outputOff = shards[shardId].add(sec->getData(i)); in finalizeContents()
4018 shards[i].finalizeInOrder(); in finalizeContents()
4019 if (shards[i].getSize() > 0) in finalizeContents()
4022 off += shards[i].getSize(); in finalizeContents()
H A DSyntheticSections.h1147 SmallVector<llvm::StringTableBuilder, 0> shards; variable
/freebsd/contrib/googletest/docs/
H A Dadvanced.md2009 1. Allocate a number of machines (shards) to run the tests.
2011 number of shards. It must be the same for all shards.
2013 of the shard. Different shards must be assigned different indices, which
2015 1. Run the same test program on all shards. When GoogleTest sees the above two
2017 Across all shards, each test function in the program will be run exactly
2019 1. Wait for all shards to finish, then collect and report the results.
2046 shards, but here's one possible scenario: