Home
last modified time | relevance | path

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

123456

/freebsd-12.1/contrib/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 …]
H A Dtree-ssa-live.c1386 conflict_graph_add (graph, p, y); in add_conflicts_if_valid()
1399 conflict_graph graph; in build_tree_conflict_graph() local
1414 return graph; in build_tree_conflict_graph()
1537 conflict_graph_add (graph, x, y - 1); in build_tree_conflict_graph()
1553 return graph; in build_tree_conflict_graph()
1610 if (!conflict_graph_conflict_p (graph, x, y)) in coalesce_tpa_members()
1624 conflict_graph_merge_regs (graph, x, y); in coalesce_tpa_members()
1630 conflict_graph_merge_regs (graph, y, x); in coalesce_tpa_members()
1683 if (!conflict_graph_conflict_p (graph, p1, p2)) in coalesce_tpa_members()
1702 conflict_graph_merge_regs (graph, v, z); in coalesce_tpa_members()
[all …]
H A Dtree-outof-ssa.c636 if (conflict_graph_conflict_p (graph, x, y)) in coalesce_abnormal_edges()
670 conflict_graph_merge_regs (graph, x, y); in coalesce_abnormal_edges()
672 conflict_graph_merge_regs (graph, y, x); in coalesce_abnormal_edges()
819 conflict_graph graph; in coalesce_ssa_name() local
840 graph = build_tree_conflict_graph (liveinfo, rv, cl); in coalesce_ssa_name()
910 coalesce_abnormal_edges (map, graph, rv); in coalesce_ssa_name()
916 coalesce_tpa_members (rv, graph, map, cl, in coalesce_ssa_name()
921 coalesce_tpa_members (rv, graph, map, NULL, in coalesce_ssa_name()
927 conflict_graph_delete (graph); in coalesce_ssa_name()
1143 conflict_graph graph; in coalesce_vars() local
[all …]
/freebsd-12.1/usr.bin/tsort/
H A Dtsort.c102 static NODE *graph, **cycle_buf, **longest_cycle; variable
272 if ((n->n_next = graph) != NULL) in get_node()
273 graph->n_prevp = &n->n_next; in get_node()
274 n->n_prevp = &graph; in get_node()
275 graph = n; in get_node()
294 for (n = graph; n != NULL; n = n->n_next) in clear_cycle()
305 while (graph != NULL) { in tsort()
312 for (cnt = 0, n = graph; n != NULL; n = next) { in tsort()
319 } while (graph != NULL && cnt); in tsort()
321 if (graph == NULL) in tsort()
[all …]
/freebsd-12.1/sys/contrib/octeon-sdk/
H A Dcvmx-dfa.h537 static inline void cvmx_dfa_write_edge_sm(const cvmx_dfa_graph_t *graph, in cvmx_dfa_write_edge_sm() argument
583 static inline void cvmx_dfa_write_node_lg(const cvmx_dfa_graph_t *graph, in cvmx_dfa_write_node_lg() argument
726 command.s.gxor = graph->gxor; // (PASS3/CN58XX) in cvmx_dfa_submit()
727 command.s.nxoren = graph->nxoren; // (PASS3/CN58XX) in cvmx_dfa_submit()
728 command.s.nreplen = graph->nreplen; // (PASS3/CN58XX) in cvmx_dfa_submit()
730 command.s.replication = graph->replication; in cvmx_dfa_submit()
731 command.s.type = graph->type; in cvmx_dfa_submit()
732 command.s.base = graph->base_address>>10; in cvmx_dfa_submit()
750 if (graph->type == CVMX_DFA_GRAPH_TYPE_SM) in cvmx_dfa_submit()
752 command.s.tsize = (graph->num_terminal_nodes + 255) / 256; in cvmx_dfa_submit()
[all …]
/freebsd-12.1/contrib/file/magic/Magdir/
H A Dgraphviz7 # line matches a LaTeX file containing the word "graph" (with a {
9 #0 regex/100l [\r\n\t\ ]*graph[\r\n\t\ ]+.*\\{ graphviz graph text
H A Dvisx29 >2 byte 130 (graph)
30 >2 byte 131 (adjacency graph)
31 >2 byte 132 (adjacency graph library)
/freebsd-12.1/contrib/libstdc++/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.h59 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; in _GLIBCXX_BEGIN_NAMESPACE() local
72 static const mask graph = _A | _D | _P; in _GLIBCXX_BEGIN_NAMESPACE() local
/freebsd-12.1/contrib/libstdc++/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
/freebsd-12.1/contrib/byacc/
H A Ddescrip.mms8 error.obj,graph.obj, \
42 graph.obj : graph.c
H A Dmakefile.in58 graph.c \
74 graph$o \
/freebsd-12.1/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,
/freebsd-12.1/usr.bin/clang/llvm-xray/
H A DMakefile13 SRCS+= xray-graph-diff.cpp
14 SRCS+= xray-graph.cpp
/freebsd-12.1/contrib/gcc/doc/
H A Dcfg.texi15 A control flow graph (CFG) is a data structure built on top of the
18 being compiled. The CFG is a directed graph where the vertices
21 used to represent the control flow graph are defined in
140 @cindex edge in the flow graph
306 which has a much simpler flow graph:
372 maintaining profile within the flow graph.
395 probabilities over the graph.
436 assembly file and the flow graph is no longer maintained.
492 the control flow graph for the @code{tree} representation is
598 flow graph and insert instructions on them. In the RTL
[all …]
/freebsd-12.1/contrib/llvm/tools/lld/docs/
H A Ddesign.rst25 The Atom model allows the linker to use standard graph theory models for linking
87 to a master graph.
94 nothing is added to the master graph of atoms. Instead, if after merging all
95 atoms from object files into a master graph, if any "undefined" atoms are left
96 remaining in the master graph, the linker reads the table of contents for each
99 master graph of atoms.
109 the initial graph of atoms. Instead, (like static libraries) if there are
146 A Reader instantiates an lld::File object (which is a graph of Atoms) from a
152 into an Atom graph. For instance, you may want the Reader to only accept
181 made to see if there are any undefined atoms in the graph. If there are, the
[all …]
/freebsd-12.1/contrib/binutils/gprof/po/
H A Dgprof.pot112 "\t\t Call graph (explanation follows)\n"
119 "\t\t\tCall graph\n"
330 msgid "\t%d call-graph record\n"
335 msgid "\t%d call-graph records\n"
354 "\t[--[no-]flat-profile[=name]] [--[no-]graph[=name]]\n"
360 "\t[--static-call-graph] [--sum] [--table-length=len] [--traditional]\n"
422 msgid "%s: gmon.out file is missing call-graph data\n"
H A Dms.po123 "\t\t Call graph (explanation follows)\n"
132 "\t\t\tCall graph\n"
353 msgid "\t%d call-graph record\n"
358 msgid "\t%d call-graph records\n"
377 "\t[--[no-]flat-profile[=name]] [--[no-]graph[=name]]\n"
383 "\t[--static-call-graph] [--sum] [--table-length=len] [--traditional]\n"
391 "\t[--[no-]flat-profile[=name]] [--[no-]graph[=name]]\n"
397 "\t[--static-call-graph] [--sum] [--table-length=len] [--traditional]\n"
455 msgid "%s: gmon.out file is missing call-graph data\n"
/freebsd-12.1/sys/gnu/dts/arm64/zte/
H A Dzx296718-pcbox.dts38 compatible = "audio-graph-card";
43 compatible = "audio-graph-card";
/freebsd-12.1/contrib/mandoc/
H A Dterm.c260 int graph; /* Last character was non-blank. */ in term_fill() local
263 breakline = graph = 0; in term_fill()
290 if (graph) { in term_fill()
293 graph = 0; in term_fill()
303 graph = 1; in term_fill()
324 graph = 1; in term_fill()
339 if (graph && (vis <= vtarget || *nbr == 0)) { in term_fill()
/freebsd-12.1/contrib/libstdc++/config/os/generic/
H A Dctype_base.h54 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member
/freebsd-12.1/contrib/libstdc++/config/os/solaris/solaris2.5/
H A Dctype_base.h54 static const mask graph = 020 | 01 | 02 | 04; member

123456