===================================================================
RCS file: /cvsrepo/anoncvs/cvs/src/usr.bin/cvs/rcsnum.c,v
retrieving revision 1.52
retrieving revision 1.53
diff -c -r1.52 -r1.53
*** src/usr.bin/cvs/rcsnum.c	2008/03/01 20:03:56	1.52
--- src/usr.bin/cvs/rcsnum.c	2008/05/22 07:03:02	1.53
***************
*** 1,4 ****
! /*	$OpenBSD: rcsnum.c,v 1.52 2008/03/01 20:03:56 joris Exp $	*/
  /*
   * Copyright (c) 2004 Jean-Francois Brousseau <jfb@openbsd.org>
   * All rights reserved.
--- 1,4 ----
! /*	$OpenBSD: rcsnum.c,v 1.53 2008/05/22 07:03:02 joris Exp $	*/
  /*
   * Copyright (c) 2004 Jean-Francois Brousseau <jfb@openbsd.org>
   * All rights reserved.
***************
*** 180,187 ****
   * Compare the two numbers <n1> and <n2>. Returns -1 if <n1> is larger than
   * <n2>, 0 if they are both the same, and 1 if <n2> is larger than <n1>.
   * The <depth> argument specifies how many numbers deep should be checked for
!  * the result.  A value of 0 means that the depth will be the minimum of the
!  * two numbers.
   */
  int
  rcsnum_cmp(RCSNUM *n1, RCSNUM *n2, u_int depth)
--- 180,188 ----
   * Compare the two numbers <n1> and <n2>. Returns -1 if <n1> is larger than
   * <n2>, 0 if they are both the same, and 1 if <n2> is larger than <n1>.
   * The <depth> argument specifies how many numbers deep should be checked for
!  * the result.  A value of 0 means that the depth will be the maximum of the
!  * two numbers, so that a longer number is considered greater than a shorter
!  * number if they are equal up to the minimum length.
   */
  int
  rcsnum_cmp(RCSNUM *n1, RCSNUM *n2, u_int depth)
***************
*** 205,211 ****
  			return (-1);
  	}
  
! 	if (n1->rn_len > n2->rn_len)
  		return (-1);
  	else if (n2->rn_len > n1->rn_len)
  		return (1);
--- 206,217 ----
  			return (-1);
  	}
  
! 	/* If an explicit depth was specified, and we've
! 	 * already checked up to depth, consider the
! 	 * revision numbers equal. */
! 	if (depth != 0 && slen == depth)
! 		return (0);
! 	else if (n1->rn_len > n2->rn_len)
  		return (-1);
  	else if (n2->rn_len > n1->rn_len)
  		return (1);