Lines Matching refs:complexity
180 comp_cost (): cost (0), complexity (0), scratch (0) in comp_cost()
183 comp_cost (int cost, unsigned complexity, int scratch = 0)
184 : cost (cost), complexity (complexity), scratch (scratch) in cost()
224 unsigned complexity; /* The estimate of the complexity of the code for member
247 cost1.complexity += cost2.complexity;
261 cost1.complexity -= cost2.complexity;
328 return cost1.complexity < cost2.complexity;
337 && cost1.complexity == cost2.complexity;
4526 cost.complexity += 1; in get_address_cost()
4530 cost.complexity += 1; in get_address_cost()
4532 cost.complexity += 1; in get_address_cost()
4534 cost.complexity += 1; in get_address_cost()
5528 group->cost_map[j].cost.complexity); in determine_group_iv_costs()
6126 cost.complexity); in iv_ca_dump()
6129 ivs->cand_use_cost.complexity); in iv_ca_dump()
6139 cp->cost.complexity); in iv_ca_dump()
6731 origcost.cost, origcost.complexity); in find_optimal_iv_set()
6733 cost.cost, cost.complexity); in find_optimal_iv_set()