221   bool verifyRanges(const std::vector<Chunk *> chunks);
247   void sortCRTSectionChunks(std::vector<Chunk *> &chunks);
249   void sortBySectionOrder(std::vector<Chunk *> &chunks);
326   chunks.push_back(c);  in addChunk()
330   chunks.insert(chunks.begin(), c);  in insertChunkAtStart()
339   chunks.insert(chunks.end(), other->chunks.begin(), other->chunks.end());  in merge()
340   other->chunks.clear();  in merge()
438   for (size_t i = 0; i != os->chunks.size(); ++i) {  in createThunks()
439     SectionChunk *sc = dyn_cast_or_null<SectionChunk>(os->chunks[i]);  in createThunks()
477         os->chunks.insert(os->chunks.begin() + thunkInsertionSpot, thunkChunk);  in createThunks()
527 bool Writer::verifyRanges(const std::vector<Chunk *> chunks) {  in verifyRanges()  argument
528   for (Chunk *c : chunks) {  in verifyRanges()
560     sec->origChunks = sec->chunks;  in finalizeAddresses()
561     origNumChunks += sec->chunks.size();  in finalizeAddresses()
572       if (!verifyRanges(sec->chunks)) {  in finalizeAddresses()
576       numChunks += sec->chunks.size();  in finalizeAddresses()
593         sec->chunks = sec->origChunks;  in finalizeAddresses()
720 void Writer::sortBySectionOrder(std::vector<Chunk *> &chunks) {  in sortBySectionOrder()  argument
728   llvm::stable_sort(chunks, [=](const Chunk *a, const Chunk *b) {  in sortBySectionOrder()
745     destSec->chunks.insert(destSec->chunks.end(), pSec->chunks.begin(),  in fixPartialSectionChars()
746                            pSec->chunks.end());  in fixPartialSectionChars()
747     pSec->chunks.clear();  in fixPartialSectionChars()
776     if (!pSec->chunks.empty())  in fixGnuImportChunks()
778     llvm::stable_sort(pSec->chunks, [&](Chunk *s, Chunk *t) {  in fixGnuImportChunks()
810     pSec->chunks.insert(pSec->chunks.end(), v.begin(), v.end());  in addSyntheticIdata()
829     if (!importDirs->chunks.empty())  in locateImportTables()
830       importTableStart = importDirs->chunks.front();  in locateImportTables()
831     for (Chunk *c : importDirs->chunks)  in locateImportTables()
836     if (!importAddresses->chunks.empty())  in locateImportTables()
837       iatStart = importAddresses->chunks.front();  in locateImportTables()
838     for (Chunk *c : importAddresses->chunks)  in locateImportTables()
877       sortBySectionOrder(it.second->chunks);  in sortSections()
933     pSec->chunks.push_back(c);  in createSections()
970       sortCRTSectionChunks(pSec->chunks);  in createSections()
974     for (Chunk *c : pSec->chunks)  in createSections()
1132   if (!edataSec->chunks.empty()) {  in createExportTable()
1138     for (Chunk *c : edata.chunks)  in createExportTable()
1141   if (!edataSec->chunks.empty()) {  in createExportTable()
1142     edataStart = edataSec->chunks.front();  in createExportTable()
1143     edataEnd = edataSec->chunks.back();  in createExportTable()
1159     return s->chunks.empty();  in removeUnusedSections()
1177     for (Chunk *c : os->chunks)  in assignOutputSectionIndices()
1324   if (!pdataSec->chunks.empty()) {  in mergeSections()
1325     firstPdata = pdataSec->chunks.front();  in mergeSections()
1326     lastPdata = pdataSec->chunks.back();  in mergeSections()
1384     for (Chunk *c : sec->chunks) {  in assignAddresses()
1959     parallelForEach(sec->chunks, [&](Chunk *c) {  in writeSections()
2069 void Writer::sortCRTSectionChunks(std::vector<Chunk *> &chunks) {  in sortCRTSectionChunks()  argument
2080   llvm::stable_sort(chunks, sectionChunkOrder);  in sortCRTSectionChunks()
2083     for (auto &c : chunks) {  in sortCRTSectionChunks()
2110   relocSec->chunks.clear();  in addBaserels()
2116     for (Chunk *c : sec->chunks)  in addBaserels()