| /openbsd-src/gnu/gcc/gcc/ |
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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()
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| /openbsd-src/usr.sbin/unbound/edns-subnet/ |
| H A D | addrtree.c | 59 struct addredge *edge = (struct addredge *)malloc( sizeof (*edge) ); in edge_create() local
60 if (!edge) in edge_create()
62 edge->node = node; in edge_create()
63 edge->len = addrlen; in edge_create()
64 edge->parent_index = parent_index; in edge_create()
65 edge->parent_node = parent_node; in edge_create()
68 edge->str = (addrkey_t *)calloc(n, sizeof (addrkey_t)); in edge_create()
69 if (!edge->str) { in edge_create()
70 free(edge); in edge_create()
73 memcpy(edge->str, addr, n * sizeof (addrkey_t)); in edge_create()
[all …]
|
| /openbsd-src/usr.sbin/unbound/testcode/ |
| H A D | unitecs.c | 97 struct addredge* edge; in addrtree_inconsistent_subtree() local
101 childcount = (node->edge[0] != NULL) + (node->edge[1] != NULL); in addrtree_inconsistent_subtree()
105 edge = node->edge[i]; in addrtree_inconsistent_subtree()
106 if (!edge) continue; in addrtree_inconsistent_subtree()
107 if (!edge->node) return 11; in addrtree_inconsistent_subtree()
108 if (!edge->str) return 12; in addrtree_inconsistent_subtree()
109 if (edge->len <= parent_edge->len) return 13; in addrtree_inconsistent_subtree()
111 parent_edge->len, edge->str, edge->len, 0)) in addrtree_inconsistent_subtree()
113 if ((r = addrtree_inconsistent_subtree(tree, edge, depth+1)) != 0) in addrtree_inconsistent_subtree()
121 struct addredge* edge; in addrtree_inconsistent() local
[all …]
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/ |
| H A D | cfg.c | 78 edge first_deleted_edge;
132 static void free_edge PARAMS ((edge));
163 edge e; in free_edge()
177 edge e; in clear_edges()
181 edge e = bb->succ; in clear_edges()
185 edge next = e->succ_next; in clear_edges()
198 edge next = e->succ_next; in clear_edges()
287 b->succ = (edge) first_deleted_block;
295 edge
300 edge e;
[all …]
|
| H A D | basic-block.h | 137 } *edge; typedef
188 edge pred, succ;
326 extern edge split_block PARAMS ((basic_block, rtx));
327 extern basic_block split_edge PARAMS ((edge));
328 extern void insert_insn_on_edge PARAMS ((rtx, edge));
337 extern edge cached_make_edge PARAMS ((sbitmap *, basic_block,
339 extern edge unchecked_make_edge PARAMS ((basic_block,
341 extern edge make_edge PARAMS ((basic_block,
343 extern edge make_single_succ_edge PARAMS ((basic_block,
345 extern void remove_edge PARAMS ((edge));
[all …]
|
| H A D | tracer.c | 51 static bool better_p PARAMS ((edge, edge));
52 static edge find_best_successor PARAMS ((basic_block));
53 static edge find_best_predecessor PARAMS ((basic_block));
98 edge e1, e2; in better_p()
115 static edge
119 edge e;
120 edge best = NULL;
134 static edge
138 edge e;
139 edge best = NULL;
[all …]
|
| H A D | cfganal.c | 136 edge *stack; in mark_dfs_back_edges()
150 stack = (edge *) xmalloc ((n_basic_blocks + 1) * sizeof (edge)); in mark_dfs_back_edges()
164 edge e; in mark_dfs_back_edges()
224 edge e; in set_edge_can_fallthru_flag()
323 edge e;
356 edge e;
408 edge e; in find_unreachable_blocks()
465 edge e; in create_edge_list()
485 elist->index_to_edge = (edge *) xmalloc (sizeof (edge) * num_edges); in create_edge_list()
547 edge e;
[all …]
|
| H A D | cfgloop.c | 43 edge, int));
46 static void redirect_edge_with_latch_update PARAMS ((edge, basic_block));
64 edge succ;
243 edge e;
256 loop->entry_edges = (edge *) xmalloc (num_entries * sizeof (edge *));
274 edge e;
304 loop->exit_edges = (edge *) xmalloc (num_exits * sizeof (edge *));
352 edge e;
384 edge e;
401 loop->pre_header_edges = (edge *) xmalloc (num * sizeof (edge));
[all …]
|
| H A D | ssa-ccp.c | 106 static edge *edge_info;
115 static edge flow_edges;
256 edge curredge;
332 edge curredge;
356 edge curredge;
653 edge succ_edge = succ_block->succ; in examine_flow_edges()
748 edge edge = INDEX_EDGE (edges, i); local
750 if (edge->flags & EDGE_ABNORMAL)
755 if (edge->dest != EXIT_BLOCK_PTR)
757 rtx insn = first_insn_after_basic_block_note (edge->dest);
[all …]
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.mike/ |
| H A D | align1.C | 18 class edge : public virtual eel_edge {
20 edge() { in edge() function
26 class eel_branch_edge : public virtual edge {
34 class interproc_edge : public virtual edge {
37 class eel_jump_edge : public virtual edge {
|