Lines Matching refs:pX
23209 struct tm *pX;
23214 pX = localtime(t);
23216 if( sqlite3GlobalConfig.bLocaltimeFault ) pX = 0;
23218 if( pX ) *pTm = *pX;
23220 rc = pX==0;
27061 static int debugMutexHeld(sqlite3_mutex *pX){
27062 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
27065 static int debugMutexNotheld(sqlite3_mutex *pX){
27066 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
27112 static void debugMutexFree(sqlite3_mutex *pX){
27113 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
27135 static void debugMutexEnter(sqlite3_mutex *pX){
27136 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
27137 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
27140 static int debugMutexTry(sqlite3_mutex *pX){
27141 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
27142 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
27153 static void debugMutexLeave(sqlite3_mutex *pX){
27154 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX;
27155 assert( debugMutexHeld(pX) );
27157 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) );
30465 Window *pX;
30468 for(pX=p->pWin; pX; pX=pX->pNextWin){
30469 sqlite3TreeViewWinFunc(pView, pX, pX->pNextWin!=0);
30495 Window *pX;
30497 for(pX=p->pWinDefn; pX; pX=pX->pNextWin){
30498 sqlite3TreeViewWindow(pView, pX, pX->pNextWin!=0);
30911 const Expr *pX, *pY, *pZ;
30912 pX = pExpr->pLeft;
30918 sqlite3TreeViewExpr(pView, pX, 1);
39111 unixShm *pX;
39116 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
39119 if( pX->exclMask & (1<<i) ){
39122 }else if( pX->sharedMask & (1<<i) ){
46440 winShm *pX; /* For looping over all siblings */
46460 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
46461 if( pX==p ) continue;
46462 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
46463 allMask |= pX->sharedMask;
46485 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
46486 if( (pX->exclMask & mask)!=0 ){
46490 allShared |= pX->sharedMask;
46510 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
46511 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
51018 PgHdr1 *pX = (PgHdr1*)&zBulk[pCache->szPage];
51019 pX->page.pBuf = zBulk;
51020 pX->page.pExtra = &pX[1];
51021 pX->isBulkLocal = 1;
51022 pX->isAnchor = 0;
51023 pX->pNext = pCache->pFree;
51024 pX->pLruPrev = 0; /* Initializing this saves a valgrind error */
51025 pCache->pFree = pX;
70012 BtCursor *pX; /* Looping over other all cursors */
70058 for(pX=pBt->pCursor; pX; pX=pX->pNext){
70059 if( pX->pgnoRoot==iTable ){
70060 pX->curFlags |= BTCF_Multiple;
72192 const BtreePayload *pX, /* Payload with which to construct the cell */
72216 nPayload = pX->nData + pX->nZero;
72217 pSrc = pX->pData;
72218 nSrc = pX->nData;
72221 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
72223 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
72224 nSrc = nPayload = (int)pX->nKey;
72225 pSrc = pX->pKey;
72278 assert( info.nKey==pX->nKey );
74256 const BtreePayload *pX, /* Source of data to write */
74260 int nData = pX->nData - iOffset;
74274 int rc = btreeOverwriteContent(pPage, pDest+nData, pX, iOffset+nData,
74279 if( memcmp(pDest, ((u8*)pX->pData) + iOffset, iAmt)!=0 ){
74286 memmove(pDest, ((u8*)pX->pData) + iOffset, iAmt);
74296 static int btreeOverwriteCell(BtCursor *pCur, const BtreePayload *pX){
74298 int nTotal = pX->nData + pX->nZero; /* Total bytes of to write */
74311 rc = btreeOverwriteContent(pPage, pCur->info.pPayload, pX,
74334 rc = btreeOverwriteContent(pPage, pPage->aData+4, pX,
74377 const BtreePayload *pX, /* Content of the row to be inserted */
74410 assert( (flags & BTREE_PREFORMAT) || (pX->pKey==0)==(pCur->pKeyInfo==0) );
74437 assert( pX->pKey==0 );
74441 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
74450 assert( pX->nKey==pCur->info.nKey );
74459 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
74462 assert( pX->nData>=0 && pX->nZero>=0 );
74464 && pCur->info.nPayload==(u32)pX->nData+pX->nZero
74467 return btreeOverwriteCell(pCur, pX);
74475 rc = sqlite3BtreeTableMoveto(pCur, pX->nKey,
74493 if( pX->nMem ){
74496 r.aMem = pX->aMem;
74497 r.nField = pX->nMem;
74502 rc = btreeMoveto(pCur, pX->pKey, pX->nKey,
74514 if( pCur->info.nKey==pX->nKey ){
74516 x2.pData = pX->pKey;
74517 x2.nData = pX->nKey;
74528 assert( pPage->intKey || pX->nKey>=0 || (flags & BTREE_PREFORMAT) );
74540 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
74558 rc = fillInCell(pPage, newCell, pX, &szNew);
74652 pCur->pKey = sqlite3Malloc( pX->nKey );
74656 memcpy(pCur->pKey, pX->pKey, pX->nKey);
74660 pCur->nKey = pX->nKey;
78226 Mem *pX;
78227 for(i=1, pX=pVdbe->aMem+1; i<pVdbe->nMem; i++, pX++){
78228 if( pX->pScopyFrom==pMem ){
78232 (int)(pX - pVdbe->aMem), (int)(pMem - pVdbe->aMem));
78240 mFlags = pMem->flags & pX->flags & pX->mScopyFlags;
78241 assert( (mFlags&(MEM_Int|MEM_IntReal))==0 || pMem->u.i==pX->u.i );
78245 pX->flags = MEM_Undefined;
78246 pX->pScopyFrom = 0;
90628 Btree *pX;
90663 pX = pDb->pBt;
90664 assert( pX!=0 );
90709 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->uc.pCursor);
94654 Mem *pX;
94673 pX = &aMem[pOp->p3];
94675 assert( memIsValid(pX) );
94676 memAboutToChange(p, pX);
94677 apArg[i] = pX;
94678 pX++;
104166 static Select *isCandidateForInOpt(const Expr *pX){
104172 if( !ExprUseXSelect(pX) ) return 0; /* Not a subquery */
104173 if( ExprHasProperty(pX, EP_VarSelect) ) return 0; /* Correlated subq */
104174 p = pX->x.pSelect;
104323 Expr *pX, /* The IN expression */
104335 assert( pX->op==TK_IN );
104343 if( prRhsHasNull && ExprUseXSelect(pX) ){
104345 ExprList *pEList = pX->x.pSelect->pEList;
104357 if( pParse->nErr==0 && (p = isCandidateForInOpt(pX))!=0 ){
104396 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
104439 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
104500 && ExprUseXList(pX)
104501 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
104518 assert( pX->op==TK_IN );
104519 sqlite3CodeRhsOfIN(pParse, pX, iTab);
104528 n = sqlite3ExprVectorSize(pX->pLeft);
106285 Expr *pX; /* The X expression */
106296 if( (pX = pExpr->pLeft)!=0 ){
106297 pDel = sqlite3ExprDup(db, pX, 0);
106302 testcase( pX->op==TK_COLUMN );
106316 if( pX ){
115769 Expr *pX = sqlite3ColumnExpr(p, &p->aCol[ii]);
115772 if( sqlite3ResolveSelfReference(pParse, p, NC_GenCol, pX, 0) ){
138090 Select *pX;
138091 for(pX=pSubq; pX; pX=pX->pPrior){
138092 assert( (pX->selFlags & (SF_Recursive))==0 );
138301 Select *pX;
138310 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
138311 if( pX==0 ) return WRC_Continue;
138971 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
138972 sqlite3DbFree(db, pX->zEName);
138974 pX->zEName = sqlite3DbStrDup(db, pSub->pEList->a[j].zEName);
138975 testcase( pX->zEName==0 );
138977 pX->zEName = sqlite3MPrintf(db, "%s.%s.%s",
138979 testcase( pX->zEName==0 );
138981 pX->eEName = ENAME_TAB;
141070 Trigger *pX;
141072 for(pX=pList; pX; pX=pX->pNext){
141073 printf(" %s", pX->zName);
146845 Expr *pX /* The IN expression to be reduced */
146849 pNew = sqlite3ExprDup(db, pX, 0);
146864 if( pLoop->aLTerm[i]->pExpr==pX ){
146906 sqlite3TreeViewExpr(0, pX, 0);
146938 Expr *pX = pTerm->pExpr;
146944 if( pX->op==TK_EQ || pX->op==TK_IS ){
146945 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
146946 }else if( pX->op==TK_ISNULL ){
146967 assert( pX->op==TK_IN );
146971 if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){
146978 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;
146982 if( !ExprUseXSelect(pX) || pX->x.pSelect->pEList->nExpr==1 ){
146983 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, 0, &iTab);
146986 pX = removeUnindexableInClauseTerms(pParse, iEq, pLoop, pX);
146990 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, aiMap, &iTab);
146993 sqlite3ExprDelete(db, pX);
146994 pX = pTerm->pExpr;
147024 if( pLoop->aLTerm[i]->pExpr==pX ){
147605 IdxExprTrans *pX = p->u.pIdxTrans;
147606 if( sqlite3ExprCompare(0, pExpr, pX->pIdxExpr, pX->iTabCur)==0 ){
147607 preserveExpr(pX, pExpr);
147610 pExpr->iTable = pX->iIdxCur;
147611 pExpr->iColumn = pX->iIdxCol;
147628 IdxExprTrans *pX = p->u.pIdxTrans;
147629 if( pExpr->iTable==pX->iTabCur && pExpr->iColumn==pX->iTabCol ){
147631 preserveExpr(pX, pExpr);
147633 pExpr->iTable = pX->iIdxCur;
147634 pExpr->iColumn = pX->iIdxCol;
147971 Expr *pX; /* The expression that defines the start bound */
147990 pX = pStart->pExpr;
147991 assert( pX!=0 );
147993 if( sqlite3ExprIsVector(pX->pRight) ){
147995 codeExprOrVector(pParse, pX->pRight, r1, 1);
147996 testcase( pX->op==TK_GT );
147997 testcase( pX->op==TK_GE );
147998 testcase( pX->op==TK_LT );
147999 testcase( pX->op==TK_LE );
148000 op = aMoveOp[((pX->op - TK_GT - 1) & 0x3) | 0x1];
148001 assert( pX->op!=TK_GT || op==OP_SeekGE );
148002 assert( pX->op!=TK_GE || op==OP_SeekGE );
148003 assert( pX->op!=TK_LT || op==OP_SeekLE );
148004 assert( pX->op!=TK_LE || op==OP_SeekLE );
148006 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
148008 op = aMoveOp[(pX->op - TK_GT)];
148012 VdbeCoverageIf(v, pX->op==TK_GT);
148013 VdbeCoverageIf(v, pX->op==TK_LE);
148014 VdbeCoverageIf(v, pX->op==TK_LT);
148015 VdbeCoverageIf(v, pX->op==TK_GE);
148023 Expr *pX;
148024 pX = pEnd->pExpr;
148025 assert( pX!=0 );
148030 codeExprOrVector(pParse, pX->pRight, memEndValue, 1);
148031 if( 0==sqlite3ExprIsVector(pX->pRight)
148032 && (pX->op==TK_LT || pX->op==TK_GT)
148038 if( 0==sqlite3ExprIsVector(pX->pRight) ){
150915 Expr *pX; /* An expression being tested */
150939 && (pX = whereRightSubexprIsColumn(pTerm->pExpr))!=0
150943 if( pScan->aiCur[j]==pX->iTable
150944 && pScan->aiColumn[j]==pX->iColumn ){
150949 pScan->aiCur[j] = pX->iTable;
150950 pScan->aiColumn[j] = pX->iColumn;
150959 pX = pTerm->pExpr;
150960 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
150963 assert(pX->pLeft);
150964 pColl = sqlite3ExprCompareCollSeq(pParse, pX);
150971 && (pX = pTerm->pExpr->pRight, ALWAYS(pX!=0))
150972 && pX->op==TK_COLUMN
150973 && pX->iTable==pScan->aiCur[0]
150974 && pX->iColumn==pScan->aiColumn[0]
151506 Expr *pX = pTerm->pExpr;
151509 pColl = sqlite3ExprCompareCollSeq(pParse, pX);
152682 const WhereLoop *pX, /* First WhereLoop to compare */
152686 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){
152689 if( pX->rRun>pY->rRun && pX->nOut>pY->nOut ) return 0;
152690 if( pY->nSkip > pX->nSkip ) return 0;
152691 for(i=pX->nLTerm-1; i>=0; i--){
152692 if( pX->aLTerm[i]==0 ) continue;
152694 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
152698 if( (pX->wsFlags&WHERE_IDX_ONLY)!=0
152990 WhereTerm *pTerm, *pX;
153002 pX = pLoop->aLTerm[j];
153003 if( pX==0 ) continue;
153004 if( pX==pTerm ) break;
153005 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
154068 Expr *pX = pHidden->pWC->a[iTerm].pExpr;
154069 if( pX->pLeft ){
154070 pC = sqlite3ExprCompareCollSeq(pHidden->pParse, pX);
154613 Expr *pX = pLoop->aLTerm[j]->pExpr;
154615 if( pLoop->aLTerm[i]->pExpr==pX ){
154867 WhereLoop **pX; /* Used to divy up the pSpace memory */
154901 pX = (WhereLoop**)(aFrom+mxChoice);
154902 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
154903 pFrom->aLoop = pX;
154912 aSortCost = (LogEst*)pX;
154916 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );
173034 const unsigned char *pX = (const unsigned char*)pEnd;
173038 u64 c = p<pX ? *p : 0;
228094 PrefixMerger *pX = &aMerger[i];
228095 if( pX->iter.aPoslist && pX->iter.iRowid==iLastRowid ){
228096 fts5DoclistIterNext(&pX->iter);
228097 fts5PrefixMergerInsertByRowid(&pHead, pX);