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