Lines Matching defs:sections

58   std::vector<const SectionChunk *> sections;
83       sections.push_back(isec);
95     // Ignore edges between input sections belonging to different output
96     // sections.  This is done because otherwise we would end up with clusters
97     // containing input sections that can't actually be placed adjacently in the
99     // would also end up moving input sections in other output sections without
199   // Sections will be sorted by increasing order. Absent sections will have
200   // priority 0 and be placed at the end of sections.
204       orderMap[sections[i]] = curOrder++;
222         const SectionChunk *sc = sections[i];
242 // Sort sections by the profile data provided by  /call-graph-ordering-file
244 // This first builds a call graph based on the profile data then merges sections