Home
last modified time | relevance | path

Searched refs:graph (Results 1 – 25 of 252) sorted by relevance

1234567891011

/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dconflict.c153 conflict_graph graph local
155 graph->num_regs = num_regs;
159 graph->arc_hash_table
163 obstack_init (&graph->arc_obstack);
166 graph->neighbor_heads
169 memset (graph->neighbor_heads, 0, num_regs * sizeof (conflict_graph_arc));
170 return graph;
176 conflict_graph_delete (graph) in conflict_graph_delete() argument
177 conflict_graph graph; in conflict_graph_delete()
179 obstack_free (&graph->arc_obstack, NULL);
[all …]
/openbsd-src/gnu/gcc/gcc/
H A Dconflict.c150 conflict_graph graph = XNEW (struct conflict_graph_def); in conflict_graph_new() local
151 graph->num_regs = num_regs; in conflict_graph_new()
155 graph->arc_hash_table in conflict_graph_new()
159 obstack_init (&graph->arc_obstack); in conflict_graph_new()
162 graph->neighbor_heads = XCNEWVEC (conflict_graph_arc, num_regs); in conflict_graph_new()
164 return graph; in conflict_graph_new()
170 conflict_graph_delete (conflict_graph graph) in conflict_graph_delete() argument
172 obstack_free (&graph->arc_obstack, NULL); in conflict_graph_delete()
173 htab_delete (graph->arc_hash_table); in conflict_graph_delete()
174 free (graph->neighbor_heads); in conflict_graph_delete()
[all …]
H A Dtree-ssa-structalias.c479 static constraint_graph_t graph; variable
497 gcc_assert (node < graph->size); in find()
498 if (graph->rep[node] != node) in find()
499 return graph->rep[node] = find (graph->rep[node]); in find()
511 gcc_assert (to < graph->size && from < graph->size); in unite()
512 if (to != from && graph->rep[from] != to) in unite()
514 graph->rep[from] = to; in unite()
781 insert_into_complex (constraint_graph_t graph, in insert_into_complex() argument
784 VEC (constraint_t, heap) *complex = graph->complex[var]; in insert_into_complex()
791 VEC_safe_insert (constraint_t, heap, graph->complex[var], place, c); in insert_into_complex()
[all …]
H A Dcfgloopanal.c76 struct graph struct
85 extern void dump_graph (FILE *, struct graph *);
88 dump_graph (FILE *f, struct graph *g) in dump_graph()
113 static struct graph *
116 struct graph *g = XNEW (struct graph); in new_graph()
127 add_edge (struct graph *g, int f, int t, void *data) in add_edge()
147 dfs (struct graph *g, int *qs, int nq, int *qt, bool forward) in dfs()
208 check_irred (struct graph *g, struct edge *e) in check_irred()
227 for_each_edge (struct graph *g, in for_each_edge() argument
228 void (callback) (struct graph *, struct edge *)) in for_each_edge()
[all …]
/openbsd-src/gnu/llvm/clang/utils/analyzer/
H A Dexploded-graph-rewriter.py505 def visit_begin_graph(self, graph): argument
506 self._graph = graph
928 def explore(self, graph, visitor): argument
929 visitor.visit_begin_graph(graph)
930 for node in sorted(graph.nodes):
932 visitor.visit_node(graph.nodes[node])
933 for succ in sorted(graph.nodes[node].successors):
935 visitor.visit_edge(graph.nodes[node], graph.nodes[succ])
948 def trim(self, graph): argument
950 node_id = graph.root_id
[all …]
/openbsd-src/gnu/lib/libstdc++/libstdc++/testsuite/22_locale/
H A Dctype_scan_wchar_t.cc75 VERIFY_SCAN_IS (std::ctype_base::graph, ca, ca); in test01()
87 VERIFY_SCAN_NOT (std::ctype_base::graph, ca, ca+5); in test01()
100 VERIFY_SCAN_IS (std::ctype_base::graph, cz, cz); in test01()
112 VERIFY_SCAN_NOT (std::ctype_base::graph, cz, cz+5); in test01()
125 VERIFY_SCAN_IS (std::ctype_base::graph, cA, cA); in test01()
137 VERIFY_SCAN_NOT (std::ctype_base::graph, cA, cA+5); in test01()
150 VERIFY_SCAN_IS (std::ctype_base::graph, cZ, cZ); in test01()
162 VERIFY_SCAN_NOT (std::ctype_base::graph, cZ, cZ+5); in test01()
175 VERIFY_SCAN_IS (std::ctype_base::graph, c0, c0); in test01()
187 VERIFY_SCAN_NOT (std::ctype_base::graph, c0, c0+5); in test01()
[all …]
H A Dctype_scan_char.cc74 VERIFY_SCAN_IS (std::ctype_base::graph, ca, ca); in test01()
86 VERIFY_SCAN_NOT (std::ctype_base::graph, ca, ca+5); in test01()
99 VERIFY_SCAN_IS (std::ctype_base::graph, cz, cz); in test01()
111 VERIFY_SCAN_NOT (std::ctype_base::graph, cz, cz+5); in test01()
124 VERIFY_SCAN_IS (std::ctype_base::graph, cA, cA); in test01()
136 VERIFY_SCAN_NOT (std::ctype_base::graph, cA, cA+5); in test01()
149 VERIFY_SCAN_IS (std::ctype_base::graph, cZ, cZ); in test01()
161 VERIFY_SCAN_NOT (std::ctype_base::graph, cZ, cZ+5); in test01()
174 VERIFY_SCAN_IS (std::ctype_base::graph, c0, c0); in test01()
186 VERIFY_SCAN_NOT (std::ctype_base::graph, c0, c0+5); in test01()
[all …]
/openbsd-src/gnu/llvm/llvm/docs/DependenceGraphs/
H A Dindex.rst23 dependencies between individual instructions. Each node in such a graph
29 As described in [1]_ the DDG uses graph abstraction to group nodes
30 that are part of a strongly connected component of the graph
33 connected component of the graph is a maximal subgraph of all the nodes
81 The graph build algorithm considers dependencies between elements of
90 design pattern to isolate the construction of the dependence graph
94 pattern as it applies to the dependence graph implementation.
100 and ``PDGBuilder`` control some aspects of how the graph is constructed
112 - Builder allows graph construction code to be reused for DDG and PDG.
130 graph described in [1]_ in the following ways:
[all …]
/openbsd-src/usr.bin/file/magdir/
H A Dvisx29 >2 byte 130 (graph)
30 >2 byte 131 (adjacency graph)
31 >2 byte 132 (adjacency graph library)
/openbsd-src/gnu/gcc/libstdc++-v3/config/os/bsd/darwin/
H A Dctype_inline.h66 | space | print | graph | cntrl | punct | alnum); in is()
76 if (this->is(graph, *__low)) __m |= graph; in is()
129 | space | print | graph | cntrl | punct | alnum); in do_is()
H A Dctype_base.h56 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; member
69 static const mask graph = _A | _D | _P; member
/openbsd-src/gnu/gcc/libstdc++-v3/config/os/bsd/freebsd/
H A Dctype_inline.h66 | space | print | graph | cntrl | punct | alnum); in is()
76 if (this->is(graph, *__low)) __m |= graph; in is()
129 | space | print | graph | cntrl | punct | alnum); in do_is()
H A Dctype_base.h58 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; member
71 static const mask graph = _A | _D | _P; member
/openbsd-src/gnu/lib/libstdc++/libstdc++/config/os/bsd/freebsd/
H A Dctype_inline.h59 | space | print | graph | cntrl | punct | alnum); in is()
69 if (this->is(graph, *__low)) __m |= graph; in is()
H A Dctype_base.h55 static const mask graph = _CTYPE_G; member
68 static const mask graph = _G; member
/openbsd-src/gnu/usr.bin/binutils/gprof/
H A DREADME18 o Supports profiling at the line level: flat profiles, call-graph profiles,
40 o In the call-graph function index, static function names are now
71 the option to delete arcs from the call graph. The old syntax
208 -q[symspec] --graph[=symspec]
209 Request output in the form of a call-graph
213 "symspec" in the call-graph. If the option is
214 specified multiple times, the call-graph includes
217 -Q[symspec] --no-graph[=symspec]
218 Suppress output in the call-graph. If given without
219 an argument, the call-graph is suppressed completely.
[all …]
H A Dbsd_callg_bl.m4 call graph profile:
10 index the index of the function in the call graph
33 index the index of the function in the call graph
60 index the index of this parent in the call graph
86 index the index of this child in the call graph listing,
/openbsd-src/gnu/usr.bin/binutils-2.17/gprof/
H A DREADME18 o Supports profiling at the line level: flat profiles, call-graph profiles,
40 o In the call-graph function index, static function names are now
71 the option to delete arcs from the call graph. The old syntax
208 -q[symspec] --graph[=symspec]
209 Request output in the form of a call-graph
213 "symspec" in the call-graph. If the option is
214 specified multiple times, the call-graph includes
217 -Q[symspec] --no-graph[=symspec]
218 Suppress output in the call-graph. If given without
219 an argument, the call-graph is suppressed completely.
[all …]
H A Dbsd_callg_bl.m4 call graph profile:
10 index the index of the function in the call graph
33 index the index of the function in the call graph
60 index the index of this parent in the call graph
86 index the index of this child in the call graph listing,
/openbsd-src/usr.bin/gprof/
H A Dgprof.callg2 call graph profile:
7 index the index of the function in the call graph listing, as an aid to
20 index the index in the call graph listing, as an aid to locating it.
36 index the index in the call graph listing, as an aid in locating it.
51 index the index in the call graph listing, as an aid to locating it.
/openbsd-src/gnu/llvm/llvm/tools/llvm-xray/
H A DCMakeLists.txt17 xray-graph-diff.cpp
18 xray-graph.cpp
/openbsd-src/gnu/usr.bin/perl/t/re/
H A Dcharset.t37 '[:graph:]' => [ 0x02C7 ],
76 push @{$testcases{'[:graph:]'}}, utf8::unicode_to_native($_)
79 push @{$testcases{'[:graph:]'}}, utf8::unicode_to_native(0xA8);
80 push @{$testcases{'[:graph:]'}}, utf8::unicode_to_native(0xA9);
83 push @{$testcases{'[:graph:]'}}, utf8::unicode_to_native($_)
88 push @{$testcases{'[:graph:]'}}, utf8::unicode_to_native(0xB8);
89 push @{$testcases{'[:graph:]'}}, utf8::unicode_to_native(0xB9);
92 push @{$testcases{'[:graph:]'}}, utf8::unicode_to_native(0xBC);
93 push @{$testcases{'[:graph:]'}}, utf8::unicode_to_native(0xBD);
94 push @{$testcases{'[:graph
[all...]
/openbsd-src/gnu/llvm/llvm/utils/gn/secondary/llvm/tools/llvm-xray/
H A DBUILD.gn18 "xray-graph-diff.cpp",
19 "xray-graph.cpp",
/openbsd-src/gnu/usr.bin/binutils/gprof/po/
H A Did.po119 "\t\t Call graph (explanation follows)\n"
122 "\t\t Panggil graph (penjelasan mengikuti)\n"
127 "\t\t\tCall graph\n"
130 "\t\t\tPanggil graph\n"
344 msgid "\t%d call-graph record\n"
345 msgstr "\t%d catatan call-graph\n"
349 msgid "\t%d call-graph records\n"
350 msgstr "\t%d catatan call-graph\n"
368 "\t[--[no-]flat-profile[=name]] [--[no-]graph[=name]]\n"
374 "\t[--static-call-graph] [--sum] [--table-length=len] [--traditional]\n"
[all …]
/openbsd-src/gnu/usr.bin/binutils-2.17/gprof/po/
H A Did.po119 "\t\t Call graph (explanation follows)\n"
122 "\t\t Panggil graph (penjelasan mengikuti)\n"
127 "\t\t\tCall graph\n"
130 "\t\t\tPanggil graph\n"
344 msgid "\t%d call-graph record\n"
345 msgstr "\t%d catatan call-graph\n"
349 msgid "\t%d call-graph records\n"
350 msgstr "\t%d catatan call-graph\n"
368 "\t[--[no-]flat-profile[=name]] [--[no-]graph[=name]]\n"
374 "\t[--static-call-graph] [--sum] [--table-length=len] [--traditional]\n"
[all …]

1234567891011