summaryrefslogtreecommitdiffstats
path: root/libmisc/getrange.c
blob: 82f2edfa4515426de03213f541134f5ae10530b9 (plain)
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
/*
 * SPDX-FileCopyrightText: 2008       , Nicolas François
 *
 * SPDX-License-Identifier: BSD-3-Clause
 */

#include <config.h>

#ident "$Id: $"

#include <ctype.h>
#include <stdlib.h>

#include "defines.h"
#include "prototypes.h"

/*
 * Parse a range and indicate if the range is valid.
 * Valid ranges are in the form:
 *     <long>          -> min=max=long         has_min  has_max
 *     -<long>         -> max=long            !has_min  has_max
 *     <long>-         -> min=long             has_min !has_max
 *     <long1>-<long2> -> min=long1 max=long2  has_min  has_max
 *
 * If the range is valid, getrange returns 1.
 * If the range is not valid, getrange returns 0.
 */
int getrange (const char *range,
              unsigned long *min, bool *has_min,
              unsigned long *max, bool *has_max)
{
	char *endptr;
	unsigned long n;

	if (NULL == range) {
		return 0;
	}

	if ('-' == range[0]) {
		if (!isdigit(range[1])) {
			/* invalid */
			return 0;
		}
		errno = 0;
		n = strtoul (&range[1], &endptr, 10);
		if (('\0' != *endptr) || (ERANGE == errno)) {
			/* invalid */
			return 0;
		}
		/* -<long> */
		*has_min = false;
		*has_max = true;
		*max = n;
	} else {
		errno = 0;
		n = strtoul (range, &endptr, 10);
		if (ERANGE == errno) {
			/* invalid */
			return 0;
		}
		switch (*endptr) {
			case '\0':
				/* <long> */
				*has_min = true;
				*has_max = true;
				*min = n;
				*max = n;
				break;
			case '-':
				endptr++;
				if ('\0' == *endptr) {
					/* <long>- */
					*has_min = true;
					*has_max = false;
					*min = n;
				} else if (!isdigit (*endptr)) {
					/* invalid */
					return 0;
				} else {
					*has_min = true;
					*min = n;
					errno = 0;
					n = strtoul (endptr, &endptr, 10);
					if (   ('\0' != *endptr)
					    || (ERANGE == errno)) {
						/* invalid */
						return 0;
					}
					/* <long>-<long> */
					*has_max = true;
					*max = n;
				}
				break;
			default:
				return 0;
		}
	}

	return 1;
}