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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
//===-- PTree.cpp ---------------------------------------------------------===//
//
// The KLEE Symbolic Virtual Machine
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include "PTree.h"
#include "ExecutionState.h"
#include "klee/Expr/Expr.h"
#include "klee/Expr/ExprPPrinter.h"
#include "klee/Support/OptionCategories.h"
#include <bitset>
#include <vector>
using namespace klee;
using namespace llvm;
namespace {
cl::opt<bool>
CompressProcessTree("compress-process-tree",
cl::desc("Remove intermediate nodes in the process "
"tree whenever possible (default=false)"),
cl::init(false), cl::cat(MiscCat));
} // namespace
PTree::PTree(ExecutionState *initialState)
: root(PTreeNodePtr(new PTreeNode(nullptr, initialState))) {
initialState->ptreeNode = root.getPointer();
}
void PTree::attach(PTreeNode *node, ExecutionState *leftState,
ExecutionState *rightState, BranchType reason) {
assert(node && !node->left.getPointer() && !node->right.getPointer());
assert(node == rightState->ptreeNode &&
"Attach assumes the right state is the current state");
node->state = nullptr;
node->left = PTreeNodePtr(new PTreeNode(node, leftState));
// The current node inherits the tag
uint8_t currentNodeTag = root.getInt();
if (node->parent)
currentNodeTag = node->parent->left.getPointer() == node
? node->parent->left.getInt()
: node->parent->right.getInt();
node->right = PTreeNodePtr(new PTreeNode(node, rightState), currentNodeTag);
}
void PTree::remove(PTreeNode *n) {
assert(!n->left.getPointer() && !n->right.getPointer());
do {
PTreeNode *p = n->parent;
if (p) {
if (n == p->left.getPointer()) {
p->left = PTreeNodePtr(nullptr);
} else {
assert(n == p->right.getPointer());
p->right = PTreeNodePtr(nullptr);
}
}
delete n;
n = p;
} while (n && !n->left.getPointer() && !n->right.getPointer());
if (n && CompressProcessTree) {
// We're now at a node that has exactly one child; we've just deleted the
// other one. Eliminate the node and connect its child to the parent
// directly (if it's not the root).
PTreeNodePtr child = n->left.getPointer() ? n->left : n->right;
PTreeNode *parent = n->parent;
child.getPointer()->parent = parent;
if (!parent) {
// We're at the root.
root = child;
} else {
if (n == parent->left.getPointer()) {
parent->left = child;
} else {
assert(n == parent->right.getPointer());
parent->right = child;
}
}
delete n;
}
}
void PTree::dump(llvm::raw_ostream &os) {
ExprPPrinter *pp = ExprPPrinter::create(os);
pp->setNewline("\\l");
os << "digraph G {\n";
os << "\tsize=\"10,7.5\";\n";
os << "\tratio=fill;\n";
os << "\trotate=90;\n";
os << "\tcenter = \"true\";\n";
os << "\tnode [style=\"filled\",width=.1,height=.1,fontname=\"Terminus\"]\n";
os << "\tedge [arrowsize=.3]\n";
std::vector<const PTreeNode*> stack;
stack.push_back(root.getPointer());
while (!stack.empty()) {
const PTreeNode *n = stack.back();
stack.pop_back();
os << "\tn" << n << " [shape=diamond";
if (n->state)
os << ",fillcolor=green";
os << "];\n";
if (n->left.getPointer()) {
os << "\tn" << n << " -> n" << n->left.getPointer();
os << " [label=0b"
<< std::bitset<PtrBitCount>(n->left.getInt()).to_string() << "];\n";
stack.push_back(n->left.getPointer());
}
if (n->right.getPointer()) {
os << "\tn" << n << " -> n" << n->right.getPointer();
os << " [label=0b"
<< std::bitset<PtrBitCount>(n->right.getInt()).to_string() << "];\n";
stack.push_back(n->right.getPointer());
}
}
os << "}\n";
delete pp;
}
PTreeNode::PTreeNode(PTreeNode *parent, ExecutionState *state) : parent{parent}, state{state} {
state->ptreeNode = this;
left = PTreeNodePtr(nullptr);
right = PTreeNodePtr(nullptr);
}
|
