Lines Matching defs:sections

71   std::vector<const InputSection *> sections;
86       sections.push_back(isec);
97     // Ignore edges between input sections belonging to different output
98     // sections.  This is done because otherwise we would end up with clusters
99     // containing input sections that can't actually be placed adjacently in the
101     // would also end up moving input sections in other output sections without
207   // Sections will be sorted by decreasing order. Absent sections will have
208   // priority 0 and be placed at the end of sections.
212       orderMap[sections[i]] = curOrder++;
229         const InputSection *isec = sections[i];
360     // Sort sections by the profile data provided by __LLVM,__cg_profile
361     // sections.
364     // sections according to the C³ heuristic. All clusters are then sorted by a