remove gcc34
[dragonfly.git] / crypto / heimdal-0.6.3 / lib / asn1 / der_length.c
blob913a1f8ff8cdd7693f2eb564a12463b2905a2593
1 /*
2 * Copyright (c) 1997 - 2001 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
34 #include "der_locl.h"
36 RCSID("$Id: der_length.c,v 1.12.6.2 2004/02/12 18:45:51 joda Exp $");
38 size_t
39 _heim_len_unsigned (unsigned val)
41 size_t ret = 0;
43 do {
44 ++ret;
45 val /= 256;
46 } while (val);
47 return ret;
50 size_t
51 _heim_len_int (int val)
53 unsigned char q;
54 size_t ret = 0;
56 if (val >= 0) {
57 do {
58 q = val % 256;
59 ret++;
60 val /= 256;
61 } while(val);
62 if(q >= 128)
63 ret++;
64 } else {
65 val = ~val;
66 do {
67 q = ~(val % 256);
68 ret++;
69 val /= 256;
70 } while(val);
71 if(q < 128)
72 ret++;
74 return ret;
77 static size_t
78 len_oid (const oid *oid)
80 size_t ret = 1;
81 int n;
83 for (n = 2; n < oid->length; ++n) {
84 unsigned u = oid->components[n];
86 ++ret;
87 u /= 128;
88 while (u > 0) {
89 ++ret;
90 u /= 128;
93 return ret;
96 size_t
97 length_len (size_t len)
99 if (len < 128)
100 return 1;
101 else
102 return _heim_len_unsigned (len) + 1;
105 size_t
106 length_integer (const int *data)
108 size_t len = _heim_len_int (*data);
110 return 1 + length_len(len) + len;
113 size_t
114 length_unsigned (const unsigned *data)
116 size_t len = _heim_len_unsigned (*data);
118 return 1 + length_len(len) + len;
121 size_t
122 length_enumerated (const unsigned *data)
124 size_t len = _heim_len_int (*data);
126 return 1 + length_len(len) + len;
129 size_t
130 length_general_string (const general_string *data)
132 char *str = *data;
133 size_t len = strlen(str);
134 return 1 + length_len(len) + len;
137 size_t
138 length_octet_string (const octet_string *k)
140 return 1 + length_len(k->length) + k->length;
143 size_t
144 length_oid (const oid *k)
146 size_t len = len_oid (k);
148 return 1 + length_len(len) + len;
151 size_t
152 length_generalized_time (const time_t *t)
154 octet_string k;
155 size_t ret;
157 time2generalizedtime (*t, &k);
158 ret = 1 + length_len(k.length) + k.length;
159 free (k.data);
160 return ret;