2 * edit.c edit string to ascii, and ascii to internal
4 * Kern Sibbald, December MMII
10 Copyright (C) 2000-2004 Kern Sibbald and John Walker
12 This program is free software; you can redistribute it and/or
13 modify it under the terms of the GNU General Public License as
14 published by the Free Software Foundation; either version 2 of
15 the License, or (at your option) any later version.
17 This program is distributed in the hope that it will be useful,
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 General Public License for more details.
22 You should have received a copy of the GNU General Public
23 License along with this program; if not, write to the Free
24 Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
32 /* We assume ASCII input and don't worry about overflow */
33 uint64_t str_to_uint64(char *str)
35 register char *p = str;
36 register uint64_t value = 0;
41 while (B_ISSPACE(*p)) {
47 while (B_ISDIGIT(*p)) {
48 value = value * 10 + *p - '0';
54 int64_t str_to_int64(char *str)
56 register char *p = str;
57 register int64_t value;
58 bool negative = false;
63 while (B_ISSPACE(*p)) {
68 } else if (*p == '-') {
72 value = str_to_uint64(p);
82 * Edit an integer number with commas, the supplied buffer
83 * must be at least 27 bytes long. The incoming number
84 * is always widened to 64 bits.
86 char *edit_uint64_with_commas(uint64_t val, char *buf)
88 sprintf(buf, "%" lld, val);
89 return add_commas(buf, buf);
93 * Edit an integer number, the supplied buffer
94 * must be at least 27 bytes long. The incoming number
95 * is always widened to 64 bits.
97 char *edit_uint64(uint64_t val, char *buf)
99 sprintf(buf, "%" lld, val);
104 * Given a string "str", separate the integer part into
105 * str, and the modifier into mod.
107 static bool get_modifier(char *str, char *mod, int mod_len)
111 * Look for modifier by walking back looking for the first
114 strip_trailing_junk(str);
117 /* Find beginning of the modifier */
118 for (i=len; i > 0; i--) {
119 if (!B_ISALPHA(str[i-1])) {
124 /* If nothing found, error */
126 Dmsg2(200, "error i=%d len=%d\n", i, len);
130 /* Move modifier to its location */
131 bstrncpy(mod, &str[i], mod_len);
132 Dmsg2(200, "in=%s mod=%s:\n", str, mod);
134 /* Backup over any spaces in front of modifier */
135 for ( ; i > 0; i--) {
136 if (B_ISSPACE(str[i-1])) {
142 /* The remainder (beginning) should be our number */
143 if (!is_a_number(str)) {
144 Dmsg0(200, "input not a number\n");
151 * Convert a string duration to utime_t (64 bit seconds)
152 * Returns 0: if error
153 1: if OK, and value stored in value
155 int duration_to_utime(char *str, utime_t *value)
161 * The "n" = mins and months appears before minutes so that m maps
162 * to months. These "kludges" make it compatible with pre 1.31
165 static const char *mod[] = {"n", "seconds", "months", "minutes",
166 "hours", "days", "weeks", "quarters", "years", NULL};
167 static const int32_t mult[] = {60, 1, 60*60*24*30, 60,
168 60*60, 60*60*24, 60*60*24*7, 60*60*24*91, 60*60*24*365};
170 if (!get_modifier(str, mod_str, sizeof(mod_str))) {
173 /* Now find the multiplier corresponding to the modifier */
174 mod_len = strlen(mod_str);
175 for (i=0; mod[i]; i++) {
176 if (strncasecmp(mod_str, mod[i], mod_len) == 0) {
180 if (mod[i] == NULL) {
181 i = 1; /* no modifier, assume 1 */
183 Dmsg2(200, "str=%s: mult=%d\n", str, mult[i]);
185 val = strtod(str, NULL);
186 if (errno != 0 || val < 0) {
189 *value = (utime_t)(val * mult[i]);
194 * Edit a utime "duration" into ASCII
196 char *edit_utime(utime_t val, char *buf)
199 static const int32_t mult[] = {60*60*24*365, 60*60*24*30, 60*60*24, 60*60, 60};
200 static const char *mod[] = {"year", "month", "day", "hour", "min"};
205 for (i=0; i<5; i++) {
206 times = (uint32_t)(val / mult[i]);
208 val = val - (utime_t)times * mult[i];
209 sprintf(mybuf, "%d %s%s ", times, mod[i], times>1?"s":"");
213 if (val == 0 && strlen(buf) == 0) {
214 strcat(buf, "0 secs");
215 } else if (val != 0) {
216 sprintf(mybuf, "%d sec%s", (uint32_t)val, val>1?"s":"");
223 * Convert a size size in bytes to uint64_t
224 * Returns 0: if error
225 1: if OK, and value stored in value
227 int size_to_uint64(char *str, int str_len, uint64_t *value)
232 static const char *mod[] = {"*", "k", "kb", "m", "mb", "g", "gb", NULL}; /* first item * not used */
233 const int64_t mult[] = {1, /* byte */
235 1000, /* kb kilobyte */
236 1048576, /* megabyte */
237 1000000, /* mb megabyte */
238 1073741824, /* gigabyte */
239 1000000000}; /* gb gigabyte */
241 if (!get_modifier(str, mod_str, sizeof(mod_str))) {
244 /* Now find the multiplier corresponding to the modifier */
245 mod_len = strlen(mod_str);
246 for (i=0; mod[i]; i++) {
247 if (strncasecmp(mod_str, mod[i], mod_len) == 0) {
251 if (mod[i] == NULL) {
252 i = 0; /* no modifier found, assume 1 */
254 Dmsg2(200, "str=%s: mult=%d\n", str, mult[i]);
256 val = strtod(str, NULL);
257 if (errno != 0 || val < 0) {
260 *value = (utime_t)(val * mult[i]);
265 * Check if specified string is a number or not.
266 * Taken from SQLite, cool, thanks.
268 int is_a_number(const char *n)
270 bool digit_seen = false;
272 if( *n == '-' || *n == '+' ) {
275 while (B_ISDIGIT(*n)) {
279 if (digit_seen && *n == '.') {
281 while (B_ISDIGIT(*n)) { n++; }
283 if (digit_seen && (*n == 'e' || *n == 'E')
284 && (B_ISDIGIT(n[1]) || ((n[1]=='-' || n[1] == '+') && B_ISDIGIT(n[2])))) {
285 n += 2; /* skip e- or e+ or e digit */
286 while (B_ISDIGIT(*n)) { n++; }
288 return digit_seen && *n==0;
292 * Check if the specified string is an integer
294 int is_an_integer(const char *n)
296 bool digit_seen = false;
297 while (B_ISDIGIT(*n)) {
301 return digit_seen && *n==0;
305 * Check if Bacula Resoure Name is valid
308 * Check if the Volume name has legal characters
309 * If ua is non-NULL send the message
311 bool is_name_valid(char *name, POOLMEM **msg)
315 /* Special characters to accept */
316 const char *accept = ":.-_ ";
318 /* Restrict the characters permitted in the Volume name */
319 for (p=name; *p; p++) {
320 if (B_ISALPHA(*p) || B_ISDIGIT(*p) || strchr(accept, (int)(*p))) {
324 Mmsg(msg, _("Illegal character \"%c\" in name.\n"), *p);
329 if (len >= MAX_NAME_LENGTH) {
331 Mmsg(msg, _("Name too long.\n"));
337 Mmsg(msg, _("Volume name must be at least one character long.\n"));
347 * Add commas to a string, which is presumably
350 char *add_commas(char *val, char *buf)
368 for (i=0; i < 3; i++) {
377 void d_msg(char*, int, int, char*, ...)
379 int main(int argc, char *argv[])
381 char *str[] = {"3", "3n", "3 hours", "3.5 day", "3 week", "3 m", "3 q", "3 years"};
386 for (int i=0; i<8; i++) {
388 if (!duration_to_utime(buf, &val)) {
389 printf("Error return from duration_to_utime for in=%s\n", str[i]);
392 edit_utime(val, outval);
393 printf("in=%s val=%lld outval=%s\n", str[i], val, outval);