1 |
|
/****************************************************************************** |
2 |
|
* Top contributors (to current version): |
3 |
|
* Andrew Reynolds, Mathias Preiner, Morgan Deters |
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 |
|
* Implementation of a class representing a type matcher. |
14 |
|
*/ |
15 |
|
|
16 |
|
#include "type_matcher.h" |
17 |
|
|
18 |
|
namespace cvc5 { |
19 |
|
|
20 |
1242 |
TypeMatcher::TypeMatcher(TypeNode dt) |
21 |
|
{ |
22 |
1242 |
Assert(dt.isDatatype()); |
23 |
1242 |
addTypesFromDatatype(dt); |
24 |
1242 |
} |
25 |
|
|
26 |
1321 |
void TypeMatcher::addTypesFromDatatype(TypeNode dt) |
27 |
|
{ |
28 |
2642 |
std::vector<TypeNode> argTypes = dt.getParamTypes(); |
29 |
1321 |
addTypes(argTypes); |
30 |
1321 |
Debug("typecheck-idt") << "instantiating matcher for " << dt << std::endl; |
31 |
2969 |
for (unsigned i = 0, narg = argTypes.size(); i < narg; ++i) |
32 |
|
{ |
33 |
1648 |
if (dt.isParameterInstantiatedDatatype(i)) |
34 |
|
{ |
35 |
514 |
Debug("typecheck-idt") |
36 |
257 |
<< "++ instantiate param " << i << " : " << d_types[i] << std::endl; |
37 |
257 |
d_match[i] = d_types[i]; |
38 |
|
} |
39 |
|
} |
40 |
1321 |
} |
41 |
|
|
42 |
1648 |
void TypeMatcher::addType(TypeNode t) |
43 |
|
{ |
44 |
1648 |
d_types.push_back(t); |
45 |
1648 |
d_match.push_back(TypeNode::null()); |
46 |
1648 |
} |
47 |
|
|
48 |
1321 |
void TypeMatcher::addTypes(const std::vector<TypeNode>& types) |
49 |
|
{ |
50 |
2969 |
for (const TypeNode& t : types) |
51 |
|
{ |
52 |
1648 |
addType(t); |
53 |
|
} |
54 |
1321 |
} |
55 |
|
|
56 |
4081 |
bool TypeMatcher::doMatching(TypeNode pattern, TypeNode tn) |
57 |
|
{ |
58 |
8162 |
Debug("typecheck-idt") << "doMatching() : " << pattern << " : " << tn |
59 |
4081 |
<< std::endl; |
60 |
|
std::vector<TypeNode>::iterator i = |
61 |
4081 |
std::find(d_types.begin(), d_types.end(), pattern); |
62 |
4081 |
if (i != d_types.end()) |
63 |
|
{ |
64 |
1631 |
size_t index = i - d_types.begin(); |
65 |
1631 |
if (!d_match[index].isNull()) |
66 |
|
{ |
67 |
596 |
Debug("typecheck-idt") |
68 |
298 |
<< "check subtype " << tn << " " << d_match[index] << std::endl; |
69 |
596 |
TypeNode tnn = TypeNode::leastCommonTypeNode(tn, d_match[index]); |
70 |
|
// recognize subtype relation |
71 |
298 |
if (!tnn.isNull()) |
72 |
|
{ |
73 |
298 |
d_match[index] = tnn; |
74 |
298 |
return true; |
75 |
|
} |
76 |
|
return false; |
77 |
|
} |
78 |
1333 |
d_match[index] = tn; |
79 |
1333 |
return true; |
80 |
|
} |
81 |
2450 |
else if (pattern == tn) |
82 |
|
{ |
83 |
1258 |
return true; |
84 |
|
} |
85 |
2384 |
else if (pattern.getKind() != tn.getKind() |
86 |
1192 |
|| pattern.getNumChildren() != tn.getNumChildren()) |
87 |
|
{ |
88 |
27 |
return false; |
89 |
|
} |
90 |
1165 |
else if (pattern.getNumChildren() == 0) |
91 |
|
{ |
92 |
|
// fail if the type parameter or type constructors are different |
93 |
|
return pattern == tn; |
94 |
|
} |
95 |
3783 |
for (size_t j = 0, nchild = pattern.getNumChildren(); j < nchild; j++) |
96 |
|
{ |
97 |
2618 |
if (!doMatching(pattern[j], tn[j])) |
98 |
|
{ |
99 |
|
return false; |
100 |
|
} |
101 |
|
} |
102 |
1165 |
return true; |
103 |
|
} |
104 |
|
|
105 |
371 |
void TypeMatcher::getTypes(std::vector<TypeNode>& types) const |
106 |
|
{ |
107 |
371 |
types.clear(); |
108 |
884 |
for (const TypeNode& t : d_types) |
109 |
|
{ |
110 |
513 |
types.push_back(t); |
111 |
|
} |
112 |
371 |
} |
113 |
1126 |
void TypeMatcher::getMatches(std::vector<TypeNode>& types) const |
114 |
|
{ |
115 |
1126 |
types.clear(); |
116 |
2529 |
for (size_t i = 0, nmatch = d_match.size(); i < nmatch; i++) |
117 |
|
{ |
118 |
1403 |
if (d_match[i].isNull()) |
119 |
|
{ |
120 |
25 |
types.push_back(d_types[i]); |
121 |
|
} |
122 |
|
else |
123 |
|
{ |
124 |
1378 |
types.push_back(d_match[i]); |
125 |
|
} |
126 |
|
} |
127 |
1126 |
} |
128 |
|
|
129 |
22746 |
} // namespace cvc5 |