2 * Copyright (C) 1994, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.16 1995-12-06 14:41:13 adam
8 * New function: dict_delete.
10 * Revision 1.15 1995/10/27 13:59:17 adam
11 * Function dict_look_grep got extra parameter max_pos that upon return
12 * hold length of longest prefix that matches pattern.
14 * Revision 1.14 1995/10/09 16:18:35 adam
15 * Function dict_lookup_grep got extra client data parameter.
17 * Revision 1.13 1995/10/06 09:03:51 adam
18 * First version of scan.
20 * Revision 1.12 1995/09/14 11:53:02 adam
21 * Grep handle function parameter info is const now.
23 * Revision 1.11 1995/09/04 09:09:51 adam
24 * String arg in dict lookup is const.
27 * Revision 1.10 1994/10/05 12:16:58 adam
28 * Pagesize is a resource now.
30 * Revision 1.9 1994/10/04 12:08:19 adam
33 * Revision 1.8 1994/10/03 17:23:11 adam
34 * First version of dictionary lookup with regular expressions and errors.
36 * Revision 1.7 1994/09/22 10:44:47 adam
37 * Don't remember what changed!!
39 * Revision 1.6 1994/09/16 15:39:21 adam
40 * Initial code of lookup - not tested yet.
42 * Revision 1.5 1994/09/06 13:05:29 adam
43 * Further development of insertion. Some special cases are
44 * not properly handled yet! assert(0) are put here. The
45 * binary search in each page definitely reduce usr CPU.
47 * Revision 1.4 1994/09/01 17:44:40 adam
48 * Work on insertion in dictionary. Not finished yet.
50 * Revision 1.3 1994/08/18 12:41:12 adam
51 * Some development of dictionary. Not finished at all!
53 * Revision 1.2 1994/08/17 13:32:33 adam
54 * Use cache in dict - not in bfile.
56 * Revision 1.1 1994/08/16 16:26:53 adam
66 typedef unsigned Dict_ptr;
67 typedef char Dict_char;
72 Dict_ptr free_list, last;
75 struct Dict_file_block
77 struct Dict_file_block *h_next, **h_prev;
78 struct Dict_file_block *lru_next, *lru_prev;
84 typedef struct Dict_file_struct
89 struct Dict_file_block *all_blocks;
90 struct Dict_file_block *free_list;
91 struct Dict_file_block **hash_array;
93 struct Dict_file_block *lru_back, *lru_front;
102 typedef struct Dict_struct {
105 struct Dict_head head;
109 #define DICT_MAGIC "dict00"
111 #define DICT_DEFAULT_PAGESIZE "8192"
113 int dict_bf_readp (Dict_BFile bf, int no, void **bufp);
114 int dict_bf_newp (Dict_BFile bf, int no, void **bufp);
115 int dict_bf_touch (Dict_BFile bf, int no);
116 void dict_bf_flush_blocks (Dict_BFile bf, int no_to_flush);
117 Dict_BFile dict_bf_open (const char *name, int block_size, int cache, int rw);
118 int dict_bf_close (Dict_BFile dbf);
120 Dict dict_open (const char *name, int cache, int rw);
121 int dict_close (Dict dict);
122 int dict_insert (Dict dict, const Dict_char *p, int userlen,
124 int dict_delete (Dict dict, const Dict_char *p);
125 char *dict_lookup (Dict dict, const Dict_char *p);
126 int dict_lookup_ec (Dict dict, Dict_char *p, int range,
127 int (*f)(Dict_char *name));
128 int dict_lookup_grep (Dict dict, Dict_char *p, int range, void *client,
130 int (*f)(Dict_char *name, const char *info,
132 int dict_strcmp (const Dict_char *s1, const Dict_char *s2);
133 int dict_strlen (const Dict_char *s);
134 int dict_scan (Dict dict, Dict_char *str,
135 int *before, int *after, void *client,
136 int (*f)(Dict_char *name, const char *info, int pos,
140 #define DICT_type(x) 0[(Dict_ptr*) x]
141 #define DICT_backptr(x) 1[(Dict_ptr*) x]
142 #define DICT_nextptr(x) 2[(Dict_ptr*) x]
143 #define DICT_nodir(x) 0[(short*)((char*)(x)+3*sizeof(Dict_ptr))]
144 #define DICT_size(x) 1[(short*)((char*)(x)+3*sizeof(Dict_ptr))]
145 #define DICT_infoffset (3*sizeof(Dict_ptr)+2*sizeof(short))
146 #define DICT_pagesize(x) ((x)->head.page_size)
148 #define DICT_to_str(x) sizeof(Dict_info)+sizeof(Dict_ptr)
152 backptr pointer to parent
153 nextptr pointer to next page (if any)
155 size size of strings,info,ptr entries