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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
/*
* Copyright (c) 1997 - 2007 Kungliga Tekniska Högskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "krb5_locl.h"
/**
* Reset the (potentially uninitialized) krb5_data structure.
*
* @param p krb5_data to reset.
*
* @ingroup krb5
*/
KRB5_LIB_FUNCTION void KRB5_LIB_CALL
krb5_data_zero(krb5_data *p)
{
p->length = 0;
p->data = NULL;
}
/**
* Free the content of krb5_data structure, its ok to free a zeroed
* structure (with memset() or krb5_data_zero()). When done, the
* structure will be zeroed. The same function is called
* krb5_free_data_contents() in MIT Kerberos.
*
* @param p krb5_data to free.
*
* @ingroup krb5
*/
KRB5_LIB_FUNCTION void KRB5_LIB_CALL
krb5_data_free(krb5_data *p)
{
free(p->data);
krb5_data_zero(p);
}
/**
* Free krb5_data (and its content).
*
* @param context Kerberos 5 context.
* @param p krb5_data to free.
*
* @ingroup krb5
*/
KRB5_LIB_FUNCTION void KRB5_LIB_CALL
krb5_free_data(krb5_context context,
krb5_data *p)
{
krb5_data_free(p);
free(p);
}
/**
* Allocate data of and krb5_data.
*
* @param p krb5_data to allocate.
* @param len size to allocate.
*
* @return Returns 0 to indicate success. Otherwise an kerberos et
* error code is returned.
*
* @ingroup krb5
*/
KRB5_LIB_FUNCTION krb5_error_code KRB5_LIB_CALL
krb5_data_alloc(krb5_data *p, int len)
{
p->data = malloc(len);
if(len && p->data == NULL)
return ENOMEM;
p->length = len;
return 0;
}
/**
* Grow (or shrink) the content of krb5_data to a new size.
*
* @param p krb5_data to free.
* @param len new size.
*
* @return Returns 0 to indicate success. Otherwise an kerberos et
* error code is returned.
*
* @ingroup krb5
*/
KRB5_LIB_FUNCTION krb5_error_code KRB5_LIB_CALL
krb5_data_realloc(krb5_data *p, int len)
{
void *tmp;
tmp = realloc(p->data, len);
if(len && !tmp)
return ENOMEM;
p->data = tmp;
p->length = len;
return 0;
}
/**
* Copy the data of len into the krb5_data.
*
* @param p krb5_data to copy into.
* @param data data to copy..
* @param len new size.
*
* @return Returns 0 to indicate success. Otherwise an kerberos et
* error code is returned.
*
* @ingroup krb5
*/
KRB5_LIB_FUNCTION krb5_error_code KRB5_LIB_CALL
krb5_data_copy(krb5_data *p, const void *data, size_t len)
{
if (len) {
if(krb5_data_alloc(p, len))
return ENOMEM;
memcpy(p->data, data, len);
} else
p->data = NULL;
p->length = len;
return 0;
}
/**
* Copy the data into a newly allocated krb5_data.
*
* @param context Kerberos 5 context.
* @param indata the krb5_data data to copy
* @param outdata new krb5_date to copy too. Free with krb5_free_data().
*
* @return Returns 0 to indicate success. Otherwise an kerberos et
* error code is returned.
*
* @ingroup krb5
*/
KRB5_LIB_FUNCTION krb5_error_code KRB5_LIB_CALL
krb5_copy_data(krb5_context context,
const krb5_data *indata,
krb5_data **outdata)
{
krb5_error_code ret;
ALLOC(*outdata, 1);
if(*outdata == NULL)
return krb5_enomem(context);
ret = der_copy_octet_string(indata, *outdata);
if(ret) {
krb5_clear_error_message (context);
free(*outdata);
*outdata = NULL;
}
return ret;
}
/**
* Compare to data.
*
* @param data1 krb5_data to compare
* @param data2 krb5_data to compare
*
* @return return the same way as memcmp(), useful when sorting.
*
* @ingroup krb5
*/
KRB5_LIB_FUNCTION int KRB5_LIB_CALL
krb5_data_cmp(const krb5_data *data1, const krb5_data *data2)
{
size_t len = data1->length < data2->length ? data1->length : data2->length;
int cmp = memcmp(data1->data, data2->data, len);
if (cmp == 0)
return data1->length - data2->length;
return cmp;
}
/**
* Compare to data not exposing timing information from the checksum data
*
* @param data1 krb5_data to compare
* @param data2 krb5_data to compare
*
* @return returns zero for same data, otherwise non zero.
*
* @ingroup krb5
*/
KRB5_LIB_FUNCTION int KRB5_LIB_CALL
krb5_data_ct_cmp(const krb5_data *data1, const krb5_data *data2)
{
if (data1->length != data2->length)
return data1->length - data2->length;
return ct_memcmp(data1->data, data2->data, data1->length);
}
|
