reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
108 chunks.begin() + begin + 1, chunks.begin() + end, [&](SectionChunk *s) { 108 chunks.begin() + begin + 1, chunks.begin() + end, [&](SectionChunk *s) { 110 return equalsConstant(chunks[begin], s); 111 return equalsVariable(chunks[begin], s); 113 size_t mid = bound - chunks.begin(); 118 chunks[i]->eqClass[(cnt + 1) % 2] = mid; 196 if (chunks[begin]->eqClass[cnt % 2] != chunks[i]->eqClass[cnt % 2]) 196 if (chunks[begin]->eqClass[cnt % 2] != chunks[i]->eqClass[cnt % 2]) 214 if (chunks.size() < 1024) { 215 forEachClassRange(0, chunks.size(), fn); 225 size_t step = chunks.size() / numShards; 228 boundaries[numShards] = chunks.size(); 230 boundaries[i] = findBoundary((i - 1) * step, chunks.size()); 251 chunks.push_back(sc); 265 parallelForEach(chunks, [&](SectionChunk *sc) { 272 parallelForEach(chunks, [&](SectionChunk *sc) { 284 llvm::stable_sort(chunks, [](const SectionChunk *a, const SectionChunk *b) { 305 log("Selected " + chunks[begin]->getDebugName()); 307 log(" Removed " + chunks[i]->getDebugName()); 308 chunks[begin]->replace(chunks[i]); 308 chunks[begin]->replace(chunks[i]);