Lines Matching refs:pX
15762 struct tm *pX; in osLocaltime() local
15767 pX = localtime(t); in osLocaltime()
15769 if( sqlite3GlobalConfig.bLocaltimeFault ) pX = 0; in osLocaltime()
15771 if( pX ) *pTm = *pX; in osLocaltime()
15773 rc = pX==0; in osLocaltime()
19350 static int debugMutexHeld(sqlite3_mutex *pX){ in debugMutexHeld() argument
19351 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexHeld()
19354 static int debugMutexNotheld(sqlite3_mutex *pX){ in debugMutexNotheld() argument
19355 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexNotheld()
19401 static void debugMutexFree(sqlite3_mutex *pX){ in debugMutexFree() argument
19402 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexFree()
19424 static void debugMutexEnter(sqlite3_mutex *pX){ in debugMutexEnter() argument
19425 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexEnter()
19426 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexEnter()
19429 static int debugMutexTry(sqlite3_mutex *pX){ in debugMutexTry() argument
19430 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexTry()
19431 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexTry()
19442 static void debugMutexLeave(sqlite3_mutex *pX){ in debugMutexLeave() argument
19443 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexLeave()
19444 assert( debugMutexHeld(pX) ); in debugMutexLeave()
19446 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexLeave()
30000 unixShm *pX; /* For looping over all siblings */
30024 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
30025 if( pX==p ) continue;
30026 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
30027 allMask |= pX->sharedMask;
30049 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
30050 if( (pX->exclMask & mask)!=0 ){
30054 allShared |= pX->sharedMask;
30074 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
30075 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
36950 winShm *pX; /* For looping over all siblings */
36970 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
36971 if( pX==p ) continue;
36972 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
36973 allMask |= pX->sharedMask;
36995 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
36996 if( (pX->exclMask & mask)!=0 ){
37000 allShared |= pX->sharedMask;
37020 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
37021 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
63848 Mem *pX;
63849 for(i=1, pX=&pVdbe->aMem[1]; i<=pVdbe->nMem; i++, pX++){
63850 if( pX->pScopyFrom==pMem ){
63851 pX->flags |= MEM_Undefined;
63852 pX->pScopyFrom = 0;
74107 Btree *pX;
74141 pX = pDb->pBt;
74142 assert( pX!=0 );
74185 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->pCursor);
77171 Mem *pX;
77188 pX = &aMem[pOp->p3];
77190 assert( memIsValid(pX) );
77191 memAboutToChange(p, pX);
77192 apArg[i] = pX;
77193 pX++;
82539 Expr *pX = pEList->a[i].pExpr;
82540 if( sqlite3ResolveExprNames(&sNC, pX) ){
84483 SQLITE_PRIVATE int sqlite3FindInIndex(Parse *pParse, Expr *pX, u32 inFlags, int *prRhsHasNull){
84490 assert( pX->op==TK_IN );
84497 p = (ExprHasProperty(pX, EP_xIsSelect) ? pX->x.pSelect : 0);
84537 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
84543 int affinity_ok = sqlite3IndexAffinityOk(pX, pTab->aCol[iCol].affinity);
84576 && !ExprHasProperty(pX, EP_xIsSelect)
84577 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
84592 if( pX->pLeft->iColumn<0 && !ExprHasProperty(pX, EP_xIsSelect) ){
84598 sqlite3CodeSubselect(pParse, pX, rMayHaveNull, eType==IN_INDEX_ROWID);
84601 pX->iTable = iTab;
85904 Expr *pX; /* The X expression */
85914 if( (pX = pExpr->pLeft)!=0 ){
85915 tempX = *pX;
85916 testcase( pX->op==TK_COLUMN );
85917 exprToRegister(&tempX, sqlite3ExprCodeTemp(pParse, pX, ®Free1));
85930 if( pX ){
86289 Expr *pX = pExpr->pLeft;
86293 sqlite3TreeViewExpr(pView, pX, 1);
110319 Select *pX;
110328 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
110329 if( pX==0 ) return WRC_Continue;
110823 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
110825 pX->zSpan = sqlite3DbStrDup(db, pSub->pEList->a[j].zSpan);
110826 testcase( pX->zSpan==0 );
110828 pX->zSpan = sqlite3MPrintf(db, "%s.%s.%s",
110830 testcase( pX->zSpan==0 );
110832 pX->bSpanIsTab = 1;
116615 Expr *pX; /* An expression being tested */
116633 pX = sqlite3ExprSkipCollate(pTerm->pExpr->pRight);
116634 assert( pX->op==TK_COLUMN );
116636 if( pScan->aEquiv[j]==pX->iTable
116637 && pScan->aEquiv[j+1]==pX->iColumn ){
116642 pScan->aEquiv[j] = pX->iTable;
116643 pScan->aEquiv[j+1] = pX->iColumn;
116652 pX = pTerm->pExpr;
116653 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
116656 assert(pX->pLeft);
116658 pX->pLeft, pX->pRight);
116665 && (pX = pTerm->pExpr->pRight)->op==TK_COLUMN
116666 && pX->iTable==pScan->aEquiv[0]
116667 && pX->iColumn==pScan->aEquiv[1]
117980 Expr *pX = pTerm->pExpr;
117983 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
118964 Expr *pX = pTerm->pExpr;
118969 if( pX->op==TK_EQ ){
118970 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
118971 }else if( pX->op==TK_ISNULL ){
118989 assert( pX->op==TK_IN );
118991 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0);
118996 iTab = pX->iTable;
119577 Expr *pX; /* The expression that defines the start bound */
119595 pX = pStart->pExpr;
119596 assert( pX!=0 );
119598 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
119599 sqlite3VdbeAddOp3(v, aMoveOp[pX->op-TK_GT], iCur, addrBrk, r1);
119601 VdbeCoverageIf(v, pX->op==TK_GT);
119602 VdbeCoverageIf(v, pX->op==TK_LE);
119603 VdbeCoverageIf(v, pX->op==TK_LT);
119604 VdbeCoverageIf(v, pX->op==TK_GE);
119614 Expr *pX;
119615 pX = pEnd->pExpr;
119616 assert( pX!=0 );
119621 sqlite3ExprCode(pParse, pX->pRight, memEndValue);
119622 if( pX->op==TK_LT || pX->op==TK_GT ){
120514 const WhereLoop *pX, /* First WhereLoop to compare */
120518 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){
120521 if( pY->nSkip > pX->nSkip ) return 0;
120522 if( pX->rRun >= pY->rRun ){
120523 if( pX->rRun > pY->rRun ) return 0; /* X costs more than Y */
120524 if( pX->nOut > pY->nOut ) return 0; /* X costs more than Y */
120526 for(i=pX->nLTerm-1; i>=0; i--){
120527 if( pX->aLTerm[i]==0 ) continue;
120529 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
120802 WhereTerm *pTerm, *pX;
120813 pX = pLoop->aLTerm[j];
120814 if( pX==0 ) continue;
120815 if( pX==pTerm ) break;
120816 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
122131 WhereLoop **pX; /* Used to divy up the pSpace memory */
122165 pX = (WhereLoop**)(aFrom+mxChoice);
122166 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
122167 pFrom->aLoop = pX;
122176 aSortCost = (LogEst*)pX;
122180 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );