Lines Matching defs:pEnd
18626 void *pEnd; /* First byte past end of available space */
18627 void *pTrueEnd; /* True value of pEnd, when db->pnBytesFreed!=0 */
21588 Expr *pEnd; /* Expression for "<expr> FOLLOWING" */
25306 assert( db->lookaside.pEnd==db->lookaside.pTrueEnd );
25307 db->lookaside.pEnd = db->lookaside.pStart;
25333 db->lookaside.pEnd = db->lookaside.pTrueEnd;
25351 assert( db->lookaside.pEnd==db->lookaside.pTrueEnd );
25352 db->lookaside.pEnd = db->lookaside.pStart;
25356 db->lookaside.pEnd = db->lookaside.pTrueEnd;
31898 if( ((uptr)p)<(uptr)(db->lookaside.pEnd) ){
31937 if( ((uptr)p)<(uptr)(db->lookaside.pEnd) ){
32178 pEnd ){
34453 sqlite3TreeViewBound(pView, pWin->eEnd, pWin->pEnd, 0);
57854 ** szSlot, nSlot, pStart, pEnd, nReserve, and isInit values are all
57864 void *pStart, *pEnd; /* Bounds of global page cache memory */
57923 pcache1.pEnd = pBuf;
58015 if( SQLITE_WITHIN(p, pcache1.pStart, pcache1.pEnd) ){
58047 if( p>=pcache1.pStart && p<pcache1.pEnd ){
74401 u8 *pEnd = &pIter[8];
74405 }while( (*pIter)>=0x80 && pIter<pEnd );
74480 u8 *pEnd = &pIter[8];
74484 }while( *(pIter)>=0x80 && pIter<pEnd );
74529 u8 *pEnd; /* End mark for a varint */
74544 pEnd = &pIter[8];
74548 }while( *(pIter)>=0x80 && pIter<pEnd );
74571 u8 *pEnd; /* End mark for a varint */
74586 pEnd = &pIter[8];
74590 }while( *(pIter)>=0x80 && pIter<pEnd );
74613 u8 *pEnd; /* End mark for a varint */
74627 pEnd = pIter + 9;
74628 while( (*pIter++)&0x80 && pIter<pEnd );
74634 u8 *pEnd; /* End mark for a varint */
74648 pEnd = &pIter[8];
74652 }while( *(pIter)>=0x80 && pIter<pEnd );
74773 u8 *pEnd = &data[cellOffset + nCell*2];
74794 for(pAddr=&data[cellOffset]; pAddr<pEnd; pAddr+=2){
80757 u8 * const pEnd = &aData[usableSize];
80777 pData = pEnd;
80782 if( SQLITE_WITHIN(pCell,aData+j,pEnd) ){
80783 if( ((uptr)(pCell+sz))>(uptr)pEnd ) return SQLITE_CORRUPT_BKPT;
80855 u8 *pEnd; /* Maximum extent of cell data */
80860 pEnd = pCArray->apEnd[k];
80877 if( (uptr)(pCArray->apCell[i]+sz)>(uptr)pEnd
80878 && (uptr)(pCArray->apCell[i])<(uptr)pEnd
80891 pEnd = pCArray->apEnd[k];
80914 u8 * const pEnd = &aData[pPg->pBt->usableSize];
80925 if( SQLITE_WITHIN(pCell, pStart, pEnd) ){
80953 if( &aData[iAfter]>pEnd ) return 0;
89901 Mem *pEnd = &p[N];
89907 }while( (++p)<pEnd );
89911 assert( (&p[1])==pEnd || p[0].db==p[1].db );
89942 }while( (++p)<pEnd );
95650 assert( db->lookaside.pEnd==db->lookaside.pTrueEnd );
95651 db->lookaside.pEnd = db->lookaside.pStart;
95654 db->lookaside.pEnd = db->lookaside.pTrueEnd;
103925 Mem *pEnd; /* Last memory cell in new array */
103999 pEnd = &VdbeFrameMem(pFrame)[pFrame->nChildMem];
104000 for(pMem=VdbeFrameMem(pFrame); pMem!=pEnd; pMem++){
110096 rc = sqlite3WalkExpr(pWalker, pWin->pEnd);
116181 VdbeOp *pOp, *pEnd;
116195 pEnd = sqlite3VdbeGetLastOp(v);
116196 for(; pOp<pEnd; pOp++){
122559 RenameToken *pEnd;
122561 pEnd = renameTokenFind(&sParse, 0, (void*)pTab->aCol[iCol+1].zCnName);
122562 zEnd = (const char*)pEnd->t.z;
128952 Token *pEnd, /* The ')' before options in the CREATE TABLE */
128961 if( pEnd==0 && pSelect==0 ){
129202 Token *pEnd2 = tabOpts ? &pParse->sLastToken : pEnd;
129289 assert( pCons && pEnd );
129291 pCons = pEnd;
162067 SQLITE_PRIVATE void sqlite3VtabFinishParse(Parse *pParse, Token *pEnd){
162093 if( pEnd ){
162094 pParse->sNameToken.n = (int)(pEnd->z - pParse->sNameToken.z) + pEnd->n;
165395 WhereTerm *pStart, *pEnd;
165398 pStart = pEnd = 0;
165400 if( pLoop->wsFlags & WHERE_TOP_LIMIT ) pEnd = pLoop->aLTerm[j++];
165401 assert( pStart!=0 || pEnd!=0 );
165404 pStart = pEnd;
165405 pEnd = pTerm;
165407 codeCursorHint(pTabItem, pWInfo, pLevel, pEnd);
165460 if( pEnd ){
165462 pX = pEnd->pExpr;
165464 assert( (pEnd->wtFlags & TERM_VNULL)==0 );
165465 testcase( pEnd->leftCursor!=iCur ); /* Transitive constraints */
165466 testcase( pEnd->wtFlags & TERM_VIRTUAL );
165477 disableTerm(pLevel, pEnd);
173514 SrcItem *pEnd = &pTabList->a[pWInfo->nLevel];
173532 for(iTab=0, pItem=pTabList->a; pItem<pEnd; iTab++, pItem++){
173578 for(p=&pItem[1]; p<pEnd; p++){
175123 WhereTerm *pTerm, *pEnd;
175136 pEnd = pWInfo->sWC.a + pWInfo->sWC.nTerm;
175137 for(pTerm=pWInfo->sWC.a; pTerm<pEnd; pTerm++){
175152 if( pTerm<pEnd ) continue;
175158 for(pTerm=pWInfo->sWC.a; pTerm<pEnd; pTerm++){
177144 pWin->pEnd = sqlite3ExprDup(pParse->db, p->pEnd, 0);
177153 && (pWin->pStart || pWin->pEnd)
177186 sqlite3ExprDelete(db, pWin->pEnd);
177187 pWin->pEnd = pWin->pStart = 0;
177610 sqlite3ExprDelete(db, p->pEnd);
177654 Expr *pEnd, /* End window size if TK_FOLLOWING or PRECEDING */
177667 assert( (eEnd==TK_FOLLOWING || eEnd==TK_PRECEDING)==(pEnd!=0) );
177705 pWin->pEnd = sqlite3WindowOffsetExpr(pParse, pEnd);
177710 sqlite3ExprDelete(pParse->db, pEnd);
177840 if( sqlite3ExprCompare(pParse, p1->pEnd, p2->pEnd, -1) ) return 1;
178876 pNew->pEnd = sqlite3ExprDup(db, p->pEnd, 0);
179328 && windowExprGtZero(pParse, pMWin->pEnd)
179417 sqlite3ExprCode(pParse, pMWin->pEnd, regEnd);
187959 db->lookaside.pEnd = p;
187970 db->lookaside.pEnd = 0;
187976 db->lookaside.pTrueEnd = db->lookaside.pEnd;
194009 ** not extending past pEnd[-1].
194015 const char *pEnd,
194020 const unsigned char *pX = (const unsigned char*)pEnd;
195711 char *pEnd = *ppPoslist;
195719 ** The following while-loop moves pEnd to point to the first byte that is not
195721 ** pEnd once more so that it points to the byte immediately following the
195724 while( *pEnd | c ){
195725 c = *pEnd++ & 0x80;
195726 testcase( c!=0 && (*pEnd)==0 );
195728 pEnd++; /* Advance past the POS_END terminator byte */
195731 int n = (int)(pEnd - *ppPoslist);
195737 *ppPoslist = pEnd;
195758 char *pEnd = *ppPoslist;
195764 while( 0xFE & (*pEnd | c) ){
195765 c = *pEnd++ & 0x80;
195766 testcase( c!=0 && ((*pEnd)&0xfe)==0 );
195769 int n = (int)(pEnd - *ppPoslist);
195775 *ppPoslist = pEnd;
196119 ** pEnd points 1 byte past the end of the buffer. When this function is
196120 ** called, if *pp points to pEnd or greater, then the end of the buffer
196123 ** If *pp does not point to or past pEnd
196132 char *pEnd, /* End of buffer */
196136 if( *pp>=pEnd ){
196395 char *pEnd = &pList[nList];
196406 while( p<pEnd ){
198178 char *pEnd = &aDoclist[nDoclist];
198181 while( pDocid<pEnd ){
198187 while( pDocid<pEnd && *pDocid==0 ) pDocid++;
198191 *pnList = (int)(pEnd - pNext);
198257 char *pEnd; /* 1 byte past end of aAll */
198266 if( pIter==0 || pIter>=(pEnd = pDL->aAll + pDL->nAll) ){
198287 while( pIter<pEnd && *pIter==0 ) pIter++;
198632 const char *pEnd;
198640 pEnd = &a[sqlite3_column_bytes(pStmt, 0)];
198641 a += sqlite3Fts3GetVarintBounded(a, pEnd, &nDoc);
198642 while( a<pEnd ){
198643 a += sqlite3Fts3GetVarintBounded(a, pEnd, &nByte);
205506 char *pEnd = &pReader->aDoclist[pReader->nDoclist];
205537 while( p<pEnd && *p==0 ) p++;
205544 if( p>=pEnd ){
206630 char *pEnd = &pList[nList];
206637 while( p<pEnd && (c | *p)&0xFE ) c = *p++ & 0x80;
206653 if( bZero && (pEnd - &pList[nList])>0){
206654 memset(&pList[nList], 0, pEnd - &pList[nList]);
209249 char *pEnd = &pCsr[csr.nDoclist];
209256 while( pCsr<pEnd ){
209259 if( pCsr<pEnd ){
210689 char *pEnd = *ppCollist;
210694 while( 0xFE & (*pEnd | c) ){
210695 c = *pEnd++ & 0x80;
210699 *ppCollist = pEnd;
210890 const char *pEnd;
210907 pEnd = a + n;
210908 a += sqlite3Fts3GetVarintBounded(a, pEnd, &nDoc);
210909 if( nDoc<=0 || a>pEnd ){
210915 if( ppEnd ) *ppEnd = pEnd;
211106 const char *pEnd; /* First byte past end of length array */
211108 rc = fts3MatchinfoSelectDoctotal(pTab, &pSelect, &nDoc, &a, &pEnd);
211115 if( a>pEnd ){
211132 const char *pEnd = a + sqlite3_column_bytes(pSelectDocsize, 0);
211135 a += sqlite3Fts3GetVarintBounded(a, pEnd, &nToken);
211136 if( a>pEnd ){
253762 const u8 *pEnd = &p[nPos]; /* One byte past end of position list */
253780 /* Advance pointer p until it points to pEnd or an 0x01 byte that is
253782 while( p<pEnd && *p!=0x01 ){
253794 if( p>=pEnd ){
253885 u8 *pEnd = (u8*)&a[pSeg->nPos];
253895 while( a<pEnd ){
254054 Fts5StructureLevel *pEnd = &pStruct->aLevel[pStruct->nLevel];
254060 for(pLvl=&pStruct->aLevel[0]; pLvl<pEnd; pLvl++){
265515 const char *pEnd = &aFold[nFold-6];
265553 if( zOut>pEnd ){
265564 pEnd = &aFold[nFold-6];
Indexes created Sat Sep 12 00:25:55 UTC 2026