Lines Matching defs:pFirst
27025 struct MemBlockHdr *pFirst;
27198 mem.pFirst = pHdr;
27248 assert( mem.pFirst==pHdr );
27249 mem.pFirst = pHdr->pNext;
27398 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){
27420 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){
42709 unixShm *pFirst; /* All unixShm objects pointing to this */
43153 ** at pShmNode->pFirst. This must be done while holding the
43157 p->pNext = pShmNode->pFirst;
43158 pShmNode->pFirst = p;
43340 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
43607 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
50394 winShm *pFirst; /* All winShm objects pointing to this */
50658 ** at pShmNode->pFirst. This must be done while holding the pShmNode->mutex
50662 p->pNext = pShmNode->pFirst;
50663 pShmNode->pFirst = p;
50698 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
50754 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
50779 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
50804 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
62142 /* pPager->pFirst = 0; */
85984 VdbeOp *pOut, *pFirst;
85990 pFirst = pOut = &p->aOp[p->nOp];
86018 return pFirst;
106092 FileChunk *pFirst; /* Head of in-memory chunk-list */
106123 for(pChunk=p->pFirst;
106150 ** Free the list of FileChunk structures headed at MemJournal.pFirst.
106152 static void memjrnlFreeChunks(FileChunk *pFirst){
106155 for(pIter=pFirst; pIter; pIter=pNext){
106175 for(pIter=copy.pFirst; pIter; pIter=pIter->pNext){
106185 memjrnlFreeChunks(copy.pFirst);
106237 if( iOfst==0 && p->pFirst ){
106239 memcpy((u8*)p->pFirst->zChunk, zBuf, iAmt);
106255 assert( p->pFirst );
106258 assert( !p->pFirst );
106259 p->pFirst = pNew;
106285 memjrnlFreeChunks(p->pFirst);
106286 p->pFirst = 0;
106289 for(pIter=p->pFirst; ALWAYS(pIter) && iOff<size; pIter=pIter->pNext){
106311 memjrnlFreeChunks(p->pFirst);
111120 Expr *pFirst = pList->a[iFirst].pExpr;
111121 assert( pFirst!=0 );
111122 assert( pFirst->op==TK_SELECT_COLUMN );
111126 pFirst->pRight = pExpr;
111131 pFirst->iTable = pColumns->nId;
165911 Index *pFirst; /* First of real indices on the table */
165923 pFirst = pSrc->pTab->pIndex;
165927 sPk.pNext = pFirst;
211821 RtreeSearchPoint *pNew, *pFirst;
211822 pFirst = rtreeSearchPointFirst(pCur);
211824 if( pFirst==0
211825 || pFirst->rScore>rScore
211826 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
243476 Fts5SegIter *pFirst = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
243479 assert( (pFirst->pLeaf==0)==pIter->base.bEof );
243484 assert( p1==pFirst
243486 || fts5BufferCompare(&pFirst->term, &p1->term)