Searched refs:pRight (Results 1 - 9 of 9) sorted by relevance

/osnet-11/usr/src/lib/libsqlite/src/
H A Dbtree_rb.c131 BtRbNode *pRight; /* Nodes right child, or NULL */ member in struct:BtRbNode
212 pY = pX->pRight;
218 else pX->pParent->pRight = pY;
222 pX->pRight = pb;
245 pb = pY->pRight;
250 else pX->pParent->pRight = pY;
252 pY->pRight = pX;
302 orig = append_node( orig, pNode->pRight, indent );
351 if( pNode->pRight ){
352 pNode = pNode->pRight;
[all...]
H A Dexpr.c28 Expr *sqliteExpr(int op, Expr *pLeft, Expr *pRight, Token *pToken){ argument
32 /* When malloc fails, we leak memory from pLeft and pRight */
37 pNew->pRight = pRight;
46 if( pLeft && pRight ){
47 sqliteExprSpan(pNew, &pLeft->span, &pRight->span);
59 void sqliteExprSpan(Expr *pExpr, Token *pLeft, Token *pRight){ argument
60 assert( pRight!=0 );
63 if( pExpr && pRight->z && pLeft->z ){
64 if( pLeft->dyn==0 && pRight
669 Expr *pRight; local
[all...]
H A Dpragma.c162 void sqlitePragma(Parse *pParse, Token *pLeft, Token *pRight, int minusFlag){ argument
173 sqliteSetNString(&zRight, "-", 1, pRight->z, pRight->n, 0);
175 zRight = sqliteStrNDup(pRight->z, pRight->n);
212 if( pRight->z==pLeft->z ){
250 if( pRight->z==pLeft->z ){
298 if( pRight->z==pLeft->z ){
341 if( pRight->z==pLeft->z ){
523 if( pRight
[all...]
H A Dwhere.c33 short int idxRight; /* p->pRight is a column in this table number. -1 if
34 ** p->pRight is not the column of any table */
36 unsigned prereqRight; /* Bitmask of tables referenced by p->pRight */
78 cnt = 1 + exprSplit(nSlot-1, &aSlot[1], pExpr->pRight);
81 cnt += exprSplit(nSlot-cnt, &aSlot[cnt], pExpr->pRight);
133 if( p->pRight ){
134 mask = exprTableUsage(pMaskSet, p->pRight);
176 pInfo->prereqRight = exprTableUsage(pMaskSet, pExpr->pRight);
182 if( pExpr->pRight && pExpr->pRight
[all...]
H A Dselect.c199 p = p->pRight;
811 && (pR=p->pRight)!=0 && pR->token.z && pR->token.z[0] ){
937 if( pE->op==TK_DOT && pE->pRight && pE->pRight->op==TK_ALL
952 (pE->op!=TK_DOT || pE->pRight==0 || pE->pRight->op!=TK_ALL) ){
981 Expr *pExpr, *pLeft, *pRight; local
995 pRight = sqliteExpr(TK_ID, 0, 0, 0);
996 if( pRight==0 ) break;
997 pRight
[all...]
H A Dattach.c277 if( sqliteFixExpr(pFix, pExpr->pRight) ){
H A Dvdbe.c366 static Sorter *Merge(Sorter *pLeft, Sorter *pRight){ argument
371 while( pLeft && pRight ){
372 int c = sqliteSortCompare(pLeft->zKey, pRight->zKey);
377 pTail->pNext = pRight;
378 pRight = pRight->pNext;
384 }else if( pRight ){
385 pTail->pNext = pRight;
H A DsqliteInt.h658 ** Expr.pRight and Expr.pLeft are subexpressions. Expr.pList is a list
689 Expr *pLeft, *pRight; /* Left and right subnodes */ member in struct:Expr
H A Dparse.y337 Expr *pRight = sqliteExpr(TK_ALL, 0, 0, 0);
339 A = sqliteExprListAppend(P, sqliteExpr(TK_DOT, pLeft, pRight, 0), 0);

Completed in 79 milliseconds