Lines Matching defs:pEnd
11624 void *pEnd; /* First byte past end of available space */
21742 return p>=db->lookaside.pStart && p<db->lookaside.pEnd;
41307 ** szSlot, nSlot, pStart, pEnd, nReserve, and isInit values are all
41317 void *pStart, *pEnd; /* Bounds of global page cache memory */
41379 pcache1.pEnd = pBuf;
41471 if( p>=pcache1.pStart && p<pcache1.pEnd ){
41500 if( p>=pcache1.pStart && p<pcache1.pEnd ){
55599 u8 *pEnd = &pIter[8];
55603 }while( (*pIter)>=0x80 && pIter<pEnd );
55615 u8 *pEnd = &pIter[7];
55620 if( pIter>=pEnd ){
55660 u8 *pEnd = &pIter[8];
55664 }while( *(pIter)>=0x80 && pIter<pEnd );
55706 u8 *pEnd; /* End mark for a varint */
55721 pEnd = &pIter[8];
55725 }while( *(pIter)>=0x80 && pIter<pEnd );
55732 pEnd = &pIter[9];
55733 while( (*pIter++)&0x80 && pIter<pEnd );
55755 u8 *pEnd; /* End mark for a varint */
55769 pEnd = pIter + 9;
55770 while( (*pIter++)&0x80 && pIter<pEnd );
60922 u8 * const pEnd = &aData[usableSize];
60931 pData = pEnd;
60934 if( pCell>aData && pCell<pEnd ){
61035 u8 * const pEnd = &aData[pPg->pBt->usableSize];
61045 if( pCell>=pStart && pCell<pEnd ){
61058 if( pFree+sz>pEnd ) return 0;
68001 Mem *pEnd = &p[N];
68007 }while( (++p)<pEnd );
68011 assert( (&p[1])==pEnd || p[0].db==p[1].db );
68038 }while( (++p)<pEnd );
68311 ** *ppFrom points to available space and pEnd points to the end of the
68323 u8 *pEnd, /* Pointer to 1 byte past the end of *ppFrom buffer */
68329 if( &(*ppFrom)[nByte] <= pEnd ){
78366 Mem *pEnd; /* Last memory cell in new array */
78438 pEnd = &VdbeFrameMem(pFrame)[pFrame->nChildMem];
78439 for(pMem=VdbeFrameMem(pFrame); pMem!=pEnd; pMem++){
94620 Token *pEnd, /* The ')' before options in the CREATE TABLE */
94629 if( pEnd==0 && pSelect==0 ){
94772 Token *pEnd2 = tabOpts ? &pParse->sLastToken : pEnd;
94840 assert( !pSelect && pCons && pEnd );
94842 pCons = pEnd;
117137 SQLITE_PRIVATE void sqlite3VtabFinishParse(Parse *pParse, Token *pEnd){
117160 if( pEnd ){
117161 pParse->sNameToken.n = (int)(pEnd->z - pParse->sNameToken.z) + pEnd->n;
119262 WhereTerm *pStart, *pEnd;
119266 pStart = pEnd = 0;
119268 if( pLoop->wsFlags & WHERE_TOP_LIMIT ) pEnd = pLoop->aLTerm[j++];
119269 assert( pStart!=0 || pEnd!=0 );
119272 pStart = pEnd;
119273 pEnd = pTerm;
119312 if( pEnd ){
119314 pX = pEnd->pExpr;
119316 assert( (pEnd->wtFlags & TERM_VNULL)==0 );
119317 testcase( pEnd->leftCursor!=iCur ); /* Transitive constraints */
119318 testcase( pEnd->wtFlags & TERM_VIRTUAL );
119326 disableTerm(pLevel, pEnd);
124458 struct SrcList_item *pEnd = &pTabList->a[pWInfo->nLevel];
124467 for(iTab=0, pItem=pTabList->a; pItem<pEnd; iTab++, pItem++){
124479 for(p=&pItem[1]; p<pEnd; p++){
125603 WhereTerm *pTerm, *pEnd;
125612 pEnd = sWLB.pWC->a + sWLB.pWC->nTerm;
125613 for(pTerm=sWLB.pWC->a; pTerm<pEnd; pTerm++){
125620 if( pTerm<pEnd ) break;
126071 ** range of text beginning with pStart and going to the end of pEnd.
126073 static void spanSet(ExprSpan *pOut, Token *pStart, Token *pEnd){
126075 pOut->zEnd = &pEnd->z[pEnd->n];
131499 db->lookaside.pEnd = p;
131504 db->lookaside.pEnd = db;
137822 char *pEnd = *ppPoslist;
137830 ** The following while-loop moves pEnd to point to the first byte that is not
137832 ** pEnd once more so that it points to the byte immediately following the
137835 while( *pEnd | c ){
137836 c = *pEnd++ & 0x80;
137837 testcase( c!=0 && (*pEnd)==0 );
137839 pEnd++; /* Advance past the POS_END terminator byte */
137842 int n = (int)(pEnd - *ppPoslist);
137848 *ppPoslist = pEnd;
137869 char *pEnd = *ppPoslist;
137875 while( 0xFE & (*pEnd | c) ){
137876 c = *pEnd++ & 0x80;
137877 testcase( c!=0 && ((*pEnd)&0xfe)==0 );
137880 int n = (int)(pEnd - *ppPoslist);
137886 *ppPoslist = pEnd;
138213 ** pEnd points 1 byte past the end of the buffer. When this function is
138214 ** called, if *pp points to pEnd or greater, then the end of the buffer
138217 ** If *pp does not point to or past pEnd, then a single varint is read
138226 char *pEnd, /* End of buffer */
138230 if( *pp>=pEnd ){
138476 char *pEnd = &pList[nList];
138487 while( p<pEnd && *p==0x01 ){
140166 char *pEnd = &aDoclist[nDoclist];
140169 while( pDocid<pEnd ){
140175 while( pDocid<pEnd && *pDocid==0 ) pDocid++;
140179 *pnList = (int)(pEnd - pNext);
140245 char *pEnd = &pDL->aAll[pDL->nAll]; /* 1 byte past end of aAll */
140253 if( pIter>=pEnd ){
140274 while( pIter<pEnd && *pIter==0 ) pIter++;
140618 const char *pEnd;
140626 pEnd = &a[sqlite3_column_bytes(pStmt, 0)];
140628 while( a<pEnd ){
147367 char *pEnd = &pReader->aDoclist[pReader->nDoclist];
147398 while( p<pEnd && *p==0 ) p++;
147405 if( p>=pEnd ){
148471 char *pEnd = &pList[nList];
148478 while( p<pEnd && (c | *p)&0xFE ) c = *p++ & 0x80;
148494 if( bZero && &pList[nList]!=pEnd ){
148495 memset(&pList[nList], 0, pEnd - &pList[nList]);
150991 char *pEnd = &pCsr[csr.nDoclist];
150998 while( pCsr<pEnd ){
151001 if( pCsr<pEnd ){
152404 char *pEnd = *ppCollist;
152409 while( 0xFE & (*pEnd | c) ){
152410 c = *pEnd++ & 0x80;
152414 *ppCollist = pEnd;
175137 Fts5StructureLevel *pEnd = &pStruct->aLevel[pStruct->nLevel];
175143 for(pLvl=&pStruct->aLevel[0]; pLvl<pEnd; pLvl++){
176531 const u8 *pEnd = &p[n]; /* One byte past end of position list */
176535 /* Advance pointer p until it points to pEnd or an 0x01 byte that is
176539 if( p==pEnd ) return 0;
176545 /* Advance pointer p until it points to pEnd or an 0x01 byte that is
176548 while( p<pEnd && ((prev & 0x80) || *p!=0x01) ){
182222 const char *pEnd = &aFold[nFold-6];
182258 if( zOut>pEnd ){
182269 pEnd = &aFold[nFold-6];
