1*e6f98e3aSguenther /* $OpenBSD: uuid_hash.c,v 1.2 2015/09/10 18:13:46 guenther Exp $ */
29a210c53Smiod /* $NetBSD: uuid_hash.c,v 1.2 2008/04/23 07:52:32 plunky Exp $ */
39a210c53Smiod
49a210c53Smiod /*
59a210c53Smiod * Copyright (c) 2002 Marcel Moolenaar
69a210c53Smiod * Copyright (c) 2002 Hiten Mahesh Pandya
79a210c53Smiod * All rights reserved.
89a210c53Smiod *
99a210c53Smiod * Redistribution and use in source and binary forms, with or without
109a210c53Smiod * modification, are permitted provided that the following conditions
119a210c53Smiod * are met:
129a210c53Smiod * 1. Redistributions of source code must retain the above copyright
139a210c53Smiod * notice, this list of conditions and the following disclaimer.
149a210c53Smiod * 2. Redistributions in binary form must reproduce the above copyright
159a210c53Smiod * notice, this list of conditions and the following disclaimer in the
169a210c53Smiod * documentation and/or other materials provided with the distribution.
179a210c53Smiod *
189a210c53Smiod * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
199a210c53Smiod * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
209a210c53Smiod * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
219a210c53Smiod * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
229a210c53Smiod * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
239a210c53Smiod * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
249a210c53Smiod * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
259a210c53Smiod * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
269a210c53Smiod * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
279a210c53Smiod * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
289a210c53Smiod * SUCH DAMAGE.
299a210c53Smiod *
309a210c53Smiod * $FreeBSD: src/lib/libc/uuid/uuid_hash.c,v 1.2 2003/08/08 19:18:43 marcel Exp $
319a210c53Smiod */
329a210c53Smiod
339a210c53Smiod #include <uuid.h>
349a210c53Smiod
359a210c53Smiod /*
369a210c53Smiod * uuid_hash() - generate a hash value.
379a210c53Smiod * See also:
389a210c53Smiod * http://www.opengroup.org/onlinepubs/009629399/uuid_hash.htm
399a210c53Smiod */
409a210c53Smiod uint16_t
uuid_hash(const uuid_t * u,uint32_t * status)419a210c53Smiod uuid_hash(const uuid_t *u, uint32_t *status)
429a210c53Smiod {
439a210c53Smiod if (status)
449a210c53Smiod *status = uuid_s_ok;
459a210c53Smiod
469a210c53Smiod /*
479a210c53Smiod * Use the most frequently changing bits in the UUID as the hash
489a210c53Smiod * value. This should yield a good enough distribution...
499a210c53Smiod */
509a210c53Smiod return ((u) ? u->time_low & 0xffff : 0);
519a210c53Smiod }
52