Lines Matching defs:distance
182 /* to compute the next use distance at the beginning of the block, we have to add the block's
219 std::pair<uint32_t, uint32_t> distance{block_idx, 0};
225 distance = it->second;
233 std::make_pair(instr->operands[i].getTemp(), distance));
236 if (inserted || entry_distance != distance)
238 entry_distance = distance;
250 uint32_t distance = pair.second.second;
255 distance += 0xFFFF;
263 distance = std::min(entry_distance.second, distance);
265 if (entry_distance != std::pair<uint32_t, uint32_t>{dom, distance}) {
267 entry_distance = {dom, distance};
538 unsigned distance = 0;
545 pair.second.second > distance && !ctx.spills_entry[block_idx].count(pair.first)) {
547 distance = pair.second.second;
552 if (distance == 0) {
579 unsigned distance = 0;
585 if (pair.first.type() == type && pair.second.second > distance &&
588 distance = pair.second.second;
591 assert(distance != 0);
732 unsigned distance = 0;
738 if (it->type() == type && next_use_distances.at(*it).second > distance) {
739 distance = next_use_distances.at(*it).second;
744 assert(distance != 0);
934 // TODO: would be better to have them sorted: first vgprs and first with longest distance
1221 unsigned distance = 0;
1232 if (((pair.second > distance && can_rematerialize == do_rematerialize) ||
1236 distance = pair.second;
1241 assert(distance != 0 && distance > idx);