165393a86SMarcel Moolenaar /*- 265393a86SMarcel Moolenaar * Copyright (c) 2002 Marcel Moolenaar 365393a86SMarcel Moolenaar * Copyright (c) 2002 Hiten Mahesh Pandya 465393a86SMarcel Moolenaar * All rights reserved. 565393a86SMarcel Moolenaar * 665393a86SMarcel Moolenaar * Redistribution and use in source and binary forms, with or without 765393a86SMarcel Moolenaar * modification, are permitted provided that the following conditions 865393a86SMarcel Moolenaar * are met: 965393a86SMarcel Moolenaar * 1. Redistributions of source code must retain the above copyright 1065393a86SMarcel Moolenaar * notice, this list of conditions and the following disclaimer. 1165393a86SMarcel Moolenaar * 2. Redistributions in binary form must reproduce the above copyright 1265393a86SMarcel Moolenaar * notice, this list of conditions and the following disclaimer in the 1365393a86SMarcel Moolenaar * documentation and/or other materials provided with the distribution. 1465393a86SMarcel Moolenaar * 1565393a86SMarcel Moolenaar * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 1665393a86SMarcel Moolenaar * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 1765393a86SMarcel Moolenaar * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 1865393a86SMarcel Moolenaar * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 1965393a86SMarcel Moolenaar * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2065393a86SMarcel Moolenaar * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2165393a86SMarcel Moolenaar * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2265393a86SMarcel Moolenaar * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2365393a86SMarcel Moolenaar * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 2465393a86SMarcel Moolenaar * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 2565393a86SMarcel Moolenaar * SUCH DAMAGE. 2665393a86SMarcel Moolenaar * 2765393a86SMarcel Moolenaar * $FreeBSD$ 2865393a86SMarcel Moolenaar */ 2965393a86SMarcel Moolenaar 3065393a86SMarcel Moolenaar #include <string.h> 3165393a86SMarcel Moolenaar #include <uuid.h> 3265393a86SMarcel Moolenaar 3365393a86SMarcel Moolenaar /* 3465393a86SMarcel Moolenaar * uuid_compare() - compare two UUIDs. 3565393a86SMarcel Moolenaar * See also: 3665393a86SMarcel Moolenaar * http://www.opengroup.org/onlinepubs/009629399/uuid_compare.htm 3765393a86SMarcel Moolenaar * http://www.transarc.ibm.com/Library/documentation/dce/1.1/uuid_compare.html 3865393a86SMarcel Moolenaar * 3965393a86SMarcel Moolenaar * NOTE: Either UUID can be NULL, meaning a nil UUID. nil UUIDs are smaller 4065393a86SMarcel Moolenaar * than any non-nil UUID. 4165393a86SMarcel Moolenaar */ 4265393a86SMarcel Moolenaar int32_t 4365393a86SMarcel Moolenaar uuid_compare(uuid_t *a, uuid_t *b, uint32_t *status) 4465393a86SMarcel Moolenaar { 4565393a86SMarcel Moolenaar int res; 4665393a86SMarcel Moolenaar 4765393a86SMarcel Moolenaar if (status != NULL) 4865393a86SMarcel Moolenaar *status = uuid_s_ok; 4965393a86SMarcel Moolenaar 5065393a86SMarcel Moolenaar /* Deal with NULL or equal pointers. */ 5165393a86SMarcel Moolenaar if (a == b) 5265393a86SMarcel Moolenaar return (0); 5365393a86SMarcel Moolenaar if (a == NULL) 5465393a86SMarcel Moolenaar return ((uuid_is_nil(b, NULL)) ? 0 : -1); 5565393a86SMarcel Moolenaar if (b == NULL) 5665393a86SMarcel Moolenaar return ((uuid_is_nil(a, NULL)) ? 0 : 1); 5765393a86SMarcel Moolenaar 5865393a86SMarcel Moolenaar /* We have to compare the hard way. */ 5965393a86SMarcel Moolenaar res = (int)((int64_t)a->time_low - (int64_t)b->time_low); 6065393a86SMarcel Moolenaar if (res) 6165393a86SMarcel Moolenaar return ((res < 0) ? -1 : 1); 6265393a86SMarcel Moolenaar res = (int)a->time_mid - (int)b->time_mid; 6365393a86SMarcel Moolenaar if (res) 6465393a86SMarcel Moolenaar return ((res < 0) ? -1 : 1); 6565393a86SMarcel Moolenaar res = (int)a->time_hi_and_version - (int)b->time_hi_and_version; 6665393a86SMarcel Moolenaar if (res) 6765393a86SMarcel Moolenaar return ((res < 0) ? -1 : 1); 6865393a86SMarcel Moolenaar res = (int)a->clock_seq_hi_and_reserved - 6965393a86SMarcel Moolenaar (int)b->clock_seq_hi_and_reserved; 7065393a86SMarcel Moolenaar if (res) 7165393a86SMarcel Moolenaar return ((res < 0) ? -1 : 1); 7265393a86SMarcel Moolenaar res = (int)a->clock_seq_low - (int)b->clock_seq_low; 7365393a86SMarcel Moolenaar if (res) 7465393a86SMarcel Moolenaar return ((res < 0) ? -1 : 1); 753031a431SMarcel Moolenaar res = memcmp(a->node, b->node, sizeof(a->node)); 763031a431SMarcel Moolenaar if (res) 773031a431SMarcel Moolenaar return ((res < 0) ? -1 : 1); 783031a431SMarcel Moolenaar return (0); 7965393a86SMarcel Moolenaar } 80