Update all qemu_uuid users as well, especially get rid of the duplicated low level g_strdup_printf, sscanf and snprintf calls with QEMU UUID API. Since qemu_uuid_parse is quite tangled with qemu_uuid, its switching to QemuUUID is done here too to keep everything in sync and avoid code churn. Signed-off-by: Fam Zheng <famz@redhat.com> Reviewed-by: Eric Blake <eblake@redhat.com> Reviewed-by: Jeff Cody <jcody@redhat.com> Message-Id: <1474432046-325-10-git-send-email-famz@redhat.com>
60 lines
1.4 KiB
C
60 lines
1.4 KiB
C
/*
|
|
* QEMU UUID functions
|
|
*
|
|
* Copyright 2016 Red Hat, Inc.
|
|
*
|
|
* Authors:
|
|
* Fam Zheng <famz@redhat.com>
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License as published by the Free
|
|
* Software Foundation; either version 2 of the License, or (at your option)
|
|
* any later version.
|
|
*
|
|
*/
|
|
|
|
#ifndef QEMU_UUID_H
|
|
#define QEMU_UUID_H
|
|
|
|
#include "qemu-common.h"
|
|
|
|
/* Version 4 UUID (pseudo random numbers), RFC4122 4.4. */
|
|
|
|
typedef struct {
|
|
union {
|
|
unsigned char data[16];
|
|
struct {
|
|
/* Generated in BE endian, can be swapped with qemu_uuid_bswap. */
|
|
uint32_t time_low;
|
|
uint16_t time_mid;
|
|
uint16_t time_high_and_version;
|
|
uint8_t clock_seq_and_reserved;
|
|
uint8_t clock_seq_low;
|
|
uint8_t node[6];
|
|
} fields;
|
|
};
|
|
} QemuUUID;
|
|
|
|
#define UUID_FMT "%02hhx%02hhx%02hhx%02hhx-" \
|
|
"%02hhx%02hhx-%02hhx%02hhx-" \
|
|
"%02hhx%02hhx-" \
|
|
"%02hhx%02hhx%02hhx%02hhx%02hhx%02hhx"
|
|
|
|
#define UUID_FMT_LEN 36
|
|
|
|
#define UUID_NONE "00000000-0000-0000-0000-000000000000"
|
|
|
|
void qemu_uuid_generate(QemuUUID *out);
|
|
|
|
int qemu_uuid_is_null(const QemuUUID *uu);
|
|
|
|
void qemu_uuid_unparse(const QemuUUID *uuid, char *out);
|
|
|
|
char *qemu_uuid_unparse_strdup(const QemuUUID *uuid);
|
|
|
|
int qemu_uuid_parse(const char *str, QemuUUID *uuid);
|
|
|
|
void qemu_uuid_bswap(QemuUUID *uuid);
|
|
|
|
#endif
|