Lines Matching refs:pX
24652 struct tm *pX; in osLocaltime() local
24657 pX = localtime(t); in osLocaltime()
24663 pX = pTm; in osLocaltime()
24665 pX = 0; in osLocaltime()
24669 if( pX ) *pTm = *pX; in osLocaltime()
24673 rc = pX==0; in osLocaltime()
28916 static int debugMutexHeld(sqlite3_mutex *pX){ in debugMutexHeld() argument
28917 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexHeld()
28920 static int debugMutexNotheld(sqlite3_mutex *pX){ in debugMutexNotheld() argument
28921 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexNotheld()
28967 static void debugMutexFree(sqlite3_mutex *pX){ in debugMutexFree() argument
28968 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexFree()
28990 static void debugMutexEnter(sqlite3_mutex *pX){ in debugMutexEnter() argument
28991 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexEnter()
28992 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexEnter()
28995 static int debugMutexTry(sqlite3_mutex *pX){ in debugMutexTry() argument
28996 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexTry()
28997 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexTry()
29008 static void debugMutexLeave(sqlite3_mutex *pX){ in debugMutexLeave() argument
29009 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexLeave()
29010 assert( debugMutexHeld(pX) ); in debugMutexLeave()
29012 assert( p->id==SQLITE_MUTEX_RECURSIVE || debugMutexNotheld(pX) ); in debugMutexLeave()
32581 Window *pX; in sqlite3TreeViewSelect() local
32584 for(pX=p->pWin; pX; pX=pX->pNextWin){ in sqlite3TreeViewSelect()
32585 sqlite3TreeViewWinFunc(pView, pX, pX->pNextWin!=0); in sqlite3TreeViewSelect()
32611 Window *pX; in sqlite3TreeViewSelect() local
32613 for(pX=p->pWinDefn; pX; pX=pX->pNextWin){ in sqlite3TreeViewSelect()
32614 sqlite3TreeViewWindow(pView, pX, pX->pNextWin!=0); in sqlite3TreeViewSelect()
33057 const Expr *pX, *pY, *pZ; in sqlite3TreeViewExpr() local
33058 pX = pExpr->pLeft; in sqlite3TreeViewExpr()
33064 sqlite3TreeViewExpr(pView, pX, 1); in sqlite3TreeViewExpr()
42992 unixShm *pX;
42996 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
42999 if( pX->exclMask & (1<<i) ){
43002 }else if( pX->sharedMask & (1<<i) ){
50379 winShm *pX; /* For looping over all siblings */
50403 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
50404 if( pX==p ) continue;
50405 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
50406 allMask |= pX->sharedMask;
50428 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
50429 if( (pX->exclMask & mask)!=0 ){
50433 allShared |= pX->sharedMask;
50453 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
50454 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
55118 PgHdr1 *pX = (PgHdr1*)&zBulk[pCache->szPage];
55119 pX->page.pBuf = zBulk;
55120 pX->page.pExtra = &pX[1];
55121 pX->isBulkLocal = 1;
55122 pX->isAnchor = 0;
55123 pX->pNext = pCache->pFree;
55124 pX->pLruPrev = 0; /* Initializing this saves a valgrind error */
55125 pCache->pFree = pX;
74786 BtCursor *pX; /* Looping over other all cursors */
74827 for(pX=pBt->pCursor; pX; pX=pX->pNext){
74828 if( pX->pgnoRoot==iTable ){
74829 pX->curFlags |= BTCF_Multiple;
77097 const BtreePayload *pX, /* Payload with which to construct the cell */
77121 nPayload = pX->nData + pX->nZero;
77122 pSrc = pX->pData;
77123 nSrc = pX->nData;
77126 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
77128 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
77129 nSrc = nPayload = (int)pX->nKey;
77130 pSrc = pX->pKey;
77183 assert( info.nKey==pX->nKey );
79268 const BtreePayload *pX, /* Source of data to write */
79272 int nData = pX->nData - iOffset;
79286 int rc = btreeOverwriteContent(pPage, pDest+nData, pX, iOffset+nData,
79291 if( memcmp(pDest, ((u8*)pX->pData) + iOffset, iAmt)!=0 ){
79298 memmove(pDest, ((u8*)pX->pData) + iOffset, iAmt);
79311 const BtreePayload *pX /* Content to write into the cell */
79314 int nTotal = pX->nData + pX->nZero; /* Total bytes of to write */
79324 rc = btreeOverwriteContent(pPage, pCur->info.pPayload, pX,
79346 rc = btreeOverwriteContent(pPage, pPage->aData+4, pX,
79360 static int btreeOverwriteCell(BtCursor *pCur, const BtreePayload *pX){
79361 int nTotal = pX->nData + pX->nZero; /* Total bytes of to write */
79371 return btreeOverwriteContent(pPage, pCur->info.pPayload, pX,
79375 return btreeOverwriteOverflowCell(pCur, pX);
79412 const BtreePayload *pX, /* Content of the row to be inserted */
79473 assert( (flags & BTREE_PREFORMAT) || (pX->pKey==0)==(pCur->pKeyInfo==0) );
79476 assert( pX->pKey==0 );
79480 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
79489 assert( pX->nKey==pCur->info.nKey );
79498 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
79501 assert( pX->nData>=0 && pX->nZero>=0 );
79503 && pCur->info.nPayload==(u32)pX->nData+pX->nZero
79506 return btreeOverwriteCell(pCur, pX);
79514 rc = sqlite3BtreeTableMoveto(pCur, pX->nKey,
79532 if( pX->nMem ){
79535 r.aMem = pX->aMem;
79536 r.nField = pX->nMem;
79541 rc = btreeMoveto(pCur, pX->pKey, pX->nKey,
79553 if( pCur->info.nKey==pX->nKey ){
79555 x2.pData = pX->pKey;
79556 x2.nData = pX->nKey;
79566 assert( pPage->intKey || pX->nKey>=0 || (flags & BTREE_PREFORMAT) );
79579 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
79599 rc = fillInCell(pPage, newCell, pX, &szNew);
79693 pCur->pKey = sqlite3Malloc( pX->nKey );
79697 memcpy(pCur->pKey, pX->pKey, pX->nKey);
79701 pCur->nKey = pX->nKey;
83383 Mem *pX;
83384 for(i=1, pX=pVdbe->aMem+1; i<pVdbe->nMem; i++, pX++){
83385 if( pX->pScopyFrom==pMem ){
83389 (int)(pX - pVdbe->aMem), (int)(pMem - pVdbe->aMem));
83397 mFlags = pMem->flags & pX->flags & pX->mScopyFlags;
83398 assert( (mFlags&(MEM_Int|MEM_IntReal))==0 || pMem->u.i==pX->u.i );
83402 pX->flags = MEM_Undefined;
83403 pX->pScopyFrom = 0;
85391 VdbeOp *pX = &v->aOp[j];
85392 if( pX->opcode==OP_Return ){
85393 if( pX->p1==iRetReg ) break;
85396 if( pX->opcode==OP_Noop ) continue;
85397 if( pX->opcode==OP_Explain ) continue;
96884 Btree *pX;
96919 pX = pDb->pBt;
96920 assert( pX!=0 );
96966 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->uc.pCursor);
101088 Mem *pX;
101107 pX = &aMem[pOp->p3];
101109 assert( memIsValid(pX) );
101110 memAboutToChange(p, pX);
101111 apArg[i] = pX;
101112 pX++;
111226 static Select *isCandidateForInOpt(const Expr *pX){
111232 if( !ExprUseXSelect(pX) ) return 0; /* Not a subquery */
111233 if( ExprHasProperty(pX, EP_VarSelect) ) return 0; /* Correlated subq */
111234 p = pX->x.pSelect;
111386 Expr *pX, /* The IN expression */
111398 assert( pX->op==TK_IN );
111407 if( prRhsHasNull && ExprUseXSelect(pX) ){
111409 ExprList *pEList = pX->x.pSelect->pEList;
111421 if( pParse->nErr==0 && (p = isCandidateForInOpt(pX))!=0 ){
111460 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
111503 Expr *pLhs = sqlite3VectorFieldSubexpr(pX->pLeft, i);
111562 && ExprUseXList(pX)
111563 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2)
111582 assert( pX->op==TK_IN );
111583 sqlite3CodeRhsOfIN(pParse, pX, iTab);
111592 n = sqlite3ExprVectorSize(pX->pLeft);
113514 Expr *pX; /* The X expression */
113525 if( (pX = pExpr->pLeft)!=0 ){
113526 pDel = sqlite3ExprDup(db, pX, 0);
113531 testcase( pX->op==TK_COLUMN );
113545 if( pX ){
113719 Expr *pX = sqlite3ExprSkipCollateAndLikely(pExpr);
113720 testcase( pX!=pExpr );
113721 if( ALWAYS(pX)
113722 && (ExprHasProperty(pX,EP_Subquery) || pX->op==TK_REGISTER)
119010 Index *pX;
119013 for(pX=pTab->pIndex; pX; pX=pX->pNext){
119015 if( !HasRowid(pTab) && IsPrimaryKeyIndex(pX) ){
119016 nColX = pX->nKeyCol;
119018 nColX = pX->nColumn;
123364 Expr *pX = sqlite3ColumnExpr(p, &p->aCol[ii]);
123367 if( sqlite3ResolveSelfReference(pParse, p, NC_GenCol, pX, 0) ){
133348 Expr *pX = pList->a[k].pExpr;
133349 int y = sqlite3ExprCodeTarget(pParse, pX, iRegStore);
133352 ExprHasProperty(pX, EP_Subquery) ? OP_Copy : OP_SCopy, y, iRegStore);
144006 struct ExprList_item *pX = &pEList->a[i];
144010 if( (zName = pX->zEName)!=0 && pX->fg.eEName==ENAME_NAME ){
144013 Expr *pColExpr = sqlite3ExprSkipCollateAndLikely(pX->pExpr);
144032 assert( zName==pX->zEName ); /* pointer comparison intended */
144062 if( pX->fg.bNoExpand ){
144066 if( zName && sqlite3HashInsert(&ht, zName, pX)==pX ){
146983 Select *pX;
146984 for(pX=pSubq; pX; pX=pX->pPrior){
146985 assert( (pX->selFlags & (SF_Recursive))==0 );
147073 Select *pX; /* For looping over compound elements of pSub */
147088 for(pX=pSub; pX; pX=pX->pPrior){
147089 if( (pX->selFlags & (SF_Distinct|SF_Aggregate))!=0 ){
147090 testcase( pX->selFlags & SF_Distinct );
147091 testcase( pX->selFlags & SF_Aggregate );
147094 if( pX->pPrior && pX->op!=TK_ALL ){
147100 if( pX->pWin ){
147122 for(pX=pSub; pX; pX=pX->pPrior) {
147123 Expr *pY = pX->pEList->a[j].pExpr;
147127 pX->selFlags |= SF_PushDown;
147290 Select *pX;
147299 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){}
147300 if( pX==0 ) return WRC_Continue;
147950 struct ExprList_item *pX = &pNew->a[pNew->nExpr-1];
147951 assert( pX->zEName==0 );
147952 pX->zEName = sqlite3MPrintf(db,"..%s", zUName);
147953 pX->fg.eEName = ENAME_TAB;
147954 pX->fg.bUsingTerm = 1;
147964 struct ExprList_item *pX; /* Newly added ExprList term */
148040 pX = &pNew->a[pNew->nExpr-1];
148041 assert( pX->zEName==0 );
148044 pX->zEName = sqlite3DbStrDup(db, pNestedFrom->a[j].zEName);
148045 testcase( pX->zEName==0 );
148047 pX->zEName = sqlite3MPrintf(db, "%s.%s.%s",
148049 testcase( pX->zEName==0 );
148051 pX->fg.eEName = (j==pTab->nCol ? ENAME_ROWID : ENAME_TAB);
148057 pX->fg.bNoExpand = 1;
148060 pX->zEName = sqlite3MPrintf(db, "%s.%s", zTabName, zName);
148061 pX->fg.eEName = ENAME_NAME;
148063 pX->zEName = sqlite3DbStrDup(db, zName);
148064 pX->fg.eEName = ENAME_NAME;
150643 Trigger *pX;
150645 for(pX=pList; pX; pX=pX->pNext){
150646 printf(" %s", pX->zName);
156652 Expr *pX /* The IN expression to be reduced */
156657 pNew = sqlite3ExprDup(db, pX, 0);
156674 if( pLoop->aLTerm[i]->pExpr==pX ){
156719 sqlite3TreeViewExpr(0, pX, 0);
156752 Expr *pX = pTerm->pExpr;
156758 if( pX->op==TK_EQ || pX->op==TK_IS ){
156759 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
156760 }else if( pX->op==TK_ISNULL ){
156781 assert( pX->op==TK_IN );
156785 if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){
156792 if( pLoop->aLTerm[i]->pExpr==pX ) nEq++;
156796 if( !ExprUseXSelect(pX) || pX->x.pSelect->pEList->nExpr==1 ){
156797 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, 0, &iTab);
156802 pX = removeUnindexableInClauseTerms(pParse, iEq, pLoop, pX);
156805 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, aiMap,&iTab);
156808 sqlite3ExprDelete(db, pX);
156810 int n = sqlite3ExprVectorSize(pX->pLeft);
156812 eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, aiMap, &iTab);
156814 pX = pExpr;
156845 if( pLoop->aLTerm[i]->pExpr==pX ){
157768 Expr *pX; /* The expression that defines the start bound */
157787 pX = pStart->pExpr;
157788 assert( pX!=0 );
157790 if( sqlite3ExprIsVector(pX->pRight) ){
157792 codeExprOrVector(pParse, pX->pRight, r1, 1);
157793 testcase( pX->op==TK_GT );
157794 testcase( pX->op==TK_GE );
157795 testcase( pX->op==TK_LT );
157796 testcase( pX->op==TK_LE );
157797 op = aMoveOp[((pX->op - TK_GT - 1) & 0x3) | 0x1];
157798 assert( pX->op!=TK_GT || op==OP_SeekGE );
157799 assert( pX->op!=TK_GE || op==OP_SeekGE );
157800 assert( pX->op!=TK_LT || op==OP_SeekLE );
157801 assert( pX->op!=TK_LE || op==OP_SeekLE );
157803 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
157805 op = aMoveOp[(pX->op - TK_GT)];
157809 VdbeCoverageIf(v, pX->op==TK_GT);
157810 VdbeCoverageIf(v, pX->op==TK_LE);
157811 VdbeCoverageIf(v, pX->op==TK_LT);
157812 VdbeCoverageIf(v, pX->op==TK_GE);
157820 Expr *pX;
157821 pX = pEnd->pExpr;
157822 assert( pX!=0 );
157827 codeExprOrVector(pParse, pX->pRight, memEndValue, 1);
157828 if( 0==sqlite3ExprIsVector(pX->pRight)
157829 && (pX->op==TK_LT || pX->op==TK_GT)
157835 if( 0==sqlite3ExprIsVector(pX->pRight) ){
161133 Expr *pX; /* An expression being tested */
161157 && (pX = whereRightSubexprIsColumn(pTerm->pExpr))!=0
161161 if( pScan->aiCur[j]==pX->iTable
161162 && pScan->aiColumn[j]==pX->iColumn ){
161167 pScan->aiCur[j] = pX->iTable;
161168 pScan->aiColumn[j] = pX->iColumn;
161177 pX = pTerm->pExpr;
161178 if( !sqlite3IndexAffinityOk(pX, pScan->idxaff) ){
161181 assert(pX->pLeft);
161182 pColl = sqlite3ExprCompareCollSeq(pParse, pX);
161189 && (pX = pTerm->pExpr->pRight, ALWAYS(pX!=0))
161190 && pX->op==TK_COLUMN
161191 && pX->iTable==pScan->aiCur[0]
161192 && pX->iColumn==pScan->aiColumn[0]
161831 Expr *pX = pTerm->pExpr;
161834 pColl = sqlite3ExprCompareCollSeq(pParse, pX);
161838 if( ALWAYS(pX->pLeft!=0)
161839 && sqlite3ExprAffinity(pX->pLeft)!=SQLITE_AFF_TEXT
163278 const WhereLoop *pX, /* First WhereLoop to compare */
163282 if( pX->rRun>pY->rRun && pX->nOut>pY->nOut ) return 0; /* (1d) and (2a) */
163283 assert( (pX->wsFlags & WHERE_VIRTUALTABLE)==0 );
163285 if( pX->u.btree.nEq < pY->u.btree.nEq /* (1b) */
163286 && pX->u.btree.pIndex==pY->u.btree.pIndex /* (1a) */
163287 && pX->nSkip==0 && pY->nSkip==0 /* (1c) */
163291 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){
163294 if( pY->nSkip > pX->nSkip ) return 0; /* (2d) */
163295 for(i=pX->nLTerm-1; i>=0; i--){
163296 if( pX->aLTerm[i]==0 ) continue;
163298 if( pY->aLTerm[j]==pX->aLTerm[i] ) break;
163302 if( (pX->wsFlags&WHERE_IDX_ONLY)!=0
163594 WhereTerm *pTerm, *pX;
163606 pX = pLoop->aLTerm[j];
163607 if( pX==0 ) continue;
163608 if( pX==pTerm ) break;
163609 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break;
165032 Expr *pX = pHidden->pWC->a[iTerm].pExpr;
165033 if( pX->pLeft ){
165034 pC = sqlite3ExprCompareCollSeq(pHidden->pParse, pX);
165695 Expr *pX = pLoop->aLTerm[j]->pExpr;
165697 if( pLoop->aLTerm[i]->pExpr==pX ){
165969 WhereLoop **pX; /* Used to divy up the pSpace memory */
166003 pX = (WhereLoop**)(aFrom+mxChoice);
166004 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
166005 pFrom->aLoop = pX;
166014 aSortCost = (LogEst*)pX;
166018 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );
167032 Expr *pX; /* The expression of pT */
167034 pX = pT->pExpr;
167035 assert( pX!=0 );
167036 assert( pT->prereqAll!=0 || !ExprHasProperty(pX, EP_OuterON) );
167038 && (nTabList==0 || exprIsDeterministic(pX)) /* Condition (4) */
167039 && !(ExprHasProperty(pX, EP_InnerON) /* Condition (3) */
167042 sqlite3ExprIfFalse(pParse, pX, pWInfo->iBreak, SQLITE_JUMPIFNULL);
184934 const unsigned char *pX = (const unsigned char*)pEnd;
184938 u64 c = p<pX ? *p : 0;
244766 PrefixMerger *pX = &aMerger[i];
244767 if( pX->iter.aPoslist && pX->iter.iRowid==iLastRowid ){
244768 fts5DoclistIterNext(&pX->iter);
244769 fts5PrefixMergerInsertByRowid(&pHead, pX);