workbench/libs/uuid/uuid_compare.c

   1 /*
   2     Copyright © 2007-2008, The AROS Development Team. All rights reserved.
   3     $Id$
   4 */
   5
   6 #define DEBUG 1
   7
   8 #include <aros/symbolsets.h>
   9 #include <aros/debug.h>
  10 #include <aros/libcall.h>
  11 #include <proto/exec.h>
  12
  13 #include <assert.h>
  14
  15 #include "uuid_private.h"
  16 #include LC_LIBDEFS_FILE
  17
  18 #define CHECK(f1, f2) if (f1 != f2) return f1 < f2 ? -1 : 1;
  19
  20 /*****************************************************************************
  21
  22     NAME */
  23         AROS_LH2(int, UUID_Compare,
  24
  25 /*  SYNOPSIS */
  26         AROS_LHA(const uuid_t *, u1, A0),
  27         AROS_LHA(const uuid_t *, u2, A1),
  28
  29 /*  LOCATION */
  30         struct uuid_base *, UUIDBase, 5, UUID)
  31
  32 /*  FUNCTION
  33         Compares between two UUIDs.
  34
  35     INPUTS
  36         u1, u2 - UUIDs to be compared.
  37
  38     RESULT
  39         <0 - if the u1 is lexically BEFORE u2
  40         =0 - if u1 equals u2
  41         >0 - if the u1 is lexically AFTER u2
  42
  43     NOTES
  44
  45     EXAMPLE
  46
  47     BUGS
  48
  49     SEE ALSO
  50
  51     INTERNALS
  52
  53 *****************************************************************************/
  54 {
  55     AROS_LIBFUNC_INIT
  56
  57     int i;
  58
  59     assert(u1);
  60     assert(u2);
  61
  62     CHECK(u1->time_low, u2->time_low);
  63     CHECK(u1->time_mid, u2->time_mid);
  64
  65     CHECK(u1->time_hi_and_version, u2->time_hi_and_version); CHECK(u1->clock_seq_hi_and_reserved, u2->clock_seq_hi_and_reserved);
  66     CHECK(u1->clock_seq_low, u2->clock_seq_low);
  67
  68     for (i = 0; i < 6; i++)
  69     {
  70         if (u1->node[i] < u2->node[i])
  71             return -1;
  72         if (u1->node[i] > u2->node[i])
  73             return 1;
  74     }
  75     return 0;
  76
  77     AROS_LIBFUNC_EXIT
  78 }