Searched refs:graph (Results 1 - 25 of 50) sorted by relevance

12

/freebsd-9.3-release/contrib/gcc/
H A Dconflict.c1 /* Register conflict graph computation routines.
38 /* A register conflict graph is an undirected graph containing nodes
44 The conflict graph is represented by the data structures described
53 conflict is present in the graph.
64 /* An arc in a conflict graph. */
70 graph. Contains NULL if this is the tail. */
75 graph. Contains NULL if this is the tail. */
89 /* A conflict graph. */
96 /* The number of regs this conflict graph handle
150 conflict_graph graph = XNEW (struct conflict_graph_def); local
170 conflict_graph_delete(conflict_graph graph) argument
183 conflict_graph_add(conflict_graph graph, int reg1, int reg2) argument
227 conflict_graph_conflict_p(conflict_graph graph, int reg1, int reg2) argument
241 conflict_graph_enum(conflict_graph graph, int reg, conflict_graph_enum_fn enum_fn, void *extra) argument
265 conflict_graph_merge_regs(conflict_graph graph, int target, int src) argument
341 conflict_graph_print(conflict_graph graph, FILE *fp) argument
[all...]
H A Dtree-ssa-structalias.c134 5. A directed graph is built out of the copy constraints. Each
135 constraint variable is a node in the graph, and an edge from
138 6. The graph is then walked, and solution sets are
143 that node are processed by adding appropriate copy edges to the graph, or the
146 8. The process of walking the graph is iterated until no solution
149 Prior to walking the graph in steps 6 and 7, We perform static
150 cycle elimination on the constraint graph, as well
365 named NAME, and using constraint graph node NODE. */
426 /* List of constraints that we use to build the constraint graph from. */
435 /* The constraint graph i
479 static constraint_graph_t graph; variable
781 insert_into_complex(constraint_graph_t graph, unsigned int var, constraint_t c) argument
799 merge_node_constraints(constraint_graph_t graph, unsigned int to, unsigned int from) argument
830 clear_edges_for_node(constraint_graph_t graph, unsigned int node) argument
839 merge_graph_nodes(constraint_graph_t graph, unsigned int to, unsigned int from) argument
881 add_implicit_graph_edge(constraint_graph_t graph, unsigned int to, unsigned int from) argument
902 add_pred_graph_edge(constraint_graph_t graph, unsigned int to, unsigned int from) argument
916 add_graph_edge(constraint_graph_t graph, unsigned int to, unsigned int from) argument
944 valid_graph_edge(constraint_graph_t graph, unsigned int src, unsigned int dest) argument
1122 scc_visit(constraint_graph_t graph, struct scc_info *si, unsigned int n) argument
1206 unify_nodes(constraint_graph_t graph, unsigned int to, unsigned int from, bool update_changed) argument
1304 topo_visit(constraint_graph_t graph, struct topo_info *ti, unsigned int n) argument
1389 do_sd_constraint(constraint_graph_t graph, constraint_t c, bitmap delta) argument
1524 do_complex_constraint(constraint_graph_t graph, constraint_t c, bitmap delta) argument
1617 find_indirect_cycles(constraint_graph_t graph) argument
1634 compute_topo_order(constraint_graph_t graph, struct topo_info *ti) argument
1693 label_visit(constraint_graph_t graph, struct scc_info *si, unsigned int n) argument
1799 perform_var_substitution(constraint_graph_t graph) argument
1862 find_equivalent_node(constraint_graph_t graph, unsigned int node, unsigned int label) argument
1895 move_complex_constraints(constraint_graph_t graph, struct scc_info *si) argument
2031 solve_graph(constraint_graph_t graph) argument
4884 remove_preds_and_fake_succs(constraint_graph_t graph) argument
[all...]
H A Dcfgloopanal.c53 /* Structure representing edge of a graph. */
63 /* Structure representing vertex of a graph. */
74 /* Structure representing a graph. */
76 struct graph struct
83 /* Dumps graph G into F. */
85 extern void dump_graph (FILE *, struct graph *);
88 dump_graph (FILE *f, struct graph *g)
111 /* Creates a new graph with N_VERTICES vertices. */
113 static struct graph *
116 struct graph *
[all...]
/freebsd-9.3-release/contrib/libstdc++/config/os/generic/
H A Dctype_base.h54 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/solaris/solaris2.5/
H A Dctype_base.h54 static const mask graph = 020 | 01 | 02 | 04; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/bsd/darwin/
H A Dctype_base.h56 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; member in struct:ctype_base
69 static const mask graph = _A | _D | _P; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/bsd/freebsd/
H A Dctype_base.h59 static const mask graph = _CTYPE_A | _CTYPE_D | _CTYPE_P; member in class:ctype_base
72 static const mask graph = _A | _D | _P; member in class:ctype_base
/freebsd-9.3-release/usr.bin/tsort/
H A Dtsort.c85 NODE *n_next; /* next node in graph */
100 NODE *graph, **cycle_buf, **longest_cycle; variable
155 /* parse input and build the graph */
197 * add an arc from node s1 to node s2 in the graph. If s1 or s2 are not in
198 * the graph, then add them.
234 /* Find a node in the graph (insert if not found) and return a pointer to it. */
270 if ((n->n_next = graph) != NULL)
271 graph->n_prevp = &n->n_next;
272 n->n_prevp = &graph;
273 graph
[all...]
/freebsd-9.3-release/contrib/libstdc++/config/os/aix/
H A Dctype_base.h54 static const mask graph = _ISALPHA | _ISDIGIT | _ISPUNCT; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/bsd/netbsd/
H A Dctype_base.h57 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/djgpp/
H A Dctype_base.h56 static const mask graph = __dj_ISALPHA | __dj_ISDIGIT | __dj_ISPUNCT; // Graphical member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/gnu-linux/
H A Dctype_base.h60 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/hpux/
H A Dctype_base.h54 static const mask graph = _ISALPHA | _ISDIGIT | _ISPUNCT; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/irix/irix5.2/
H A Dctype_base.h54 static const mask graph = _U | _L | _N | _P; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/irix/irix6.5/
H A Dctype_base.h54 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/mingw32/
H A Dctype_base.h54 static const mask graph = (_PUNCT | _ALPHA | _DIGIT); member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/newlib/
H A Dctype_base.h56 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/qnx/qnx6.1/
H A Dctype_base.h54 static const mask graph = _DI | _LO | _PU | _UP | _XA; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/solaris/solaris2.6/
H A Dctype_base.h55 static const mask graph = _ISALPHA | _ISDIGIT | _ISPUNCT; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/solaris/solaris2.7/
H A Dctype_base.h56 static const mask graph = _ISALPHA | _ISDIGIT | _ISPUNCT; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/tpf/
H A Dctype_base.h54 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/uclibc/
H A Dctype_base.h62 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/vxworks/
H A Dctype_base.h55 static const mask graph = _C_UPPER | _C_LOWER | _C_NUMBER | _C_PUNCT; member in struct:ctype_base
/freebsd-9.3-release/contrib/libstdc++/config/os/windiss/
H A Dctype_base.h54 static const mask graph = _U | _L | _N | _P; member in struct:ctype_base
/freebsd-9.3-release/sys/contrib/octeon-sdk/
H A Dcvmx-dfa.h87 * Which type of memory encoding is this graph using. Make sure you setup
379 cvmx_dfa_graph_type_t type : 1; /**< Type of graph */
452 * Abstract DFA graph
457 cvmx_dfa_graph_type_t type; /**< Type of graph */
458 uint64_t base_address; /**< LLM start address of the graph */
469 uint64_t start_node_id : 20; /**< Start node index for the root of the graph */
471 uint32_t start_node; /**< Start node index for the root of the graph, incl. snrepl (PASS3/CN58XX)
477 int num_terminal_nodes; /**< Number of terminal nodes in the graph. Only needed for small graphs. */
478 int num_marked_nodes; /**< Number of marked nodes in the graph. Only needed for small graphs. */
527 * @param graph Grap
537 cvmx_dfa_write_edge_sm(const cvmx_dfa_graph_t *graph, uint64_t source_node, uint64_t match_index, uint64_t destination_node0, uint64_t destination_node1) argument
583 cvmx_dfa_write_node_lg(const cvmx_dfa_graph_t *graph, uint64_t source_node, unsigned char match, uint64_t destination_node, cvmx_dfa_node_type_t destination_type) argument
714 cvmx_dfa_submit(const cvmx_dfa_graph_t *graph, int start_node, void *input, int input_length, int use_gather, int is_little_endian, cvmx_dfa_result0_t *result, int max_results, cvmx_wqe_t *work) argument
[all...]

Completed in 105 milliseconds

12