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