Re: [PATCH 0/2] A new merge algorithm, take 3

2005-09-08 Thread Chuck Lever
Linus Torvalds wrote: On Thu, 8 Sep 2005, Junio C Hamano wrote: Yes, the reading of three trees upfront is probably the culprit in your case However, note that _most_ tree reading just reads one. Merges may take half a second, and yes, when I did it, the fact that we move things around

Re: [PATCH 0/2] A new merge algorithm, take 3

2005-09-08 Thread Chuck Lever
Linus Torvalds wrote: On Thu, 8 Sep 2005, Chuck Lever wrote: in my case the merges were taking significantly longer than a half second. making this change is certainly not worth it if merges are running fast... Note that in cold-cache cases, all the expense of read-tree is in actually