Lines Matching defs:lru
7975 #define SQLITE_MUTEX_STATIC_LRU 6 /* lru page list */
16865 int iCacheCnt; /* Counter used to generate aColCache[].lru values */
16907 int lru; /* Least recently used entry has the smallest value */
45205 ** PgHdr.pDirtyNext and pDirtyPrev. The list is maintained in LRU order
45220 PgHdr *pDirty, *pDirtyTail; /* List of dirty pages in LRU order */
45594 ** If the LRU page in the dirty list that has a clear PGHDR_NEED_SYNC
45596 ** set incorrectly (pointing to other than the LRU page with NEED_SYNC
46152 lru element */
46155 PgHdr1 *pLruNext; /* Next in LRU list of unpinned pages */
46156 PgHdr1 *pLruPrev; /* Previous in LRU list of unpinned pages */
46160 ** A page is pinned if it is no on the LRU list
46193 PgHdr1 lru; /* The beginning and end of the LRU list */
46225 unsigned int nRecyclable; /* Number of pages in the LRU list */
46278 ** Macros to enter and leave the PCache LRU mutex.
46610 ** PGroup LRU list, if is part of it. If pPage is not part of the PGroup
46611 ** LRU list, then this function is a no-op.
46626 assert( pPage->pCache->pGroup->lru.isAnchor==1 );
46662 && (p=pGroup->lru.pLruPrev)->isAnchor==0
46817 if( pGroup->lru.isAnchor==0 ){
46818 pGroup->lru.isAnchor = 1;
46819 pGroup->lru.pLruPrev = pGroup->lru.pLruNext = &pGroup->lru;
46932 && !pGroup->lru.pLruPrev->isAnchor
46936 pPage = pGroup->lru.pLruPrev;
47021 ** then attempt to recycle a page from the LRU list. If it is the right
47121 ** part of the PGroup LRU list.
47129 /* Add the page to the PGroup LRU list. */
47130 PgHdr1 **ppFirst = &pGroup->lru.pLruNext;
47131 pPage->pLruPrev = &pGroup->lru;
47271 && (p=pcache1.grp.lru.pLruPrev)!=0
47301 for(p=pcache1.grp.lru.pLruNext; p && !p->isAnchor; p=p->pLruNext){
95868 if( p->lru<minLru ){
95870 minLru = p->lru;
95884 p->lru = pParse->iCacheCnt++;
96034 p->lru = pParse->iCacheCnt++;
174904 ** of the LRU queue and return immediately. Otherwise, leave nUp pointing
