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 ){
29160 unixShm *pX; /* For looping over all siblings */
29184 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
29185 if( pX==p ) continue;
29186 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
29187 allMask |= pX->sharedMask;
29209 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
29210 if( (pX->exclMask & mask)!=0 ){
29214 allShared |= pX->sharedMask;
29234 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
29235 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
34738 winShm *pX; /* For looping over all siblings */
34758 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34759 if( pX==p ) continue;
34760 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
34761 allMask |= pX->sharedMask;
34783 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34784 if( (pX->exclMask & mask)!=0 ){
34788 allShared |= pX->sharedMask;
34808 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
34809 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
58960 Mem *pX;
58961 for(i=1, pX=&pVdbe->aMem[1]; i<=pVdbe->nMem; i++, pX++){
58962 if( pX->pScopyFrom==pMem ){
58963 pX->flags |= MEM_Invalid;
58964 pX->pScopyFrom = 0;
65168 Btree *pX;
65421 Mem *pX;
68000 Btree *pX;
68017 u.ax.pX = u.ax.pDb->pBt;
68018 assert( u.ax.pX!=0 );
68057 rc = sqlite3BtreeCursor(u.ax.pX, u.ax.p2, u.ax.wrFlag, u.ax.pKeyInfo, u.ax.pCur->pCursor);
70956 Mem *pX;
70969 u.cq.pX = &aMem[pOp->p3];
70971 assert( memIsValid(u.cq.pX) );
70972 memAboutToChange(p, u.cq.pX);
70973 sqlite3VdbeMemStoreType(u.cq.pX);
70974 u.cq.apArg[u.cq.i] = u.cq.pX;
70975 u.cq.pX++;
74170 Expr *pX = pEList->a[i].pExpr;
74171 if( sqlite3ResolveExprNames(&sNC, pX) ){
75798 ** or ephermal table) is stored in pX->iTable before this function returns.
75846 SQLITE_PRIVATE int sqlite3FindInIndex(Parse *pParse, Expr *pX, int *prNotFound){
75853 assert( pX->op==TK_IN );
75859 p = (ExprHasProperty(pX, EP_xIsSelect) ? pX->x.pSelect : 0);
75900 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
75906 char aff = comparisonAffinity(pX);
75948 if( pX->pLeft->iColumn<0 && !ExprHasAnyProperty(pX, EP_xIsSelect) ){
75952 sqlite3CodeSubselect(pParse, pX, rMayHaveNull, eType==IN_INDEX_ROWID);
75955 pX->iTable = iTab;
77191 Expr *pX; /* The X expression */
77202 if( (pX = pExpr->pLeft)!=0 ){
77203 cacheX = *pX;
77204 testcase( pX->op==TK_COLUMN );
77205 testcase( pX->op==TK_REGISTER );
77206 cacheX.iTable = sqlite3ExprCodeTemp(pParse, pX, ®Free1);
77220 if( pX ){
77528 Expr *pX = pExpr->pLeft;
77532 sqlite3ExplainExpr(pOut, pX);
103151 Expr *pX = pTerm->pExpr;
103158 if( !sqlite3IndexAffinityOk(pX, idxaff) ) continue;
103161 ** it to be useful for optimising expression pX. Store this
103164 assert(pX->pLeft);
103165 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
104044 Expr *pX = pTerm->pExpr;
104045 CollSeq *p1 = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
104631 Expr *pX = pTerm->pExpr;
104634 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
106023 Expr *pX = pTerm->pExpr;
106028 if( pX->op==TK_EQ ){
106029 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
106030 }else if( pX->op==TK_ISNULL ){
106039 assert( pX->op==TK_IN );
106041 eType = sqlite3FindInIndex(pParse, pX, 0);
106042 iTab = pX->iTable;
106480 Expr *pX; /* The expression that defines the start bound */
106497 pX = pStart->pExpr;
106498 assert( pX!=0 );
106500 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
106501 sqlite3VdbeAddOp3(v, aMoveOp[pX->op-TK_GT], iCur, addrBrk, r1);
106510 Expr *pX;
106511 pX = pEnd->pExpr;
106512 assert( pX!=0 );
106516 sqlite3ExprCode(pParse, pX->pRight, memEndValue);
106517 if( pX->op==TK_LT || pX->op==TK_GT ){
