Home
last modified time | relevance | path

Searched refs:pBest (Results 1 – 7 of 7) sorted by relevance

/sqlite-3.40.0/src/
H A Dcallback.c419 pBest = p; in sqlite3FindFunction()
444 pBest = p; in sqlite3FindFunction()
456 (pBest = sqlite3DbMallocZero(db, sizeof(*pBest)+nName+1))!=0 ){ in sqlite3FindFunction()
459 pBest->zName = (const char*)&pBest[1]; in sqlite3FindFunction()
460 pBest->nArg = (u16)nArg; in sqlite3FindFunction()
461 pBest->funcFlags = enc; in sqlite3FindFunction()
464 pOther = (FuncDef*)sqlite3HashInsert(&db->aFunc, pBest->zName, pBest); in sqlite3FindFunction()
465 if( pOther==pBest ){ in sqlite3FindFunction()
470 pBest->pNext = pOther; in sqlite3FindFunction()
474 if( pBest && (pBest->xSFunc || createFlag) ){ in sqlite3FindFunction()
[all …]
H A Dalter.c1035 RenameToken *pBest = pCtx->pList; in renameColumnTokenNext() local
1040 if( pToken->t.z>pBest->t.z ) pBest = pToken; in renameColumnTokenNext()
1043 *pp = pBest->pNext; in renameColumnTokenNext()
1045 return pBest; in renameColumnTokenNext()
1240 if( pBest->t.z[pBest->t.n]=='"' ) nReplace++; in renameEditSql()
1249 memcpy(zBuf1, pBest->t.z, pBest->t.n); in renameEditSql()
1250 zBuf1[pBest->t.n] = 0; in renameEditSql()
1253 pBest->t.z[pBest->t.n]=='\'' ? " " : "" in renameEditSql()
1259 iOff = pBest->t.z - zSql; in renameEditSql()
1260 if( pBest->t.n!=nReplace ){ in renameEditSql()
[all …]
H A Dfunc.c1696 Mem *pBest; in minmaxStep() local
1699 pBest = (Mem *)sqlite3_aggregate_context(context, sizeof(*pBest)); in minmaxStep()
1700 if( !pBest ) return; in minmaxStep()
1703 if( pBest->flags ) sqlite3SkipAccumulatorLoad(context); in minmaxStep()
1704 }else if( pBest->flags ){ in minmaxStep()
1717 cmp = sqlite3MemCompare(pBest, pArg, pColl); in minmaxStep()
1719 sqlite3VdbeMemCopy(pBest, pArg); in minmaxStep()
1724 pBest->db = sqlite3_context_db_handle(context); in minmaxStep()
1725 sqlite3VdbeMemCopy(pBest, pArg); in minmaxStep()
H A Danalyze.c655 StatSample *pBest = &p->aBest[i]; in samplePushPrevious() local
656 pBest->anEq[i] = p->current.anEq[i]; in samplePushPrevious()
657 if( p->nSample<p->mxSample || sampleIsBetter(p, pBest, &p->a[p->iMin]) ){ in samplePushPrevious()
658 sampleInsert(p, pBest, i); in samplePushPrevious()
H A Dselect.c7731 Index *pBest = 0; /* Best index found so far */ in sqlite3Select() local
7746 if( !HasRowid(pTab) ) pBest = sqlite3PrimaryKeyIndex(pTab); in sqlite3Select()
7752 && (!pBest || pIdx->szIdxRow<pBest->szIdxRow) in sqlite3Select()
7754 pBest = pIdx; in sqlite3Select()
7758 if( pBest ){ in sqlite3Select()
7759 iRoot = pBest->tnum; in sqlite3Select()
7760 pKeyInfo = sqlite3KeyInfoOfIndex(pParse, pBest); in sqlite3Select()
7770 explainSimpleCount(pParse, pTab, pBest); in sqlite3Select()
/sqlite-3.40.0/ext/misc/
H A Dfuzzer.c795 fuzzer_stem *pBest, *pX; in fuzzerLowestCostStem() local
801 pBest = 0; in fuzzerLowestCostStem()
805 if( pBest==0 || pBest->rCostX>pX->rCostX ){ in fuzzerLowestCostStem()
806 pBest = pX; in fuzzerLowestCostStem()
810 if( pBest ){ in fuzzerLowestCostStem()
811 pCur->aQueue[iBest] = pBest->pNext; in fuzzerLowestCostStem()
812 pBest->pNext = 0; in fuzzerLowestCostStem()
813 pCur->pStem = pBest; in fuzzerLowestCostStem()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_sorted.c4682 Level *pBest = 0; /* Best level to work on found so far */ in sortedSelectLevel() local
4701 pBest = pThis; in sortedSelectLevel()
4708 pBest = pLevel; in sortedSelectLevel()
4720 pBest = pThis; in sortedSelectLevel()
4724 if( pBest==0 && nMerge==1 ){ in sortedSelectLevel()
4736 pBest = pTopLevel; in sortedSelectLevel()
4741 if( pBest ){ in sortedSelectLevel()
4742 if( pBest->nRight==0 ){ in sortedSelectLevel()
4743 rc = sortedMergeSetup(pDb, pBest, nBest, ppOut); in sortedSelectLevel()
4745 *ppOut = pBest; in sortedSelectLevel()