| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
2001-08-10 Not Zed <NotZed@Ximian.com>
* wordindexmem.c (sync_cache_entry): NOOP if writing to a failed
file.
(word_index_pre): NOOP if failed file.
(ibex_create_word_index_mem): Setup blocks value.
** Added internal exception handling to libibex, in the case of
errors with on-disk data, exceptions are returned.
* block.c (ibex_block_cache_open): Detect fatal errors below us
and clean up appropriately.
(ibex_block_cache_fail): New function to handle the failure, and
keep track of it.
(ibex_block_cache_sync): Dont do anything if we've failed on this
file.
* disktail.c (tail_compress): Add blocks param so we can assert
for exceptions.
* hash.c, block.c disktail.c: g_assert->ibex_block_cache_assert
where dealing with external data.
* hash.c (hash_info): Add index param so we can assert for exceptions.
* ibex_block.c (ibex_index_buffer): Setjmp before calling into
internal routines.
(ibex_save): "
(ibex_unindex): "
(ibex_find): "
(ibex_find_name): "
(ibex_contains_name): "
(ibex_reset): Function to reset the index file if we have an
error, call when we have an error.
* block.h (ibex_block_cache_assert): Create assertion/exception
macros, and include a setjmp buffer for returning it.
2001-08-09 Not Zed <NotZed@Ximian.com>
* Makefile.am (libibex_la_SOURCES): Remove wordindex.c,
wordindexmem is what's used.
svn path=/trunk/; revision=11864
|
| |
|
|
|
|
| |
helixcode.com with ximian.com all over the place.
svn path=/trunk/; revision=10440
|
| |
|
|
|
|
|
|
|
|
|
|
| |
2001-03-26 Kjartan Maraas <kmaraas@gnome.org>
* disktail.c: Header shuffling. Move glibc headers before
gnome stuff.
* testindex.c: Same here.
* wordindexmem.c: Added <string.h> and <stdlib.h> to quench
warnings from newer gcc.
svn path=/trunk/; revision=8938
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
2000-12-12 Christopher James Lahey <clahey@helixcode.com>
* wordindex.c (cache_sanity): Made cache_sanity only be included
if d(x) is defined as x.
* wordindexmem.c: Made node_sanity and cache_sanity only be
included if d(x) is defined as x or if MALLOC_CHECK is defined.
Made sync_value only be included if d(x) is defined as x.
svn path=/trunk/; revision=6947
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
2000-11-28 Not Zed <NotZed@HelixCode.com>
* index.h: Turn off index stats by default.
* ibex_block.c (ibex_save): And here.
(ibex_close): Debug out printfs.
* wordindexmem.c (ibex_create_word_index_mem): And here.
(num): Made buf static.
* block.c (ibex_block_cache_open): Debug out some printfs.
(ibex_block_read): And here.
svn path=/trunk/; revision=6691
|
| |
|
|
|
|
|
|
|
|
|
|
| |
2000-11-17 Not Zed <NotZed@HelixCode.com>
* wordindexmem.c (add_list): If we have the namecache active, and
there is no name there, we add it directly and dont look it up
first.
* testindex.c: Some performance testing & stat gathering stuff.
svn path=/trunk/; revision=6677
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
2000-11-16 Not Zed <NotZed@HelixCode.com>
* wordindexmem.c (ibex_create_word_index_mem): Initialise nameinit
& namecache.
(contains_name): On first call, load all names into memory. We
usually do a whole lot of lookups in a row, and this saves a lot
of penalties on a big list, for not too much a memory hit.
(find_name): If we have the namelist in memory do a quick
short-circuit check to see if we have to do further processing.
(unindex_name): Cross check the namecache, if it is active.
Remove it there too/or exit (no work to do).
(word_flush): If we have the namecache active, destroy it now, as
it is not needed anymore (for now).
svn path=/trunk/; revision=6591
|
|
|
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
|
