Lines Matching refs:pInfo
67439 volatile WalCkptInfo *pInfo;
67449 pInfo = walCkptInfo(pWal);
67450 pInfo->nBackfill = 0;
67451 pInfo->nBackfillAttempted = pWal->hdr.mxFrame;
67452 pInfo->aReadMark[0] = 0;
67457 pInfo->aReadMark[i] = pWal->hdr.mxFrame;
67459 pInfo->aReadMark[i] = READMARK_NOT_USED;
68024 volatile WalCkptInfo *pInfo = walCkptInfo(pWal);
68032 AtomicStore(&pInfo->nBackfill, 0);
68033 pInfo->nBackfillAttempted = 0;
68034 pInfo->aReadMark[1] = 0;
68035 for(i=2; i<WAL_NREADER; i++) pInfo->aReadMark[i] = READMARK_NOT_USED;
68036 assert( pInfo->aReadMark[0]==0 );
68087 volatile WalCkptInfo *pInfo; /* The checkpoint status information */
68092 pInfo = walCkptInfo(pWal);
68093 if( pInfo->nBackfill<pWal->hdr.mxFrame ){
68107 u32 y = AtomicLoad(pInfo->aReadMark+i); SEH_INJECT_FAULT;
68113 AtomicStore(pInfo->aReadMark+i, iMark); SEH_INJECT_FAULT;
68125 if( pInfo->nBackfill<mxSafeFrame ){
68126 rc = walIteratorInit(pWal, pInfo->nBackfill, &pIter);
68133 u32 nBackfill = pInfo->nBackfill;
68134 pInfo->nBackfillAttempted = mxSafeFrame; SEH_INJECT_FAULT;
68195 AtomicStore(&pInfo->nBackfill, mxSafeFrame); SEH_INJECT_FAULT;
68218 if( pInfo->nBackfill<pWal->hdr.mxFrame ){
68223 assert( pInfo->nBackfill==pWal->hdr.mxFrame );
68878 volatile WalCkptInfo *pInfo; /* Checkpoint information in wal-index */
68984 pInfo = walCkptInfo(pWal);
68991 if( !useWal && AtomicLoad(&pInfo->nBackfill)==pWal->hdr.mxFrame
69040 u32 thisMark = AtomicLoad(pInfo->aReadMark+i); SEH_INJECT_FAULT;
69053 AtomicStore(pInfo->aReadMark+i,mxFrame);
69116 pWal->minFrame = AtomicLoad(&pInfo->nBackfill)+1; SEH_INJECT_FAULT;
69118 if( AtomicLoad(pInfo->aReadMark+mxI)!=mxReadMark
69146 volatile WalCkptInfo *pInfo = walCkptInfo(pWal);
69147 u32 i = pInfo->nBackfillAttempted;
69148 for(i=pInfo->nBackfillAttempted; i>AtomicLoad(&pInfo->nBackfill); i--){
69173 pInfo->nBackfillAttempted = i-1;
69253 ** has not yet set the pInfo->nBackfillAttempted variable to indicate
69256 ** before checking pInfo->nBackfillAttempted. */
69292 volatile WalCkptInfo *pInfo = walCkptInfo(pWal);
69295 assert( pInfo->aReadMark[pWal->readLock]<=pSnapshot->mxFrame );
69304 && pSnapshot->mxFrame>=pInfo->nBackfillAttempted
69734 volatile WalCkptInfo *pInfo = walCkptInfo(pWal);
69735 assert( pInfo->nBackfill==pWal->hdr.mxFrame );
69736 if( pInfo->nBackfill>0 ){
72733 CellInfo *pInfo /* Fill in this structure */
72750 surplus = minLocal + (pInfo->nPayload - minLocal)%(pPage->pBt->usableSize-4);
72754 pInfo->nLocal = (u16)surplus;
72756 pInfo->nLocal = (u16)minLocal;
72758 pInfo->nSize = (u16)(&pInfo->pPayload[pInfo->nLocal] - pCell) + 4;
72797 CellInfo *pInfo /* Fill in this structure */
72805 pInfo->nSize = 4 + getVarint(&pCell[4], (u64*)&pInfo->nKey);
72806 pInfo->nPayload = 0;
72807 pInfo->nLocal = 0;
72808 pInfo->pPayload = 0;
72814 CellInfo *pInfo /* Fill in this structure */
72844 ** pIter += getVarint(pIter, (u64*)&pInfo->nKey);
72881 pInfo->nKey = *(i64*)&iKey;
72882 pInfo->nPayload = nPayload;
72883 pInfo->pPayload = pIter;
72892 pInfo->nSize = (u16)nPayload + (u16)(pIter - pCell);
72893 if( pInfo->nSize<4 ) pInfo->nSize = 4;
72894 pInfo->nLocal = (u16)nPayload;
72896 btreeParseCellAdjustSizeForOverflow(pPage, pCell, pInfo);
72902 CellInfo *pInfo /* Fill in this structure */
72920 pInfo->nKey = nPayload;
72921 pInfo->nPayload = nPayload;
72922 pInfo->pPayload = pIter;
72931 pInfo->nSize = (u16)nPayload + (u16)(pIter - pCell);
72932 if( pInfo->nSize<4 ) pInfo->nSize = 4;
72933 pInfo->nLocal = (u16)nPayload;
72935 btreeParseCellAdjustSizeForOverflow(pPage, pCell, pInfo);
72941 CellInfo *pInfo /* Fill in this structure */
72943 pPage->xParseCell(pPage, findCell(pPage, iCell), pInfo);
78467 CellInfo *pInfo /* Size information about the cell */
78476 assert( pInfo->nLocal!=pInfo->nPayload );
78477 testcase( pCell + pInfo->nSize == pPage->aDataEnd );
78478 testcase( pCell + (pInfo->nSize-1) == pPage->aDataEnd );
78479 if( pCell + pInfo->nSize > pPage->aDataEnd ){
78483 ovflPgno = get4byte(pCell + pInfo->nSize - 4);
78487 nOvfl = (pInfo->nPayload - pInfo->nLocal + ovflPageSize - 1)/ovflPageSize;
78489 (CORRUPT_DB && (pInfo->nPayload + ovflPageSize)<ovflPageSize)
115419 AggInfo *pInfo = pExpr->pAggInfo;
115420 if( pInfo==0
115422 || NEVER(pExpr->iAgg>=pInfo->nFunc)
115427 return AggInfoFuncReg(pInfo, pExpr->iAgg);
117315 static int addAggInfoColumn(sqlite3 *db, AggInfo *pInfo){
117317 pInfo->aCol = sqlite3ArrayAllocate(
117319 pInfo->aCol,
117320 sizeof(pInfo->aCol[0]),
117321 &pInfo->nColumn,
117331 static int addAggInfoFunc(sqlite3 *db, AggInfo *pInfo){
117333 pInfo->aFunc = sqlite3ArrayAllocate(
117335 pInfo->aFunc,
117336 sizeof(pInfo->aFunc[0]),
117337 &pInfo->nFunc,
121668 analysisInfo *pInfo = (analysisInfo*)pData;
121679 pTable = sqlite3FindTable(pInfo->db, argv[0], pInfo->zDatabase);
121688 pIndex = sqlite3FindIndex(pInfo->db, argv[1], pInfo->zDatabase);
121701 if( pIndex->aiRowEst==0 ) sqlite3OomFault(pInfo->db);
131085 const struct compareInfo *pInfo, /* Information about how to do the compare */
131089 u32 matchOne = pInfo->matchOne; /* "?" or "_" */
131090 u32 matchAll = pInfo->matchAll; /* "*" or "%" */
131091 u8 noCase = pInfo->noCase; /* True if uppercase==lowercase */
131108 if( pInfo->matchSet==0 ){
131116 int bMatch = patternCompare(&zPattern[-1],zString,pInfo,matchOther);
131148 bMatch = patternCompare(zPattern,zString,pInfo,matchOther);
131155 bMatch = patternCompare(zPattern,zString,pInfo,matchOther);
131162 if( pInfo->matchSet==0 ){
131270 struct compareInfo *pInfo = sqlite3_user_data(context);
131307 if( escape==pInfo->matchAll || escape==pInfo->matchOne ){
131308 memcpy(&backupInfo, pInfo, sizeof(backupInfo));
131309 pInfo = &backupInfo;
131310 if( escape==pInfo->matchAll ) pInfo->matchAll = 0;
131311 if( escape==pInfo->matchOne ) pInfo->matchOne = 0;
131314 escape = pInfo->matchSet;
131323 patternCompare(zB, zA, pInfo, escape)==SQLITE_MATCH);
132705 struct compareInfo *pInfo;
132709 pInfo = (struct compareInfo*)&likeInfoAlt;
132712 pInfo = (struct compareInfo*)&likeInfoNorm;
132716 sqlite3CreateFunc(db, "like", nArg, SQLITE_UTF8, pInfo, likeFunc,
135206 AutoincInfo *pInfo;
135222 pInfo = pToplevel->pAinc;
135223 while( pInfo && pInfo->pTab!=pTab ){ pInfo = pInfo->pNext; }
135224 if( pInfo==0 ){
135225 pInfo = sqlite3DbMallocRawNN(pParse->db, sizeof(*pInfo));
135226 sqlite3ParserAddCleanup(pToplevel, sqlite3DbFree, pInfo);
135229 pInfo->pNext = pToplevel->pAinc;
135230 pToplevel->pAinc = pInfo;
135231 pInfo->pTab = pTab;
135232 pInfo->iDb = iDb;
135234 pInfo->regCtr = ++pToplevel->nMem; /* Max rowid register */
135237 memId = pInfo->regCtr;
145503 RowLoadInfo *pInfo /* Info needed to complete the row load */
145505 sqlite3ExprCodeExprList(pParse, pSelect->pEList, pInfo->regResult,
145506 0, pInfo->ecelFlags);
145508 if( pInfo->pExtra ){
145509 sqlite3ExprCodeExprList(pParse, pInfo->pExtra, pInfo->regExtraResult, 0, 0);
145510 sqlite3ExprListDelete(pParse->db, pInfo->pExtra);
146432 KeyInfo *pInfo;
146438 pInfo = sqlite3KeyInfoAlloc(db, nExpr-iStart, nExtra+1);
146439 if( pInfo ){
146440 assert( sqlite3KeyInfoIsWriteable(pInfo) );
146442 pInfo->aColl[i-iStart] = sqlite3ExprNNCollSeq(pParse, pItem->pExpr);
146443 pInfo->aSortFlags[i-iStart] = pItem->fg.sortFlags;
146446 return pInfo;
171658 KeyInfo *pInfo;
171660 pInfo = sqlite3KeyInfoAlloc(pParse->db, 1, 0);
171661 if( pInfo ){
171662 pInfo->aColl[0] = 0;
171663 pInfo->aSortFlags[0] = 0;
171664 sqlite3VdbeAppendP4(v, pInfo, P4_KEYINFO);
190646 static int fts3BestIndexMethod(sqlite3_vtab *pVTab, sqlite3_index_info *pInfo){
190664 pInfo->idxNum = FTS3_FULLSCAN_SEARCH;
190665 pInfo->estimatedCost = 5000000;
190666 for(i=0; i<pInfo->nConstraint; i++){
190668 struct sqlite3_index_constraint *pCons = &pInfo->aConstraint[i];
190676 pInfo->idxNum = FTS3_FULLSCAN_SEARCH;
190677 pInfo->estimatedCost = 1e50;
190678 fts3SetEstimatedRows(pInfo, ((sqlite3_int64)1) << 50);
190688 pInfo->idxNum = FTS3_DOCID_SEARCH;
190689 pInfo->estimatedCost = 1.0;
190705 pInfo->idxNum = FTS3_FULLTEXT_SEARCH + pCons->iColumn;
190706 pInfo->estimatedCost = 2.0;
190733 if( pInfo->idxNum==FTS3_DOCID_SEARCH ) fts3SetUniqueFlag(pInfo);
190737 pInfo->aConstraintUsage[iCons].argvIndex = iIdx++;
190738 pInfo->aConstraintUsage[iCons].omit = 1;
190741 pInfo->idxNum |= FTS3_HAVE_LANGID;
190742 pInfo->aConstraintUsage[iLangidCons].argvIndex = iIdx++;
190745 pInfo->idxNum |= FTS3_HAVE_DOCID_GE;
190746 pInfo->aConstraintUsage[iDocidGe].argvIndex = iIdx++;
190749 pInfo->idxNum |= FTS3_HAVE_DOCID_LE;
190750 pInfo->aConstraintUsage[iDocidLe].argvIndex = iIdx++;
190756 if( pInfo->nOrderBy==1 ){
190757 struct sqlite3_index_orderby *pOrder = &pInfo->aOrderBy[0];
190760 pInfo->idxStr = "DESC";
190762 pInfo->idxStr = "ASC";
190764 pInfo->orderByConsumed = 1;
195400 sqlite3_index_info *pInfo
195412 if( pInfo->nOrderBy==1
195413 && pInfo->aOrderBy[0].iColumn==0
195414 && pInfo->aOrderBy[0].desc==0
195416 pInfo->orderByConsumed = 1;
195421 for(i=0; i<pInfo->nConstraint; i++){
195422 if( pInfo->aConstraint[i].usable ){
195423 int op = pInfo->aConstraint[i].op;
195424 int iCol = pInfo->aConstraint[i].iColumn;
195440 pInfo->idxNum = FTS4AUX_EQ_CONSTRAINT;
195441 pInfo->aConstraintUsage[iEq].argvIndex = iNext++;
195442 pInfo->estimatedCost = 5;
195444 pInfo->idxNum = 0;
195445 pInfo->estimatedCost = 20000;
195447 pInfo->idxNum += FTS4AUX_GE_CONSTRAINT;
195448 pInfo->aConstraintUsage[iGe].argvIndex = iNext++;
195449 pInfo->estimatedCost /= 2;
195452 pInfo->idxNum += FTS4AUX_LE_CONSTRAINT;
195453 pInfo->aConstraintUsage[iLe].argvIndex = iNext++;
195454 pInfo->estimatedCost /= 2;
195458 pInfo->aConstraintUsage[iLangid].argvIndex = iNext++;
195459 pInfo->estimatedCost--;
199171 sqlite3_index_info *pInfo
199176 for(i=0; i<pInfo->nConstraint; i++){
199177 if( pInfo->aConstraint[i].usable
199178 && pInfo->aConstraint[i].iColumn==0
199179 && pInfo->aConstraint[i].op==SQLITE_INDEX_CONSTRAINT_EQ
199181 pInfo->idxNum = 1;
199182 pInfo->aConstraintUsage[i].argvIndex = 1;
199183 pInfo->aConstraintUsage[i].omit = 1;
199184 pInfo->estimatedCost = 1;
199189 pInfo->idxNum = 0;
199190 assert( pInfo->estimatedCost>1000000.0 );
206247 static size_t fts3MatchinfoSize(MatchInfo *pInfo, char cArg){
206260 nVal = pInfo->nCol;
206264 nVal = (size_t)pInfo->nCol * pInfo->nPhrase;
206268 nVal = (size_t)pInfo->nPhrase * ((pInfo->nCol + 31) / 32);
206273 nVal = (size_t)pInfo->nCol * pInfo->nPhrase * 3;
206376 ** column are written into the first nCol elements of the pInfo->aMatchinfo[]
206380 ** data written to the first nCol elements of pInfo->aMatchinfo[] is
206383 static int fts3MatchinfoLcs(Fts3Cursor *pCsr, MatchInfo *pInfo){
206397 for(i=0; i<pInfo->nPhrase; i++){
206403 for(iCol=0; iCol<pInfo->nCol; iCol++){
206407 for(i=0; i<pInfo->nPhrase; i++){
206426 for(i=0; i<pInfo->nPhrase; i++){
206446 pInfo->aMatchinfo[iCol] = nLcs;
206455 ** Populate the buffer pInfo->aMatchinfo[] with an array of integers to
206459 ** string has already been validated and the pInfo->aMatchinfo[] array
206469 ** pInfo->aMatchinfo[] buffer is left in is undefined.
206474 MatchInfo *pInfo, /* Matchinfo context object */
206483 pInfo->flag = zArg[i];
206486 if( bGlobal ) pInfo->aMatchinfo[0] = pInfo->nPhrase;
206490 if( bGlobal ) pInfo->aMatchinfo[0] = pInfo->nCol;
206497 pInfo->aMatchinfo[0] = (u32)nDoc;
206510 for(iCol=0; iCol<pInfo->nCol; iCol++){
206519 pInfo->aMatchinfo[iCol] = iVal;
206532 for(iCol=0; iCol<pInfo->nCol; iCol++){
206539 pInfo->aMatchinfo[iCol] = (u32)nToken;
206549 rc = fts3MatchinfoLcs(pCsr, pInfo);
206555 size_t nZero = fts3MatchinfoSize(pInfo, zArg[i]) * sizeof(u32);
206556 memset(pInfo->aMatchinfo, 0, nZero);
206557 rc = fts3ExprLHitGather(pCsr->pExpr, pInfo);
206569 rc = fts3MatchinfoSelectDoctotal(pTab, &pSelect, &pInfo->nDoc,0,0);
206572 rc = sqlite3Fts3ExprIterate(pExpr, fts3ExprGlobalHitsCb,(void*)pInfo);
206576 (void)sqlite3Fts3ExprIterate(pExpr, fts3ExprLocalHitsCb,(void*)pInfo);
206581 pInfo->aMatchinfo += fts3MatchinfoSize(pInfo, zArg[i]);
213766 sqlite3_rtree_query_info *pInfo; /* xGeom and xQueryFunc argument */
214536 sqlite3_rtree_query_info *pInfo = pCsr->aConstraint[i].pInfo;
214537 if( pInfo ){
214538 if( pInfo->xDelUser ) pInfo->xDelUser(pInfo->pUser);
214539 sqlite3_free(pInfo);
214640 sqlite3_rtree_query_info *pInfo = pConstraint->pInfo; /* Callback info */
214641 int nCoord = pInfo->nCoord; /* No. of coordinates */
214650 pInfo->iRowid = readInt64(pCellData);
214685 rc = pConstraint->u.xGeom((sqlite3_rtree_geometry*)pInfo,
214690 pInfo->aCoord = aCoord;
214691 pInfo->iLevel = pSearch->iLevel - 1;
214692 pInfo->rScore = pInfo->rParentScore = pSearch->rScore;
214693 pInfo->eWithin = pInfo->eParentWithin = pSearch->eWithin;
214694 rc = pConstraint->u.xQueryFunc(pInfo);
214695 if( pInfo->eWithin<*peWithin ) *peWithin = pInfo->eWithin;
214696 if( pInfo->rScore<*prScore || *prScore<RTREE_ZERO ){
214697 *prScore = pInfo->rScore;
215247 sqlite3_rtree_query_info *pInfo; /* Callback information */
215251 pInfo = (sqlite3_rtree_query_info*)
215252 sqlite3_malloc64( sizeof(*pInfo)+pSrc->iSize );
215253 if( !pInfo ) return SQLITE_NOMEM;
215254 memset(pInfo, 0, sizeof(*pInfo));
215255 pBlob = (RtreeMatchArg*)&pInfo[1];
215257 pInfo->pContext = pBlob->cb.pContext;
215258 pInfo->nParam = pBlob->nParam;
215259 pInfo->aParam = pBlob->aParam;
215260 pInfo->apSqlParam = pBlob->apSqlParam;
215268 pCons->pInfo = pInfo;
215352 p->pInfo->nCoord = pRtree->nDim2;
215353 p->pInfo->anQueue = pCsr->anQueue;
215354 p->pInfo->mxLevel = pRtree->iDepth + 1;
219606 RtreeGeomCallback *pInfo = (RtreeGeomCallback*)p;
219607 if( pInfo->xDestructor ) pInfo->xDestructor(pInfo->pContext);
254280 static int fts5BestIndexMethod(sqlite3_vtab *pVTab, sqlite3_index_info *pInfo){
254311 idxStr = (char*)sqlite3_malloc(pInfo->nConstraint * 8 + 1);
254313 pInfo->idxStr = idxStr;
254314 pInfo->needToFreeIdxStr = 1;
254316 for(i=0; i<pInfo->nConstraint; i++){
254317 struct sqlite3_index_constraint *p = &pInfo->aConstraint[i];
254340 pInfo->aConstraintUsage[i].argvIndex = ++iCons;
254341 pInfo->aConstraintUsage[i].omit = 1;
254349 pInfo->aConstraintUsage[i].argvIndex = ++iCons;
254355 pInfo->aConstraintUsage[i].argvIndex = ++iCons;
254361 for(i=0; i<pInfo->nConstraint; i++){
254362 struct sqlite3_index_constraint *p = &pInfo->aConstraint[i];
254368 pInfo->aConstraintUsage[i].argvIndex = ++iCons;
254374 pInfo->aConstraintUsage[i].argvIndex = ++iCons;
254386 if( pInfo->nOrderBy==1 ){
254387 int iSort = pInfo->aOrderBy[0].iColumn;
254390 }else if( iSort==-1 && (!pInfo->aOrderBy[0].desc || !pConfig->bTokendata) ){
254394 pInfo->orderByConsumed = 1;
254395 if( pInfo->aOrderBy[0].desc ){
254403 pInfo->estimatedCost = nSeenMatch ? 1000.0 : 10.0;
254404 if( nSeenMatch==0 ) fts5SetUniqueFlag(pInfo);
254406 pInfo->estimatedCost = nSeenMatch ? 5000.0 : 250000.0;
254408 pInfo->estimatedCost = nSeenMatch ? 7500.0 : 750000.0;
254410 pInfo->estimatedCost = nSeenMatch ? 10000.0 : 1000000.0;
254413 pInfo->estimatedCost *= 0.4;
254416 pInfo->idxNum = idxFlags;
261959 sqlite3_index_info *pInfo
261965 int idxNum = (int)pInfo->colUsed;
261970 assert( (pInfo->colUsed & FTS5_VOCAB_COLUSED_MASK)==pInfo->colUsed );
261972 for(i=0; i<pInfo->nConstraint; i++){
261973 struct sqlite3_index_constraint *p = &pInfo->aConstraint[i];
261986 pInfo->aConstraintUsage[iTermEq].argvIndex = ++nArg;
261987 pInfo->estimatedCost = 100;
261989 pInfo->estimatedCost = 1000000;
261992 pInfo->aConstraintUsage[iTermGe].argvIndex = ++nArg;
261993 pInfo->estimatedCost = pInfo->estimatedCost / 2;
261997 pInfo->aConstraintUsage[iTermLe].argvIndex = ++nArg;
261998 pInfo->estimatedCost = pInfo->estimatedCost / 2;
262007 if( pInfo->nOrderBy==1
262008 && pInfo->aOrderBy[0].iColumn==0
262009 && pInfo->aOrderBy[0].desc==0
262011 pInfo->orderByConsumed = 1;
262014 pInfo->idxNum = idxNum;