Lines Matching defs: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 ){
29149 unixShm *pX; /* For looping over all siblings */
29173 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
29174 if( pX==p ) continue;
29175 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
29176 allMask |= pX->sharedMask;
29198 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
29199 if( (pX->exclMask & mask)!=0 ){
29203 allShared |= pX->sharedMask;
29223 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
29224 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
34727 winShm *pX; /* For looping over all siblings */
34747 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34748 if( pX==p ) continue;
34749 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
34750 allMask |= pX->sharedMask;
34772 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34773 if( (pX->exclMask & mask)!=0 ){
34777 allShared |= pX->sharedMask;
34797 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34798 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
58949 Mem *pX;
58950 for(i=1, pX=&pVdbe->aMem[1]; i<=pVdbe->nMem; i++, pX++){
58951 if( pX->pScopyFrom==pMem ){
58952 pX->flags |= MEM_Invalid;
58953 pX->pScopyFrom = 0;
65157 Btree *pX;
65410 Mem *pX;
67989 Btree *pX;
68006 u.ax.pX = u.ax.pDb->pBt;
68007 assert( u.ax.pX!=0 );
68046 rc = sqlite3BtreeCursor(u.ax.pX, u.ax.p2, u.ax.wrFlag, u.ax.pKeyInfo, u.ax.pCur->pCursor);
70945 Mem *pX;
70958 u.cq.pX = &aMem[pOp->p3];
70960 assert( memIsValid(u.cq.pX) );
70961 memAboutToChange(p, u.cq.pX);
70962 sqlite3VdbeMemStoreType(u.cq.pX);
70963 u.cq.apArg[u.cq.i] = u.cq.pX;
70964 u.cq.pX++;
74159 Expr *pX = pEList->a[i].pExpr;
74160 if( sqlite3ResolveExprNames(&sNC, pX) ){
75787 ** or ephermal table) is stored in pX->iTable before this function returns.
75835 SQLITE_PRIVATE int sqlite3FindInIndex(Parse *pParse, Expr *pX, int *prNotFound){
75842 assert( pX->op==TK_IN );
75848 p = (ExprHasProperty(pX, EP_xIsSelect) ? pX->x.pSelect : 0);
75889 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
75895 char aff = comparisonAffinity(pX);
75937 if( pX->pLeft->iColumn<0 && !ExprHasAnyProperty(pX, EP_xIsSelect) ){
75941 sqlite3CodeSubselect(pParse, pX, rMayHaveNull, eType==IN_INDEX_ROWID);
75944 pX->iTable = iTab;
77180 Expr *pX; /* The X expression */
77191 if( (pX = pExpr->pLeft)!=0 ){
77192 cacheX = *pX;
77193 testcase( pX->op==TK_COLUMN );
77194 testcase( pX->op==TK_REGISTER );
77195 cacheX.iTable = sqlite3ExprCodeTemp(pParse, pX, ®Free1);
77209 if( pX ){
77517 Expr *pX = pExpr->pLeft;
77521 pX);
103140 Expr *pX = pTerm->pExpr;
103147 if( !sqlite3IndexAffinityOk(pX, idxaff) ) continue;
103150 ** it to be useful for optimising expression pX. Store this
103153 assert(pX->pLeft);
103154 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
104033 Expr *pX = pTerm->pExpr;
104034 CollSeq *p1 = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
104620 Expr *pX = pTerm->pExpr;
104623 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
106012 Expr *pX = pTerm->pExpr;
106017 if( pX->op==TK_EQ ){
106018 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
106019 }else if( pX->op==TK_ISNULL ){
106028 assert( pX->op==TK_IN );
106030 eType = sqlite3FindInIndex(pParse, pX, 0);
106031 iTab = pX->iTable;
106469 Expr *pX; /* The expression that defines the start bound */
106486 pX = pStart->pExpr;
106487 assert( pX!=0 );
106489 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
106490 sqlite3VdbeAddOp3(v, aMoveOp[pX->op-TK_GT], iCur, addrBrk, r1);
106499 Expr *pX;
106500 pX = pEnd->pExpr;
106501 assert( pX!=0 );
106505 sqlite3ExprCode(pParse, pX->pRight, memEndValue);
106506 if( pX->op==TK_LT || pX->op==TK_GT ){
