| /dflybsd-src/contrib/gcc-8.0/gcc/ |
| H A D | ipa-inline.h | 70 estimate_edge_size (struct cgraph_edge *edge) in estimate_edge_size()
82 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth()
110 estimate_edge_hints (struct cgraph_edge *edge) in estimate_edge_hints()
122 reset_edge_growth_cache (struct cgraph_edge *edge) in reset_edge_growth_cache()
|
| H A D | ipa-inline-analysis.c | 86 inline_edge_removal_hook (struct cgraph_edge *edge, in inline_edge_removal_hook()
122 simple_edge_hints (struct cgraph_edge *edge) in simple_edge_hints()
150 do_estimate_edge_time (struct cgraph_edge *edge) in do_estimate_edge_time()
211 do_estimate_edge_size (struct cgraph_edge *edge) in do_estimate_edge_size()
252 do_estimate_edge_hints (struct cgraph_edge *edge) in do_estimate_edge_hints()
294 struct cgraph_edge *edge) in estimate_size_after_inlining()
|
| H A D | ipa-inline.c | 675 compute_uninlined_call_time (struct cgraph_edge *edge, in compute_uninlined_call_time()
696 compute_inlined_call_time (struct cgraph_edge *edge, in compute_inlined_call_time()
864 want_inline_self_recursive_call_p (struct cgraph_edge *edge, in want_inline_self_recursive_call_p()
1020 edge_badness (struct cgraph_edge *edge, bool dump) in edge_badness()
1237 update_edge_key (edge_heap_t *heap, struct cgraph_edge *edge) in update_edge_key()
1287 struct cgraph_edge *edge; in reset_edge_caches() local
1338 struct cgraph_edge *edge; in update_caller_keys() local
1457 recursive_inlining (struct cgraph_edge *edge, in recursive_inlining()
1609 struct cgraph_edge *edge = new_edges.pop (); in add_new_edges_to_heap() local
1688 resolve_noninline_speculation (edge_heap_t *edge_heap, struct cgraph_edge *edge) in resolve_noninline_speculation()
[all …]
|
| H A D | ipa-comdats.c | 123 for (struct cgraph_edge * edge = cnode->callers; in propagate_comdat_group() local
183 struct cgraph_edge *edge; in enqueue_references() local
|
| H A D | cgraphclones.c | 720 cgraph_edge *edge = get_edge (old_stmt); in set_call_stmt_including_clones() local
729 cgraph_edge *edge = node->get_edge (old_stmt); in set_call_stmt_including_clones() local
776 cgraph_edge *edge; in create_edge_including_clones() local
790 cgraph_edge *edge = node->get_edge (old_stmt); in create_edge_including_clones() local
|
| H A D | ipa-utils.c | 83 struct cgraph_edge *edge; in searchc() local
268 struct cgraph_edge *edge; member
282 struct cgraph_edge *edge; in ipa_reverse_postorder() local
|
| H A D | lto-cgraph.c | 236 lto_output_edge (struct lto_simple_output_block *ob, struct cgraph_edge *edge, in lto_output_edge()
749 output_outgoing_cgraph_edges (struct cgraph_edge *edge, in output_outgoing_cgraph_edges()
872 struct cgraph_edge *edge; in compute_ltrans_boundary() local
1469 struct cgraph_edge *edge; in input_edge() local
1717 struct cgraph_edge *edge; in merge_profile_summaries() local
|
| H A D | cgraph.c | 833 cgraph_edge *edge; in create_edge() local
914 cgraph_edge *edge = symtab->create_edge (this, callee, call_stmt, count, in create_edge() local
952 cgraph_edge *edge = symtab->create_edge (this, NULL, call_stmt, in create_indirect_edge() local
1161 cgraph_edge *edge = this; in resolve_speculation() local
1220 cgraph_edge *edge = this; in make_direct() local
2045 cgraph_edge *edge; in dump() local
|
| H A D | ipa-fnsummary.c | 648 struct cgraph_edge *edge, *next; in duplicate() local
813 struct cgraph_edge *edge; in dump_ipa_call_summary() local
2179 struct cgraph_edge *edge = node->get_edge (stmt); in analyze_function_body() local
2881 struct cgraph_edge *edge) in remap_edge_change_prob()
3010 ipa_merge_fn_summary_after_inlining (struct cgraph_edge *edge) in ipa_merge_fn_summary_after_inlining()
3437 struct cgraph_edge *edge; in ipa_fn_summary_write() local
|
| /dflybsd-src/contrib/gcc-4.7/gcc/ |
| H A D | ipa-inline.c | 557 want_inline_self_recursive_call_p (struct cgraph_edge *edge, in want_inline_self_recursive_call_p()
664 check_caller_edge (struct cgraph_node *node, void *edge) in check_caller_edge()
709 struct cgraph_edge *edge, in relative_time_benefit()
740 edge_badness (struct cgraph_edge *edge, bool dump) in edge_badness()
895 update_edge_key (fibheap_t heap, struct cgraph_edge *edge) in update_edge_key()
949 struct cgraph_edge *edge; in reset_edge_caches() local
1004 struct cgraph_edge *edge; in update_caller_keys() local
1170 recursive_inlining (struct cgraph_edge *edge, in recursive_inlining()
1306 struct cgraph_edge *edge = VEC_pop (cgraph_edge_p, new_edges); in add_new_edges_to_heap() local
1327 struct cgraph_edge *edge; in inline_small_functions() local
[all …]
|
| H A D | ipa-inline.h | 197 inline_edge_summary (struct cgraph_edge *edge) in inline_edge_summary()
222 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth()
238 estimate_edge_time (struct cgraph_edge *edge) in estimate_edge_time()
262 reset_edge_growth_cache (struct cgraph_edge *edge) in reset_edge_growth_cache()
|
| H A D | ipa-inline-analysis.c | 899 struct cgraph_edge *edge; in inline_node_duplication_hook() local
1066 inline_edge_removal_hook (struct cgraph_edge *edge, void *data ATTRIBUTE_UNUSED) in inline_edge_removal_hook()
1106 struct cgraph_edge *edge; in dump_inline_edge_summary() local
1946 struct cgraph_edge *edge = cgraph_edge (node, stmt); in estimate_function_body_sizes() local
2503 struct cgraph_edge *edge) in remap_edge_change_prob()
2618 inline_merge_summary (struct cgraph_edge *edge) in inline_merge_summary()
2714 do_estimate_edge_time (struct cgraph_edge *edge) in do_estimate_edge_time()
2763 do_estimate_edge_growth (struct cgraph_edge *edge) in do_estimate_edge_growth()
2802 struct cgraph_edge *edge) in estimate_time_after_inlining()
2823 struct cgraph_edge *edge) in estimate_size_after_inlining()
[all …]
|
| H A D | cgraph.c | 857 struct cgraph_edge *edge = cgraph_edge (orig, old_stmt); in cgraph_set_call_stmt_including_clones() local
866 struct cgraph_edge *edge = cgraph_edge (node, old_stmt); in cgraph_set_call_stmt_including_clones() local
899 struct cgraph_edge *edge; in cgraph_create_edge_including_clones() local
911 struct cgraph_edge *edge = cgraph_edge (node, old_stmt); in cgraph_create_edge_including_clones() local
948 struct cgraph_edge *edge; in cgraph_create_edge_1() local
1012 struct cgraph_edge *edge = cgraph_create_edge_1 (caller, callee, call_stmt, in cgraph_create_edge() local
1051 struct cgraph_edge *edge = cgraph_create_edge_1 (caller, NULL, call_stmt, in cgraph_create_indirect_edge() local
1169 cgraph_make_edge_direct (struct cgraph_edge *edge, struct cgraph_node *callee) in cgraph_make_edge_direct()
1789 struct cgraph_edge *edge; in dump_cgraph_node() local
2756 struct cgraph_edge *edge; in cgraph_propagate_frequency_1() local
|
| H A D | ipa-utils.c | 88 struct cgraph_edge *edge; in searchc() local
239 struct cgraph_edge *edge; member
253 struct cgraph_edge *edge; in ipa_reverse_postorder() local
|
| H A D | lto-cgraph.c | 265 lto_output_edge (struct lto_simple_output_block *ob, struct cgraph_edge *edge, in lto_output_edge()
687 output_outgoing_cgraph_edges (struct cgraph_edge *edge, in output_outgoing_cgraph_edges()
765 struct cgraph_edge *edge; in compute_ltrans_boundary() local
1137 struct cgraph_edge *edge; in input_edge() local
1366 struct cgraph_edge *edge; in merge_profile_summaries() local
|
| H A D | cfgloop.c | 92 static VEC (edge, heap) * in VEC() argument
524 find_subloop_latch_edge_by_profile (VEC (edge, heap) *latches) in find_subloop_latch_edge_by_profile()
564 find_subloop_latch_edge_by_ivs (struct loop *loop ATTRIBUTE_UNUSED, VEC (edge, heap) *latches) in find_subloop_latch_edge_by_ivs()
1125 VEC (edge, heap) * in VEC() argument
|
| H A D | basic-block.h | 612 static inline VEC(edge,gc) * in VEC() argument
624 ei_start_1 (VEC(edge,gc) **ev) in ei_start_1()
637 ei_last_1 (VEC(edge,gc) **ev) in ei_last_1()
933 find_fallthru_edge (VEC(edge,gc) *edges) in find_fallthru_edge()
|
| H A D | tree-ssa-uninit.c | 250 VEC(edge, heap) **cd_chains, in compute_control_dep_chain()
342 convert_control_dep_chain_into_preds (VEC(edge, heap) **dep_chains, in convert_control_dep_chain_into_preds()
479 VEC(edge, heap) **edges, in collect_phi_def_edges()
|
| H A D | cfghooks.c | 725 make_forwarder_block (basic_block bb, bool (*redirect_edge_p) (edge), in make_forwarder_block()
1090 VEC (edge, heap) **to_remove, in cfg_hook_duplicate_loop_to_header_edge()
|
| /dflybsd-src/contrib/libpcap/ |
| H A D | gencode.h | 242 struct edge { struct
244 int code; /* opcode for branch corresponding to this edge */ argument
248 struct edge *next; /* link list of incoming edges for a node */ argument
|
| /dflybsd-src/sbin/ipfw3/ |
| H A D | ipfw3sync.c | 110 struct ipfw3_sync_edge *edge; in sync_config_centre() local
191 struct ipfw3_sync_edge *edge; in sync_show_config() local
|
| /dflybsd-src/tools/tools/ath/athprom/ |
| H A D | athprom.c | 384 printEdge(FILE *fd, int edge) in printEdge()
396 printEdgePower(FILE *fd, int edge) in printEdgePower()
410 printEdgeFlag(FILE *fd, int edge) in printEdgeFlag()
|
| /dflybsd-src/sys/sys/ |
| H A D | timepps.h | 98 int edge; member
186 const int edge, const int tsformat) in time_pps_kcbind()
|
| /dflybsd-src/contrib/ldns/ldns/ |
| H A D | radix.h | 64 ldns_radix_node_t* edge; member
|
| /dflybsd-src/contrib/byacc/ |
| H A D | lalr.c | 280 Value_t *edge; in initialize_F() local
363 Value_t *edge; in build_relations() local
|