Lines Matching defs:pX
10482 #define OP_Column 47 /* synopsis: r[P3]=PX */
16521 struct tm *pX;
16526 pX = localtime(t);
16528 if( sqlite3GlobalConfig.bLocaltimeFault ) pX = 0;
16530 if( pX ) *pTm = *pX;
16532 rc = pX==0;
20133 static int debugMutexHeld(sqlite3_mutex *pX){
20134 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
20137 static int debugMutexNotheld(sqlite3_mutex *pX){
20138 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
20184 static void debugMutexFree(sqlite3_mutex *pX){
20185 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
20207 static void debugMutexEnter(sqlite3_mutex *pX){
20208 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
20209 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
20212 static int debugMutexTry(sqlite3_mutex *pX){
20213 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
20214 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
20225 static void debugMutexLeave(sqlite3_mutex *pX){
20226 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
20227 assert( debugMutexHeld(pX) );
20229 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
22402 unsigned px = 0;
22404 px = px*10 + c - '0';
22407 testcase( px>0x7fffffff );
22408 precision = px & 0x7fffffff;
23543 Expr *pX = pExpr->pLeft;
23547 sqlite3TreeViewExpr(pView, pX, 1);
26304 /* 47 */ "Column" OpHelp("r[P3]=PX"),
31177 unixShm *pX; /* For looping over all siblings */
31201 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
31202 if( pX==p ) continue;
31203 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
31204 allMask |= pX->sharedMask;
31226 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
31227 if( (pX->exclMask & mask)!=0 ){
31231 allShared |= pX->sharedMask;
31251 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
31252 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
38136 winShm *pX; /* For looping over all siblings */
38156 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
38157 if( pX==p ) continue;
38158 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
38159 allMask |= pX->sharedMask;
38181 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
38182 if( (pX->exclMask & mask)!=0 ){
38186 allShared |= pX->sharedMask;
38206 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
38207 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
41408 PgHdr1 *pX = (PgHdr1*)&zBulk[pCache->szPage];
41409 pX->page.pBuf = zBulk;
41410 pX->page.pExtra = &pX[1];
41411 pX->isBulkLocal = 1;
41412 pX->isAnchor = 0;
41413 pX->pNext = pCache->pFree;
41414 pCache->pFree = pX;
58558 BtCursor *pX; /* Looping over other all cursors */
58597 for(pX=pBt->pCursor; pX; pX=pX->pNext){
58598 if( pX->pgnoRoot==(Pgno)iTable ){
58599 pX->curFlags |= BTCF_Multiple;
65722 Mem *pX;
65723 for(i=1, pX=&pVdbe->aMem[1]; i<=pVdbe->nMem; i++, pX++){
65724 if( pX->pScopyFrom==pMem ){
65725 pX->flags |= MEM_Undefined;
65726 pX->pScopyFrom = 0;
67701 ** "PX" -> "r[X]"
67702 ** "PX@PY" -> "r[X..X+Y-1]" or "r[x]" if y is 0 or 1
67703 ** "PX@PY+1" -> "r[X..X+Y]" or "r[x]" if y is 0
75208 ** Synopsis: r[P3]=PX
76199 Btree *pX;
76233 pX = pDb->pBt;
76234 assert( pX!=0 );
76277 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->pCursor);
79346 Mem *pX;
79363 pX = &aMem[pOp->p3];
79365 assert( memIsValid(pX) );
79366 memAboutToChange(p, pX);
79367 apArg[i] = pX;
79368 pX++;
86609 ** The pX parameter is the expression on the RHS of the IN operator, which
86617 ** and pX->iTable is set to the index of that cursor.
86629 ** An existing b-tree might be used if the RHS expression pX is a simple
86636 ** pX->iTable made to point to the ephemeral table instead of an
86678 SQLITE_PRIVATE int sqlite3FindInIndex(Parse *pParse, Expr *pX, u32 inFlags, int *prRhsHasNull){
86685 assert( pX->op==TK_IN );
86692 p = (ExprHasProperty(pX, EP_xIsSelect) ? pX->x.pSelect : 0);
86732 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
86738 int affinity_ok = sqlite3IndexAffinityOk(pX, pTab->aCol[iCol].affinity);
86771 && !ExprHasProperty(pX, EP_xIsSelect)
86772 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
86787 if( pX->pLeft->iColumn<0 && !ExprHasProperty(pX, EP_xIsSelect) ){
86793 sqlite3CodeSubselect(pParse, pX, rMayHaveNull, eType==IN_INDEX_ROWID);
86796 pX->iTable = iTab;
88103 Expr *pX; /* The X expression */
88113 if( (pX = pExpr->pLeft)!=0 ){
88114 tempX = *pX;
88115 testcase( pX->op==TK_COLUMN );
88116 exprToRegister(&tempX, sqlite3ExprCodeTemp(pParse, pX, ®Free1));
88129 if( pX ){
112553 Select *pX;
112562 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
112563 if( pX==0 ) return WRC_Continue;
113049 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
113051 pX->zSpan = sqlite3DbStrDup(db, pSub->pEList->a[j].zSpan);
113052 testcase( pX->zSpan==0 );
113054 pX->zSpan = sqlite3MPrintf(db, "%s.%s.%s",
113056 testcase( pX->zSpan==0 );
113058 pX->bSpanIsTab = 1;
118874 Expr *pX = pTerm->pExpr;
118879 if( pX->op==TK_EQ || pX->op==TK_IS ){
118880 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
118881 }else if( pX->op==TK_ISNULL ){
118899 assert( pX->op==TK_IN );
118901 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0);
118906 iTab = pX->iTable;
119276 Expr *pX; /* The expression that defines the start bound */
119294 pX = pStart->pExpr;
119295 assert( pX!=0 );
119297 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
119298 sqlite3VdbeAddOp3(v, aMoveOp[pX->op-TK_GT], iCur, addrBrk, r1);
119300 VdbeCoverageIf(v, pX->op==TK_GT);
119301 VdbeCoverageIf(v, pX->op==TK_LE);
119302 VdbeCoverageIf(v, pX->op==TK_LT);
119303 VdbeCoverageIf(v, pX->op==TK_GE);
119313 Expr *pX;
119314 pX = pEnd->pExpr;
119315 assert( pX!=0 );
119320 sqlite3ExprCode(pParse, pX->pRight, memEndValue);
119321 if( pX->op==TK_LT || pX->op==TK_GT ){
121558 Expr *pX; /* An expression being tested */
121577 && (pX = sqlite3ExprSkipCollate(pTerm->pExpr->pRight))->op==TK_COLUMN
121581 if( pScan->aiCur[j]==pX->iTable
121582 && pScan->aiColumn[j]==pX->iColumn ){
121587 pScan->aiCur[j] = pX->iTable;
121588 pScan->aiColumn[j] = pX->iColumn;
121597 pX = pTerm->pExpr;
121598 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
121601 assert(pX->pLeft);
121603 pX->pLeft, pX->pRight);
121610 && (pX = pTerm->pExpr->pRight)->op==TK_COLUMN
121611 && pX->iTable==pScan->aiCur[0]
121612 && pX->iColumn==pScan->aiColumn[0]
122091 Expr *pX = pTerm->pExpr;
122094 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
123185 const WhereLoop *pX, /* First WhereLoop to compare */
123189 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){
123192 if( pY->nSkip > pX->nSkip ) return 0;
123193 if( pX->rRun >= pY->rRun ){
123194 if( pX->rRun > pY->rRun ) return 0; /* X costs more than Y */
123195 if( pX->nOut > pY->nOut ) return 0; /* X costs more than Y */
123197 for(i=pX->nLTerm-1; i>=0; i--){
123198 if( pX->aLTerm[i]==0 ) continue;
123200 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
123251 ** If pX is a WhereLoop that pTemplate can supplant, then return the
123252 ** link that points to pX.
123475 WhereTerm *pTerm, *pX;
123486 pX = pLoop->aLTerm[j];
123487 if( pX==0 ) continue;
123488 if( pX==pTerm ) break;
123489 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
124873 WhereLoop **pX; /* Used to divy up the pSpace memory */
124907 pX = (WhereLoop**)(aFrom+mxChoice);
124908 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
124909 pFrom->aLoop = pX;
124918 aSortCost = (LogEst*)pX;
124922 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );
