Lines Matching refs:pX
24773 struct tm *pX; in osLocaltime() local
24778 pX = localtime(t); in osLocaltime()
24784 pX = pTm; in osLocaltime()
24786 pX = 0; in osLocaltime()
24790 if( pX ) *pTm = *pX; in osLocaltime()
24794 rc = pX==0; in osLocaltime()
29195 static int debugMutexHeld(sqlite3_mutex *pX){ in debugMutexHeld() argument
29196 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexHeld()
29199 static int debugMutexNotheld(sqlite3_mutex *pX){ in debugMutexNotheld() argument
29200 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexNotheld()
29246 static void debugMutexFree(sqlite3_mutex *pX){ in debugMutexFree() argument
29247 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexFree()
29269 static void debugMutexEnter(sqlite3_mutex *pX){ in debugMutexEnter() argument
29270 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexEnter()
29271 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexEnter()
29274 static int debugMutexTry(sqlite3_mutex *pX){ in debugMutexTry() argument
29275 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexTry()
29276 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexTry()
29287 static void debugMutexLeave(sqlite3_mutex *pX){ in debugMutexLeave() argument
29288 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexLeave()
29289 assert( debugMutexHeld(pX) ); in debugMutexLeave()
29291 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexLeave()
32890 Window *pX; in sqlite3TreeViewSelect() local
32893 for(pX=p->pWin; pX; pX=pX->pNextWin){ in sqlite3TreeViewSelect()
32894 sqlite3TreeViewWinFunc(pView, pX, pX->pNextWin!=0); in sqlite3TreeViewSelect()
32920 Window *pX; in sqlite3TreeViewSelect() local
32922 for(pX=p->pWinDefn; pX; pX=pX->pNextWin){ in sqlite3TreeViewSelect()
32923 sqlite3TreeViewWindow(pView, pX, pX->pNextWin!=0); in sqlite3TreeViewSelect()
33366 const Expr *pX, *pY, *pZ; in sqlite3TreeViewExpr() local
33367 pX = pExpr->pLeft; in sqlite3TreeViewExpr()
33373 sqlite3TreeViewExpr(pView, pX, 1); in sqlite3TreeViewExpr()
43336 unixShm *pX;
43340 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
43343 if( pX->exclMask & (1<<i) ){
43346 }else if( pX->sharedMask & (1<<i) ){
50730 winShm *pX; /* For looping over all siblings */
50754 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
50755 if( pX==p ) continue;
50756 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
50757 allMask |= pX->sharedMask;
50779 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
50780 if( (pX->exclMask & mask)!=0 ){
50784 allShared |= pX->sharedMask;
50804 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
50805 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
55477 PgHdr1 *pX = (PgHdr1*)&zBulk[pCache->szPage];
55478 pX->page.pBuf = zBulk;
55479 pX->page.pExtra = &pX[1];
55480 pX->isBulkLocal = 1;
55481 pX->isAnchor = 0;
55482 pX->pNext = pCache->pFree;
55483 pX->pLruPrev = 0; /* Initializing this saves a valgrind error */
55484 pCache->pFree = pX;
75194 BtCursor *pX; /* Looping over other all cursors */
75235 for(pX=pBt->pCursor; pX; pX=pX->pNext){
75236 if( pX->pgnoRoot==iTable ){
75237 pX->curFlags |= BTCF_Multiple;
77521 const BtreePayload *pX, /* Payload with which to construct the cell */
77545 nPayload = pX->nData + pX->nZero;
77546 pSrc = pX->pData;
77547 nSrc = pX->nData;
77550 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
77552 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
77553 nSrc = nPayload = (int)pX->nKey;
77554 pSrc = pX->pKey;
77610 assert( info.nKey==pX->nKey );
79695 const BtreePayload *pX, /* Source of data to write */
79699 int nData = pX->nData - iOffset;
79713 int rc = btreeOverwriteContent(pPage, pDest+nData, pX, iOffset+nData,
79718 if( memcmp(pDest, ((u8*)pX->pData) + iOffset, iAmt)!=0 ){
79725 memmove(pDest, ((u8*)pX->pData) + iOffset, iAmt);
79738 const BtreePayload *pX /* Content to write into the cell */
79741 int nTotal = pX->nData + pX->nZero; /* Total bytes of to write */
79751 rc = btreeOverwriteContent(pPage, pCur->info.pPayload, pX,
79773 rc = btreeOverwriteContent(pPage, pPage->aData+4, pX,
79787 static int btreeOverwriteCell(BtCursor *pCur, const BtreePayload *pX){
79788 int nTotal = pX->nData + pX->nZero; /* Total bytes of to write */
79798 return btreeOverwriteContent(pPage, pCur->info.pPayload, pX,
79802 return btreeOverwriteOverflowCell(pCur, pX);
79839 const BtreePayload *pX, /* Content of the row to be inserted */
79900 assert( (flags & BTREE_PREFORMAT) || (pX->pKey==0)==(pCur->pKeyInfo==0) );
79903 assert( pX->pKey==0 );
79907 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
79916 assert( pX->nKey==pCur->info.nKey );
79925 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
79928 assert( pX->nData>=0 && pX->nZero>=0 );
79930 && pCur->info.nPayload==(u32)pX->nData+pX->nZero
79933 return btreeOverwriteCell(pCur, pX);
79941 rc = sqlite3BtreeTableMoveto(pCur, pX->nKey,
79959 if( pX->nMem ){
79962 r.aMem = pX->aMem;
79963 r.nField = pX->nMem;
79968 rc = btreeMoveto(pCur, pX->pKey, pX->nKey,
79980 if( pCur->info.nKey==pX->nKey ){
79982 x2.pData = pX->pKey;
79983 x2.nData = pX->nKey;
79993 assert( pPage->intKey || pX->nKey>=0 || (flags & BTREE_PREFORMAT) );
80006 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
80029 rc = fillInCell(pPage, newCell, pX, &szNew);
80123 pCur->pKey = sqlite3Malloc( pX->nKey );
80127 memcpy(pCur->pKey, pX->pKey, pX->nKey);
80131 pCur->nKey = pX->nKey;
83830 Mem *pX;
83831 for(i=1, pX=pVdbe->aMem+1; i<pVdbe->nMem; i++, pX++){
83832 if( pX->pScopyFrom==pMem ){
83836 (int)(pX - pVdbe->aMem), (int)(pMem - pVdbe->aMem));
83844 mFlags = pMem->flags & pX->flags & pX->mScopyFlags;
83845 assert( (mFlags&(MEM_Int|MEM_IntReal))==0 || pMem->u.i==pX->u.i );
83849 pX->flags = MEM_Undefined;
83850 pX->pScopyFrom = 0;
85867 VdbeOp *pX = &v->aOp[j];
85868 if( pX->opcode==OP_Return ){
85869 if( pX->p1==iRetReg ) break;
85872 if( pX->opcode==OP_Noop ) continue;
85873 if( pX->opcode==OP_Explain ) continue;
97396 Btree *pX;
97431 pX = pDb->pBt;
97432 assert( pX!=0 );
97478 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->uc.pCursor);
101628 Mem *pX;
101647 pX = &aMem[pOp->p3];
101649 assert( memIsValid(pX) );
101650 memAboutToChange(p, pX);
101651 apArg[i] = pX;
101652 pX++;
111963 static Select *isCandidateForInOpt(const Expr *pX){
111969 if( !ExprUseXSelect(pX) ) return 0; /* Not a subquery */
111970 if( ExprHasProperty(pX, EP_VarSelect) ) return 0; /* Correlated subq */
111971 p = pX->x.pSelect;
112123 Expr *pX, /* The IN expression */
112135 assert( pX->op==TK_IN );
112144 if( prRhsHasNull && ExprUseXSelect(pX) ){
112146 ExprList *pEList = pX->x.pSelect->pEList;
112158 if( pParse->nErr==0 && (p = isCandidateForInOpt(pX))!=0 ){
112197 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
112240 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
112299 && ExprUseXList(pX)
112300 && (!sqlite3InRhsIsConstant(pParse,pX) || pX->x.pList->nExpr<=2)
112319 assert( pX->op==TK_IN );
112320 sqlite3CodeRhsOfIN(pParse, pX, iTab);
112329 n = sqlite3ExprVectorSize(pX->pLeft);
114248 Expr *pX; /* The X expression */
114259 if( (pX = pExpr->pLeft)!=0 ){
114260 pDel = sqlite3ExprDup(db, pX, 0);
114265 testcase( pX->op==TK_COLUMN );
114279 if( pX ){
114453 Expr *pX = sqlite3ExprSkipCollateAndLikely(pExpr);
114454 testcase( pX!=pExpr );
114455 if( ALWAYS(pX)
114456 && (ExprHasProperty(pX,EP_Subquery) || pX->op==TK_REGISTER)
119760 Index *pX;
119763 for(pX=pTab->pIndex; pX; pX=pX->pNext){
119765 if( !HasRowid(pTab) && IsPrimaryKeyIndex(pX) ){
119766 nColX = pX->nKeyCol;
119768 nColX = pX->nColumn;
124114 Expr *pX = sqlite3ColumnExpr(p, &p->aCol[ii]);
124117 if( sqlite3ResolveSelfReference(pParse, p, NC_GenCol, pX, 0) ){
134306 Expr *pX = pList->a[k].pExpr;
134307 int y = sqlite3ExprCodeTarget(pParse, pX, iRegStore);
134310 ExprHasProperty(pX, EP_Subquery) ? OP_Copy : OP_SCopy, y, iRegStore);
145115 struct ExprList_item *pX = &pEList->a[i];
145119 if( (zName = pX->zEName)!=0 && pX->fg.eEName==ENAME_NAME ){
145122 Expr *pColExpr = sqlite3ExprSkipCollateAndLikely(pX->pExpr);
145141 assert( zName==pX->zEName ); /* pointer comparison intended */
145171 if( pX->fg.bNoExpand ){
145175 if( zName && sqlite3HashInsert(&ht, zName, pX)==pX ){
148112 Select *pX;
148113 for(pX=pSubq; pX; pX=pX->pPrior){
148114 assert( (pX->selFlags & (SF_Recursive))==0 );
148214 Select *pX; /* For looping over compound elements of pSub */
148229 for(pX=pSub; pX; pX=pX->pPrior){
148230 if( (pX->selFlags & (SF_Distinct|SF_Aggregate))!=0 ){
148231 testcase( pX->selFlags & SF_Distinct );
148232 testcase( pX->selFlags & SF_Aggregate );
148235 if( pX->pPrior && pX->op!=TK_ALL ){
148241 if( pX->pWin ){
148263 for(pX=pSub; pX; pX=pX->pPrior) {
148264 Expr *pY = pX->pEList->a[j].pExpr;
148268 pX->selFlags |= SF_PushDown;
148431 Select *pX;
148440 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
148441 if( pX==0 ) return WRC_Continue;
149093 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
149094 assert( pX->zEName==0 );
149095 pX->zEName = sqlite3MPrintf(db,"..%s", zUName);
149096 pX->fg.eEName = ENAME_TAB;
149097 pX->fg.bUsingTerm = 1;
149108 struct ExprList_item *pX; /* Newly added ExprList term */
149184 pX = &pNew->a[pNew->nExpr-1];
149185 assert( pX->zEName==0 );
149189 pX->zEName = sqlite3DbStrDup(db, pNestedFrom->a[j].zEName);
149190 testcase( pX->zEName==0 );
149192 pX->zEName = sqlite3MPrintf(db, "%s.%s.%s",
149194 testcase( pX->zEName==0 );
149196 pX->fg.eEName = (j==pTab->nCol ? ENAME_ROWID : ENAME_TAB);
149202 pX->fg.bNoExpand = 1;
149205 pX->zEName = sqlite3MPrintf(db, "%s.%s", zTabName, zName);
149206 pX->fg.eEName = ENAME_NAME;
149208 pX->zEName = sqlite3DbStrDup(db, zName);
149209 pX->fg.eEName = ENAME_NAME;
151795 Trigger *pX;
151797 for(pX=pList; pX; pX=pX->pNext){
151798 printf(" %s", pX->zName);
157908 Expr *pX /* The IN expression to be reduced */
157913 pNew = sqlite3ExprDup(db, pX, 0);
157930 if( pLoop->aLTerm[i]->pExpr==pX ){
157975 sqlite3TreeViewExpr(0, pX, 0);
158008 Expr *pX = pTerm->pExpr;
158014 if( pX->op==TK_EQ || pX->op==TK_IS ){
158015 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
158016 }else if( pX->op==TK_ISNULL ){
158037 assert( pX->op==TK_IN );
158041 if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){
158048 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;
158052 if( !ExprUseXSelect(pX) || pX->x.pSelect->pEList->nExpr==1 ){
158053 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, 0, &iTab);
158058 pX = removeUnindexableInClauseTerms(pParse, iEq, pLoop, pX);
158061 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, aiMap,&iTab);
158064 sqlite3ExprDelete(db, pX);
158066 int n = sqlite3ExprVectorSize(pX->pLeft);
158068 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, aiMap, &iTab);
158070 pX = pExpr;
158101 if( pLoop->aLTerm[i]->pExpr==pX ){
159045 Expr *pX; /* The expression that defines the start bound */
159064 pX = pStart->pExpr;
159065 assert( pX!=0 );
159067 if( sqlite3ExprIsVector(pX->pRight) ){
159069 codeExprOrVector(pParse, pX->pRight, r1, 1);
159070 testcase( pX->op==TK_GT );
159071 testcase( pX->op==TK_GE );
159072 testcase( pX->op==TK_LT );
159073 testcase( pX->op==TK_LE );
159074 op = aMoveOp[((pX->op - TK_GT - 1) & 0x3) | 0x1];
159075 assert( pX->op!=TK_GT || op==OP_SeekGE );
159076 assert( pX->op!=TK_GE || op==OP_SeekGE );
159077 assert( pX->op!=TK_LT || op==OP_SeekLE );
159078 assert( pX->op!=TK_LE || op==OP_SeekLE );
159080 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
159082 op = aMoveOp[(pX->op - TK_GT)];
159086 VdbeCoverageIf(v, pX->op==TK_GT);
159087 VdbeCoverageIf(v, pX->op==TK_LE);
159088 VdbeCoverageIf(v, pX->op==TK_LT);
159089 VdbeCoverageIf(v, pX->op==TK_GE);
159097 Expr *pX;
159098 pX = pEnd->pExpr;
159099 assert( pX!=0 );
159104 codeExprOrVector(pParse, pX->pRight, memEndValue, 1);
159105 if( 0==sqlite3ExprIsVector(pX->pRight)
159106 && (pX->op==TK_LT || pX->op==TK_GT)
159112 if( 0==sqlite3ExprIsVector(pX->pRight) ){
162436 Expr *pX = pTerm->pExpr;
162441 if( sqlite3ExprIsVector(pX->pLeft) ){
162445 inexpr.pLeft = pX->pLeft->x.pList->a[iField].pExpr;
162446 assert( ExprUseXSelect(pX) );
162447 inexpr.pRight = pX->x.pSelect->pEList->a[iField].pExpr;
162448 pX = &inexpr;
162451 if( sqlite3IndexAffinityOk(pX, idxaff) ){
162452 CollSeq *pRet = sqlite3ExprCompareCollSeq(pParse, pX);
162466 Expr *pX; /* An expression being tested */
162490 && (pX = whereRightSubexprIsColumn(pTerm->pExpr))!=0
162494 if( pScan->aiCur[j]==pX->iTable
162495 && pScan->aiColumn[j]==pX->iColumn ){
162500 pScan->aiCur[j] = pX->iTable;
162501 pScan->aiColumn[j] = pX->iColumn;
162510 pX = pTerm->pExpr;
162517 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
162520 assert(pX->pLeft);
162521 pColl = sqlite3ExprCompareCollSeq(pParse, pX);
162530 && (pX = pTerm->pExpr->pRight, ALWAYS(pX!=0))
162531 && pX->op==TK_COLUMN
162532 && pX->iTable==pScan->aiCur[0]
162533 && pX->iColumn==pScan->aiColumn[0]
163180 Expr *pX = pTerm->pExpr;
163183 pColl = sqlite3ExprCompareCollSeq(pParse, pX);
163187 if( ALWAYS(pX->pLeft!=0)
163188 && sqlite3ExprAffinity(pX->pLeft)!=SQLITE_AFF_TEXT
164627 const WhereLoop *pX, /* First WhereLoop to compare */
164631 if( pX->rRun>pY->rRun && pX->nOut>pY->nOut ) return 0; /* (1d) and (2a) */
164632 assert( (pX->wsFlags & WHERE_VIRTUALTABLE)==0 );
164634 if( pX->u.btree.nEq < pY->u.btree.nEq /* (1b) */
164635 && pX->u.btree.pIndex==pY->u.btree.pIndex /* (1a) */
164636 && pX->nSkip==0 && pY->nSkip==0 /* (1c) */
164640 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){
164643 if( pY->nSkip > pX->nSkip ) return 0; /* (2d) */
164644 for(i=pX->nLTerm-1; i>=0; i--){
164645 if( pX->aLTerm[i]==0 ) continue;
164647 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
164651 if( (pX->wsFlags&WHERE_IDX_ONLY)!=0
164943 WhereTerm *pTerm, *pX;
164955 pX = pLoop->aLTerm[j];
164956 if( pX==0 ) continue;
164957 if( pX==pTerm ) break;
164958 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
166420 Expr *pX = pHidden->pWC->a[iTerm].pExpr;
166421 if( pX->pLeft ){
166422 pC = sqlite3ExprCompareCollSeq(pHidden->pParse, pX);
167083 Expr *pX = pLoop->aLTerm[j]->pExpr;
167085 if( pLoop->aLTerm[i]->pExpr==pX ){
167357 WhereLoop **pX; /* Used to divy up the pSpace memory */
167391 pX = (WhereLoop**)(aFrom+mxChoice);
167392 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
167393 pFrom->aLoop = pX;
167402 aSortCost = (LogEst*)pX;
167406 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );
168542 Expr *pX; /* The expression of pT */
168544 pX = pT->pExpr;
168545 assert( pX!=0 );
168546 assert( pT->prereqAll!=0 || !ExprHasProperty(pX, EP_OuterON) );
168548 && (nTabList==0 || exprIsDeterministic(pX)) /* Condition (4) */
168549 && !(ExprHasProperty(pX, EP_InnerON) /* Condition (3) */
168552 sqlite3ExprIfFalse(pParse, pX, pWInfo->iBreak, SQLITE_JUMPIFNULL);
186550 const unsigned char *pX = (const unsigned char*)pEnd;
186554 u64 c = p<pX ? *p : 0;
246699 PrefixMerger *pX = &aMerger[i];
246700 if( pX->iter.aPoslist && pX->iter.iRowid==iLastRowid ){
246701 fts5DoclistIterNext(&pX->iter);
246702 fts5PrefixMergerInsertByRowid(&pHead, pX);