Tue, 18 Apr 2006 14:56:54 -0700 mq: do not fail if directory to create exists
Vadim Gelfer <vadim.gelfer@gmail.com> [Tue, 18 Apr 2006 14:56:54 -0700] rev 2086
mq: do not fail if directory to create exists
Tue, 18 Apr 2006 19:50:12 -0400 merge revlogng with mpm tip
Chris Mason <mason@suse.com> [Tue, 18 Apr 2006 19:50:12 -0400] rev 2085
merge revlogng with mpm tip
Mon, 17 Apr 2006 13:19:58 -0400 Fix transaction handling during interleaved file split.
Chris Mason <mason@suse.com> [Mon, 17 Apr 2006 13:19:58 -0400] rev 2084
Fix transaction handling during interleaved file split.
Sat, 08 Apr 2006 20:10:46 -0400 merge 0.8.1 with revlogng
Chris Mason <mason@suse.com> [Sat, 08 Apr 2006 20:10:46 -0400] rev 2083
merge 0.8.1 with revlogng
Sat, 08 Apr 2006 20:08:06 -0400 Additional appendfile fixes for interleaved data/index files
mason@suse.com [Sat, 08 Apr 2006 20:08:06 -0400] rev 2082
Additional appendfile fixes for interleaved data/index files The appendfile code was not passing default version info to the changelog or manifest classes, and so they were always being created as version 0. revlog.checkinlinesize had to be corrected to seek to the end of the index file when no index file was passed (only clone does this)
Thu, 06 Apr 2006 20:13:09 -0400 Speedup revlog.ancestors for the linear case
Chris Mason <mason@suse.com> [Thu, 06 Apr 2006 20:13:09 -0400] rev 2081
Speedup revlog.ancestors for the linear case revlog.ancestors can be expensive on big repos. This cuts down the overall time for hg update by ~19% by short cutting revlog.ancestors when one of the revisions is reachable from another.
Tue, 04 Apr 2006 19:00:40 -0400 Reduce index memory usage by storing the bare string instead of tuples
mason@suse.com [Tue, 04 Apr 2006 19:00:40 -0400] rev 2080
Reduce index memory usage by storing the bare string instead of tuples Storing the tuple returned by struct.unpack significantly increases the memory required to store the entire index in ram. This patch uses struct.unpack on demand instead.
Tue, 04 Apr 2006 16:47:12 -0400 New lazy index code for revlogs.
mason@suse.com [Tue, 04 Apr 2006 16:47:12 -0400] rev 2079
New lazy index code for revlogs. This tunes for large repositories. It does not read the whole index file in one big chunk, but tries to buffer reads in more reasonable chunks instead. Search speeds are improved in two ways. When trying to find a specific sha hash, it searches from the end of the file backward. More recent entries are more likely to be relevant, especially the tip. Also, this can load only the mapping of nodes to revlog index number. Loading the map uses less cpu (no struct.unpack) and much less memory than loading both the map and the index. This cuts down the time for hg tip on the 80,000 changeset kernel repo from 1.8s to 3.69s. Most commands the pull a single rev out of a big index get roughly the same benefit. Commands that read the whole index are not slower.
Tue, 04 Apr 2006 16:38:44 -0400 Fill in the uncompressed size during revlog.addgroup
mason@suse.com [Tue, 04 Apr 2006 16:38:44 -0400] rev 2078
Fill in the uncompressed size during revlog.addgroup This uses code from Matt to calculate the size change that would result from applying a delta to keep an accurate running total of the text size during revlog.addgroup
Tue, 04 Apr 2006 16:38:44 -0400 Fix inlined revlogs to seek to eof after opening "a+"
mason@suse.com [Tue, 04 Apr 2006 16:38:44 -0400] rev 2077
Fix inlined revlogs to seek to eof after opening "a+"
(0) -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip