diff options
Diffstat (limited to 'gcc/tree-ssa-loop-ivopts.c')
| -rw-r--r-- | gcc/tree-ssa-loop-ivopts.c | 28 |
1 files changed, 14 insertions, 14 deletions
diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c index 19cc1d7ca2c..69a0fe701cf 100644 --- a/gcc/tree-ssa-loop-ivopts.c +++ b/gcc/tree-ssa-loop-ivopts.c @@ -966,7 +966,7 @@ set_iv (struct ivopts_data *data, tree iv, tree base, tree step) gcc_assert (!info->iv); - bitmap_set_bit (data->relevant, SSA_NAME_VERSION (iv)); + data->relevant->set_bit (SSA_NAME_VERSION (iv)); info->iv = alloc_iv (base, step); info->iv->ssa_name = iv; } @@ -1263,7 +1263,7 @@ record_invariant (struct ivopts_data *data, tree op, bool nonlinear_use) info->has_nonlin_use |= nonlinear_use; if (!info->inv_id) info->inv_id = ++data->max_inv_id; - bitmap_set_bit (data->relevant, SSA_NAME_VERSION (op)); + data->relevant->set_bit (SSA_NAME_VERSION (op)); } /* Checks whether the use OP is interesting and if so, records it. */ @@ -2255,7 +2255,7 @@ find_depends (tree *expr_p, int *ws ATTRIBUTE_UNUSED, void *data) if (!*depends_on) *depends_on = BITMAP_ALLOC (NULL); - bitmap_set_bit (*depends_on, info->inv_id); + (*depends_on)->set_bit (info->inv_id); return NULL_TREE; } @@ -2363,7 +2363,7 @@ add_candidate_1 (struct ivopts_data *data, if (use) { - bitmap_set_bit (use->related_cands, i); + use->related_cands->set_bit (i); if (dump_file && (dump_flags & TDF_DETAILS)) fprintf (dump_file, "Candidate %d is related to use %d\n", cand->id, use->id); @@ -2613,7 +2613,7 @@ record_important_candidates (struct ivopts_data *data) struct iv_cand *cand = iv_cand (data, i); if (cand->important) - bitmap_set_bit (data->important_candidates, i); + data->important_candidates->set_bit (i); } data->consider_all_candidates = (n_iv_cands (data) @@ -4163,7 +4163,7 @@ get_computation_cost_at (struct ivopts_data *data, get_loop_invariant_expr_id (data, ubase, cbase, ratio, address_p); /* Clear depends on. */ if (*inv_expr_id != -1 && depends_on && *depends_on) - bitmap_clear (*depends_on); + (*depends_on)->clear (); } /* If we are after the increment, the value of the candidate is higher by @@ -4784,7 +4784,7 @@ determine_use_iv_cost_condition (struct ivopts_data *data, if (depends_on_elim && bitmap_count_bits (depends_on_elim) > 1) { elim_inv_expr_id = get_expr_id (data, bound); - bitmap_clear (depends_on_elim); + depends_on_elim->clear (); } /* The bound is a loop invariant, so it will be only computed once. */ @@ -4994,13 +4994,13 @@ determine_use_iv_costs (struct ivopts_data *data) { cand = iv_cand (data, j); if (!determine_use_iv_cost (data, use, cand)) - bitmap_set_bit (&to_clear, j); + to_clear.set_bit (j); } /* Remove the candidates for that the cost is infinite from the list of related candidates. */ bitmap_and_compl_into (use->related_cands, &to_clear); - bitmap_clear (&to_clear); + to_clear.clear (); } } @@ -5273,7 +5273,7 @@ iv_ca_set_no_cp (struct ivopts_data *data, struct iv_ca *ivs, if (ivs->n_cand_uses[cid] == 0) { - bitmap_clear_bit (ivs->cands, cid); + ivs->cands->set_bit (cid); /* Do not count the pseudocandidates. */ if (cp->cand->iv) ivs->n_regs--; @@ -5338,7 +5338,7 @@ iv_ca_set_cp (struct ivopts_data *data, struct iv_ca *ivs, ivs->n_cand_uses[cid]++; if (ivs->n_cand_uses[cid] == 1) { - bitmap_set_bit (ivs->cands, cid); + ivs->cands->set_bit (cid); /* Do not count the pseudocandidates. */ if (cp->cand->iv) ivs->n_regs++; @@ -6506,7 +6506,7 @@ remove_unused_ivs (struct ivopts_data *data) && !info->iv->have_use_for && !info->preserve_biv) { - bitmap_set_bit (&toremove, SSA_NAME_VERSION (info->iv->ssa_name)); + toremove.set_bit (SSA_NAME_VERSION (info->iv->ssa_name)); tree def = info->iv->ssa_name; @@ -6655,8 +6655,8 @@ free_loop_data (struct ivopts_data *data) info->preserve_biv = false; info->inv_id = 0; } - bitmap_clear (data->relevant); - bitmap_clear (data->important_candidates); + data->relevant->clear (); + data->important_candidates->clear (); for (i = 0; i < n_iv_uses (data); i++) { |