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
|
/*
* Copyright (C) Internet Systems Consortium, Inc. ("ISC")
*
* SPDX-License-Identifier: MPL-2.0
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, you can obtain one at https://mozilla.org/MPL/2.0/.
*
* See the COPYRIGHT file distributed with this work for additional
* information regarding copyright ownership.
*/
/*! \file */
#include <ctype.h>
#include <errno.h>
#include <inttypes.h>
#include <limits.h>
#include <stdlib.h>
#include <isc/parseint.h>
#include <isc/result.h>
isc_result_t
isc_parse_uint32(uint32_t *uip, const char *string, int base) {
unsigned long n;
uint32_t r;
char *e;
if (!isalnum((unsigned char)(string[0]))) {
return (ISC_R_BADNUMBER);
}
errno = 0;
n = strtoul(string, &e, base);
if (*e != '\0') {
return (ISC_R_BADNUMBER);
}
/*
* Where long is 64 bits we need to convert to 32 bits then test for
* equality. This is a no-op on 32 bit machines and a good compiler
* will optimise it away.
*/
r = (uint32_t)n;
if ((n == ULONG_MAX && errno == ERANGE) || (n != (unsigned long)r)) {
return (ISC_R_RANGE);
}
*uip = r;
return (ISC_R_SUCCESS);
}
isc_result_t
isc_parse_uint16(uint16_t *uip, const char *string, int base) {
uint32_t val;
isc_result_t result;
result = isc_parse_uint32(&val, string, base);
if (result != ISC_R_SUCCESS) {
return (result);
}
if (val > 0xFFFF) {
return (ISC_R_RANGE);
}
*uip = (uint16_t)val;
return (ISC_R_SUCCESS);
}
isc_result_t
isc_parse_uint8(uint8_t *uip, const char *string, int base) {
uint32_t val;
isc_result_t result;
result = isc_parse_uint32(&val, string, base);
if (result != ISC_R_SUCCESS) {
return (result);
}
if (val > 0xFF) {
return (ISC_R_RANGE);
}
*uip = (uint8_t)val;
return (ISC_R_SUCCESS);
}
|
