| /dragonfly/contrib/gcc-8.0/gcc/ |
| H A D | cfghooks.h | 77 edge (*redirect_edge_and_branch) (edge e, basic_block b);
157 edge, vec<edge> *,
166 basic_block, edge);
170 void (*extract_cond_bb_edges) (basic_block, edge *, edge *);
205 extern edge redirect_edge_and_branch (edge, basic_block);
207 extern edge redirect_edge_succ_nodup (edge, basic_block);
222 extern edge make_forwarder_block (basic_block, bool (*)(edge),
241 edge orig,
246 extern void extract_cond_bb_edges (basic_block, edge *, edge*);
248 edge);
[all …]
|
| H A D | ipa-inline.h | 70 estimate_edge_size (struct cgraph_edge *edge) in estimate_edge_size() argument
75 return do_estimate_edge_size (edge); in estimate_edge_size()
82 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth() argument
85 || !edge->callee->analyzed); in estimate_edge_growth()
86 return (estimate_edge_size (edge) in estimate_edge_growth()
98 || !edge_growth_cache[edge->uid].size)
99 return do_estimate_edge_time (edge);
102 return edge_growth_cache[edge->uid].time;
110 estimate_edge_hints (struct cgraph_edge *edge) in estimate_edge_hints() argument
115 return do_estimate_edge_hints (edge); in estimate_edge_hints()
[all …]
|
| H A D | ipa-inline.c | 1274 edge->aux = heap->insert (badness, edge); in update_edge_key()
1295 for (edge = where->callers; edge; edge = edge->next_caller) in reset_edge_caches()
1353 for (edge = node->callers; edge; edge = edge->next_caller) in update_caller_keys()
1616 edge->aux = heap->insert (edge_badness (edge, false), edge); in add_new_edges_to_heap()
1802 for (edge = node->callers; edge; edge = edge->next_caller) in inline_small_functions()
1831 for (edge = node->callees; edge; edge = next) in inline_small_functions()
1848 for (edge = node->callees; edge; edge = next) in inline_small_functions()
2548 for (edge = node->callees; edge; edge = next) in ipa_inline()
2770 for (edge = node->callees; edge; edge = edge->next_callee) in early_inliner()
2794 for (edge = node->callees; edge; edge = edge->next_callee) in early_inliner()
[all …]
|
| H A D | ipa-inline-analysis.c | 89 reset_edge_growth_cache (edge); in inline_edge_removal_hook()
126 ? edge->caller->global.inlined_to : edge->caller); in simple_edge_hints()
131 && !edge->recursive_p ()) in simple_edge_hints()
166 evaluate_properties_for_edge (edge, true, in do_estimate_edge_time()
177 if (edge->count.ipa ().initialized_p () && edge->maybe_hot_p () in do_estimate_edge_time()
181 : edge->caller->count.ipa ()))) in do_estimate_edge_time()
200 hints |= simple_edge_hints (edge); in do_estimate_edge_time()
224 do_estimate_edge_time (edge); in do_estimate_edge_size()
265 do_estimate_edge_time (edge); in do_estimate_edge_hints()
285 hints |= simple_edge_hints (edge); in do_estimate_edge_hints()
[all …]
|
| H A D | cfgloopmanip.h | 35 extern edge mfb_kj_edge;
37 extern bool remove_path (edge, bool * = NULL, bitmap = NULL);
42 extern edge create_empty_if_region_on_edge (edge, tree);
43 extern struct loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
45 extern struct loop *loopify (edge, edge,
46 basic_block, edge, edge, bool,
54 extern bool duplicate_loop_to_header_edge (struct loop *, edge,
55 unsigned, sbitmap, edge,
56 vec<edge> *, int);
57 extern bool mfb_keep_just (edge);
|
| H A D | predict.h | 58 extern bool maybe_hot_edge_p (edge);
60 extern bool probably_never_executed_edge_p (struct function *, edge);
67 extern bool optimize_edge_for_size_p (edge);
68 extern bool optimize_edge_for_speed_p (edge);
75 extern bool predictable_edge_p (edge);
77 extern void rtl_profile_for_edge (edge);
84 extern void rtl_predict_edge (edge, enum br_predictor, int);
85 extern void gimple_predict_edge (edge, enum br_predictor, int);
86 extern void remove_predictions_associated_with_edge (edge);
87 extern void predict_edge_def (edge, enum br_predictor, enum prediction);
[all …]
|
| H A D | tree-cfg.h | 45 extern edge find_taken_edge (basic_block, tree);
60 extern bool assert_unreachable_fallthru_edge_p (edge);
70 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
71 extern basic_block split_edge_bb_loc (edge);
72 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
74 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
94 extern void remove_edge_and_dominated_blocks (edge);
105 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
112 edge *, edge *);
|
| H A D | cfg.h | 87 extern edge unchecked_make_edge (basic_block, basic_block, int);
88 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int);
89 extern edge make_edge (basic_block, basic_block, int);
90 extern edge make_single_succ_edge (basic_block, basic_block, int);
91 extern void remove_edge_raw (edge);
92 extern void redirect_edge_succ (edge, basic_block);
93 extern void redirect_edge_pred (edge, basic_block);
95 extern void dump_edge_info (FILE *, edge, dump_flags_t, int);
101 extern void alloc_aux_for_edge (edge, int);
109 extern void update_bb_profile_for_threading (basic_block, profile_count, edge);
|
| H A D | tree-ssa.h | 34 extern void redirect_edge_var_map_add (edge, tree, tree, source_location);
35 extern void redirect_edge_var_map_clear (edge);
36 extern void redirect_edge_var_map_dup (edge, edge);
37 extern vec<edge_var_map> *redirect_edge_var_map_vector (edge);
39 extern edge ssa_redirect_edge (edge, basic_block);
40 extern void flush_pending_stmts (edge);
|
| H A D | cgraph.c | 905 return edge; in create_edge()
928 return edge; in create_edge()
985 return edge; in create_indirect_edge()
1166 edge->speculative_call_info (e2, edge, ref); in resolve_speculation()
1195 edge = e2; in resolve_speculation()
1210 return edge; in resolve_speculation()
1226 edge = edge->resolve_speculation (callee->decl); in make_direct()
1264 return edge; in make_direct()
2165 for (edge = callers; edge; edge = edge->next_caller) in dump()
2174 for (edge = callees; edge; edge = edge->next_callee) in dump()
[all …]
|
| H A D | cfghooks.c | 239 edge e; in verify_flow_info()
360 edge
449 edge
452 edge s; in redirect_edge_succ_nodup()
555 edge
561 edge
569 edge
637 edge f; in split_edge()
787 edge e; in merge_blocks()
862 edge
[all …]
|
| H A D | lto-cgraph.c | 264 uid = (!gimple_has_body_p (edge->caller->decl) || edge->caller->thunk.thunk_p in lto_output_edge()
265 ? edge->lto_stmt_uid : gimple_uid (edge->call_stmt) + 1); in lto_output_edge()
753 if (!edge) in output_outgoing_cgraph_edges()
759 edge = edge->next_callee; in output_outgoing_cgraph_edges()
760 for (; edge; edge = edge->prev_callee) in output_outgoing_cgraph_edges()
932 for (edge = node->callees; edge; edge = edge->next_callee) in compute_ltrans_boundary()
944 for (edge = node->indirect_calls; edge; edge = edge->next_callee) in compute_ltrans_boundary()
1828 for (edge = node->callees; edge; edge = edge->next_callee) in merge_profile_summaries()
1830 edge->count = edge->count.apply_scale (scale, REG_BR_PROB_BASE); in merge_profile_summaries()
1831 for (edge = node->indirect_calls; edge; edge = edge->next_callee) in merge_profile_summaries()
[all …]
|
| /dragonfly/contrib/gcc-4.7/gcc/ |
| H A D | cfghooks.h | 43 edge (*redirect_edge_and_branch) (edge e, basic_block b);
123 edge, VEC (edge, heap) **,
132 basic_block, edge);
136 void (*extract_cond_bb_edges) (basic_block, edge *, edge *);
146 extern edge redirect_edge_and_branch (edge, basic_block);
149 extern void remove_branch (edge);
150 extern void remove_edge (edge);
160 extern edge make_forwarder_block (basic_block, bool (*)(edge),
177 edge orig,
182 extern void extract_cond_bb_edges (basic_block, edge *, edge*);
[all …]
|
| H A D | ipa-inline.c | 718 + inline_edge_summary (edge)->call_stmt_time) * edge->frequency in relative_time_benefit()
898 if (edge->aux) in update_edge_key()
936 edge->aux = fibheap_insert (heap, badness, edge); in update_edge_key()
961 for (edge = where->callers; edge; edge = edge->next_caller) in reset_edge_caches()
1022 for (edge = node->callers; edge; edge = edge->next_caller) in update_caller_keys()
1035 edge->aux = NULL; in update_caller_keys()
1312 edge->aux = fibheap_insert (heap, edge_badness (edge, false), edge); in add_new_edges_to_heap()
1360 for (edge = node->callers; edge; edge = edge->next_caller) in inline_small_functions()
1378 for (edge = node->callers; edge; edge = edge->next_caller) in inline_small_functions()
1423 edge->aux = fibheap_insert (heap, current_badness, edge); in inline_small_functions()
[all …]
|
| H A D | basic-block.h | 64 DEF_VEC_P(edge);
135 VEC(edge,gc) *preds;
452 extern edge redirect_edge_succ_nodup (edge, basic_block);
570 static inline edge
580 static inline edge
679 static inline edge
688 static inline edge
905 edge e; in bb_has_eh_pred()
920 edge e; in bb_has_abnormal_pred()
932 static inline edge
[all …]
|
| H A D | tree-ssa-threadupdate.c | 102 edge e;
178 edge e; in remove_ctrl_stmt_and_useless_edges()
210 edge e; in create_block_for_threading()
334 edge e; in update_destination_phis()
362 e->aux = (edge *) XNEWVEC (edge, 2); in create_edge_and_update_destination_phis()
500 edge e2; in redirect_edges()
509 edge e2; in redirect_edges()
781 edge e; in determine_bb_domination_status()
1063 edge e; in mark_threaded_blocks()
1069 edge *x = (edge *) XNEWVEC (edge, 2); in mark_threaded_blocks()
[all …]
|
| H A D | ipa-inline.h | 175 void inline_merge_summary (struct cgraph_edge *edge);
177 int do_estimate_edge_time (struct cgraph_edge *edge);
197 inline_edge_summary (struct cgraph_edge *edge) in inline_edge_summary() argument
200 inline_edge_summary_vec, edge->uid); in inline_edge_summary()
222 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth() argument
228 edge->uid)->size)) in estimate_edge_growth()
229 return do_estimate_edge_growth (edge); in estimate_edge_growth()
238 estimate_edge_time (struct cgraph_edge *edge) in estimate_edge_time() argument
244 edge->uid)->time)) in estimate_edge_time()
245 return do_estimate_edge_time (edge); in estimate_edge_time()
[all …]
|
| H A D | cgraph.c | 859 if (edge) in cgraph_set_call_stmt_including_clones()
867 if (edge) in cgraph_set_call_stmt_including_clones()
917 if (edge) in cgraph_create_edge_including_clones()
1179 edge->caller->indirect_calls = edge->next_callee; in cgraph_make_edge_direct()
1183 edge->next_callee = edge->caller->callees; in cgraph_make_edge_direct()
1185 edge->caller->callees->prev_callee = edge; in cgraph_make_edge_direct()
1186 edge->caller->callees = edge; in cgraph_make_edge_direct()
1878 for (edge = node->callers; edge; edge = edge->next_caller) in dump_cgraph_node()
1897 for (edge = node->callees; edge; edge = edge->next_callee) in dump_cgraph_node()
1920 for (edge = node->indirect_calls; edge; edge = edge->next_callee) in dump_cgraph_node()
[all …]
|
| H A D | tree-flow.h | 439 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
440 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
442 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
510 extern void remove_phi_args (edge);
547 extern void redirect_edge_var_map_dup (edge, edge);
551 extern edge ssa_redirect_edge (edge, basic_block);
552 extern void flush_pending_stmts (edge);
712 edge, VEC (edge, heap) **,
719 edge single_dom_exit (struct loop *);
770 extern edge redirect_eh_edge (edge, basic_block);
[all …]
|
| H A D | cfgloop.c | 96 edge e; in VEC()
119 edge e; in flow_loop_dump()
253 edge e; in flow_loop_nodes_find()
378 edge e; in flow_loops_find()
566 edge e, latch = VEC_index (edge, latches, 0); in find_subloop_latch_edge_by_ivs()
715 edge e; in disambiguate_multiple_latches()
1059 edge e; in record_loop_exits()
1129 edge e; in VEC()
1566 edge
1573 edge
[all …]
|
| H A D | cfg.c | 117 edge e; in clear_edges()
276 edge
279 edge e; in unchecked_make_edge()
297 edge
328 edge
346 edge
392 edge
395 edge s; in redirect_edge_succ_nodup()
448 edge e; in check_bb_profile()
533 edge e; in dump_bb_info()
[all …]
|
| H A D | cfgloop.h | 221 void rescan_loop_exit (edge, bool, bool);
251 edge single_exit (const struct loop *);
255 extern edge loop_latch_edge (const struct loop *);
297 extern edge create_empty_if_region_on_edge (edge, tree);
303 unsigned, sbitmap, edge,
304 VEC (edge, heap) **, int);
305 extern struct loop *loopify (edge, edge,
306 basic_block, edge, edge, bool,
310 extern bool remove_path (edge);
362 edge out_edge;
[all …]
|
| H A D | cfghooks.c | 128 edge e; in verify_flow_info()
233 edge e; in verify_flow_info()
270 edge e; in dump_bb()
314 edge
317 edge ret; in redirect_edge_and_branch()
424 edge
428 edge res; in split_block()
468 edge
540 edge f; in split_edge()
677 edge e; in merge_blocks()
[all …]
|
| H A D | ipa-inline-analysis.c | 955 for (edge = dst->callees; edge; edge = edge->next_callee) in inline_node_duplication_hook()
987 for (edge = dst->indirect_calls; edge; edge = edge->next_callee) in inline_node_duplication_hook()
1107 for (edge = node->callees; edge; edge = edge->next_callee) in dump_inline_edge_summary()
1158 for (edge = node->indirect_calls; edge; edge = edge->next_callee) in dump_inline_edge_summary()
1427 edge e; in set_cond_stmt_execution_predicate()
1518 edge e; in set_switch_stmt_execution_predicate()
2036 edge e; in estimate_function_body_sizes()
2622 ? edge->caller->global.inlined_to : edge->caller); in inline_merge_summary()
2744 <= edge->uid) in do_estimate_edge_time()
3225 for (edge = node->callees; edge; edge = edge->next_callee) in inline_write_summary()
[all …]
|
| /dragonfly/contrib/ldns/ |
| H A D | radix.c | 450 node->array[byte].edge); in ldns_radix_find_less_equal()
610 if (node->array[j].edge) { in ldns_radix_node_print()
816 n = n->array[byte].edge; in ldns_radix_find_prefix()
1049 add->array[0].edge = array->edge; in ldns_radix_array_split()
1052 array->edge->parent = add; in ldns_radix_array_split()
1055 array->edge = add; in ldns_radix_array_split()
1091 array->edge->offset; in ldns_radix_array_split()
1092 array->edge->array[add->parent_index].edge = add; in ldns_radix_array_split()
1167 common->array[array->edge->parent_index].edge = array->edge; in ldns_radix_array_split()
1174 array->edge = common; in ldns_radix_array_split()
[all …]
|