blob: b1b6e9fc39b2b9c362731243ebac443e063d78ad (
plain) (
blame)
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
|
//===-- PTree.h -------------------------------------------------*- C++ -*-===//
//
// The KLEE Symbolic Virtual Machine
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#ifndef KLEE_PTREE_H
#define KLEE_PTREE_H
#include "klee/Expr/Expr.h"
#include "klee/Support/ErrorHandling.h"
#include "llvm/ADT/PointerIntPair.h"
namespace klee {
class ExecutionState;
class PTreeNode;
/* PTreeNodePtr is used by the Random Path Searcher object to efficiently
record which PTreeNode belongs to it. PTree is a global structure that
captures all states, whereas a Random Path Searcher might only care about
a subset. The integer part of PTreeNodePtr is a bitmask (a "tag") of which
Random Path Searchers PTreeNode belongs to. */
constexpr int PtrBitCount = 3;
using PTreeNodePtr = llvm::PointerIntPair<PTreeNode *, PtrBitCount, uint8_t>;
class PTreeNode {
public:
PTreeNode *parent = nullptr;
PTreeNodePtr left;
PTreeNodePtr right;
ExecutionState *state = nullptr;
PTreeNode(const PTreeNode&) = delete;
PTreeNode(PTreeNode *parent, ExecutionState *state);
~PTreeNode() = default;
};
class PTree {
// Number of registered ID
int registeredIds = 0;
public:
PTreeNodePtr root;
explicit PTree(ExecutionState *initialState);
~PTree() = default;
void attach(PTreeNode *node, ExecutionState *leftState,
ExecutionState *rightState);
static void remove(PTreeNode *node);
void dump(llvm::raw_ostream &os);
std::uint8_t getNextId() {
std::uint8_t id = 1 << registeredIds++;
if (registeredIds > PtrBitCount) {
klee_error("PTree cannot support more than %d RandomPathSearchers",
PtrBitCount);
}
return id;
}
};
}
#endif /* KLEE_PTREE_H */
|
