1c19800e8SDoug Rabson /* 2*ae771770SStanislav Sedov * Copyright (c) 2003-2005 Kungliga Tekniska Högskolan 3c19800e8SDoug Rabson * (Royal Institute of Technology, Stockholm, Sweden). 4c19800e8SDoug Rabson * All rights reserved. 5c19800e8SDoug Rabson * 6c19800e8SDoug Rabson * Redistribution and use in source and binary forms, with or without 7c19800e8SDoug Rabson * modification, are permitted provided that the following conditions 8c19800e8SDoug Rabson * are met: 9c19800e8SDoug Rabson * 10c19800e8SDoug Rabson * 1. Redistributions of source code must retain the above copyright 11c19800e8SDoug Rabson * notice, this list of conditions and the following disclaimer. 12c19800e8SDoug Rabson * 13c19800e8SDoug Rabson * 2. Redistributions in binary form must reproduce the above copyright 14c19800e8SDoug Rabson * notice, this list of conditions and the following disclaimer in the 15c19800e8SDoug Rabson * documentation and/or other materials provided with the distribution. 16c19800e8SDoug Rabson * 17c19800e8SDoug Rabson * 3. Neither the name of the Institute nor the names of its contributors 18c19800e8SDoug Rabson * may be used to endorse or promote products derived from this software 19c19800e8SDoug Rabson * without specific prior written permission. 20c19800e8SDoug Rabson * 21c19800e8SDoug Rabson * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 22c19800e8SDoug Rabson * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23c19800e8SDoug Rabson * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24c19800e8SDoug Rabson * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 25c19800e8SDoug Rabson * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26c19800e8SDoug Rabson * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27c19800e8SDoug Rabson * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28c19800e8SDoug Rabson * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29c19800e8SDoug Rabson * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30c19800e8SDoug Rabson * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31c19800e8SDoug Rabson * SUCH DAMAGE. 32c19800e8SDoug Rabson */ 33c19800e8SDoug Rabson 34c19800e8SDoug Rabson #include "der_locl.h" 35c19800e8SDoug Rabson 36c19800e8SDoug Rabson int 37c19800e8SDoug Rabson der_heim_oid_cmp(const heim_oid *p, const heim_oid *q) 38c19800e8SDoug Rabson { 39c19800e8SDoug Rabson if (p->length != q->length) 40c19800e8SDoug Rabson return p->length - q->length; 41c19800e8SDoug Rabson return memcmp(p->components, 42c19800e8SDoug Rabson q->components, 43c19800e8SDoug Rabson p->length * sizeof(*p->components)); 44c19800e8SDoug Rabson } 45c19800e8SDoug Rabson 46c19800e8SDoug Rabson int 47c19800e8SDoug Rabson der_heim_octet_string_cmp(const heim_octet_string *p, 48c19800e8SDoug Rabson const heim_octet_string *q) 49c19800e8SDoug Rabson { 50c19800e8SDoug Rabson if (p->length != q->length) 51c19800e8SDoug Rabson return p->length - q->length; 52c19800e8SDoug Rabson return memcmp(p->data, q->data, p->length); 53c19800e8SDoug Rabson } 54c19800e8SDoug Rabson 55c19800e8SDoug Rabson int 56*ae771770SStanislav Sedov der_printable_string_cmp(const heim_printable_string *p, 57*ae771770SStanislav Sedov const heim_printable_string *q) 58*ae771770SStanislav Sedov { 59*ae771770SStanislav Sedov return der_heim_octet_string_cmp(p, q); 60*ae771770SStanislav Sedov } 61*ae771770SStanislav Sedov 62*ae771770SStanislav Sedov int 63*ae771770SStanislav Sedov der_ia5_string_cmp(const heim_ia5_string *p, 64*ae771770SStanislav Sedov const heim_ia5_string *q) 65*ae771770SStanislav Sedov { 66*ae771770SStanislav Sedov return der_heim_octet_string_cmp(p, q); 67*ae771770SStanislav Sedov } 68*ae771770SStanislav Sedov 69*ae771770SStanislav Sedov int 70c19800e8SDoug Rabson der_heim_bit_string_cmp(const heim_bit_string *p, 71c19800e8SDoug Rabson const heim_bit_string *q) 72c19800e8SDoug Rabson { 73c19800e8SDoug Rabson int i, r1, r2; 74c19800e8SDoug Rabson if (p->length != q->length) 75c19800e8SDoug Rabson return p->length - q->length; 76c19800e8SDoug Rabson i = memcmp(p->data, q->data, p->length / 8); 77c19800e8SDoug Rabson if (i) 78c19800e8SDoug Rabson return i; 79c19800e8SDoug Rabson if ((p->length % 8) == 0) 80c19800e8SDoug Rabson return 0; 81c19800e8SDoug Rabson i = (p->length / 8); 82c19800e8SDoug Rabson r1 = ((unsigned char *)p->data)[i]; 83c19800e8SDoug Rabson r2 = ((unsigned char *)q->data)[i]; 84c19800e8SDoug Rabson i = 8 - (p->length % 8); 85c19800e8SDoug Rabson r1 = r1 >> i; 86c19800e8SDoug Rabson r2 = r2 >> i; 87c19800e8SDoug Rabson return r1 - r2; 88c19800e8SDoug Rabson } 89c19800e8SDoug Rabson 90c19800e8SDoug Rabson int 91c19800e8SDoug Rabson der_heim_integer_cmp(const heim_integer *p, 92c19800e8SDoug Rabson const heim_integer *q) 93c19800e8SDoug Rabson { 94c19800e8SDoug Rabson if (p->negative != q->negative) 95c19800e8SDoug Rabson return q->negative - p->negative; 96c19800e8SDoug Rabson if (p->length != q->length) 97c19800e8SDoug Rabson return p->length - q->length; 98c19800e8SDoug Rabson return memcmp(p->data, q->data, p->length); 99c19800e8SDoug Rabson } 100c19800e8SDoug Rabson 101c19800e8SDoug Rabson int 102c19800e8SDoug Rabson der_heim_bmp_string_cmp(const heim_bmp_string *p, const heim_bmp_string *q) 103c19800e8SDoug Rabson { 104c19800e8SDoug Rabson if (p->length != q->length) 105c19800e8SDoug Rabson return p->length - q->length; 106c19800e8SDoug Rabson return memcmp(p->data, q->data, q->length * sizeof(q->data[0])); 107c19800e8SDoug Rabson } 108c19800e8SDoug Rabson 109c19800e8SDoug Rabson int 110c19800e8SDoug Rabson der_heim_universal_string_cmp(const heim_universal_string *p, 111c19800e8SDoug Rabson const heim_universal_string *q) 112c19800e8SDoug Rabson { 113c19800e8SDoug Rabson if (p->length != q->length) 114c19800e8SDoug Rabson return p->length - q->length; 115c19800e8SDoug Rabson return memcmp(p->data, q->data, q->length * sizeof(q->data[0])); 116c19800e8SDoug Rabson } 117