Home | History | Annotate | Download | only in optimizing

Lines Matching defs:use

5  * you may not use this file except in compliance with the License.
102 * A use position represents a live interval use at a given position.
248 // Set the use within the instruction.
255 // requires to have inputs die at the instruction, so that input moves use the
274 // The user uses the instruction multiple times, and one use dies before the other.
275 // We update the use list so that the latter is first.
300 // If this environment use does not keep the instruction live, it does not
307 // First time we see a use of that interval.
311 // There is a use later in the same block or in a following block.
343 // There is a use in the following block.
374 // The use after the loop is after a lifetime hole.
443 // Find the first range after the start of `current`. We use the search
489 UsePosition* use = first_use_;
491 while (use != nullptr && use->GetPosition() <= end) {
492 size_t use_position = use->GetPosition();
494 if (use->RequiresRegister()) {
498 use = use->GetNext();
517 UsePosition* use = first_use_;
519 while (use != nullptr && use->GetPosition() <= end) {
520 size_t use_position = use->GetPosition();
524 use = use->GetNext();
662 UsePosition* use = first_use_;
663 if (use != nullptr) {
665 use->Dump(stream);
667 } while ((use = use->GetNext()) != nullptr);
670 use = first_env_use_;
671 if (use != nullptr) {
673 use->Dump(stream);
675 } while ((use = use->GetNext()) != nullptr);
791 // are made outside the linear scan, hence we need to use CoversSlow.
807 // Returns whether an interval, when it is non-split, can safely use
822 // are made outside the linear scan, hence we need to use CoversSlow.
921 // as the first register use.
947 UsePosition* use = first_use_;
948 while (use != nullptr) {
949 size_t use_position = use->GetPosition();
950 if ((use_position == position) && use->IsSynthesized()) {
954 use = use->GetNext();
977 // We're only adding a synthesized use at the last back edge. Adding syntehsized uses on
978 // all back edges is not necessary: anything used in the loop will have its use at the
983 // There was a use already seen in this loop. Therefore the previous call to `AddUse`
984 // already inserted the backedge use. We can stop going outward.
1000 // Going outward. The latest created use needs to point to the new use.
1089 * use has no effect, and may get a 'none' value after register allocation.
1149 // We use the input index to store the index of the temporary in the user's temporary list.