| /NextBSD/contrib/gcc/ |
| HD | conflict.c | 150 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 …]
|
| HD | tree-ssa-structalias.c | 479 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 …]
|
| HD | cfgloopanal.c | 76 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 …]
|
| HD | tree-ssa-live.c | 1368 add_conflicts_if_valid (tpa_p tpa, conflict_graph graph, in add_conflicts_if_valid() argument
1386 conflict_graph_add (graph, p, y); in add_conflicts_if_valid()
1399 conflict_graph graph; in build_tree_conflict_graph() local
1411 graph = conflict_graph_new (num_var_partitions (map)); in build_tree_conflict_graph()
1414 return graph; in build_tree_conflict_graph()
1471 add_conflicts_if_valid (tpa, graph, map, live, lhs); in build_tree_conflict_graph()
1487 add_conflicts_if_valid (tpa, graph, map, live, var); in build_tree_conflict_graph()
1508 add_conflicts_if_valid (tpa, graph, map, live, result); 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()
[all …]
|
| HD | tree-outof-ssa.c | 579 coalesce_abnormal_edges (var_map map, conflict_graph graph, root_var_p rv) in coalesce_abnormal_edges() argument
636 if (conflict_graph_conflict_p (graph, x, y)) in coalesce_abnormal_edges()
644 gcc_assert (!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()
[all …]
|
| /NextBSD/tools/tools/locale/etc/ |
| HD | manual-input.UTF-8 | 13 graph <INVERTED_EXCLAMATION_MARK>;...;<INVERTED_QUESTION_MARK>
16 graph <DIVISION_SIGN>;<MULTIPLICATION_SIGN>
134 graph <MODIFIER_LETTER_SMALL_H>;...;<MODIFIER_LETTER_LOW_LEFT_ARROW>
149 graph <COMBINING_GRAVE_ACCENT>;...;<COMBINING_LATIN_SMALL_LETTER_X>
155 graph <COPTIC_CAPITAL_LETTER_SHEI>;/
202 graph <SYRIAC_END_OF_PARAGRAPH>;...;<SYRIAC_LETTER_SOGDIAN_FE>
208 graph <THAANA_LETTER_HAA>;...;<THAANA_LETTER_NAA>
215 graph <NKO_LETTER_A>;...;<NKO_LAJANYALAN>
221 graph <SAMARITAN_LETTER_ALAF>;...;<SAMARITAN_PUNCTUATION_ANNAAU>
227 graph <MANDAIC_LETTER_HALQA>;...;<MANDAIC_GEMINATION_MARK>;/
[all …]
|
| HD | common.UTF-8.src | 772 graph <EXCLAMATION_MARK>;...;<TILDE>;/
1886 graph <MICRO_SIGN>;/
2491 graph <CYRILLIC_CAPITAL_LETTER_IE_WITH_GRAVE>;...;<CYRILLIC_SMALL_LETTER_PE>;/
2886 graph <ARMENIAN_CAPITAL_LETTER_AYB>;...;<ARMENIAN_CAPITAL_LETTER_KEN>;/
2995 graph <HEBREW_ACCENT_ETNAHTA>;...;<HEBREW_POINT_RAFE>;/
3056 graph <ARABIC-INDIC_CUBE_ROOT>;...;<AFGHANI_SIGN>;/
3107 graph <DEVANAGARI_SIGN_INVERTED_CANDRABINDU>;...;<DEVANAGARI_VOWEL_SIGN_I>;/
3139 graph <BENGALI_ANJI>;...;<BENGALI_SIGN_VISARGA>;/
3184 graph <GURMUKHI_SIGN_ADAK_BINDI>;...;<GURMUKHI_SIGN_VISARGA>;/
3226 graph <GUJARATI_SIGN_CANDRABINDU>;...;<GUJARATI_SIGN_VISARGA>;/
[all …]
|
| /NextBSD/usr.bin/tsort/ |
| HD | tsort.c | 100 static NODE *graph, **cycle_buf, **longest_cycle; variable
270 if ((n->n_next = graph) != NULL) in get_node()
271 graph->n_prevp = &n->n_next; in get_node()
272 n->n_prevp = &graph; in get_node()
273 graph = n; in get_node()
292 for (n = graph; n != NULL; n = n->n_next) in clear_cycle()
303 while (graph != NULL) { in tsort()
310 for (cnt = 0, n = graph; n != NULL; n = next) { in tsort()
317 } while (graph != NULL && cnt); in tsort()
319 if (graph == NULL) in tsort()
[all …]
|
| /NextBSD/sys/contrib/octeon-sdk/ |
| HD | cvmx-dfa.h | 537 static inline void cvmx_dfa_write_edge_sm(const cvmx_dfa_graph_t *graph, in cvmx_dfa_write_edge_sm() argument
544 address.u64 = graph->base_address + source_node * CVMX_DFA_NODESM_SIZE + match_index * 4; in cvmx_dfa_write_edge_sm()
583 static inline void cvmx_dfa_write_node_lg(const cvmx_dfa_graph_t *graph, in cvmx_dfa_write_node_lg() argument
590 address.u64 = graph->base_address + source_node * CVMX_DFA_NODELG_SIZE + (uint64_t)match * 4; in cvmx_dfa_write_node_lg()
714 static inline void cvmx_dfa_submit(const cvmx_dfa_graph_t *graph, int start_node, in cvmx_dfa_submit() 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()
[all …]
|
| /NextBSD/share/ctypedef/ |
| HD | en_US.UTF-8.src | 772 graph <EXCLAMATION_MARK>;...;<TILDE>;/
1886 graph <MICRO_SIGN>;/
2491 graph <CYRILLIC_CAPITAL_LETTER_IE_WITH_GRAVE>;...;<CYRILLIC_SMALL_LETTER_PE>;/
2886 graph <ARMENIAN_CAPITAL_LETTER_AYB>;...;<ARMENIAN_CAPITAL_LETTER_KEN>;/
2995 graph <HEBREW_ACCENT_ETNAHTA>;...;<HEBREW_POINT_RAFE>;/
3056 graph <ARABIC-INDIC_CUBE_ROOT>;...;<AFGHANI_SIGN>;/
3107 graph <DEVANAGARI_SIGN_INVERTED_CANDRABINDU>;...;<DEVANAGARI_VOWEL_SIGN_I>;/
3139 graph <BENGALI_ANJI>;...;<BENGALI_SIGN_VISARGA>;/
3184 graph <GURMUKHI_SIGN_ADAK_BINDI>;...;<GURMUKHI_SIGN_VISARGA>;/
3226 graph <GUJARATI_SIGN_CANDRABINDU>;...;<GUJARATI_SIGN_VISARGA>;/
[all …]
|
| /NextBSD/contrib/file/magic/Magdir/ |
| HD | graphviz | 7 # 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
|
| HD | visx | 29 >2 byte 130 (graph)
30 >2 byte 131 (adjacency graph)
31 >2 byte 132 (adjacency graph library)
|
| /NextBSD/contrib/libstdc++/config/os/bsd/darwin/ |
| D | ctype_inline.h | 66 | 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()
|
| D | ctype_base.h | 56 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; member
69 static const mask graph = _A | _D | _P; member
|
| /NextBSD/contrib/libstdc++/config/os/bsd/freebsd/ |
| D | ctype_inline.h | 66 | 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()
|
| D | ctype_base.h | 59 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
|
| /NextBSD/usr.bin/gprof/ |
| HD | gprof.callg | 4 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,
|
| /NextBSD/contrib/gcc/doc/ |
| HD | cfg.texi | 15 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
28 * Maintaining the CFG:: Keeping the control flow graph and up to date.
140 @cindex edge in the flow graph
229 may be freely redirected when the flow graph is not in SSA form.
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.
[all …]
|
| /NextBSD/contrib/groff/contrib/mm/examples/ |
| HD | SETR | 28 graph
42 .H 2 "grapefruit grapevine graph grapheme graphic graphite"
81 graph
|
| HD | ML | 120 graph
161 graph
|
| HD | COVER | 34 graph
177 graph
|
| /NextBSD/contrib/binutils/gprof/po/ |
| HD | gprof.pot | 112 "\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"
|
| HD | ms.po | 123 "\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"
|
| /NextBSD/contrib/byacc/ |
| HD | makefile.in | 58 graph.c \
74 graph$o \
|
| /NextBSD/contrib/libstdc++/config/os/generic/ |
| D | ctype_base.h | 54 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member
|