Home
last modified time | relevance | path

Searched refs:bitmap_count_bits (Results 1 – 25 of 29) sorted by relevance

12

/dragonfly/contrib/gcc-8.0/gcc/
H A Dsbitmap.h258 extern unsigned int bitmap_count_bits (const_sbitmap);
H A Dbitmap.c690 bitmap_count_bits (const_bitmap a) in bitmap_count_bits() function
2192 ASSERT_EQ (5, bitmap_count_bits (b)); in test_set_range()
2210 ASSERT_EQ (100, bitmap_count_bits (b)); in test_clear_bit_in_middle()
2215 ASSERT_EQ (99, bitmap_count_bits (b)); in test_clear_bit_in_middle()
H A Dbitmap.h281 extern unsigned long bitmap_count_bits (const_bitmap);
H A Dtree-ssa-coalesce.c400 p->conflict_count = bitmap_count_bits (conflicts->conflicts[p1]); in initialize_conflict_count()
402 p->conflict_count = bitmap_count_bits (conflicts->conflicts[p2]); in initialize_conflict_count()
H A Dsbitmap.c407 bitmap_count_bits (const_sbitmap bmap) in bitmap_count_bits() function
H A Dlto-cgraph.c1996 streamer_write_uhwi (ob, bitmap_count_bits (node->clone.args_to_skip)); in output_node_opt_summary()
2004 streamer_write_uhwi (ob, bitmap_count_bits (node->clone.combined_args_to_skip)); in output_node_opt_summary()
H A Dtree-ssa-live.c214 count = bitmap_count_bits (selected); in partition_view_fini()
H A Ddse.c2814 (int)bitmap_count_bits (group->store2_n), in dse_step2_init()
2815 (int)bitmap_count_bits (group->store2_p)); in dse_step2_init()
H A Dtree-ssa-tail-merge.c709 if (bitmap_count_bits (same->bbs) < 2) in add_to_worklist()
H A Dipa-split.c603 if (num_args != bitmap_count_bits (current->ssa_names_to_pass)) in consider_split()
H A Dtree-ssa-pre.c744 result.create (bitmap_count_bits (&set->expressions)); in sorted_array_from_bitmap_set()
2234 && bitmap_count_bits (&PA_IN (single_succ (block))->values) > max_pa) in compute_partial_antic_aux()
H A Dtree-ssa-loop-ivopts.c3578 s = bitmap_count_bits (group->related_cands); in alloc_use_cost_map()
5214 if (inv_vars_elim && bitmap_count_bits (inv_vars_elim) > 1) in determine_group_iv_cost_cond()
6831 fprintf (dump_file, ", %lu IVs:\n", bitmap_count_bits (set->cands)); in create_new_ivs()
H A Dtree-into-ssa.c795 n_defs = bitmap_count_bits (to_remove); in prune_unused_phi_nodes()
H A Dtree-loop-distribution.c2300 if (bitmap_count_bits (sccs_to_merge) != (unsigned) num_sccs) in break_alias_scc_partitions()
/dragonfly/contrib/gcc-4.7/gcc/
H A Dbitmap.h113 extern unsigned long bitmap_count_bits (const_bitmap);
H A Ddf-problems.c634 fprintf (file, ";; rd in \t(%d)\n", (int) bitmap_count_bits (&bb_info->in)); in df_rd_top_dump()
636 fprintf (file, ";; rd gen \t(%d)\n", (int) bitmap_count_bits (&bb_info->gen)); in df_rd_top_dump()
638 fprintf (file, ";; rd kill\t(%d)\n", (int) bitmap_count_bits (&bb_info->kill)); in df_rd_top_dump()
652 fprintf (file, ";; rd out \t(%d)\n", (int) bitmap_count_bits (&bb_info->out)); in df_rd_bottom_dump()
H A Dlto-cgraph.c1544 streamer_write_uhwi (ob, bitmap_count_bits (node->clone.args_to_skip)); in output_node_opt_summary()
1552 streamer_write_uhwi (ob, bitmap_count_bits (node->clone.combined_args_to_skip)); in output_node_opt_summary()
H A Dtree-loop-distribution.c1000 if (bitmap_count_bits (partition) > 0) in rdg_build_partitions()
H A Dtree-ssa-live.c271 count = bitmap_count_bits (selected); in partition_view_fini()
H A Dipa-split.c477 if (num_args != bitmap_count_bits (current->ssa_names_to_pass)) in consider_split()
H A Dtree-ssa-tail-merge.c636 if (bitmap_count_bits (same->bbs) < 2) in add_to_worklist()
H A Ddse.c2975 (int)bitmap_count_bits (group->store2_n), in dse_step2_init()
2976 (int)bitmap_count_bits (group->store2_p)); in dse_step2_init()
H A Dbitmap.c713 bitmap_count_bits (const_bitmap a) in bitmap_count_bits() function
H A Dtree-ssa-pre.c712 result = VEC_alloc (pre_expr, heap, bitmap_count_bits (&set->values)); in VEC()
2398 && bitmap_count_bits (&PA_IN (single_succ (block))->values) > max_pa) in compute_partial_antic_aux()
H A Dtree-into-ssa.c884 n_defs = bitmap_count_bits (to_remove); in prune_unused_phi_nodes()

12