Searched refs:basic_block (Results 26 - 50 of 151) sorted by relevance

1234567

/freebsd-11-stable/contrib/gcc/
H A Dtree-ssa-propagate.c133 static VEC(basic_block,heap) *cfg_blocks;
177 cfg_blocks_add (basic_block bb)
192 if (cfg_blocks_num > VEC_length (basic_block, cfg_blocks))
199 cfg_blocks_tail = VEC_length (basic_block, cfg_blocks);
201 VEC_safe_grow (basic_block, heap, cfg_blocks, 2 * cfg_blocks_tail);
207 >= EDGE_COUNT (VEC_index (basic_block, cfg_blocks,
210 % VEC_length (basic_block, cfg_blocks));
214 cfg_blocks_head = VEC_length (basic_block, cfg_blocks);
220 VEC_replace (basic_block, cfg_blocks,
229 static basic_block
[all...]
H A Dcfgbuild.c52 static void make_edges (basic_block, basic_block, int);
53 static void make_label_edge (sbitmap, basic_block, rtx, int);
54 static void find_bb_boundaries (basic_block);
55 static void compute_outgoing_frequencies (basic_block);
190 make_label_edge (sbitmap edge_cache, basic_block src, rtx label, int flags)
208 rtl_make_eh_edge (sbitmap edge_cache, basic_block src, rtx insn)
255 make_edges (basic_block min, basic_block max, int update_p)
257 basic_block b
[all...]
H A Dtree-ssa-loop-ch.c51 should_duplicate_loop_header_p (basic_block header, struct loop *loop,
129 basic_block header;
131 basic_block *bbs, *copied_bbs;
144 bbs = XNEWVEC (basic_block, n_basic_blocks);
145 copied_bbs = XNEWVEC (basic_block, n_basic_blocks);
H A Dtree-ssa-math-opts.c108 basic_block bb;
150 occ_new (basic_block bb, struct occurrence *children)
172 insert_bb (struct occurrence *new_occ, basic_block idom,
179 basic_block bb = new_occ->bb, occ_bb = occ->bb;
180 basic_block dom = nearest_common_dominator (CDI_DOMINATORS, occ_bb, bb);
231 register_division_in (basic_block bb)
254 basic_block dom = occ->bb;
258 basic_block bb;
351 basic_block bb = bb_for_stmt (use_stmt);
456 basic_block b
[all...]
H A Dtree-ssa-sink.c85 static basic_block
90 basic_block result = NULL;
215 static basic_block
219 basic_block commondom;
233 basic_block useblock;
269 statement_sink_location (tree stmt, basic_block frombb)
273 basic_block sinkbb;
350 basic_block commondom = nearest_common_dominator_of_uses (stmt);
422 sink_code_in_bb (basic_block bb)
424 basic_block so
[all...]
H A Dcfgcleanup.c62 static bool try_crossjump_bb (int, basic_block);
63 static bool outgoing_edges_match (int, basic_block, basic_block);
64 static int flow_find_cross_jump (int, basic_block, basic_block, rtx *, rtx *);
67 static void merge_blocks_move_predecessor_nojumps (basic_block, basic_block);
68 static void merge_blocks_move_successor_nojumps (basic_block, basic_block);
70 static bool try_simplify_condjump (basic_block);
[all...]
H A Dbb-reorder.c155 basic_block first, last;
170 static basic_block rotate_loop (edge, struct trace *, int);
171 static void mark_bb_visited (basic_block, int);
174 static basic_block copy_bb (basic_block, edge, basic_block, int);
175 static fibheapkey_t bb_to_key (basic_block);
176 static bool better_edge_p (basic_block, edge, int, int, int, int, edge);
178 static bool copy_bb_p (basic_block, int);
180 static bool push_to_next_round_p (basic_block, in
[all...]
H A Dtree-vectorizer.c157 (edge, struct loop *, bool, basic_block *, bitmap *);
159 (edge, struct loop *, bool, basic_block *);
160 static edge slpeel_add_loop_guard (basic_block, tree, basic_block, basic_block);
163 static void rename_variables_in_bb (basic_block);
220 rename_variables_in_bb (basic_block bb)
255 basic_block *bbs;
507 bool is_new_loop, basic_block *new_exit_bb,
513 basic_block new_merge_b
[all...]
H A Dpredict.c75 static void combine_predictions_for_insn (rtx, basic_block);
76 static void dump_prediction (FILE *, enum br_predictor, int, basic_block, int);
80 static void predict_paths_leading_to (basic_block, int *, enum br_predictor, enum prediction);
81 static bool last_basic_block_p (basic_block);
118 maybe_hot_bb_p (basic_block bb)
132 probably_cold_bb_p (basic_block bb)
145 probably_never_executed_bb_p (basic_block bb)
156 rtl_predicted_by_p (basic_block bb, enum br_predictor predictor)
172 tree_predicted_by_p (basic_block bb, enum br_predictor predictor)
350 basic_block b
[all...]
H A Ddomwalk.c143 walk_dominator_tree (struct dom_walk_data *walk_data, basic_block bb)
146 basic_block dest;
149 basic_block *worklist = XNEWVEC (basic_block, n_basic_blocks * 2);
H A Dtree-ssa-uncprop.c63 basic_block bb;
205 basic_block bb = label_to_block (CASE_LABEL (label));
310 static void uncprop_initialize_block (struct dom_walk_data *, basic_block);
311 static void uncprop_finalize_block (struct dom_walk_data *, basic_block);
312 static void uncprop_into_successor_phis (struct dom_walk_data *, basic_block);
389 basic_block bb;
454 basic_block bb ATTRIBUTE_UNUSED)
469 basic_block bb)
548 single_incoming_edge_ignoring_loop_edges (basic_block bb)
576 basic_block b
[all...]
H A Dddg.h28 /* For basic_block. */
117 basic_block bb;
171 ddg_ptr create_ddg (basic_block, struct df *, int closing_branch_deps);
H A Dlcm.c102 basic_block bb;
104 basic_block *worklist, *qin, *qout, *qend;
111 qin = qout = worklist = XNEWVEC (basic_block, n_basic_blocks);
187 basic_block pred, succ;
254 basic_block *worklist, *qin, *qout, *qend, bb;
264 = XNEWVEC (basic_block, n_basic_blocks);
358 basic_block bb;
366 basic_block b = INDEX_EDGE_SUCC_BB (edge_list, x);
481 basic_block *worklist, *qin, *qout, *qend, bb;
489 XNEWVEC (basic_block, n_basic_block
[all...]
H A Dcfglayout.c45 static rtx skip_insns_after_block (basic_block);
47 static rtx label_for_bb (basic_block);
83 skip_insns_after_block (basic_block bb)
168 label_for_bb (basic_block bb)
190 basic_block bb;
592 basic_block bb, prev_bb;
659 basic_block nb;
880 basic_block bb = NULL;
893 basic_block c = ENTRY_BLOCK_PTR->next_bb;
925 extern bool cfg_layout_can_duplicate_bb_p (basic_block);
[all...]
H A Dtree-ssa-threadupdate.c115 basic_block dup_block;
138 basic_block bb;
142 basic_block template_block;
171 remove_ctrl_stmt_and_useless_edges (basic_block bb, basic_block dest_bb)
204 create_block_for_threading (basic_block bb, struct redirection_data *rd)
398 prune_undesirable_thread_requests (basic_block bb)
660 redirection_block_p (basic_block bb)
712 thread_block (basic_block bb)
880 basic_block b
[all...]
H A Dprofile.c123 static basic_block find_group (basic_block);
124 static void union_groups (basic_block, basic_block);
138 basic_block bb;
234 basic_block bb;
267 basic_block bb;
681 gcov_position_t *offset, basic_block bb)
741 basic_block bb;
808 basic_block ne
[all...]
H A Dtree-ssa-loop-manip.c127 add_exit_phis_edge (basic_block exit, tree use)
130 basic_block def_bb = bb_for_stmt (def_stmt);
161 basic_block def_bb = bb_for_stmt (SSA_NAME_DEF_STMT (var));
202 basic_block bb;
225 find_uses_to_rename_use (basic_block bb, tree use, bitmap *use_blocks,
229 basic_block def_bb;
266 basic_block bb = bb_for_stmt (stmt);
278 find_uses_to_rename_bb (basic_block bb, bitmap *use_blocks, bitmap need_phis)
302 basic_block bb;
390 check_loop_closed_ssa_use (basic_block b
[all...]
H A Dtree-into-ssa.c365 basic_block bb, *worklist, *tos;
370 = (basic_block *) xmalloc (sizeof (basic_block) * (last_basic_block + 1));
389 basic_block pred = e->src;
411 initialize_flags_in_bb (basic_block bb)
437 mark_block_for_update (basic_block bb)
478 set_def_block (tree var, basic_block bb, bool phi_p)
513 set_livein_block (tree var, basic_block bb)
722 basic_block bb,
836 basic_block def_b
[all...]
H A Dbt-load.c53 basic_block bb;
79 basic_block bb;
113 static int basic_block_freq (basic_block);
119 static btr_def add_btr_def (fibheap_t, basic_block, int, rtx,
121 static btr_user new_btr_user (basic_block, int, rtx);
134 static void augment_live_range (bitmap, HARD_REG_SET *, basic_block,
135 basic_block, int);
139 static void move_btr_def (basic_block, int, btr_def, bitmap, HARD_REG_SET *);
142 static int can_move_up (basic_block, rtx, int);
182 basic_block_freq (basic_block b
[all...]
H A Difcvt.c71 #define NULL_BLOCK ((basic_block) NULL)
90 static int count_bb_insns (basic_block);
91 static bool cheap_bb_rtx_cost_p (basic_block, int);
92 static rtx first_active_insn (basic_block);
93 static rtx last_active_insn (basic_block, int);
94 static basic_block block_fallthru (basic_block);
103 static int find_cond_trap (basic_block, edge, edge);
104 static basic_block find_if_header (basic_block, in
[all...]
H A Ddf.h139 typedef void (*df_free_bb_function) (struct dataflow *, basic_block, void *);
152 typedef void (*df_confluence_function_0) (struct dataflow *, basic_block);
283 basic_block bb; /* Basic block containing the instruction. */
591 extern void df_bb_replace (struct df *, int, basic_block);
592 extern struct df_ref *df_bb_regno_last_use_find (struct df *, basic_block, unsigned int);
593 extern struct df_ref *df_bb_regno_first_def_find (struct df *, basic_block, unsigned int);
594 extern struct df_ref *df_bb_regno_last_def_find (struct df *, basic_block, unsigned int);
624 extern bitmap df_get_live_in (struct df *, basic_block);
625 extern bitmap df_get_live_out (struct df *, basic_block);
628 extern void df_print_bb_index (basic_block b
[all...]
H A Dloop-doloop.c158 basic_block *body = get_loop_body (loop), bb;
232 add_test (rtx cond, edge *e, basic_block dest)
238 basic_block bb;
300 basic_block loop_end = desc->out_edge->src;
373 basic_block preheader = loop_preheader_edge (loop)->src;
374 basic_block set_zero
376 basic_block new_preheader
H A Dtree-tailcall.c104 basic_block call_block;
127 static void find_tail_calls (basic_block, struct tailcall **);
202 basic_block bb, call_bb, at_bb;
361 basic_block dest = e->dest;
375 find_tail_calls (basic_block bb, struct tailcall **ret)
383 basic_block abb;
616 adjust_return_value (basic_block bb, tree m, tree a)
673 decrease_profile (basic_block bb, gcov_type count, int frequency)
719 basic_block bb, first;
875 basic_block firs
[all...]
H A Dglobal.c678 basic_block b;
1779 basic_block bb;
1859 basic_block b = ENTRY_BLOCK_PTR->next_bb;
2089 basic_block bb;
2128 basic_block bb = data;
2250 basic_block bb = data;
2291 basic_block bb;
2332 basic_block b1 = *(basic_block *) bb1, b2 = *(basic_block *) bb
[all...]
/freebsd-11-stable/contrib/elftoolchain/libdwarf/
H A Dlibdwarf_lineno.c105 int is_stmt, basic_block, end_sequence; local
115 basic_block = 0; \
133 ln->ln_bblock = basic_block; \
194 basic_block = 0;
213 basic_block = 1;
242 basic_block = 0;
492 int is_stmt, basic_block; local
503 basic_block = 0; \
544 * basic_block changes.
560 if (ln->ln_bblock && !basic_block) {
[all...]

Completed in 368 milliseconds

1234567