Lines Matching refs:pFirst
25851 struct MemBlockHdr *pFirst;
26024 mem.pFirst = pHdr;
26074 assert( mem.pFirst==pHdr );
26075 mem.pFirst = pHdr->pNext;
26224 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){
26246 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){
41180 unixShm *pFirst; /* All unixShm objects pointing to this */
41585 ** at pShmNode->pFirst. This must be done while holding the
41589 p->pNext = pShmNode->pFirst;
41590 pShmNode->pFirst = p;
41770 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41983 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
48816 winShm *pFirst; /* All winShm objects pointing to this */
49080 ** at pShmNode->pFirst. This must be done while holding the pShmNode->mutex
49084 p->pNext = pShmNode->pFirst;
49085 pShmNode->pFirst = p;
49120 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
49176 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
49201 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
49226 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
60587 /* pPager->pFirst = 0; */
83602 VdbeOp *pOut, *pFirst;
83608 pFirst = pOut = &p->aOp[p->nOp];
83636 return pFirst;
103045 FileChunk *pFirst; /* Head of in-memory chunk-list */
103076 for(pChunk=p->pFirst;
103103 ** Free the list of FileChunk structures headed at MemJournal.pFirst.
103105 static void memjrnlFreeChunks(FileChunk *pFirst){
103108 for(pIter=pFirst; pIter; pIter=pNext){
103128 for(pIter=copy.pFirst; pIter; pIter=pIter->pNext){
103138 memjrnlFreeChunks(copy.pFirst);
103190 if( iOfst==0 && p->pFirst ){
103192 memcpy((u8*)p->pFirst->zChunk, zBuf, iAmt);
103208 assert( p->pFirst );
103211 assert( !p->pFirst );
103212 p->pFirst = pNew;
103238 memjrnlFreeChunks(p->pFirst);
103239 p->pFirst = 0;
103242 for(pIter=p->pFirst; ALWAYS(pIter) && iOff<size; pIter=pIter->pNext){
103264 memjrnlFreeChunks(p->pFirst);
107713 Expr *pFirst = pList->a[iFirst].pExpr;
107714 assert( pFirst!=0 );
107715 assert( pFirst->op==TK_SELECT_COLUMN );
107719 pFirst->pRight = pExpr;
107724 pFirst->iTable = pColumns->nId;
159962 Index *pFirst; /* First of real indices on the table */
159974 pFirst = pSrc->pTab->pIndex;
159978 sPk.pNext = pFirst;
202444 RtreeSearchPoint *pNew, *pFirst;
202445 pFirst = rtreeSearchPointFirst(pCur);
202447 if( pFirst==0
202448 || pFirst->rScore>rScore
202449 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
232635 Fts5SegIter *pFirst = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
232638 assert( (pFirst->pLeaf==0)==pIter->base.bEof );
232643 assert( p1==pFirst
232645 || fts5BufferCompare(&pFirst->term, &p1->term)