1*e6f98e3aSguenther /* $OpenBSD: uuid_compare.c,v 1.3 2015/09/10 18:13:46 guenther Exp $ */
29a210c53Smiod /* $NetBSD: uuid_compare.c,v 1.2 2008/04/23 07:52:32 plunky Exp $ */
39a210c53Smiod
4bd303c37Smiod /*-
5bd303c37Smiod * Copyright (c) 2002,2005 Marcel Moolenaar
69a210c53Smiod * Copyright (c) 2002 Hiten Mahesh Pandya
79a210c53Smiod * All rights reserved.
89a210c53Smiod *
99a210c53Smiod * Redistribution and use in source and binary forms, with or without
109a210c53Smiod * modification, are permitted provided that the following conditions
119a210c53Smiod * are met:
129a210c53Smiod * 1. Redistributions of source code must retain the above copyright
139a210c53Smiod * notice, this list of conditions and the following disclaimer.
149a210c53Smiod * 2. Redistributions in binary form must reproduce the above copyright
159a210c53Smiod * notice, this list of conditions and the following disclaimer in the
169a210c53Smiod * documentation and/or other materials provided with the distribution.
179a210c53Smiod *
189a210c53Smiod * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
199a210c53Smiod * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
209a210c53Smiod * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
219a210c53Smiod * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
229a210c53Smiod * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
239a210c53Smiod * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
249a210c53Smiod * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
259a210c53Smiod * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
269a210c53Smiod * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
279a210c53Smiod * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
289a210c53Smiod * SUCH DAMAGE.
299a210c53Smiod *
30bd303c37Smiod * $FreeBSD: src/lib/libc/uuid/uuid_compare.c,v 1.6 2007/04/05 02:07:33 delphij Exp $
319a210c53Smiod */
329a210c53Smiod
339a210c53Smiod #include <string.h>
349a210c53Smiod #include <uuid.h>
359a210c53Smiod
36bd303c37Smiod /* A macro used to improve the readability of uuid_compare(). */
37bd303c37Smiod #define DIFF_RETURN(a, b, field) do { \
38bd303c37Smiod if ((a)->field != (b)->field) \
39bd303c37Smiod return (((a)->field < (b)->field) ? -1 : 1); \
40bd303c37Smiod } while (0)
41bd303c37Smiod
429a210c53Smiod /*
439a210c53Smiod * uuid_compare() - compare two UUIDs.
449a210c53Smiod * See also:
459a210c53Smiod * http://www.opengroup.org/onlinepubs/009629399/uuid_compare.htm
469a210c53Smiod *
479a210c53Smiod * NOTE: Either UUID can be NULL, meaning a nil UUID. nil UUIDs are smaller
489a210c53Smiod * than any non-nil UUID.
499a210c53Smiod */
509a210c53Smiod int32_t
uuid_compare(const uuid_t * a,const uuid_t * b,uint32_t * status)519a210c53Smiod uuid_compare(const uuid_t *a, const uuid_t *b, uint32_t *status)
529a210c53Smiod {
539a210c53Smiod int res;
549a210c53Smiod
559a210c53Smiod if (status != NULL)
569a210c53Smiod *status = uuid_s_ok;
579a210c53Smiod
589a210c53Smiod /* Deal with NULL or equal pointers. */
599a210c53Smiod if (a == b)
609a210c53Smiod return (0);
619a210c53Smiod if (a == NULL)
629a210c53Smiod return ((uuid_is_nil(b, NULL)) ? 0 : -1);
639a210c53Smiod if (b == NULL)
649a210c53Smiod return ((uuid_is_nil(a, NULL)) ? 0 : 1);
659a210c53Smiod
669a210c53Smiod /* We have to compare the hard way. */
67bd303c37Smiod DIFF_RETURN(a, b, time_low);
68bd303c37Smiod DIFF_RETURN(a, b, time_mid);
69bd303c37Smiod DIFF_RETURN(a, b, time_hi_and_version);
70bd303c37Smiod DIFF_RETURN(a, b, clock_seq_hi_and_reserved);
71bd303c37Smiod DIFF_RETURN(a, b, clock_seq_low);
72bd303c37Smiod
739a210c53Smiod res = memcmp(a->node, b->node, sizeof(a->node));
749a210c53Smiod if (res)
759a210c53Smiod return ((res < 0) ? -1 : 1);
769a210c53Smiod return (0);
779a210c53Smiod }
78bd303c37Smiod
79bd303c37Smiod #undef DIFF_RETURN
80