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
|
/*
* Copyright (c) 2000 Silicon Graphics, Inc. All Rights Reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it would be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*
* Further, this software is distributed without any warranty that it is
* free of the rightful claim of any third person regarding infringement
* or the like. Any license provided herein, whether implied or
* otherwise, applies only to this software file. Patent licenses, if
* any, provided herein do not apply to combinations of this program with
* other software, or any other product whatsoever.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write the Free Software Foundation, Inc., 59
* Temple Place - Suite 330, Boston MA 02111-1307, USA.
*
* Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
* Mountain View, CA 94043, or:
*
* http://www.sgi.com
*
* For further information regarding this notice, see:
*
* http://oss.sgi.com/projects/GenInfo/NoticeExplan/
*/
#include <stdio.h>
#include <sys/param.h>
#include "str_to_bytes.h"
/****************************************************************************
* str_to_bytes(s)
*
* Computes the number of bytes described by string s. s is assumed to be
* a base 10 positive (ie. >= 0) number followed by an optional single
* character multiplier. The following multipliers are supported:
*
* char mult
* -----------------
* b BSIZE or BBSIZE
* k 1024 bytes
* K 1024 * sizeof(long)
* m 2^20 (1048576)
* M 2^20 (1048576 * sizeof(long)
* g 2^30 (1073741824)
* G 2^30 (1073741824) * sizeof(long)
*
* for instance, "1k" and "1024" would both cause str_to_bytes to return 1024.
*
* Returns -1 if mult is an invalid character, or if the integer portion of
* s is not a positive integer.
*
****************************************************************************/
#if CRAY
#define B_MULT BSIZE /* block size */
#elif sgi
#define B_MULT BBSIZE /* block size */
#elif defined(__linux__) || defined(__sun) || defined(__hpux)
#define B_MULT DEV_BSIZE /* block size */
#elif defined(_AIX)
#define B_MULT UBSIZE
#endif
#define K_MULT 1024 /* Kilo or 2^10 */
#define M_MULT 1048576 /* Mega or 2^20 */
#define G_MULT 1073741824 /* Giga or 2^30 */
#define T_MULT 1099511627776 /* tera or 2^40 */
int
str_to_bytes(s)
char *s;
{
char mult, junk;
int nconv;
float num;
nconv = sscanf(s, "%f%c%c", &num, &mult, &junk);
if (nconv == 0 || nconv == 3)
return -1;
if (nconv == 1)
return num;
switch (mult) {
case 'b':
return (int)(num * (float)B_MULT);
case 'k':
return (int)(num * (float)K_MULT);
case 'K':
return (int)((num * (float)K_MULT) * sizeof(long));
case 'm':
return (int)(num * (float)M_MULT);
case 'M':
return (int)((num * (float)M_MULT) * sizeof(long));
case 'g':
return (int)(num * (float)G_MULT);
case 'G':
return (int)((num * (float)G_MULT) * sizeof(long));
default:
return -1;
}
}
long
str_to_lbytes(s)
char *s;
{
char mult, junk;
long nconv;
float num;
nconv = sscanf(s, "%f%c%c", &num, &mult, &junk);
if (nconv == 0 || nconv == 3)
return -1;
if (nconv == 1)
return (long)num;
switch (mult) {
case 'b':
return (long)(num * (float)B_MULT);
case 'k':
return (long)(num * (float)K_MULT);
case 'K':
return (long)((num * (float)K_MULT) * sizeof(long));
case 'm':
return (long)(num * (float)M_MULT);
case 'M':
return (long)((num * (float)M_MULT) * sizeof(long));
case 'g':
return (long)(num * (float)G_MULT);
case 'G':
return (long)((num * (float)G_MULT) * sizeof(long));
default:
return -1;
}
}
/*
* Force 64 bits number when compiled as 32 IRIX binary.
* This allows for a number bigger than 2G.
*/
long long
str_to_llbytes(s)
char *s;
{
char mult, junk;
long nconv;
double num;
nconv = sscanf(s, "%lf%c%c", &num, &mult, &junk);
if (nconv == 0 || nconv == 3)
return -1;
if (nconv == 1)
return (long long)num;
switch (mult) {
case 'b':
return (long long)(num * (float)B_MULT);
case 'k':
return (long long)(num * (float)K_MULT);
case 'K':
return (long long)((num * (float)K_MULT) * sizeof(long long));
case 'm':
return (long long)(num * (float)M_MULT);
case 'M':
return (long long)((num * (float)M_MULT) * sizeof(long long));
case 'g':
return (long long)(num * (float)G_MULT);
case 'G':
return (long long)((num * (float)G_MULT) * sizeof(long long));
default:
return -1;
}
}
#ifdef UNIT_TEST
main(int argc, char **argv)
{
int ind;
if (argc == 1) {
fprintf(stderr, "missing str_to_bytes() parameteres\n");
exit(1);
}
for (ind=1; ind<argc; ind++) {
printf("str_to_bytes(%s) returned %d\n",
argv[ind], str_to_bytes(argv[ind]));
printf("str_to_lbytes(%s) returned %ld\n",
argv[ind], str_to_lbytes(argv[ind]));
printf("str_to_llbytes(%s) returned %lld\n",
argv[ind], str_to_llbytes(argv[ind]));
}
}
#endif
|
