diff options
author | Nathan Binkert <nate@binkert.org> | 2009-05-11 10:38:43 -0700 |
---|---|---|
committer | Nathan Binkert <nate@binkert.org> | 2009-05-11 10:38:43 -0700 |
commit | 2f30950143cc70bc42a3c8a4111d7cf8198ec881 (patch) | |
tree | 708f6c22edb3c6feb31dd82866c26623a5329580 /src/mem/gems_common/util.cc | |
parent | c70241810d4e4f523f173c1646b008dc40faad8e (diff) | |
download | gem5-2f30950143cc70bc42a3c8a4111d7cf8198ec881.tar.xz |
ruby: Import ruby and slicc from GEMS
We eventually plan to replace the m5 cache hierarchy with the GEMS
hierarchy, but for now we will make both live alongside eachother.
Diffstat (limited to 'src/mem/gems_common/util.cc')
-rw-r--r-- | src/mem/gems_common/util.cc | 109 |
1 files changed, 109 insertions, 0 deletions
diff --git a/src/mem/gems_common/util.cc b/src/mem/gems_common/util.cc new file mode 100644 index 000000000..c5b8f22b5 --- /dev/null +++ b/src/mem/gems_common/util.cc @@ -0,0 +1,109 @@ +/* + * Copyright (c) 1999-2005 Mark D. Hill and David A. Wood + * All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions are + * met: redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer; + * redistributions in binary form must reproduce the above copyright + * notice, this list of conditions and the following disclaimer in the + * documentation and/or other materials provided with the distribution; + * neither the name of the copyright holders nor the names of its + * contributors may be used to endorse or promote products derived from + * this software without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT + * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, + * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT + * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, + * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY + * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT + * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + */ + +/* + * $Id$ + */ + +#include "assert.h" +#include "util.hh" + +// Split a string into a head and tail strings on the specified +// character. Return the head and the string passed in is modified by +// removing the head, leaving just the tail. + +string string_split(string& str, char split_character) +{ + string head = ""; + string tail = ""; + + uint counter = 0; + while(counter < str.size()) { + if (str[counter] == split_character) { + counter++; + break; + } else { + head += str[counter]; + } + counter++; + } + + while(counter < str.size()) { + tail += str[counter]; + counter++; + } + str = tail; + return head; +} + +string bool_to_string(bool value) +{ + if (value) { + return "true"; + } else { + return "false"; + } +} + +string int_to_string(int n, bool zero_fill, int width) +{ + ostringstream sstr; + if(zero_fill) { + sstr << setw(width) << setfill('0') << n; + } else { + sstr << n; + } + string str = sstr.str(); + return str; +} + +float string_to_float(string& str) +{ + stringstream sstr(str); + float ret; + sstr >> ret; + return ret; +} + +// Log functions +int log_int(long long n) +{ + assert(n > 0); + int counter = 0; + while (n >= 2) { + counter++; + n = n>>(long long)(1); + } + return counter; +} + +bool is_power_of_2(long long n) +{ + return (n == ((long long)(1) << log_int(n))); +} + |