1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
//===--- NodeDumper.cpp - Swift Demangling Debug Dump Functions -----------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
#include "swift/Demangling/Demangle.h"
#include "swift/Demangling/Demangler.h"
#include <cstdio>
using namespace swift;
using namespace Demangle;
const char *Demangle::getNodeKindString(swift::Demangle::Node::Kind k) {
switch (k) {
#define NODE(ID) \
case Node::Kind::ID: \
return #ID;
#include "swift/Demangling/DemangleNodes.def"
}
return "Demangle::Node::Kind::???";
}
static void printNode(DemanglerPrinter &Out, const Node *node, unsigned depth) {
// Indent two spaces per depth.
for (unsigned i = 0; i < depth * 2; ++i) {
Out << ' ';
}
if (!node) {
Out << "<<NULL>>";
return;
}
Out << "kind=" << getNodeKindString(node->getKind());
if (node->hasText()) {
Out << ", text=\"" << node->getText() << '\"';
}
if (node->hasIndex()) {
Out << ", index=" << node->getIndex();
}
Out << '\n';
for (auto &child : *node) {
printNode(Out, child, depth + 1);
}
}
std::string Demangle::getNodeTreeAsString(NodePointer Root) {
DemanglerPrinter Printer;
printNode(Printer, Root, 0);
return std::move(Printer).str();
}
void swift::Demangle::Node::dump() {
std::string TreeStr = getNodeTreeAsString(this);
fputs(TreeStr.c_str(), stderr);
}
void Demangler::dump() {
for (unsigned Idx = 0; Idx < Substitutions.size(); ++Idx) {
fprintf(stderr, "Substitution[%c]:\n", Idx + 'A');
Substitutions[Idx]->dump();
fprintf(stderr, "\n");
}
for (unsigned Idx = 0; Idx < NodeStack.size(); ++Idx) {
fprintf(stderr, "NodeStack[%u]:\n", Idx);
NodeStack[Idx]->dump();
fprintf(stderr, "\n");
}
fprintf(stderr, "Position = %zd:\n%.*s\n%*s\n", Pos,
(int)Text.size(), Text.data(), (int)Pos + 1, "^");
}
|
