Searched refs:LRU (Results 1 – 14 of 14) sorted by relevance
84 #define LRU hashp->bufhead.prev macro87 #define LRU_INSERT(B) BUF_INSERT((B), LRU)170 bp = LRU; in newbuf()176 bp = LRU; in newbuf()329 if (!LRU) in __buf_free()331 for (bp = LRU; bp != &hashp->bufhead;) { in __buf_free()347 bp = LRU; in __buf_free()
258 LiveRegUnits LRU(*MBB.getParent()->getSubtarget().getRegisterInfo()); in optimizeNZCVDefs() local259 LRU.addLiveOuts(MBB); in optimizeNZCVDefs()262 bool NZCVDead = LRU.available(AArch64::NZCV); in optimizeNZCVDefs()289 LRU.stepBackward(II); in optimizeNZCVDefs()
785 LiveRegUnit &LRU = RegUnits[Unit]; in updatePhysDepsDownwards() local786 LRU.MI = UseMI; in updatePhysDepsDownwards()787 LRU.Op = DefOp; in updatePhysDepsDownwards()973 LiveRegUnit &LRU = RegUnits[Unit]; in updatePhysDepsUpwards() local975 if (LRU.Cycle <= Height && LRU.MI != &MI) { in updatePhysDepsUpwards()976 LRU.Cycle = Height; in updatePhysDepsUpwards()977 LRU.MI = &MI; in updatePhysDepsUpwards()978 LRU.Op = Op; in updatePhysDepsUpwards()
424 for (unsigned LRU : LiveRegUnits) in findInsertionPoint()425 dbgs() << ' ' << printRegUnit(LRU, TRI); in findInsertionPoint()
35 LRU
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 );
64 LRU.clear(); in clear()91 LRU.push_back(Idx); in insert()92 if (LRU.size() > RegisterSetLimit) { in insert()93 unsigned T = LRU.front(); in insert()95 LRU.pop_front(); in insert()106 auto F = llvm::find(LRU, Idx); in remove()107 assert(F != LRU.end()); in remove()108 LRU.erase(F); in remove()149 std::deque<unsigned> LRU; member
6091 LiveRegUnits LRU(getRegisterInfo()); in isMBBSafeToOutlineFrom() local6094 LRU.accumulate(MI); in isMBBSafeToOutlineFrom()6097 bool R12AvailableInBlock = LRU.available(ARM::R12); in isMBBSafeToOutlineFrom()6098 bool CPSRAvailableInBlock = LRU.available(ARM::CPSR); in isMBBSafeToOutlineFrom()6106 LRU.addLiveOuts(MBB); in isMBBSafeToOutlineFrom()6110 if (R12AvailableInBlock && !LRU.available(ARM::R12)) in isMBBSafeToOutlineFrom()6112 if (CPSRAvailableInBlock && !LRU.available(ARM::CPSR)) in isMBBSafeToOutlineFrom()6125 : LRU.available(ARM::LR); in isMBBSafeToOutlineFrom()
9550 LiveRegUnits LRU(getRegisterInfo()); in getOutlinableRanges() local9551 auto AreAllUnsafeRegsDead = [&LRU]() { in getOutlinableRanges()9552 return LRU.available(AArch64::W16) && LRU.available(AArch64::W17) && in getOutlinableRanges()9553 LRU.available(AArch64::NZCV); in getOutlinableRanges()9570 LRU.addLiveOuts(MBB); in getOutlinableRanges()9600 LRU.stepBackward(*FirstPossibleEndPt); in getOutlinableRanges()9616 LRU.stepBackward(MI); in getOutlinableRanges()9623 LRAvailableEverywhere &= LRU.available(AArch64::LR); in getOutlinableRanges()
883 fixed caching bug in makedfa: LRU was actually removing
339 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…
13532 - special rrset_cache LRU updating function that uses the rrset id.13787 - util/storage/lruhash.h for LRU hash table structure.