Home
last modified time | relevance | path

Searched refs:pX (Results 1 – 25 of 28) sorted by relevance

12

/sqlite-3.40.0/src/
H A Dmutex_noop.c89 static int debugMutexHeld(sqlite3_mutex *pX){ in debugMutexHeld() argument
90 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexHeld()
93 static int debugMutexNotheld(sqlite3_mutex *pX){ in debugMutexNotheld() argument
94 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexNotheld()
140 static void debugMutexFree(sqlite3_mutex *pX){ in debugMutexFree() argument
141 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexFree()
163 static void debugMutexEnter(sqlite3_mutex *pX){ in debugMutexEnter() argument
164 sqlite3_debug_mutex *p = (sqlite3_debug_mutex*)pX; in debugMutexEnter()
168 static int debugMutexTry(sqlite3_mutex *pX){ in debugMutexTry() argument
181 static void debugMutexLeave(sqlite3_mutex *pX){ in debugMutexLeave() argument
[all …]
H A Dwherecode.c567 Expr *pX = pTerm->pExpr; in codeEqualityTerm() local
573 if( pX->op==TK_EQ || pX->op==TK_IS ){ in codeEqualityTerm()
611 if( !ExprUseXSelect(pX) || pX->x.pSelect->pEList->nExpr==1 ){ in codeEqualityTerm()
617 pX = removeUnindexableInClauseTerms(pParse, iEq, pLoop, pX); in codeEqualityTerm()
629 pX = pExpr; in codeEqualityTerm()
1602 pX = pStart->pExpr; in sqlite3WhereCodeOneLoopStart()
1603 assert( pX!=0 ); in sqlite3WhereCodeOneLoopStart()
1635 Expr *pX; in sqlite3WhereCodeOneLoopStart() local
1636 pX = pEnd->pExpr; in sqlite3WhereCodeOneLoopStart()
1637 assert( pX!=0 ); in sqlite3WhereCodeOneLoopStart()
[all …]
H A Dtreeview.c295 Window *pX; in sqlite3TreeViewSelect() local
298 for(pX=p->pWin; pX; pX=pX->pNextWin){ in sqlite3TreeViewSelect()
299 sqlite3TreeViewWinFunc(pView, pX, pX->pNextWin!=0); in sqlite3TreeViewSelect()
325 Window *pX; in sqlite3TreeViewSelect() local
327 for(pX=p->pWinDefn; pX; pX=pX->pNextWin){ in sqlite3TreeViewSelect()
328 sqlite3TreeViewWindow(pView, pX, pX->pNextWin!=0); in sqlite3TreeViewSelect()
756 const Expr *pX, *pY, *pZ; in sqlite3TreeViewExpr() local
757 pX = pExpr->pLeft; in sqlite3TreeViewExpr()
763 sqlite3TreeViewExpr(pView, pX, 1); in sqlite3TreeViewExpr()
H A Dpcache1.c321 PgHdr1 *pX = (PgHdr1*)&zBulk[pCache->szPage]; in pcache1InitBulk() local
322 pX->page.pBuf = zBulk; in pcache1InitBulk()
323 pX->page.pExtra = &pX[1]; in pcache1InitBulk()
324 pX->isBulkLocal = 1; in pcache1InitBulk()
325 pX->isAnchor = 0; in pcache1InitBulk()
326 pX->pNext = pCache->pFree; in pcache1InitBulk()
327 pX->pLruPrev = 0; /* Initializing this saves a valgrind error */ in pcache1InitBulk()
328 pCache->pFree = pX; in pcache1InitBulk()
H A Dwhere.c369 && (pX = pTerm->pExpr->pRight, ALWAYS(pX!=0)) in whereScanNext()
2322 if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){ in whereLoopCheaperProperSubset()
2325 if( pX->rRun>pY->rRun && pX->nOut>pY->nOut ) return 0; in whereLoopCheaperProperSubset()
2626 WhereTerm *pTerm, *pX; in whereLoopOutputAdjust() local
2638 pX = pLoop->aLTerm[j]; in whereLoopOutputAdjust()
2639 if( pX==0 ) continue; in whereLoopOutputAdjust()
2640 if( pX==pTerm ) break; in whereLoopOutputAdjust()
2641 if( pX->iParent>=0 && (&pWC->a[pX->iParent])==pTerm ) break; in whereLoopOutputAdjust()
3871 if( pX->pLeft ){ in sqlite3_vtab_collation()
4830 pFrom->aLoop = pX; in wherePathSolver()
[all …]
H A Ddate.c518 struct tm *pX; in osLocaltime() local
523 pX = localtime(t); in osLocaltime()
529 pX = pTm; in osLocaltime()
531 pX = 0; in osLocaltime()
535 if( pX ) *pTm = *pX; in osLocaltime()
539 rc = pX==0; in osLocaltime()
H A Dbtree.c4570 for(pX=pBt->pCursor; pX; pX=pX->pNext){ in btreeCursor()
6826 nPayload = pX->nData + pX->nZero; in fillInCell()
6827 pSrc = pX->pData; in fillInCell()
6833 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 ); in fillInCell()
6835 pSrc = pX->pKey; in fillInCell()
8911 int nTotal = pX->nData + pX->nZero; /* Total bytes of to write */ in btreeOverwriteCell()
9080 assert( pX->nData>=0 && pX->nZero>=0 ); in sqlite3BtreeInsert()
9082 && pCur->info.nPayload==(u32)pX->nData+pX->nZero in sqlite3BtreeInsert()
9120 rc = btreeMoveto(pCur, pX->pKey, pX->nKey, in sqlite3BtreeInsert()
9158 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno, in sqlite3BtreeInsert()
[all …]
H A Dselect.c2199 if( (zName = pX->zEName)!=0 && pX->fg.eEName==ENAME_NAME ){ in sqlite3ColumnsFromExprList()
2248 if( pX->fg.bNoExpand ){ in sqlite3ColumnsFromExprList()
2252 if( zName && sqlite3HashInsert(&ht, zName, pX)==pX ){ in sqlite3ColumnsFromExprList()
5075 Select *pX; in pushDownWhereTerms() local
5076 for(pX=pSubq; pX; pX=pX->pPrior){ in pushDownWhereTerms()
5293 Select *pX; in convertCompoundSelectToSubquery() local
5302 for(pX=p; pX && (pX->op==TK_ALL || pX->op==TK_SELECT); pX=pX->pPrior){} in convertCompoundSelectToSubquery()
5303 if( pX==0 ) return WRC_Continue; in convertCompoundSelectToSubquery()
5951 pX->fg.bUsingTerm = 1; in selectExpander()
6022 assert( pX->zEName==0 ); in selectExpander()
[all …]
H A Dvdbemem.c1027 Mem *pX; in sqlite3VdbeMemAboutToChange() local
1028 for(i=1, pX=pVdbe->aMem+1; i<pVdbe->nMem; i++, pX++){ in sqlite3VdbeMemAboutToChange()
1029 if( pX->pScopyFrom==pMem ){ in sqlite3VdbeMemAboutToChange()
1033 (int)(pX - pVdbe->aMem), (int)(pMem - pVdbe->aMem)); in sqlite3VdbeMemAboutToChange()
1041 mFlags = pMem->flags & pX->flags & pX->mScopyFlags; in sqlite3VdbeMemAboutToChange()
1042 assert( (mFlags&(MEM_Int|MEM_IntReal))==0 || pMem->u.i==pX->u.i ); in sqlite3VdbeMemAboutToChange()
1046 pX->flags = MEM_Undefined; in sqlite3VdbeMemAboutToChange()
1047 pX->pScopyFrom = 0; in sqlite3VdbeMemAboutToChange()
H A Dtest1.c2988 Tcl_Obj *pX; in test_collate_func() local
2991 Tcl_IncrRefCount(pX); in test_collate_func()
3023 Tcl_DecrRefCount(pX); in test_collate_func()
3259 Tcl_Obj *pX; in test_function_utf8() local
3263 Tcl_IncrRefCount(pX); in test_function_utf8()
3268 Tcl_DecrRefCount(pX); in test_function_utf8()
3283 Tcl_Obj *pX; in test_function_utf16le() local
3287 Tcl_IncrRefCount(pX); in test_function_utf16le()
3292 Tcl_DecrRefCount(pX); in test_function_utf16le()
3305 Tcl_Obj *pX; in test_function_utf16be() local
[all …]
H A Dos_win.c4079 winShm *pX; /* For looping over all siblings */ local
4103 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
4104 if( pX==p ) continue;
4105 assert( (pX->exclMask & (p->exclMask|p->sharedMask))==0 );
4106 allMask |= pX->sharedMask;
4128 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
4129 if( (pX->exclMask & mask)!=0 ){
4133 allShared |= pX->sharedMask;
4153 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){
4154 if( (pX->exclMask & mask)!=0 || (pX->sharedMask & mask)!=0 ){
H A Dtrigger.c83 Trigger *pX; in sqlite3TriggerList()
85 for(pX=pList; pX; pX=pX->pNext){ in sqlite3TriggerList()
86 printf(" %s", pX->zName); in sqlite3TriggerList()
H A Dexpr.c2590 p = pX->x.pSelect; in isCandidateForInOpt()
2754 assert( pX->op==TK_IN ); in sqlite3FindInIndex()
2919 && ExprUseXList(pX) in sqlite3FindInIndex()
2920 && (!sqlite3InRhsIsConstant(pX) || pX->x.pList->nExpr<=2) in sqlite3FindInIndex()
2939 assert( pX->op==TK_IN ); in sqlite3FindInIndex()
2940 sqlite3CodeRhsOfIN(pParse, pX, iTab); in sqlite3FindInIndex()
2949 n = sqlite3ExprVectorSize(pX->pLeft); in sqlite3FindInIndex()
4797 if( (pX = pExpr->pLeft)!=0 ){ in sqlite3ExprCodeTarget()
4798 pDel = sqlite3ExprDup(db, pX, 0); in sqlite3ExprCodeTarget()
4803 testcase( pX->op==TK_COLUMN ); in sqlite3ExprCodeTarget()
[all …]
H A Dos_unix.c4875 unixShm *pX; in assertLockingArrayOk() local
4880 for(pX=pShmNode->pFirst; pX; pX=pX->pNext){ in assertLockingArrayOk()
4883 if( pX->exclMask & (1<<i) ){ in assertLockingArrayOk()
4886 }else if( pX->sharedMask & (1<<i) ){ in assertLockingArrayOk()
H A Dvdbe.c4149 Btree *pX; in sqlite3VdbeExec() local
4184 pX = pDb->pBt; in sqlite3VdbeExec()
4185 assert( pX!=0 ); in sqlite3VdbeExec()
4231 rc = sqlite3BtreeCursor(pX, p2, wrFlag, pKeyInfo, pCur->uc.pCursor); in sqlite3VdbeExec()
8261 Mem *pX; in sqlite3VdbeExec() local
8280 pX = &aMem[pOp->p3]; in sqlite3VdbeExec()
8282 assert( memIsValid(pX) ); in sqlite3VdbeExec()
8283 memAboutToChange(p, pX); in sqlite3VdbeExec()
8284 apArg[i] = pX; in sqlite3VdbeExec()
8285 pX++; in sqlite3VdbeExec()
H A Dvdbeaux.c951 VdbeOp *pX = &v->aOp[j]; in sqlite3VdbeNoJumpsOutsideSubrtn() local
952 if( pX->opcode==OP_Return ){ in sqlite3VdbeNoJumpsOutsideSubrtn()
953 if( pX->p1==iRetReg ) break; in sqlite3VdbeNoJumpsOutsideSubrtn()
956 if( pX->opcode==OP_Noop ) continue; in sqlite3VdbeNoJumpsOutsideSubrtn()
957 if( pX->opcode==OP_Explain ) continue; in sqlite3VdbeNoJumpsOutsideSubrtn()
H A Dinsert.c1204 Expr *pX = pList->a[k].pExpr; in sqlite3Insert() local
1205 int y = sqlite3ExprCodeTarget(pParse, pX, iRegStore); in sqlite3Insert()
1208 ExprHasProperty(pX, EP_Subquery) ? OP_Copy : OP_SCopy, y, iRegStore); in sqlite3Insert()
/sqlite-3.40.0/ext/misc/
H A Dfuzzer.c409 fuzzer_rule *pX; in fuzzerLoadRules() local
414 pX->pNext = 0; in fuzzerLoadRules()
416 pX = fuzzerMergeRules(a[i], pX); in fuzzerLoadRules()
422 pX = fuzzerMergeRules(a[i], pX); in fuzzerLoadRules()
806 pBest = pX; in fuzzerLowestCostStem()
826 fuzzer_stem *pX; in fuzzerInsert() local
832 if( (pX = pCur->pStem)!=0 && pX->rCostX>pNew->rCostX ){ in fuzzerInsert()
835 pNew = pX; in fuzzerInsert()
840 pX = pNew; in fuzzerInsert()
843 pX = fuzzerMergeStems(pX, pCur->aQueue[i]); in fuzzerInsert()
[all …]
H A Damatch.c410 *amatchAvlFromPtr(pX, 0) = pX->pAfter; in amatchAvlRemove()
411 if( pX->pAfter ) pX->pAfter->pUp = pX->pUp; in amatchAvlRemove()
412 pBalance = pX->pUp; in amatchAvlRemove()
414 if( pX->pAfter ){ in amatchAvlRemove()
415 pX->pAfter->pUp = pX; in amatchAvlRemove()
418 pBalance = pX; in amatchAvlRemove()
423 *ppParent = pX; in amatchAvlRemove()
700 amatch_rule *pX; in amatchLoadRules() local
705 pX->pNext = 0; in amatchLoadRules()
707 pX = amatchMergeRules(a[i], pX); in amatchLoadRules()
[all …]
H A Dvtshim.c214 vtshim_cursor *pCur = (vtshim_cursor*)pX; in vtshimClose()
231 sqlite3_vtab_cursor *pX, in vtshimFilter() argument
237 vtshim_cursor *pCur = (vtshim_cursor*)pX; in vtshimFilter()
249 static int vtshimNext(sqlite3_vtab_cursor *pX){ in vtshimNext() argument
250 vtshim_cursor *pCur = (vtshim_cursor*)pX; in vtshimNext()
262 static int vtshimEof(sqlite3_vtab_cursor *pX){ in vtshimEof() argument
263 vtshim_cursor *pCur = (vtshim_cursor*)pX; in vtshimEof()
274 vtshim_cursor *pCur = (vtshim_cursor*)pX; in vtshimColumn()
287 vtshim_cursor *pCur = (vtshim_cursor*)pX; in vtshimRowid()
521 void sqlite3_dispose_module(void *pX){ in sqlite3_dispose_module() argument
[all …]
/sqlite-3.40.0/test/
H A Dvt02.c730 void *pX = 0; /* idxStr value */ in vt02BestIndex() local
953 pX = sqlite3_malloc(800); in vt02BestIndex()
954 if( pX==0 ) return SQLITE_NOMEM; in vt02BestIndex()
955 sqlite3_free(pX); in vt02BestIndex()
H A Dfkey7.test55 CREATE TABLE pX(x PRIMARY KEY);
56 CREATE TABLE cX(a INTEGER PRIMARY KEY, b REFERENCES pX);
/sqlite-3.40.0/ext/expert/
H A Dsqlite3expert.c1361 sqlite3_stmt *pX = 0; in idxProcessOneTrigger() local
1362 rc = sqlite3_prepare_v2(p->dbv, zWrite, -1, &pX, 0); in idxProcessOneTrigger()
1363 idxFinalize(&rc, pX); in idxProcessOneTrigger()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_index.c5176 PrefixMerger *pX = &aMerger[i]; in fts5MergePrefixLists() local
5177 if( pX->iter.aPoslist && pX->iter.iRowid==iLastRowid ){ in fts5MergePrefixLists()
5178 fts5DoclistIterNext(&pX->iter); in fts5MergePrefixLists()
5179 fts5PrefixMergerInsertByRowid(&pHead, pX); in fts5MergePrefixLists()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_sorted.c4476 Level *pX = pLevel; in sortedMergeSetup() local
4478 assert( pX->nRight==0 ); in sortedMergeSetup()
4479 pX = pX->pNext; in sortedMergeSetup()

12