Home
last modified time | relevance | path

Searched refs:cgraph_edge_p (Results 1 – 25 of 56) sorted by relevance

123

/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dcgraph.h445 typedef struct cgraph_edge *cgraph_edge_p; typedef
624 vec<cgraph_edge_p> collect_callers_of_node (struct cgraph_node *node);
675 int, bool, vec<cgraph_edge_p>,
679 vec<cgraph_edge_p>,
692 tree, vec<cgraph_edge_p>, bitmap);
694 vec<cgraph_edge_p>,
H A Dcgraphclones.c175 vec<cgraph_edge_p> redirect_callers, in cgraph_clone_node()
279 vec<cgraph_edge_p> redirect_callers, in cgraph_create_virtual_clone()
622 vec<cgraph_edge_p> redirect_callers, in cgraph_copy_node_for_versioning()
689 vec<cgraph_edge_p> redirect_callers, in cgraph_function_versioning()
H A Dipa-inline.h231 bool inline_call (struct cgraph_edge *, bool, vec<cgraph_edge_p> *, int *, bool);
H A Dipa-cp.c2285 static vec<cgraph_edge_p> next_edge_clone;
2421 static vec<cgraph_edge_p>
2425 vec<cgraph_edge_p> ret; in gather_edges_for_value()
2620 vec<cgraph_edge_p> callers) in create_specialized_node()
2693 vec<cgraph_edge_p> callers) in find_more_scalar_values_for_callers_subset()
3012 vec<cgraph_edge_p> callers) in find_aggregate_values_for_callers_subset()
3296 vec<cgraph_edge_p> callers; in decide_about_value()
3417 vec<cgraph_edge_p> callers; in decide_whether_version_node()
H A Dipa-prop.h504 vec<cgraph_edge_p> *new_edges);
H A Dipa-inline-transform.c202 vec<cgraph_edge_p> *new_edges, in inline_call()
H A Dipa-inline.c1225 vec<cgraph_edge_p> *new_edges) in recursive_inlining()
1375 add_new_edges_to_heap (fibheap_t heap, vec<cgraph_edge_p> new_edges) in add_new_edges_to_heap()
1404 vec<cgraph_edge_p> new_indirect_edges = vNULL; in inline_small_functions()
H A Dcgraph.c2169 vec<cgraph_edge_p> *redirect_callers = (vec<cgraph_edge_p> *)data; in collect_callers_of_node_1()
2184 vec<cgraph_edge_p>
2187 vec<cgraph_edge_p> redirect_callers = vNULL; in collect_callers_of_node()
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/
H A Dcgraph.h445 typedef struct cgraph_edge *cgraph_edge_p; typedef
623 vec<cgraph_edge_p> collect_callers_of_node (struct cgraph_node *node);
674 int, bool, vec<cgraph_edge_p>,
678 vec<cgraph_edge_p>,
691 tree, vec<cgraph_edge_p>, bitmap);
693 vec<cgraph_edge_p>,
H A Dcgraphclones.c175 vec<cgraph_edge_p> redirect_callers, in cgraph_clone_node()
279 vec<cgraph_edge_p> redirect_callers, in cgraph_create_virtual_clone()
622 vec<cgraph_edge_p> redirect_callers, in cgraph_copy_node_for_versioning()
689 vec<cgraph_edge_p> redirect_callers, in cgraph_function_versioning()
H A Dipa-inline.h231 bool inline_call (struct cgraph_edge *, bool, vec<cgraph_edge_p> *, int *, bool);
H A Dipa-cp.c2281 static vec<cgraph_edge_p> next_edge_clone;
2417 static vec<cgraph_edge_p>
2421 vec<cgraph_edge_p> ret; in gather_edges_for_value()
2616 vec<cgraph_edge_p> callers) in create_specialized_node()
2689 vec<cgraph_edge_p> callers) in find_more_scalar_values_for_callers_subset()
2998 vec<cgraph_edge_p> callers) in find_aggregate_values_for_callers_subset()
3276 vec<cgraph_edge_p> callers; in decide_about_value()
3397 vec<cgraph_edge_p> callers; in decide_whether_version_node()
H A Dipa-prop.h504 vec<cgraph_edge_p> *new_edges);
H A Dipa-inline-transform.c202 vec<cgraph_edge_p> *new_edges, in inline_call()
H A Dipa-inline.c1225 vec<cgraph_edge_p> *new_edges) in recursive_inlining()
1375 add_new_edges_to_heap (fibheap_t heap, vec<cgraph_edge_p> new_edges) in add_new_edges_to_heap()
1404 vec<cgraph_edge_p> new_indirect_edges = vNULL; in inline_small_functions()
H A Dcgraph.c2169 vec<cgraph_edge_p> *redirect_callers = (vec<cgraph_edge_p> *)data; in collect_callers_of_node_1()
2184 vec<cgraph_edge_p>
2187 vec<cgraph_edge_p> redirect_callers = vNULL; in collect_callers_of_node()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dcgraph.h632 typedef struct cgraph_edge *cgraph_edge_p; typedef
822 vec<cgraph_edge_p> collect_callers_of_node (struct cgraph_node *node);
894 int, bool, vec<cgraph_edge_p>,
898 vec<cgraph_edge_p>,
912 tree, vec<cgraph_edge_p>, bitmap);
914 vec<cgraph_edge_p>,
H A Dcgraphclones.c424 vec<cgraph_edge_p> redirect_callers, in cgraph_clone_node()
548 vec<cgraph_edge_p> redirect_callers, in cgraph_create_virtual_clone()
878 vec<cgraph_edge_p> redirect_callers, in cgraph_copy_node_for_versioning()
946 vec<cgraph_edge_p> redirect_callers, in cgraph_function_versioning()
H A Dipa-inline.h237 bool inline_call (struct cgraph_edge *, bool, vec<cgraph_edge_p> *, int *, bool,
H A Dipa-cp.c2397 static vec<cgraph_edge_p> next_edge_clone;
2398 static vec<cgraph_edge_p> prev_edge_clone;
2559 static vec<cgraph_edge_p>
2563 vec<cgraph_edge_p> ret; in gather_edges_for_value()
2745 vec<cgraph_edge_p> callers) in create_specialized_node()
2821 vec<cgraph_edge_p> callers) in find_more_scalar_values_for_callers_subset()
3140 vec<cgraph_edge_p> callers) in find_aggregate_values_for_callers_subset()
3427 vec<cgraph_edge_p> callers; in decide_about_value()
3547 vec<cgraph_edge_p> callers; in decide_whether_version_node()
H A Dipa-inline-transform.c224 vec<cgraph_edge_p> *new_edges, in inline_call()
H A Dipa-prop.h578 vec<cgraph_edge_p> *new_edges);
H A Dipa-inline.c1296 vec<cgraph_edge_p> *new_edges) in recursive_inlining()
1446 add_new_edges_to_heap (fibheap_t heap, vec<cgraph_edge_p> new_edges) in add_new_edges_to_heap()
1561 auto_vec<cgraph_edge_p> new_indirect_edges; in inline_small_functions()
/dports/multimedia/libv4l/linux-5.13-rc2/scripts/gcc-plugins/
H A Dgcc-common.h337 typedef struct cgraph_edge *cgraph_edge_p; typedef
/dports/multimedia/v4l_compat/linux-5.13-rc2/scripts/gcc-plugins/
H A Dgcc-common.h337 typedef struct cgraph_edge *cgraph_edge_p; typedef

123