Lines Matching refs:pNext
61 ** by all database connections. The p->pNext is a list of other
64 ** p, then first unlock all of the others on p->pNext, then wait
72 ** connected by pNext and pPrev should be in sorted order by
75 assert( p->pNext==0 || p->pNext->pBt>p->pBt );
77 assert( p->pNext==0 || p->pNext->db==p->db );
79 assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
111 for(pLater=p->pNext; pLater; pLater=pLater->pNext){
113 assert( pLater->pNext==0 || pLater->pNext->pBt>pLater->pBt );
120 for(pLater=p->pNext; pLater; pLater=pLater->pNext){