/freebsd-9.3-release/contrib/gcc/ |
H A D | tree-ssa-loop-unswitch.c | 182 basic_block *bbs; local 214 bbs = get_loop_body (loop); 220 if ((cond = tree_may_unswitch_on (bbs[i], loop))) 225 free (bbs); 230 stmt = last_stmt (bbs[i]); 255 nloop = tree_unswitch_loop (loops, loop, bbs[i], cond); 259 free (bbs); 270 free (bbs);
|
H A D | tree-ssa-loop-ch.c | 131 basic_block *bbs, *copied_bbs; local 144 bbs = XNEWVEC (basic_block, n_basic_blocks); 181 bbs[n_bbs++] = header; 201 if (!tree_duplicate_sese_region (entry, exit, bbs, n_bbs, copied_bbs)) 234 free (bbs);
|
H A D | cfgloopmanip.c | 64 remove_bbs (basic_block *bbs, int nbbs) argument 70 remove_bb_from_loops (bbs[i]); 71 delete_basic_block (bbs[i]); 82 find_path (edge e, basic_block **bbs) argument 86 /* Find bbs in the path. */ 87 *bbs = XCNEWVEC (basic_block, n_basic_blocks); 88 return dfs_enumerate_from (e->dest, 0, rpe_enum_p, *bbs, 371 basic_block *bbs; local 379 bbs = XCNEWVEC (basic_block, n_basic_blocks); 381 bbs, n_basic_block 394 basic_block *bbs; local 740 basic_block *bbs = get_loop_body (loop); local 752 update_single_exits_after_duplication(basic_block *bbs, unsigned nbbs, struct loop *loop) argument 793 basic_block *new_bbs, *bbs, *first_active; local 1367 basic_block *bbs = get_loop_body_in_dom_order (nloop), after; local [all...] |
H A D | cfg.c | 954 scale_bbs_frequencies_int (basic_block *bbs, int nbbs, int num, int den) 968 bbs[i]->frequency = RDIV (bbs[i]->frequency * num, den); 969 bbs[i]->count = RDIV (bbs[i]->count * num, den); 970 FOR_EACH_EDGE (e, ei, bbs[i]->succs) 983 scale_bbs_frequencies_gcov_type (basic_block *bbs, int nbbs, gcov_type num, 996 bbs[i]->frequency = RDIV (bbs[i]->frequency * num, den); 997 if (bbs[ 946 scale_bbs_frequencies_int(basic_block *bbs, int nbbs, int num, int den) argument 975 scale_bbs_frequencies_gcov_type(basic_block *bbs, int nbbs, gcov_type num, gcov_type den) argument [all...] |
H A D | loop-unswitch.c | 265 basic_block *bbs; local 326 bbs = get_loop_body (loop); 329 if ((cond = may_unswitch_on (bbs[i], loop, &cinsn))) 334 free (bbs); 353 e = FALLTHRU_EDGE (bbs[i]); 355 free (bbs); 361 e = BRANCH_EDGE (bbs[i]); 363 free (bbs); 379 nloop = unswitch_loop (loops, loop, bbs[i], cond, cinsn); 390 free (bbs); [all...] |
H A D | cfgloopanal.c | 364 basic_block *bbs, bb; local 368 bbs = get_loop_body (loop); 371 bb = bbs[i]; 377 free(bbs); 386 basic_block *bbs, bb; local 391 bbs = get_loop_body (loop); 394 bb = bbs[i]; 406 free(bbs);
|
H A D | tree-vectorizer.c | 255 basic_block *bbs; 257 bbs = get_loop_body (loop); 260 rename_variables_in_bb (bbs[i]); 262 free (bbs); 832 basic_block *new_bbs, *bbs; 842 bbs = get_loop_body (loop); 845 if (!can_copy_bbs_p (bbs, loop->num_nodes)) 847 free (bbs); 855 free (bbs); 866 copy_bbs (bbs, loo 254 basic_block *bbs; local 831 basic_block *new_bbs, *bbs; local 1388 basic_block *bbs; local 1444 basic_block *bbs; local [all...] |
H A D | cfgloop.c | 125 basic_block *bbs; 140 bbs = get_loop_body (loop); 142 fprintf (file, " %d", bbs[i]->index); 143 free (bbs); 1019 basic_block *bbs; 1025 bbs = get_loop_body (loop); 1027 bbs[i]->loop_father = loop->outer; 1060 basic_block *bbs, bb; 1092 bbs = get_loop_body (loop); 1095 if (!flow_bb_inside_loop_p (loop, bbs[ 124 basic_block *bbs; local 1018 basic_block *bbs; local 1059 basic_block *bbs, bb; local [all...] |
H A D | dominance.c | 714 get_dominated_by (enum cdi_direction dir, basic_block bb, basic_block **bbs) argument 723 *bbs = NULL; 730 *bbs = XNEWVEC (basic_block, n); 731 (*bbs)[0] = son->data; 733 (*bbs)[n++] = ason->data; 1018 iterate_fix_dominators (enum cdi_direction dir, basic_block *bbs, int n) argument 1026 set_immediate_dominator (dir, bbs[i], NULL); 1033 old_dom = get_immediate_dominator (dir, bbs[i]); 1034 new_dom = recount_dominator (dir, bbs[i]); 1038 set_immediate_dominator (dir, bbs[ [all...] |
H A D | cfglayout.c | 1173 can_copy_bbs_p (basic_block *bbs, unsigned n) 1180 bbs[i]->flags |= BB_DUPLICATED; 1186 FOR_EACH_EDGE (e, ei, bbs[i]->succs) 1194 if (!can_duplicate_block_p (bbs[i])) 1203 bbs[i]->flags &= ~BB_DUPLICATED; 1212 function assigns bbs into loops (copy of basic block bb is assigned to 1227 copy_bbs (basic_block *bbs, unsigned n, basic_block *new_bbs, 1235 /* Duplicate bbs, update dominators, assign bbs to loops. */ 1239 bb = bbs[ 1163 can_copy_bbs_p(basic_block *bbs, unsigned n) argument 1217 copy_bbs(basic_block *bbs, unsigned n, basic_block *new_bbs, edge *edges, unsigned num_edges, edge *new_edges, struct loop *base, basic_block after) argument [all...] |
H A D | tree-vectorizer.h | 94 basic_block *bbs; member in struct:_loop_vec_info 140 #define LOOP_VINFO_BBS(L) (L)->bbs
|
H A D | lambda-code.c | 2075 basic_block *bbs; local 2081 bbs = get_loop_body (loop); 2085 if (bbs[i]->loop_father == loop) 2088 for (bsi = bsi_start (bbs[i]); !bsi_end_p (bsi); bsi_next (&bsi)) 2095 free (bbs); 2100 free (bbs); 2282 basic_block *bbs; local 2292 bbs = get_loop_body (loop); 2296 if (bbs[i]->loop_father == loop) 2298 for (bsi = bsi_start (bbs[ 2449 basic_block *bbs; local [all...] |
H A D | predict.c | 645 basic_block bb, *bbs; local 715 bbs = get_loop_body (loop); 723 bb = bbs[j]; 776 free (bbs); 1705 basic_block *bbs; 1718 bbs = get_loop_body (loop); 1720 bitmap_set_bit (tovisit, bbs[i]->index); 1721 free (bbs); 1699 basic_block *bbs; local
|
H A D | tree-vect-patterns.c | 612 basic_block *bbs = LOOP_VINFO_BBS (loop_vinfo); local 626 basic_block bb = bbs[i];
|
H A D | global.c | 2355 VEC(basic_block,heap) *bbs, *new_bbs, *temp; 2359 bbs = VEC_alloc (basic_block, heap, n_basic_blocks); 2364 VEC_quick_push (basic_block, bbs, bb); 2367 while (VEC_length (basic_block, bbs)) 2369 bb_array = VEC_address (basic_block, bbs); 2370 nel = VEC_length (basic_block, bbs); 2409 temp = bbs; 2410 bbs = new_bbs; 2417 VEC_free (basic_block, heap, bbs);
|
H A D | tree-vect-analyze.c | 99 basic_block *bbs = LOOP_VINFO_BBS (loop_vinfo); local 111 basic_block bb = bbs[i]; 232 basic_block *bbs = LOOP_VINFO_BBS (loop_vinfo); local 250 basic_block bb = bbs[i]; 354 } /* bbs */ 1612 basic_block *bbs = LOOP_VINFO_BBS (loop_vinfo); local 1648 bb = bbs[i];
|
H A D | tree-ssa-loop-im.c | 1438 basic_block bb = NULL, *bbs, last = NULL; local 1445 bbs = get_loop_body_in_dom_order (loop); 1450 bb = bbs[i]; 1491 free (bbs);
|
H A D | tree-ssa-reassoc.c | 1420 int *bbs = XNEWVEC (int, last_basic_block + 1); local 1429 pre_and_rev_post_order_compute (NULL, bbs, false); 1457 bb_rank[bbs[i]] = ++rank << 16; 1459 free (bbs);
|
H A D | modulo-sched.c | 786 basic_block *bbs = get_loop_body (loop); 793 if (bbs[i] == loop->header) 798 get_ebb_head_tail (bbs[i], bbs[i], &head, &tail); 810 free (bbs); 814 free (bbs); 783 basic_block *bbs = get_loop_body (loop); local
|
H A D | tree-ssa-loop-niter.c | 1741 basic_block bb, *bbs; local 1744 bbs = get_loop_body (loop); 1748 bb = bbs[i]; 1845 free (bbs);
|
H A D | tree-cfg.c | 4860 VEC(basic_block,heap) *bbs; 4882 bbs = NULL; 4883 VEC_safe_push (basic_block, heap, bbs, entry_bb); 4884 gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs); 4935 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); i++) 4950 gcc_assert (VEC_length (basic_block, bbs) >= 2); 4953 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); i++) 5021 VEC_free (basic_block, heap, bbs);
|
H A D | tree-data-ref.c | 4107 basic_block bb, *bbs; 4112 bbs = get_loop_body (loop); 4116 bb = bbs[i]; 4219 free (bbs); 4230 free (bbs); 4103 basic_block bb, *bbs; local
|
H A D | tree-vect-transform.c | 2971 basic_block *bbs = LOOP_VINFO_BBS (loop_vinfo); local 3080 basic_block bb = bbs[i];
|
/freebsd-9.3-release/sys/gnu/fs/xfs/ |
H A D | xfs_fs.h | 523 #define BBTOB(bbs) ((bbs) << BBSHIFT)
|
H A D | xfs_log_recover.c | 69 #define XLOG_SECTOR_ROUNDUP_BBCOUNT(log, bbs) \ 70 ( ((log)->l_sectbb_mask && (bbs & (log)->l_sectbb_mask)) ? \ 71 ((bbs + (log)->l_sectbb_mask + 1) & ~(log)->l_sectbb_mask) : (bbs) )
|