/*
* ngIRCd -- The Next Generation IRC Daemon
- * Copyright (c)2001,2002 by Alexander Barton (alex@barton.de)
+ * Copyright (c)2001-2010 Alexander Barton (alex@barton.de)
*
- * Dieses Programm ist freie Software. Sie koennen es unter den Bedingungen
- * der GNU General Public License (GPL), wie von der Free Software Foundation
- * herausgegeben, weitergeben und/oder modifizieren, entweder unter Version 2
- * der Lizenz oder (wenn Sie es wuenschen) jeder spaeteren Version.
- * Naehere Informationen entnehmen Sie bitter der Datei COPYING. Eine Liste
- * der an ngIRCd beteiligten Autoren finden Sie in der Datei AUTHORS.
- *
- * $Id: hash.c,v 1.4 2002/03/25 19:11:01 alex Exp $
- *
- * hash.c: Hash-Werte berechnen
+ * 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.
+ * Please read the file COPYING, README and AUTHORS for more information.
*/
-
#include "portab.h"
+/**
+ * @file
+ * Hash calculation
+ */
+
#include "imp.h"
#include <assert.h>
#include <string.h>
#include "defines.h"
-#include "log.h"
#include "tool.h"
#include "exp.h"
#include "hash.h"
+static UINT32 jenkins_hash PARAMS((register UINT8 *k, register UINT32 length,
+ register UINT32 initval));
-LOCAL UINT32 jenkins_hash( register UINT8 *k, register UINT32 length, register UINT32 initval);
-
-
-GLOBAL UINT32 Hash( CHAR *String )
+/**
+ * Calculate hash value for a given string.
+ *
+ * @param String Input string
+ * @return 32 bit hash value
+ */
+GLOBAL UINT32
+Hash( const char *String )
{
- /* Hash-Wert ueber String berechnen */
+ char buffer[LINE_LEN];
- CHAR buffer[LINE_LEN];
-
- strncpy( buffer, String, LINE_LEN - 1 );
- buffer[LINE_LEN - 1] = '\0';
-
- return jenkins_hash( (UINT8 *)ngt_LowerStr( buffer ), strlen( buffer ), 42 );
+ strlcpy(buffer, String, sizeof(buffer));
+ return jenkins_hash((UINT8 *)ngt_LowerStr(buffer),
+ (UINT32)strlen(buffer), 42);
} /* Hash */
-
/*
- * Die hier verwendete Hash-Funktion stammt aus lookup2.c von Bob Jenkins
- * (URL: <http://burtleburtle.net/bob/c/lookup2.c>). Aus dem Header:
+ * This hash function originates from lookup2.c of Bob Jenkins
+ * (URL: <http://burtleburtle.net/bob/c/lookup2.c>):
* --------------------------------------------------------------------
* lookup2.c, by Bob Jenkins, December 1996, Public Domain.
* hash(), hash2(), hash3, and mix() are externally useful functions.
* Routines to test the hash are included if SELF_TEST is defined.
* You can use this free for any purpose. It has no warranty.
* --------------------------------------------------------------------
- * nicht alle seiner Funktionen werden hier genutzt.
+ * Not all of his functions are used here.
*/
-
#define hashsize(n) ((UINT32)1<<(n))
#define hashmask(n) (hashsize(n)-1)
c -= a; c -= b; c ^= (b>>15); \
} /* mix */
-
-LOCAL UINT32 jenkins_hash( register UINT8 *k, register UINT32 length, register UINT32 initval)
+static UINT32
+jenkins_hash( register UINT8 *k, register UINT32 length, register UINT32 initval )
{
/* k: the key
* length: length of the key
/* handle the last 11 bytes */
c += length;
- switch(len) /* all the case statements fall through */
+ switch( (int)len ) /* all the case statements fall through */
{
case 11: c+=((UINT32)k[10]<<24);
case 10: c+=((UINT32)k[9]<<16);
return c;
} /* jenkins_hash */
-
/* -eof- */