Lines Matching defs:sections

73   std::vector<const InputSection *> sections;
88       sections.push_back(isec);
99     // Ignore edges between input sections belonging to different output
100     // sections.  This is done because otherwise we would end up with clusters
101     // containing input sections that can't actually be placed adjacently in the
103     // would also end up moving input sections in other output sections without
209   // Sections will be sorted by decreasing order. Absent sections will have
210   // priority 0 and be placed at the end of sections.
216       orderMap[sections[i]] = curOrder--;
233         const InputSection *isec = sections[i];
356     // Sort sections by the profile data provided by __LLVM,__cg_profile
357     // sections.
360     // sections according to the C³ heuristic. All clusters are then sorted by a