Lines Matching defs:value
63 /* Average the cost of a value among its users, to try to account for
66 float value;
68 /* Overall benefit, i.e. the value minus any cost to inserting
303 * candidate and its value shouldn't propagate downwards. For example,
312 * independent and B's value shouldn't flow into D.
317 state->value += src_state->value;
327 float value1 = state1->value / state1->size;
328 float value2 = state2->value / state2->size;
385 state->value = get_instr_cost(instr, options);
425 /* Step 3: Calculate value of candidates by propagating downwards. We try
426 * to share the value amongst can_move uses, in case there are multiple.
449 /* If this instruction is a candidate, its value shouldn't be
457 state->value /= state->can_move_users;
459 state->value = 0;
463 state->benefit = state->value -
489 * alignment. We use a well-known greedy approximation, sorting by value