Home
last modified time | relevance | path

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

/sqlite-3.40.0/src/
H A Dtest_vfstrace.c293 vfstrace_info *pInfo = p->pInfo; in vfstraceClose() local
315 vfstrace_info *pInfo = p->pInfo; in vfstraceRead() local
334 vfstrace_info *pInfo = p->pInfo; in vfstraceWrite() local
348 vfstrace_info *pInfo = p->pInfo; in vfstraceTruncate() local
362 vfstrace_info *pInfo = p->pInfo; in vfstraceSync() local
386 vfstrace_info *pInfo = p->pInfo; in vfstraceFileSize() local
414 vfstrace_info *pInfo = p->pInfo; in vfstraceLock() local
428 vfstrace_info *pInfo = p->pInfo; in vfstraceUnlock() local
442 vfstrace_info *pInfo = p->pInfo; in vfstraceCheckReservedLock() local
457 vfstrace_info *pInfo = p->pInfo; in vfstraceFileControl() local
[all …]
H A Dwal.c1395 volatile WalCkptInfo *pInfo; in walIndexRecover() local
1405 pInfo = walCkptInfo(pWal); in walIndexRecover()
1406 pInfo->nBackfill = 0; in walIndexRecover()
1408 pInfo->aReadMark[0] = 0; in walIndexRecover()
1998 pInfo->nBackfillAttempted = 0; in walRestartHdr()
1999 pInfo->aReadMark[1] = 0; in walRestartHdr()
2001 assert( pInfo->aReadMark[0]==0 ); in walRestartHdr()
2057 pInfo = walCkptInfo(pWal); in walCheckpoint()
2790 pInfo = walCkptInfo(pWal); in walTryBeginRead()
2958 for(i=pInfo->nBackfillAttempted; i>AtomicLoad(&pInfo->nBackfill); i--){ in sqlite3WalSnapshotRecover()
[all …]
H A Dfunc.c699 u32 matchOne = pInfo->matchOne; /* "?" or "_" */ in patternCompare()
718 if( pInfo->matchSet==0 ){ in patternCompare()
772 if( pInfo->matchSet==0 ){ in patternCompare()
917 if( escape==pInfo->matchAll || escape==pInfo->matchOne ){ in likeFunc()
919 pInfo = &backupInfo; in likeFunc()
920 if( escape==pInfo->matchAll ) pInfo->matchAll = 0; in likeFunc()
921 if( escape==pInfo->matchOne ) pInfo->matchOne = 0; in likeFunc()
924 escape = pInfo->matchSet; in likeFunc()
1938 struct compareInfo *pInfo; in sqlite3RegisterLikeFunctions() local
1941 pInfo = (struct compareInfo*)&likeInfoAlt; in sqlite3RegisterLikeFunctions()
[all …]
H A Dinsert.c413 AutoincInfo *pInfo; in autoIncBegin() local
429 pInfo = pToplevel->pAinc; in autoIncBegin()
430 while( pInfo && pInfo->pTab!=pTab ){ pInfo = pInfo->pNext; } in autoIncBegin()
431 if( pInfo==0 ){ in autoIncBegin()
432 pInfo = sqlite3DbMallocRawNN(pParse->db, sizeof(*pInfo)); in autoIncBegin()
433 sqlite3ParserAddCleanup(pToplevel, sqlite3DbFree, pInfo); in autoIncBegin()
436 pInfo->pNext = pToplevel->pAinc; in autoIncBegin()
437 pToplevel->pAinc = pInfo; in autoIncBegin()
438 pInfo->pTab = pTab; in autoIncBegin()
439 pInfo->iDb = iDb; in autoIncBegin()
[all …]
H A Dbtree.c1141 pInfo->nSize = (u16)(&pInfo->pPayload[pInfo->nLocal] - pCell) + 4; in btreeParseCellAdjustSizeForOverflow()
1187 pInfo->nSize = 4 + getVarint(&pCell[4], (u64*)&pInfo->nKey); in btreeParseCellPtrNoPayload()
1188 pInfo->nPayload = 0; in btreeParseCellPtrNoPayload()
1189 pInfo->nLocal = 0; in btreeParseCellPtrNoPayload()
1190 pInfo->pPayload = 0; in btreeParseCellPtrNoPayload()
1261 pInfo->pPayload = pIter; in btreeParseCellPtr()
1269 if( pInfo->nSize<4 ) pInfo->nSize = 4; in btreeParseCellPtr()
1296 pInfo->nKey = nPayload; in btreeParseCellPtrIndex()
1306 if( pInfo->nSize<4 ) pInfo->nSize = 4; in btreeParseCellPtrIndex()
6716 assert( pInfo->nLocal!=pInfo->nPayload ); in clearCellOverflow()
[all …]
H A Danalyze.c1537 analysisInfo *pInfo = (analysisInfo*)pData; local
1548 pTable = sqlite3FindTable(pInfo->db, argv[0], pInfo->zDatabase);
1557 pIndex = sqlite3FindIndex(pInfo->db, argv[1], pInfo->zDatabase);
1570 if( pIndex->aiRowEst==0 ) sqlite3OomFault(pInfo->db);
H A Dexpr.c4436 AggInfo *pInfo = pExpr->pAggInfo; in sqlite3ExprCodeTarget() local
4437 if( pInfo==0 in sqlite3ExprCodeTarget()
4439 || NEVER(pExpr->iAgg>=pInfo->nFunc) in sqlite3ExprCodeTarget()
6219 pInfo->aCol = sqlite3ArrayAllocate( in addAggInfoColumn()
6221 pInfo->aCol, in addAggInfoColumn()
6222 sizeof(pInfo->aCol[0]), in addAggInfoColumn()
6223 &pInfo->nColumn, in addAggInfoColumn()
6235 pInfo->aFunc = sqlite3ArrayAllocate( in addAggInfoFunc()
6237 pInfo->aFunc, in addAggInfoFunc()
6238 sizeof(pInfo->aFunc[0]), in addAggInfoFunc()
[all …]
H A Dselect.c650 sqlite3ExprCodeExprList(pParse, pSelect->pEList, pInfo->regResult, in innerLoopLoadRow()
651 0, pInfo->ecelFlags); in innerLoopLoadRow()
653 if( pInfo->pExtra ){ in innerLoopLoadRow()
654 sqlite3ExprCodeExprList(pParse, pInfo->pExtra, pInfo->regExtraResult, 0, 0); in innerLoopLoadRow()
655 sqlite3ExprListDelete(pParse->db, pInfo->pExtra); in innerLoopLoadRow()
1557 KeyInfo *pInfo; in sqlite3KeyInfoFromExprList() local
1563 pInfo = sqlite3KeyInfoAlloc(db, nExpr-iStart, nExtra+1); in sqlite3KeyInfoFromExprList()
1564 if( pInfo ){ in sqlite3KeyInfoFromExprList()
1565 assert( sqlite3KeyInfoIsWriteable(pInfo) ); in sqlite3KeyInfoFromExprList()
1568 pInfo->aSortFlags[i-iStart] = pItem->fg.sortFlags; in sqlite3KeyInfoFromExprList()
[all …]
H A Dwhere.c6130 KeyInfo *pInfo; in sqlite3WhereBegin() local
6132 pInfo = sqlite3KeyInfoAlloc(pParse->db, 1, 0); in sqlite3WhereBegin()
6133 if( pInfo ){ in sqlite3WhereBegin()
6134 pInfo->aColl[0] = 0; in sqlite3WhereBegin()
6135 pInfo->aSortFlags[0] = 0; in sqlite3WhereBegin()
6136 sqlite3VdbeAppendP4(v, pInfo, P4_KEYINFO); in sqlite3WhereBegin()
/sqlite-3.40.0/test/
H A Dvt02.c700 if( pInfo->idxStr ){ in sqlite3BestIndexLog()
710 if( pInfo->nOrderBy ){ in sqlite3BestIndexLog()
804 pInfo->idxNum = 1; in vt02BestIndex()
807 pInfo->idxNum = 0; in vt02BestIndex()
819 pInfo->idxNum = i; in vt02BestIndex()
826 pInfo->idxNum += 4; in vt02BestIndex()
830 pInfo->estimatedRows = (sqlite3_int64)pInfo->estimatedCost; in vt02BestIndex()
838 if( pInfo->idxNum==1 ){ in vt02BestIndex()
901 pInfo->idxNum += 1000; in vt02BestIndex()
907 && (pInfo->nOrderBy==0 || pInfo->orderByConsumed) in vt02BestIndex()
[all …]
/sqlite-3.40.0/ext/rtree/
H A Dtest_rtreedoc.c205 BoxQueryCtx *pCtx = (BoxQueryCtx*)pInfo->pContext; in box_query()
221 for(ii=0; ii<pInfo->nParam; ii++){ in box_query()
222 Tcl_Obj *p = Tcl_NewDoubleObj(pInfo->aParam[ii]); in box_query()
232 for(ii=0; ii<pInfo->nCoord; ii++){ in box_query()
233 Tcl_Obj *p = Tcl_NewDoubleObj(pInfo->aCoord[ii]); in box_query()
243 for(ii=0; ii<=pInfo->mxLevel; ii++){ in box_query()
268 assert( pInfo->eParentWithin==0 in box_query()
269 || pInfo->eParentWithin==1 in box_query()
270 || pInfo->eParentWithin==2 in box_query()
294 pInfo->rScore = rScore; in box_query()
[all …]
H A Drtree.c1100 sqlite3_rtree_query_info *pInfo = pCsr->aConstraint[i].pInfo; in resetCursor() local
1101 if( pInfo ){ in resetCursor()
1102 if( pInfo->xDelUser ) pInfo->xDelUser(pInfo->pUser); in resetCursor()
1202 sqlite3_rtree_query_info *pInfo = pConstraint->pInfo; /* Callback info */ in rtreeCallbackConstraint() local
1252 pInfo->aCoord = aCoord; in rtreeCallbackConstraint()
1254 pInfo->rScore = pInfo->rParentScore = pSearch->rScore; in rtreeCallbackConstraint()
1255 pInfo->eWithin = pInfo->eParentWithin = pSearch->eWithin; in rtreeCallbackConstraint()
1257 if( pInfo->eWithin<*peWithin ) *peWithin = pInfo->eWithin; in rtreeCallbackConstraint()
1811 memset(pInfo, 0, sizeof(*pInfo)); in deserializeGeometry()
1825 pCons->pInfo = pInfo; in deserializeGeometry()
[all …]
/sqlite-3.40.0/ext/fts3/
H A Dfts3_aux.c151 sqlite3_index_info *pInfo in fts3auxBestIndexMethod() argument
163 if( pInfo->nOrderBy==1 in fts3auxBestIndexMethod()
164 && pInfo->aOrderBy[0].iColumn==0 in fts3auxBestIndexMethod()
165 && pInfo->aOrderBy[0].desc==0 in fts3auxBestIndexMethod()
167 pInfo->orderByConsumed = 1; in fts3auxBestIndexMethod()
193 pInfo->estimatedCost = 5; in fts3auxBestIndexMethod()
195 pInfo->idxNum = 0; in fts3auxBestIndexMethod()
196 pInfo->estimatedCost = 20000; in fts3auxBestIndexMethod()
200 pInfo->estimatedCost /= 2; in fts3auxBestIndexMethod()
205 pInfo->estimatedCost /= 2; in fts3auxBestIndexMethod()
[all …]
H A Dfts3_snippet.c1019 nVal = pInfo->nCol; in fts3MatchinfoSize()
1023 nVal = pInfo->nCol * pInfo->nPhrase; in fts3MatchinfoSize()
1027 nVal = pInfo->nPhrase * ((pInfo->nCol + 31) / 32); in fts3MatchinfoSize()
1032 nVal = pInfo->nCol * pInfo->nPhrase * 3; in fts3MatchinfoSize()
1156 for(i=0; i<pInfo->nPhrase; i++){ in fts3MatchinfoLcs()
1166 for(i=0; i<pInfo->nPhrase; i++){ in fts3MatchinfoLcs()
1205 pInfo->aMatchinfo[iCol] = nLcs; in fts3MatchinfoLcs()
1242 pInfo->flag = zArg[i]; in fts3MatchinfoValues()
1245 if( bGlobal ) pInfo->aMatchinfo[0] = pInfo->nPhrase; in fts3MatchinfoValues()
1249 if( bGlobal ) pInfo->aMatchinfo[0] = pInfo->nCol; in fts3MatchinfoValues()
[all …]
H A Dfts3_tokenize_vtab.c236 sqlite3_index_info *pInfo in fts3tokBestIndexMethod() argument
241 for(i=0; i<pInfo->nConstraint; i++){ in fts3tokBestIndexMethod()
242 if( pInfo->aConstraint[i].usable in fts3tokBestIndexMethod()
243 && pInfo->aConstraint[i].iColumn==0 in fts3tokBestIndexMethod()
244 && pInfo->aConstraint[i].op==SQLITE_INDEX_CONSTRAINT_EQ in fts3tokBestIndexMethod()
246 pInfo->idxNum = 1; in fts3tokBestIndexMethod()
247 pInfo->aConstraintUsage[i].argvIndex = 1; in fts3tokBestIndexMethod()
248 pInfo->aConstraintUsage[i].omit = 1; in fts3tokBestIndexMethod()
249 pInfo->estimatedCost = 1; in fts3tokBestIndexMethod()
254 pInfo->idxNum = 0; in fts3tokBestIndexMethod()
[all …]
H A Dfts3_term.c146 sqlite3_index_info *pInfo in fts3termBestIndexMethod() argument
151 if( pInfo->nOrderBy ){ in fts3termBestIndexMethod()
153 for(i=0; i<pInfo->nOrderBy; i++){ in fts3termBestIndexMethod()
154 if( pInfo->aOrderBy[i].iColumn!=i || pInfo->aOrderBy[i].desc ) break; in fts3termBestIndexMethod()
156 if( i==pInfo->nOrderBy ){ in fts3termBestIndexMethod()
157 pInfo->orderByConsumed = 1; in fts3termBestIndexMethod()
H A Dfts3.c1630 pInfo->estimatedCost = 5000000; in fts3BestIndexMethod()
1631 for(i=0; i<pInfo->nConstraint; i++){ in fts3BestIndexMethod()
1642 pInfo->estimatedCost = 1e50; in fts3BestIndexMethod()
1654 pInfo->estimatedCost = 1.0; in fts3BestIndexMethod()
1671 pInfo->estimatedCost = 2.0; in fts3BestIndexMethod()
1698 if( pInfo->idxNum==FTS3_DOCID_SEARCH ) fts3SetUniqueFlag(pInfo); in fts3BestIndexMethod()
1706 pInfo->idxNum |= FTS3_HAVE_LANGID; in fts3BestIndexMethod()
1721 if( pInfo->nOrderBy==1 ){ in fts3BestIndexMethod()
1725 pInfo->idxStr = "DESC"; in fts3BestIndexMethod()
1727 pInfo->idxStr = "ASC"; in fts3BestIndexMethod()
[all …]
/sqlite-3.40.0/ext/repair/
H A Dcheckindex.c150 for(i=0; i<pInfo->nConstraint; i++){ in cidxBestIndex()
164 pInfo->estimatedCost = 1000000000.0; in cidxBestIndex()
167 pInfo->aConstraintUsage[iIdxName].omit = 1; in cidxBestIndex()
169 pInfo->estimatedCost = 1000000.0; in cidxBestIndex()
172 pInfo->aConstraintUsage[iAfterKey].omit = 1; in cidxBestIndex()
173 pInfo->estimatedCost = 1000.0; in cidxBestIndex()
472 sqlite3_stmt *pInfo = 0; in cidxLookupIndex() local
488 while( sqlite3_step(pInfo)==SQLITE_ROW ){ in cidxLookupIndex()
499 p->bDesc = sqlite3_column_int(pInfo, 3); in cidxLookupIndex()
500 p->bKey = sqlite3_column_int(pInfo, 5); in cidxLookupIndex()
[all …]
/sqlite-3.40.0/ext/fts5/
H A Dfts5_test_tok.c249 sqlite3_index_info *pInfo in fts5tokBestIndexMethod() argument
253 for(i=0; i<pInfo->nConstraint; i++){ in fts5tokBestIndexMethod()
254 if( pInfo->aConstraint[i].usable in fts5tokBestIndexMethod()
255 && pInfo->aConstraint[i].iColumn==0 in fts5tokBestIndexMethod()
256 && pInfo->aConstraint[i].op==SQLITE_INDEX_CONSTRAINT_EQ in fts5tokBestIndexMethod()
258 pInfo->idxNum = 1; in fts5tokBestIndexMethod()
259 pInfo->aConstraintUsage[i].argvIndex = 1; in fts5tokBestIndexMethod()
260 pInfo->aConstraintUsage[i].omit = 1; in fts5tokBestIndexMethod()
261 pInfo->estimatedCost = 1; in fts5tokBestIndexMethod()
266 pInfo->idxNum = 0; in fts5tokBestIndexMethod()
[all …]
H A Dfts5_vocab.c266 sqlite3_index_info *pInfo in fts5VocabBestIndexMethod() argument
277 for(i=0; i<pInfo->nConstraint; i++){ in fts5VocabBestIndexMethod()
292 pInfo->estimatedCost = 100; in fts5VocabBestIndexMethod()
294 pInfo->estimatedCost = 1000000; in fts5VocabBestIndexMethod()
298 pInfo->estimatedCost = pInfo->estimatedCost / 2; in fts5VocabBestIndexMethod()
303 pInfo->estimatedCost = pInfo->estimatedCost / 2; in fts5VocabBestIndexMethod()
312 if( pInfo->nOrderBy==1 in fts5VocabBestIndexMethod()
313 && pInfo->aOrderBy[0].iColumn==0 in fts5VocabBestIndexMethod()
314 && pInfo->aOrderBy[0].desc==0 in fts5VocabBestIndexMethod()
316 pInfo->orderByConsumed = 1; in fts5VocabBestIndexMethod()
[all …]
H A Dfts5_main.c580 pInfo->idxStr = idxStr; in fts5BestIndexMethod()
581 pInfo->needToFreeIdxStr = 1; in fts5BestIndexMethod()
583 for(i=0; i<pInfo->nConstraint; i++){ in fts5BestIndexMethod()
593 pInfo->estimatedCost = 1e50; in fts5BestIndexMethod()
610 pInfo->aConstraintUsage[i].omit = 1; in fts5BestIndexMethod()
629 for(i=0; i<pInfo->nConstraint; i++){ in fts5BestIndexMethod()
651 if( pInfo->nOrderBy==1 ){ in fts5BestIndexMethod()
652 int iSort = pInfo->aOrderBy[0].iColumn; in fts5BestIndexMethod()
659 pInfo->orderByConsumed = 1; in fts5BestIndexMethod()
660 if( pInfo->aOrderBy[0].desc ){ in fts5BestIndexMethod()
[all …]
/sqlite-3.40.0/ext/fts1/
H A Dfulltext.c955 static int fulltextBestIndex(sqlite3_vtab *pVTab, sqlite3_index_info *pInfo){ in fulltextBestIndex() argument
958 for(i=0; i<pInfo->nConstraint; ++i){ in fulltextBestIndex()
960 pConstraint = &pInfo->aConstraint[i]; in fulltextBestIndex()
964 pInfo->aConstraintUsage[i].argvIndex = 1; in fulltextBestIndex()
965 pInfo->aConstraintUsage[i].omit = 1; in fulltextBestIndex()
966 pInfo->idxNum = QUERY_FULLTEXT; in fulltextBestIndex()
967 pInfo->estimatedCost = 1.0; /* an arbitrary value for now */ in fulltextBestIndex()
971 pInfo->idxNum = QUERY_GENERIC; in fulltextBestIndex()
H A Dfts1.c2087 static int fulltextBestIndex(sqlite3_vtab *pVTab, sqlite3_index_info *pInfo){ in fulltextBestIndex() argument
2091 for(i=0; i<pInfo->nConstraint; ++i){ in fulltextBestIndex()
2093 pConstraint = &pInfo->aConstraint[i]; in fulltextBestIndex()
2097 pInfo->idxNum = QUERY_ROWID; /* lookup by rowid */ in fulltextBestIndex()
2102 pInfo->idxNum = QUERY_FULLTEXT + pConstraint->iColumn; in fulltextBestIndex()
2106 pInfo->aConstraintUsage[i].argvIndex = 1; in fulltextBestIndex()
2107 pInfo->aConstraintUsage[i].omit = 1; in fulltextBestIndex()
2112 pInfo->estimatedCost = 1.0; in fulltextBestIndex()
2117 pInfo->idxNum = QUERY_GENERIC; in fulltextBestIndex()
/sqlite-3.40.0/ext/expert/
H A Dsqlite3expert.c901 sqlite3_stmt *pInfo = 0; in idxFindCompatible() local
908 rc = idxPrintfPrepareStmt(dbm, &pInfo, 0, "PRAGMA index_xInfo=%Q", zIdx); in idxFindCompatible()
909 while( rc==SQLITE_OK && sqlite3_step(pInfo)==SQLITE_ROW ){ in idxFindCompatible()
910 int iIdx = sqlite3_column_int(pInfo, 0); in idxFindCompatible()
911 int iCol = sqlite3_column_int(pInfo, 1); in idxFindCompatible()
912 const char *zColl = (const char*)sqlite3_column_text(pInfo, 4); in idxFindCompatible()
936 idxFinalize(&rc, pInfo); in idxFindCompatible()
/sqlite-3.40.0/ext/fts2/
H A Dfts2.c2948 static int fulltextBestIndex(sqlite3_vtab *pVTab, sqlite3_index_info *pInfo){ in fulltextBestIndex() argument
2952 for(i=0; i<pInfo->nConstraint; ++i){ in fulltextBestIndex()
2954 pConstraint = &pInfo->aConstraint[i]; in fulltextBestIndex()
2958 pInfo->idxNum = QUERY_ROWID; /* lookup by rowid */ in fulltextBestIndex()
2963 pInfo->idxNum = QUERY_FULLTEXT + pConstraint->iColumn; in fulltextBestIndex()
2967 pInfo->aConstraintUsage[i].argvIndex = 1; in fulltextBestIndex()
2968 pInfo->aConstraintUsage[i].omit = 1; in fulltextBestIndex()
2973 pInfo->estimatedCost = 1.0; in fulltextBestIndex()
2978 pInfo->idxNum = QUERY_GENERIC; in fulltextBestIndex()