Coverage Report

Created: 2020-02-14 15:38

/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
528k
   {
24
528k
   try
25
528k
      {
26
528k
      std::string elem;
27
528k
      std::vector<uint32_t> oid_elems;
28
528k
29
528k
      for(char c : oid)
30
5.02M
         {
31
5.02M
         if(c == '.')
32
1.75M
            {
33
1.75M
            if(elem.empty())
34
0
               return std::vector<uint32_t>();
35
1.75M
            oid_elems.push_back(to_u32bit(elem));
36
1.75M
            elem.clear();
37
1.75M
            }
38
3.27M
         else
39
3.27M
            {
40
3.27M
            elem += c;
41
3.27M
            }
42
5.02M
         }
43
528k
44
528k
      if(elem.empty())
45
0
         return std::vector<uint32_t>();
46
528k
      oid_elems.push_back(to_u32bit(elem));
47
528k
48
528k
      if(oid_elems.size() < 2)
49
0
         return std::vector<uint32_t>();
50
528k
51
528k
      return oid_elems;
52
528k
      }
53
5
   catch(Invalid_Argument&) // thrown by to_u32bit
54
5
      {
55
5
      return std::vector<uint32_t>();
56
5
      }
57
528k
   }
58
59
}
60
61
//static
62
OID OID::from_string(const std::string& str)
63
17.1k
   {
64
17.1k
   if(str.empty())
65
0
      throw Invalid_Argument("OID::from_string argument must be non-empty");
66
17.1k
67
17.1k
   const OID o = OIDS::str2oid_or_empty(str);
68
17.1k
   if(o.has_value())
69
17.1k
      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
528k
   {
84
528k
   if(!oid_str.empty())
85
528k
      {
86
528k
      m_id = parse_oid_str(oid_str);
87
528k
88
528k
      if(m_id.size() < 2 || m_id[0] > 2)
89
0
         throw Invalid_OID(oid_str);
90
528k
      if((m_id[0] == 0 || m_id[0] == 1) && m_id[1] > 39)
91
0
         throw Invalid_OID(oid_str);
92
528k
      }
93
528k
   }
94
95
/*
96
* Return this OID as a string
97
*/
98
std::string OID::to_string() const
99
175k
   {
100
175k
   std::ostringstream oss;
101
1.18M
   for(size_t i = 0; i != m_id.size(); ++i)
102
1.01M
      {
103
1.01M
      oss << m_id[i];
104
1.01M
      if(i != m_id.size() - 1)
105
834k
         oss << ".";
106
1.01M
      }
107
175k
   return oss.str();
108
175k
   }
109
110
std::string OID::to_formatted_string() const
111
101k
   {
112
101k
   const std::string s = OIDS::oid2str_or_empty(*this);
113
101k
   if(!s.empty())
114
89.7k
      return s;
115
11.4k
   return this->to_string();
116
11.4k
   }
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
578k
   {
133
578k
   const std::vector<uint32_t>& oid1 = a.get_components();
134
578k
   const std::vector<uint32_t>& oid2 = b.get_components();
135
578k
136
578k
   return std::lexicographical_compare(oid1.begin(), oid1.end(),
137
578k
                                       oid2.begin(), oid2.end());
138
578k
   }
139
140
/*
141
* DER encode an OBJECT IDENTIFIER
142
*/
143
void OID::encode_into(DER_Encoder& der) const
144
11.9k
   {
145
11.9k
   if(m_id.size() < 2)
146
0
      throw Invalid_Argument("OID::encode_into: OID is invalid");
147
11.9k
148
11.9k
   std::vector<uint8_t> encoding;
149
11.9k
150
11.9k
   if(m_id[0] > 2 || m_id[1] >= 40)
151
8
      throw Encoding_Error("Invalid OID prefix, cannot encode");
152
11.9k
153
11.9k
   encoding.push_back(static_cast<uint8_t>(40 * m_id[0] + m_id[1]));
154
11.9k
155
69.8k
   for(size_t i = 2; i != m_id.size(); ++i)
156
57.8k
      {
157
57.8k
      if(m_id[i] == 0)
158
33
         encoding.push_back(0);
159
57.8k
      else
160
57.8k
         {
161
57.8k
         size_t blocks = high_bit(m_id[i]) + 6;
162
57.8k
         blocks = (blocks - (blocks % 7)) / 7;
163
57.8k
164
57.8k
         BOTAN_ASSERT(blocks > 0, "Math works");
165
57.8k
166
89.2k
         for(size_t j = 0; j != blocks - 1; ++j)
167
31.4k
            encoding.push_back(0x80 | ((m_id[i] >> 7*(blocks-j-1)) & 0x7F));
168
57.8k
         encoding.push_back(m_id[i] & 0x7F);
169
57.8k
         }
170
57.8k
      }
171
11.9k
   der.add_object(OBJECT_ID, UNIVERSAL, encoding);
172
11.9k
   }
173
174
/*
175
* Decode a BER encoded OBJECT IDENTIFIER
176
*/
177
void OID::decode_from(BER_Decoder& decoder)
178
244k
   {
179
244k
   BER_Object obj = decoder.get_next_object();
180
244k
   if(obj.tagging() != OBJECT_ID)
181
1.02k
      throw BER_Bad_Tag("Error decoding OID, unknown tag", obj.tagging());
182
243k
183
243k
   const size_t length = obj.length();
184
243k
   const uint8_t* bits = obj.bits();
185
243k
186
243k
   if(length < 2 && !(length == 1 && bits[0] == 0))
187
662
      {
188
662
      throw BER_Decoding_Error("OID encoding is too short");
189
662
      }
190
242k
191
242k
   m_id.clear();
192
242k
   m_id.push_back(bits[0] / 40);
193
242k
   m_id.push_back(bits[0] % 40);
194
242k
195
242k
   size_t i = 0;
196
1.23M
   while(i != length - 1)
197
992k
      {
198
992k
      uint32_t component = 0;
199
1.23M
      while(i != length - 1)
200
1.21M
         {
201
1.21M
         ++i;
202
1.21M
203
1.21M
         if(component >> (32-7))
204
408
            throw Decoding_Error("OID component overflow");
205
1.21M
206
1.21M
         component = (component << 7) + (bits[i] & 0x7F);
207
1.21M
208
1.21M
         if(!(bits[i] & 0x80))
209
970k
            break;
210
1.21M
         }
211
992k
      m_id.push_back(component);
212
992k
      }
213
242k
   }
214
215
}