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
|
// This file is part of the AspectC++ compiler 'ac++'.
// Copyright (C) 1999-2003 The 'ac++' developers (see aspectc.org)
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; either version 2 of
// the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public
// License along with this program; if not, write to the Free
// Software Foundation, Inc., 59 Temple Place, Suite 330, Boston,
// MA 02111-1307 USA
#include "Puma/CTemplateInstance.h"
#include "Puma/CTemplateInfo.h"
#include "Puma/DeducedArgument.h"
#include "Puma/CConstant.h"
#include "MatchTemplateArg.h"
bool MatchTemplateArgList::matches (CTemplateInstance *instance) const {
unsigned deduced_args = instance->DeducedArgs ();
unsigned arg = 0;
for (const_iterator iter = begin (); iter != end (); ++iter) {
// check if the current template match arg is '...'
if ((*iter)->is_ellipses ())
return true;
// check if we have more match arguments than template arguments
if (arg + 1 > deduced_args)
return false;
// check if the current match argument matches the template argument
else if (!(*iter)->matches (instance->DeducedArg (arg)))
return false;
// go to the next argument
arg++;
}
// check if we have examined all deduced template arguments
if (arg != deduced_args)
return false;
// everything fine, the list matches!
return true;
}
bool MatchTemplateArgList::matches (MatchTemplateArgList &sig_mtal) const {
const_iterator iter = begin ();
const_iterator sig_iter = sig_mtal.begin ();
while (iter != end ()) {
// check if the current template match arg is '...'
if ((*iter)->is_ellipses ())
return true;
// check if we have more match arguments than template arguments
if (sig_iter == sig_mtal.end ())
return false;
// check if the current match argument matches the template argument
else if (!(*iter)->matches (*(*sig_iter)))
return false;
// go to the next argument
++iter;
++sig_iter;
}
// check if we have examined all deduced template arguments
if (sig_iter != sig_mtal.end ())
return false;
// everything fine, the list matches!
return true;
}
bool MTA_Type::matches (DeducedArgument *arg) const {
return arg->Type () && _match_type.matches (arg->Type ());
}
bool MTA_Type::matches (MatchTemplateArg &arg) const {
return arg.is_type () && _match_type.matches (((MTA_Type&)arg)._match_type);
}
bool MTA_Value::matches (DeducedArgument *arg) const {
// TODO: more kinds of values
CConstant *val = arg->Value ();
return val && (val->isSigned () || val->isUnsigned ()) &&
val->convert_to_int () == _val;
}
bool MTA_Value::matches (MatchTemplateArg &arg) const {
return arg.is_value () && _val == ((MTA_Value&)arg)._val;
}
|
