| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | cfghooks.h | 91 edge (*redirect_edge_and_branch) (edge e, basic_block b);
96 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
119 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
133 basic_block (*split_edge) (edge);
134 void (*make_forwarder_block) (edge);
137 void (*tidy_fallthru_edge) (edge);
140 basic_block (*force_nonfallthru) (edge);
161 void (*execute_on_growing_pred) (edge);
165 void (*execute_on_shrinking_pred) (edge);
169 bool (*cfg_hook_duplicate_loop_to_header_edge) (class loop *, edge,
[all …]
|
| H A D | ipa-inline.c | 728 compute_uninlined_call_time (struct cgraph_edge *edge, in compute_uninlined_call_time() argument
732 cgraph_node *caller = (edge->caller->inlined_to in compute_uninlined_call_time()
733 ? edge->caller->inlined_to in compute_uninlined_call_time()
734 : edge->caller); in compute_uninlined_call_time()
749 compute_inlined_call_time (struct cgraph_edge *edge, in compute_inlined_call_time() argument
753 cgraph_node *caller = (edge->caller->inlined_to in compute_inlined_call_time()
754 ? edge->caller->inlined_to in compute_inlined_call_time()
755 : edge->caller); in compute_inlined_call_time()
765 time -= (sreal)ipa_call_summaries->get (edge)->call_stmt_time * freq; in compute_inlined_call_time()
778 inlining_speedup (struct cgraph_edge *edge, in inlining_speedup() argument
[all …]
|
| H A D | ipa-inline.h | 48 int do_estimate_edge_size (struct cgraph_edge *edge);
49 sreal do_estimate_edge_time (struct cgraph_edge *edge, sreal *nonspec_time = NULL);
50 ipa_hints do_estimate_edge_hints (struct cgraph_edge *edge);
73 estimate_edge_size (struct cgraph_edge *edge) in estimate_edge_size() argument
77 || (entry = edge_growth_cache->get (edge)) == NULL in estimate_edge_size()
79 return do_estimate_edge_size (edge); in estimate_edge_size()
86 estimate_min_edge_growth (struct cgraph_edge *edge) in estimate_min_edge_growth() argument
88 ipa_call_summary *s = ipa_call_summaries->get (edge); in estimate_min_edge_growth()
89 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in estimate_min_edge_growth()
96 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth() argument
[all …]
|
| H A D | ipa-inline-analysis.c | 154 simple_edge_hints (struct cgraph_edge *edge) in simple_edge_hints() argument
157 struct cgraph_node *to = (edge->caller->inlined_to in simple_edge_hints()
158 ? edge->caller->inlined_to : edge->caller); in simple_edge_hints()
159 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in simple_edge_hints()
163 if (to_scc_no && to_scc_no == callee_scc_no && !edge->recursive_p ()) in simple_edge_hints()
166 if (cross_module_call_p (edge)) in simple_edge_hints()
180 do_estimate_edge_time (struct cgraph_edge *edge, sreal *ret_nonspec_time) in do_estimate_edge_time() argument
190 class ipa_call_summary *es = ipa_call_summaries->get (edge); in do_estimate_edge_time()
193 callee = edge->callee->ultimate_alias_target (); in do_estimate_edge_time()
195 gcc_checking_assert (edge->inline_failed); in do_estimate_edge_time()
[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 class loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
45 extern class loop *loopify (edge, edge,
46 basic_block, edge, edge, bool,
54 extern bool duplicate_loop_to_header_edge (class loop *, edge,
55 unsigned, sbitmap, edge,
56 vec<edge> *, int);
57 extern bool mfb_keep_just (edge);
|
| H A D | tree-cfg.h | 44 extern edge find_taken_edge (basic_block, tree);
59 extern bool assert_unreachable_fallthru_edge_p (edge);
69 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
70 extern basic_block split_edge_bb_loc (edge);
71 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
73 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
93 extern void remove_edge_and_dominated_blocks (edge);
104 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
106 extern edge find_taken_edge_switch_expr (const gswitch *switch_stmt, tree val);
113 edge *, edge *);
[all …]
|
| H A D | cgraph.c | 868 cgraph_edge *edge; in create_edge() local
883 edge = ggc_alloc<cgraph_edge> (); in create_edge()
884 edge->m_summary_id = -1; in create_edge()
888 edge->m_uid = edges_max_uid; in create_edge()
889 edge->aux = NULL; in create_edge()
890 edge->caller = caller; in create_edge()
891 edge->callee = callee; in create_edge()
892 edge->prev_caller = NULL; in create_edge()
893 edge->next_caller = NULL; in create_edge()
894 edge->prev_callee = NULL; in create_edge()
[all …]
|
| 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-ssa.h | 34 extern void redirect_edge_var_map_add (edge, tree, tree, location_t);
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 | cfg.h | 91 extern edge unchecked_make_edge (basic_block, basic_block, int);
92 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int);
93 extern edge make_edge (basic_block, basic_block, int);
94 extern edge make_single_succ_edge (basic_block, basic_block, int);
95 extern void remove_edge_raw (edge);
96 extern void redirect_edge_succ (edge, basic_block);
97 extern void redirect_edge_pred (edge, basic_block);
99 extern void dump_edge_info (FILE *, edge, dump_flags_t, int);
105 extern void alloc_aux_for_edge (edge, int);
113 extern void update_bb_profile_for_threading (basic_block, profile_count, edge);
|
| H A D | lto-cgraph.c | 232 lto_output_edge (struct lto_simple_output_block *ob, struct cgraph_edge *edge, in lto_output_edge() argument
239 if (edge->indirect_unknown_callee) in lto_output_edge()
246 ref = lto_symtab_encoder_lookup (encoder, edge->caller); in lto_output_edge()
250 if (!edge->indirect_unknown_callee) in lto_output_edge()
252 ref = lto_symtab_encoder_lookup (encoder, edge->callee); in lto_output_edge()
257 edge->count.stream_out (ob->main_stream); in lto_output_edge()
260 uid = !edge->call_stmt ? edge->lto_stmt_uid in lto_output_edge()
261 : gimple_uid (edge->call_stmt) + 1; in lto_output_edge()
263 CIF_N_REASONS, edge->inline_failed); in lto_output_edge()
264 gcc_checking_assert (uid || edge->caller->thunk.thunk_p); in lto_output_edge()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | cfghooks.h | 94 edge (*redirect_edge_and_branch) (edge e, basic_block b);
99 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
122 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
136 basic_block (*split_edge) (edge);
137 void (*make_forwarder_block) (edge);
140 void (*tidy_fallthru_edge) (edge);
143 basic_block (*force_nonfallthru) (edge);
164 void (*execute_on_growing_pred) (edge);
168 void (*execute_on_shrinking_pred) (edge);
172 bool (*cfg_hook_duplicate_loop_body_to_header_edge) (class loop *, edge,
[all …]
|
| H A D | ipa-inline.cc | 765 compute_uninlined_call_time (struct cgraph_edge *edge, in compute_uninlined_call_time() argument
769 cgraph_node *caller = (edge->caller->inlined_to in compute_uninlined_call_time()
770 ? edge->caller->inlined_to in compute_uninlined_call_time()
771 : edge->caller); in compute_uninlined_call_time()
786 compute_inlined_call_time (struct cgraph_edge *edge, in compute_inlined_call_time() argument
790 cgraph_node *caller = (edge->caller->inlined_to in compute_inlined_call_time()
791 ? edge->caller->inlined_to in compute_inlined_call_time()
792 : edge->caller); in compute_inlined_call_time()
802 time -= (sreal)ipa_call_summaries->get (edge)->call_stmt_time * freq; in compute_inlined_call_time()
815 inlining_speedup (struct cgraph_edge *edge, in inlining_speedup() argument
[all …]
|
| H A D | ipa-inline.h | 48 int do_estimate_edge_size (struct cgraph_edge *edge);
49 sreal do_estimate_edge_time (struct cgraph_edge *edge, sreal *nonspec_time = NULL);
50 ipa_hints do_estimate_edge_hints (struct cgraph_edge *edge);
73 estimate_edge_size (struct cgraph_edge *edge) in estimate_edge_size() argument
77 || (entry = edge_growth_cache->get (edge)) == NULL in estimate_edge_size()
79 return do_estimate_edge_size (edge); in estimate_edge_size()
86 estimate_min_edge_growth (struct cgraph_edge *edge) in estimate_min_edge_growth() argument
88 ipa_call_summary *s = ipa_call_summaries->get (edge); in estimate_min_edge_growth()
89 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in estimate_min_edge_growth()
96 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth() argument
[all …]
|
| H A D | ipa-inline-analysis.cc | 157 simple_edge_hints (struct cgraph_edge *edge) in simple_edge_hints() argument
160 struct cgraph_node *to = (edge->caller->inlined_to in simple_edge_hints()
161 ? edge->caller->inlined_to : edge->caller); in simple_edge_hints()
162 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in simple_edge_hints()
166 if (to_scc_no && to_scc_no == callee_scc_no && !edge->recursive_p ()) in simple_edge_hints()
169 if (cross_module_call_p (edge)) in simple_edge_hints()
183 do_estimate_edge_time (struct cgraph_edge *edge, sreal *ret_nonspec_time) in do_estimate_edge_time() argument
191 class ipa_call_summary *es = ipa_call_summaries->get (edge); in do_estimate_edge_time()
194 callee = edge->callee->ultimate_alias_target (); in do_estimate_edge_time()
196 gcc_checking_assert (edge->inline_failed); in do_estimate_edge_time()
[all …]
|
| H A D | tree-cfg.h | 44 extern edge find_taken_edge (basic_block, tree);
59 extern bool assert_unreachable_fallthru_edge_p (edge);
69 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
70 extern basic_block split_edge_bb_loc (edge);
71 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
73 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
93 extern void remove_edge_and_dominated_blocks (edge);
98 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
100 extern edge find_taken_edge_switch_expr (const gswitch *switch_stmt, tree val);
107 edge *, edge *);
[all …]
|
| 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 enum optimize_size_level 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 | cgraph.cc | 876 cgraph_edge *edge; in create_edge() local
891 edge = ggc_alloc<cgraph_edge> (); in create_edge()
892 edge->m_summary_id = -1; in create_edge()
896 edge->m_uid = edges_max_uid; in create_edge()
897 edge->aux = NULL; in create_edge()
898 edge->caller = caller; in create_edge()
899 edge->callee = callee; in create_edge()
900 edge->prev_caller = NULL; in create_edge()
901 edge->next_caller = NULL; in create_edge()
902 edge->prev_callee = NULL; in create_edge()
[all …]
|
| H A D | tree-ssa-threadupdate.h | 38 jump_thread_edge (edge e, jump_thread_edge_type t) : e (e), type (t) {} in jump_thread_edge()
40 edge e;
49 jump_thread_edge *allocate_thread_edge (edge, jump_thread_edge_type);
69 void push_edge (vec<jump_thread_edge *> *path, edge, jump_thread_edge_type);
93 void remove_jump_threads_including (edge);
101 class redirection_data *lookup_redirection_data (edge e, enum insert_option);
118 bool duplicate_thread_path (edge entry, edge exit, basic_block *region,
129 static hashval_t hash (edge e) { return htab_hash_pointer (e); } in hash()
130 static bool equal (edge e1, edge e2) { return e1 == e2; } in equal()
148 extern void free_dom_edge_info (edge);
|
| 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 class loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
52 duplicate_loop_body_to_header_edge (class loop *, edge, unsigned, sbitmap, edge,
53 vec<edge> *, int);
54 extern bool mfb_keep_just (edge);
|
| H A D | cfg.h | 91 extern edge unchecked_make_edge (basic_block, basic_block, int);
92 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int);
93 extern edge make_edge (basic_block, basic_block, int);
94 extern edge make_single_succ_edge (basic_block, basic_block, int);
95 extern void remove_edge_raw (edge);
96 extern void redirect_edge_succ (edge, basic_block);
97 extern void redirect_edge_pred (edge, basic_block);
99 extern void dump_edge_info (FILE *, edge, dump_flags_t, int);
105 extern void alloc_aux_for_edge (edge, int);
115 extern void update_bb_profile_for_threading (basic_block, profile_count, edge);
|
| /netbsd-src/external/bsd/unbound/dist/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 …]
|
| /netbsd-src/external/mit/isl/dist/ |
| H A D | isl_scheduler_clustering.c | 92 static isl_bool is_non_empty_proximity(struct isl_sched_edge *edge) in is_non_empty_proximity() argument
94 if (!isl_sched_edge_is_proximity(edge)) in is_non_empty_proximity()
96 return isl_bool_not(isl_map_plain_is_empty(edge->map)); in is_non_empty_proximity()
120 struct isl_sched_edge *edge = &graph->edge[i]; in find_proximity() local
124 prox = is_non_empty_proximity(edge); in find_proximity()
129 if (edge->no_merge) in find_proximity()
131 if (bad_cluster(&c->scc[edge->src->scc]) || in find_proximity()
132 bad_cluster(&c->scc[edge->dst->scc])) in find_proximity()
134 dist = c->scc_cluster[edge->dst->scc] - in find_proximity()
135 c->scc_cluster[edge->src->scc]; in find_proximity()
[all …]
|
| H A D | isl_scheduler.c | 81 int isl_sched_edge_has_type(struct isl_sched_edge *edge, in isl_sched_edge_has_type() argument
84 return ISL_FL_ISSET(edge->types, 1 << type); in isl_sched_edge_has_type()
89 static void set_type(struct isl_sched_edge *edge, enum isl_edge_type type) in set_type() argument
91 ISL_FL_SET(edge->types, 1 << type); in set_type()
96 static void clear_type(struct isl_sched_edge *edge, enum isl_edge_type type) in clear_type() argument
98 ISL_FL_CLR(edge->types, 1 << type); in clear_type()
103 static int is_validity(struct isl_sched_edge *edge) in is_validity() argument
105 return isl_sched_edge_has_type(edge, isl_edge_validity); in is_validity()
110 static void set_validity(struct isl_sched_edge *edge) in set_validity() argument
112 set_type(edge, isl_edge_validity); in set_validity()
[all …]
|
| /netbsd-src/external/bsd/unbound/dist/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 …]
|