105dcaa503
the variable or field named "pFunc". FossilOrigin-Name: d9475ebcde169272ad7b1d3a82b2326df55dafc68217bfecd9fcd1f2b89efbd9
818 lines
25 KiB
C
818 lines
25 KiB
C
/*
|
|
** 2015-06-08
|
|
**
|
|
** The author disclaims copyright to this source code. In place of
|
|
** a legal notice, here is a blessing:
|
|
**
|
|
** May you do good and not evil.
|
|
** May you find forgiveness for yourself and forgive others.
|
|
** May you share freely, never taking more than you give.
|
|
**
|
|
*************************************************************************
|
|
**
|
|
** This file contains C code to implement the TreeView debugging routines.
|
|
** These routines print a parse tree to standard output for debugging and
|
|
** analysis.
|
|
**
|
|
** The interfaces in this file is only available when compiling
|
|
** with SQLITE_DEBUG.
|
|
*/
|
|
#include "sqliteInt.h"
|
|
#ifdef SQLITE_DEBUG
|
|
|
|
/*
|
|
** Add a new subitem to the tree. The moreToFollow flag indicates that this
|
|
** is not the last item in the tree.
|
|
*/
|
|
static TreeView *sqlite3TreeViewPush(TreeView *p, u8 moreToFollow){
|
|
if( p==0 ){
|
|
p = sqlite3_malloc64( sizeof(*p) );
|
|
if( p==0 ) return 0;
|
|
memset(p, 0, sizeof(*p));
|
|
}else{
|
|
p->iLevel++;
|
|
}
|
|
assert( moreToFollow==0 || moreToFollow==1 );
|
|
if( p->iLevel<(int)sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
|
|
return p;
|
|
}
|
|
|
|
/*
|
|
** Finished with one layer of the tree
|
|
*/
|
|
static void sqlite3TreeViewPop(TreeView *p){
|
|
if( p==0 ) return;
|
|
p->iLevel--;
|
|
if( p->iLevel<0 ) sqlite3_free(p);
|
|
}
|
|
|
|
/*
|
|
** Generate a single line of output for the tree, with a prefix that contains
|
|
** all the appropriate tree lines
|
|
*/
|
|
static void sqlite3TreeViewLine(TreeView *p, const char *zFormat, ...){
|
|
va_list ap;
|
|
int i;
|
|
StrAccum acc;
|
|
char zBuf[500];
|
|
sqlite3StrAccumInit(&acc, 0, zBuf, sizeof(zBuf), 0);
|
|
if( p ){
|
|
for(i=0; i<p->iLevel && i<(int)sizeof(p->bLine)-1; i++){
|
|
sqlite3_str_append(&acc, p->bLine[i] ? "| " : " ", 4);
|
|
}
|
|
sqlite3_str_append(&acc, p->bLine[i] ? "|-- " : "'-- ", 4);
|
|
}
|
|
if( zFormat!=0 ){
|
|
va_start(ap, zFormat);
|
|
sqlite3_str_vappendf(&acc, zFormat, ap);
|
|
va_end(ap);
|
|
assert( acc.nChar>0 || acc.accError );
|
|
sqlite3_str_append(&acc, "\n", 1);
|
|
}
|
|
sqlite3StrAccumFinish(&acc);
|
|
fprintf(stdout,"%s", zBuf);
|
|
fflush(stdout);
|
|
}
|
|
|
|
/*
|
|
** Shorthand for starting a new tree item that consists of a single label
|
|
*/
|
|
static void sqlite3TreeViewItem(TreeView *p, const char *zLabel,u8 moreFollows){
|
|
p = sqlite3TreeViewPush(p, moreFollows);
|
|
sqlite3TreeViewLine(p, "%s", zLabel);
|
|
}
|
|
|
|
/*
|
|
** Generate a human-readable description of a WITH clause.
|
|
*/
|
|
void sqlite3TreeViewWith(TreeView *pView, const With *pWith, u8 moreToFollow){
|
|
int i;
|
|
if( pWith==0 ) return;
|
|
if( pWith->nCte==0 ) return;
|
|
if( pWith->pOuter ){
|
|
sqlite3TreeViewLine(pView, "WITH (0x%p, pOuter=0x%p)",pWith,pWith->pOuter);
|
|
}else{
|
|
sqlite3TreeViewLine(pView, "WITH (0x%p)", pWith);
|
|
}
|
|
if( pWith->nCte>0 ){
|
|
pView = sqlite3TreeViewPush(pView, 1);
|
|
for(i=0; i<pWith->nCte; i++){
|
|
StrAccum x;
|
|
char zLine[1000];
|
|
const struct Cte *pCte = &pWith->a[i];
|
|
sqlite3StrAccumInit(&x, 0, zLine, sizeof(zLine), 0);
|
|
sqlite3_str_appendf(&x, "%s", pCte->zName);
|
|
if( pCte->pCols && pCte->pCols->nExpr>0 ){
|
|
char cSep = '(';
|
|
int j;
|
|
for(j=0; j<pCte->pCols->nExpr; j++){
|
|
sqlite3_str_appendf(&x, "%c%s", cSep, pCte->pCols->a[j].zEName);
|
|
cSep = ',';
|
|
}
|
|
sqlite3_str_appendf(&x, ")");
|
|
}
|
|
if( pCte->pUse ){
|
|
sqlite3_str_appendf(&x, " (pUse=0x%p, nUse=%d)", pCte->pUse,
|
|
pCte->pUse->nUse);
|
|
}
|
|
sqlite3StrAccumFinish(&x);
|
|
sqlite3TreeViewItem(pView, zLine, i<pWith->nCte-1);
|
|
sqlite3TreeViewSelect(pView, pCte->pSelect, 0);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
}
|
|
|
|
/*
|
|
** Generate a human-readable description of a SrcList object.
|
|
*/
|
|
void sqlite3TreeViewSrcList(TreeView *pView, const SrcList *pSrc){
|
|
int i;
|
|
for(i=0; i<pSrc->nSrc; i++){
|
|
const SrcItem *pItem = &pSrc->a[i];
|
|
StrAccum x;
|
|
char zLine[100];
|
|
sqlite3StrAccumInit(&x, 0, zLine, sizeof(zLine), 0);
|
|
x.printfFlags |= SQLITE_PRINTF_INTERNAL;
|
|
sqlite3_str_appendf(&x, "{%d:*} %!S", pItem->iCursor, pItem);
|
|
if( pItem->pTab ){
|
|
sqlite3_str_appendf(&x, " tab=%Q nCol=%d ptr=%p used=%llx",
|
|
pItem->pTab->zName, pItem->pTab->nCol, pItem->pTab, pItem->colUsed);
|
|
}
|
|
if( pItem->fg.jointype & JT_LEFT ){
|
|
sqlite3_str_appendf(&x, " LEFT-JOIN");
|
|
}else if( pItem->fg.jointype & JT_CROSS ){
|
|
sqlite3_str_appendf(&x, " CROSS-JOIN");
|
|
}
|
|
if( pItem->fg.fromDDL ){
|
|
sqlite3_str_appendf(&x, " DDL");
|
|
}
|
|
if( pItem->fg.isCte ){
|
|
sqlite3_str_appendf(&x, " CteUse=0x%p", pItem->u2.pCteUse);
|
|
}
|
|
sqlite3StrAccumFinish(&x);
|
|
sqlite3TreeViewItem(pView, zLine, i<pSrc->nSrc-1);
|
|
if( pItem->pSelect ){
|
|
sqlite3TreeViewSelect(pView, pItem->pSelect, 0);
|
|
}
|
|
if( pItem->fg.isTabFunc ){
|
|
sqlite3TreeViewExprList(pView, pItem->u1.pFuncArg, 0, "func-args:");
|
|
}
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
}
|
|
|
|
/*
|
|
** Generate a human-readable description of a Select object.
|
|
*/
|
|
void sqlite3TreeViewSelect(TreeView *pView, const Select *p, u8 moreToFollow){
|
|
int n = 0;
|
|
int cnt = 0;
|
|
if( p==0 ){
|
|
sqlite3TreeViewLine(pView, "nil-SELECT");
|
|
return;
|
|
}
|
|
pView = sqlite3TreeViewPush(pView, moreToFollow);
|
|
if( p->pWith ){
|
|
sqlite3TreeViewWith(pView, p->pWith, 1);
|
|
cnt = 1;
|
|
sqlite3TreeViewPush(pView, 1);
|
|
}
|
|
do{
|
|
if( p->selFlags & SF_WhereBegin ){
|
|
sqlite3TreeViewLine(pView, "sqlite3WhereBegin()");
|
|
}else{
|
|
sqlite3TreeViewLine(pView,
|
|
"SELECT%s%s (%u/%p) selFlags=0x%x nSelectRow=%d",
|
|
((p->selFlags & SF_Distinct) ? " DISTINCT" : ""),
|
|
((p->selFlags & SF_Aggregate) ? " agg_flag" : ""),
|
|
p->selId, p, p->selFlags,
|
|
(int)p->nSelectRow
|
|
);
|
|
}
|
|
if( cnt++ ) sqlite3TreeViewPop(pView);
|
|
if( p->pPrior ){
|
|
n = 1000;
|
|
}else{
|
|
n = 0;
|
|
if( p->pSrc && p->pSrc->nSrc ) n++;
|
|
if( p->pWhere ) n++;
|
|
if( p->pGroupBy ) n++;
|
|
if( p->pHaving ) n++;
|
|
if( p->pOrderBy ) n++;
|
|
if( p->pLimit ) n++;
|
|
#ifndef SQLITE_OMIT_WINDOWFUNC
|
|
if( p->pWin ) n++;
|
|
if( p->pWinDefn ) n++;
|
|
#endif
|
|
}
|
|
if( p->pEList ){
|
|
sqlite3TreeViewExprList(pView, p->pEList, n>0, "result-set");
|
|
}
|
|
n--;
|
|
#ifndef SQLITE_OMIT_WINDOWFUNC
|
|
if( p->pWin ){
|
|
Window *pX;
|
|
pView = sqlite3TreeViewPush(pView, (n--)>0);
|
|
sqlite3TreeViewLine(pView, "window-functions");
|
|
for(pX=p->pWin; pX; pX=pX->pNextWin){
|
|
sqlite3TreeViewWinFunc(pView, pX, pX->pNextWin!=0);
|
|
}
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
#endif
|
|
if( p->pSrc && p->pSrc->nSrc ){
|
|
pView = sqlite3TreeViewPush(pView, (n--)>0);
|
|
sqlite3TreeViewLine(pView, "FROM");
|
|
sqlite3TreeViewSrcList(pView, p->pSrc);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
if( p->pWhere ){
|
|
sqlite3TreeViewItem(pView, "WHERE", (n--)>0);
|
|
sqlite3TreeViewExpr(pView, p->pWhere, 0);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
if( p->pGroupBy ){
|
|
sqlite3TreeViewExprList(pView, p->pGroupBy, (n--)>0, "GROUPBY");
|
|
}
|
|
if( p->pHaving ){
|
|
sqlite3TreeViewItem(pView, "HAVING", (n--)>0);
|
|
sqlite3TreeViewExpr(pView, p->pHaving, 0);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
#ifndef SQLITE_OMIT_WINDOWFUNC
|
|
if( p->pWinDefn ){
|
|
Window *pX;
|
|
sqlite3TreeViewItem(pView, "WINDOW", (n--)>0);
|
|
for(pX=p->pWinDefn; pX; pX=pX->pNextWin){
|
|
sqlite3TreeViewWindow(pView, pX, pX->pNextWin!=0);
|
|
}
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
#endif
|
|
if( p->pOrderBy ){
|
|
sqlite3TreeViewExprList(pView, p->pOrderBy, (n--)>0, "ORDERBY");
|
|
}
|
|
if( p->pLimit ){
|
|
sqlite3TreeViewItem(pView, "LIMIT", (n--)>0);
|
|
sqlite3TreeViewExpr(pView, p->pLimit->pLeft, p->pLimit->pRight!=0);
|
|
if( p->pLimit->pRight ){
|
|
sqlite3TreeViewItem(pView, "OFFSET", (n--)>0);
|
|
sqlite3TreeViewExpr(pView, p->pLimit->pRight, 0);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
if( p->pPrior ){
|
|
const char *zOp = "UNION";
|
|
switch( p->op ){
|
|
case TK_ALL: zOp = "UNION ALL"; break;
|
|
case TK_INTERSECT: zOp = "INTERSECT"; break;
|
|
case TK_EXCEPT: zOp = "EXCEPT"; break;
|
|
}
|
|
sqlite3TreeViewItem(pView, zOp, 1);
|
|
}
|
|
p = p->pPrior;
|
|
}while( p!=0 );
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
|
|
#ifndef SQLITE_OMIT_WINDOWFUNC
|
|
/*
|
|
** Generate a description of starting or stopping bounds
|
|
*/
|
|
void sqlite3TreeViewBound(
|
|
TreeView *pView, /* View context */
|
|
u8 eBound, /* UNBOUNDED, CURRENT, PRECEDING, FOLLOWING */
|
|
Expr *pExpr, /* Value for PRECEDING or FOLLOWING */
|
|
u8 moreToFollow /* True if more to follow */
|
|
){
|
|
switch( eBound ){
|
|
case TK_UNBOUNDED: {
|
|
sqlite3TreeViewItem(pView, "UNBOUNDED", moreToFollow);
|
|
sqlite3TreeViewPop(pView);
|
|
break;
|
|
}
|
|
case TK_CURRENT: {
|
|
sqlite3TreeViewItem(pView, "CURRENT", moreToFollow);
|
|
sqlite3TreeViewPop(pView);
|
|
break;
|
|
}
|
|
case TK_PRECEDING: {
|
|
sqlite3TreeViewItem(pView, "PRECEDING", moreToFollow);
|
|
sqlite3TreeViewExpr(pView, pExpr, 0);
|
|
sqlite3TreeViewPop(pView);
|
|
break;
|
|
}
|
|
case TK_FOLLOWING: {
|
|
sqlite3TreeViewItem(pView, "FOLLOWING", moreToFollow);
|
|
sqlite3TreeViewExpr(pView, pExpr, 0);
|
|
sqlite3TreeViewPop(pView);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
#endif /* SQLITE_OMIT_WINDOWFUNC */
|
|
|
|
#ifndef SQLITE_OMIT_WINDOWFUNC
|
|
/*
|
|
** Generate a human-readable explanation for a Window object
|
|
*/
|
|
void sqlite3TreeViewWindow(TreeView *pView, const Window *pWin, u8 more){
|
|
int nElement = 0;
|
|
if( pWin->pFilter ){
|
|
sqlite3TreeViewItem(pView, "FILTER", 1);
|
|
sqlite3TreeViewExpr(pView, pWin->pFilter, 0);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
pView = sqlite3TreeViewPush(pView, more);
|
|
if( pWin->zName ){
|
|
sqlite3TreeViewLine(pView, "OVER %s (%p)", pWin->zName, pWin);
|
|
}else{
|
|
sqlite3TreeViewLine(pView, "OVER (%p)", pWin);
|
|
}
|
|
if( pWin->zBase ) nElement++;
|
|
if( pWin->pOrderBy ) nElement++;
|
|
if( pWin->eFrmType ) nElement++;
|
|
if( pWin->eExclude ) nElement++;
|
|
if( pWin->zBase ){
|
|
sqlite3TreeViewPush(pView, (--nElement)>0);
|
|
sqlite3TreeViewLine(pView, "window: %s", pWin->zBase);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
if( pWin->pPartition ){
|
|
sqlite3TreeViewExprList(pView, pWin->pPartition, nElement>0,"PARTITION-BY");
|
|
}
|
|
if( pWin->pOrderBy ){
|
|
sqlite3TreeViewExprList(pView, pWin->pOrderBy, (--nElement)>0, "ORDER-BY");
|
|
}
|
|
if( pWin->eFrmType ){
|
|
char zBuf[30];
|
|
const char *zFrmType = "ROWS";
|
|
if( pWin->eFrmType==TK_RANGE ) zFrmType = "RANGE";
|
|
if( pWin->eFrmType==TK_GROUPS ) zFrmType = "GROUPS";
|
|
sqlite3_snprintf(sizeof(zBuf),zBuf,"%s%s",zFrmType,
|
|
pWin->bImplicitFrame ? " (implied)" : "");
|
|
sqlite3TreeViewItem(pView, zBuf, (--nElement)>0);
|
|
sqlite3TreeViewBound(pView, pWin->eStart, pWin->pStart, 1);
|
|
sqlite3TreeViewBound(pView, pWin->eEnd, pWin->pEnd, 0);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
if( pWin->eExclude ){
|
|
char zBuf[30];
|
|
const char *zExclude;
|
|
switch( pWin->eExclude ){
|
|
case TK_NO: zExclude = "NO OTHERS"; break;
|
|
case TK_CURRENT: zExclude = "CURRENT ROW"; break;
|
|
case TK_GROUP: zExclude = "GROUP"; break;
|
|
case TK_TIES: zExclude = "TIES"; break;
|
|
default:
|
|
sqlite3_snprintf(sizeof(zBuf),zBuf,"invalid(%d)", pWin->eExclude);
|
|
zExclude = zBuf;
|
|
break;
|
|
}
|
|
sqlite3TreeViewPush(pView, 0);
|
|
sqlite3TreeViewLine(pView, "EXCLUDE %s", zExclude);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
#endif /* SQLITE_OMIT_WINDOWFUNC */
|
|
|
|
#ifndef SQLITE_OMIT_WINDOWFUNC
|
|
/*
|
|
** Generate a human-readable explanation for a Window Function object
|
|
*/
|
|
void sqlite3TreeViewWinFunc(TreeView *pView, const Window *pWin, u8 more){
|
|
pView = sqlite3TreeViewPush(pView, more);
|
|
sqlite3TreeViewLine(pView, "WINFUNC %s(%d)",
|
|
pWin->pWFunc->zName, pWin->pWFunc->nArg);
|
|
sqlite3TreeViewWindow(pView, pWin, 0);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
#endif /* SQLITE_OMIT_WINDOWFUNC */
|
|
|
|
/*
|
|
** Generate a human-readable explanation of an expression tree.
|
|
*/
|
|
void sqlite3TreeViewExpr(TreeView *pView, const Expr *pExpr, u8 moreToFollow){
|
|
const char *zBinOp = 0; /* Binary operator */
|
|
const char *zUniOp = 0; /* Unary operator */
|
|
char zFlgs[200];
|
|
pView = sqlite3TreeViewPush(pView, moreToFollow);
|
|
if( pExpr==0 ){
|
|
sqlite3TreeViewLine(pView, "nil");
|
|
sqlite3TreeViewPop(pView);
|
|
return;
|
|
}
|
|
if( pExpr->flags || pExpr->affExpr || pExpr->vvaFlags ){
|
|
StrAccum x;
|
|
sqlite3StrAccumInit(&x, 0, zFlgs, sizeof(zFlgs), 0);
|
|
sqlite3_str_appendf(&x, " fg.af=%x.%c",
|
|
pExpr->flags, pExpr->affExpr ? pExpr->affExpr : 'n');
|
|
if( ExprHasProperty(pExpr, EP_FromJoin) ){
|
|
sqlite3_str_appendf(&x, " iRJT=%d", pExpr->w.iRightJoinTable);
|
|
}
|
|
if( ExprHasProperty(pExpr, EP_FromDDL) ){
|
|
sqlite3_str_appendf(&x, " DDL");
|
|
}
|
|
if( ExprHasVVAProperty(pExpr, EP_Immutable) ){
|
|
sqlite3_str_appendf(&x, " IMMUTABLE");
|
|
}
|
|
sqlite3StrAccumFinish(&x);
|
|
}else{
|
|
zFlgs[0] = 0;
|
|
}
|
|
switch( pExpr->op ){
|
|
case TK_AGG_COLUMN: {
|
|
sqlite3TreeViewLine(pView, "AGG{%d:%d}%s",
|
|
pExpr->iTable, pExpr->iColumn, zFlgs);
|
|
break;
|
|
}
|
|
case TK_COLUMN: {
|
|
if( pExpr->iTable<0 ){
|
|
/* This only happens when coding check constraints */
|
|
char zOp2[16];
|
|
if( pExpr->op2 ){
|
|
sqlite3_snprintf(sizeof(zOp2),zOp2," op2=0x%02x",pExpr->op2);
|
|
}else{
|
|
zOp2[0] = 0;
|
|
}
|
|
sqlite3TreeViewLine(pView, "COLUMN(%d)%s%s",
|
|
pExpr->iColumn, zFlgs, zOp2);
|
|
}else{
|
|
assert( ExprUseYTab(pExpr) );
|
|
sqlite3TreeViewLine(pView, "{%d:%d} pTab=%p%s",
|
|
pExpr->iTable, pExpr->iColumn,
|
|
pExpr->y.pTab, zFlgs);
|
|
}
|
|
if( ExprHasProperty(pExpr, EP_FixedCol) ){
|
|
sqlite3TreeViewExpr(pView, pExpr->pLeft, 0);
|
|
}
|
|
break;
|
|
}
|
|
case TK_INTEGER: {
|
|
if( pExpr->flags & EP_IntValue ){
|
|
sqlite3TreeViewLine(pView, "%d", pExpr->u.iValue);
|
|
}else{
|
|
sqlite3TreeViewLine(pView, "%s", pExpr->u.zToken);
|
|
}
|
|
break;
|
|
}
|
|
#ifndef SQLITE_OMIT_FLOATING_POINT
|
|
case TK_FLOAT: {
|
|
assert( !ExprHasProperty(pExpr, EP_IntValue) );
|
|
sqlite3TreeViewLine(pView,"%s", pExpr->u.zToken);
|
|
break;
|
|
}
|
|
#endif
|
|
case TK_STRING: {
|
|
assert( !ExprHasProperty(pExpr, EP_IntValue) );
|
|
sqlite3TreeViewLine(pView,"%Q", pExpr->u.zToken);
|
|
break;
|
|
}
|
|
case TK_NULL: {
|
|
sqlite3TreeViewLine(pView,"NULL");
|
|
break;
|
|
}
|
|
case TK_TRUEFALSE: {
|
|
sqlite3TreeViewLine(pView,"%s%s",
|
|
sqlite3ExprTruthValue(pExpr) ? "TRUE" : "FALSE", zFlgs);
|
|
break;
|
|
}
|
|
#ifndef SQLITE_OMIT_BLOB_LITERAL
|
|
case TK_BLOB: {
|
|
assert( !ExprHasProperty(pExpr, EP_IntValue) );
|
|
sqlite3TreeViewLine(pView,"%s", pExpr->u.zToken);
|
|
break;
|
|
}
|
|
#endif
|
|
case TK_VARIABLE: {
|
|
assert( !ExprHasProperty(pExpr, EP_IntValue) );
|
|
sqlite3TreeViewLine(pView,"VARIABLE(%s,%d)",
|
|
pExpr->u.zToken, pExpr->iColumn);
|
|
break;
|
|
}
|
|
case TK_REGISTER: {
|
|
sqlite3TreeViewLine(pView,"REGISTER(%d)", pExpr->iTable);
|
|
break;
|
|
}
|
|
case TK_ID: {
|
|
assert( !ExprHasProperty(pExpr, EP_IntValue) );
|
|
sqlite3TreeViewLine(pView,"ID \"%w\"", pExpr->u.zToken);
|
|
break;
|
|
}
|
|
#ifndef SQLITE_OMIT_CAST
|
|
case TK_CAST: {
|
|
/* Expressions of the form: CAST(pLeft AS token) */
|
|
assert( !ExprHasProperty(pExpr, EP_IntValue) );
|
|
sqlite3TreeViewLine(pView,"CAST %Q", pExpr->u.zToken);
|
|
sqlite3TreeViewExpr(pView, pExpr->pLeft, 0);
|
|
break;
|
|
}
|
|
#endif /* SQLITE_OMIT_CAST */
|
|
case TK_LT: zBinOp = "LT"; break;
|
|
case TK_LE: zBinOp = "LE"; break;
|
|
case TK_GT: zBinOp = "GT"; break;
|
|
case TK_GE: zBinOp = "GE"; break;
|
|
case TK_NE: zBinOp = "NE"; break;
|
|
case TK_EQ: zBinOp = "EQ"; break;
|
|
case TK_IS: zBinOp = "IS"; break;
|
|
case TK_ISNOT: zBinOp = "ISNOT"; break;
|
|
case TK_AND: zBinOp = "AND"; break;
|
|
case TK_OR: zBinOp = "OR"; break;
|
|
case TK_PLUS: zBinOp = "ADD"; break;
|
|
case TK_STAR: zBinOp = "MUL"; break;
|
|
case TK_MINUS: zBinOp = "SUB"; break;
|
|
case TK_REM: zBinOp = "REM"; break;
|
|
case TK_BITAND: zBinOp = "BITAND"; break;
|
|
case TK_BITOR: zBinOp = "BITOR"; break;
|
|
case TK_SLASH: zBinOp = "DIV"; break;
|
|
case TK_LSHIFT: zBinOp = "LSHIFT"; break;
|
|
case TK_RSHIFT: zBinOp = "RSHIFT"; break;
|
|
case TK_CONCAT: zBinOp = "CONCAT"; break;
|
|
case TK_DOT: zBinOp = "DOT"; break;
|
|
case TK_LIMIT: zBinOp = "LIMIT"; break;
|
|
|
|
case TK_UMINUS: zUniOp = "UMINUS"; break;
|
|
case TK_UPLUS: zUniOp = "UPLUS"; break;
|
|
case TK_BITNOT: zUniOp = "BITNOT"; break;
|
|
case TK_NOT: zUniOp = "NOT"; break;
|
|
case TK_ISNULL: zUniOp = "ISNULL"; break;
|
|
case TK_NOTNULL: zUniOp = "NOTNULL"; break;
|
|
|
|
case TK_TRUTH: {
|
|
int x;
|
|
const char *azOp[] = {
|
|
"IS-FALSE", "IS-TRUE", "IS-NOT-FALSE", "IS-NOT-TRUE"
|
|
};
|
|
assert( pExpr->op2==TK_IS || pExpr->op2==TK_ISNOT );
|
|
assert( pExpr->pRight );
|
|
assert( sqlite3ExprSkipCollate(pExpr->pRight)->op==TK_TRUEFALSE );
|
|
x = (pExpr->op2==TK_ISNOT)*2 + sqlite3ExprTruthValue(pExpr->pRight);
|
|
zUniOp = azOp[x];
|
|
break;
|
|
}
|
|
|
|
case TK_SPAN: {
|
|
assert( !ExprHasProperty(pExpr, EP_IntValue) );
|
|
sqlite3TreeViewLine(pView, "SPAN %Q", pExpr->u.zToken);
|
|
sqlite3TreeViewExpr(pView, pExpr->pLeft, 0);
|
|
break;
|
|
}
|
|
|
|
case TK_COLLATE: {
|
|
/* COLLATE operators without the EP_Collate flag are intended to
|
|
** emulate collation associated with a table column. These show
|
|
** up in the treeview output as "SOFT-COLLATE". Explicit COLLATE
|
|
** operators that appear in the original SQL always have the
|
|
** EP_Collate bit set and appear in treeview output as just "COLLATE" */
|
|
assert( !ExprHasProperty(pExpr, EP_IntValue) );
|
|
sqlite3TreeViewLine(pView, "%sCOLLATE %Q%s",
|
|
!ExprHasProperty(pExpr, EP_Collate) ? "SOFT-" : "",
|
|
pExpr->u.zToken, zFlgs);
|
|
sqlite3TreeViewExpr(pView, pExpr->pLeft, 0);
|
|
break;
|
|
}
|
|
|
|
case TK_AGG_FUNCTION:
|
|
case TK_FUNCTION: {
|
|
ExprList *pFarg; /* List of function arguments */
|
|
Window *pWin;
|
|
if( ExprHasProperty(pExpr, EP_TokenOnly) ){
|
|
pFarg = 0;
|
|
pWin = 0;
|
|
}else{
|
|
assert( ExprUseXList(pExpr) );
|
|
pFarg = pExpr->x.pList;
|
|
#ifndef SQLITE_OMIT_WINDOWFUNC
|
|
pWin = ExprHasProperty(pExpr, EP_WinFunc) ? pExpr->y.pWin : 0;
|
|
#else
|
|
pWin = 0;
|
|
#endif
|
|
}
|
|
assert( !ExprHasProperty(pExpr, EP_IntValue) );
|
|
if( pExpr->op==TK_AGG_FUNCTION ){
|
|
sqlite3TreeViewLine(pView, "AGG_FUNCTION%d %Q%s agg=%d[%d]/%p",
|
|
pExpr->op2, pExpr->u.zToken, zFlgs,
|
|
pExpr->pAggInfo ? pExpr->pAggInfo->selId : 0,
|
|
pExpr->iAgg, pExpr->pAggInfo);
|
|
}else if( pExpr->op2!=0 ){
|
|
const char *zOp2;
|
|
char zBuf[8];
|
|
sqlite3_snprintf(sizeof(zBuf),zBuf,"0x%02x",pExpr->op2);
|
|
zOp2 = zBuf;
|
|
if( pExpr->op2==NC_IsCheck ) zOp2 = "NC_IsCheck";
|
|
if( pExpr->op2==NC_IdxExpr ) zOp2 = "NC_IdxExpr";
|
|
if( pExpr->op2==NC_PartIdx ) zOp2 = "NC_PartIdx";
|
|
if( pExpr->op2==NC_GenCol ) zOp2 = "NC_GenCol";
|
|
sqlite3TreeViewLine(pView, "FUNCTION %Q%s op2=%s",
|
|
pExpr->u.zToken, zFlgs, zOp2);
|
|
}else{
|
|
sqlite3TreeViewLine(pView, "FUNCTION %Q%s", pExpr->u.zToken, zFlgs);
|
|
}
|
|
if( pFarg ){
|
|
sqlite3TreeViewExprList(pView, pFarg, pWin!=0, 0);
|
|
}
|
|
#ifndef SQLITE_OMIT_WINDOWFUNC
|
|
if( pWin ){
|
|
sqlite3TreeViewWindow(pView, pWin, 0);
|
|
}
|
|
#endif
|
|
break;
|
|
}
|
|
#ifndef SQLITE_OMIT_SUBQUERY
|
|
case TK_EXISTS: {
|
|
assert( ExprUseXSelect(pExpr) );
|
|
sqlite3TreeViewLine(pView, "EXISTS-expr flags=0x%x", pExpr->flags);
|
|
sqlite3TreeViewSelect(pView, pExpr->x.pSelect, 0);
|
|
break;
|
|
}
|
|
case TK_SELECT: {
|
|
assert( ExprUseXSelect(pExpr) );
|
|
sqlite3TreeViewLine(pView, "subquery-expr flags=0x%x", pExpr->flags);
|
|
sqlite3TreeViewSelect(pView, pExpr->x.pSelect, 0);
|
|
break;
|
|
}
|
|
case TK_IN: {
|
|
sqlite3TreeViewLine(pView, "IN flags=0x%x", pExpr->flags);
|
|
sqlite3TreeViewExpr(pView, pExpr->pLeft, 1);
|
|
if( ExprUseXSelect(pExpr) ){
|
|
sqlite3TreeViewSelect(pView, pExpr->x.pSelect, 0);
|
|
}else{
|
|
sqlite3TreeViewExprList(pView, pExpr->x.pList, 0, 0);
|
|
}
|
|
break;
|
|
}
|
|
#endif /* SQLITE_OMIT_SUBQUERY */
|
|
|
|
/*
|
|
** x BETWEEN y AND z
|
|
**
|
|
** This is equivalent to
|
|
**
|
|
** x>=y AND x<=z
|
|
**
|
|
** X is stored in pExpr->pLeft.
|
|
** Y is stored in pExpr->pList->a[0].pExpr.
|
|
** Z is stored in pExpr->pList->a[1].pExpr.
|
|
*/
|
|
case TK_BETWEEN: {
|
|
const Expr *pX, *pY, *pZ;
|
|
pX = pExpr->pLeft;
|
|
assert( ExprUseXList(pExpr) );
|
|
assert( pExpr->x.pList->nExpr==2 );
|
|
pY = pExpr->x.pList->a[0].pExpr;
|
|
pZ = pExpr->x.pList->a[1].pExpr;
|
|
sqlite3TreeViewLine(pView, "BETWEEN");
|
|
sqlite3TreeViewExpr(pView, pX, 1);
|
|
sqlite3TreeViewExpr(pView, pY, 1);
|
|
sqlite3TreeViewExpr(pView, pZ, 0);
|
|
break;
|
|
}
|
|
case TK_TRIGGER: {
|
|
/* If the opcode is TK_TRIGGER, then the expression is a reference
|
|
** to a column in the new.* or old.* pseudo-tables available to
|
|
** trigger programs. In this case Expr.iTable is set to 1 for the
|
|
** new.* pseudo-table, or 0 for the old.* pseudo-table. Expr.iColumn
|
|
** is set to the column of the pseudo-table to read, or to -1 to
|
|
** read the rowid field.
|
|
*/
|
|
sqlite3TreeViewLine(pView, "%s(%d)",
|
|
pExpr->iTable ? "NEW" : "OLD", pExpr->iColumn);
|
|
break;
|
|
}
|
|
case TK_CASE: {
|
|
sqlite3TreeViewLine(pView, "CASE");
|
|
sqlite3TreeViewExpr(pView, pExpr->pLeft, 1);
|
|
assert( ExprUseXList(pExpr) );
|
|
sqlite3TreeViewExprList(pView, pExpr->x.pList, 0, 0);
|
|
break;
|
|
}
|
|
#ifndef SQLITE_OMIT_TRIGGER
|
|
case TK_RAISE: {
|
|
const char *zType = "unk";
|
|
switch( pExpr->affExpr ){
|
|
case OE_Rollback: zType = "rollback"; break;
|
|
case OE_Abort: zType = "abort"; break;
|
|
case OE_Fail: zType = "fail"; break;
|
|
case OE_Ignore: zType = "ignore"; break;
|
|
}
|
|
assert( !ExprHasProperty(pExpr, EP_IntValue) );
|
|
sqlite3TreeViewLine(pView, "RAISE %s(%Q)", zType, pExpr->u.zToken);
|
|
break;
|
|
}
|
|
#endif
|
|
case TK_MATCH: {
|
|
sqlite3TreeViewLine(pView, "MATCH {%d:%d}%s",
|
|
pExpr->iTable, pExpr->iColumn, zFlgs);
|
|
sqlite3TreeViewExpr(pView, pExpr->pRight, 0);
|
|
break;
|
|
}
|
|
case TK_VECTOR: {
|
|
char *z = sqlite3_mprintf("VECTOR%s",zFlgs);
|
|
assert( ExprUseXList(pExpr) );
|
|
sqlite3TreeViewBareExprList(pView, pExpr->x.pList, z);
|
|
sqlite3_free(z);
|
|
break;
|
|
}
|
|
case TK_SELECT_COLUMN: {
|
|
sqlite3TreeViewLine(pView, "SELECT-COLUMN %d of [0..%d]%s",
|
|
pExpr->iColumn, pExpr->iTable-1,
|
|
pExpr->pRight==pExpr->pLeft ? " (SELECT-owner)" : "");
|
|
assert( ExprUseXSelect(pExpr->pLeft) );
|
|
sqlite3TreeViewSelect(pView, pExpr->pLeft->x.pSelect, 0);
|
|
break;
|
|
}
|
|
case TK_IF_NULL_ROW: {
|
|
sqlite3TreeViewLine(pView, "IF-NULL-ROW %d", pExpr->iTable);
|
|
sqlite3TreeViewExpr(pView, pExpr->pLeft, 0);
|
|
break;
|
|
}
|
|
case TK_ERROR: {
|
|
Expr tmp;
|
|
sqlite3TreeViewLine(pView, "ERROR");
|
|
tmp = *pExpr;
|
|
tmp.op = pExpr->op2;
|
|
sqlite3TreeViewExpr(pView, &tmp, 0);
|
|
break;
|
|
}
|
|
case TK_ROW: {
|
|
if( pExpr->iColumn<=0 ){
|
|
sqlite3TreeViewLine(pView, "First FROM table rowid");
|
|
}else{
|
|
sqlite3TreeViewLine(pView, "First FROM table column %d",
|
|
pExpr->iColumn-1);
|
|
}
|
|
break;
|
|
}
|
|
default: {
|
|
sqlite3TreeViewLine(pView, "op=%d", pExpr->op);
|
|
break;
|
|
}
|
|
}
|
|
if( zBinOp ){
|
|
sqlite3TreeViewLine(pView, "%s%s", zBinOp, zFlgs);
|
|
sqlite3TreeViewExpr(pView, pExpr->pLeft, 1);
|
|
sqlite3TreeViewExpr(pView, pExpr->pRight, 0);
|
|
}else if( zUniOp ){
|
|
sqlite3TreeViewLine(pView, "%s%s", zUniOp, zFlgs);
|
|
sqlite3TreeViewExpr(pView, pExpr->pLeft, 0);
|
|
}
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
|
|
|
|
/*
|
|
** Generate a human-readable explanation of an expression list.
|
|
*/
|
|
void sqlite3TreeViewBareExprList(
|
|
TreeView *pView,
|
|
const ExprList *pList,
|
|
const char *zLabel
|
|
){
|
|
if( zLabel==0 || zLabel[0]==0 ) zLabel = "LIST";
|
|
if( pList==0 ){
|
|
sqlite3TreeViewLine(pView, "%s (empty)", zLabel);
|
|
}else{
|
|
int i;
|
|
sqlite3TreeViewLine(pView, "%s", zLabel);
|
|
for(i=0; i<pList->nExpr; i++){
|
|
int j = pList->a[i].u.x.iOrderByCol;
|
|
char *zName = pList->a[i].zEName;
|
|
int moreToFollow = i<pList->nExpr - 1;
|
|
if( pList->a[i].eEName!=ENAME_NAME ) zName = 0;
|
|
if( j || zName ){
|
|
sqlite3TreeViewPush(pView, moreToFollow);
|
|
moreToFollow = 0;
|
|
sqlite3TreeViewLine(pView, 0);
|
|
if( zName ){
|
|
fprintf(stdout, "AS %s ", zName);
|
|
}
|
|
if( j ){
|
|
fprintf(stdout, "iOrderByCol=%d", j);
|
|
}
|
|
fprintf(stdout, "\n");
|
|
fflush(stdout);
|
|
}
|
|
sqlite3TreeViewExpr(pView, pList->a[i].pExpr, moreToFollow);
|
|
if( j || zName ){
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
void sqlite3TreeViewExprList(
|
|
TreeView *pView,
|
|
const ExprList *pList,
|
|
u8 moreToFollow,
|
|
const char *zLabel
|
|
){
|
|
pView = sqlite3TreeViewPush(pView, moreToFollow);
|
|
sqlite3TreeViewBareExprList(pView, pList, zLabel);
|
|
sqlite3TreeViewPop(pView);
|
|
}
|
|
|
|
#endif /* SQLITE_DEBUG */
|