Lines Matching full:chunks

22 #include "Chunks.h"
62   std::vector<SectionChunk *> chunks;
81   // Non-comdat chunks, dead chunks, and writable chunks are not eligible.
113         chunks.begin() + begin + 1, chunks.begin() + end, [&](SectionChunk *s) {
115             return equalsConstant(chunks[begin], s);
116           return equalsVariable(chunks[begin], s);
118     size_t mid = bound - chunks.begin();
123       chunks[i]->eqClass[(cnt + 1) % 2] = mid;
214     if (chunks[begin]->eqClass[cnt % 2] != chunks[i]->eqClass[cnt % 2])
232   if (chunks.size() < 1024) {
233     forEachClassRange(0, chunks.size(), fn);
240   // so that Fn can modify the Chunks in its shard without causing data
243   size_t step = chunks.size() / numShards;
246   boundaries[numShards] = chunks.size();
248     boundaries[i] = findBoundary((i - 1) * step, chunks.size());
270         chunks.push_back(sc);
284   parallelForEach(chunks, [&](SectionChunk *sc) {
291     parallelForEach(chunks, [&](SectionChunk *sc) {
301   // From now on, sections in Chunks are ordered so that sections in
303   llvm::stable_sort(chunks, [](const SectionChunk *a, const SectionChunk *b) {
324     log("Selected " + chunks[begin]->getDebugName());
326       log("  Removed " + chunks[i]->getDebugName());
327       chunks[begin]->replace(chunks[i]);