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