Lines Matching defs:pX
12895 #define OP_Column 99 /* synopsis: r[P3]=PX */
19402 struct tm *pX;
19407 pX = localtime(t);
19409 if( sqlite3GlobalConfig.bLocaltimeFault ) pX = 0;
19411 if( pX ) *pTm = *pX;
19413 rc = pX==0;
23063 static int debugMutexHeld(sqlite3_mutex *pX){
23064 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
23067 static int debugMutexNotheld(sqlite3_mutex *pX){
23068 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
23114 static void debugMutexFree(sqlite3_mutex *pX){
23115 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
23137 static void debugMutexEnter(sqlite3_mutex *pX){
23138 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
23139 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
23142 static int debugMutexTry(sqlite3_mutex *pX){
23143 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
23144 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
23155 static void debugMutexLeave(sqlite3_mutex *pX){
23156 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
23157 assert( debugMutexHeld(pX) );
23159 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
25408 unsigned px = 0;
25410 px = px*10 + c - '0';
25413 testcase( px>0x7fffffff );
25414 precision = px & 0x7fffffff;
26653 Expr *pX = pExpr->pLeft;
26657 sqlite3TreeViewExpr(pView, pX, 1);
29672 /* 99 */ "Column" OpHelp("r[P3]=PX"),
34529 unixShm *pX; /* For looping over all siblings */
34553 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34554 if( pX==p ) continue;
34555 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
34556 allMask |= pX->sharedMask;
34578 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34579 if( (pX->exclMask & mask)!=0 ){
34583 allShared |= pX->sharedMask;
34603 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34604 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
41799 winShm *pX; /* For looping over all siblings */
41819 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41820 if( pX==p ) continue;
41821 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
41822 allMask |= pX->sharedMask;
41844 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41845 if( (pX->exclMask & mask)!=0 ){
41849 allShared |= pX->sharedMask;
41869 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
41870 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
45404 PgHdr1 *pX = (PgHdr1*)&zBulk[pCache->szPage];
45405 pX->page.pBuf = zBulk;
45406 pX->page.pExtra = &pX[1];
45407 pX->isBulkLocal = 1;
45408 pX->isAnchor = 0;
45409 pX->pNext = pCache->pFree;
45410 pCache->pFree = pX;
63382 BtCursor *pX; /* Looping over other all cursors */
63423 for(pX=pBt->pCursor; pX; pX=pX->pNext){
63424 if( pX->pgnoRoot==(Pgno)iTable ){
63425 pX->curFlags |= BTCF_Multiple;
65388 const BtreePayload *pX, /* Payload with which to construct the cell */
65413 nPayload = pX->nData + pX->nZero;
65414 pSrc = pX->pData;
65415 nSrc = pX->nData;
65418 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
65420 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
65421 nSrc = nPayload = (int)pX->nKey;
65422 pSrc = pX->pKey;
65464 assert( info.nKey==pX->nKey );
67235 ** is described by the pX object. The pCur cursor is used only to
67239 ** For a table btree (used for rowid tables), only the pX.nKey value of
67240 ** the key is used. The pX.pKey value must be NULL. The pX.nKey is the
67241 ** rowid or INTEGER PRIMARY KEY of the row. The pX.nData,pData,nZero fields
67245 ** key is an arbitrary byte sequence stored in pX.pKey,nKey. The
67246 ** pX.pData,nData,nZero fields must be zero.
67259 ** if pX->nMem is non-zero, then pX->aMem contains pointers to the unpacked
67260 ** key values and pX->aMem can be used instead of pX->pKey to avoid having
67265 const BtreePayload *pX, /* Content of the row to be inserted */
67297 assert( (pX->pKey==0)==(pCur->pKeyInfo==0) );
67316 assert( pX->pKey==0 );
67319 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
67324 ((pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey) );
67329 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
67332 rc = sqlite3BtreeMovetoUnpacked(pCur, 0, pX->nKey, flags!=0, &loc);
67336 if( pX->nMem ){
67339 r.aMem = pX->aMem;
67340 r.nField = pX->nMem;
67348 rc = btreeMoveto(pCur, pX->pKey, pX->nKey, flags!=0, &loc);
67355 assert( pPage->intKey || pX->nKey>=0 );
67359 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
67364 rc = fillInCell(pPage, newCell, pX, &szNew);
67447 pCur->pKey = sqlite3Malloc( pX->nKey );
67451 memcpy(pCur->pKey, pX->pKey, pX->nKey);
67455 pCur->nKey = pX->nKey;
70642 Mem *pX;
70643 for(i=0, pX=pVdbe->aMem; i<pVdbe->nMem; i++, pX++){
70644 if( pX->pScopyFrom==pMem ){
70645 pX->flags |= MEM_Undefined;
70646 pX->pScopyFrom = 0;
72721 ** "PX" -> "r[X]"
72722 ** "PX@PY" -> "r[X..X+Y-1]" or "r[x]" if y is 0 or 1
72723 ** "PX@PY+1" -> "r[X..X+Y]" or "r[x]" if y is 0
80913 ** Synopsis: r[P3]=PX
81905 Btree *pX;
81938 pX = pDb->pBt;
81939 assert( pX!=0 );
81983 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->uc.pCursor);
85365 Mem *pX;
85382 pX = &aMem[pOp->p3];
85384 assert( memIsValid(pX) );
85385 memAboutToChange(p, pX);
85386 apArg[i] = pX;
85387 pX++;
93112 ** pX is the RHS of an IN operator. If pX is a SELECT statement
93114 ** a pointer to the SELECT statement. If pX is not a SELECT statement,
93119 static Select *isCandidateForInOpt(Expr *pX){
93125 if( !ExprHasProperty(pX, EP_xIsSelect) ) return 0; /* Not a subquery */
93126 if( ExprHasProperty(pX, EP_VarSelect) ) return 0; /* Correlated subq */
93127 p = pX->x.pSelect;
93196 ** The pX parameter is the expression on the RHS of the IN operator, which
93204 ** and pX->iTable is set to the index of that cursor.
93216 ** An existing b-tree might be used if the RHS expression pX is a simple
93223 ** pX->iTable made to point to the ephemeral table instead of an
93278 Expr *pX, /* The right-hand side (RHS) of the IN operator */
93289 assert( pX->op==TK_IN );
93297 if( prRhsHasNull && (pX->flags & EP_xIsSelect) ){
93299 ExprList *pEList = pX->x.pSelect->pEList;
93311 if( pParse->nErr==0 && (p = isCandidateForInOpt(pX))!=0 ){
93348 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
93390 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
93453 && !ExprHasProperty(pX, EP_xIsSelect)
93454 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
93468 if( pX->pLeft->iColumn<0 && !ExprHasProperty(pX, EP_xIsSelect) ){
93474 sqlite3CodeSubselect(pParse, pX, rMayHaveNull, eType==IN_INDEX_ROWID);
93477 pX->iTable = iTab;
93482 n = sqlite3ExprVectorSize(pX->pLeft);
95077 Expr *pX; /* The X expression */
95087 if( (pX = pExpr->pLeft)!=0 ){
95088 tempX = *pX;
95089 testcase( pX->op==TK_COLUMN );
95104 if( pX ){
95878 Expr *pX = sqlite3ExprSkipCollate(pE1->pLeft);
95879 testcase( pX!=pE1->pLeft );
95880 if( sqlite3ExprCompare(pX, pE2->pLeft, iTab)==0 ) return 1;
120548 Select *pX; /* For looping over compound SELECTs in pSubq */
120550 for(pX=pSubq; pX; pX=pX->pPrior){
120551 if( (pX->selFlags & (SF_Aggregate|SF_Recursive))!=0 ){
120552 testcase( pX->selFlags & SF_Aggregate );
120553 testcase( pX->selFlags & SF_Recursive );
120554 testcase( pX!=pSubq );
120709 Select *pX;
120718 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
120719 if( pX==0 ) return WRC_Continue;
121233 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
121235 pX->zSpan = sqlite3DbStrDup(db, pSub->pEList->a[j].zSpan);
121236 testcase( pX->zSpan==0 );
121238 pX->zSpan = sqlite3MPrintf(db, "%s.%s.%s",
121240 testcase( pX->zSpan==0 );
121242 pX->bSpanIsTab = 1;
127338 Expr *pX = pTerm->pExpr;
127344 if( pX->op==TK_EQ || pX->op==TK_IS ){
127345 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
127346 }else if( pX->op==TK_ISNULL ){
127367 assert( pX->op==TK_IN );
127371 if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){
127377 if( ALWAYS(pLoop->aLTerm[i]) && pLoop->aLTerm[i]->pExpr==pX ) nEq++;
127380 if( (pX->flags & EP_xIsSelect)==0 || pX->x.pSelect->pEList->nExpr==1 ){
127381 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, 0);
127383 Select *pSelect = pX->x.pSelect;
127387 ExprList *pOrigLhs = pX->pLeft->x.pList;
127389 ExprList *pLhs = 0; /* New pX->pLeft vector */
127392 if( pLoop->aLTerm[i]->pExpr==pX ){
127402 Expr *pLeft = pX->pLeft;
127422 pX->pLeft = pLhs->a[0].pExpr;
127430 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, aiMap);
127435 pX->pLeft = pLeft;
127445 iTab = pX->iTable;
127466 if( pLoop->aLTerm[i]->pExpr==pX ){
127996 IdxExprTrans *pX = p->u.pIdxTrans;
127997 if( sqlite3ExprCompare(pExpr, pX->pIdxExpr, pX->iTabCur)==0 ){
127999 pExpr->iTable = pX->iIdxCur;
128000 pExpr->iColumn = pX->iIdxCol;
128257 Expr *pX; /* The expression that defines the start bound */
128276 pX = pStart->pExpr;
128277 assert( pX!=0 );
128279 if( sqlite3ExprIsVector(pX->pRight) ){
128281 codeExprOrVector(pParse, pX->pRight, r1, 1);
128282 op = aMoveOp[(pX->op - TK_GT) | 0x0001];
128284 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
128286 op = aMoveOp[(pX->op - TK_GT)];
128290 VdbeCoverageIf(v, pX->op==TK_GT);
128291 VdbeCoverageIf(v, pX->op==TK_LE);
128292 VdbeCoverageIf(v, pX->op==TK_LT);
128293 VdbeCoverageIf(v, pX->op==TK_GE);
128302 Expr *pX;
128303 pX = pEnd->pExpr;
128304 assert( pX!=0 );
128309 codeExprOrVector(pParse, pX->pRight, memEndValue, 1);
128310 if( 0==sqlite3ExprIsVector(pX->pRight)
128311 && (pX->op==TK_LT || pX->op==TK_GT)
128317 if( 0==sqlite3ExprIsVector(pX->pRight) ){
130730 Expr *pX; /* An expression being tested */
130752 && (pX = sqlite3ExprSkipCollate(pTerm->pExpr->pRight))->op==TK_COLUMN
130756 if( pScan->aiCur[j]==pX->iTable
130757 && pScan->aiColumn[j]==pX->iColumn ){
130762 pScan->aiCur[j] = pX->iTable;
130763 pScan->aiColumn[j] = pX->iColumn;
130772 pX = pTerm->pExpr;
130773 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
130776 assert(pX->pLeft);
130778 pX->pLeft, pX->pRight);
130785 && (pX = pTerm->pExpr->pRight)->op==TK_COLUMN
130786 && pX->iTable==pScan->aiCur[0]
130787 && pX->iColumn==pScan->aiColumn[0]
131276 Expr *pX = pTerm->pExpr;
131279 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
132421 const WhereLoop *pX, /* First WhereLoop to compare */
132425 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){
132428 if( pY->nSkip > pX->nSkip ) return 0;
132429 if( pX->rRun >= pY->rRun ){
132430 if( pX->rRun > pY->rRun ) return 0; /* X costs more than Y */
132431 if( pX->nOut > pY->nOut ) return 0; /* X costs more than Y */
132433 for(i=pX->nLTerm-1; i>=0; i--){
132434 if( pX->aLTerm[i]==0 ) continue;
132436 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
132487 ** If pX is a WhereLoop that pTemplate can supplant, then return the
132488 ** link that points to pX.
132712 WhereTerm *pTerm, *pX;
132723 pX = pLoop->aLTerm[j];
132724 if( pX==0 ) continue;
132725 if( pX==pTerm ) break;
132726 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
134158 Expr *pX = pLoop->aLTerm[j]->pExpr;
134160 if( pLoop->aLTerm[i]->pExpr==pX ){
134388 WhereLoop **pX; /* Used to divy up the pSpace memory */
134422 pX = (WhereLoop**)(aFrom+mxChoice);
134423 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
134424 pFrom->aLoop = pX;
134433 aSortCost = (LogEst*)pX;
134437 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );
