H A D | tree-ssa-loop-ivopts.c | 44 -- The use costs. Each of the interesting uses chooses the best induction 57 4) The trees are transformed to use the new variables, the dead code is 96 /* The expected number of loop iterations. TODO -- use profiling instead of 109 bool have_use_for; /* Do we already have a use for it? */ 110 unsigned use_id; /* The identifier in the use if it is the case. */ 147 unsigned id; /* The id of the use. */ 148 enum use_type type; /* Type of the use. */ 234 use. */ 248 /* Candidate assigned to a use, together with the related costs. */ 280 /* Changed use 281 struct iv_use *use; member in struct:iv_ca_delta 412 dump_use(FILE *file, struct iv_use *use) argument 459 struct iv_use *use; local 1140 struct iv_use *use = XCNEW (struct iv_use); local 1196 struct iv_use *use; local 1976 add_candidate_1(struct ivopts_data *data, tree base, tree step, bool important, enum iv_position pos, struct iv_use *use, tree incremented_at) argument 2107 add_candidate(struct ivopts_data *data, tree base, tree step, bool important, struct iv_use *use) argument 2191 add_iv_value_candidates(struct ivopts_data *data, struct iv *iv, struct iv_use *use) argument 2220 struct iv_use *use = iv_use (data, i); local 2247 struct iv_use *use; local 2308 struct iv_use *use = iv_use (data, i); local 2336 set_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, unsigned cost, bitmap depends_on, tree value) argument 2378 get_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 3031 get_computation_aff(struct loop *loop, struct iv_use *use, struct iv_cand *cand, tree at, struct affine_tree_combination *aff) argument 3198 get_computation_at(struct loop *loop, struct iv_use *use, struct iv_cand *cand, tree at) argument 3214 get_computation(struct loop *loop, struct iv_use *use, struct iv_cand *cand) argument 3846 get_computation_cost_at(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, bool address_p, bitmap *depends_on, tree at) argument 4011 get_computation_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, bool address_p, bitmap *depends_on) argument 4023 determine_use_iv_cost_generic(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 4049 determine_use_iv_cost_address(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 4114 iv_elimination_compare(struct ivopts_data *data, struct iv_use *use) argument 4132 may_eliminate_iv(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, tree *bound) argument 4191 determine_use_iv_cost_condition(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 4240 determine_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 4265 struct iv_use *use; local 4543 iv_ca_set_no_cp(struct ivopts_data *data, struct iv_ca *ivs, struct iv_use *use) argument 4598 iv_ca_set_cp(struct ivopts_data *data, struct iv_ca *ivs, struct iv_use *use, struct cost_pair *cp) argument 4638 iv_ca_add_use(struct ivopts_data *data, struct iv_ca *ivs, struct iv_use *use) argument 4696 iv_ca_delta_add(struct iv_use *use, struct cost_pair *old_cp, struct cost_pair *new_cp, struct iv_ca_delta *next_change) argument 4733 iv_ca_cand_for_use(struct iv_ca *ivs, struct iv_use *use) argument 4882 struct iv_use *use; local 4925 struct iv_use *use; local 5054 try_add_cand_for(struct ivopts_data *data, struct iv_ca *ivs, struct iv_use *use) argument 5235 struct iv_use *use; local 5360 rewrite_use_nonlinear_expr(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 5585 rewrite_use_address(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 5604 rewrite_use_compare(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 5652 rewrite_use(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 5682 struct iv_use *use; local 5744 struct iv_use *use = iv_use (data, i); local [all...] |