blob: 8cb092a6406f98f0f595a0f93ed1ba14259b6ab8 (
plain)
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
|
/********************* */
/*! \file matcher.h
** \verbatim
** Original author: Morgan Deters
** Major contributors: Andrew Reynolds
** Minor contributors (to current version): none
** This file is part of the CVC4 project.
** Copyright (c) 2009-2014 New York University and The University of Iowa
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief A class representing a type matcher
**
** A class representing a type matcher.
**/
#include "cvc4_private.h"
#ifndef __CVC4__MATCHER_H
#define __CVC4__MATCHER_H
#include <iosfwd>
#include <string>
#include <vector>
#include <map>
#include "base/cvc4_assert.h"
#include "expr/node.h"
#include "expr/type_node.h"
namespace CVC4 {
class Matcher {
private:
std::vector< TypeNode > d_types;
std::vector< TypeNode > d_match;
public:
Matcher(){}
Matcher( DatatypeType dt ){
addTypesFromDatatype( dt );
}
~Matcher(){}
void addTypesFromDatatype( DatatypeType dt ){
std::vector< Type > argTypes = dt.getParamTypes();
addTypes( argTypes );
Debug("typecheck-idt") << "instantiating matcher for " << dt << std::endl;
for(unsigned i = 0; i < argTypes.size(); ++i) {
if(dt.isParameterInstantiated(i)) {
Debug("typecheck-idt") << "++ instantiate param " << i << " : " << d_types[i] << std::endl;
d_match[i] = d_types[i];
}
}
}
void addType( Type t ){
d_types.push_back( TypeNode::fromType( t ) );
d_match.push_back( TypeNode::null() );
}
void addTypes( std::vector< Type > types ){
for( int i=0; i<(int)types.size(); i++ ){
addType( types[i] );
}
}
bool doMatching( TypeNode pattern, TypeNode tn ){
Debug("typecheck-idt") << "doMatching() : " << pattern << " : " << tn << std::endl;
std::vector< TypeNode >::iterator i = std::find( d_types.begin(), d_types.end(), pattern );
if( i!=d_types.end() ){
int index = i - d_types.begin();
if( !d_match[index].isNull() ){
Debug("typecheck-idt") << "check subtype " << tn << " " << d_match[index] << std::endl;
TypeNode tnn = TypeNode::leastCommonTypeNode( tn, d_match[index] );
//recognize subtype relation
if( !tnn.isNull() ){
d_match[index] = tnn;
return true;
}else{
return false;
}
}else{
d_match[ i - d_types.begin() ] = tn;
return true;
}
}else if( pattern==tn ){
return true;
}else if( pattern.getKind()!=tn.getKind() || pattern.getNumChildren()!=tn.getNumChildren() ){
return false;
}else{
for( int i=0; i<(int)pattern.getNumChildren(); i++ ){
if( !doMatching( pattern[i], tn[i] ) ){
return false;
}
}
return true;
}
}
TypeNode getMatch( unsigned int i ){ return d_match[i]; }
void getTypes( std::vector<Type>& types ) {
types.clear();
for( int i=0; i<(int)d_match.size(); i++ ){
types.push_back( d_types[i].toType() );
}
}
void getMatches( std::vector<Type>& types ) {
types.clear();
for( int i=0; i<(int)d_match.size(); i++ ){
if(d_match[i].isNull()) {
types.push_back( d_types[i].toType() );
} else {
types.push_back( d_match[i].toType() );
}
}
}
};/* class Matcher */
}/* CVC4 namespace */
#endif /* __CVC4__MATCHER_H */
|
