Home
last modified time | relevance | path

Searched refs:LRU (Results 1 – 14 of 14) sorted by relevance

/freebsd-14.2/lib/libc/db/hash/
H A Dhash_buf.c87 #define LRU hashp->bufhead.prev macro
90 #define LRU_INSERT(B) BUF_INSERT((B), LRU)
165 bp = LRU; in newbuf()
171 bp = LRU; in newbuf()
324 if (!LRU) in __buf_free()
326 for (bp = LRU; bp != &hashp->bufhead;) { in __buf_free()
342 bp = LRU; in __buf_free()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AArch64/GISel/
H A DAArch64PostSelectOptimize.cpp197 LiveRegUnits LRU(*MBB.getParent()->getSubtarget().getRegisterInfo()); in optimizeNZCVDefs() local
198 LRU.addLiveOuts(MBB); in optimizeNZCVDefs()
201 bool NZCVDead = LRU.available(AArch64::NZCV); in optimizeNZCVDefs()
227 LRU.stepBackward(II); in optimizeNZCVDefs()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineTraceMetrics.cpp757 LiveRegUnit &LRU = RegUnits[Unit]; in updatePhysDepsDownwards() local
758 LRU.MI = UseMI; in updatePhysDepsDownwards()
759 LRU.Op = DefOp; in updatePhysDepsDownwards()
945 LiveRegUnit &LRU = RegUnits[Unit]; in updatePhysDepsUpwards() local
947 if (LRU.Cycle <= Height && LRU.MI != &MI) { in updatePhysDepsUpwards()
948 LRU.Cycle = Height; in updatePhysDepsUpwards()
949 LRU.MI = &MI; in updatePhysDepsUpwards()
950 LRU.Op = ReadOps[I]; in updatePhysDepsUpwards()
H A DEarlyIfConversion.cpp417 for (unsigned LRU : LiveRegUnits) in findInsertionPoint()
418 dbgs() << ' ' << printRegUnit(LRU, TRI); in findInsertionPoint()
/freebsd-14.2/sys/contrib/openzfs/config/
H A Dkernel-global_page_state.m45 dnl # 599d0c954f91 mm, vmscan: move LRU lists to node
/freebsd-14.2/lib/libc/db/mpool/
H A Dmpool.libtp62 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 );
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonBitSimplify.cpp86 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
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMBaseInstrInfo.cpp6237 LiveRegUnits LRU(getRegisterInfo()); in isMBBSafeToOutlineFrom() local
6240 LRU.accumulate(MI); in isMBBSafeToOutlineFrom()
6243 bool R12AvailableInBlock = LRU.available(ARM::R12); in isMBBSafeToOutlineFrom()
6244 bool CPSRAvailableInBlock = LRU.available(ARM::CPSR); in isMBBSafeToOutlineFrom()
6252 LRU.addLiveOuts(MBB); in isMBBSafeToOutlineFrom()
6256 if (R12AvailableInBlock && !LRU.available(ARM::R12)) in isMBBSafeToOutlineFrom()
6258 if (CPSRAvailableInBlock && !LRU.available(ARM::CPSR)) in isMBBSafeToOutlineFrom()
6271 : LRU.available(ARM::LR); in isMBBSafeToOutlineFrom()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64InstrInfo.cpp8692 LiveRegUnits LRU(getRegisterInfo()); in getOutlinableRanges() local
8693 auto AreAllUnsafeRegsDead = [&LRU]() { in getOutlinableRanges()
8694 return LRU.available(AArch64::W16) && LRU.available(AArch64::W17) && in getOutlinableRanges()
8695 LRU.available(AArch64::NZCV); in getOutlinableRanges()
8712 LRU.addLiveOuts(MBB); in getOutlinableRanges()
8742 LRU.stepBackward(*FirstPossibleEndPt); in getOutlinableRanges()
8758 LRU.stepBackward(MI); in getOutlinableRanges()
8765 LRAvailableEverywhere &= LRU.available(AArch64::LR); in getOutlinableRanges()
/freebsd-14.2/contrib/one-true-awk/
H A DFIXES.1e883 fixed caching bug in makedfa: LRU was actually removing
/freebsd-14.2/contrib/jemalloc/
H A DChangeLog239 the LRU list. (@interwq)
/freebsd-14.2/contrib/one-true-awk/testdir/
H A Dfunstack.ok2832 Bill Strecker Use of the LRU Stack Depth Distribution
H A Dfunstack.in6141 …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…
/freebsd-14.2/contrib/unbound/doc/
H A DChangelog11909 - special rrset_cache LRU updating function that uses the rrset id.
12164 - util/storage/lruhash.h for LRU hash table structure.