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
|
/* Copyright 2018 IBM Corp.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
* implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <limits.h>
#include <assert.h>
/* Parse argument of the form 0-5,7,9-11,15,17 */
bool parse_list(const char *arg, int max, int *list, int *count)
{
char str[strlen(arg)+1];
char *tok, *tmp, *saveptr = NULL;
int i;
assert(max < INT_MAX);
strcpy(str, arg);
tmp = str;
while ((tok = strtok_r(tmp, ",", &saveptr)) != NULL) {
char *a, *b, *endptr, *saveptr2 = NULL;
unsigned long int from, to;
a = strtok_r(tok, "-", &saveptr2);
if (a == NULL) {
return false;
} else {
endptr = NULL;
from = strtoul(a, &endptr, 0);
if (*endptr != '\0') {
fprintf(stderr, "Invalid value %s\n", a);
return false;
}
if (from >= max) {
fprintf(stderr, "Value %s larger than max %d\n", a, max-1);
return false;
}
}
b = strtok_r(NULL, "-", &saveptr2);
if (b == NULL) {
to = from;
} else {
endptr = NULL;
to = strtoul(b, &endptr, 0);
if (*endptr != '\0') {
fprintf(stderr, "Invalid value %s\n", b);
return false;
}
if (to >= max) {
fprintf(stderr, "Value %s larger than max %d\n", b, max-1);
return false;
}
}
if (from > to) {
fprintf(stderr, "Invalid range %s-%s\n", a, b);
return false;
}
for (i = from; i <= to; i++)
list[i] = 1;
tmp = NULL;
};
if (count != NULL) {
int n = 0;
for (i = 0; i < max; i++) {
if (list[i] == 1)
n++;
}
*count = n;
}
return true;
}
|
