Re: [PATCH] Additional merge-base tests
- From
Johannes Schindelin <johannes.schindelin@gmx.de>
- Date
- Jul 4, 2006, 11:35 UTC
- Message-ID
- <Pine.LNX.4.63.0607041334070.29667@wbgn013.biozentrum.uni-wuerzburg.de>
- In-Reply-To
- <e8dim7$8cm$1@sea.gmane.org>
Hi,
On Tue, 4 Jul 2006, Jakub Narebski wrote:
Show 34 quoted lines
> Junio C Hamano wrote: > > > > The problem ALASCM's example demonstrates does rely on clock > > skews. The timestamps used in the example looked like this: > > > > > > 1 1 > > / \/ \ > > 4 -1 4 > > | | | > > 3 -2 3 > > | | | > > 2 -3 2 > > \ | / > > 0 > > > > The crucial clock skew the case relies on is that the tip of the > > middle branch (-1) is older than the common commit (0). But the > > topmost commits with timestamp 1 could be with timestamp 5 to > > correct the clock skew and still make the example "fail". > > > > 5 5 > > / \/ \ > > 4 -1 4 > > | | | > > 3 -2 3 > > | | | > > 2 -3 2 > > \ | / > > 0 > > So would putting timestamp for merge be MAX(now, parents timestamps) > solve the problem?
If there is an evil committer, the parents could have bogus timestamps, too. But then, I would not pull from such an evil person...
Ciao, Dscho