/
StrIntUtils.cpp
364 lines (330 loc) · 8.54 KB
/
StrIntUtils.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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
/*
* Phusion Passenger - http://www.modrails.com/
* Copyright (c) 2010 Phusion
*
* "Phusion Passenger" is a trademark of Hongli Lai & Ninh Bui.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <Utils/utf8.h>
#include <Exceptions.h>
#include <Utils/StrIntUtils.h>
namespace Passenger {
string
fillInMiddle(unsigned int max, const string &prefix, const string &middle, const string &postfix) {
if (max <= prefix.size() + postfix.size()) {
throw ArgumentException("Impossible to build string with the given size constraint.");
}
unsigned int fillSize = max - (prefix.size() + postfix.size());
if (fillSize > middle.size()) {
return prefix + middle + postfix;
} else {
return prefix + middle.substr(0, fillSize) + postfix;
}
}
bool
startsWith(const StaticString &str, const StaticString &substr) {
if (str.size() >= substr.size()) {
return memcmp(str.c_str(), substr.c_str(), substr.size()) == 0;
} else {
return false;
}
}
void
split(const string &str, char sep, vector<string> &output) {
string::size_type start, pos;
start = 0;
output.clear();
while ((pos = str.find(sep, start)) != string::npos) {
output.push_back(str.substr(start, pos - start));
start = pos + 1;
}
output.push_back(str.substr(start));
}
string toString(const vector<string> &vec) {
vector<StaticString> vec2;
vec2.reserve(vec.size());
for (vector<string>::const_iterator it = vec.begin(); it != vec.end(); it++) {
vec2.push_back(*it);
}
return toString(vec2);
}
string toString(const vector<StaticString> &vec) {
string result = "[";
vector<StaticString>::const_iterator it;
unsigned int i;
for (it = vec.begin(), i = 0; it != vec.end(); it++, i++) {
result.append("'");
result.append(it->data(), it->size());
if (i == vec.size() - 1) {
result.append("'");
} else {
result.append("', ");
}
}
result.append("]");
return result;
}
string
pointerToIntString(void *pointer) {
// Use wierd union construction to avoid compiler warnings.
if (sizeof(void *) == sizeof(unsigned int)) {
union {
void *pointer;
unsigned int value;
} u;
u.pointer = pointer;
return toString(u.value);
} else if (sizeof(void *) == sizeof(unsigned long long)) {
union {
void *pointer;
unsigned long long value;
} u;
u.pointer = pointer;
return toString(u.value);
} else {
fprintf(stderr, "Pointer size unsupported...\n");
abort();
}
}
unsigned long long
stringToULL(const StaticString &str) {
unsigned long long result = 0;
string::size_type i = 0;
const char *data = str.data();
while (data[i] == ' ' && i < str.size()) {
i++;
}
while (data[i] >= '0' && data[i] <= '9' && i < str.size()) {
result *= 10;
result += data[i] - '0';
i++;
}
return result;
}
long long
stringToLL(const StaticString &str) {
long long result = 0;
string::size_type i = 0;
const char *data = str.data();
bool minus = false;
while (data[i] == ' ' && i < str.size()) {
i++;
}
if (data[i] == '-') {
minus = true;
i++;
}
while (data[i] >= '0' && data[i] <= '9' && i < str.size()) {
result *= 10;
result += data[i] - '0';
i++;
}
if (minus) {
return -result;
} else {
return result;
}
}
unsigned long long
hexToULL(const StaticString &hex) {
unsigned long long result = 0;
string::size_type i = 0;
bool done = false;
while (i < hex.size() && !done) {
char c = hex[i];
if (c >= '0' && c <= '9') {
result *= 16;
result += c - '0';
} else if (c >= 'a' && c <= 'f') {
result *= 16;
result += 10 + (c - 'a');
} else if (c >= 'A' && c <= 'F') {
result *= 16;
result += 10 + (c - 'A');
} else {
done = true;
}
i++;
}
return result;
}
unsigned long long
hexatriToULL(const StaticString &str) {
unsigned long long result = 0;
string::size_type i = 0;
bool done = false;
while (i < str.size() && !done) {
char c = str[i];
if (c >= '0' && c <= '9') {
result *= 36;
result += c - '0';
} else if (c >= 'a' && c <= 'z') {
result *= 36;
result += 10 + (c - 'a');
} else if (c >= 'A' && c <= 'Z') {
result *= 36;
result += 10 + (c - 'A');
} else {
done = true;
}
i++;
}
return result;
}
string
toHex(const StaticString &data) {
string result(data.size() * 2, '\0');
toHex(data, (char *) result.data());
return result;
}
static const char hex_chars[] = {
'0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j',
'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't',
'u', 'v', 'w', 'x', 'y', 'z'
};
static const char upcase_hex_chars[] = {
'0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J',
'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T',
'U', 'V', 'W', 'X', 'Y', 'Z'
};
void
toHex(const StaticString &data, char *output, bool upperCase) {
const char *data_buf = data.c_str();
string::size_type i;
if (upperCase) {
for (i = 0; i < data.size(); i++) {
output[i * 2] = upcase_hex_chars[(unsigned char) data_buf[i] / 16];
output[i * 2 + 1] = upcase_hex_chars[(unsigned char) data_buf[i] % 16];
}
} else {
for (i = 0; i < data.size(); i++) {
output[i * 2] = hex_chars[(unsigned char) data_buf[i] / 16];
output[i * 2 + 1] = hex_chars[(unsigned char) data_buf[i] % 16];
}
}
}
string
integerToHex(long long value) {
char buf[sizeof(long long) * 2 + 1];
integerToHex(value, buf);
return string(buf);
}
string
integerToHexatri(long long value) {
char buf[sizeof(long long) * 2 + 1];
integerToHexatri(value, buf);
return string(buf);
}
int
atoi(const string &s) {
return ::atoi(s.c_str());
}
long
atol(const string &s) {
return ::atol(s.c_str());
}
string
cEscapeString(const StaticString &input) {
string result;
const char *current = input.c_str();
const char *end = current + input.size();
result.reserve(input.size());
while (current < end) {
char c = *current;
if (c >= 32 && c <= 126) {
// Printable ASCII.
result.append(1, c);
} else {
char buf[sizeof("\\xFF")];
switch (c) {
case '\0':
// Explicitly in hex format in order to avoid confusion
// with any '0' characters that come after this byte.
result.append("\\x00");
break;
case '\t':
result.append("\\t");
break;
case '\n':
result.append("\\n");
break;
case '\r':
result.append("\\r");
break;
case '\e':
result.append("\\e");
break;
default:
buf[0] = '\\';
buf[1] = 'x';
toHex(StaticString(current, 1), buf + 2, true);
buf[4] = '\0';
result.append(buf, sizeof(buf) - 1);
break;
}
}
current++;
}
return result;
}
string
escapeHTML(const StaticString &input) {
string result;
result.reserve((int) round(input.size() * 1.25));
const char *current = (const char *) input.c_str();
const char *end = current + input.size();
while (current < end) {
char ch = *current;
if (ch & 128) {
// Multibyte UTF-8 character.
const char *prev = current;
utf8::advance(current, 1, end);
result.append(prev, current - prev);
} else {
// ASCII character <= 127.
if (ch == '<') {
result.append("<");
} else if (ch == '>') {
result.append(">");
} else if (ch == '&') {
result.append("&");
} else if (ch == '"') {
result.append(""");
} else if (ch == '\'') {
result.append("'");
} else if (ch >= 0x21 || ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t') {
result.append(1, ch);
} else {
result.append("&#");
result.append(toString((int) ((unsigned char) ch)));
result.append(";");
}
current++;
}
}
return result;
}
} // namespace Passenger