Home | History | Annotate | Download | only in optimizing

Lines Matching refs:interval

83   bool TryAllocateFreeReg(LiveInterval* interval);
84 bool AllocateBlockedReg(LiveInterval* interval);
87 // Add `interval` in the given sorted list.
88 static void AddSorted(GrowableArray<LiveInterval*>* array, LiveInterval* interval);
90 // Split `interval` at the position `position`. The new interval starts at `position`.
91 LiveInterval* Split(LiveInterval* interval, size_t position);
93 // Split `interval` at a position between `from` and `to`. The method will try
95 LiveInterval* SplitBetween(LiveInterval* interval, size_t from, size_t to);
100 // Update the interval for the register in `location` to cover [start, end).
103 // Allocate a spill slot for the given interval.
104 void AllocateSpillSlotFor(LiveInterval* interval);
107 void ConnectSiblings(LiveInterval* interval);
110 void ConnectSplitSiblings(LiveInterval* interval, HBasicBlock* from, HBasicBlock* to) const;
141 void DumpInterval(std::ostream& stream, LiveInterval* interval) const;
146 // Try splitting an active non-pair or unaligned pair interval at the given `position`.
147 // Returns whether it was successful at finding such an interval.
152 // If `interval` has another half, remove it from the list of `intervals`.
153 // `index` holds the index at which `interval` is in `intervals`.
155 bool PotentiallyRemoveOtherHalf(LiveInterval* interval,
164 // position. Last entry is the interval that has the lowest start position.
178 // List of intervals that are currently active when processing a new live interval.
179 // That is, they have a live range that spans the start of the new interval.
182 // List of intervals that are currently inactive when processing a new live interval.
183 // That is, they have a lifetime hole that spans the start of the new interval.