Home
last modified time | relevance | path

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

1234567891011

/openbsd/gnu/usr.bin/gcc/gcc/
H A Dconflict.c153 conflict_graph graph local
159 graph->arc_hash_table
166 graph->neighbor_heads
170 return graph;
177 conflict_graph graph; in conflict_graph_delete()
182 free (graph);
191 conflict_graph graph; in conflict_graph_add()
240 conflict_graph graph; in conflict_graph_conflict_p()
257 conflict_graph graph; in conflict_graph_enum()
284 conflict_graph graph; in conflict_graph_merge_regs()
[all …]
/openbsd/gnu/gcc/gcc/
H A Dconflict.c151 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()
164 return graph; in conflict_graph_new()
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()
175 free (graph); in conflict_graph_delete()
204 = obstack_alloc (&graph->arc_obstack, in conflict_graph_add()
213 graph->neighbor_heads[smaller] = arc; in conflict_graph_add()
[all …]
H A Dtree-ssa-structalias.c499 return graph->rep[node] = find (graph->rep[node]); in find()
511 gcc_assert (to < graph->size && from < graph->size); in unite()
852 graph->indirect_cycles[to] = graph->indirect_cycles[from]; in merge_graph_nodes()
962 graph->succs = XCNEWVEC (bitmap, graph->size); in build_pred_graph()
963 graph->implicit_preds = XCNEWVEC (bitmap, graph->size); in build_pred_graph()
964 graph->preds = XCNEWVEC (bitmap, graph->size); in build_pred_graph()
966 graph->label = XCNEWVEC (unsigned int, graph->size); in build_pred_graph()
967 graph->rep = XNEWVEC (unsigned int, graph->size); in build_pred_graph()
968 graph->eq_rep = XNEWVEC (int, graph->size); in build_pred_graph()
971 graph->direct_nodes = sbitmap_alloc (graph->size); in build_pred_graph()
[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()
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()
241 free_graph (struct graph *g) in free_graph()
[all …]
/openbsd/gnu/llvm/clang/utils/analyzer/
H A Dexploded-graph-rewriter.py506 self._graph = graph
935 visitor.visit_edge(graph.nodes[node], graph.nodes[succ])
948 def trim(self, graph): argument
950 node_id = graph.root_id
964 graph.nodes = {node_id: graph.nodes[node_id]
992 def trim(self, graph): argument
1003 graph.nodes = {node_id: graph.nodes[node_id]
1005 for node_id in graph.nodes:
1057 graph = ExplodedGraph()
1076 trimmer.trim(graph)
[all …]
/openbsd/gnu/lib/libstdc++/libstdc++/testsuite/22_locale/
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()
124 VERIFY_SCAN_IS (std::ctype_base::graph, cA, cA); in test01()
149 VERIFY_SCAN_IS (std::ctype_base::graph, cZ, cZ); in test01()
174 VERIFY_SCAN_IS (std::ctype_base::graph, c0, c0); in test01()
199 VERIFY_SCAN_IS (std::ctype_base::graph, c9, c9); in test01()
249 VERIFY_SCAN_IS (std::ctype_base::graph, xf, xf); in test01()
274 VERIFY_SCAN_IS (std::ctype_base::graph, xF, xF); in test01()
299 VERIFY_SCAN_IS (std::ctype_base::graph, p1, p1); in test01()
[all …]
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()
125 VERIFY_SCAN_IS (std::ctype_base::graph, cA, cA); in test01()
150 VERIFY_SCAN_IS (std::ctype_base::graph, cZ, cZ); in test01()
175 VERIFY_SCAN_IS (std::ctype_base::graph, c0, c0); in test01()
200 VERIFY_SCAN_IS (std::ctype_base::graph, c9, c9); in test01()
250 VERIFY_SCAN_IS (std::ctype_base::graph, xf, xf); in test01()
275 VERIFY_SCAN_IS (std::ctype_base::graph, xF, xF); in test01()
300 VERIFY_SCAN_IS (std::ctype_base::graph, p1, p1); in test01()
[all …]
/openbsd/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/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/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/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/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/gnu/usr.bin/binutils/gprof/
H A DREADME208 -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
221 from the call-graph. If the option is specified
224 than --graph.
238 the selected symbols from the call-graph. If the
249 call-graph, or basic-block count records.
[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/gnu/usr.bin/binutils-2.17/gprof/
H A DREADME208 -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
221 from the call-graph. If the option is specified
224 than --graph.
238 the selected symbols from the call-graph. If the
249 call-graph, or basic-block count records.
[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/usr.bin/gprof/
H A Dgprof.callg4 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/gnu/llvm/llvm/tools/llvm-xray/
H A DCMakeLists.txt17 xray-graph-diff.cpp
18 xray-graph.cpp
/openbsd/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:]'}}, utf8::unicode_to_native(0xBE);
[all …]
/openbsd/gnu/llvm/llvm/utils/gn/secondary/llvm/tools/llvm-xray/
H A DBUILD.gn18 "xray-graph-diff.cpp",
19 "xray-graph.cpp",
/openbsd/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"
444 msgid "%s: gmon.out file is missing call-graph data\n"
[all …]
/openbsd/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"
444 msgid "%s: gmon.out file is missing call-graph data\n"
[all …]

1234567891011