aboutsummaryrefslogtreecommitdiffstats
path: root/mail/p5-MIME-Types
stat options
Period:
Authors:

Commits per author per week (path 'mail/p5-MIME-Types')

AuthorW35 2024W36 2024W37 2024W38 2024Total
Total00000
generated by cgit (git 2.34.1) at 2024-09-23 00:35:19 +0800
d@Ximian.com> * ibex_internal.h (IBEX_OPEN_THRESHOLD): Bump this to 15, 5 seems a little small. Its still settable using an environmental variable though, hopefully with other fd optimisations this will not be an excessive number. svn path=/trunk/; revision=14471 * If we can't open blocks, dont try to deref it. (ibex_move): Dont try to02001-10-303-30/+44 | | | | | | | | | | | | | | 2001-10-30 <NotZed@Ximian.com> * ibex_block.c (ibex_reset): If we can't open blocks, dont try to deref it. (ibex_move): Dont try to rename if we have no file to rename. Change all callers to ibex_use to call it inside the lock. Otherwise it could change while we're trying to use it ... (ibex_use): Dont lock ib here, always assume we have it locked already, and dont try to close it if we run across it in the list. svn path=/trunk/; revision=14430 * If we can't open blocks, dont try to deref it.02001-10-302-3/+10 | | | | | | | | | 2001-10-30 <NotZed@Ximian.com> * ibex_block.c (ibex_reset): If we can't open blocks, dont try to deref it. svn path=/trunk/; revision=14423 * Always rename file even if mv failed.92001-10-292-5/+12 | | | | | | | | 2001-10-29 <NotZed@Ximian.com> * ibex_block.c (ibex_move): Always rename file even if mv failed. svn path=/trunk/; revision=14326 * New api entry to move an ibex file in an atomic way.82001-10-283-0/+32 | | | | | | | | | 2001-10-28 <NotZed@Ximian.com> * ibex_block.c (ibex_move): New api entry to move an ibex file in an atomic way. svn path=/trunk/; revision=14293 * More fixing of the license texts.Ettore Perazzoli2001-10-2810-90/+80 | | | | svn path=/trunk/; revision=14217 * Added environmental variable IBEX_OPEN_THRESHOLD which limits the maximum22001-10-132-1/+24 | | | | | | | | | | | 2001-10-12 <NotZed@Ximian.com> * ibex_block.c (ibex_use): Added environmental variable IBEX_OPEN_THRESHOLD which limits the maximum number of open ibex's that can be active at any time. The smallest this can be set to is the default of 5. svn path=/trunk/; revision=13642 * Turn off the o(x) debug set, & include alloca.h & config.h.02001-09-212-1/+10 | | | | | | | | | 2001-09-20 <NotZed@Ximian.com> * ibex_block.c: Turn off the o(x) debug set, & include alloca.h & config.h. svn path=/trunk/; revision=13033 * Turn off the o(x) debug set.02001-09-212-1/+5 | | | | | | | | 2001-09-20 <NotZed@Ximian.com> * ibex_block.c: Turn off the o(x) debug set. svn path=/trunk/; revision=13032 * Fix the tail space calculation, it didn't always take into account the72001-09-182-8/+19 | | | | | | | | | | | | 2001-09-17 <NotZed@Ximian.com> * disktail.c (tail_space): Fix the tail space calculation, it didn't always take into account the space used by a new tail node (i think). (tail_info): Add a failback assertion that end >= start. Fix all callers (needed to add blocks argument). svn path=/trunk/; revision=12923 * Force open of internal data before using it.Not Zed2001-08-162-0/+5 | | | | | | | | 2001-08-16 Not Zed <NotZed@Ximian.com> * dumpindex.c (main): Force open of internal data before using it. svn path=/trunk/; revision=12056 * Use a next pointer so we keep the list intact as we scan it.Not Zed2001-08-153-4/+12 | | | | | | | | | 2001-08-16 Not Zed <NotZed@Ximian.com> * ibex_block.c (ibex_use): Use a next pointer so we keep the list intact as we scan it. svn path=/trunk/; revision=12049 * New function to limit use of fd's. Mark an ibex file in use, re-open ifNot Zed2001-08-153-5/+216 | | | | | | | | | | | | | | | | | | | 2001-08-15 Not Zed <NotZed@Ximian.com> * ibex_block.c (ibex_use): New function to limit use of fd's. Mark an ibex file in use, re-open if necessary, and close off another (lru) if necessary. (ibex_unuse): Mark an ibex as not in use. (ibex_open): Delay opening of the actual block file till later, and add the ibex to a global list. (ibex_save): Use/unuse around operations. (close_backend): Zero out blocks when closed. (ibex_close): Remove the ibex from the global list before closing it down. (ibex_index_buffer, ibex_find, ibex_unindex, ibex_find_name): Use/unuse around ops. svn path=/trunk/; revision=12042 * NOOP if writing to a failed file. (word_index_pre): NOOP if failed file.Not Zed2001-08-1010-60/+240 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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 * Update the copyrights, replacing Helix Code with Ximian andEttore Perazzoli2001-06-2310-18/+18 | | | | | | helixcode.com with ximian.com all over the place. svn path=/trunk/; revision=10440 * Add GAL_LIBS here too. (testindex_LDADD): And here.Peter Williams2001-06-022-2/+7 | | | | | | | | | 2001-06-01 Peter Williams <peterw@ximian.com> * Makefile.am (dumpindex_LDADD): Add GAL_LIBS here too. (testindex_LDADD): And here. svn path=/trunk/; revision=10080 * Add GAL_LIBS for gunicode stuff (until glib 2.0) (INCLUDES): UseDan Winship2001-04-276-736/+35 | | | | | | | | | | | | | | | * Makefile.am (libibex_la_LIBADD): Add GAL_LIBS for gunicode stuff (until glib 2.0) (INCLUDES): Use EXTRA_GNOME_CFLAGS (dumpindex_LDADD, testindex_LDADD): fix Remove references to mkindex and lookup. * ibex_block.c (ibex_normalise_word, utf8_category): Convert to gunicode interfaces * ibex_db.c, lookup.c, mkindex.c: Unused, remove. svn path=/trunk/; revision=9584 * Oops, fix build.Michael Zucci2001-04-031-1/+3 | | | | svn path=/trunk/; revision=9110 * heavier testing of libbbexMichael Zucci2001-04-031-17/+134 | | | | svn path=/trunk/; revision=9109 * Header shuffling. Move glibc headers before gnome stuff. Same here. AddedKjartan Maraas2001-03-264-4/+13 | | | | | | | | | | | | 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 * Merge from camel-mt-branch.Not Zed2000-12-246-6/+128 | | | | | | | | 2000-12-24 Not Zed <NotZed@HelixCode.com> * Merge from camel-mt-branch. svn path=/trunk/; revision=7152 * Added some casts to get rid of warnings. (tail_dump): #if 0ed this out toChristopher James Lahey2000-12-143-6/+20 | | | | | | | | | | | | | | 2000-12-13 Christopher James Lahey <clahey@helixcode.com> * disktail.c (tail_compress): (tail_get): Added some casts to get rid of warnings. (tail_dump): #if 0ed this out to get rid of a warning. (ibex_diskarray_dump): Added a prototype. * ibex_block.c (ibex_index_buffer): Assigned cat the value 0 to start off with to avoid a warning. svn path=/trunk/; revision=6993 * Made cache_sanity only be included if d(x) is defined as x.Christopher James Lahey2000-12-133-1/+14 | | | | | | | | | | | | | 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 * ShushJP Rosevear2000-11-291-3/+2 | | | | svn path=/trunk/; revision=6709 * Turn off index stats by default.Not Zed2000-11-285-17/+31 | | | | | | | | | | | | | | | | | 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 * If we have the namecache active, and there is no name there, we add itNot Zed2000-11-274-5/+278 | | | | | | | | | | | | 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 * Initialise nameinit & namecache. (contains_name): On first call, load allNot Zed2000-11-163-1/+76 | | | | | | | | | | | | | | | | | | 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 * #include <stdlib.h> to remove warning. #include <stdlib.h> and <string.h>.Kjartan Maraas2000-10-313-0/+8 | | | | | | | | | 2000-10-30 Kjartan Maraas <kmaraas@gnome.org> * hash.c: #include <stdlib.h> to remove warning. * wordindex.c: #include <stdlib.h> and <string.h>. svn path=/trunk/; revision=6278 * Oopps, knew i shoul'dve compiled before committing.Michael Zucci2000-10-263-2/+4 | | | | | | (IBEX_VERSION): moved into block.h svn path=/trunk/; revision=6193 * Another slight performance improvement, reads the list of wordsNot Zed2000-10-264-29/+67 | | | | | | | | | | | | | | | | | | | | | | | faster when starting indexing of new data. 2000-10-26 Not Zed <NotZed@HelixCode.com> * block.c (ibex_block_cache_open): Use IBEX_VERSION rather than hardcoded version string. * ibex_internal.h (IBEX_VERSION): Bumped version again. This time I did change the index format. * hash.c (struct _hashroot): Add a linked list of keys to the table. (struct _hashblock): Added a next pointer as a block number. (hash_insert): Link new key blocks into the key block list. (struct _HASHCursor): Renamed block to key and added a block item. (hash_cursor_next): Changed to go through the linked list of all hash items rather than through each hash chain separately. >> faster. (ibex_hash_dump_rec): Remove a warning. svn path=/trunk/; revision=6192 * No longer include <db.h>52000-10-262-1/+4 | | | | | | | | | | | | | 2000-10-25 <jpr@helixcode.com> * ibex_block.c: No longer include <db.h> 2000-10-25 <jpr@helixcode.com> * e-shortcuts-view-model.c (load_group_into_model): Set folder to NULL to kill warning svn path=/trunk/; revision=6180 * Bugfixes, performance improvemnts. Should scale up much better thanNot Zed2000-10-2513-86/+1121 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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 * ShushJP Rosevear2000-10-252-0/+5 | | | | | | | | 2000-10-24 JP Rosevear <jpr@helixcode.com> * .cvsignore: Shush svn path=/trunk/; revision=6147 * Dumps the contents of indexs.Not Zed2000-10-245-6/+91 | | | | | | | | | | | | 2000-10-24 Not Zed <NotZed@HelixCode.com> * dumpindex.c: Dumps the contents of indexs. * hash.c (ibex_hash_dump_rec): Also print the word count. * wordindex.c (unindex_name): Cross-check the cache as well. svn path=/trunk/; revision=6139 * Bumped ibex rev.Not Zed2000-10-123-3/+8 | | | | | | | | | | | 2000-10-12 Not Zed <NotZed@HelixCode.com> * ibex_internal.h (struct ibex): Bumped ibex rev. * block.c (ibex_block_cache_open): Bumped the ibex file revision because of the hash table size change. svn path=/trunk/; revision=5887 * Added some stat stuff.Not Zed2000-10-125-26/+187 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 2000-10-12 Not Zed <NotZed@HelixCode.com> * index.h: Added some stat stuff. * wordindex.c (struct _wordcache): Changed files[] to be a pointer to an allocated block/or an individual item. (find): Fix for changes to struct. (find_name): " (sync_cache_entry): " (add): " (add_list): " (add_index_cache): Free the cache file array if it was created. (word_flush): And here. (word_close): And here too. (ibex_create_word_index): Double the size of the hashtables. (word_flush): Make sure we reset the wordcount to 0 if we remove the list items. DOH. (add_index_cache): Use a slightly more sohpisticated aging algorithm to remove expired nodes. 2000-10-10 Not Zed <NotZed@HelixCode.com> * hash.c (hash_find): (hash_remove): (hash_insert): Truncate key if it is too big to fit in a single block to MAX_KEYLEN bytes. svn path=/trunk/; revision=5882 * Truncate key if it is too big to fit in a single block to MAX_KEYLENNot Zed2000-10-102-0/+22 | | | | | | | | | | | 2000-10-10 Not Zed <NotZed@HelixCode.com> * hash.c (hash_find): (hash_remove): (hash_insert): Truncate key if it is too big to fit in a single block to MAX_KEYLEN bytes. svn path=/trunk/; revision=5815 * Make sure we map the 'free' block to a block number when unlinking a blockNot Zed2000-09-284-11/+72 | | | | | | | | | | | | | | | | | | | | 2000-09-28 Not Zed <NotZed@HelixCode.com> * block.c (ibex_block_free): Make sure we map the 'free' block to a block number when unlinking a block (fixes a lot of assertion failures). (ibex_block_cache_open): Initialise sync flag on root block. If it is not set on open then the index could be in an invalid state, and should be rescanned. (ibex_block_cache_sync): Sync root block last, and set the sync flag. (ibex_block_cache_open): Mirror root block flags in block_cache struct. (ibex_block_cache_sync): Likewise. (ibex_block_read): If we write a dirty block, then we clear the sync flag if its still set; we are no longer synced. svn path=/trunk/; revision=5613 * Include errno.hMiguel de Icaza2000-09-211-0/+1 | | | | svn path=/trunk/; revision=5537 * ** Merged from IBEX_DISK branch to head.Not Zed2000-09-1916-924/+3681 | | | | | | | | 2000-09-19 Not Zed <NotZed@HelixCode.com> ** Merged from IBEX_DISK branch to head. svn path=/trunk/; revision=5500 * ChangeLog mistake.Chris Lahey2000-08-101-1/+1 | | | | svn path=/trunk/; revision=4668 * Fixed some warnings.NotZed2000-08-10