Searched refs:LRU (Results 1 – 13 of 13) sorted by relevance
84 #define LRU hashp->bufhead.prev macro87 #define LRU_INSERT(B) BUF_INSERT((B), LRU)162 bp = LRU; in newbuf()168 bp = LRU; in newbuf()321 if (!LRU) in __buf_free()323 for (bp = LRU; bp != &hashp->bufhead;) { in __buf_free()339 bp = LRU; in __buf_free()
263 LiveRegUnits LRU(*MBB.getParent()->getSubtarget().getRegisterInfo()); in optimizeNZCVDefs() local264 LRU.addLiveOuts(MBB); in optimizeNZCVDefs()267 bool NZCVDead = LRU.available(AArch64::NZCV); in optimizeNZCVDefs()294 LRU.stepBackward(II); in optimizeNZCVDefs()
757 LiveRegUnit &LRU = RegUnits[Unit]; in updatePhysDepsDownwards() local758 LRU.MI = UseMI; in updatePhysDepsDownwards()759 LRU.Op = DefOp; in updatePhysDepsDownwards()945 LiveRegUnit &LRU = RegUnits[Unit]; in updatePhysDepsUpwards() local947 if (LRU.Cycle <= Height && LRU.MI != &MI) { in updatePhysDepsUpwards()948 LRU.Cycle = Height; in updatePhysDepsUpwards()949 LRU.MI = &MI; in updatePhysDepsUpwards()950 LRU.Op = Op; in updatePhysDepsUpwards()
417 for (unsigned LRU : LiveRegUnits) in findInsertionPoint()418 dbgs() << ' ' << printRegUnit(LRU, TRI); in findInsertionPoint()
62 static int *buf_lru; /* LRU is the free list */180 We need an empty buffer. Find the LRU unpinned NON-Dirty page.720 printf ( "LRU + %d\n", *buf_lru );
86 LRU.clear(); in clear()113 LRU.push_back(Idx); in insert()114 if (LRU.size() > RegisterSetLimit) { in insert()115 unsigned T = LRU.front(); in insert()117 LRU.pop_front(); in insert()128 auto F = llvm::find(LRU, Idx); in remove()129 assert(F != LRU.end()); in remove()130 LRU.erase(F); in remove()171 std::deque<unsigned> LRU; member
6239 LiveRegUnits LRU(getRegisterInfo()); in isMBBSafeToOutlineFrom() local6242 LRU.accumulate(MI); in isMBBSafeToOutlineFrom()6245 bool R12AvailableInBlock = LRU.available(ARM::R12); in isMBBSafeToOutlineFrom()6246 bool CPSRAvailableInBlock = LRU.available(ARM::CPSR); in isMBBSafeToOutlineFrom()6254 LRU.addLiveOuts(MBB); in isMBBSafeToOutlineFrom()6258 if (R12AvailableInBlock && !LRU.available(ARM::R12)) in isMBBSafeToOutlineFrom()6260 if (CPSRAvailableInBlock && !LRU.available(ARM::CPSR)) in isMBBSafeToOutlineFrom()6273 : LRU.available(ARM::LR); in isMBBSafeToOutlineFrom()
8771 LiveRegUnits LRU(getRegisterInfo()); in getOutlinableRanges() local8772 auto AreAllUnsafeRegsDead = [&LRU]() { in getOutlinableRanges()8773 return LRU.available(AArch64::W16) && LRU.available(AArch64::W17) && in getOutlinableRanges()8774 LRU.available(AArch64::NZCV); in getOutlinableRanges()8791 LRU.addLiveOuts(MBB); in getOutlinableRanges()8821 LRU.stepBackward(*FirstPossibleEndPt); in getOutlinableRanges()8837 LRU.stepBackward(MI); in getOutlinableRanges()8844 LRAvailableEverywhere &= LRU.available(AArch64::LR); in getOutlinableRanges()
883 fixed caching bug in makedfa: LRU was actually removing
239 the LRU list. (@interwq)
2832 Bill Strecker Use of the LRU Stack Depth Distribution
6141 …icient algorithm for estimating these quantities is given. The relation to LRU (least recently use…12913 …e is given to illustrate the algorithm for Random and Least Recently Used (LRU) replacement rules.…18337 …placement algorithm. In this model, program behavior is represented by the LRU stack distance mode…21597 title = "Use of the {LRU} Stack Depth Distribution for Simulation of Paging Behavior",21608 …t size distributions. All members of both families can be derived from the LRU stack depth distrib…21614 …keywords = "computer operating systems; fault distributions; least; LRU; memory hierarchy; pag…
11909 - special rrset_cache LRU updating function that uses the rrset id.12164 - util/storage/lruhash.h for LRU hash table structure.