summaryrefslogtreecommitdiff
path: root/src/data/hash.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/data/hash.c')
-rw-r--r--src/data/hash.c76
1 files changed, 38 insertions, 38 deletions
diff --git a/src/data/hash.c b/src/data/hash.c
index 091c679..3c01042 100644
--- a/src/data/hash.c
+++ b/src/data/hash.c
@@ -1,13 +1,13 @@
/*:*
*: File: ./src/data/hash.c
*: A simple interpreter
- *:
+ *:
*: WWW : http://fype.buetow.org
*: E-Mail : fype@dev.buetow.org
- *:
- *: Copyright (c) 2005 2006 2007 2008, Paul C. Buetow
+ *:
+ *: Copyright (c) 2005 2006 2007 2008, Paul C. Buetow
*: All rights reserved.
- *:
+ *:
*: Redistribution and use in source and binary forms, with or without modi-
*: fication, are permitted provided that the following conditions are met:
*: * Redistributions of source code must retain the above copyright
@@ -15,20 +15,20 @@
*: * 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.
- *: * Neither the name of P. B. Labs nor the names of its contributors may
- *: be used to endorse or promote products derived from this software
+ *: * Neither the name of P. B. Labs nor the names of its contributors may
+ *: be used to endorse or promote products derived from this software
*: without specific prior written permission.
- *:
- *: THIS SOFTWARE IS PROVIDED BY Paul Buetow AS IS'' AND ANY EXPRESS OR
- *: IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ *:
+ *: THIS SOFTWARE IS PROVIDED BY Paul Buetow 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 Paul Buetow 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)
+ *: DISCLAIMED. IN NO EVENT SHALL Paul Buetow 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
+ *: 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.
*:*/
@@ -50,7 +50,7 @@ hash_new(unsigned i_size) {
for (int i = 0; i < i_size; ++i)
p_hash->p_elems[i].flag = 'f';
- return p_hash;
+ return (p_hash);
}
void
@@ -71,7 +71,7 @@ hash_insert_ht(Hash *p_hash, char *c_key, void *p_val, TYPE type) {
int i_addr = hash_getaddr(p_hash, c_key, free_ADDR);
if (i_addr == RET_ERROR )
- return RET_NO_SPACE;
+ return (RET_NO_SPACE);
strncpy(p_hash->p_elems[i_addr].c_key, c_key, HASH_MKEYLEN);
@@ -80,12 +80,12 @@ hash_insert_ht(Hash *p_hash, char *c_key, void *p_val, TYPE type) {
p_hash->p_elems[i_addr].p_val = p_val;
p_hash->i_cur_size++;
- return RET_OK;
+ return (RET_OK);
}
RETCODE
hash_insert(Hash *p_hash, char *c_key, void *p_val) {
- return hash_insert_ht(p_hash, c_key, p_val, TYPE_VOIDP);
+ return (hash_insert_ht(p_hash, c_key, p_val, TYPE_VOIDP));
}
void*
@@ -96,20 +96,20 @@ hash_remove(Hash *p_hash, char *c_key) {
int i_addr = hash_getaddr(p_hash, c_key, OCC_ADDR);
if (i_addr == -1 )
- return 0;
+ return (NULL);
void *p_val = p_hash->p_elems[i_addr].p_val;
p_hash->p_elems[i_addr].flag = 'm';
p_hash->p_elems[i_addr].p_val = 0;
--p_hash->i_cur_size;
- return p_val;
+ return (p_val);
}
void*
hash_get_ht(Hash *p_hash, char *c_key, TYPE *p_type) {
int i_addr;
- return hash_get_ht_addr(p_hash, c_key, p_type, &i_addr);
+ return (hash_get_ht_addr(p_hash, c_key, p_type, &i_addr));
}
void*
@@ -117,16 +117,16 @@ hash_get_ht_addr(Hash *p_hash, char *c_key, TYPE *p_type, int *p_addr) {
int i_addr = *p_addr = hash_getaddr(p_hash, c_key, OCC_ADDR);
if (i_addr == -1 )
- return 0;
+ return (NULL);
*p_type = p_hash->p_elems[i_addr].type;
- return p_hash->p_elems[i_addr].p_val;
+ return (p_hash->p_elems[i_addr].p_val);
}
void*
hash_get(Hash *p_hash, char *c_key) {
TYPE type;
- return hash_get_ht(p_hash, c_key, &type);
+ return (hash_get_ht(p_hash, c_key, &type));
}
int
@@ -146,60 +146,60 @@ hash_getaddr(Hash *p_hash, char *c_key, HASH_OP OP) {
switch (OP) {
case free_ADDR:
if (!hash_addrisfree(p_hash,i_addr))
- return i_addr;
+ return (i_addr);
break;
case OCC_ADDR:
if (!hash_addrisocc(p_hash,i_addr, c_key))
- return i_addr;
+ return (i_addr);
break;
default:
- return RET_ERROR;
+ return (RET_ERROR);
}
- return hash_nextaddr(p_hash, p_hash->i_size, c_key, i_addr, OP);
+ return (hash_nextaddr(p_hash, p_hash->i_size, c_key, i_addr, OP));
}
RETCODE
hash_addrisfree(Hash *p_hash, int i_addr) {
if (p_hash->p_elems[i_addr].flag == 'f' ||
p_hash->p_elems[i_addr].flag == 'm')
- return RET_OK;
+ return (RET_OK);
- return RET_ERROR;
+ return (RET_ERROR);
}
RETCODE
hash_addrisocc(Hash *p_hash, int i_addr, char *c_key) {
if (p_hash->p_elems[i_addr].flag == 'o' &&
!strcmp(p_hash->p_elems[i_addr].c_key, c_key))
- return RET_OK;
+ return (RET_OK);
- return RET_ERROR;
+ return (RET_ERROR);
}
int
hash_nextaddr(Hash *p_hash, int i_max_tries, char *c_key, int i_addr,
HASH_OP OP) {
if ( --i_max_tries < 0 )
- return RET_ERROR;
+ return (RET_ERROR);
i_addr = (i_addr + 1) % p_hash->i_size;
switch (OP) {
case free_ADDR:
if (!hash_addrisfree(p_hash,i_addr))
- return i_addr;
+ return (i_addr);
break;
case OCC_ADDR:
if (!hash_addrisocc(p_hash,i_addr, c_key))
- return i_addr;
+ return (i_addr);
break;
}
- return hash_nextaddr(p_hash, i_max_tries, c_key, i_addr, OP);
+ return (hash_nextaddr(p_hash, i_max_tries, c_key, i_addr, OP));
}
void
@@ -280,7 +280,7 @@ hash_size(Hash *p_hash, int i_size) {
p_old_elems[i].p_val, p_old_elems[i].type);
free(p_old_elems);
- return RET_OK;
+ return (RET_OK);
}
void