/haiku-buildtools/gcc/gcc/ |
H A D | cfgloopmanip.h | 35 extern edge mfb_kj_edge; 37 extern bool remove_path (edge); 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, 53 extern bool duplicate_loop_to_header_edge (struct loop *, edge, [all...] |
H A D | shrink-wrap.h | 37 extern void try_shrink_wrapping (edge *entry_edge, edge orig_entry_edge, 39 extern edge get_unconverted_simple_return (edge, bitmap_head, 40 vec<edge> *, rtx_insn **); 41 extern void convert_to_simple_return (edge entry_edge, edge orig_entry_edge, 44 vec<edge> unconverted_simple_returns);
|
H A D | cfghooks.h | 73 /* Redirect edge E to the given basic block B and update underlying program 74 representation. Returns edge representing redirected branch (that may not 76 if edge is not easily redirectable for whatever reason. */ 77 edge (*redirect_edge_and_branch) (edge e, basic_block b); 80 newly created forwarder basic block is returned. The edge must 82 basic_block (*redirect_edge_and_branch_force) (edge, basic_block); 84 /* Returns true if it is possible to remove the edge by redirecting it 85 to the destination of the other edge going from its source. */ 104 /* Predict edge [all...] |
H A D | loop-unroll.h | 24 extern basic_block split_edge_and_insert (edge, rtx_insn *);
|
H A D | tree-ssa-loop-manip.h | 29 extern basic_block split_loop_exit_edge (edge); 34 extern bool gimple_duplicate_loop_to_header_edge (struct loop *, edge, 36 edge, vec<edge> *, 41 edge, struct tree_niter_desc *, 44 edge, struct tree_niter_desc *);
|
H A D | cfg.h | 82 extern edge unchecked_make_edge (basic_block, basic_block, int); 83 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int); 84 extern edge make_edge (basic_block, basic_block, int); 85 extern edge make_single_succ_edge (basic_block, basic_block, int); 86 extern void remove_edge_raw (edge); 87 extern void redirect_edge_succ (edge, basic_block); 88 extern void redirect_edge_pred (edge, basic_block); 90 extern void dump_edge_info (FILE *, edge, int, int); 96 extern void alloc_aux_for_edge (edge, int); 104 extern void update_bb_profile_for_threading (basic_block, int, gcov_type, edge); [all...] |
H A D | predict.h | 52 extern bool maybe_hot_edge_p (edge); 54 extern bool probably_never_executed_edge_p (struct function *, edge); 59 extern bool optimize_edge_for_size_p (edge); 60 extern bool optimize_edge_for_speed_p (edge); 67 extern bool predictable_edge_p (edge); 69 extern void rtl_profile_for_edge (edge); 76 extern void rtl_predict_edge (edge, enum br_predictor, int); 77 extern void gimple_predict_edge (edge, enum br_predictor, int); 78 extern void remove_predictions_associated_with_edge (edge); 79 extern void predict_edge_def (edge, enu [all...] |
H A D | tree-ssa.h | 35 extern void redirect_edge_var_map_add (edge, tree, tree, source_location); 36 extern void redirect_edge_var_map_clear (edge); 37 extern void redirect_edge_var_map_dup (edge, edge); 38 extern vec<edge_var_map> *redirect_edge_var_map_vector (edge); 40 extern edge ssa_redirect_edge (edge, basic_block); 41 extern void flush_pending_stmts (edge);
|
H A D | cfgrtl.h | 37 extern edge try_redirect_by_replacing_jump (edge, basic_block, bool); 39 extern basic_block force_nonfallthru_and_redirect (edge, basic_block, rtx); 40 extern void insert_insn_on_edge (rtx, edge); 41 extern void commit_one_edge_insertion (edge e);
|
H A D | ipa-inline.h | 257 void inline_merge_summary (struct cgraph_edge *edge); 259 int do_estimate_edge_size (struct cgraph_edge *edge); 260 int do_estimate_edge_time (struct cgraph_edge *edge); 261 inline_hints do_estimate_edge_hints (struct cgraph_edge *edge); 281 inline_edge_summary (struct cgraph_edge *edge) argument 283 return &inline_edge_summary_vec[edge->uid]; 290 estimate_edge_size (struct cgraph_edge *edge) argument 293 if ((int)edge_growth_cache.length () <= edge->uid 294 || !(ret = edge_growth_cache[edge->uid].size)) 295 return do_estimate_edge_size (edge); 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 | tree-ssa-loop-niter.h | 25 extern bool number_of_iterations_exit (struct loop *, edge, 28 extern tree find_loop_niter (struct loop *, edge *); 30 extern tree loop_niter_by_eval (struct loop *, edge); 31 extern tree find_loop_niter_by_eval (struct loop *, edge *);
|
H A D | tree-cfg.h | 24 /* Location to track pending stmt for edge insertion. */ 46 extern edge find_taken_edge (basic_block, tree); 60 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, 91 extern void remove_edge_and_dominated_blocks (edge); [all...] |
H A D | tree-ssa-threadupdate.h | 38 jump_thread_edge (edge e, enum jump_thread_edge_type type) 41 edge e;
|
H A D | ipa-inline.c | 80 recursive edge is met as viable candidate. 160 /* Return false when inlining edge E would lead to violating 227 We ought to ignore this limit when we know that the edge is executed 322 /* Decide if we can inline the edge and possibly update 553 /* Return true if the edge E is inlinable during early inlining. */ 575 fprintf (dump_file, " edge not inlinable: not in SSA form\n"); 671 /* Compute time of the edge->caller + edge->callee execution when inlining 676 struct cgraph_edge *edge) 679 cgraph_node *caller = (edge 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 | tree-eh.h | 35 extern edge redirect_eh_edge (edge, basic_block); 36 extern void redirect_eh_dispatch_edge (geh_dispatch *, edge, basic_block);
|
H A D | profile.h | 2 block and edge frequency counts. 33 /* Pretend this edge does not exist (it is abnormal and we've 44 /* Smoothes the initial assigned basic block and edge counts using 48 extern gcov_type sum_edge_counts (vec<edge, va_gc> *edges);
|
H A D | ipa-comdats.c | 140 for (struct cgraph_edge * edge = cnode->callers; 141 edge && newgroup != error_mark_node; edge = edge->next_caller) 143 struct symtab_node *symbol2 = edge->caller; 200 struct cgraph_edge *edge; local 202 for (edge = cnode->callees; edge; edge = edge [all...] |
H A D | sese.h | 30 edge entry, exit; 54 extern sese new_sese (edge, edge); 56 extern void sese_insert_phis_for_liveouts (sese, basic_block, edge, edge); 58 extern edge copy_bb_and_scalar_dependences (basic_block, sese, edge, 87 edge e; 188 edge entry, exit; 231 extern edge get_true_edge_from_guard_b [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | 20031022-1.c | 7 } *edge; typedef in typeref:struct:edge_def 10 edge pred; 14 void foo (edge); 18 edge e;
|
H A D | 20041122-1.c | 11 typedef struct edge_def *edge; typedef in typeref:struct:edge_def 18 extern edge frob (); 24 edge e = frob();
|
H A D | vrp56.c | 6 typedef struct edge_def *edge; typedef in typeref:struct:edge_def 34 edge e_out;
|
H A D | loadpre8.c | 22 typedef struct edge_def *edge; typedef in typeref:struct:edge_def 27 __attribute__ ((noinline)) static edge 62 static __inline__ edge 65 return (edge) (VEC_edge_base_index ((((ei_container (i))) ? &((ei_container (i)))->base : 0), (i.index))); 68 ei_cond (edge_iterator ei, edge * p) 86 edge e;
|
/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/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 27 class eel_branch_edge : public virtual edge { 35 class interproc_edge : public virtual edge { 38 class eel_jump_edge : public virtual edge {
|
/haiku-buildtools/binutils/gas/testsuite/gas/mips/ |
H A D | 24k-triple-stores-3.s | 17 # edge case 23 # edge case (unaligned) 34 # edge case 40 # edge case (unaligned) 51 # edge case 57 # edge case (unaligned) 69 # edge case 75 # edge case 81 # edge case (unaligned)
|