Lines Matching refs:complexity
160 unsigned complexity; /* The estimate of the complexity of the code for member
2617 new_cost (unsigned runtime, unsigned complexity) in new_cost() argument
2622 cost.complexity = complexity; in new_cost()
2633 cost1.complexity += cost2.complexity; in add_costs()
2643 cost1.complexity -= cost2.complexity; in sub_costs()
2655 return cost1.complexity - cost2.complexity; in compare_costs()
3246 unsigned cost, acost, complexity; in get_address_cost() local
3500 complexity = (symbol_present != 0) + (var_present != 0) + offset_p + ratio_p; in get_address_cost()
3501 return new_cost (cost + acost, complexity); in get_address_cost()
4207 cost.complexity++; in get_computation_cost_at()
5018 use->cost_map[j].cost.complexity); in determine_use_iv_costs()
5587 fprintf (file, " cost: %d (complexity %d)\n", cost.cost, cost.complexity); in iv_ca_dump()
5589 ivs->cand_cost, ivs->cand_use_cost.cost, ivs->cand_use_cost.complexity); in iv_ca_dump()
5598 use->id, cp->cand->id, cp->cost.cost, cp->cost.complexity); in iv_ca_dump()
6053 origcost.cost, origcost.complexity); in find_optimal_iv_set()
6055 cost.cost, cost.complexity); in find_optimal_iv_set()