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);
81 * Edit an integer number with commas, the supplied buffer
82 * must be at least 27 bytes long. The incoming number
83 * is always widened to 64 bits.
85 char *edit_uint64_with_commas(uint64_t val, char *buf)
88 * Replacement for sprintf(buf, "%" llu, val)
91 mbuf[sizeof(mbuf)-1] = 0;
92 int i = sizeof(mbuf)-2; /* edit backward */
97 mbuf[i--] = "0123456789"[val%10];
101 strcpy(buf, &mbuf[i+1]);
102 return add_commas(buf, buf);
106 * Edit an integer number, the supplied buffer
107 * must be at least 27 bytes long. The incoming number
108 * is always widened to 64 bits.
110 char *edit_uint64(uint64_t val, char *buf)
113 * Replacement for sprintf(buf, "%" llu, val)
116 mbuf[sizeof(mbuf)-1] = 0;
117 int i = sizeof(mbuf)-2; /* edit backward */
122 mbuf[i--] = "0123456789"[val%10];
126 strcpy(buf, &mbuf[i+1]);
131 * Given a string "str", separate the integer part into
132 * str, and the modifier into mod.
134 static bool get_modifier(char *str, char *num, int num_len, char *mod, int mod_len)
136 int i, len, num_begin, num_end, mod_begin, mod_end;
139 * Look for modifier by walking back looking for the first
142 strip_trailing_junk(str);
145 for (i=0; i<len; i++) {
146 if (!B_ISSPACE(str[i])) {
152 /* Walk through integer part */
153 for ( ; i<len; i++) {
154 if (!B_ISDIGIT(str[i])) {
159 if (num_len > (num_end - num_begin + 1)) {
160 num_len = num_end - num_begin + 1;
165 for ( ; i<len; i++) {
166 if (!B_ISSPACE(str[i])) {
171 for ( ; i<len; i++) {
172 if (!B_ISALPHA(str[i])) {
177 if (mod_len > (mod_end - mod_begin + 1)) {
178 mod_len = mod_end - mod_begin + 1;
180 Dmsg5(900, "str=%s: num_beg=%d num_end=%d mod_beg=%d mod_end=%d\n",
181 str, num_begin, num_end, mod_begin, mod_end);
182 bstrncpy(num, &str[num_begin], num_len);
183 bstrncpy(mod, &str[mod_begin], mod_len);
184 if (!is_a_number(num)) {
187 bstrncpy(str, &str[mod_end], len);
193 * Convert a string duration to utime_t (64 bit seconds)
194 * Returns 0: if error
195 1: if OK, and value stored in value
197 int duration_to_utime(char *str, utime_t *value)
200 double val, total = 0.0;
204 * The "n" = mins and months appears before minutes so that m maps
205 * to months. These "kludges" make it compatible with pre 1.31
208 static const char *mod[] = {"n", "seconds", "months", "minutes",
209 "hours", "days", "weeks", "quarters", "years", NULL};
210 static const int32_t mult[] = {60, 1, 60*60*24*30, 60,
211 60*60, 60*60*24, 60*60*24*7, 60*60*24*91, 60*60*24*365};
214 if (!get_modifier(str, num_str, sizeof(num_str), mod_str, sizeof(mod_str))) {
217 /* Now find the multiplier corresponding to the modifier */
218 mod_len = strlen(mod_str);
220 i = 1; /* assume seconds */
222 for (i=0; mod[i]; i++) {
223 if (strncasecmp(mod_str, mod[i], mod_len) == 0) {
227 if (mod[i] == NULL) {
228 i = 1; /* no modifier, assume secs */
231 Dmsg2(900, "str=%s: mult=%d\n", num_str, mult[i]);
233 val = strtod(num_str, NULL);
234 if (errno != 0 || val < 0) {
237 total += val * mult[i];
239 *value = (utime_t)total;
244 * Edit a utime "duration" into ASCII
246 char *edit_utime(utime_t val, char *buf, int buf_len)
249 static const int32_t mult[] = {60*60*24*365, 60*60*24*30, 60*60*24, 60*60, 60};
250 static const char *mod[] = {"year", "month", "day", "hour", "min"};
255 for (i=0; i<5; i++) {
256 times = (uint32_t)(val / mult[i]);
258 val = val - (utime_t)times * mult[i];
259 bsnprintf(mybuf, sizeof(mybuf), "%d %s%s ", times, mod[i], times>1?"s":"");
260 bstrncat(buf, mybuf, buf_len);
263 if (val == 0 && strlen(buf) == 0) {
264 bstrncat(buf, "0 secs", buf_len);
265 } else if (val != 0) {
266 bsnprintf(mybuf, sizeof(mybuf), "%d sec%s", (uint32_t)val, val>1?"s":"");
267 bstrncat(buf, mybuf, buf_len);
273 * Convert a size in bytes to uint64_t
274 * Returns 0: if error
275 1: if OK, and value stored in value
277 int size_to_uint64(char *str, int str_len, uint64_t *value)
283 static const char *mod[] = {"*", "k", "kb", "m", "mb", "g", "gb", NULL}; /* first item * not used */
284 const int64_t mult[] = {1, /* byte */
286 1000, /* kb kilobyte */
287 1048576, /* megabyte */
288 1000000, /* mb megabyte */
289 1073741824, /* gigabyte */
290 1000000000}; /* gb gigabyte */
292 if (!get_modifier(str, num_str, sizeof(num_str), mod_str, sizeof(mod_str))) {
295 /* Now find the multiplier corresponding to the modifier */
296 mod_len = strlen(mod_str);
297 for (i=0; mod[i]; i++) {
298 if (strncasecmp(mod_str, mod[i], mod_len) == 0) {
302 if (mod[i] == NULL) {
303 i = 0; /* no modifier found, assume 1 */
305 Dmsg2(900, "str=%s: mult=%d\n", str, mult[i]);
307 val = strtod(num_str, NULL);
308 if (errno != 0 || val < 0) {
311 *value = (utime_t)(val * mult[i]);
316 * Check if specified string is a number or not.
317 * Taken from SQLite, cool, thanks.
319 bool is_a_number(const char *n)
321 bool digit_seen = false;
323 if( *n == '-' || *n == '+' ) {
326 while (B_ISDIGIT(*n)) {
330 if (digit_seen && *n == '.') {
332 while (B_ISDIGIT(*n)) { n++; }
334 if (digit_seen && (*n == 'e' || *n == 'E')
335 && (B_ISDIGIT(n[1]) || ((n[1]=='-' || n[1] == '+') && B_ISDIGIT(n[2])))) {
336 n += 2; /* skip e- or e+ or e digit */
337 while (B_ISDIGIT(*n)) { n++; }
339 return digit_seen && *n==0;
343 * Check if the specified string is an integer
345 bool is_an_integer(const char *n)
347 bool digit_seen = false;
348 while (B_ISDIGIT(*n)) {
352 return digit_seen && *n==0;
356 * Check if Bacula Resoure Name is valid
359 * Check if the Volume name has legal characters
360 * If ua is non-NULL send the message
362 bool is_name_valid(char *name, POOLMEM **msg)
366 /* Special characters to accept */
367 const char *accept = ":.-_ ";
369 /* Restrict the characters permitted in the Volume name */
370 for (p=name; *p; p++) {
371 if (B_ISALPHA(*p) || B_ISDIGIT(*p) || strchr(accept, (int)(*p))) {
375 Mmsg(msg, _("Illegal character \"%c\" in name.\n"), *p);
380 if (len >= MAX_NAME_LENGTH) {
382 Mmsg(msg, _("Name too long.\n"));
388 Mmsg(msg, _("Volume name must be at least one character long.\n"));
398 * Add commas to a string, which is presumably
401 char *add_commas(char *val, char *buf)
419 for (i=0; i < 3; i++) {
428 void d_msg(const char*, int, int, const char*, ...)
430 int main(int argc, char *argv[])
432 char *str[] = {"3", "3n", "3 hours", "3.5 day", "3 week", "3 m", "3 q", "3 years"};
437 for (int i=0; i<8; i++) {
439 if (!duration_to_utime(buf, &val)) {
440 printf("Error return from duration_to_utime for in=%s\n", str[i]);
443 edit_utime(val, outval);
444 printf("in=%s val=%" lld " outval=%s\n", str[i], val, outval);