/src/botan/src/lib/asn1/asn1_oid.cpp
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * ASN.1 OID |
3 | | * (C) 1999-2007 Jack Lloyd |
4 | | * |
5 | | * Botan is released under the Simplified BSD License (see license.txt) |
6 | | */ |
7 | | |
8 | | #include <botan/asn1_oid.h> |
9 | | #include <botan/der_enc.h> |
10 | | #include <botan/ber_dec.h> |
11 | | #include <botan/internal/bit_ops.h> |
12 | | #include <botan/parsing.h> |
13 | | #include <botan/oids.h> |
14 | | #include <algorithm> |
15 | | #include <sstream> |
16 | | |
17 | | namespace Botan { |
18 | | |
19 | | namespace { |
20 | | |
21 | | // returns empty on invalid |
22 | | std::vector<uint32_t> parse_oid_str(const std::string& oid) |
23 | 464k | { |
24 | 464k | try |
25 | 464k | { |
26 | 464k | std::string elem; |
27 | 464k | std::vector<uint32_t> oid_elems; |
28 | 464k | |
29 | 464k | for(char c : oid) |
30 | 4.41M | { |
31 | 4.41M | if(c == '.') |
32 | 1.53M | { |
33 | 1.53M | if(elem.empty()) |
34 | 0 | return std::vector<uint32_t>(); |
35 | 1.53M | oid_elems.push_back(to_u32bit(elem)); |
36 | 1.53M | elem.clear(); |
37 | 1.53M | } |
38 | 2.87M | else |
39 | 2.87M | { |
40 | 2.87M | elem += c; |
41 | 2.87M | } |
42 | 4.41M | } |
43 | 464k | |
44 | 464k | if(elem.empty()) |
45 | 0 | return std::vector<uint32_t>(); |
46 | 464k | oid_elems.push_back(to_u32bit(elem)); |
47 | 464k | |
48 | 464k | if(oid_elems.size() < 2) |
49 | 0 | return std::vector<uint32_t>(); |
50 | 464k | |
51 | 464k | return oid_elems; |
52 | 464k | } |
53 | 5 | catch(Invalid_Argument&) // thrown by to_u32bit |
54 | 5 | { |
55 | 5 | return std::vector<uint32_t>(); |
56 | 5 | } |
57 | 464k | } |
58 | | |
59 | | } |
60 | | |
61 | | //static |
62 | | OID OID::from_string(const std::string& str) |
63 | 16.9k | { |
64 | 16.9k | if(str.empty()) |
65 | 0 | throw Invalid_Argument("OID::from_string argument must be non-empty"); |
66 | 16.9k | |
67 | 16.9k | const OID o = OIDS::str2oid_or_empty(str); |
68 | 16.9k | if(o.has_value()) |
69 | 16.9k | return o; |
70 | 5 | |
71 | 5 | std::vector<uint32_t> raw = parse_oid_str(str); |
72 | 5 | |
73 | 5 | if(raw.size() > 0) |
74 | 0 | return OID(std::move(raw)); |
75 | 5 | |
76 | 5 | throw Lookup_Error("No OID associated with name " + str); |
77 | 5 | } |
78 | | |
79 | | /* |
80 | | * ASN.1 OID Constructor |
81 | | */ |
82 | | OID::OID(const std::string& oid_str) |
83 | 464k | { |
84 | 464k | if(!oid_str.empty()) |
85 | 464k | { |
86 | 464k | m_id = parse_oid_str(oid_str); |
87 | 464k | |
88 | 464k | if(m_id.size() < 2 || m_id[0] > 2) |
89 | 0 | throw Invalid_OID(oid_str); |
90 | 464k | if((m_id[0] == 0 || m_id[0] == 1) && m_id[1] > 39) |
91 | 0 | throw Invalid_OID(oid_str); |
92 | 464k | } |
93 | 464k | } |
94 | | |
95 | | /* |
96 | | * Return this OID as a string |
97 | | */ |
98 | | std::string OID::to_string() const |
99 | 156k | { |
100 | 156k | std::ostringstream oss; |
101 | 1.08M | for(size_t i = 0; i != m_id.size(); ++i) |
102 | 925k | { |
103 | 925k | oss << m_id[i]; |
104 | 925k | if(i != m_id.size() - 1) |
105 | 768k | oss << "."; |
106 | 925k | } |
107 | 156k | return oss.str(); |
108 | 156k | } |
109 | | |
110 | | std::string OID::to_formatted_string() const |
111 | 89.5k | { |
112 | 89.5k | const std::string s = OIDS::oid2str_or_empty(*this); |
113 | 89.5k | if(!s.empty()) |
114 | 80.0k | return s; |
115 | 9.55k | return this->to_string(); |
116 | 9.55k | } |
117 | | |
118 | | /* |
119 | | * Append another component to the OID |
120 | | */ |
121 | | OID operator+(const OID& oid, uint32_t new_component) |
122 | 0 | { |
123 | 0 | std::vector<uint32_t> val = oid.get_components(); |
124 | 0 | val.push_back(new_component); |
125 | 0 | return OID(std::move(val)); |
126 | 0 | } |
127 | | |
128 | | /* |
129 | | * Compare two OIDs |
130 | | */ |
131 | | bool operator<(const OID& a, const OID& b) |
132 | 640k | { |
133 | 640k | const std::vector<uint32_t>& oid1 = a.get_components(); |
134 | 640k | const std::vector<uint32_t>& oid2 = b.get_components(); |
135 | 640k | |
136 | 640k | return std::lexicographical_compare(oid1.begin(), oid1.end(), |
137 | 640k | oid2.begin(), oid2.end()); |
138 | 640k | } |
139 | | |
140 | | /* |
141 | | * DER encode an OBJECT IDENTIFIER |
142 | | */ |
143 | | void OID::encode_into(DER_Encoder& der) const |
144 | 10.4k | { |
145 | 10.4k | if(m_id.size() < 2) |
146 | 0 | throw Invalid_Argument("OID::encode_into: OID is invalid"); |
147 | 10.4k | |
148 | 10.4k | std::vector<uint8_t> encoding; |
149 | 10.4k | |
150 | 10.4k | if(m_id[0] > 2 || m_id[1] >= 40) |
151 | 14 | throw Encoding_Error("Invalid OID prefix, cannot encode"); |
152 | 10.4k | |
153 | 10.4k | encoding.push_back(static_cast<uint8_t>(40 * m_id[0] + m_id[1])); |
154 | 10.4k | |
155 | 61.2k | for(size_t i = 2; i != m_id.size(); ++i) |
156 | 50.7k | { |
157 | 50.7k | if(m_id[i] == 0) |
158 | 34 | encoding.push_back(0); |
159 | 50.7k | else |
160 | 50.7k | { |
161 | 50.7k | size_t blocks = high_bit(m_id[i]) + 6; |
162 | 50.7k | blocks = (blocks - (blocks % 7)) / 7; |
163 | 50.7k | |
164 | 50.7k | BOTAN_ASSERT(blocks > 0, "Math works"); |
165 | 50.7k | |
166 | 78.5k | for(size_t j = 0; j != blocks - 1; ++j) |
167 | 27.7k | encoding.push_back(0x80 | ((m_id[i] >> 7*(blocks-j-1)) & 0x7F)); |
168 | 50.7k | encoding.push_back(m_id[i] & 0x7F); |
169 | 50.7k | } |
170 | 50.7k | } |
171 | 10.4k | der.add_object(OBJECT_ID, UNIVERSAL, encoding); |
172 | 10.4k | } |
173 | | |
174 | | /* |
175 | | * Decode a BER encoded OBJECT IDENTIFIER |
176 | | */ |
177 | | void OID::decode_from(BER_Decoder& decoder) |
178 | 220k | { |
179 | 220k | BER_Object obj = decoder.get_next_object(); |
180 | 220k | if(obj.tagging() != OBJECT_ID) |
181 | 1.01k | throw BER_Bad_Tag("Error decoding OID, unknown tag", obj.tagging()); |
182 | 219k | |
183 | 219k | const size_t length = obj.length(); |
184 | 219k | const uint8_t* bits = obj.bits(); |
185 | 219k | |
186 | 219k | if(length < 2 && !(length == 1 && bits[0] == 0)) |
187 | 653 | { |
188 | 653 | throw BER_Decoding_Error("OID encoding is too short"); |
189 | 653 | } |
190 | 219k | |
191 | 219k | m_id.clear(); |
192 | 219k | m_id.push_back(bits[0] / 40); |
193 | 219k | m_id.push_back(bits[0] % 40); |
194 | 219k | |
195 | 219k | size_t i = 0; |
196 | 1.18M | while(i != length - 1) |
197 | 970k | { |
198 | 970k | uint32_t component = 0; |
199 | 1.19M | while(i != length - 1) |
200 | 1.17M | { |
201 | 1.17M | ++i; |
202 | 1.17M | |
203 | 1.17M | if(component >> (32-7)) |
204 | 423 | throw Decoding_Error("OID component overflow"); |
205 | 1.17M | |
206 | 1.17M | component = (component << 7) + (bits[i] & 0x7F); |
207 | 1.17M | |
208 | 1.17M | if(!(bits[i] & 0x80)) |
209 | 946k | break; |
210 | 1.17M | } |
211 | 970k | m_id.push_back(component); |
212 | 969k | } |
213 | 219k | } |
214 | | |
215 | | } |