Searched defs:pLeft (Results 1 - 6 of 6) sorted by relevance

/osnet-11/usr/src/lib/libsqlite/src/
H A Dpragma.c162 void sqlitePragma(Parse *pParse, Token *pLeft, Token *pRight, int minusFlag){ argument
169 zLeft = sqliteStrNDup(pLeft->z, pLeft->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->z==pLeft->z ){
547 if( pRight->z==pLeft->z ){
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 */
36 pNew->pLeft = pLeft;
46 if( pLeft && pRight ){
47 sqliteExprSpan(pNew, &pLeft->span, &pRight->span);
59 void sqliteExprSpan(Expr *pExpr, Token *pLeft, Token *pRight){ argument
61 assert( pLeft!=0 );
63 if( pExpr && pRight->z && pLeft->z ){
64 if( pLeft
[all...]
H A Dbtree_rb.c130 BtRbNode *pLeft; /* Nodes left child, or NULL */ member in struct:BtRbNode
213 pb = pY->pLeft;
217 if( pX->pParent->pLeft == pX ) pX->pParent->pLeft = pY;
220 pY->pLeft = pX;
244 pY = pX->pLeft;
249 if( pX->pParent->pLeft == pX ) pX->pParent->pLeft = pY;
254 pX->pLeft = pb;
301 orig = append_node( orig, pNode->pLeft, inden
[all...]
H A Dselect.c198 setJoinExpr(p->pLeft);
938 && pE->pLeft && pE->pLeft->op==TK_ID ) break;
964 if( pE->op==TK_DOT && pE->pLeft ){
965 zTName = sqliteTableNameFromToken(&pE->pLeft->token);
981 Expr *pExpr, *pLeft, *pRight; local
1001 pLeft = sqliteExpr(TK_ID, 0, 0, 0);
1002 pExpr = sqliteExpr(TK_DOT, pLeft, pRight, 0);
1004 pLeft->token.z = zTabName;
1005 pLeft
[all...]
H A Dvdbe.c366 static Sorter *Merge(Sorter *pLeft, Sorter *pRight){ argument
371 while( pLeft && pRight ){
372 int c = sqliteSortCompare(pLeft->zKey, pRight->zKey);
374 pTail->pNext = pLeft;
375 pLeft = pLeft->pNext;
382 if( pLeft ){
383 pTail->pNext = pLeft;
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

Completed in 80 milliseconds