src/mem/gems_common/util.cc

   1 /*
   2  * Copyright (c) 1999-2005 Mark D. Hill and David A. Wood
   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 /*
  30  * $Id$
  31  */
  32
  33 #include <cassert>
  34
  35 #include "mem/gems_common/util.hh"
  36
  37 // Split a string into a head and tail strings on the specified
  38 // character.  Return the head and the string passed in is modified by
  39 // removing the head, leaving just the tail.
  40
  41 string string_split(string& str, char split_character)
  42 {
  43   string head = "";
  44   string tail = "";
  45
  46   uint counter = 0;
  47   while(counter < str.size()) {
  48     if (str[counter] == split_character) {
  49       counter++;
  50       break;
  51     } else {
  52       head += str[counter];
  53     }
  54     counter++;
  55   }
  56
  57   while(counter < str.size()) {
  58     tail += str[counter];
  59     counter++;
  60   }
  61   str = tail;
  62   return head;
  63 }
  64
  65 string bool_to_string(bool value)
  66 {
  67   if (value) {
  68     return "true";
  69   } else {
  70     return "false";
  71   }
  72 }
  73
  74 string int_to_string(int n, bool zero_fill, int width)
  75 {
  76   ostringstream sstr;
  77   if(zero_fill) {
  78     sstr << setw(width) << setfill('0') << n;
  79   } else {
  80     sstr << n;
  81   }
  82   string str = sstr.str();
  83   return str;
  84 }
  85
  86 float string_to_float(string& str)
  87 {
  88   stringstream sstr(str);
  89   float ret;
  90   sstr >> ret;
  91   return ret;
  92 }
  93
  94 bool string_to_bool(const string & str)
  95 {
  96   string lower(str);
  97   for (size_t i=0;i<str.length();i++)
  98     lower[i] = tolower(str[i]);
  99   if (lower == "true")
 100     return true;
 101   else if (lower == "false")
 102     return false;
 103   else
 104     assert(0);
 105
 106   return false;
 107 }
 108
 109 // Log functions
 110 int log_int(long long n)
 111 {
 112   assert(n > 0);
 113   int counter = 0;
 114   while (n >= 2) {
 115     counter++;
 116     n = n>>(long long)(1);
 117   }
 118   return counter;
 119 }
 120
 121 bool is_power_of_2(long long n)
 122 {
 123   return (n == ((long long)(1) << log_int(n)));
 124 }
 125