/* * ASN.1 OID * (C) 1999-2007 Jack Lloyd * * Botan is released under the Simplified BSD License (see license.txt) */ #include #include #include #include #include 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::to_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+=(uint32_t component) { m_id.push_back(component); return (*this); } /* * Append another component to the OID */ OID operator+(const OID& oid, uint32_t 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& oid1 = a.get_id(); const std::vector& 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 encoding; if(m_id[0] > 2 || m_id[1] >= 40) throw Encoding_Error("Invalid OID prefix, cannot encode"); encoding.push_back(static_cast(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; BOTAN_ASSERT(blocks > 0, "Math works"); 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.tagging() != OBJECT_ID) throw BER_Bad_Tag("Error decoding OID, unknown tag", obj.tagging()); const size_t length = obj.length(); const uint8_t* bits = obj.bits(); if(length < 2) throw BER_Decoding_Error("OID encoding is too short"); clear(); m_id.push_back(bits[0] / 40); m_id.push_back(bits[0] % 40); size_t i = 0; while(i != length - 1) { uint32_t component = 0; while(i != length - 1) { ++i; if(component >> (32-7)) throw Decoding_Error("OID component overflow"); component = (component << 7) + (bits[i] & 0x7F); if(!(bits[i] & 0x80)) break; } m_id.push_back(component); } } }