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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/*
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" file accompanying this file. This file 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 <string.h>
#include <ctype.h>
#include <sys/param.h>
#include "error/s2n_errno.h"
#include "utils/s2n_safety.h"
#include "utils/s2n_blob.h"
#include <s2n.h>
S2N_RESULT s2n_blob_validate(const struct s2n_blob* b)
{
ENSURE_REF(b);
DEBUG_ENSURE(S2N_IMPLIES(b->data == NULL, b->size == 0), S2N_ERR_SAFETY);
DEBUG_ENSURE(S2N_IMPLIES(b->data == NULL, b->allocated == 0), S2N_ERR_SAFETY);
DEBUG_ENSURE(S2N_IMPLIES(b->growable == 0, b->allocated == 0), S2N_ERR_SAFETY);
DEBUG_ENSURE(S2N_IMPLIES(b->growable != 0, b->size <= b->allocated), S2N_ERR_SAFETY);
DEBUG_ENSURE(S2N_MEM_IS_READABLE(b->data, b->allocated), S2N_ERR_SAFETY);
DEBUG_ENSURE(S2N_MEM_IS_READABLE(b->data, b->size), S2N_ERR_SAFETY);
return S2N_RESULT_OK;
}
int s2n_blob_init(struct s2n_blob *b, uint8_t * data, uint32_t size)
{
ENSURE_POSIX_REF(b);
ENSURE_POSIX(S2N_MEM_IS_READABLE(data, size), S2N_ERR_SAFETY);
*b = (struct s2n_blob) {.data = data, .size = size, .allocated = 0, .growable = 0};
POSTCONDITION_POSIX(s2n_blob_validate(b));
return S2N_SUCCESS;
}
int s2n_blob_zero(struct s2n_blob *b)
{
PRECONDITION_POSIX(s2n_blob_validate(b));
memset_check(b->data, 0, MAX(b->allocated, b->size));
POSTCONDITION_POSIX(s2n_blob_validate(b));
return S2N_SUCCESS;
}
int s2n_blob_slice(const struct s2n_blob *b, struct s2n_blob *slice, uint32_t offset, uint32_t size)
{
PRECONDITION_POSIX(s2n_blob_validate(b));
PRECONDITION_POSIX(s2n_blob_validate(slice));
uint32_t slice_size = 0;
GUARD(s2n_add_overflow(offset, size, &slice_size));
ENSURE_POSIX(b->size >= slice_size, S2N_ERR_SIZE_MISMATCH);
slice->data = b->data + offset;
slice->size = size;
slice->growable = 0;
slice->allocated = 0;
POSTCONDITION_POSIX(s2n_blob_validate(slice));
return S2N_SUCCESS;
}
int s2n_blob_char_to_lower(struct s2n_blob *b)
{
PRECONDITION_POSIX(s2n_blob_validate(b));
for (size_t i = 0; i < b->size; i++) {
b->data[i] = tolower(b->data[i]);
}
POSTCONDITION_POSIX(s2n_blob_validate(b));
return S2N_SUCCESS;
}
/* An inverse map from an ascii value to a hexidecimal nibble value
* accounts for all possible char values, where 255 is invalid value */
static const uint8_t hex_inverse[256] = {
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 255, 255, 255, 255, 255, 255,
255, 10, 11, 12, 13, 14, 15, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 10, 11, 12, 13, 14, 15, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255
};
/* takes a hex string and writes values in the s2n_blob
* string needs to a valid hex and blob needs to be large enough */
int s2n_hex_string_to_bytes(const uint8_t *str, struct s2n_blob *blob)
{
ENSURE_POSIX_REF(str);
PRECONDITION_POSIX(s2n_blob_validate(blob));
uint32_t len = strlen((const char*)str);
/* protects against overflows */
gte_check(blob->size, len / 2);
S2N_ERROR_IF(len % 2 != 0, S2N_ERR_INVALID_HEX);
for (size_t i = 0; i < len; i += 2) {
uint8_t high_nibble = hex_inverse[str[i]];
S2N_ERROR_IF(high_nibble == 255, S2N_ERR_INVALID_HEX);
uint8_t low_nibble = hex_inverse[str[i + 1]];
S2N_ERROR_IF(low_nibble == 255, S2N_ERR_INVALID_HEX);
blob->data[i / 2] = high_nibble << 4 | low_nibble;
}
POSTCONDITION_POSIX(s2n_blob_validate(blob));
return S2N_SUCCESS;
}
|
