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
|
/*
* Copyright (c) 1997 - 2001 Kungliga Tekniska Hgskolan
* (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 "der_locl.h"
#if 0
RCSID("$Id: der_length.c,v 1.1 2003/09/05 08:54:08 kouril Exp $");
#endif
static size_t
len_unsigned (unsigned val)
{
size_t ret = 0;
do {
++ret;
val /= 256;
} while (val);
return ret;
}
static size_t
len_int (int val)
{
size_t ret = 0;
if (val == 0)
return 1;
while (val > 255 || val < -255) {
++ret;
val /= 256;
}
if (val != 0) {
++ret;
if ((signed char)val != val)
++ret;
val /= 256;
}
return ret;
}
static size_t
len_oid (const oid *oid)
{
size_t ret = 1;
int n;
for (n = 2; n < oid->length; ++n) {
unsigned u = oid->components[n];
++ret;
u /= 128;
while (u > 0) {
++ret;
u /= 128;
}
}
return ret;
}
size_t
length_len (size_t len)
{
if (len < 128)
return 1;
else
return len_unsigned (len) + 1;
}
size_t
length_integer (const int *data)
{
size_t len = len_int (*data);
return 1 + length_len(len) + len;
}
size_t
length_unsigned (const unsigned *data)
{
size_t len = len_unsigned (*data);
return 1 + length_len(len) + len;
}
size_t
length_enumerated (const unsigned *data)
{
size_t len = len_int (*data);
return 1 + length_len(len) + len;
}
size_t
length_general_string (const general_string *data)
{
char *str = *data;
size_t len = strlen(str);
return 1 + length_len(len) + len;
}
size_t
length_octet_string (const octet_string *k)
{
return 1 + length_len(k->length) + k->length;
}
size_t
length_oid (const oid *k)
{
size_t len = len_oid (k);
return 1 + length_len(len) + len;
}
size_t
length_generalized_time (const time_t *t)
{
octet_string k;
size_t ret;
time2generalizedtime (*t, &k);
ret = 1 + length_len(k.length) + k.length;
free (k.data);
return ret;
}
|
