1/*
2 * Copyright (c) 2004-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Authors: Nathan Binkert
29 */
30
31#include "base/match.hh"
32
33#include "base/str.hh"
34
35using namespace std;
36
37ObjectMatch::ObjectMatch()
38{
39}
40
41ObjectMatch::ObjectMatch(const string &expr)
42{
43 setExpression(expr);
44}
45
46void
| 1/*
2 * Copyright (c) 2004-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Authors: Nathan Binkert
29 */
30
31#include "base/match.hh"
32
33#include "base/str.hh"
34
35using namespace std;
36
37ObjectMatch::ObjectMatch()
38{
39}
40
41ObjectMatch::ObjectMatch(const string &expr)
42{
43 setExpression(expr);
44}
45
46void
|
47ObjectMatch::setExpression(const string &expr)
48{
49 tokens.resize(1);
50 tokenize(tokens[0], expr, '.');
51}
52
53void
54ObjectMatch::setExpression(const vector<string> &expr)
55{
56 if (expr.empty()) {
57 tokens.resize(0);
58 } else {
59 tokens.resize(expr.size());
60 for (vector<string>::size_type i = 0; i < expr.size(); ++i)
61 tokenize(tokens[i], expr[i], '.');
62 }
63}
64
65/**
66 * @todo this should probably be changed to just use regular
67 * expression code
68 */
69bool
70ObjectMatch::domatch(const string &name) const
71{
72 vector<string> name_tokens;
73 tokenize(name_tokens, name, '.');
74 int ntsize = name_tokens.size();
75
76 int num_expr = tokens.size();
77 for (int i = 0; i < num_expr; ++i) {
78 const vector<string> &token = tokens[i];
79 int jstop = token.size();
80
81 bool match = true;
82 for (int j = 0; j < jstop; ++j) {
83 if (j >= ntsize)
84 break;
85
86 const string &var = token[j];
87 if (var != "*" && var != name_tokens[j]) {
88 match = false;
89 break;
90 }
91 }
92
93 if (match)
94 return true;
95 }
96
97 return false;
98}
99
| 53ObjectMatch::setExpression(const string &expr)
54{
55 tokens.resize(1);
56 tokenize(tokens[0], expr, '.');
57}
58
59void
60ObjectMatch::setExpression(const vector<string> &expr)
61{
62 if (expr.empty()) {
63 tokens.resize(0);
64 } else {
65 tokens.resize(expr.size());
66 for (vector<string>::size_type i = 0; i < expr.size(); ++i)
67 tokenize(tokens[i], expr[i], '.');
68 }
69}
70
71/**
72 * @todo this should probably be changed to just use regular
73 * expression code
74 */
75bool
76ObjectMatch::domatch(const string &name) const
77{
78 vector<string> name_tokens;
79 tokenize(name_tokens, name, '.');
80 int ntsize = name_tokens.size();
81
82 int num_expr = tokens.size();
83 for (int i = 0; i < num_expr; ++i) {
84 const vector<string> &token = tokens[i];
85 int jstop = token.size();
86
87 bool match = true;
88 for (int j = 0; j < jstop; ++j) {
89 if (j >= ntsize)
90 break;
91
92 const string &var = token[j];
93 if (var != "*" && var != name_tokens[j]) {
94 match = false;
95 break;
96 }
97 }
98
99 if (match)
100 return true;
101 }
102
103 return false;
104}
105
|