blob: 67af91afc1263673a4fc12743463381eed921806 (
plain)
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
|
/*
* ASN.1 OID
* (C) 1999-2007 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/asn1_oid.h>
#include <botan/der_enc.h>
#include <botan/ber_dec.h>
#include <botan/internal/bit_ops.h>
#include <botan/parsing.h>
namespace Botan {
/*
* ASN.1 OID Constructor
*/
OID::OID(const std::string& oid_str)
{
if(!oid_str.empty())
{
try
{
m_id = parse_asn1_oid(oid_str);
}
catch(...)
{
throw Invalid_OID(oid_str);
}
if(m_id.size() < 2 || m_id[0] > 2)
throw Invalid_OID(oid_str);
if((m_id[0] == 0 || m_id[0] == 1) && m_id[1] > 39)
throw Invalid_OID(oid_str);
}
}
/*
* Clear the current OID
*/
void OID::clear()
{
m_id.clear();
}
/*
* Return this OID as a string
*/
std::string OID::as_string() const
{
std::string oid_str;
for(size_t i = 0; i != m_id.size(); ++i)
{
oid_str += std::to_string(m_id[i]);
if(i != m_id.size() - 1)
oid_str += ".";
}
return oid_str;
}
/*
* OID equality comparison
*/
bool OID::operator==(const OID& oid) const
{
if(m_id.size() != oid.m_id.size())
return false;
for(size_t i = 0; i != m_id.size(); ++i)
if(m_id[i] != oid.m_id[i])
return false;
return true;
}
/*
* Append another component to the OID
*/
OID& OID::operator+=(u32bit component)
{
m_id.push_back(component);
return (*this);
}
/*
* Append another component to the OID
*/
OID operator+(const OID& oid, u32bit component)
{
OID new_oid(oid);
new_oid += component;
return new_oid;
}
/*
* OID inequality comparison
*/
bool operator!=(const OID& a, const OID& b)
{
return !(a == b);
}
/*
* Compare two OIDs
*/
bool operator<(const OID& a, const OID& b)
{
const std::vector<u32bit>& oid1 = a.get_id();
const std::vector<u32bit>& oid2 = b.get_id();
if(oid1.size() < oid2.size())
return true;
if(oid1.size() > oid2.size())
return false;
for(size_t i = 0; i != oid1.size(); ++i)
{
if(oid1[i] < oid2[i])
return true;
if(oid1[i] > oid2[i])
return false;
}
return false;
}
/*
* DER encode an OBJECT IDENTIFIER
*/
void OID::encode_into(DER_Encoder& der) const
{
if(m_id.size() < 2)
throw Invalid_Argument("OID::encode_into: OID is invalid");
std::vector<byte> encoding;
encoding.push_back(40 * m_id[0] + m_id[1]);
for(size_t i = 2; i != m_id.size(); ++i)
{
if(m_id[i] == 0)
encoding.push_back(0);
else
{
size_t blocks = high_bit(m_id[i]) + 6;
blocks = (blocks - (blocks % 7)) / 7;
for(size_t j = 0; j != blocks - 1; ++j)
encoding.push_back(0x80 | ((m_id[i] >> 7*(blocks-j-1)) & 0x7F));
encoding.push_back(m_id[i] & 0x7F);
}
}
der.add_object(OBJECT_ID, UNIVERSAL, encoding);
}
/*
* Decode a BER encoded OBJECT IDENTIFIER
*/
void OID::decode_from(BER_Decoder& decoder)
{
BER_Object obj = decoder.get_next_object();
if(obj.type_tag != OBJECT_ID || obj.class_tag != UNIVERSAL)
throw BER_Bad_Tag("Error decoding OID, unknown tag",
obj.type_tag, obj.class_tag);
if(obj.value.size() < 2)
throw BER_Decoding_Error("OID encoding is too short");
clear();
m_id.push_back(obj.value[0] / 40);
m_id.push_back(obj.value[0] % 40);
size_t i = 0;
while(i != obj.value.size() - 1)
{
u32bit component = 0;
while(i != obj.value.size() - 1)
{
++i;
if(component >> (32-7))
throw Decoding_Error("OID component overflow");
component = (component << 7) + (obj.value[i] & 0x7F);
if(!(obj.value[i] & 0x80))
break;
}
m_id.push_back(component);
}
}
}
|
