match.cc revision 2632:1bb2f91485ea 
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
29#include "base/match.hh"
30#include "base/str.hh"
31
32using namespace std;
33
34ObjectMatch::ObjectMatch()
35{
36}
37
38ObjectMatch::ObjectMatch(const string &expr)
39{
40    setExpression(expr);
41}
42
43void
44ObjectMatch::setExpression(const string &expr)
45{
46    tokens.resize(1);
47    tokenize(tokens[0], expr, '.');
48}
49
50void
51ObjectMatch::setExpression(const vector<string> &expr)
52{
53    if (expr.empty()) {
54        tokens.resize(0);
55    } else {
56        tokens.resize(expr.size());
57        for (int i = 0; i < expr.size(); ++i)
58            tokenize(tokens[i], expr[i], '.');
59    }
60}
61
62/**
63 * @todo this should probably be changed to just use regular
64 * expression code
65 */
66bool
67ObjectMatch::domatch(const string &name) const
68{
69    vector<string> name_tokens;
70    tokenize(name_tokens, name, '.');
71    int ntsize = name_tokens.size();
72
73    int num_expr = tokens.size();
74    for (int i = 0; i < num_expr; ++i) {
75        const vector<string> &token = tokens[i];
76        int jstop = token.size();
77
78        bool match = true;
79        for (int j = 0; j < jstop; ++j) {
80            if (j >= ntsize)
81                break;
82
83            const string &var = token[j];
84            if (var != "*" && var != name_tokens[j]) {
85                match = false;
86                break;
87            }
88        }
89
90        if (match == true)
91            return true;
92    }
93
94    return false;
95}
96
97