Lines Matching refs:pFirst

21768   struct MemBlockHdr *pFirst;  member
21941       mem.pFirst = pHdr;  in sqlite3MemMalloc()
21991     assert( mem.pFirst==pHdr );  in sqlite3MemFree()
21992     mem.pFirst = pHdr->pNext;  in sqlite3MemFree()
22141   for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){  in sqlite3MemdebugSync()
22163   for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){  in sqlite3MemdebugDump()
34874   unixShm *pFirst;           /* All unixShm objects pointing to this */
35234   p->pNext = pShmNode->pFirst;
35235   pShmNode->pFirst = p;
35441     for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
35466     for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
35491     for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
35557   for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
42385   winShm *pFirst;            /* All winShm objects pointing to this */
42653   p->pNext = pShmNode->pFirst;
42654   pShmNode->pFirst = p;
42689   for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
42741     for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
42766     for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
42791     for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
73717   VdbeOp *pOut, *pFirst;
73723   pFirst = pOut = &p->aOp[p->nOp];
73751   return pFirst;
90644   FileChunk *pFirst;              /* Head of in-memory chunk-list */
90680     for(pChunk=p->pFirst; 
90712   for(pIter=p->pFirst; pIter; pIter=pNext){
90716   p->pFirst = 0;
90733     for(pIter=copy.pFirst; pIter; pIter=pIter->pNext){
90791     if( iOfst==0 && p->pFirst ){
90793       memcpy((u8*)p->pFirst->zChunk, zBuf, iAmt);
90796     assert( iOfst>0 || p->pFirst==0 );
90812             assert( p->pFirst );
90815             assert( !p->pFirst );
90816             p->pFirst = pNew;
94290     Expr *pFirst = pList->a[iFirst].pExpr;
94291     assert( pFirst!=0 );
94292     assert( pFirst->op==TK_SELECT_COLUMN );
94296     pFirst->pRight = pExpr;
94301     pFirst->iTable = pColumns->nId;
135743     Index *pFirst;                  /* First of real indices on the table */
135754     pFirst = pSrc->pTab->pIndex;
135758       sPk.pNext = pFirst;
168459   RtreeSearchPoint *pNew, *pFirst;
168460   pFirst = rtreeSearchPointFirst(pCur);
168462   if( pFirst==0
168463    || pFirst->rScore>rScore 
168464    || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
196847     Fts5SegIter *pFirst = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
196850     assert( (pFirst->pLeaf==0)==pIter->base.bEof );
196855       assert( p1==pFirst 
196857            || fts5BufferCompare(&pFirst->term, &p1->term)