Searched refs:next_intersection (Results 1 – 2 of 2) sorted by relevance
1812 LifetimePosition next_intersection = in TryAllocateFreeReg() local1814 if (!next_intersection.IsValid()) continue; in TryAllocateFreeReg()1816 free_until_pos[cur_reg] = Min(free_until_pos[cur_reg], next_intersection); in TryAllocateFreeReg()1908 LifetimePosition next_intersection = range->FirstIntersection(current); in AllocateBlockedReg() local1909 if (!next_intersection.IsValid()) continue; in AllocateBlockedReg()1912 block_pos[cur_reg] = Min(block_pos[cur_reg], next_intersection); in AllocateBlockedReg()1915 use_pos[cur_reg] = Min(use_pos[cur_reg], next_intersection); in AllocateBlockedReg()2021 LifetimePosition next_intersection = range->FirstIntersection(current); in SplitAndSpillIntersecting() local2022 if (next_intersection.IsValid()) { in SplitAndSpillIntersecting()2027 next_intersection = Min(next_intersection, next_pos->pos()); in SplitAndSpillIntersecting()[all …]
1781 LifetimePosition next_intersection = in TryAllocateFreeReg() local1783 if (!next_intersection.IsValid()) continue; in TryAllocateFreeReg()1785 free_until_pos[cur_reg] = Min(free_until_pos[cur_reg], next_intersection); in TryAllocateFreeReg()1881 LifetimePosition next_intersection = range->FirstIntersection(current); in AllocateBlockedReg() local1882 if (!next_intersection.IsValid()) continue; in AllocateBlockedReg()1885 block_pos[cur_reg] = Min(block_pos[cur_reg], next_intersection); in AllocateBlockedReg()1888 use_pos[cur_reg] = Min(use_pos[cur_reg], next_intersection); in AllocateBlockedReg()1997 LifetimePosition next_intersection = range->FirstIntersection(current); in SplitAndSpillIntersecting() local1998 if (next_intersection.IsValid()) { in SplitAndSpillIntersecting()2003 next_intersection = Min(next_intersection, next_pos->pos()); in SplitAndSpillIntersecting()[all …]