forked from OSchip/llvm-project
552 lines
15 KiB
C++
552 lines
15 KiB
C++
//===--- StmtDumper.cpp - Dumping implementation for Stmt ASTs ------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file was developed by Chris Lattner and is distributed under
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements the Stmt::dump/Stmt::print methods, which dump out the
|
|
// AST in a form that exposes type details and other fields.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "clang/AST/StmtVisitor.h"
|
|
#include "clang/AST/Decl.h"
|
|
#include "clang/AST/ExprCXX.h"
|
|
#include "clang/Lex/IdentifierTable.h"
|
|
#include "llvm/Support/Compiler.h"
|
|
#include <cstdio>
|
|
using namespace clang;
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// StmtDumper Visitor
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
namespace {
|
|
class VISIBILITY_HIDDEN StmtDumper : public StmtVisitor<StmtDumper> {
|
|
FILE *F;
|
|
unsigned IndentLevel;
|
|
|
|
/// MaxDepth - When doing a normal dump (not dumpAll) we only want to dump
|
|
/// the first few levels of an AST. This keeps track of how many ast levels
|
|
/// are left.
|
|
unsigned MaxDepth;
|
|
public:
|
|
StmtDumper(FILE *f, unsigned maxDepth)
|
|
: F(f), IndentLevel(0), MaxDepth(maxDepth) {}
|
|
|
|
void DumpSubTree(Stmt *S) {
|
|
// Prune the recursion if not using dump all.
|
|
if (MaxDepth == 0) return;
|
|
|
|
++IndentLevel;
|
|
if (S) {
|
|
Visit(S);
|
|
} else {
|
|
Indent();
|
|
fprintf(F, "<<<NULL>>>\n");
|
|
}
|
|
--IndentLevel;
|
|
}
|
|
|
|
void DumpDeclarator(Decl *D);
|
|
|
|
void Indent() const {
|
|
for (int i = 0, e = IndentLevel; i < e; ++i)
|
|
fprintf(F, " ");
|
|
}
|
|
|
|
void DumpType(QualType T) const {
|
|
fprintf(F, "'%s'", T.getAsString().c_str());
|
|
|
|
// If the type is directly a typedef, strip off typedefness to give at
|
|
// least one level of concreteness.
|
|
if (TypedefType *TDT = dyn_cast<TypedefType>(T))
|
|
fprintf(F, ":'%s'", TDT->LookThroughTypedefs().getAsString().c_str());
|
|
}
|
|
|
|
void DumpStmt(const Stmt *Node) const {
|
|
Indent();
|
|
fprintf(F, "(%s %p", Node->getStmtClassName(), (void*)Node);
|
|
}
|
|
|
|
void DumpExpr(Expr *Node) const {
|
|
DumpStmt(Node);
|
|
fprintf(F, " ");
|
|
DumpType(Node->getType());
|
|
}
|
|
|
|
void VisitStmt(Stmt *Node);
|
|
#define STMT(N, CLASS, PARENT) \
|
|
void Visit##CLASS(CLASS *Node);
|
|
#include "clang/AST/StmtNodes.def"
|
|
};
|
|
}
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// Stmt printing methods.
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
void StmtDumper::VisitStmt(Stmt *Node) {
|
|
Indent();
|
|
fprintf(F, "<<unknown stmt type>>\n");
|
|
}
|
|
|
|
void StmtDumper::DumpDeclarator(Decl *D) {
|
|
// FIXME: Need to complete/beautify this... this code simply shows the
|
|
// nodes are where they need to be.
|
|
if (TypedefDecl *localType = dyn_cast<TypedefDecl>(D)) {
|
|
fprintf(F, "\"typedef %s %s\"",
|
|
localType->getUnderlyingType().getAsString().c_str(),
|
|
localType->getName());
|
|
} else if (ValueDecl *VD = dyn_cast<ValueDecl>(D)) {
|
|
fprintf(F, "\"");
|
|
// Emit storage class for vardecls.
|
|
if (VarDecl *V = dyn_cast<VarDecl>(VD)) {
|
|
switch (V->getStorageClass()) {
|
|
default: assert(0 && "Unknown storage class!");
|
|
case VarDecl::None: break;
|
|
case VarDecl::Extern: fprintf(F, "extern "); break;
|
|
case VarDecl::Static: fprintf(F, "static "); break;
|
|
case VarDecl::Auto: fprintf(F, "auto "); break;
|
|
case VarDecl::Register: fprintf(F, "register "); break;
|
|
}
|
|
}
|
|
|
|
std::string Name = VD->getName();
|
|
VD->getType().getAsStringInternal(Name);
|
|
fprintf(F, "%s", Name.c_str());
|
|
|
|
// If this is a vardecl with an initializer, emit it.
|
|
if (VarDecl *V = dyn_cast<VarDecl>(VD)) {
|
|
if (V->getInit()) {
|
|
fprintf(F, " =\n");
|
|
DumpSubTree(V->getInit());
|
|
}
|
|
}
|
|
fprintf(F, "\"");
|
|
} else {
|
|
// FIXME: "struct x;"
|
|
assert(0 && "Unexpected decl");
|
|
}
|
|
}
|
|
|
|
|
|
void StmtDumper::VisitNullStmt(NullStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitDeclStmt(DeclStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, "\n");
|
|
for (Decl *D = Node->getDecl(); D; D = D->getNextDeclarator()) {
|
|
++IndentLevel;
|
|
Indent();
|
|
fprintf(F, "%p ", (void*)D);
|
|
DumpDeclarator(D);
|
|
if (D->getNextDeclarator())
|
|
fprintf(F, "\n");
|
|
--IndentLevel;
|
|
}
|
|
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitCompoundStmt(CompoundStmt *Node) {
|
|
DumpStmt(Node);
|
|
if (!Node->body_empty()) fprintf(F, "\n");
|
|
|
|
for (CompoundStmt::body_iterator I = Node->body_begin(), E = Node->body_end();
|
|
I != E; ) {
|
|
DumpSubTree(*I);
|
|
++I;
|
|
if (I != E)
|
|
fprintf(F, "\n");
|
|
}
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitCaseStmt(CaseStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getLHS());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getRHS());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getSubStmt());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitDefaultStmt(DefaultStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getSubStmt());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitLabelStmt(LabelStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, " '%s'\n", Node->getName());
|
|
DumpSubTree(Node->getSubStmt());
|
|
fprintf(F, "\n");
|
|
}
|
|
|
|
void StmtDumper::VisitIfStmt(IfStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getCond());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getThen());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getElse());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitSwitchStmt(SwitchStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getCond());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getBody());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitSwitchCase(SwitchCase*) {
|
|
assert(0 && "SwitchCase is an abstract class");
|
|
}
|
|
|
|
void StmtDumper::VisitWhileStmt(WhileStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getCond());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getBody());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitDoStmt(DoStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getBody());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getCond());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitForStmt(ForStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getInit());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getCond());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getInc());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getBody());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitGotoStmt(GotoStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, " '%s':%p)", Node->getLabel()->getName(), (void*)Node->getLabel());
|
|
}
|
|
|
|
void StmtDumper::VisitIndirectGotoStmt(IndirectGotoStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getTarget());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitContinueStmt(ContinueStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitBreakStmt(BreakStmt *Node) {
|
|
DumpStmt(Node);
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
|
|
void StmtDumper::VisitReturnStmt(ReturnStmt *Node) {
|
|
DumpStmt(Node);
|
|
if (Expr *RV = Node->getRetValue()) {
|
|
fprintf(F, "\n");
|
|
DumpSubTree(RV);
|
|
}
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// Expr printing methods.
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
void StmtDumper::VisitExpr(Expr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, ": UNKNOWN EXPR to StmtDumper)");
|
|
}
|
|
|
|
void StmtDumper::VisitDeclRefExpr(DeclRefExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " Decl='%s' %p)", Node->getDecl()->getName(),
|
|
(void*)Node->getDecl());
|
|
}
|
|
|
|
void StmtDumper::VisitPreDefinedExpr(PreDefinedExpr *Node) {
|
|
DumpExpr(Node);
|
|
switch (Node->getIdentType()) {
|
|
default:
|
|
assert(0 && "unknown case");
|
|
case PreDefinedExpr::Func:
|
|
fprintf(F, " __func__)");
|
|
break;
|
|
case PreDefinedExpr::Function:
|
|
fprintf(F, " __FUNCTION__)");
|
|
break;
|
|
case PreDefinedExpr::PrettyFunction:
|
|
fprintf(F, " __PRETTY_FUNCTION__)");
|
|
break;
|
|
}
|
|
}
|
|
|
|
void StmtDumper::VisitCharacterLiteral(CharacterLiteral *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " %d)", Node->getValue());
|
|
}
|
|
|
|
void StmtDumper::VisitIntegerLiteral(IntegerLiteral *Node) {
|
|
DumpExpr(Node);
|
|
|
|
bool isSigned = Node->getType()->isSignedIntegerType();
|
|
fprintf(F, " %s)", Node->getValue().toString(10, isSigned).c_str());
|
|
}
|
|
void StmtDumper::VisitFloatingLiteral(FloatingLiteral *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " %f)", Node->getValue());
|
|
}
|
|
|
|
void StmtDumper::VisitImaginaryLiteral(ImaginaryLiteral *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getSubExpr());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitStringLiteral(StringLiteral *Str) {
|
|
DumpExpr(Str);
|
|
// FIXME: this doesn't print wstrings right.
|
|
fprintf(F, " %s\"", Str->isWide() ? "L" : "");
|
|
|
|
for (unsigned i = 0, e = Str->getByteLength(); i != e; ++i) {
|
|
switch (char C = Str->getStrData()[i]) {
|
|
default:
|
|
if (isprint(C))
|
|
fputc(C, F);
|
|
else
|
|
fprintf(F, "\\%03o", C);
|
|
break;
|
|
// Handle some common ones to make dumps prettier.
|
|
case '\\': fprintf(F, "\\\\"); break;
|
|
case '"': fprintf(F, "\\\""); break;
|
|
case '\n': fprintf(F, "\\n"); break;
|
|
case '\t': fprintf(F, "\\t"); break;
|
|
case '\a': fprintf(F, "\\a"); break;
|
|
case '\b': fprintf(F, "\\b"); break;
|
|
}
|
|
}
|
|
fprintf(F, "\")");
|
|
}
|
|
void StmtDumper::VisitParenExpr(ParenExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getSubExpr());
|
|
fprintf(F, ")");
|
|
}
|
|
void StmtDumper::VisitUnaryOperator(UnaryOperator *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " %s '%s'\n", Node->isPostfix() ? "postfix" : "prefix",
|
|
UnaryOperator::getOpcodeStr(Node->getOpcode()));
|
|
DumpSubTree(Node->getSubExpr());
|
|
fprintf(F, ")");
|
|
}
|
|
void StmtDumper::VisitSizeOfAlignOfTypeExpr(SizeOfAlignOfTypeExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " %s ", Node->isSizeOf() ? "sizeof" : "alignof");
|
|
DumpType(Node->getArgumentType());
|
|
fprintf(F, ")");
|
|
}
|
|
void StmtDumper::VisitArraySubscriptExpr(ArraySubscriptExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getLHS());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getRHS());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitCallExpr(CallExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getCallee());
|
|
|
|
for (unsigned i = 0, e = Node->getNumArgs(); i != e; ++i) {
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getArg(i));
|
|
}
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitMemberExpr(MemberExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " %s%s %p\n", Node->isArrow() ? "->" : ".",
|
|
Node->getMemberDecl()->getName(), (void*)Node->getMemberDecl());
|
|
DumpSubTree(Node->getBase());
|
|
fprintf(F, ")");
|
|
}
|
|
void StmtDumper::VisitOCUVectorElementExpr(OCUVectorElementExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " %s\n", Node->getAccessor().getName());
|
|
DumpSubTree(Node->getBase());
|
|
fprintf(F, ")");
|
|
}
|
|
void StmtDumper::VisitCastExpr(CastExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getSubExpr());
|
|
fprintf(F, ")");
|
|
}
|
|
void StmtDumper::VisitCompoundLiteralExpr(CompoundLiteralExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getInitializer());
|
|
fprintf(F, ")");
|
|
}
|
|
void StmtDumper::VisitImplicitCastExpr(ImplicitCastExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getSubExpr());
|
|
fprintf(F, ")");
|
|
}
|
|
void StmtDumper::VisitBinaryOperator(BinaryOperator *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " '%s'\n", BinaryOperator::getOpcodeStr(Node->getOpcode()));
|
|
DumpSubTree(Node->getLHS());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getRHS());
|
|
fprintf(F, ")");
|
|
}
|
|
void StmtDumper::VisitCompoundAssignOperator(CompoundAssignOperator *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " '%s' ComputeTy=",
|
|
BinaryOperator::getOpcodeStr(Node->getOpcode()));
|
|
DumpType(Node->getComputationType());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getLHS());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getRHS());
|
|
fprintf(F, ")");
|
|
}
|
|
void StmtDumper::VisitConditionalOperator(ConditionalOperator *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getCond());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getLHS());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getRHS());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
// GNU extensions.
|
|
|
|
void StmtDumper::VisitAddrLabelExpr(AddrLabelExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " %s %p)", Node->getLabel()->getName(), (void*)Node->getLabel());
|
|
}
|
|
|
|
void StmtDumper::VisitStmtExpr(StmtExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getSubStmt());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitTypesCompatibleExpr(TypesCompatibleExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " ");
|
|
DumpType(Node->getArgType1());
|
|
fprintf(F, " ");
|
|
DumpType(Node->getArgType2());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitChooseExpr(ChooseExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getCond());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getLHS());
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getRHS());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// C++ Expressions
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
void StmtDumper::VisitCXXCastExpr(CXXCastExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " %s\n", CXXCastExpr::getOpcodeStr(Node->getOpcode()));
|
|
DumpSubTree(Node->getSubExpr());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitCXXBoolLiteralExpr(CXXBoolLiteralExpr *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, " %s)", Node->getValue() ? "true" : "false");
|
|
}
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// Obj-C Expressions
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
void StmtDumper::VisitObjCStringLiteral(ObjCStringLiteral *Node) {
|
|
DumpExpr(Node);
|
|
fprintf(F, "\n");
|
|
DumpSubTree(Node->getString());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
void StmtDumper::VisitObjCEncodeExpr(ObjCEncodeExpr *Node) {
|
|
DumpExpr(Node);
|
|
|
|
fprintf(F, " ");
|
|
DumpType(Node->getEncodedType());
|
|
fprintf(F, ")");
|
|
}
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// Stmt method implementations
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// dump - This does a local dump of the specified AST fragment. It dumps the
|
|
/// specified node and a few nodes underneath it, but not the whole subtree.
|
|
/// This is useful in a debugger.
|
|
void Stmt::dump() const {
|
|
StmtDumper P(stderr, 4);
|
|
P.Visit(const_cast<Stmt*>(this));
|
|
fprintf(stderr, "\n");
|
|
}
|
|
|
|
/// dumpAll - This does a dump of the specified AST fragment and all subtrees.
|
|
void Stmt::dumpAll() const {
|
|
StmtDumper P(stderr, ~0U);
|
|
P.Visit(const_cast<Stmt*>(this));
|
|
fprintf(stderr, "\n");
|
|
}
|