Home
last modified time | relevance | path

Searched refs:edges (Results 1 – 25 of 52) sorted by relevance

123

/dragonfly/sys/net/ipfw3_basic/
H A Dip_fw3_sync.c115 bcopy(fw3_sync_ctx.edges, tmp_sync_ctx->edges, in ip_fw3_ctl_sync_show_conf()
145 fw3_sync_ctx.edges = kmalloc(size, M_IPFW3_SYNC, M_NOWAIT | M_ZERO); in ip_fw3_ctl_sync_centre_conf()
147 fw3_sync_ctx.edges = krealloc(fw3_sync_ctx.edges, in ip_fw3_ctl_sync_centre_conf()
151 bcopy(ioc_centre->edges, fw3_sync_ctx.edges, in ip_fw3_ctl_sync_centre_conf()
287 edge = fw3_sync_ctx.edges; in ip_fw3_ctl_sync_centre_start()
477 if (fw3_sync_ctx.edges != NULL) { in ip_fw3_sync_modevent()
478 kfree(fw3_sync_ctx.edges, M_IPFW3_SYNC); in ip_fw3_sync_modevent()
H A Dip_fw3_sync.h56 struct ipfw3_sync_edge edges[0]; /* edge */ member
61 struct ipfw3_sync_edge edges[0]; /* edge */ member
74 struct ipfw3_sync_edge *edges; /* edge */ member
/dragonfly/contrib/gcc-8.0/gcc/
H A Dcfg-flags.def1 /* Flags on basic blocks and edges.
21 edges. Source files define DEF_BASIC_BLOCK_FLAG or DEF_EDGE_FLAG
109 edges are fallthru edges. In cfgrtl mode, this flag really means
119 ABNORMAL_CALL edges also have ABNORMAL set.
123 /* Exception edge. Exception handling edges represent possible control
125 EH edges also have ABNORMAL set for the RTL CFG. */
129 to prevent merging away edges to the post-landing-pad basic block.
138 /* A back edge, marked in a depth-first search of the CFG. Back edges
162 SIBCALL edges also have ABNORMAL set.
H A Dbb-reorder.c1568 FOR_EACH_EDGE (e, ei, edges) in sanitize_hot_paths()
1603 FOR_EACH_EDGE (e, ei, edges) in sanitize_hot_paths()
2395 edges[n++] = EDGE_SUCC (bb, 0); in reorder_basic_blocks_simple()
2404 edges[n++] = e0; in reorder_basic_blocks_simple()
2405 edges[n++] = e1; in reorder_basic_blocks_simple()
2413 std::stable_sort (edges, edges + n, edge_order); in reorder_basic_blocks_simple()
2437 edge e = edges[j]; in reorder_basic_blocks_simple()
2456 edges[j] = 0; in reorder_basic_blocks_simple()
2506 if (edges[j]) in reorder_basic_blocks_simple()
2507 edges[j]->src->aux = edges[j]->dest; in reorder_basic_blocks_simple()
[all …]
H A Dtree-call-cdce.c853 auto_vec<edge_pair, 8> edges; in shrink_wrap_one_built_in_call_with_conds() local
863 edges.reserve (nconds); in shrink_wrap_one_built_in_call_with_conds()
864 edges.quick_push (edge_pair (bi_call_in_edge0, join_tgt_in_edge_fall_thru)); in shrink_wrap_one_built_in_call_with_conds()
890 edges.quick_push (edge_pair (bi_call_in_edge, guard_bb_in_edge)); in shrink_wrap_one_built_in_call_with_conds()
909 while (!edges.is_empty ()) in shrink_wrap_one_built_in_call_with_conds()
911 edge_pair e = edges.pop (); in shrink_wrap_one_built_in_call_with_conds()
H A Dprofile.h69 extern gcov_type sum_edge_counts (vec<edge, va_gc> *edges);
H A Dira-build.c132 vec<edge> edges; in create_loop_tree_nodes() local
177 edges = get_loop_exit_edges (loop); in create_loop_tree_nodes()
178 FOR_EACH_VEC_ELT (edges, j, e) in create_loop_tree_nodes()
184 edges.release (); in create_loop_tree_nodes()
1970 vec<edge> edges; in create_loop_tree_node_allocnos() local
1978 FOR_EACH_VEC_ELT (edges, i, e) in create_loop_tree_node_allocnos()
1980 edges.release (); in create_loop_tree_node_allocnos()
2171 vec<edge> edges; in loop_with_complex_edge_p() local
2177 edges = get_loop_exit_edges (loop); in loop_with_complex_edge_p()
2179 FOR_EACH_VEC_ELT (edges, i, e) in loop_with_complex_edge_p()
[all …]
H A Dbasic-block.h551 find_fallthru_edge (vec<edge, va_gc> *edges) in find_fallthru_edge() argument
556 FOR_EACH_EDGE (e, ei, edges) in find_fallthru_edge()
H A Dcfghooks.c1334 edge *edges, unsigned num_edges, edge *new_edges, in copy_bbs() argument
1394 if (edges[j] && edges[j]->src == bb && edges[j]->dest == e->dest) in copy_bbs()
H A Dsel-sched-ir.h1073 vec<edge> edges = vNULL; in get_loop_exit_edges_unique_dests() local
1085 for (i = 0; edges.iterate (i, &e); i++) in get_loop_exit_edges_unique_dests()
1093 edges.safe_push (exit->e); in get_loop_exit_edges_unique_dests()
1095 return edges; in get_loop_exit_edges_unique_dests()
H A Dcfgloop.c1195 vec<edge> edges = vNULL; in get_loop_exit_edges() local
1209 edges.safe_push (exit->e); in get_loop_exit_edges()
1218 edges.safe_push (e); in get_loop_exit_edges()
1223 return edges; in get_loop_exit_edges()
H A Dloop-unroll.c1583 vec<edge> edges = get_loop_exit_edges (loop); in analyze_insns_in_loop() local
1602 if (edges.length () == 1) in analyze_insns_in_loop()
1604 exit = edges[0]; in analyze_insns_in_loop()
1659 edges.release (); in analyze_insns_in_loop()
H A Dgcov.c628 handle_cycle (const arc_vector_t &edges, int64_t &count) in handle_cycle() argument
633 for (unsigned i = 0; i < edges.size (); i++) in handle_cycle()
635 int64_t ecount = edges[i]->cs_count; in handle_cycle()
640 for (unsigned i = 0; i < edges.size (); i++) in handle_cycle()
641 edges[i]->cs_count -= cycle_count; in handle_cycle()
/dragonfly/contrib/gcc-4.7/gcc/doc/
H A Dcfg.texi20 represent basic blocks and edges represent possible transfer of
27 * Edges:: Types of edges and their representation.
150 type point to type-safe vectors of edges to the predecessors and
162 first edge in a vector of edges.
166 last edge in a vector of edges.
198 the edges in a sequence of predecessor or successor edges. It must
220 several other reasons why edges may be created. The @code{flags}
237 edges must come into the basic block immediately following in the
251 edges have the @code{EDGE_ABNORMAL} and @code{EDGE_EH} flags set.
279 These edges only exist in the RTL representation.
[all …]
H A Dloop.texi46 several back edges (latches) leading to the header from the inside of
60 correctly for loops with multiple latch edges (the functions that only
65 and reachable from its latch against the direction of edges in CFG@. The
108 loops with multiple latch edges will not be disambiguated. If a loop
126 edges in the strongly connected components that are not natural loops
129 flag is not set for blocks and edges that belong to natural loops that
131 edges of such a loop, if they lead to/from this region).
198 @item @code{mark_loop_exit_edges}: Marks all exit edges of all loops
207 @item @code{get_loop_exit_edges}: Enumerates the exit edges of a loop.
248 one of the edges entering loop header, thus performing either loop
[all …]
/dragonfly/contrib/gcc-4.7/gcc/
H A Dprofile.h45 extern gcov_type sum_edge_counts (VEC (edge, gc) *edges);
H A Dira-build.c128 VEC (edge, heap) *edges; in create_loop_tree_nodes()
170 edges = get_loop_exit_edges (loop); in create_loop_tree_nodes()
171 FOR_EACH_VEC_ELT (edge, edges, j, e) in create_loop_tree_nodes()
177 VEC_free (edge, heap, edges); in create_loop_tree_nodes()
1648 VEC (edge, heap) *edges; in create_loop_tree_node_allocnos()
1656 FOR_EACH_VEC_ELT (edge, edges, i, e) in create_loop_tree_node_allocnos()
1658 VEC_free (edge, heap, edges); in create_loop_tree_node_allocnos()
1845 VEC (edge, heap) *edges; in loop_with_complex_edge_p()
1851 edges = get_loop_exit_edges (loop); in loop_with_complex_edge_p()
1853 FOR_EACH_VEC_ELT (edge, edges, i, e) in loop_with_complex_edge_p()
[all …]
H A Dcfglayout.c1436 edge *edges, unsigned num_edges, edge *new_edges, in copy_bbs() argument
1485 if (edges[j] && edges[j]->src == bb && edges[j]->dest == e->dest) in copy_bbs()
H A Dsel-sched-ir.h1064 VEC (edge, heap) *edges = NULL; in VEC()
1076 for (i = 0; VEC_iterate (edge, edges, i, e); i++) in VEC()
1084 VEC_safe_push (edge, heap, edges, exit->e); in VEC()
1086 return edges; in VEC()
H A Dcfgloop.c1128 VEC (edge, heap) *edges = NULL; in VEC()
1142 VEC_safe_push (edge, heap, edges, exit->e); in VEC()
1151 VEC_safe_push (edge, heap, edges, e); in VEC()
1156 return edges; in VEC()
H A Dloop-unroll.c1821 VEC (edge, heap) *edges = get_loop_exit_edges (loop); in analyze_insns_in_loop()
1840 if (VEC_length (edge, edges) == 1) in analyze_insns_in_loop()
1842 exit = VEC_index (edge, edges, 0); in analyze_insns_in_loop()
1898 VEC_free (edge, heap, edges); in analyze_insns_in_loop()
H A Dtree-ssa-uninit.c479 VEC(edge, heap) **edges, in collect_phi_def_edges()
502 VEC_safe_push (edge, heap, *edges, opnd_edge); in collect_phi_def_edges()
511 collect_phi_def_edges (def, cd_root, edges, in collect_phi_def_edges()
520 VEC_safe_push (edge, heap, *edges, opnd_edge); in collect_phi_def_edges()
H A Dbasic-block.h933 find_fallthru_edge (VEC(edge,gc) *edges) in find_fallthru_edge() argument
938 FOR_EACH_EDGE (e, ei, edges) in find_fallthru_edge()
/dragonfly/sbin/ipfw3/
H A Dipfw3sync.c125 edge = centre->edges; in sync_config_centre()
194 edge = sync_ctx->edges; in sync_show_config()
/dragonfly/contrib/libpcap/
H A Doptimize.c263 struct edge **edges; member
1761 target = fold_edge(ep->succ, opt_state->edges[k]); in opt_j()
2402 free((void *)opt_state->edges); in opt_cleanup()
2549 opt_state->edges = (struct edge **)calloc(opt_state->n_edges, sizeof(*opt_state->edges)); in opt_init()
2550 if (opt_state->edges == NULL) { in opt_init()
2641 opt_state->edges[i] = &b->et; in opt_init()
2643 opt_state->edges[opt_state->n_blocks + i] = &b->ef; in opt_init()

123