Lines Matching refs:pX
13972 struct tm *pX;
13977 pX = localtime(t);
13979 if( sqlite3GlobalConfig.bLocaltimeFault ) pX = 0;
13981 if( pX ) *pTm = *pX;
13983 rc = pX==0;
17503 static int debugMutexHeld(sqlite3_mutex *pX){
17504 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
17507 static int debugMutexNotheld(sqlite3_mutex *pX){
17508 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
17550 static void debugMutexFree(sqlite3_mutex *pX){
17551 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
17568 static void debugMutexEnter(sqlite3_mutex *pX){
17569 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
17570 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
17573 static int debugMutexTry(sqlite3_mutex *pX){
17574 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
17575 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
17586 static void debugMutexLeave(sqlite3_mutex *pX){
17587 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
17588 assert( debugMutexHeld(pX) );
17590 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
24097 os2ShmLink *pX; /* For looping over all siblings */
24118 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
24119 if( pX==p ) continue;
24120 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
24121 allMask |= pX->sharedMask;
24143 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
24144 if( (pX->exclMask & mask)!=0 ){
24148 allShared |= pX->sharedMask;
24168 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
24169 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
29177 unixShm *pX; /* For looping over all siblings */
29201 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
29202 if( pX==p ) continue;
29203 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
29204 allMask |= pX->sharedMask;
29226 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
29227 if( (pX->exclMask & mask)!=0 ){
29231 allShared |= pX->sharedMask;
29251 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
29252 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
34755 winShm *pX; /* For looping over all siblings */
34775 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34776 if( pX==p ) continue;
34777 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
34778 allMask |= pX->sharedMask;
34800 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34801 if( (pX->exclMask & mask)!=0 ){
34805 allShared |= pX->sharedMask;
34825 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34826 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
58977 Mem *pX;
58978 for(i=1, pX=&pVdbe->aMem[1]; i<=pVdbe->nMem; i++, pX++){
58979 if( pX->pScopyFrom==pMem ){
58980 pX->flags |= MEM_Invalid;
58981 pX->pScopyFrom = 0;
65185 Btree *pX;
65438 Mem *pX;
68017 Btree *pX;
68034 u.ax.pX = u.ax.pDb->pBt;
68035 assert( u.ax.pX!=0 );
68074 rc = sqlite3BtreeCursor(u.ax.pX, u.ax.p2, u.ax.wrFlag, u.ax.pKeyInfo, u.ax.pCur->pCursor);
70973 Mem *pX;
70986 u.cq.pX = &aMem[pOp->p3];
70988 assert( memIsValid(u.cq.pX) );
70989 memAboutToChange(p, u.cq.pX);
70990 sqlite3VdbeMemStoreType(u.cq.pX);
70991 u.cq.apArg[u.cq.i] = u.cq.pX;
70992 u.cq.pX++;
74195 Expr *pX = pEList->a[i].pExpr;
74196 if( sqlite3ResolveExprNames(&sNC, pX) ){
75823 ** or ephermal table) is stored in pX->iTable before this function returns.
75871 SQLITE_PRIVATE int sqlite3FindInIndex(Parse *pParse, Expr *pX, int *prNotFound){
75878 assert( pX->op==TK_IN );
75884 p = (ExprHasProperty(pX, EP_xIsSelect) ? pX->x.pSelect : 0);
75925 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
75931 char aff = comparisonAffinity(pX);
75973 if( pX->pLeft->iColumn<0 && !ExprHasAnyProperty(pX, EP_xIsSelect) ){
75977 sqlite3CodeSubselect(pParse, pX, rMayHaveNull, eType==IN_INDEX_ROWID);
75980 pX->iTable = iTab;
77216 Expr *pX; /* The X expression */
77227 if( (pX = pExpr->pLeft)!=0 ){
77228 cacheX = *pX;
77229 testcase( pX->op==TK_COLUMN );
77230 testcase( pX->op==TK_REGISTER );
77231 cacheX.iTable = sqlite3ExprCodeTemp(pParse, pX, ®Free1);
77245 if( pX ){
77553 Expr *pX = pExpr->pLeft;
77557 sqlite3ExplainExpr(pOut, pX);
103176 Expr *pX = pTerm->pExpr;
103183 if( !sqlite3IndexAffinityOk(pX, idxaff) ) continue;
103186 ** it to be useful for optimising expression pX. Store this
103189 assert(pX->pLeft);
103190 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
104069 Expr *pX = pTerm->pExpr;
104070 CollSeq *p1 = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
104656 Expr *pX = pTerm->pExpr;
104659 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
106048 Expr *pX = pTerm->pExpr;
106053 if( pX->op==TK_EQ ){
106054 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
106055 }else if( pX->op==TK_ISNULL ){
106064 assert( pX->op==TK_IN );
106066 eType = sqlite3FindInIndex(pParse, pX, 0);
106067 iTab = pX->iTable;
106505 Expr *pX; /* The expression that defines the start bound */
106522 pX = pStart->pExpr;
106523 assert( pX!=0 );
106525 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
106526 sqlite3VdbeAddOp3(v, aMoveOp[pX->op-TK_GT], iCur, addrBrk, r1);
106535 Expr *pX;
106536 pX = pEnd->pExpr;
106537 assert( pX!=0 );
106541 sqlite3ExprCode(pParse, pX->pRight, memEndValue);
106542 if( pX->op==TK_LT || pX->op==TK_GT ){
