forked from jimstevens2001/HybridSim
-
Notifications
You must be signed in to change notification settings - Fork 1
/
util.cpp
121 lines (102 loc) · 3.25 KB
/
util.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
/*********************************************************************************
* Copyright (c) 2010-2011,
* Jim Stevens, Paul Tschirhart, Ishwar Singh Bhati, Mu-Tien Chang, Peter Enns,
* Elliott Cooper-Balis, Paul Rosenfeld, Bruce Jacob
* University of Maryland
* Contact: jims [at] cs [dot] umd [dot] edu
* 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.
*
* 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 HOLDER 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.
*********************************************************************************/
#include "util.h"
void convert_uint64_t(uint64_t &var, string value, string infostring)
{
// Check that each character in value is a digit.
for(size_t i = 0; i < value.size(); i++)
{
if(!isdigit(value[i]))
{
cerr << "ERROR: Non-digit character found: " << infostring << " : " << value << "\n";
abort();
}
}
// Convert it
stringstream ss;
ss << value;
ss >> var;
}
string strip(string input, string chars)
{
size_t pos;
// Strip front.
pos = input.find_first_not_of(chars);
input.erase(0, pos);
// Strip back.
pos = input.find_last_not_of(chars);
input.erase(pos+1);
return input;
}
list<string> split(string input, string chars, size_t maxsplit)
{
list<string> ret;
string cur = input;
size_t pos = 0;
if (maxsplit == 0)
maxsplit = 1;
while (!cur.empty())
{
if (ret.size() == (maxsplit-1))
{
ret.push_back(cur);
return ret;
}
pos = cur.find_first_of(chars);
string tmp = cur.substr(0, pos);
ret.push_back(tmp);
if (pos == string::npos)
cur.erase();
else
{
// Skip ahead to the next non-split char
size_t new_pos = cur.find_first_not_of(chars, pos);
//cur.erase(0, pos+1);
cur.erase(0, new_pos);
}
}
// If not at npos, then there is still an extra empty string at the end.
if (pos != string::npos)
{
ret.push_back("");
}
return ret;
}
void confirm_directory_exists(string path)
{
string command_str = "test -e "+path+" || mkdir "+path;
const char * command = command_str.c_str();
int sys_done = system(command);
if (sys_done != 0)
{
cerr << "system command to confirm directory "+path+" exists has failed.";
abort();
}
}