Searched refs:clusters (Results 1 - 4 of 4) sorted by relevance

/openbsd-current/gnu/llvm/lld/ELF/
H A DCallGraphSort.cpp24 /// * Defines when and how clusters are combined. Pick the highest weighted
38 /// * If not, then combine the clusters.
39 /// * Sort non-empty clusters by density
85 std::vector<Cluster> clusters; member in class:__anon1233::CallGraphSort
108 auto res = secToCluster.try_emplace(isec, clusters.size());
111 clusters.emplace_back(clusters.size(), isec->getSize());
123 // sections. This is done because otherwise we would end up with clusters
134 clusters[to].weight += weight;
140 Cluster &toC = clusters[t
[all...]
/openbsd-current/gnu/llvm/lld/COFF/
H A DCallGraphSort.cpp57 std::vector<Cluster> clusters; member in class:__anon1200::CallGraphSort
81 auto res = secToCluster.try_emplace(isec, clusters.size());
84 clusters.emplace_back(clusters.size(), isec->getSize());
96 // sections. This is done because otherwise we would end up with clusters
107 clusters[to].weight += weight;
113 Cluster &toC = clusters[to];
119 for (Cluster &c : clusters)
123 // It's bad to merge clusters which would degrade the density too much.
153 // Group InputSections into clusters usin
[all...]
/openbsd-current/gnu/llvm/lld/MachO/
H A DSectionPriorities.cpp72 std::vector<Cluster> clusters; member in class:__anon1257::CallGraphSort
86 auto res = secToCluster.try_emplace(isec, clusters.size());
89 clusters.emplace_back(clusters.size(), isec->getSize());
100 // sections. This is done because otherwise we would end up with clusters
111 clusters[to].weight += weight;
117 Cluster &toC = clusters[to];
123 for (Cluster &c : clusters)
127 // It's bad to merge clusters which would degrade the density too much.
157 // Group InputSections into clusters usin
[all...]
/openbsd-current/gnu/llvm/clang/utils/analyzer/
H A Dexploded-graph-rewriter.py212 self.clusters = collections.OrderedDict(
216 removed = [k for k in prev.clusters if k not in self.clusters]
217 added = [k for k in self.clusters if k not in prev.clusters]
218 updated = [k for k in prev.clusters if k in self.clusters
219 and prev.clusters[k].is_different(self.clusters[k])]
660 s.clusters[
[all...]

Completed in 208 milliseconds