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
|
/********************* */
/** theory_engine.cpp
** Original author: mdeters
** Major contributors: none
** Minor contributors (to current version): none
** This file is part of the CVC4 prototype.
** Copyright (c) 2009, 2010 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** See the file COPYING in the top-level source directory for licensing
** information.
**
** The theory engine.
**/
#include "theory/theory_engine.h"
#include "expr/node.h"
#include "expr/attribute.h"
#include <list>
using namespace std;
namespace CVC4 {
namespace theory {
struct PreRegisteredTag {};
typedef expr::Attribute<PreRegisteredTag, bool> PreRegistered;
}/* CVC4::theory namespace */
Node TheoryEngine::preprocess(TNode t) {
Node top = rewrite(t);
Debug("rewrite") << "rewrote: " << t << "\nto : " << top << "\n";
return top;
list<TNode> toReg;
toReg.push_back(top);
/* Essentially this is doing a breadth-first numbering of
* non-registered subterms with children. Any non-registered
* leaves are immediately registered. */
for(list<TNode>::iterator workp = toReg.begin();
workp != toReg.end();
++workp) {
TNode n = *workp;
for(TNode::iterator i = n.begin(); i != n.end(); ++i) {
TNode c = *i;
if(!c.getAttribute(theory::PreRegistered())) {// c not yet registered
if(c.getNumChildren() == 0) {
c.setAttribute(theory::PreRegistered(), true);
theoryOf(c)->preRegisterTerm(c);
} else {
toReg.push_back(c);
}
}
}
}
/* Now register the list of terms in reverse order. Between this
* and the above registration of leaves, this should ensure that
* all subterms in the entire tree were registered in
* reverse-topological order. */
for(std::list<TNode>::reverse_iterator i = toReg.rbegin();
i != toReg.rend();
++i) {
TNode n = *i;
/* Note that a shared TNode in the DAG rooted at "fact" could
* appear twice on the list, so we have to avoid hitting it
* twice. */
// FIXME when ExprSets are online, use one of those to avoid
// duplicates in the above?
if(!n.getAttribute(theory::PreRegistered())) {
n.setAttribute(theory::PreRegistered(), true);
theoryOf(n)->preRegisterTerm(n);
}
}
return top;
}
Node TheoryEngine::rewrite(TNode in) {
if(inRewriteCache(in)) {
return getRewriteCache(in);
}
if(in.getKind() == kind::VARIABLE ||
in.getKind() == kind::SKOLEM) {
return in;
}
/*
theory::Theory* thy = theoryOf(in);
if(thy == NULL) {
Node out = rewriteBuiltins(in);
setRewriteCache(in, out);
return in;
} else {
Node out = thy->rewrite(in);
setRewriteCache(in, out);
return out;
}
*/
if(in.getKind() == kind::EQUAL) {
Assert(in.getNumChildren() == 2);
if(in[0] == in[1]) {
Node out = NodeManager::currentNM()->mkNode(kind::TRUE);
//setRewriteCache(in, out);
return out;
}
} else {
Node out = rewriteChildren(in);
//setRewriteCache(in, out);
return out;
}
//setRewriteCache(in, in);
return in;
}
}/* CVC4 namespace */
|
