Lines Matching defs:pX
9300 #define OP_Column 46 /* synopsis: r[P3]=PX */
15032 struct tm *pX;
15037 pX = localtime(t);
15039 if( sqlite3GlobalConfig.bLocaltimeFault ) pX = 0;
15041 if( pX ) *pTm = *pX;
15043 rc = pX==0;
18613 static int debugMutexHeld(sqlite3_mutex *pX){
18614 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
18617 static int debugMutexNotheld(sqlite3_mutex *pX){
18618 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
18660 static void debugMutexFree(sqlite3_mutex *pX){
18661 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
18678 static void debugMutexEnter(sqlite3_mutex *pX){
18679 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
18680 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
18683 static int debugMutexTry(sqlite3_mutex *pX){
18684 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
18685 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
18696 static void debugMutexLeave(sqlite3_mutex *pX){
18697 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
18698 assert( debugMutexHeld(pX) );
18700 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
23945 /* 46 */ "Column" OpHelp("r[P3]=PX"),
28774 unixShm *pX; /* For looping over all siblings */
28798 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28799 if( pX==p ) continue;
28800 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
28801 allMask |= pX->sharedMask;
28823 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28824 if( (pX->exclMask & mask)!=0 ){
28828 allShared |= pX->sharedMask;
28848 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
28849 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
35637 winShm *pX; /* For looping over all siblings */
35657 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
35658 if( pX==p ) continue;
35659 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
35660 allMask |= pX->sharedMask;
35682 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
35683 if( (pX->exclMask & mask)!=0 ){
35687 allShared |= pX->sharedMask;
35707 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
35708 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
61435 Mem *pX;
61436 for(i=1, pX=&pVdbe->aMem[1]; i<=pVdbe->nMem; i++, pX++){
61437 if( pX->pScopyFrom==pMem ){
61438 pX->flags |= MEM_Undefined;
61439 pX->pScopyFrom = 0;
63154 ** "PX" -> "r[X]"
63155 ** "PX@PY" -> "r[X..X+Y-1]" or "r[x]" if y is 0 or 1
63156 ** "PX@PY+1" -> "r[X..X+Y]" or "r[x]" if y is 0
70287 ** Synopsis: r[P3]=PX
71274 Btree *pX;
71296 pX = pDb->pBt;
71297 assert( pX!=0 );
71340 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->pCursor);
74285 Mem *pX;
74298 pX = &aMem[pOp->p3];
74300 assert( memIsValid(pX) );
74301 memAboutToChange(p, pX);
74302 apArg[i] = pX;
74303 pX++;
77980 Expr *pX = pEList->a[i].pExpr;
77981 if( sqlite3ResolveExprNames(&sNC, pX) ){
79743 ** The pX parameter is the expression on the RHS of the IN operator, which
79751 ** and pX->iTable is set to the index of that cursor.
79763 ** An existing b-tree might be used if the RHS expression pX is a simple
79770 ** pX->iTable made to point to the ephermeral table instead of an
79812 SQLITE_PRIVATE int sqlite3FindInIndex(Parse *pParse, Expr *pX, u32 inFlags, int *prRhsHasNull){
79819 assert( pX->op==TK_IN );
79826 p = (ExprHasProperty(pX, EP_xIsSelect) ? pX->x.pSelect : 0);
79866 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
79872 int affinity_ok = sqlite3IndexAffinityOk(pX, pTab->aCol[iCol].affinity);
79905 && !ExprHasProperty(pX, EP_xIsSelect)
79906 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
79921 if( pX->pLeft->iColumn<0 && !ExprHasProperty(pX, EP_xIsSelect) ){
79927 sqlite3CodeSubselect(pParse, pX, rMayHaveNull, eType==IN_INDEX_ROWID);
79930 pX->iTable = iTab;
81248 Expr *pX; /* The X expression */
81258 if( (pX = pExpr->pLeft)!=0 ){
81259 tempX = *pX;
81260 testcase( pX->op==TK_COLUMN );
81261 exprToRegister(&tempX, sqlite3ExprCodeTemp(pParse, pX, ®Free1));
81274 if( pX ){
81641 Expr *pX = pExpr->pLeft;
81645 sqlite3ExplainExpr(pOut, pX);
105130 Select *pX;
105139 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
105140 if( pX==0 ) return WRC_Continue;
105628 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
105630 pX->zSpan = sqlite3DbStrDup(db, pSub->pEList->a[j].zSpan);
105631 testcase( pX->zSpan==0 );
105633 pX->zSpan = sqlite3MPrintf(db, "%s.%s.%s",
105635 testcase( pX->zSpan==0 );
105637 pX->bSpanIsTab = 1;
111338 Expr *pX; /* An expression being tested */
111356 pX = sqlite3ExprSkipCollate(pTerm->pExpr->pRight);
111357 assert( pX->op==TK_COLUMN );
111359 if( pScan->aEquiv[j]==pX->iTable
111360 && pScan->aEquiv[j+1]==pX->iColumn ){
111365 pScan->aEquiv[j] = pX->iTable;
111366 pScan->aEquiv[j+1] = pX->iColumn;
111375 pX = pTerm->pExpr;
111376 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
111379 assert(pX->pLeft);
111381 pX->pLeft, pX->pRight);
111388 && (pX = pTerm->pExpr->pRight)->op==TK_COLUMN
111389 && pX->iTable==pScan->aEquiv[0]
111390 && pX->iColumn==pScan->aEquiv[1]
112566 Expr *pX = pTerm->pExpr;
112569 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
113392 Expr *pX = pTerm->pExpr;
113397 if( pX->op==TK_EQ ){
113398 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
113399 }else if( pX->op==TK_ISNULL ){
113417 assert( pX->op==TK_IN );
113419 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0);
113424 iTab = pX->iTable;
113935 Expr *pX; /* The expression that defines the start bound */
113953 pX = pStart->pExpr;
113954 assert( pX!=0 );
113956 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
113957 sqlite3VdbeAddOp3(v, aMoveOp[pX->op-TK_GT], iCur, addrBrk, r1);
113959 VdbeCoverageIf(v, pX->op==TK_GT);
113960 VdbeCoverageIf(v, pX->op==TK_LE);
113961 VdbeCoverageIf(v, pX->op==TK_LT);
113962 VdbeCoverageIf(v, pX->op==TK_GE);
113972 Expr *pX;
113973 pX = pEnd->pExpr;
113974 assert( pX!=0 );
113979 sqlite3ExprCode(pParse, pX->pRight, memEndValue);
113980 if( pX->op==TK_LT || pX->op==TK_GT ){
114837 const WhereLoop *pX, /* First WhereLoop to compare */
114841 if( pX->nLTerm >= pY->nLTerm ) return 0; /* X is not a subset of Y */
114842 if( pX->rRun >= pY->rRun ){
114843 if( pX->rRun > pY->rRun ) return 0; /* X costs more than Y */
114844 if( pX->nOut > pY->nOut ) return 0; /* X costs more than Y */
114846 for(i=pX->nLTerm-1; i>=0; i--){
114848 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
114908 ** If pX is a WhereLoop that pTemplate can supplant, then return the
114909 ** link that points to pX.
115105 WhereTerm *pTerm, *pX;
115117 pX = pLoop->aLTerm[j];
115118 if( pX==0 ) continue;
115119 if( pX==pTerm ) break;
115120 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
116365 WhereLoop **pX; /* Used to divy up the pSpace memory */
116399 pX = (WhereLoop**)(aFrom+mxChoice);
116400 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
116401 pFrom->aLoop = pX;
116410 aSortCost = (LogEst*)pX;
116414 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );
