Lines Matching refs:pX
25272 struct tm *pX; in osLocaltime() local
25277 pX = localtime(t); in osLocaltime()
25283 pX = pTm; in osLocaltime()
25285 pX = 0; in osLocaltime()
25289 if( pX ) *pTm = *pX; in osLocaltime()
25293 rc = pX==0; in osLocaltime()
29707 static int debugMutexHeld(sqlite3_mutex *pX){ in debugMutexHeld() argument
29708 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexHeld()
29711 static int debugMutexNotheld(sqlite3_mutex *pX){ in debugMutexNotheld() argument
29712 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexNotheld()
29758 static void debugMutexFree(sqlite3_mutex *pX){ in debugMutexFree() argument
29759 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexFree()
29781 static void debugMutexEnter(sqlite3_mutex *pX){ in debugMutexEnter() argument
29782 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexEnter()
29783 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexEnter()
29786 static int debugMutexTry(sqlite3_mutex *pX){ in debugMutexTry() argument
29787 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexTry()
29788 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexTry()
29799 static void debugMutexLeave(sqlite3_mutex *pX){ in debugMutexLeave() argument
29800 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexLeave()
29801 assert( debugMutexHeld(pX) ); in debugMutexLeave()
29803 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexLeave()
33464 Window *pX; in sqlite3TreeViewSelect() local
33467 for(pX=p->pWin; pX; pX=pX->pNextWin){ in sqlite3TreeViewSelect()
33468 sqlite3TreeViewWinFunc(pView, pX, pX->pNextWin!=0); in sqlite3TreeViewSelect()
33494 Window *pX; in sqlite3TreeViewSelect() local
33496 for(pX=p->pWinDefn; pX; pX=pX->pNextWin){ in sqlite3TreeViewSelect()
33497 sqlite3TreeViewWindow(pView, pX, pX->pNextWin!=0); in sqlite3TreeViewSelect()
33940 const Expr *pX, *pY, *pZ; in sqlite3TreeViewExpr() local
33941 pX = pExpr->pLeft; in sqlite3TreeViewExpr()
33947 sqlite3TreeViewExpr(pView, pX, 1); in sqlite3TreeViewExpr()
43816 unixShm *pX; in assertLockingArrayOk()
43820 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){ in assertLockingArrayOk()
43823 if( pX->exclMask & (1<<i) ){ in assertLockingArrayOk()
43826 }else if( pX->sharedMask & (1<<i) ){ in assertLockingArrayOk()
56425 PgHdr1 *pX = (PgHdr1*)&zBulk[pCache->szPage]; local
56426 pX->page.pBuf = zBulk;
56427 pX->page.pExtra = (u8*)pX + ROUND8(sizeof(*pX));
56428 assert( EIGHT_BYTE_ALIGNMENT( pX->page.pExtra ) );
56429 pX->isBulkLocal = 1;
56430 pX->isAnchor = 0;
56431 pX->pNext = pCache->pFree;
56432 pX->pLruPrev = 0; /* Initializing this saves a valgrind error */
56433 pCache->pFree = pX;
76217 BtCursor *pX; /* Looping over other all cursors */ local
76258 for(pX=pBt->pCursor; pX; pX=pX->pNext){
76259 if( pX->pgnoRoot==iTable ){
76260 pX->curFlags |= BTCF_Multiple;
78563 const BtreePayload *pX, /* Payload with which to construct the cell */
78587 nPayload = pX->nData + pX->nZero;
78588 pSrc = pX->pData;
78589 nSrc = pX->nData;
78592 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
78594 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
78595 nSrc = nPayload = (int)pX->nKey;
78596 pSrc = pX->pKey;
78652 assert( info.nKey==pX->nKey );
80748 const BtreePayload *pX, /* Source of data to write */
80752 int nData = pX->nData - iOffset;
80766 int rc = btreeOverwriteContent(pPage, pDest+nData, pX, iOffset+nData,
80771 if( memcmp(pDest, ((u8*)pX->pData) + iOffset, iAmt)!=0 ){
80778 memmove(pDest, ((u8*)pX->pData) + iOffset, iAmt);
80791 const BtreePayload *pX /* Content to write into the cell */
80794 int nTotal = pX->nData + pX->nZero; /* Total bytes of to write */
80804 rc = btreeOverwriteContent(pPage, pCur->info.pPayload, pX,
80826 rc = btreeOverwriteContent(pPage, pPage->aData+4, pX,
80840 static int btreeOverwriteCell(BtCursor *pCur, const BtreePayload *pX){
80841 int nTotal = pX->nData + pX->nZero; /* Total bytes of to write */
80851 return btreeOverwriteContent(pPage, pCur->info.pPayload, pX,
80855 return btreeOverwriteOverflowCell(pCur, pX);
80892 const BtreePayload *pX, /* Content of the row to be inserted */
80953 assert( (flags & BTREE_PREFORMAT) || (pX->pKey==0)==(pCur->pKeyInfo==0) );
80956 assert( pX->pKey==0 );
80960 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
80969 assert( pX->nKey==pCur->info.nKey );
80978 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
80981 assert( pX->nData>=0 && pX->nZero>=0 );
80983 && pCur->info.nPayload==(u32)pX->nData+pX->nZero
80986 return btreeOverwriteCell(pCur, pX);
80994 rc = sqlite3BtreeTableMoveto(pCur, pX->nKey,
81012 if( pX->nMem ){
81015 r.aMem = pX->aMem;
81016 r.nField = pX->nMem;
81021 rc = btreeMoveto(pCur, pX->pKey, pX->nKey,
81033 if( pCur->info.nKey==pX->nKey ){
81035 x2.pData = pX->pKey;
81036 x2.nData = (int)pX->nKey; assert( pX->nKey<=0x7fffffff );
81046 assert( pPage->intKey || pX->nKey>=0 || (flags & BTREE_PREFORMAT) );
81059 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
81082 rc = fillInCell(pPage, newCell, pX, &szNew);
81176 pCur->pKey = sqlite3Malloc( pX->nKey );
81180 memcpy(pCur->pKey, pX->pKey, pX->nKey);
81184 pCur->nKey = pX->nKey;
84884 Mem *pX; local
84886 for(i=1, pX=pVdbe->aMem+1; i<pVdbe->nMem; i++, pX++){
84887 if( pX->pScopyFrom==pMem ){
84891 (int)(pX - pVdbe->aMem), (int)(pMem - pVdbe->aMem));
84899 mFlags = pMem->flags & pX->flags & pX->mScopyFlags;
84900 assert( (mFlags&(MEM_Int|MEM_IntReal))==0 || pMem->u.i==pX->u.i );
84904 pX->flags = MEM_Undefined;
84905 pX->pScopyFrom = 0;
86927 VdbeOp *pX = &v->aOp[j]; local
86928 if( pX->opcode==OP_Return ){
86929 if( pX->p1==iRetReg ) break;
86932 if( pX->opcode==OP_Noop ) continue;
86933 if( pX->opcode==OP_Explain ) continue;
98654 Btree *pX;
98689 pX = pDb->pBt;
98690 assert( pX!=0 );
98736 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->uc.pCursor);
102906 Mem *pX;
102925 pX = &aMem[pOp->p3];
102928 assert( memIsValid(pX) );
102929 memAboutToChange(p, pX);
102930 apArg[i] = pX;
102931 pX++;
113327 static Select *isCandidateForInOpt(const Expr *pX){
113333 if( !ExprUseXSelect(pX) ) return 0; /* Not a subquery */
113334 if( ExprHasProperty(pX, EP_VarSelect) ) return 0; /* Correlated subq */
113335 p = pX->x.pSelect;
113487 Expr *pX, /* The IN expression */
113499 assert( pX->op==TK_IN );
113508 if( prRhsHasNull && ExprUseXSelect(pX) ){
113510 ExprList *pEList = pX->x.pSelect->pEList;
113522 if( pParse->nErr==0 && (p = isCandidateForInOpt(pX))!=0 ){
113561 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
113604 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
113664 && ExprUseXList(pX)
113665 && (!sqlite3InRhsIsConstant(pParse,pX) || pX->x.pList->nExpr<=2)
113684 assert( pX->op==TK_IN );
113685 sqlite3CodeRhsOfIN(pParse, pX, iTab);
113694 n = sqlite3ExprVectorSize(pX->pLeft);
115783 Expr *pX; /* The X expression */
115794 if( (pX = pExpr->pLeft)!=0 ){
115795 pDel = sqlite3ExprDup(db, pX, 0);
115800 testcase( pX->op==TK_COLUMN );
115814 if( pX ){
116006 Expr *pX = sqlite3ExprSkipCollateAndLikely(pExpr);
116007 testcase( pX!=pExpr );
116008 if( ALWAYS(pX)
116009 && (ExprHasProperty(pX,EP_Subquery) || pX->op==TK_REGISTER)
121405 Index *pX;
121408 for(pX=pTab->pIndex; pX; pX=pX->pNext){
121410 if( !HasRowid(pTab) && IsPrimaryKeyIndex(pX) ){
121411 nColX = pX->nKeyCol;
121413 nColX = pX->nColumn;
125746 Expr *pX = sqlite3ColumnExpr(p, &p->aCol[ii]);
125749 if( sqlite3ResolveSelfReference(pParse, p, NC_GenCol, pX, 0) ){
136241 Expr *pX = pList->a[k].pExpr;
136242 int y = sqlite3ExprCodeTarget(pParse, pX, iRegStore);
136245 ExprHasProperty(pX, EP_Subquery) ? OP_Copy : OP_SCopy, y, iRegStore);
147106 struct ExprList_item *pX = &pEList->a[i];
147110 if( (zName = pX->zEName)!=0 && pX->fg.eEName==ENAME_NAME ){
147113 Expr *pColExpr = sqlite3ExprSkipCollateAndLikely(pX->pExpr);
147132 assert( zName==pX->zEName ); /* pointer comparison intended */
147162 if( pX->fg.bNoExpand ){
147166 if( zName && sqlite3HashInsert(&ht, zName, pX)==pX ){
150128 Select *pX;
150129 for(pX=pSubq; pX; pX=pX->pPrior){
150130 assert( (pX->selFlags & (SF_Recursive))==0 );
150230 Select *pX; /* For looping over compound elements of pSub */
150245 for(pX=pSub; pX; pX=pX->pPrior){
150246 if( (pX->selFlags & (SF_Distinct|SF_Aggregate))!=0 ){
150247 testcase( pX->selFlags & SF_Distinct );
150248 testcase( pX->selFlags & SF_Aggregate );
150251 if( pX->pPrior && pX->op!=TK_ALL ){
150257 if( pX->pWin ){
150279 for(pX=pSub; pX; pX=pX->pPrior) {
150280 Expr *pY = pX->pEList->a[j].pExpr;
150284 pX->selFlags |= SF_PushDown;
150447 Select *pX;
150456 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
150457 if( pX==0 ) return WRC_Continue;
151127 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
151128 assert( pX->zEName==0 );
151129 pX->zEName = sqlite3MPrintf(db,"..%s", zUName);
151130 pX->fg.eEName = ENAME_TAB;
151131 pX->fg.bUsingTerm = 1;
151142 struct ExprList_item *pX; /* Newly added ExprList term */
151218 pX = &pNew->a[pNew->nExpr-1];
151219 assert( pX->zEName==0 );
151223 pX->zEName = sqlite3DbStrDup(db, pNestedFrom->a[j].zEName);
151224 testcase( pX->zEName==0 );
151226 pX->zEName = sqlite3MPrintf(db, "%s.%s.%s",
151228 testcase( pX->zEName==0 );
151230 pX->fg.eEName = (j==pTab->nCol ? ENAME_ROWID : ENAME_TAB);
151236 pX->fg.bNoExpand = 1;
151239 pX->zEName = sqlite3MPrintf(db, "%s.%s", zTabName, zName);
151240 pX->fg.eEName = ENAME_NAME;
151242 pX->zEName = sqlite3DbStrDup(db, zName);
151243 pX->fg.eEName = ENAME_NAME;
153347 Expr *pX = p->pEList->a[iOrderByCol-1].pExpr;
153348 Expr *pBase = sqlite3ExprSkipCollateAndLikely(pX);
153350 pX = pBase->pLeft;
153351 pBase = sqlite3ExprSkipCollateAndLikely(pX);
153357 sqlite3ExprToRegister(pX, iAMem+j);
153947 Trigger *pX;
153949 for(pX=pList; pX; pX=pX->pNext){
153950 printf(" %s", pX->zName);
160176 Expr *pX /* The IN expression to be reduced */
160181 pNew = sqlite3ExprDup(db, pX, 0);
160198 if( pLoop->aLTerm[i]->pExpr==pX ){
160245 sqlite3TreeViewExpr(0, pX, 0);
160275 Expr *pX = pTerm->pExpr;
160293 assert( pX->op==TK_IN );
160296 if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){
160303 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;
160307 if( !ExprUseXSelect(pX) || pX->x.pSelect->pEList->nExpr==1 ){
160308 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, 0, &iTab);
160311 Expr *pXMod = removeUnindexableInClauseTerms(pParse, iEq, pLoop, pX);
160347 if( pLoop->aLTerm[i]->pExpr==pX ){
160410 Expr *pX = pTerm->pExpr;
160415 if( pX->op==TK_EQ || pX->op==TK_IS ){
160416 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
160417 }else if( pX->op==TK_ISNULL ){
160422 assert( pX->op==TK_IN );
161341 Expr *pX; /* The expression that defines the start bound */
161360 pX = pStart->pExpr;
161361 assert( pX!=0 );
161363 if( sqlite3ExprIsVector(pX->pRight) ){
161365 codeExprOrVector(pParse, pX->pRight, r1, 1);
161366 testcase( pX->op==TK_GT );
161367 testcase( pX->op==TK_GE );
161368 testcase( pX->op==TK_LT );
161369 testcase( pX->op==TK_LE );
161370 op = aMoveOp[((pX->op - TK_GT - 1) & 0x3) | 0x1];
161371 assert( pX->op!=TK_GT || op==OP_SeekGE );
161372 assert( pX->op!=TK_GE || op==OP_SeekGE );
161373 assert( pX->op!=TK_LT || op==OP_SeekLE );
161374 assert( pX->op!=TK_LE || op==OP_SeekLE );
161376 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
161378 op = aMoveOp[(pX->op - TK_GT)];
161382 VdbeCoverageIf(v, pX->op==TK_GT);
161383 VdbeCoverageIf(v, pX->op==TK_LE);
161384 VdbeCoverageIf(v, pX->op==TK_LT);
161385 VdbeCoverageIf(v, pX->op==TK_GE);
161393 Expr *pX;
161394 pX = pEnd->pExpr;
161395 assert( pX!=0 );
161400 codeExprOrVector(pParse, pX->pRight, memEndValue, 1);
161401 if( 0==sqlite3ExprIsVector(pX->pRight)
161402 && (pX->op==TK_LT || pX->op==TK_GT)
161408 if( 0==sqlite3ExprIsVector(pX->pRight) ){
164792 Expr *pX = pTerm->pExpr;
164797 if( sqlite3ExprIsVector(pX->pLeft) ){
164801 inexpr.pLeft = pX->pLeft->x.pList->a[iField].pExpr;
164802 assert( ExprUseXSelect(pX) );
164803 inexpr.pRight = pX->x.pSelect->pEList->a[iField].pExpr;
164804 pX = &inexpr;
164807 if( sqlite3IndexAffinityOk(pX, idxaff) ){
164808 CollSeq *pRet = sqlite3ExprCompareCollSeq(pParse, pX);
164822 Expr *pX; /* An expression being tested */
164846 && (pX = whereRightSubexprIsColumn(pTerm->pExpr))!=0
164850 if( pScan->aiCur[j]==pX->iTable
164851 && pScan->aiColumn[j]==pX->iColumn ){
164856 pScan->aiCur[j] = pX->iTable;
164857 pScan->aiColumn[j] = pX->iColumn;
164866 pX = pTerm->pExpr;
164873 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
164876 assert(pX->pLeft);
164877 pColl = sqlite3ExprCompareCollSeq(pParse, pX);
164886 && (pX = pTerm->pExpr->pRight, ALWAYS(pX!=0))
164887 && pX->op==TK_COLUMN
164888 && pX->iTable==pScan->aiCur[0]
164889 && pX->iColumn==pScan->aiColumn[0]
165600 Expr *pX = pTerm->pExpr;
165603 pColl = sqlite3ExprCompareCollSeq(pParse, pX);
165607 if( ALWAYS(pX->pLeft!=0)
165608 && sqlite3ExprAffinity(pX->pLeft)!=SQLITE_AFF_TEXT
167112 const WhereLoop *pX, /* First WhereLoop to compare */
167116 if( pX->rRun>pY->rRun && pX->nOut>pY->nOut ) return 0; /* (1d) and (2a) */
167117 assert( (pX->wsFlags & WHERE_VIRTUALTABLE)==0 );
167119 if( pX->u.btree.nEq < pY->u.btree.nEq /* (1b) */
167120 && pX->u.btree.pIndex==pY->u.btree.pIndex /* (1a) */
167121 && pX->nSkip==0 && pY->nSkip==0 /* (1c) */
167125 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){
167128 if( pY->nSkip > pX->nSkip ) return 0; /* (2d) */
167129 for(i=pX->nLTerm-1; i>=0; i--){
167130 if( pX->aLTerm[i]==0 ) continue;
167132 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
167136 if( (pX->wsFlags&WHERE_IDX_ONLY)!=0
167428 WhereTerm *pTerm, *pX;
167440 pX = pLoop->aLTerm[j];
167441 if( pX==0 ) continue;
167442 if( pX==pTerm ) break;
167443 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
168917 Expr *pX = termFromWhereClause(pHidden->pWC, iTerm)->pExpr;
168918 if( pX->pLeft ){
168919 pC = sqlite3ExprCompareCollSeq(pHidden->pParse, pX);
169678 Expr *pX = pLoop->aLTerm[j]->pExpr;
169680 if( pLoop->aLTerm[i]->pExpr==pX ){
170162 WhereLoop **pX; /* Used to divy up the pSpace memory */
170210 pX = (WhereLoop**)(aFrom+mxChoice);
170211 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
170212 pFrom->aLoop = pX;
170221 aSortCost = (LogEst*)pX;
170225 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );
171325 Expr *pX; /* The expression of pT */
171327 pX = pT->pExpr;
171328 assert( pX!=0 );
171329 assert( pT->prereqAll!=0 || !ExprHasProperty(pX, EP_OuterON) );
171331 && (nTabList==0 || exprIsDeterministic(pX)) /* Condition (4) */
171332 && !(ExprHasProperty(pX, EP_InnerON) /* Condition (3) */
171335 sqlite3ExprIfFalse(pParse, pX, pWInfo->iBreak, SQLITE_JUMPIFNULL);
189475 const unsigned char *pX = (const unsigned char*)pEnd;
189479 u64 c = p<pX ? *p : 0;
250483 PrefixMerger *pX = &aMerger[i];
250484 if( pX->iter.aPoslist && pX->iter.iRowid==iLastRowid ){
250485 fts5DoclistIterNext(&pX->iter);
250486 fts5PrefixMergerInsertByRowid(&pHead, pX);