Home | History | Annotate | Download | only in compiler

Lines Matching defs:distance

177    /* to compute the next use distance at the beginning of the block, we have to add the block's
214       std::pair<uint32_t, uint32_t> distance{block_idx, 0};
220          distance = it->second;
228                std::make_pair(instr->operands[i].getTemp(), distance));
231             if (inserted || entry_distance != distance)
233             entry_distance = distance;
245       uint32_t distance = pair.second.second;
250             distance += 0xFFFF;
258             distance = std::min(entry_distance.second, distance);
260          if (entry_distance != std::pair<uint32_t, uint32_t>{dom, distance}) {
262             entry_distance = {dom, distance};
533          unsigned distance = 0;
540                 pair.second.second > distance && !ctx.spills_entry[block_idx].count(pair.first)) {
542                distance = pair.second.second;
547          if (distance == 0) {
574          unsigned distance = 0;
580             if (pair.first.type() == type && pair.second.second > distance &&
583                distance = pair.second.second;
586          assert(distance != 0);
730       unsigned distance = 0;
736          if (it->type() == type && next_use_distances.at(*it).second > distance) {
737             distance = next_use_distances.at(*it).second;
742       assert(distance != 0);
930    // TODO: would be better to have them sorted: first vgprs and first with longest distance
1217             unsigned distance = 0;
1228                if (((pair.second > distance && can_rematerialize == do_rematerialize) ||
1232                   distance = pair.second;
1237             assert(distance != 0 && distance > idx);