-/* Copyright (c) 2008, 2009 Nicira Networks
+/* Copyright (c) 2008, 2009, 2010 Nicira Networks
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
uuid->parts[0] = uuid->parts[1] = uuid->parts[2] = uuid->parts[3] = 0;
}
+/* Returns true if 'uuid' is all zero, otherwise false. */
+bool
+uuid_is_zero(const struct uuid *uuid)
+{
+ return (!uuid->parts[0] && !uuid->parts[1]
+ && !uuid->parts[2] && !uuid->parts[3]);
+}
+
/* Compares 'a' and 'b'. Returns a negative value if 'a < b', zero if 'a ==
* b', or positive if 'a > b'. The ordering is lexicographical order of the
* conventional way of writing out UUIDs as strings. */
* be set to all-zero-bits. */
bool
uuid_from_string(struct uuid *uuid, const char *s)
+{
+ if (!uuid_from_string_prefix(uuid, s)) {
+ return false;
+ } else if (s[UUID_LEN] != '\0') {
+ uuid_zero(uuid);
+ return false;
+ } else {
+ return true;
+ }
+}
+
+/* Same as uuid_from_string() but s[UUID_LEN] is not required to be a null byte
+ * to succeed; that is, 's' need only begin with UUID syntax, not consist
+ * entirely of it. */
+bool
+uuid_from_string_prefix(struct uuid *uuid, const char *s)
{
static const char template[] = "00000000-1111-1111-2222-222233333333";
const char *t;
goto error;
}
*part = (*part << 4) + hexit_value(*s);
- } else if (*t != *s) {
- goto error;
} else if (*t == 0) {
return true;
+ } else if (*t != *s) {
+ goto error;
}
}