Home | History | Annotate | Download | only in dist

Lines Matching defs:lru

8507 #define SQLITE_MUTEX_STATIC_LRU       6  /* lru page list */
53886 ** PgHdr.pDirtyNext and pDirtyPrev. The list is maintained in LRU order
53901 PgHdr *pDirty, *pDirtyTail; /* List of dirty pages in LRU order */
54318 ** If the LRU page in the dirty list that has a clear PGHDR_NEED_SYNC
54320 ** set incorrectly (pointing to other than the LRU page with NEED_SYNC
54910 ** of all pages that are unpinned. The PGroup.lru element (which should be
54918 u16 isAnchor; /* This is the PGroup.lru element */
54921 PgHdr1 *pLruNext; /* Next in circular LRU list of unpinned pages */
54922 PgHdr1 *pLruPrev; /* Previous in LRU list of unpinned pages */
54927 ** A page is pinned if it is not on the LRU list. To be "pinned" means
54961 PgHdr1 lru; /* The beginning and end of the LRU list */
54994 unsigned int nRecyclable; /* Number of pages in the LRU list */
55047 ** Macros to enter and leave the PCache LRU mutex.
55370 ** PGroup LRU list, if is part of it. If pPage is not part of the PGroup
55371 ** LRU list, then this function is a no-op.
55387 assert( pPage->pCache->pGroup->lru.isAnchor==1 );
55423 && (p=pGroup->lru.pLruPrev)->isAnchor==0
55579 if( pGroup->lru.isAnchor==0 ){
55580 pGroup->lru.isAnchor = 1;
55581 pGroup->lru.pLruPrev = pGroup->lru.pLruNext = &pGroup->lru;
55698 && !pGroup->lru.pLruPrev->isAnchor
55702 pPage = pGroup->lru.pLruPrev;
55788 ** then attempt to recycle a page from the LRU list. If it is the right
55888 ** part of the PGroup LRU list.
55896 /* Add the page to the PGroup LRU list. */
55897 PgHdr1 **ppFirst = &pGroup->lru.pLruNext;
55898 pPage->pLruPrev = &pGroup->lru;
56041 && (p=pcache1.grp.lru.pLruPrev)!=0
56068 for(p=pcache1.grp.lru.pLruNext; p && !p->isAnchor; p=p->pLruNext){
218876 ** of the LRU queue and return immediately. Otherwise, leave nUp pointing