#include "spice.h"
#include <stdio.h>
#include "cpstd.h"
Go to the source code of this file.
#define COMP |
( |
|
ss, |
|
|
|
tt |
|
) |
| {char *s=ss, *t=tt; while(*s && *s == *t){s++; t++;} i = *s - *t;} |
void htab_add |
( |
char * |
name, |
|
|
void * |
data, |
|
|
void * |
listp |
|
) |
| |
Definition at line 37 of file hash.c.
struct s_hashlist * h_next
void htab_delete |
( |
char * |
name, |
|
|
void * |
listp |
|
) |
| |
Definition at line 90 of file hash.c.
106 COMP(name,h->h_name);
struct s_hashlist * h_next
int htab_empty |
( |
void * |
listp | ) |
|
void htab_free |
( |
void * |
listp, |
|
|
int |
freedata |
|
) |
| |
Definition at line 161 of file hash.c.
174 for (h = list[i]; h; h = hh) {
struct s_hashlist * h_next
void* htab_get |
( |
char * |
name, |
|
|
void * |
listp |
|
) |
| |
Definition at line 128 of file hash.c.
144 COMP(name,h->h_name);
struct s_hashlist * h_next
void* htab_list |
( |
void * |
listp | ) |
|
Definition at line 236 of file hash.c.
249 for (h = list[i]; h; h = h->
h_next) {
257 s = (
char**)
tmalloc(2*
sizeof(
char*));
struct wordlist * wl_prev
struct s_hashlist * h_next
struct wordlist * wl_next
void htab_print |
( |
void * |
listp, |
|
|
char * |
datafmt |
|
) |
| |
Definition at line 186 of file hash.c.
198 datafmt =
"hash=%d name=%s\n";
200 for (h = list[i]; h; h = h->
h_next) {
struct s_hashlist * h_next
void* htab_wl |
( |
void * |
listp | ) |
|
Definition at line 208 of file hash.c.
220 for (h = list[i]; h; h = h->
h_next) {
struct wordlist * wl_prev
struct s_hashlist * h_next
struct wordlist * wl_next