/* uuid.h * UUID generation  * * $Id: uuid.h 21694 2007-05-06 08:15:17Z gal $ * * Wireshark - Network traffic analyzer * By Gerald Combs <gerald@wireshark.org> * Copyright 1998 Gerald Combs * * 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. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA. *//*** Copyright (c) 1990- 1993, 1996 Open Software Foundation, Inc.** Copyright (c) 1989 by Hewlett-Packard Company, Palo Alto, Ca. &** Digital Equipment Corporation, Maynard, Mass.** Copyright (c) 1998 Microsoft.** To anyone who acknowledges that this file is provided "AS IS"** without any express or implied warranty: permission to use, copy,** modify, and distribute this file for any purpose is hereby** granted without fee, provided that the above copyright notices and** this notice appears in all source code copies, and that none of** the names of Open Software Foundation, Inc., Hewlett-Packard** Company, Microsoft, or Digital Equipment Corporation be used in** advertising or publicity pertaining to distribution of the software** without specific, written prior permission. Neither Open Software** Foundation, Inc., Hewlett-Packard Company, Microsoft, nor Digital** Equipment Corporation makes any representations about the** suitability of this software for any purpose.*/#undef uuid_ttypedef struct {    unsigned32  time_low;    unsigned16  time_mid;    unsigned16  time_hi_and_version;    unsigned8   clock_seq_hi_and_reserved;    unsigned8   clock_seq_low;    byte        node[6];} uuid_t;/* uuid_create -- generate a UUID */int uuid_create(uuid_t * uuid);/* uuid_create_md5_from_name -- create a version 3 (MD5) UUID using a   "name" from a "name space" */void uuid_create_md5_from_name(    uuid_t *uuid,         /* resulting UUID */    uuid_t nsid,          /* UUID of the namespace */    void *name,           /* the name from which to generate a UUID */    int namelen           /* the length of the name */);/* uuid_create_sha1_from_name -- create a version 5 (SHA-1) UUID   using a "name" from a "name space" */void uuid_create_sha1_from_name(    uuid_t *uuid,         /* resulting UUID */    uuid_t nsid,          /* UUID of the namespace */    void *name,           /* the name from which to generate a UUID */    int namelen           /* the length of the name */);/* uuid_compare --  Compare two UUID's "lexically" and return        -1   u1 is lexically before u2         0   u1 is equal to u2         1   u1 is lexically after u2   Note that lexical ordering is not temporal ordering!*/int uuid_compare(uuid_t *u1, uuid_t *u2);