Lines Matching refs:pX
22230 struct tm *pX; in osLocaltime() local
22235 pX = localtime(t); in osLocaltime()
22237 if( sqlite3GlobalConfig.bLocaltimeFault ) pX = 0; in osLocaltime()
22239 if( pX ) *pTm = *pX; in osLocaltime()
22241 rc = pX==0; in osLocaltime()
26099 static int debugMutexHeld(sqlite3_mutex *pX){ in debugMutexHeld() argument
26100 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexHeld()
26103 static int debugMutexNotheld(sqlite3_mutex *pX){ in debugMutexNotheld() argument
26104 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexNotheld()
26150 static void debugMutexFree(sqlite3_mutex *pX){ in debugMutexFree() argument
26151 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexFree()
26173 static void debugMutexEnter(sqlite3_mutex *pX){ in debugMutexEnter() argument
26174 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexEnter()
26175 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexEnter()
26178 static int debugMutexTry(sqlite3_mutex *pX){ in debugMutexTry() argument
26179 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexTry()
26180 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexTry()
26191 static void debugMutexLeave(sqlite3_mutex *pX){ in debugMutexLeave() argument
26192 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexLeave()
26193 assert( debugMutexHeld(pX) ); in debugMutexLeave()
26195 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexLeave()
29669 Window *pX;
29672 for(pX=p->pWin; pX; pX=pX->pNextWin){
29673 sqlite3TreeViewWinFunc(pView, pX, pX->pNextWin!=0);
29699 Window *pX;
29701 for(pX=p->pWinDefn; pX; pX=pX->pNextWin){
29702 sqlite3TreeViewWindow(pView, pX, pX->pNextWin!=0);
30102 Expr *pX = pExpr->pLeft;
30106 sqlite3TreeViewExpr(pView, pX, 1);
38361 unixShm *pX; /* For looping over all siblings */
38407 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
38408 if( pX==p ) continue;
38409 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
38410 allMask |= pX->sharedMask;
38432 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
38433 if( (pX->exclMask & mask)!=0 ){
38437 allShared |= pX->sharedMask;
38457 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
38458 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
45757 winShm *pX; /* For looping over all siblings */
45777 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
45778 if( pX==p ) continue;
45779 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
45780 allMask |= pX->sharedMask;
45802 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
45803 if( (pX->exclMask & mask)!=0 ){
45807 allShared |= pX->sharedMask;
45827 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
45828 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
50074 PgHdr1 *pX = (PgHdr1*)&zBulk[pCache->szPage];
50075 pX->page.pBuf = zBulk;
50076 pX->page.pExtra = &pX[1];
50077 pX->isBulkLocal = 1;
50078 pX->isAnchor = 0;
50079 pX->pNext = pCache->pFree;
50080 pX->pLruPrev = 0; /* Initializing this saves a valgrind error */
50081 pCache->pFree = pX;
68863 BtCursor *pX; /* Looping over other all cursors */
68909 for(pX=pBt->pCursor; pX; pX=pX->pNext){
68910 if( pX->pgnoRoot==iTable ){
68911 pX->curFlags |= BTCF_Multiple;
70947 const BtreePayload *pX, /* Payload with which to construct the cell */
70971 nPayload = pX->nData + pX->nZero;
70972 pSrc = pX->pData;
70973 nSrc = pX->nData;
70976 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
70978 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
70979 nSrc = nPayload = (int)pX->nKey;
70980 pSrc = pX->pKey;
71033 assert( info.nKey==pX->nKey );
72996 const BtreePayload *pX, /* Source of data to write */
73000 int nData = pX->nData - iOffset;
73014 int rc = btreeOverwriteContent(pPage, pDest+nData, pX, iOffset+nData,
73019 if( memcmp(pDest, ((u8*)pX->pData) + iOffset, iAmt)!=0 ){
73026 memmove(pDest, ((u8*)pX->pData) + iOffset, iAmt);
73036 static int btreeOverwriteCell(BtCursor *pCur, const BtreePayload *pX){
73038 int nTotal = pX->nData + pX->nZero; /* Total bytes of to write */
73051 rc = btreeOverwriteContent(pPage, pCur->info.pPayload, pX,
73074 rc = btreeOverwriteContent(pPage, pPage->aData+4, pX,
73117 const BtreePayload *pX, /* Content of the row to be inserted */
73149 assert( (pX->pKey==0)==(pCur->pKeyInfo==0) );
73168 assert( pX->pKey==0 );
73171 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
73179 assert( pX->nKey==pCur->info.nKey );
73188 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
73191 assert( pX->nData>=0 && pX->nZero>=0 );
73193 && pCur->info.nPayload==(u32)pX->nData+pX->nZero
73196 return btreeOverwriteCell(pCur, pX);
73204 rc = sqlite3BtreeMovetoUnpacked(pCur, 0, pX->nKey, flags!=0, &loc);
73221 if( pX->nMem ){
73224 r.aMem = pX->aMem;
73225 r.nField = pX->nMem;
73233 rc = btreeMoveto(pCur, pX->pKey, pX->nKey, flags!=0, &loc);
73244 if( pCur->info.nKey==pX->nKey ){
73246 x2.pData = pX->pKey;
73247 x2.nData = pX->nKey;
73259 assert( pPage->intKey || pX->nKey>=0 );
73271 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
73276 rc = fillInCell(pPage, newCell, pX, &szNew);
73366 pCur->pKey = sqlite3Malloc( pX->nKey );
73370 memcpy(pCur->pKey, pX->pKey, pX->nKey);
73374 pCur->nKey = pX->nKey;
76795 Mem *pX;
76796 for(i=1, pX=pVdbe->aMem+1; i<pVdbe->nMem; i++, pX++){
76797 if( pX->pScopyFrom==pMem ){
76801 (int)(pX - pVdbe->aMem), (int)(pMem - pVdbe->aMem));
76809 mFlags = pMem->flags & pX->flags & pX->mScopyFlags;
76810 assert( (mFlags&(MEM_Int|MEM_IntReal))==0 || pMem->u.i==pX->u.i );
76814 pX->flags = MEM_Undefined;
76815 pX->pScopyFrom = 0;
89097 Btree *pX;
89130 pX = pDb->pBt;
89131 assert( pX!=0 );
89176 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->uc.pCursor);
92871 Mem *pX;
92890 pX = &aMem[pOp->p3];
92892 assert( memIsValid(pX) );
92893 memAboutToChange(p, pX);
92894 apArg[i] = pX;
92895 pX++;
102080 static Select *isCandidateForInOpt(Expr *pX){
102086 if( !ExprHasProperty(pX, EP_xIsSelect) ) return 0; /* Not a subquery */
102087 if( ExprHasProperty(pX, EP_VarSelect) ) return 0; /* Correlated subq */
102088 p = pX->x.pSelect;
102237 Expr *pX, /* The IN expression */
102249 assert( pX->op==TK_IN );
102257 if( prRhsHasNull && (pX->flags & EP_xIsSelect) ){
102259 ExprList *pEList = pX->x.pSelect->pEList;
102271 if( pParse->nErr==0 && (p = isCandidateForInOpt(pX))!=0 ){
102310 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
102353 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
102413 && !ExprHasProperty(pX, EP_xIsSelect)
102414 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
102431 assert( pX->op==TK_IN );
102432 sqlite3CodeRhsOfIN(pParse, pX, iTab);
102441 n = sqlite3ExprVectorSize(pX->pLeft);
104156 Expr *pX; /* The X expression */
104167 if( (pX = pExpr->pLeft)!=0 ){
104168 pDel = sqlite3ExprDup(db, pX, 0);
104173 testcase( pX->op==TK_COLUMN );
104187 if( pX ){
112751 Expr *pX = p->aCol[ii].pDflt;
112754 if( sqlite3ResolveSelfReference(pParse, p, NC_GenCol, pX, 0) ){
112761 sqlite3ExprDelete(db, pX);
133761 Select *pX;
133762 for(pX=pSubq; pX; pX=pX->pPrior){
133763 assert( (pX->selFlags & (SF_Recursive))==0 );
133940 Select *pX;
133949 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
133950 if( pX==0 ) return WRC_Continue;
134520 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
134521 sqlite3DbFree(db, pX->zEName);
134523 pX->zEName = sqlite3DbStrDup(db, pSub->pEList->a[j].zEName);
134524 testcase( pX->zEName==0 );
134526 pX->zEName = sqlite3MPrintf(db, "%s.%s.%s",
134528 testcase( pX->zEName==0 );
134530 pX->eEName = ENAME_TAB;
141937 Expr *pX /* The IN expression to be reduced */
141941 pNew = sqlite3ExprDup(db, pX, 0);
141951 if( pLoop->aLTerm[i]->pExpr==pX ){
141991 sqlite3TreeViewExpr(0, pX, 0);
142023 Expr *pX = pTerm->pExpr;
142029 if( pX->op==TK_EQ || pX->op==TK_IS ){
142030 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
142031 }else if( pX->op==TK_ISNULL ){
142052 assert( pX->op==TK_IN );
142056 if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){
142063 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;
142067 if( (pX->flags & EP_xIsSelect)==0 || pX->x.pSelect->pEList->nExpr==1 ){
142068 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, 0, &iTab);
142071 pX = removeUnindexableInClauseTerms(pParse, iEq, pLoop, pX);
142075 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, aiMap, &iTab);
142078 sqlite3ExprDelete(db, pX);
142079 pX = pTerm->pExpr;
142106 if( pLoop->aLTerm[i]->pExpr==pX ){
142662 IdxExprTrans *pX = p->u.pIdxTrans;
142663 if( sqlite3ExprCompare(0, pExpr, pX->pIdxExpr, pX->iTabCur)==0 ){
142664 preserveExpr(pX, pExpr);
142667 pExpr->iTable = pX->iIdxCur;
142668 pExpr->iColumn = pX->iIdxCol;
142685 IdxExprTrans *pX = p->u.pIdxTrans;
142686 if( pExpr->iTable==pX->iTabCur && pExpr->iColumn==pX->iTabCol ){
142688 preserveExpr(pX, pExpr);
142690 pExpr->iTable = pX->iIdxCur;
142691 pExpr->iColumn = pX->iIdxCol;
143022 Expr *pX; /* The expression that defines the start bound */
143041 pX = pStart->pExpr;
143042 assert( pX!=0 );
143044 if( sqlite3ExprIsVector(pX->pRight) ){
143046 codeExprOrVector(pParse, pX->pRight, r1, 1);
143047 testcase( pX->op==TK_GT );
143048 testcase( pX->op==TK_GE );
143049 testcase( pX->op==TK_LT );
143050 testcase( pX->op==TK_LE );
143051 op = aMoveOp[((pX->op - TK_GT - 1) & 0x3) | 0x1];
143052 assert( pX->op!=TK_GT || op==OP_SeekGE );
143053 assert( pX->op!=TK_GE || op==OP_SeekGE );
143054 assert( pX->op!=TK_LT || op==OP_SeekLE );
143055 assert( pX->op!=TK_LE || op==OP_SeekLE );
143057 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
143059 op = aMoveOp[(pX->op - TK_GT)];
143063 VdbeCoverageIf(v, pX->op==TK_GT);
143064 VdbeCoverageIf(v, pX->op==TK_LE);
143065 VdbeCoverageIf(v, pX->op==TK_LT);
143066 VdbeCoverageIf(v, pX->op==TK_GE);
143074 Expr *pX;
143075 pX = pEnd->pExpr;
143076 assert( pX!=0 );
143081 codeExprOrVector(pParse, pX->pRight, memEndValue, 1);
143082 if( 0==sqlite3ExprIsVector(pX->pRight)
143083 && (pX->op==TK_LT || pX->op==TK_GT)
143089 if( 0==sqlite3ExprIsVector(pX->pRight) ){
145857 Expr *pX; /* An expression being tested */
145879 && (pX = sqlite3ExprSkipCollateAndLikely(pTerm->pExpr->pRight))->op
145884 if( pScan->aiCur[j]==pX->iTable
145885 && pScan->aiColumn[j]==pX->iColumn ){
145890 pScan->aiCur[j] = pX->iTable;
145891 pScan->aiColumn[j] = pX->iColumn;
145900 pX = pTerm->pExpr;
145901 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
145904 assert(pX->pLeft);
145905 pColl = sqlite3ExprCompareCollSeq(pParse, pX);
145912 && (pX = pTerm->pExpr->pRight)->op==TK_COLUMN
145913 && pX->iTable==pScan->aiCur[0]
145914 && pX->iColumn==pScan->aiColumn[0]
146423 Expr *pX = pTerm->pExpr;
146426 pColl = sqlite3ExprCompareCollSeq(pParse, pX);
147583 const WhereLoop *pX, /* First WhereLoop to compare */
147587 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){
147590 if( pY->nSkip > pX->nSkip ) return 0;
147591 if( pX->rRun >= pY->rRun ){
147592 if( pX->rRun > pY->rRun ) return 0; /* X costs more than Y */
147593 if( pX->nOut > pY->nOut ) return 0; /* X costs more than Y */
147595 for(i=pX->nLTerm-1; i>=0; i--){
147596 if( pX->aLTerm[i]==0 ) continue;
147598 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
147602 if( (pX->wsFlags&WHERE_IDX_ONLY)!=0
147890 WhereTerm *pTerm, *pX;
147902 pX = pLoop->aLTerm[j];
147903 if( pX==0 ) continue;
147904 if( pX==pTerm ) break;
147905 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
148932 Expr *pX = pHidden->pWC->a[iTerm].pExpr;
148933 if( pX->pLeft ){
148934 pC = sqlite3ExprCompareCollSeq(pHidden->pParse, pX);
149470 Expr *pX = pLoop->aLTerm[j]->pExpr;
149472 if( pLoop->aLTerm[i]->pExpr==pX ){
149711 WhereLoop **pX; /* Used to divy up the pSpace memory */
149745 pX = (WhereLoop**)(aFrom+mxChoice);
149746 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
149747 pFrom->aLoop = pX;
149756 aSortCost = (LogEst*)pX;
149760 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );
167275 const unsigned char *pX = (const unsigned char*)pEnd;
167279 u64 c = p<pX ? *p : 0;