Lines Matching refs:pX
19406 struct tm *pX; in osLocaltime() local
19411 pX = localtime(t); in osLocaltime()
19413 if( sqlite3GlobalConfig.bLocaltimeFault ) pX = 0; in osLocaltime()
19415 if( pX ) *pTm = *pX; in osLocaltime()
19417 rc = pX==0; in osLocaltime()
23067 static int debugMutexHeld(sqlite3_mutex *pX){ in debugMutexHeld() argument
23068 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexHeld()
23071 static int debugMutexNotheld(sqlite3_mutex *pX){ in debugMutexNotheld() argument
23072 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexNotheld()
23118 static void debugMutexFree(sqlite3_mutex *pX){ in debugMutexFree() argument
23119 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexFree()
23141 static void debugMutexEnter(sqlite3_mutex *pX){ in debugMutexEnter() argument
23142 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexEnter()
23143 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexEnter()
23146 static int debugMutexTry(sqlite3_mutex *pX){ in debugMutexTry() argument
23147 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexTry()
23148 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexTry()
23159 static void debugMutexLeave(sqlite3_mutex *pX){ in debugMutexLeave() argument
23160 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexLeave()
23161 assert( debugMutexHeld(pX) ); in debugMutexLeave()
23163 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexLeave()
26657 Expr *pX = pExpr->pLeft;
26661 sqlite3TreeViewExpr(pView, pX, 1);
34533 unixShm *pX; /* For looping over all siblings */
34557 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34558 if( pX==p ) continue;
34559 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
34560 allMask |= pX->sharedMask;
34582 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34583 if( (pX->exclMask & mask)!=0 ){
34587 allShared |= pX->sharedMask;
34607 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34608 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
41803 winShm *pX; /* For looping over all siblings */
41823 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41824 if( pX==p ) continue;
41825 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
41826 allMask |= pX->sharedMask;
41848 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41849 if( (pX->exclMask & mask)!=0 ){
41853 allShared |= pX->sharedMask;
41873 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41874 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
45408 PgHdr1 *pX = (PgHdr1*)&zBulk[pCache->szPage];
45409 pX->page.pBuf = zBulk;
45410 pX->page.pExtra = &pX[1];
45411 pX->isBulkLocal = 1;
45412 pX->isAnchor = 0;
45413 pX->pNext = pCache->pFree;
45414 pCache->pFree = pX;
63387 BtCursor *pX; /* Looping over other all cursors */
63428 for(pX=pBt->pCursor; pX; pX=pX->pNext){
63429 if( pX->pgnoRoot==(Pgno)iTable ){
63430 pX->curFlags |= BTCF_Multiple;
65393 const BtreePayload *pX, /* Payload with which to construct the cell */
65418 nPayload = pX->nData + pX->nZero;
65419 pSrc = pX->pData;
65420 nSrc = pX->nData;
65423 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
65425 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
65426 nSrc = nPayload = (int)pX->nKey;
65427 pSrc = pX->pKey;
65469 assert( info.nKey==pX->nKey );
67270 const BtreePayload *pX, /* Content of the row to be inserted */
67302 assert( (pX->pKey==0)==(pCur->pKeyInfo==0) );
67321 assert( pX->pKey==0 );
67324 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
67329 ((pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey) );
67334 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
67337 rc = sqlite3BtreeMovetoUnpacked(pCur, 0, pX->nKey, flags!=0, &loc);
67341 if( pX->nMem ){
67344 r.aMem = pX->aMem;
67345 r.nField = pX->nMem;
67353 rc = btreeMoveto(pCur, pX->pKey, pX->nKey, flags!=0, &loc);
67360 assert( pPage->intKey || pX->nKey>=0 );
67364 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
67369 rc = fillInCell(pPage, newCell, pX, &szNew);
67452 pCur->pKey = sqlite3Malloc( pX->nKey );
67456 memcpy(pCur->pKey, pX->pKey, pX->nKey);
67460 pCur->nKey = pX->nKey;
70647 Mem *pX;
70648 for(i=0, pX=pVdbe->aMem; i<pVdbe->nMem; i++, pX++){
70649 if( pX->pScopyFrom==pMem ){
70650 pX->flags |= MEM_Undefined;
70651 pX->pScopyFrom = 0;
81922 Btree *pX;
81955 pX = pDb->pBt;
81956 assert( pX!=0 );
82000 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->uc.pCursor);
85382 Mem *pX;
85399 pX = &aMem[pOp->p3];
85401 assert( memIsValid(pX) );
85402 memAboutToChange(p, pX);
85403 apArg[i] = pX;
85404 pX++;
93136 static Select *isCandidateForInOpt(Expr *pX){
93142 if( !ExprHasProperty(pX, EP_xIsSelect) ) return 0; /* Not a subquery */
93143 if( ExprHasProperty(pX, EP_VarSelect) ) return 0; /* Correlated subq */
93144 p = pX->x.pSelect;
93295 Expr *pX, /* The right-hand side (RHS) of the IN operator */
93306 assert( pX->op==TK_IN );
93314 if( prRhsHasNull && (pX->flags & EP_xIsSelect) ){
93316 ExprList *pEList = pX->x.pSelect->pEList;
93328 if( pParse->nErr==0 && (p = isCandidateForInOpt(pX))!=0 ){
93365 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
93407 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
93470 && !ExprHasProperty(pX, EP_xIsSelect)
93471 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
93485 if( pX->pLeft->iColumn<0 && !ExprHasProperty(pX, EP_xIsSelect) ){
93491 sqlite3CodeSubselect(pParse, pX, rMayHaveNull, eType==IN_INDEX_ROWID);
93494 pX->iTable = iTab;
93499 n = sqlite3ExprVectorSize(pX->pLeft);
95094 Expr *pX; /* The X expression */
95104 if( (pX = pExpr->pLeft)!=0 ){
95105 tempX = *pX;
95106 testcase( pX->op==TK_COLUMN );
95121 if( pX ){
95895 Expr *pX = sqlite3ExprSkipCollate(pE1->pLeft);
95896 testcase( pX!=pE1->pLeft );
95897 if( sqlite3ExprCompare(pX, pE2->pLeft, iTab)==0 ) return 1;
120565 Select *pX; /* For looping over compound SELECTs in pSubq */
120567 for(pX=pSubq; pX; pX=pX->pPrior){
120568 if( (pX->selFlags & (SF_Aggregate|SF_Recursive))!=0 ){
120569 testcase( pX->selFlags & SF_Aggregate );
120570 testcase( pX->selFlags & SF_Recursive );
120571 testcase( pX!=pSubq );
120726 Select *pX;
120735 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
120736 if( pX==0 ) return WRC_Continue;
121250 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
121252 pX->zSpan = sqlite3DbStrDup(db, pSub->pEList->a[j].zSpan);
121253 testcase( pX->zSpan==0 );
121255 pX->zSpan = sqlite3MPrintf(db, "%s.%s.%s",
121257 testcase( pX->zSpan==0 );
121259 pX->bSpanIsTab = 1;
127355 Expr *pX = pTerm->pExpr;
127361 if( pX->op==TK_EQ || pX->op==TK_IS ){
127362 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
127363 }else if( pX->op==TK_ISNULL ){
127384 assert( pX->op==TK_IN );
127388 if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){
127394 if( ALWAYS(pLoop->aLTerm[i]) && pLoop->aLTerm[i]->pExpr==pX ) nEq++;
127397 if( (pX->flags & EP_xIsSelect)==0 || pX->x.pSelect->pEList->nExpr==1 ){
127398 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, 0);
127400 Select *pSelect = pX->x.pSelect;
127404 ExprList *pOrigLhs = pX->pLeft->x.pList;
127409 if( pLoop->aLTerm[i]->pExpr==pX ){
127419 Expr *pLeft = pX->pLeft;
127439 pX->pLeft = pLhs->a[0].pExpr;
127447 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, aiMap);
127452 pX->pLeft = pLeft;
127462 iTab = pX->iTable;
127483 if( pLoop->aLTerm[i]->pExpr==pX ){
128013 IdxExprTrans *pX = p->u.pIdxTrans;
128014 if( sqlite3ExprCompare(pExpr, pX->pIdxExpr, pX->iTabCur)==0 ){
128016 pExpr->iTable = pX->iIdxCur;
128017 pExpr->iColumn = pX->iIdxCol;
128274 Expr *pX; /* The expression that defines the start bound */
128293 pX = pStart->pExpr;
128294 assert( pX!=0 );
128296 if( sqlite3ExprIsVector(pX->pRight) ){
128298 codeExprOrVector(pParse, pX->pRight, r1, 1);
128299 op = aMoveOp[(pX->op - TK_GT) | 0x0001];
128301 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
128303 op = aMoveOp[(pX->op - TK_GT)];
128307 VdbeCoverageIf(v, pX->op==TK_GT);
128308 VdbeCoverageIf(v, pX->op==TK_LE);
128309 VdbeCoverageIf(v, pX->op==TK_LT);
128310 VdbeCoverageIf(v, pX->op==TK_GE);
128319 Expr *pX;
128320 pX = pEnd->pExpr;
128321 assert( pX!=0 );
128326 codeExprOrVector(pParse, pX->pRight, memEndValue, 1);
128327 if( 0==sqlite3ExprIsVector(pX->pRight)
128328 && (pX->op==TK_LT || pX->op==TK_GT)
128334 if( 0==sqlite3ExprIsVector(pX->pRight) ){
130747 Expr *pX; /* An expression being tested */
130769 && (pX = sqlite3ExprSkipCollate(pTerm->pExpr->pRight))->op==TK_COLUMN
130773 if( pScan->aiCur[j]==pX->iTable
130774 && pScan->aiColumn[j]==pX->iColumn ){
130779 pScan->aiCur[j] = pX->iTable;
130780 pScan->aiColumn[j] = pX->iColumn;
130789 pX = pTerm->pExpr;
130790 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
130793 assert(pX->pLeft);
130795 pX->pLeft, pX->pRight);
130802 && (pX = pTerm->pExpr->pRight)->op==TK_COLUMN
130803 && pX->iTable==pScan->aiCur[0]
130804 && pX->iColumn==pScan->aiColumn[0]
131293 Expr *pX = pTerm->pExpr;
131296 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
132438 const WhereLoop *pX, /* First WhereLoop to compare */
132442 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){
132445 if( pY->nSkip > pX->nSkip ) return 0;
132446 if( pX->rRun >= pY->rRun ){
132447 if( pX->rRun > pY->rRun ) return 0; /* X costs more than Y */
132448 if( pX->nOut > pY->nOut ) return 0; /* X costs more than Y */
132450 for(i=pX->nLTerm-1; i>=0; i--){
132451 if( pX->aLTerm[i]==0 ) continue;
132453 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
132729 WhereTerm *pTerm, *pX;
132740 pX = pLoop->aLTerm[j];
132741 if( pX==0 ) continue;
132742 if( pX==pTerm ) break;
132743 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
134175 Expr *pX = pLoop->aLTerm[j]->pExpr;
134177 if( pLoop->aLTerm[i]->pExpr==pX ){
134405 WhereLoop **pX; /* Used to divy up the pSpace memory */
134439 pX = (WhereLoop**)(aFrom+mxChoice);
134440 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
134441 pFrom->aLoop = pX;
134450 aSortCost = (LogEst*)pX;
134454 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );