Home
last modified time | relevance | path

Searched refs:clusters (Results 1 – 17 of 17) sorted by relevance

/openbsd/gnu/llvm/lld/ELF/
H A DCallGraphSort.cpp85 std::vector<Cluster> clusters; member in __anon215c4ed40111::CallGraphSort
111 clusters.emplace_back(clusters.size(), isec->getSize()); in CallGraphSort()
134 clusters[to].weight += weight; in CallGraphSort()
140 Cluster &toC = clusters[to]; in CallGraphSort()
146 for (Cluster &c : clusters) in CallGraphSort()
189 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
195 Cluster &c = clusters[l]; in run()
219 if (clusters[i].size > 0) in run()
222 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
230 i = clusters[i].next; in run()
[all …]
/openbsd/gnu/llvm/lld/COFF/
H A DCallGraphSort.cpp57 std::vector<Cluster> clusters; member in __anon8467269b0111::CallGraphSort
84 clusters.emplace_back(clusters.size(), isec->getSize()); in CallGraphSort()
107 clusters[to].weight += weight; in CallGraphSort()
113 Cluster &toC = clusters[to]; in CallGraphSort()
119 for (Cluster &c : clusters) in CallGraphSort()
162 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
168 Cluster &c = clusters[l]; in run()
192 if (clusters[i].size > 0) in run()
195 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
205 i = clusters[i].next; in run()
[all …]
/openbsd/gnu/llvm/lld/MachO/
H A DSectionPriorities.cpp72 std::vector<Cluster> clusters; member in __anon0f0fec0e0111::CallGraphSort
89 clusters.emplace_back(clusters.size(), isec->getSize()); in CallGraphSort()
111 clusters[to].weight += weight; in CallGraphSort()
117 Cluster &toC = clusters[to]; in CallGraphSort()
123 for (Cluster &c : clusters) in CallGraphSort()
171 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
177 Cluster &c = clusters[l]; in run()
201 if (clusters[i].size > 0) in run()
204 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
217 i = clusters[i].next; in run()
[all …]
/openbsd/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])]
663 s.clusters[c].bindings[b]))
669 for b in prev_s.clusters[c].bindings:
673 s.clusters[c].diff_bindings(prev_s.clusters[c])
679 for b in s.clusters[c].bindings:
682 for c in s.clusters:
[all …]
/openbsd/gnu/llvm/llvm/docs/CommandGuide/
H A Dllvm-exegesis.rst127 -analysis-clusters-output-file=/tmp/clusters.csv \
130 This will group the instructions into clusters with the same performance
131 characteristics. The clusters will be written out to `/tmp/clusters.csv` in the
152 :program:`llvm-exegesis` will also analyze the clusters to point out
197 `-analysis-clusters-output-file=` and `-analysis-inconsistencies-output-file=`.
274 .. option:: -analysis-clusters-output-file=</path/to/file>
276 If provided, write the analysis clusters as CSV to this file. "-" prints to
314 .. option:: -analysis-display-unstable-clusters
/openbsd/gnu/gcc/gcc/config/alpha/
H A Dev6.md25 ; EV6 has two symmetric pairs ("clusters") of two asymmetric integer
28 ; ??? The clusters have independent register files that are re-synced
30 ; insns issued on different clusters. Possibly model that by duplicating
/openbsd/gnu/usr.bin/gcc/gcc/config/alpha/
H A Dev6.md25 ; EV6 has two symmetric pairs ("clusters") of two asymetric integer
28 ; ??? The clusters have independent register files that are re-synced
30 ; insns issued on different clusters. Possibly model that by duplicating
/openbsd/gnu/usr.bin/perl/dist/Module-CoreList/lib/Module/
H A DCoreList.pod190 clusters known perl releases by their major versions.
/openbsd/gnu/llvm/clang/docs/analyzer/developer-docs/
H A DRegionStore.rst13 Regions are grouped into "clusters", which roughly correspond to "regions with
/openbsd/gnu/usr.bin/perl/pod/
H A Dperluniintro.pod64 Whether to call these extended grapheme clusters "characters" depends on your
80 (code points) to express many more potential grapheme clusters. To
344 Note that Perl considers grapheme clusters to be separate characters, so for
H A Dperlunicode.pod367 The Unicode standard calls these "extended grapheme clusters" (which
H A Dperl5260delta.pod477 grapheme clusters (which look like a single character, but may be
/openbsd/gnu/usr.bin/perl/cpan/perlfaq/lib/
H A Dperlglossary.pod589 A X<clusters, defined>X<subpatterns, cluster>parenthesized B<subpattern>
3287 The X<switch clusters>X<clusters, switch>combination of multiple command-
/openbsd/gnu/usr.bin/perl/lib/unicore/
H A DIndicSyllabicCategory.txt1031 # Medial Consonant (medial liquid, occurring in clusters)
H A DNamesList.txt6872 * marks a consonant that is simultaneously a part of two consonant clusters in Pali text
/openbsd/gnu/llvm/clang/docs/
H A DUsersManual.rst2177 Further, section clusters can also be specified using the ``list=<arg>``
/openbsd/games/fortune/datfiles/
H A Dfortunes213476 And sunny clusters ripened for the wine: