1 |
|
/****************************************************************************** |
2 |
|
* Top contributors (to current version): |
3 |
|
* Andrew Reynolds |
4 |
|
* |
5 |
|
* This file is part of the cvc5 project. |
6 |
|
* |
7 |
|
* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS |
8 |
|
* in the top-level source directory and their institutional affiliations. |
9 |
|
* All rights reserved. See the file COPYING in the top-level source |
10 |
|
* directory for licensing information. |
11 |
|
* **************************************************************************** |
12 |
|
* |
13 |
|
* Justification stack. |
14 |
|
*/ |
15 |
|
|
16 |
|
#include "decision/justify_stack.h" |
17 |
|
|
18 |
|
namespace cvc5 { |
19 |
|
namespace decision { |
20 |
|
|
21 |
7738 |
JustifyStack::JustifyStack(context::Context* c) |
22 |
7738 |
: d_context(c), d_current(c), d_stack(c), d_stackSizeValid(c, 0) |
23 |
|
{ |
24 |
7738 |
} |
25 |
7738 |
JustifyStack::~JustifyStack() {} |
26 |
|
|
27 |
6683384 |
void JustifyStack::reset(TNode curr) |
28 |
|
{ |
29 |
6683384 |
d_current = curr; |
30 |
6683384 |
d_stackSizeValid = 0; |
31 |
6683384 |
pushToStack(curr, prop::SAT_VALUE_TRUE); |
32 |
6683384 |
} |
33 |
6714883 |
void JustifyStack::clear() |
34 |
|
{ |
35 |
6714883 |
d_current = TNode::null(); |
36 |
6714883 |
d_stackSizeValid = 0; |
37 |
6714883 |
} |
38 |
|
|
39 |
2676241 |
size_t JustifyStack::size() const { return d_stackSizeValid.get(); } |
40 |
|
|
41 |
20645269 |
TNode JustifyStack::getCurrentAssertion() const { return d_current.get(); } |
42 |
14464596 |
bool JustifyStack::hasCurrentAssertion() const |
43 |
|
{ |
44 |
14464596 |
return !d_current.get().isNull(); |
45 |
|
} |
46 |
37950066 |
JustifyInfo* JustifyStack::getCurrent() |
47 |
|
{ |
48 |
37950066 |
if (d_stackSizeValid.get() == 0) |
49 |
|
{ |
50 |
6605051 |
return nullptr; |
51 |
|
} |
52 |
31345015 |
Assert(d_stack.size() >= d_stackSizeValid.get()); |
53 |
31345015 |
return d_stack[d_stackSizeValid.get() - 1].get(); |
54 |
|
} |
55 |
|
|
56 |
9359625 |
void JustifyStack::pushToStack(TNode n, prop::SatValue desiredVal) |
57 |
|
{ |
58 |
9359625 |
if (Trace.isOn("jh-stack")) |
59 |
|
{ |
60 |
|
for (size_t i = 0, ssize = d_stackSizeValid.get(); i < ssize; i++) |
61 |
|
{ |
62 |
|
Trace("jh-stack") << " "; |
63 |
|
} |
64 |
|
Trace("jh-stack") << "- " << n << " " << desiredVal << std::endl; |
65 |
|
} |
66 |
|
// note that n is possibly negated here |
67 |
9359625 |
JustifyInfo* ji = getOrAllocJustifyInfo(d_stackSizeValid.get()); |
68 |
9359625 |
ji->set(n, desiredVal); |
69 |
9359625 |
d_stackSizeValid = d_stackSizeValid + 1; |
70 |
9359625 |
} |
71 |
|
|
72 |
9117964 |
void JustifyStack::popStack() |
73 |
|
{ |
74 |
9117964 |
Assert(d_stackSizeValid.get() > 0); |
75 |
9117964 |
d_stackSizeValid = d_stackSizeValid - 1; |
76 |
9117964 |
} |
77 |
|
|
78 |
9359625 |
JustifyInfo* JustifyStack::getOrAllocJustifyInfo(size_t i) |
79 |
|
{ |
80 |
|
// don't request stack beyond the bound |
81 |
9359625 |
Assert(i <= d_stack.size()); |
82 |
9359625 |
if (i == d_stack.size()) |
83 |
|
{ |
84 |
196210 |
d_stack.push_back(std::make_shared<JustifyInfo>(d_context)); |
85 |
|
} |
86 |
9359625 |
return d_stack[i].get(); |
87 |
|
} |
88 |
|
|
89 |
|
} |
90 |
29337 |
} // namespace cvc5 |