| /freebsd-10-stable/contrib/gcc/ |
| D | cfghooks.h | 43 edge (*redirect_edge_and_branch) (edge e, basic_block b);
48 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
67 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
81 basic_block (*split_edge) (edge);
82 void (*make_forwarder_block) (edge);
85 void (*tidy_fallthru_edge) (edge);
106 void (*execute_on_growing_pred) (edge);
110 void (*execute_on_shrinking_pred) (edge);
114 bool (*cfg_hook_duplicate_loop_to_header_edge) (struct loop *loop, edge e,
118 edge orig, edge *to_remove,
[all …]
|
| D | ipa-inline.c | 196 cgraph_mark_inline (struct cgraph_edge *edge) in cgraph_mark_inline() argument
198 struct cgraph_node *to = edge->caller; in cgraph_mark_inline()
199 struct cgraph_node *what = edge->callee; in cgraph_mark_inline()
211 if (e == edge) in cgraph_mark_inline()
212 edge = next; in cgraph_mark_inline()
217 return edge; in cgraph_mark_inline()
363 cgraph_maybe_hot_edge_p (struct cgraph_edge *edge) in cgraph_maybe_hot_edge_p() argument
366 && (edge->count in cgraph_maybe_hot_edge_p()
384 cgraph_edge_badness (struct cgraph_edge *edge) in cgraph_edge_badness() argument
389 cgraph_estimate_size_after_inlining (1, edge->caller, edge->callee); in cgraph_edge_badness()
[all …]
|
| D | tree-ssa-threadupdate.c | 99 edge e;
119 edge outgoing_edge;
152 DEF_VEC_ALLOC_P(edge,heap);
153 static VEC(edge,heap) *threaded_edges; in VEC() argument
174 edge e; in remove_ctrl_stmt_and_useless_edges()
227 edge e = ((struct redirection_data *)p)->outgoing_edge; in redirection_data_hash()
234 edge e1 = ((struct redirection_data *)p1)->outgoing_edge; in redirection_data_eq()
235 edge e2 = ((struct redirection_data *)p2)->outgoing_edge; in redirection_data_eq()
247 lookup_redirection_data (edge e, edge incoming_edge, enum insert_option insert) in lookup_redirection_data()
314 edge e = make_edge (rd->dup_block, rd->outgoing_edge->dest, EDGE_FALLTHRU); in create_edge_and_update_destination_phis()
[all …]
|
| D | cfgloop.h | 123 edge single_exit;
205 extern bool loop_exit_edge_p (const struct loop *, edge);
212 extern edge *get_loop_exit_edges (const struct loop *, unsigned *);
215 extern edge loop_preheader_edge (const struct loop *);
216 extern edge loop_latch_edge (const struct loop *);
223 extern basic_block loop_split_edge_with (edge, rtx);
253 extern bool duplicate_loop_to_header_edge (struct loop *, edge, struct loops *,
254 unsigned, sbitmap, edge, edge *,
256 extern struct loop *loopify (struct loops *, edge, edge,
257 basic_block, edge, edge, bool);
[all …]
|
| D | basic-block.h | 146 typedef struct edge_def *edge; typedef
147 DEF_VEC_P(edge);
148 DEF_VEC_ALLOC_P(edge,gc);
220 VEC(edge,gc) *preds;
221 VEC(edge,gc) *succs;
488 extern void insert_insn_on_edge (rtx, edge);
497 extern edge unchecked_make_edge (basic_block, basic_block, int);
498 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int);
499 extern edge make_edge (basic_block, basic_block, int);
500 extern edge make_single_succ_edge (basic_block, basic_block, int);
[all …]
|
| D | cgraph.c | 380 struct cgraph_edge *edge = GGC_NEW (struct cgraph_edge); in cgraph_create_edge() local
391 edge->inline_failed = N_("function body not available"); in cgraph_create_edge()
393 edge->inline_failed = N_("redefined extern inline functions are not " in cgraph_create_edge()
396 edge->inline_failed = N_("function not considered for inlining"); in cgraph_create_edge()
398 edge->inline_failed = N_("function not inlinable"); in cgraph_create_edge()
400 edge->aux = NULL; in cgraph_create_edge()
402 edge->caller = caller; in cgraph_create_edge()
403 edge->callee = callee; in cgraph_create_edge()
404 edge->call_stmt = call_stmt; in cgraph_create_edge()
405 edge->prev_caller = NULL; in cgraph_create_edge()
[all …]
|
| D | cfg.c | 75 static void free_edge (edge);
99 free_edge (edge e ATTRIBUTE_UNUSED) in free_edge()
111 edge e; in clear_edges()
118 VEC_truncate (edge, bb->succs, 0); in clear_edges()
119 VEC_truncate (edge, bb->preds, 0); in clear_edges()
124 VEC_truncate (edge, EXIT_BLOCK_PTR->preds, 0); in clear_edges()
125 VEC_truncate (edge, ENTRY_BLOCK_PTR->succs, 0); in clear_edges()
204 connect_src (edge e) in connect_src()
206 VEC_safe_push (edge, gc, e->src->succs, e); in connect_src()
212 connect_dest (edge e) in connect_dest()
[all …]
|
| D | cfghooks.c | 108 edge e; in verify_flow_info()
201 edge e; in verify_flow_info()
238 edge e; in dump_bb()
282 edge
283 redirect_edge_and_branch (edge e, basic_block dest) in redirect_edge_and_branch()
285 edge ret; in redirect_edge_and_branch()
301 redirect_edge_and_branch_force (edge e, basic_block dest) in redirect_edge_and_branch_force()
318 edge
345 edge
396 split_edge (edge e) in split_edge()
[all …]
|
| D | tree-flow.h | 37 typedef struct edge_def *edge; typedef
364 edge ep_edge;
589 extern edge find_taken_edge (basic_block, tree);
592 extern void bsi_insert_on_edge (edge, tree);
593 extern basic_block bsi_insert_on_edge_immediate (edge, tree);
594 extern void bsi_commit_one_edge_insert (edge, basic_block *);
600 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
601 extern bool tree_duplicate_sese_region (edge, edge, basic_block *, unsigned,
657 extern void add_phi_arg (tree, tree, edge);
658 extern void remove_phi_args (edge);
[all …]
|
| D | tracer.c | 55 static bool better_p (edge, edge);
56 static edge find_best_successor (basic_block);
57 static edge find_best_predecessor (basic_block);
100 better_p (edge e1, edge e2) in better_p()
117 static edge
120 edge e; in find_best_successor()
121 edge best = NULL; in find_best_successor()
136 static edge
139 edge e; in find_best_predecessor()
140 edge best = NULL; in find_best_predecessor()
[all …]
|
| D | ipa.c | 36 struct cgraph_edge *edge, last; in cgraph_postorder() local
59 edge = node2->aux; in cgraph_postorder()
60 if (edge->next_caller) in cgraph_postorder()
61 node2->aux = edge->next_caller; in cgraph_postorder()
64 if (!edge->caller->aux) in cgraph_postorder()
66 if (!edge->caller->callers) in cgraph_postorder()
67 edge->caller->aux = &last; in cgraph_postorder()
69 edge->caller->aux = edge->caller->callers; in cgraph_postorder()
71 node2 = edge->caller; in cgraph_postorder()
|
| D | tree-ssa-phiopt.c | 40 edge, edge, tree, tree, tree);
42 edge, edge, tree, tree, tree);
44 edge, edge, tree, tree, tree);
46 edge, edge, tree, tree, tree);
47 static void replace_phi_edge_with_variable (basic_block, edge, tree, tree);
159 edge e1, e2; in tree_ssa_phiopt()
192 edge e_tmp = e1; in tree_ssa_phiopt()
325 edge e, tree phi, tree new) in replace_phi_edge_with_variable()
375 edge e0, edge e1, tree phi, in conditional_replacement()
382 edge true_edge, false_edge; in conditional_replacement()
[all …]
|
| D | cfgloopanal.c | 55 struct edge struct
58 struct edge *pred_next, *succ_next; argument
67 struct edge *pred, *succ;
91 struct edge *e; in dump_graph()
129 struct edge *e = xmalloc (sizeof (struct edge)); in add_edge()
150 struct edge *e; in dfs()
151 struct edge **stack = xmalloc (sizeof (struct edge *) * g->n_vertices); in dfs()
208 check_irred (struct graph *g, struct edge *e) in check_irred()
210 edge real = e->data; in check_irred()
228 void (callback) (struct graph *, struct edge *)) in for_each_edge() argument
[all …]
|
| D | bb-reorder.c | 170 static basic_block rotate_loop (edge, struct trace *, int);
174 static basic_block copy_bb (basic_block, edge, basic_block, int);
176 static bool better_edge_p (basic_block, edge, int, int, int, int, edge);
181 static void find_rarely_executed_basic_blocks_and_crossing_edges (edge *,
184 static void add_labels_and_missing_jumps (edge *, int);
187 static void fix_edges_for_rarely_executed_code (edge *, int);
228 edge e; in find_traces()
292 rotate_loop (edge back_edge, struct trace *trace, int trace_n) in rotate_loop()
298 edge best_edge = NULL; in rotate_loop()
309 edge e; in rotate_loop()
[all …]
|
| D | cfgloopmanip.c | 37 static void loop_redirect_edge (edge, basic_block);
38 static bool loop_delete_branch_edge (edge, int);
41 static int find_path (edge, basic_block **);
82 find_path (edge e, basic_block **bbs) in find_path()
102 edge e; in fix_bb_placement()
147 edge e; in fix_bb_placements()
246 remove_path (struct loops *loops, edge e) in remove_path()
248 edge ae; in remove_path()
411 loopify (struct loops *loops, edge latch_edge, edge header_edge, in loopify()
412 basic_block switch_bb, edge true_edge, edge false_edge, in loopify()
[all …]
|
| D | tree-vectorizer.c | 153 (struct loop *, struct loops *, edge);
157 (edge, struct loop *, bool, basic_block *, bitmap *);
159 (edge, struct loop *, bool, basic_block *);
160 static edge slpeel_add_loop_guard (basic_block, tree, basic_block, basic_block);
226 edge e; in rename_variables_in_bb()
279 edge orig_loop_latch = loop_latch_edge (orig_loop); in slpeel_update_phis_for_duplicate_loop()
280 edge orig_entry_e = loop_preheader_edge (orig_loop); in slpeel_update_phis_for_duplicate_loop()
281 edge new_loop_exit_e = new_loop->single_exit; in slpeel_update_phis_for_duplicate_loop()
282 edge new_loop_entry_e = loop_preheader_edge (new_loop); in slpeel_update_phis_for_duplicate_loop()
283 edge entry_arg_e = (after ? orig_loop_latch : orig_entry_e); in slpeel_update_phis_for_duplicate_loop()
[all …]
|
| D | cfgrtl.c | 66 static void commit_one_edge_insertion (edge, int);
67 static basic_block rtl_split_edge (edge);
71 static edge cfg_layout_redirect_edge_and_branch (edge, basic_block);
72 static basic_block cfg_layout_redirect_edge_and_branch_force (edge, basic_block);
75 static basic_block rtl_redirect_edge_and_branch_force (edge, basic_block);
76 static edge rtl_redirect_edge_and_branch (edge, basic_block);
80 static void rtl_make_forwarder_block (edge);
451 edge e = ei_safe_edge (ei); in emit_insn_at_entry()
482 edge e; in rtl_split_block()
689 edge
[all …]
|
| D | tree-cfgcleanup.c | 54 remove_fallthru_edge (VEC(edge,gc) *ev) in remove_fallthru_edge() argument
57 edge e; in remove_fallthru_edge()
74 edge taken_edge; in cleanup_control_expr_graph()
80 edge e; in cleanup_control_expr_graph()
200 edge e;
263 edge e, succ; in tree_forwarder_block_p()
340 edge e; in has_abnormal_incoming_edge_p()
355 phi_alternatives_equal (basic_block dest, edge e1, edge e2) in phi_alternatives_equal()
383 edge succ = single_succ_edge (bb), e, s; in remove_forwarder_block()
634 edge succ = single_succ_edge (bb); in remove_forwarder_block_with_phi()
[all …]
|
| D | ipa-utils.c | 88 struct cgraph_edge *edge; in searchc() local
101 for (edge = v->callees; edge; edge = edge->next_callee) in searchc()
104 struct cgraph_node *w = edge->callee; in searchc()
|
| D | tree-cfg.c | 74 edge e;
106 static edge tree_redirect_edge_and_branch (edge, basic_block);
107 static edge tree_try_redirect_by_replacing_jump (edge, basic_block);
113 static void tree_make_forwarder_block (edge);
121 static edge find_taken_edge_computed_goto (basic_block, tree);
122 static edge find_taken_edge_cond_expr (basic_block, tree);
123 static edge find_taken_edge_switch_expr (basic_block, tree);
615 edge e; in make_cond_expr_edges()
648 edge e = ((struct edge_to_cases_elt *)p)->e; in edge_to_cases_hash()
660 edge e1 = ((struct edge_to_cases_elt *)p1)->e; in edge_to_cases_eq()
[all …]
|
| D | cfganal.c | 109 edge e; in can_fallthru()
135 edge e; in could_fall_through()
248 edge e; in set_edge_can_fallthru_flag()
281 edge e; in find_unreachable_blocks()
342 edge e; in create_edge_list()
362 elist->index_to_edge = XNEWVEC (edge, num_edges); in create_edge_list()
419 edge e; in verify_edge_list()
481 edge
484 edge e; in find_edge()
539 flow_edge_list_print (const char *str, const edge *edge_list, int num_edges, FILE *file) in flow_edge_list_print()
[all …]
|
| D | profile.c | 141 edge e; in instrument_edges()
238 edge e; in get_exec_counts()
296 edge e; in compute_branch_probabilities()
319 edge e; in compute_branch_probabilities()
384 edge e; in compute_branch_probabilities()
396 edge e; in compute_branch_probabilities()
411 edge e; in compute_branch_probabilities()
438 edge e; in compute_branch_probabilities()
490 edge e; in compute_branch_probabilities()
531 edge e; in compute_branch_probabilities()
[all …]
|
| D | tree-ssa-loop-ivcanon.c | 73 create_canonical_iv (struct loop *loop, edge exit, tree niter) in create_canonical_iv()
75 edge in; in create_canonical_iv()
164 edge exit, tree niter, in try_unroll_loop_completely()
227 edge *edges_to_remove = XNEWVEC (edge, n_unroll); in try_unroll_loop_completely()
280 edge exit = NULL; in canonicalize_loop_induction_variables()
401 edge exit; in empty_loop_p()
496 edge exit = single_dom_exit (loop), non_exit; in remove_empty_loop()
|
| /freebsd-10-stable/contrib/ldns/ |
| D | radix.c | 212 prefix->array[0].edge = add; in ldns_radix_insert()
268 prefix->array[byte].edge = add; in ldns_radix_insert()
269 } else if (prefix->array[byte-prefix->offset].edge == NULL) { in ldns_radix_insert()
291 prefix->array[byte].edge = add; in ldns_radix_insert()
368 node = node->array[byte].edge; in ldns_radix_search()
417 if (!node->array[byte].edge) { in ldns_radix_find_less_equal()
436 node->array[byte].edge); in ldns_radix_find_less_equal()
439 *result = ldns_radix_last_in_subtree_incl_self(node->array[byte].edge); in ldns_radix_find_less_equal()
441 *result = ldns_radix_prev(node->array[byte].edge); in ldns_radix_find_less_equal()
450 node->array[byte].edge); in ldns_radix_find_less_equal()
[all …]
|
| /freebsd-10-stable/contrib/gcc/doc/ |
| D | cfg.texi | 108 Before any edge is made @dfn{fall-thru}, the existence of such
140 @cindex edge in the flow graph
141 @findex edge
145 in GCC with the @code{edge} data type. Each @code{edge} acts as a
146 link between two basic blocks: the @code{src} member of an edge
152 @cindex edge iterators
153 When walking the edges in an edge vector, @dfn{edge iterators} should
161 first edge in a vector of edges.
165 last edge in a vector of edges.
169 the last edge in an edge vector.
[all …]
|