65 lines
2.0 KiB
C
65 lines
2.0 KiB
C
|
/* $FreeBSD$ */
|
||
|
/* $NetBSD: citrus_db_hash.c,v 1.5 2008/02/09 14:56:20 junyoung Exp $ */
|
||
|
|
||
|
/*-
|
||
|
* Copyright (c)2003 Citrus Project,
|
||
|
* All rights reserved.
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions
|
||
|
* are met:
|
||
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer.
|
||
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
* documentation and/or other materials provided with the distribution.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
||
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
||
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
* SUCH DAMAGE.
|
||
|
*/
|
||
|
|
||
|
#include <sys/cdefs.h>
|
||
|
#include <sys/types.h>
|
||
|
|
||
|
#include <assert.h>
|
||
|
#include <stdio.h>
|
||
|
#include <string.h>
|
||
|
|
||
|
#include "citrus_namespace.h"
|
||
|
#include "citrus_types.h"
|
||
|
#include "citrus_bcs.h"
|
||
|
#include "citrus_region.h"
|
||
|
#include "citrus_db_hash.h"
|
||
|
|
||
|
uint32_t
|
||
|
_citrus_db_hash_std(struct _region *r)
|
||
|
{
|
||
|
const uint8_t *p;
|
||
|
uint32_t hash, tmp;
|
||
|
size_t i;
|
||
|
|
||
|
hash = 0;
|
||
|
p = _region_head(r);
|
||
|
|
||
|
for (i = _region_size(r); i > 0; i--) {
|
||
|
hash <<= 4;
|
||
|
hash += _bcs_tolower(*p);
|
||
|
tmp = hash & 0xF0000000;
|
||
|
if (tmp != 0) {
|
||
|
hash ^= tmp;
|
||
|
hash ^= tmp >> 24;
|
||
|
}
|
||
|
p++;
|
||
|
}
|
||
|
return (hash);
|
||
|
}
|