/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 20070522-1.c | 7 int edge; member in struct:Collision
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | 20031022-1.c | 7 } *edge; typedef in typeref:struct:edge_def
|
H A D | 20041122-1.c | 11 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
|
H A D | vrp56.c | 6 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
|
H A D | loadpre8.c | 22 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
|
H A D | coalesce-1.c | 15 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | align1.C | 19 class edge : public virtual eel_edge { class in inherits:eel_edge 21 edge() { function in class:edge
|
/haiku-buildtools/gcc/gcc/ |
H A D | ipa-comdats.c | 200 struct cgraph_edge *edge; local [all...] |
H A D | ipa-inline.h | 281 inline_edge_summary (struct cgraph_edge *edge) argument 290 estimate_edge_size (struct cgraph_edge *edge) argument 302 estimate_edge_growth(struct cgraph_edge *edge) argument 316 estimate_edge_time(struct cgraph_edge *edge) argument 330 estimate_edge_hints(struct cgraph_edge *edge) argument 342 reset_edge_growth_cache(struct cgraph_edge *edge) argument [all...] |
H A D | ipa-utils.c | 114 struct cgraph_edge *edge; local 301 struct cgraph_edge *edge; member in struct:postorder_stack 315 struct cgraph_edge *edge; local [all...] |
H A D | ipa-profile.c | 338 struct cgraph_edge *edge; local [all...] |
H A D | cgraphclones.c | 753 cgraph_edge *edge = get_edge (old_stmt); local 762 cgraph_edge *edge = node->get_edge (old_stmt); local 810 cgraph_edge *edge; local 822 cgraph_edge *edge = node->get_edge (old_stmt); local [all...] |
H A D | ipa.c | 176 walk_polymorphic_call_targets(hash_set<void *> *reachable_call_targets, struct cgraph_edge *edge, symtab_node **first, hash_set<symtab_node *> *reachable, bool before_inlining_p) argument [all...] |
H A D | coretypes.h | 215 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
|
H A D | ira-emit.c | 731 vec<edge, va_gc> *vec; local [all...] |
H A D | lto-cgraph.c | 277 lto_output_edge (struct lto_simple_output_block *ob, struct cgraph_edge *edge, argument 779 output_outgoing_cgraph_edges(struct cgraph_edge *edge, struct lto_simple_output_block *ob, lto_symtab_encoder_t encoder) argument 902 struct cgraph_edge *edge; local 1485 struct cgraph_edge *edge; local 1734 struct cgraph_edge *edge; local [all...] |
H A D | ipa-prop.h | 596 ipa_edge_args_info_available_for_edge_p (struct cgraph_edge *edge) argument
|
H A D | cfghooks.c | 839 make_forwarder_block(basic_block bb, bool (*redirect_edge_p) (edge), void (*new_bb_cbk) (basic_block)) argument [all...] |
H A D | cgraphunit.c | 844 walk_polymorphic_call_targets(hash_set<void *> *reachable_call_targets, cgraph_edge *edge) argument 1007 cgraph_edge *edge; local [all...] |
H A D | tree-ssa.c | 73 static hash_map<edge, auto_vec<edge_var_map> > *edge_var_maps; variable [all...] |
H A D | ipa-inline.c | 675 compute_uninlined_call_time(struct inline_summary *callee_info, struct cgraph_edge *edge) argument 698 compute_inlined_call_time(struct cgraph_edge *edge, int edge_time) argument 866 want_inline_self_recursive_call_p(struct cgraph_edge *edge, struct cgraph_node *outer_node, bool peeling, int depth) argument 1044 edge_badness(struct cgraph_edge *edge, bool dump) argument 1253 update_edge_key(edge_heap_t *heap, struct cgraph_edge *edge) argument 1308 struct cgraph_edge *edge; local 1359 struct cgraph_edge *edge; local 1482 recursive_inlining(struct cgraph_edge *edge, vec<cgraph_edge *> *new_edges) argument 1631 struct cgraph_edge *edge = new_edges.pop (); local 1706 resolve_noninline_speculation(edge_heap_t *edge_heap, struct cgraph_edge *edge) argument 1763 struct cgraph_edge *edge; local 2483 struct cgraph_edge *edge, *next; local 2638 struct cgraph_edge *edge; local [all...] |
H A D | auto-profile.c | 1667 afdo_callsite_hot_enough_for_early_inline(struct cgraph_edge *edge) argument [all...] |
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | basic-block.h | 117 } *edge; typedef in typeref:struct:edge_def
|
/haiku-buildtools/gcc/gcc/lto/ |
H A D | lto-partition.c | 577 struct cgraph_edge *edge; local [all...] |
/haiku-buildtools/isl/ |
H A D | isl_schedule.c | 191 struct isl_sched_edge *edge; member in struct:isl_sched_graph 251 const struct isl_sched_edge *edge = entry; local 259 graph_edge_table_add(isl_ctx *ctx, struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_edge *edge) argument 339 struct isl_sched_edge *edge; local 361 struct isl_sched_edge *edge; local 374 graph_remove_edge(struct isl_sched_graph *graph, struct isl_sched_edge *edge) argument 570 struct isl_sched_edge *edge; local 785 add_intra_validity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge) argument 843 add_inter_validity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge) argument 935 add_intra_proximity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, int s) argument 1015 add_inter_proximity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, int s) argument 1085 struct isl_sched_edge *edge= &graph->edge[i]; local 1095 struct isl_sched_edge *edge = &graph->edge[i]; local 1120 struct isl_sched_edge *edge= &graph->edge[i]; local 1192 count_map_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int *n_eq, int *n_ineq, int carry) argument 1231 struct isl_sched_edge *edge= &graph->edge[i]; local 1680 struct isl_sched_edge *edge = &graph->edge[i]; local 1850 copy_edges(isl_ctx *ctx, struct isl_sched_graph *dst, struct isl_sched_graph *src, int (*edge_pred)(struct isl_sched_edge *edge, int data), int data) argument 1859 struct isl_sched_edge *edge = &src->edge[i]; local 1968 compute_sub_schedule(isl_ctx *ctx, struct isl_sched_graph *graph, int n, int n_edge, int (*node_pred)(struct isl_sched_node *node, int data), int (*edge_pred)(struct isl_sched_edge *edge, int data), int data, int wcc) argument 2024 edge_scc_exactly(struct isl_sched_edge *edge, int scc) argument 2029 edge_dst_scc_at_most(struct isl_sched_edge *edge, int scc) argument 2034 edge_src_scc_at_least(struct isl_sched_edge *edge, int scc) argument 2192 add_intra_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int pos) argument 2241 add_inter_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int pos) argument 2302 struct isl_sched_edge *edge= &graph->edge[i]; local 2338 struct isl_sched_edge *edge= &graph->edge[i]; local [all...] |