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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
/********************* */
/*! \file array_info.h
** \verbatim
** Top contributors (to current version):
** Morgan Deters, Clark Barrett, Tim King
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief Contains additional classes to store context dependent information
** for each term of type array
**/
#include "cvc4_private.h"
#ifndef CVC4__THEORY__ARRAYS__ARRAY_INFO_H
#define CVC4__THEORY__ARRAYS__ARRAY_INFO_H
#include <iostream>
#include <map>
#include <tuple>
#include <unordered_map>
#include "context/backtrackable.h"
#include "context/cdlist.h"
#include "context/cdhashmap.h"
#include "expr/node.h"
#include "util/statistics_registry.h"
namespace CVC4 {
namespace theory {
namespace arrays {
typedef context::CDList<TNode> CTNodeList;
using RowLemmaType = std::tuple<TNode, TNode, TNode, TNode>;
struct RowLemmaTypeHashFunction {
size_t operator()(const RowLemmaType& q) const {
TNode n1, n2, n3, n4;
std::tie(n1, n2, n3, n4) = q;
return (size_t) (n1.getId()*0x9e3779b9 + n2.getId()*0x30000059 +
n3.getId()*0x60000005 + n4.getId()*0x07FFFFFF);
}
};/* struct RowLemmaTypeHashFunction */
void printList (CTNodeList* list);
void printList( List<TNode>* list);
bool inList(const CTNodeList* l, const TNode el);
/**
* Small class encapsulating the information
* in the map. It's a class and not a struct to
* call the destructor.
*/
class Info {
public:
context::CDO<bool> isNonLinear;
context::CDO<bool> rIntro1Applied;
context::CDO<TNode> modelRep;
context::CDO<TNode> constArr;
context::CDO<TNode> weakEquivPointer;
context::CDO<TNode> weakEquivIndex;
context::CDO<TNode> weakEquivSecondary;
context::CDO<TNode> weakEquivSecondaryReason;
CTNodeList* indices;
CTNodeList* stores;
CTNodeList* in_stores;
Info(context::Context* c, Backtracker<TNode>* bck);
~Info();
/**
* prints the information
*/
void print() const {
Assert(indices != NULL && stores != NULL && in_stores != NULL);
Trace("arrays-info")<<" indices ";
printList(indices);
Trace("arrays-info")<<" stores ";
printList(stores);
Trace("arrays-info")<<" in_stores ";
printList(in_stores);
}
};/* class Info */
typedef std::unordered_map<Node, Info*, NodeHashFunction> CNodeInfoMap;
/**
* Class keeping track of the following information for canonical
* representatives of type array [a] :
* indices at which it is being read (all i for which there is a
* term of the form SELECT a i)
* all store terms in the congruence class
* stores in which it appears (terms of the form STORE a _ _ )
*
*/
class ArrayInfo {
private:
context::Context* ct;
Backtracker<TNode>* bck;
CNodeInfoMap info_map;
CTNodeList* emptyList;
/* == STATISTICS == */
/** time spent in preregisterTerm() */
TimerStat d_mergeInfoTimer;
AverageStat d_avgIndexListLength;
AverageStat d_avgStoresListLength;
AverageStat d_avgInStoresListLength;
IntStat d_listsCount;
IntStat d_callsMergeInfo;
IntStat d_maxList;
SizeStat<CNodeInfoMap > d_tableSize;
/**
* checks if a certain element is in the list l
* FIXME: better way to check for duplicates?
*/
/**
* helper method that merges two lists into the first
* without adding duplicates
*/
void mergeLists(CTNodeList* la, const CTNodeList* lb) const;
public:
const Info* emptyInfo;
/*
ArrayInfo(): ct(NULl), info
d_mergeInfoTimer("theory::arrays::mergeInfoTimer"),
d_avgIndexListLength("theory::arrays::avgIndexListLength"),
d_avgStoresListLength("theory::arrays::avgStoresListLength"),
d_avgInStoresListLength("theory::arrays::avgInStoresListLength"),
d_listsCount("theory::arrays::listsCount",0),
d_callsMergeInfo("theory::arrays::callsMergeInfo",0),
d_maxList("theory::arrays::maxList",0),
d_tableSize("theory::arrays::infoTableSize", info_map) {
currentStatisticsRegistry()->registerStat(&d_mergeInfoTimer);
currentStatisticsRegistry()->registerStat(&d_avgIndexListLength);
currentStatisticsRegistry()->registerStat(&d_avgStoresListLength);
currentStatisticsRegistry()->registerStat(&d_avgInStoresListLength);
currentStatisticsRegistry()->registerStat(&d_listsCount);
currentStatisticsRegistry()->registerStat(&d_callsMergeInfo);
currentStatisticsRegistry()->registerStat(&d_maxList);
currentStatisticsRegistry()->registerStat(&d_tableSize);
}*/
ArrayInfo(context::Context* c, Backtracker<TNode>* b, std::string statisticsPrefix = "");
~ArrayInfo();
/**
* adds the node a to the map if it does not exist
* and it initializes the info. checks for duplicate i's
*/
void addIndex(const Node a, const TNode i);
void addStore(const Node a, const TNode st);
void addInStore(const TNode a, const TNode st);
void setNonLinear(const TNode a);
void setRIntro1Applied(const TNode a);
void setModelRep(const TNode a, const TNode rep);
void setConstArr(const TNode a, const TNode constArr);
void setWeakEquivPointer(const TNode a, const TNode pointer);
void setWeakEquivIndex(const TNode a, const TNode index);
void setWeakEquivSecondary(const TNode a, const TNode secondary);
void setWeakEquivSecondaryReason(const TNode a, const TNode reason);
/**
* Returns the information associated with TNode a
*/
const Info* getInfo(const TNode a) const;
const bool isNonLinear(const TNode a) const;
const bool rIntro1Applied(const TNode a) const;
const TNode getModelRep(const TNode a) const;
const TNode getConstArr(const TNode a) const;
const TNode getWeakEquivPointer(const TNode a) const;
const TNode getWeakEquivIndex(const TNode a) const;
const TNode getWeakEquivSecondary(const TNode a) const;
const TNode getWeakEquivSecondaryReason(const TNode a) const;
const CTNodeList* getIndices(const TNode a) const;
const CTNodeList* getStores(const TNode a) const;
const CTNodeList* getInStores(const TNode a) const;
/**
* merges the information of nodes a and b
* the nodes do not have to actually be in the map.
* pre-condition
* a should be the canonical representative of b
*/
void mergeInfo(const TNode a, const TNode b);
};/* class ArrayInfo */
}/* CVC4::theory::arrays namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */
#endif /* CVC4__THEORY__ARRAYS__ARRAY_INFO_H */
|
