Lines Matching refs:pFirst

24900   struct MemBlockHdr *pFirst;
25073       mem.pFirst = pHdr;
25123     assert( mem.pFirst==pHdr );
25124     mem.pFirst = pHdr->pNext;
25273   for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){
25295   for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){
38526   unixShm *pFirst;           /* All unixShm objects pointing to this */
38935   p->pNext = pShmNode->pFirst;
38936   pShmNode->pFirst = p;
39116   for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
39313   for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
46104   winShm *pFirst;            /* All winShm objects pointing to this */
46372   p->pNext = pShmNode->pFirst;
46373   pShmNode->pFirst = p;
46408   for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
46460     for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
46485     for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
46510     for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
80155   VdbeOp *pOut, *pFirst;
80161   pFirst = pOut = &p->aOp[p->nOp];
80189   return pFirst;
98961   FileChunk *pFirst;              /* Head of in-memory chunk-list */
98992     for(pChunk=p->pFirst;
99021 static void memjrnlFreeChunks(FileChunk *pFirst){
99024   for(pIter=pFirst; pIter; pIter=pNext){
99044     for(pIter=copy.pFirst; pIter; pIter=pIter->pNext){
99054       memjrnlFreeChunks(copy.pFirst);
99102     if( iOfst==0 && p->pFirst ){
99104       memcpy((u8*)p->pFirst->zChunk, zBuf, iAmt);
99107     assert( iOfst>0 || p->pFirst==0 );
99123             assert( p->pFirst );
99126             assert( !p->pFirst );
99127             p->pFirst = pNew;
99152       memjrnlFreeChunks(p->pFirst);
99153       p->pFirst = 0;
99156       for(pIter=p->pFirst; ALWAYS(pIter) && iOff<size; pIter=pIter->pNext){
99178   memjrnlFreeChunks(p->pFirst);
103521     Expr *pFirst = pList->a[iFirst].pExpr;
103522     assert( pFirst!=0 );
103523     assert( pFirst->op==TK_SELECT_COLUMN );
103527     pFirst->pRight = pExpr;
103532     pFirst->iTable = pColumns->nId;
153665     Index *pFirst;                  /* First of real indices on the table */
153677     pFirst = pSrc->pTab->pIndex;
153681       sPk.pNext = pFirst;
195443   RtreeSearchPoint *pNew, *pFirst;
195444   pFirst = rtreeSearchPointFirst(pCur);
195446   if( pFirst==0
195447    || pFirst->rScore>rScore
195448    || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
225550     Fts5SegIter *pFirst = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
225553     assert( (pFirst->pLeaf==0)==pIter->base.bEof );
225558       assert( p1==pFirst
225560            || fts5BufferCompare(&pFirst->term, &p1->term)