Lines Matching defs:pCost
88073 WhereCost *pCost /* Lowest cost query plan */
88117 if( rTotal>=pCost->rCost ) break;
88128 ** less than the current cost stored in pCost, replace the contents
88129 ** of pCost. */
88131 if( rTotal<pCost->rCost ){
88132 pCost->rCost = rTotal;
88133 pCost->nRow = nRow;
88134 pCost->used = used;
88135 pCost->plan.wsFlags = flags;
88136 pCost->plan.u.pTerm = pTerm;
88319 WhereCost *pCost, /* Lowest cost query plan */
88334 memset(pCost, 0, sizeof(*pCost));
88335 pCost->plan.wsFlags = WHERE_VIRTUALTABLE;
88411 pCost->used |= pWC->a[pIdxCons[i].iTermOffset].prereqRight;
88423 pCost->rCost = (SQLITE_BIG_DBL/((double)2));
88425 pCost->rCost = pIdxInfo->estimatedCost;
88427 pCost->plan.u.pVtabIdx = pIdxInfo;
88429 pCost->plan.wsFlags |= WHERE_ORDERBY;
88431 pCost->plan.nEq = 0;
88437 bestOrClauseIndex(pParse, pWC, pSrc, notReady, pOrderBy, pCost);
88720 WhereCost *pCost /* Lowest cost query plan */
88730 int wsFlagMask; /* Allowed flags in pCost->plan.wsFlag */
88733 memset(pCost, 0, sizeof(*pCost));
88734 pCost->rCost = SQLITE_BIG_DBL;
88988 ** index and its cost in the pCost structure.
88990 if( (!pIdx || wsFlags) && cost<pCost->rCost ){
88991 pCost->rCost = cost;
88992 pCost->nRow = nRow;
88993 pCost->used = used;
88994 pCost->plan.wsFlags = (wsFlags&wsFlagMask);
88995 pCost->plan.nEq = nEq;
88996 pCost->plan.u.pIdx = pIdx;
89014 pCost->plan.wsFlags |= WHERE_REVERSE;
89017 assert( pOrderBy || (pCost->plan.wsFlags&WHERE_ORDERBY)==0 );
89018 assert( pCost->plan.u.pIdx==0 || (pCost->plan.wsFlags&WHERE_ROWID_EQ)==0 );
89020 || pCost->plan.u.pIdx==0
89021 || pCost->plan.u.pIdx==pSrc->pIndex
89025 (pCost->plan.u.pIdx ? pCost->plan.u.pIdx->zName : "ipk")
89028 bestOrClauseIndex(pParse, pWC, pSrc, notReady, pOrderBy, pCost);
89029 pCost->plan.wsFlags |= eqTermMask;
89044 WhereCost *pCost /* Lowest cost query plan */
89049 bestVirtualIndex(pParse, pWC, pSrc, notReady, pOrderBy, pCost, &p);
89057 bestBtreeIndex(pParse, pWC, pSrc, notReady, pOrderBy, pCost);