Home
last modified time | relevance | path

Searched refs:nExpr (Results 1 – 9 of 9) sorted by relevance

/titanic_50/usr/src/lib/libsqlite/src/
H A Dselect.c320 zSortOrder = sqliteMalloc( pOrderBy->nExpr + 1 ); in pushOntoSorter()
322 for(i=0; i<pOrderBy->nExpr; i++){ in pushOntoSorter()
343 zSortOrder[pOrderBy->nExpr] = 0; in pushOntoSorter()
344 sqliteVdbeOp3(v, OP_SortMakeKey, pOrderBy->nExpr, 0, zSortOrder, P3_DYNAMIC); in pushOntoSorter()
359 int nColumn = pEList->nExpr; in sqliteAddKeyType()
426 hasDistinct = distinct>=0 && pEList && pEList->nExpr>0; in selectInnerLoop()
438 nColumn = pEList->nExpr; in selectInnerLoop()
439 for(i=0; i<pEList->nExpr; i++){ in selectInnerLoop()
450 sqliteVdbeAddOp(v, OP_IsNull, -pEList->nExpr, sqliteVdbeCurrentAddr(v)+7); in selectInnerLoop()
452 sqliteVdbeAddOp(v, OP_MakeKey, pEList->nExpr, 1); in selectInnerLoop()
[all …]
H A Dexpr.c159 pNew->nExpr = pNew->nAlloc = p->nExpr; in sqliteExprListDup()
160 pNew->a = pItem = sqliteMalloc( p->nExpr*sizeof(p->a[0]) ); in sqliteExprListDup()
165 for(i=0; i<p->nExpr; i++, pItem++){ in sqliteExprListDup()
260 if( pList->nAlloc<=pList->nExpr ){ in sqliteExprListAppend()
265 pList->nExpr = pList->nAlloc = 0; in sqliteExprListAppend()
271 struct ExprList_item *pItem = &pList->a[pList->nExpr++]; in sqliteExprListAppend()
288 assert( pList->a!=0 || (pList->nExpr==0 && pList->nAlloc==0) ); in sqliteExprListDelete()
289 assert( pList->nExpr<=pList->nAlloc ); in sqliteExprListDelete()
290 for(i=0; i<pList->nExpr; i++){ in sqliteExprListDelete()
324 for(i=0; i<p->pList->nExpr; i++){ in sqliteExprIsConstant()
[all …]
H A Dwhere.c141 for(i=0; i<p->pList->nExpr; i++){ in exprTableUsage()
229 assert( pOrderBy->nExpr>0 ); in findSortingIndex()
231 for(i=0; i<pOrderBy->nExpr; i++){ in findSortingIndex()
256 int nExpr = pOrderBy->nExpr; in findSortingIndex() local
257 if( pIdx->nColumn < nEqCol || pIdx->nColumn < nExpr ) continue; in findSortingIndex()
260 if( j<nExpr && pOrderBy->a[j].pExpr->iColumn==pIdx->aiColumn[i] ){ j++; } in findSortingIndex()
263 for(i=0; i+j<nExpr; i++){ in findSortingIndex()
266 if( i+j>=nExpr ){ in findSortingIndex()
394 int nExpr; /* Number of subexpressions in the WHERE clause */ in sqliteWhereBegin() local
415 nExpr = exprSplit(ARRAYSIZE(aExpr), aExpr, pWhere); in sqliteWhereBegin()
[all …]
H A Dattach.c290 for(i=0; i<pList->nExpr; i++){ in sqliteFixExprList()
H A Dinsert.c192 nColumn = pSelect->pEList->nExpr; in sqliteInsert()
247 nColumn = pList->nExpr; in sqliteInsert()
H A Dupdate.c119 for(i=0; i<pChanges->nExpr; i++){ in sqliteUpdate()
H A DsqliteInt.h725 int nExpr; /* Number of expressions on the list */ member
H A Dtrigger.c515 for(e=0; e<pEList->nExpr; e++){ in checkColumnOverLap()
H A Dparse.y444 if( A ) A->a[A->nExpr-1].sortOrder = C+Z;