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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
/********************* */
/*! \file term_registration_visitor.h
** \verbatim
** Original author: Dejan Jovanović <dejan.jovanovic@gmail.com>
** Major contributors: none
** Minor contributors (to current version): Morgan Deters <mdeters@cs.nyu.edu>
** This file is part of the CVC4 project.
** Copyright (c) 2009-2013 New York University and The University of Iowa
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include "cvc4_private.h"
#pragma once
#include "context/context.h"
#include "theory/shared_terms_database.h"
#include <ext/hash_map>
namespace CVC4 {
class TheoryEngine;
/**
* Visitor that calls the appropriate theory to pre-register the term. The visitor also keeps track
* of the sets of theories that are involved in the terms, so that it can say if there are multiple
* theories involved.
*
* A sub-term has been visited if the theories of both the parent and the term itself have already
* visited this term.
*
* Computation of the set of theories in the original term are computed in the alreadyVisited method
* so as no to skip any theories.
*/
class PreRegisterVisitor {
/** The engine */
TheoryEngine* d_engine;
typedef context::CDHashMap<TNode, theory::Theory::Set, TNodeHashFunction> TNodeToTheorySetMap;
/**
* Map from terms to the theories that have already had this term pre-registered.
*/
TNodeToTheorySetMap d_visited;
/**
* A set of all theories in the term
*/
theory::Theory::Set d_theories;
/**
* Is true if the term we're traversing involves multiple theories.
*/
bool d_multipleTheories;
/**
* String representation of the visited map, for debugging purposes.
*/
std::string toString() const;
public:
/** Return type tells us if there are more than one theory or not */
typedef bool return_type;
PreRegisterVisitor(TheoryEngine* engine, context::Context* context)
: d_engine(engine)
, d_visited(context)
, d_theories(0)
, d_multipleTheories(false)
{}
/**
* Returns true is current has already been pre-registered with both current and parent theories.
*/
bool alreadyVisited(TNode current, TNode parent);
/**
* Pre-registeres current with any of the current and parent theories that haven't seen the term yet.
*/
void visit(TNode current, TNode parent);
/**
* Marks the node as the starting literal.
*/
void start(TNode node);
/**
* Notifies the engine of all the theories used.
*/
bool done(TNode node);
};
/**
* The reason why we need to make this outside of the pre-registration loop is because we need a shared term x to
* be associated with every atom that contains it. For example, if given f(x) >= 0 and f(x) + 1 >= 0, although f(x) has
* been visited already, we need to visit it again, since we need to associate it with both atoms.
*/
class SharedTermsVisitor {
/** The shared terms database */
SharedTermsDatabase& d_sharedTerms;
/**
* Cache from preprocessing of atoms.
*/
typedef std::hash_map<TNode, theory::Theory::Set, TNodeHashFunction> TNodeVisitedMap;
TNodeVisitedMap d_visited;
/**
* String representation of the visited map, for debugging purposes.
*/
std::string toString() const;
/**
* The initial atom.
*/
TNode d_atom;
public:
typedef void return_type;
SharedTermsVisitor(SharedTermsDatabase& sharedTerms)
: d_sharedTerms(sharedTerms) {}
/**
* Returns true is current has already been pre-registered with both current and parent theories.
*/
bool alreadyVisited(TNode current, TNode parent) const;
/**
* Pre-registeres current with any of the current and parent theories that haven't seen the term yet.
*/
void visit(TNode current, TNode parent);
/**
* Marks the node as the starting literal.
*/
void start(TNode node);
/**
* Just clears the state.
*/
void done(TNode node);
/**
* Clears the internal state.
*/
void clear();
};
}
|
