Lines Matching refs:pX
19315 struct tm *pX; in osLocaltime() local
19320 pX = localtime(t); in osLocaltime()
19322 if( sqlite3GlobalConfig.bLocaltimeFault ) pX = 0; in osLocaltime()
19324 if( pX ) *pTm = *pX; in osLocaltime()
19326 rc = pX==0; in osLocaltime()
22976 static int debugMutexHeld(sqlite3_mutex *pX){ in debugMutexHeld() argument
22977 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexHeld()
22980 static int debugMutexNotheld(sqlite3_mutex *pX){ in debugMutexNotheld() argument
22981 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexNotheld()
23027 static void debugMutexFree(sqlite3_mutex *pX){ in debugMutexFree() argument
23028 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexFree()
23050 static void debugMutexEnter(sqlite3_mutex *pX){ in debugMutexEnter() argument
23051 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexEnter()
23052 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexEnter()
23055 static int debugMutexTry(sqlite3_mutex *pX){ in debugMutexTry() argument
23056 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexTry()
23057 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexTry()
23068 static void debugMutexLeave(sqlite3_mutex *pX){ in debugMutexLeave() argument
23069 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexLeave()
23070 assert( debugMutexHeld(pX) ); in debugMutexLeave()
23072 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexLeave()
26556 Expr *pX = pExpr->pLeft;
26560 sqlite3TreeViewExpr(pView, pX, 1);
34374 unixShm *pX; /* For looping over all siblings */
34398 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34399 if( pX==p ) continue;
34400 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
34401 allMask |= pX->sharedMask;
34423 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34424 if( (pX->exclMask & mask)!=0 ){
34428 allShared |= pX->sharedMask;
34448 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34449 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
41644 winShm *pX; /* For looping over all siblings */
41664 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41665 if( pX==p ) continue;
41666 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
41667 allMask |= pX->sharedMask;
41689 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41690 if( (pX->exclMask & mask)!=0 ){
41694 allShared |= pX->sharedMask;
41714 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41715 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
45250 PgHdr1 *pX = (PgHdr1*)&zBulk[pCache->szPage];
45251 pX->page.pBuf = zBulk;
45252 pX->page.pExtra = &pX[1];
45253 pX->isBulkLocal = 1;
45254 pX->isAnchor = 0;
45255 pX->pNext = pCache->pFree;
45256 pCache->pFree = pX;
63135 BtCursor *pX; /* Looping over other all cursors */
63176 for(pX=pBt->pCursor; pX; pX=pX->pNext){
63177 if( pX->pgnoRoot==(Pgno)iTable ){
63178 pX->curFlags |= BTCF_Multiple;
65140 const BtreePayload *pX, /* Payload with which to construct the cell */
65165 nPayload = pX->nData + pX->nZero;
65166 pSrc = pX->pData;
65167 nSrc = pX->nData;
65170 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
65172 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
65173 nSrc = nPayload = (int)pX->nKey;
65174 pSrc = pX->pKey;
65216 assert( info.nKey==pX->nKey );
67017 const BtreePayload *pX, /* Content of the row to be inserted */
67049 assert( (pX->pKey==0)==(pCur->pKeyInfo==0) );
67068 assert( pX->pKey==0 );
67071 invalidateIncrblobCursors(p, pX->nKey, 0);
67076 ((pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey) );
67081 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
67084 rc = sqlite3BtreeMovetoUnpacked(pCur, 0, pX->nKey, flags!=0, &loc);
67088 if( pX->nMem ){
67091 r.aMem = pX->aMem;
67092 r.nField = pX->nMem;
67100 rc = btreeMoveto(pCur, pX->pKey, pX->nKey, flags!=0, &loc);
67107 assert( pPage->intKey || pX->nKey>=0 );
67111 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
67116 rc = fillInCell(pPage, newCell, pX, &szNew);
67198 pCur->pKey = sqlite3Malloc( pX->nKey );
67202 memcpy(pCur->pKey, pX->pKey, pX->nKey);
67206 pCur->nKey = pX->nKey;
70384 Mem *pX;
70385 for(i=0, pX=pVdbe->aMem; i<pVdbe->nMem; i++, pX++){
70386 if( pX->pScopyFrom==pMem ){
70387 pX->flags |= MEM_Undefined;
70388 pX->pScopyFrom = 0;
81613 Btree *pX;
81646 pX = pDb->pBt;
81647 assert( pX!=0 );
81691 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->uc.pCursor);
85033 Mem *pX;
85050 pX = &aMem[pOp->p3];
85052 assert( memIsValid(pX) );
85053 memAboutToChange(p, pX);
85054 apArg[i] = pX;
85055 pX++;
92722 static Select *isCandidateForInOpt(Expr *pX){
92728 if( !ExprHasProperty(pX, EP_xIsSelect) ) return 0; /* Not a subquery */
92729 if( ExprHasProperty(pX, EP_VarSelect) ) return 0; /* Correlated subq */
92730 p = pX->x.pSelect;
92881 Expr *pX, /* The right-hand side (RHS) of the IN operator */
92892 assert( pX->op==TK_IN );
92900 if( prRhsHasNull && (pX->flags & EP_xIsSelect) ){
92902 ExprList *pEList = pX->x.pSelect->pEList;
92914 if( pParse->nErr==0 && (p = isCandidateForInOpt(pX))!=0 ){
92951 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
92993 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
93056 && !ExprHasProperty(pX, EP_xIsSelect)
93057 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
93071 if( pX->pLeft->iColumn<0 && !ExprHasProperty(pX, EP_xIsSelect) ){
93077 sqlite3CodeSubselect(pParse, pX, rMayHaveNull, eType==IN_INDEX_ROWID);
93080 pX->iTable = iTab;
93085 n = sqlite3ExprVectorSize(pX->pLeft);
94661 Expr *pX; /* The X expression */
94671 if( (pX = pExpr->pLeft)!=0 ){
94672 tempX = *pX;
94673 testcase( pX->op==TK_COLUMN );
94688 if( pX ){
95462 Expr *pX = sqlite3ExprSkipCollate(pE1->pLeft);
95463 testcase( pX!=pE1->pLeft );
95464 if( sqlite3ExprCompare(pX, pE2->pLeft, iTab)==0 ) return 1;
120085 Select *pX; /* For looping over compound SELECTs in pSubq */
120087 for(pX=pSubq; pX; pX=pX->pPrior){
120088 if( (pX->selFlags & (SF_Aggregate|SF_Recursive))!=0 ){
120089 testcase( pX->selFlags & SF_Aggregate );
120090 testcase( pX->selFlags & SF_Recursive );
120091 testcase( pX!=pSubq );
120240 Select *pX;
120249 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
120250 if( pX==0 ) return WRC_Continue;
120764 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
120766 pX->zSpan = sqlite3DbStrDup(db, pSub->pEList->a[j].zSpan);
120767 testcase( pX->zSpan==0 );
120769 pX->zSpan = sqlite3MPrintf(db, "%s.%s.%s",
120771 testcase( pX->zSpan==0 );
120773 pX->bSpanIsTab = 1;
126732 Expr *pX = pTerm->pExpr;
126738 if( pX->op==TK_EQ || pX->op==TK_IS ){
126739 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
126740 }else if( pX->op==TK_ISNULL ){
126761 assert( pX->op==TK_IN );
126765 if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){
126771 if( ALWAYS(pLoop->aLTerm[i]) && pLoop->aLTerm[i]->pExpr==pX ) nEq++;
126774 if( (pX->flags & EP_xIsSelect)==0 || pX->x.pSelect->pEList->nExpr==1 ){
126775 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, 0);
126777 Select *pSelect = pX->x.pSelect;
126781 ExprList *pOrigLhs = pX->pLeft->x.pList;
126786 if( pLoop->aLTerm[i]->pExpr==pX ){
126796 Expr *pLeft = pX->pLeft;
126816 pX->pLeft = pLhs->a[0].pExpr;
126824 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, aiMap);
126829 pX->pLeft = pLeft;
126839 iTab = pX->iTable;
126860 if( pLoop->aLTerm[i]->pExpr==pX ){
127586 Expr *pX; /* The expression that defines the start bound */
127605 pX = pStart->pExpr;
127606 assert( pX!=0 );
127608 if( sqlite3ExprIsVector(pX->pRight) ){
127610 codeExprOrVector(pParse, pX->pRight, r1, 1);
127611 op = aMoveOp[(pX->op - TK_GT) | 0x0001];
127613 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
127615 op = aMoveOp[(pX->op - TK_GT)];
127619 VdbeCoverageIf(v, pX->op==TK_GT);
127620 VdbeCoverageIf(v, pX->op==TK_LE);
127621 VdbeCoverageIf(v, pX->op==TK_LT);
127622 VdbeCoverageIf(v, pX->op==TK_GE);
127631 Expr *pX;
127632 pX = pEnd->pExpr;
127633 assert( pX!=0 );
127638 codeExprOrVector(pParse, pX->pRight, memEndValue, 1);
127639 if( 0==sqlite3ExprIsVector(pX->pRight)
127640 && (pX->op==TK_LT || pX->op==TK_GT)
127646 if( 0==sqlite3ExprIsVector(pX->pRight) ){
130033 Expr *pX; /* An expression being tested */
130055 && (pX = sqlite3ExprSkipCollate(pTerm->pExpr->pRight))->op==TK_COLUMN
130059 if( pScan->aiCur[j]==pX->iTable
130060 && pScan->aiColumn[j]==pX->iColumn ){
130065 pScan->aiCur[j] = pX->iTable;
130066 pScan->aiColumn[j] = pX->iColumn;
130075 pX = pTerm->pExpr;
130076 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
130079 assert(pX->pLeft);
130081 pX->pLeft, pX->pRight);
130088 && (pX = pTerm->pExpr->pRight)->op==TK_COLUMN
130089 && pX->iTable==pScan->aiCur[0]
130090 && pX->iColumn==pScan->aiColumn[0]
130579 Expr *pX = pTerm->pExpr;
130582 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
131724 const WhereLoop *pX, /* First WhereLoop to compare */
131728 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){
131731 if( pY->nSkip > pX->nSkip ) return 0;
131732 if( pX->rRun >= pY->rRun ){
131733 if( pX->rRun > pY->rRun ) return 0; /* X costs more than Y */
131734 if( pX->nOut > pY->nOut ) return 0; /* X costs more than Y */
131736 for(i=pX->nLTerm-1; i>=0; i--){
131737 if( pX->aLTerm[i]==0 ) continue;
131739 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
132015 WhereTerm *pTerm, *pX;
132026 pX = pLoop->aLTerm[j];
132027 if( pX==0 ) continue;
132028 if( pX==pTerm ) break;
132029 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
133459 Expr *pX = pLoop->aLTerm[j]->pExpr;
133461 if( pLoop->aLTerm[i]->pExpr==pX ){
133688 WhereLoop **pX; /* Used to divy up the pSpace memory */
133722 pX = (WhereLoop**)(aFrom+mxChoice);
133723 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
133724 pFrom->aLoop = pX;
133733 aSortCost = (LogEst*)pX;
133737 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );