Searched refs:last_basic_block (Results 1 - 25 of 48) sorted by relevance

12

/freebsd-9.3-release/contrib/gcc/
H A Dlcm.c115 sbitmap_vector_ones (antin, last_basic_block);
340 sbitmap_ones (laterin[last_basic_block]);
342 sbitmap_a_and_b (laterin[last_basic_block],
343 laterin[last_basic_block],
369 sbitmap_difference (insert[x], later[x], laterin[last_basic_block]);
399 dump_sbitmap_vector (dump_file, "transp", "", transp, last_basic_block);
400 dump_sbitmap_vector (dump_file, "antloc", "", antloc, last_basic_block);
401 dump_sbitmap_vector (dump_file, "avloc", "", avloc, last_basic_block);
402 dump_sbitmap_vector (dump_file, "kill", "", kill, last_basic_block);
407 avin = sbitmap_vector_alloc (last_basic_block, n_expr
[all...]
H A Dmode-switching.c420 = XCNEWVEC (struct bb_info, last_basic_block + entry_exit_extra);
438 antic = sbitmap_vector_alloc (last_basic_block, n_entities);
439 transp = sbitmap_vector_alloc (last_basic_block, n_entities);
440 comp = sbitmap_vector_alloc (last_basic_block, n_entities);
442 sbitmap_vector_ones (transp, last_basic_block);
542 kill = sbitmap_vector_alloc (last_basic_block, n_entities);
550 sbitmap_vector_zero (antic, last_basic_block);
551 sbitmap_vector_zero (comp, last_basic_block);
H A Dcfganal.c172 pre = XCNEWVEC (int, last_basic_block);
173 post = XCNEWVEC (int, last_basic_block);
180 visited = sbitmap_alloc (last_basic_block);
672 visited = sbitmap_alloc (last_basic_block);
761 visited = sbitmap_alloc (last_basic_block);
874 data->visited_blocks = sbitmap_alloc (last_basic_block);
959 size = last_basic_block;
H A Dgcse.c743 modify_mem_list = gcalloc (last_basic_block, sizeof (rtx));
744 canon_modify_mem_list = gcalloc (last_basic_block, sizeof (rtx));
962 reg_set_in_block = sbitmap_vector_alloc (last_basic_block, max_gcse_regno);
965 modify_mem_list = gcalloc (last_basic_block, sizeof (rtx));
966 canon_modify_mem_list = gcalloc (last_basic_block, sizeof (rtx));
1025 sbitmap_vector_zero (transp, last_basic_block);
1027 sbitmap_vector_ones (transp, last_basic_block);
1031 sbitmap_vector_zero (comp, last_basic_block);
1033 sbitmap_vector_zero (antloc, last_basic_block);
2047 sbitmap_vector_zero (reg_set_in_block, last_basic_block);
[all...]
H A Dcfgloopanal.c265 #define LOOP_REPR(LOOP) ((LOOP)->num + last_basic_block)
276 int *queue1 = XNEWVEC (int, last_basic_block + loops->num);
277 int *queue2 = XNEWVEC (int, last_basic_block + loops->num);
290 g = new_graph (last_basic_block + loops->num);
H A Ddf-core.c637 sbitmap visited = sbitmap_alloc (last_basic_block);
638 sbitmap pending = sbitmap_alloc (last_basic_block);
639 sbitmap considered = sbitmap_alloc (last_basic_block);
789 int *postorder = XNEWVEC (int, last_basic_block);
879 int size = last_basic_block *sizeof (void *);
901 (last_basic_block - i) *sizeof (void *));
905 for (i = NUM_FIXED_BLOCKS; i < last_basic_block; i++)
927 for (; i < last_basic_block; i++)
H A Dtree-ssa-dce.c838 control_dependence_map = XNEWVEC (bitmap, last_basic_block);
839 for (i = 0; i < last_basic_block; ++i)
842 last_stmt_necessary = sbitmap_alloc (last_basic_block);
862 for (i = 0; i < last_basic_block; ++i)
906 visited_control_parents = sbitmap_alloc (last_basic_block);
H A Dsched-rgn.c538 max_hdr = XNEWVEC (int, last_basic_block);
539 dfs_nr = XCNEWVEC (int, last_basic_block);
542 inner = sbitmap_alloc (last_basic_block);
545 header = sbitmap_alloc (last_basic_block);
548 in_queue = sbitmap_alloc (last_basic_block);
551 in_stack = sbitmap_alloc (last_basic_block);
554 for (i = 0; i < last_basic_block; i++)
695 degree1 = xmalloc (last_basic_block * sizeof (int));
696 extended_rgn_header = sbitmap_alloc (last_basic_block);
750 memcpy (degree1, degree, last_basic_block * sizeo
[all...]
H A Dtree-into-ssa.c370 = (basic_block *) xmalloc (sizeof (basic_block) * (last_basic_block + 1));
1040 gcc_assert (bb_index < (unsigned) last_basic_block);
1105 VEC_reserve (tree_vec, heap, phis_to_rewrite, last_basic_block + 1);
2097 interesting_blocks = sbitmap_alloc (last_basic_block);
2101 dfs = (bitmap *) xmalloc (last_basic_block * sizeof (bitmap));
2361 gcc_assert (bb->index < last_basic_block);
2964 phis_to_rewrite = VEC_alloc (tree_vec, heap, last_basic_block);
3058 dfs = XNEWVEC (bitmap, last_basic_block);
3105 tmp = sbitmap_alloc (last_basic_block);
3128 fprintf (dump_file, "Number of blocks in CFG: %d\n", last_basic_block);
[all...]
H A Dtracer.c202 fibnode_t *blocks = XCNEWVEC (fibnode_t, last_basic_block);
204 int *counts = XNEWVEC (int, last_basic_block);
H A Ddominance.c165 init_ar (di->dfs_order, TBB, (unsigned int) last_basic_block + 1, 0);
280 my_i = di->dfs_order[last_basic_block];
318 di->dfs_order[last_basic_block] = di->dfsnum;
350 di->dfs_parent[di->dfsnum] = di->dfs_order[last_basic_block];
364 di->dfs_parent[di->dfsnum] = di->dfs_order[last_basic_block];
525 k1 = di->dfs_order[last_basic_block];
H A Dcfgbuild.c264 edge_cache = sbitmap_alloc (last_basic_block);
510 gcc_assert (last_basic_block == n_basic_blocks);
541 last_basic_block = NUM_FIXED_BLOCKS;
H A Dsched-ebb.c632 large_region_blocks = sbitmap_alloc (last_basic_block);
637 blocks = sbitmap_alloc (last_basic_block);
H A Dtree-ssa-loop-manip.c571 for (i = first_new_block; i < (unsigned) last_basic_block; i++)
574 for (i = first_new_block; i < (unsigned) last_basic_block; i++)
577 for (i = first_new_block; i < (unsigned) last_basic_block; i++)
609 first_new_block = last_basic_block;
H A Dcfghooks.c80 last_visited = XCNEWVEC (basic_block, last_basic_block);
81 edge_checksum = XCNEWVEC (size_t, last_basic_block);
H A Dtree-ssa-propagate.c472 executable_blocks = sbitmap_alloc (last_basic_block);
475 bb_in_list = sbitmap_alloc (last_basic_block);
H A Dpredict.c1253 heads = XNEWVEC (int, last_basic_block);
1254 memset (heads, ENTRY_BLOCK, sizeof (int) * last_basic_block);
1255 heads[ENTRY_BLOCK_PTR->next_bb->index] = last_basic_block;
1517 if (y == last_basic_block)
H A Dtree-ssa-loop-im.c701 old_last_basic_block = last_basic_block;
703 for (i = old_last_basic_block; i < (unsigned) last_basic_block; i++)
1504 sbitmap contains_call = sbitmap_alloc (last_basic_block);
H A Dcfgrtl.c305 bb->index = last_basic_block++;
331 if ((size_t) last_basic_block >= VEC_length (basic_block, basic_block_info))
334 size_t new_size = last_basic_block + (last_basic_block + 3) / 4;
1531 blocks = sbitmap_alloc (last_basic_block);
1577 blocks = sbitmap_alloc (last_basic_block);
2768 int last_bb = last_basic_block;
H A Dtree-cfg.c133 last_basic_block = NUM_FIXED_BLOCKS;
389 bb->index = last_basic_block;
397 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info))
400 size_t new_size = last_basic_block + (last_basic_block + 3) / 4;
408 SET_BASIC_BLOCK (last_basic_block, bb);
411 last_basic_block++;
959 label_for_bb = XCNEWVEC (tree, last_basic_block);
2310 n_basic_blocks, n_edges, last_basic_block);
5305 int last_bb = last_basic_block;
[all...]
H A Dcfgloopmanip.c160 in_queue = sbitmap_alloc (last_basic_block);
286 seen = sbitmap_alloc (last_basic_block);
473 seen = sbitmap_alloc (last_basic_block);
H A Dbb-reorder.c776 if (new_bb->index >= array_size || last_basic_block > array_size)
781 new_size = MAX (last_basic_block, new_bb->index + 1);
1915 array_size = GET_ARRAY_SIZE (last_basic_block);
2172 int max_edges = 2 * last_basic_block;
H A Dtree-ssa-live.c523 live->num_blocks = last_basic_block;
713 stack = XNEWVEC (int, last_basic_block);
824 on_exit = (bitmap *)xmalloc (last_basic_block * sizeof (bitmap));
825 for (x = 0; x < (unsigned)last_basic_block; x++)
H A Dcfg.c184 for (; i < last_basic_block; i++)
187 last_basic_block = n_basic_blocks;
H A Dcfgloop.c627 headers = sbitmap_alloc (last_basic_block);
1152 irreds = sbitmap_alloc (last_basic_block);

Completed in 392 milliseconds

12