9aae808cd0
before, and be more bugfree than ever! 2000-10-25 Not Zed <NotZed@HelixCode.com> * ibex_internal.h (IBEX_VERSION): Bumped to another version. The file format hasn't changed, but earlier bugs may create invalid files. * block.c (ibex_block_read): Use the root data directly. (ibex_block_cache_open): As well. (ibex_block_get): And here too. (ibex_block_cache_sync): Sync the root block directly here. * block.h: Pad root block out to 1024 bytes. Added root block to struct _memcache. * disktail.c (tail_get): Dirty the root block. (tail_get): Fix for changes to root access. (disk_remove): And here too. * wordindexmem.c (sync_cache_entry): Handle the case of not having any files in the list, which can happen now. (word_index_pre): Make sure we set the wordid on the new cache entry. * ibex_block.c (ibex_save): Sigh. Pass the right argument to index_post. * block.c (ibex_block_cache_open): Create a word_index_mem for indexing the words, rather than a word_index. * ibex_block.c (ibex_index_buffer): If we haven't called index_pre yet, do it before indexing anything. (ibex_save): If wehave called index_pre previously, call index_post. (ibex_close): And same for here. * index.h: Added a cursor class, and cursor retrieval function for iterating through an index's keys. * wordindexmem.c (ibex_create_word_index_mem): New word class, similar to wordindex, but meant to be faster for updates. (word_index_pre): Implement. We load all keys into memory. (word_index_post): Implement. We sync and free all keys. (find): Remove lru code, its no longer a cache, but a lookup table. (add_index_cache): Remove lru code here too. (find_name): And here. (word_flush): Flush the hashtable direct. (word_close): Call flush to flush, rather than doing it ourselves. (add_index_cache): If we are in an index state, we can assume a cache miss == a new word. (word_index_post): Maintain whether or not we are in an index state, and the depth of the state. (word_index_pre): Likewise. Dont reread the index if we have already. (cache_sanity): Fixed for struct changes. * wordindex.h (IBEXWordClass): Added functions to prepare/cleanup for lots of indexing. i.e. can be used to optimise indexing speed at the cost of extra memory usage during the indexing process. * hash.c (hash_cursor_create): Create a new cursor for iterating through a hashtable. (hash_cursor_close): 'close' the cursor. It is upto the application to close any cursors it creates. (hash_cursor_next): Goto the next key id. (hash_cursor_next_key): Goto the next key, reutrn the key. (hash_get_cursor): Return a cursor object. * wordindex.c (word_index_post): (word_index_pre): Added (empty) callbacks for pre/post functions. svn path=/trunk/; revision=6165
37 lines
723 B
Makefile
37 lines
723 B
Makefile
## Process this file with automake to produce Makefile.in
|
|
|
|
noinst_LTLIBRARIES = libibex.la
|
|
|
|
libibex_la_SOURCES = \
|
|
wordindex.c wordindexmem.c \
|
|
block.c ibex.h \
|
|
hash.c \
|
|
disktail.c \
|
|
ibex_block.c
|
|
|
|
libibex_la_LDFLAGS = -static
|
|
|
|
noinst_HEADERS = \
|
|
ibex_internal.h \
|
|
block.h \
|
|
wordindex.h \
|
|
index.h
|
|
|
|
INCLUDES = -I$(srcdir) $(GLIB_CFLAGS) $(UNICODE_CFLAGS) \
|
|
-DG_LOG_DOMAIN=\"libibex\"
|
|
|
|
|
|
noinst_PROGRAMS = dumpindex
|
|
|
|
dumpindex_SOURCES = dumpindex.c
|
|
dumpindex_LDADD = libibex.la $(GLIB_LIBS) $(UNICODE_LIBS)
|
|
|
|
#noinst_PROGRAMS = mkindex lookup
|
|
#
|
|
#mkindex_SOURCES = mkindex.c
|
|
#mkindex_LDADD = libibex.la $(GLIB_LIBS) $(UNICODE_LIBS)
|
|
#
|
|
#lookup_SOURCES = lookup.c
|
|
#lookup_LDADD = libibex.la $(GLIB_LIBS) $(UNICODE_LIBS)
|
|
|