Skip site navigation (1)Skip section navigation (2) 
Date:      Sun, 8 Mar 2009 05:14:16 +0000 (UTC)
From:      Tim Kientzle <kientzle@FreeBSD.org>
To:        src-committers@freebsd.org, svn-src-all@freebsd.org, svn-src-head@freebsd.org
Subject:   svn commit: r189511 - head/usr.bin/tar/test
Message-ID:  <200903080514.n285EGGb072665@svn.freebsd.org>
next in thread | raw e-mail | index | archive | help 
Author: kientzle
Date: Sun Mar  8 05:14:16 2009
New Revision: 189511
URL: http://svn.freebsd.org/changeset/base/189511

Log:
  Merge r278 from libarchive.googlecode.com:  Reduce the number of
  patterns tested here from 200 to 170, which seems to be the
  most that Cygwin can handle.

Modified:
  head/usr.bin/tar/test/test_copy.c

Modified: head/usr.bin/tar/test/test_copy.c
==============================================================================
--- head/usr.bin/tar/test/test_copy.c	Sun Mar  8 05:10:51 2009	(r189510)
+++ head/usr.bin/tar/test/test_copy.c	Sun Mar  8 05:14:16 2009	(r189511)
@@ -25,6 +25,8 @@
 #include "test.h"
 __FBSDID("$FreeBSD$");
 
+#define	LOOP_MAX	170
+
 static void
 create_tree(void)
 {
@@ -41,7 +43,7 @@ create_tree(void)
 	assertEqualInt(0, mkdir("s", 0775));
 	assertEqualInt(0, mkdir("d", 0775));
 
-	for (i = 0; i < 200; i++) {
+	for (i = 0; i < LOOP_MAX; i++) {
 		buff[0] = 'f';
 		buff[1] = '/';
 		/* Create a file named "f/abcdef..." */
@@ -97,7 +99,7 @@ verify_tree(int limit)
 	struct dirent *de;
 
 	/* Generate the names we know should be there and verify them. */
-	for (i = 1; i < 200; i++) {
+	for (i = 1; i < LOOP_MAX; i++) {
 		/* Generate a base name of the correct length. */
 		for (j = 0; j < i; ++j)
 			filename[j] = 'a' + (j % 26);
@@ -219,7 +221,7 @@ verify_tree(int limit)
 				}
 				/* Our files have very particular filename patterns. */
 				if (p[0] != '.' || (p[1] != '.' && p[1] != '\0')) {
-					for (i = 0; p[i] != '\0' && i < 200; i++) {
+					for (i = 0; p[i] != '\0' && i < LOOP_MAX; i++) {
 						failure("i=%d, p[i]='%c' 'a'+(i%%26)='%c'", i, p[i], 'a' + (i % 26));
 						assertEqualInt(p[i], 'a' + (i % 26));
 					}

Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?200903080514.n285EGGb072665>