Lines Matching refs:pFirst
20651 struct MemBlockHdr *pFirst; member
20824 mem.pFirst = pHdr; in sqlite3MemMalloc()
20874 assert( mem.pFirst==pHdr ); in sqlite3MemFree()
20875 mem.pFirst = pHdr->pNext; in sqlite3MemFree()
21024 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugSync()
21046 for(pHdr=mem.pFirst; pHdr; pHdr=pHdr->pNext){ in sqlite3MemdebugDump()
33363 unixShm *pFirst; /* All unixShm objects pointing to this */
33675 p->pNext = pShmNode->pFirst;
33676 pShmNode->pFirst = p;
33877 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
33902 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
33927 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
33993 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
40747 winShm *pFirst; /* All winShm objects pointing to this */
40988 p->pNext = pShmNode->pFirst;
40989 pShmNode->pFirst = p;
41024 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){}
41076 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41101 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41126 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
71044 VdbeOp *pOut, *pFirst;
71050 pFirst = pOut = &p->aOp[p->nOp];
71078 return pFirst;
87454 FileChunk *pFirst; /* Head of in-memory chunk-list */
87489 for(pChunk=p->pFirst;
87521 for(pIter=p->pFirst; pIter; pIter=pNext){
87525 p->pFirst = 0;
87542 for(pIter=copy.pFirst; pIter; pIter=pIter->pNext){
87599 if( iOfst==0 && p->pFirst ){
87601 memcpy((u8*)p->pFirst->zChunk, zBuf, iAmt);
87604 assert( iOfst>0 || p->pFirst==0 );
87620 assert( p->pFirst );
87623 assert( !p->pFirst );
87624 p->pFirst = pNew;
115910 Select *pFirst = p;
115911 while( pFirst->pPrior ) pFirst = pFirst->pPrior;
115912 generateColumnNames(pParse, pFirst->pSrc, pFirst->pEList);
115985 Select *pFirst = p;
115986 while( pFirst->pPrior ) pFirst = pFirst->pPrior;
115987 generateColumnNames(pParse, pFirst->pSrc, pFirst->pEList);
116601 Select *pFirst = pPrior;
116602 while( pFirst->pPrior ) pFirst = pFirst->pPrior;
116603 generateColumnNames(pParse, pFirst->pSrc, pFirst->pEList);
129368 Index *pFirst; /* First of real indices on the table */
129379 pFirst = pSrc->pTab->pIndex;
129383 sPk.pNext = pFirst;
161194 RtreeSearchPoint *pNew, *pFirst;
161195 pFirst = rtreeSearchPointFirst(pCur);
161197 if( pFirst==0
161198 || pFirst->rScore>rScore
161199 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
187505 Fts5SegIter *pFirst = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
187508 assert( (pFirst->pLeaf==0)==pIter->base.bEof );
187513 assert( p1==pFirst
187515 || fts5BufferCompare(&pFirst->term, &p1->term)
