aboutsummaryrefslogtreecommitdiffstats
path: root/spewG.c
diff options
context:
space:
mode:
authorDavid E. O'Brien <obrien@FreeBSD.org>2010-10-02 06:54:59 +0000
committerDavid E. O'Brien <obrien@FreeBSD.org>2010-10-02 06:54:59 +0000
commit5a93e3ae7b2612a3cee5ab42acdb8c807af3eedf (patch)
tree1172e47610c6ea602abd14701ac915f2d3d818fe /spewG.c
parent0c9ffc952b937c040e2e3b041d370c2a30c6caff (diff)
downloadsrc-5a93e3ae7b2612a3cee5ab42acdb8c807af3eedf.tar.gz
src-5a93e3ae7b2612a3cee5ab42acdb8c807af3eedf.zip
Flatten the bzip2 vendor area in preparations for the 1.0.6 import.
Notes
Notes: svn path=/vendor/bzip2/dist/; revision=213348
Diffstat (limited to 'spewG.c')
-rw-r--r--spewG.c54
1 files changed, 54 insertions, 0 deletions
diff --git a/spewG.c b/spewG.c
new file mode 100644
index 000000000000..5892b92c3643
--- /dev/null
+++ b/spewG.c
@@ -0,0 +1,54 @@
+
+/* spew out a thoroughly gigantic file designed so that bzip2
+ can compress it reasonably rapidly. This is to help test
+ support for large files (> 2GB) in a reasonable amount of time.
+ I suggest you use the undocumented --exponential option to
+ bzip2 when compressing the resulting file; this saves a bit of
+ time. Note: *don't* bother with --exponential when compressing
+ Real Files; it'll just waste a lot of CPU time :-)
+ (but is otherwise harmless).
+*/
+
+/* ------------------------------------------------------------------
+ This file is part of bzip2/libbzip2, a program and library for
+ lossless, block-sorting data compression.
+
+ bzip2/libbzip2 version 1.0.5 of 10 December 2007
+ Copyright (C) 1996-2007 Julian Seward <jseward@bzip.org>
+
+ Please read the WARNING, DISCLAIMER and PATENTS sections in the
+ README file.
+
+ This program is released under the terms of the license contained
+ in the file LICENSE.
+ ------------------------------------------------------------------ */
+
+
+#define _FILE_OFFSET_BITS 64
+
+#include <stdio.h>
+#include <stdlib.h>
+
+/* The number of megabytes of junk to spew out (roughly) */
+#define MEGABYTES 5000
+
+#define N_BUF 1000000
+char buf[N_BUF];
+
+int main ( int argc, char** argv )
+{
+ int ii, kk, p;
+ srandom(1);
+ setbuffer ( stdout, buf, N_BUF );
+ for (kk = 0; kk < MEGABYTES * 515; kk+=3) {
+ p = 25+random()%50;
+ for (ii = 0; ii < p; ii++)
+ printf ( "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa" );
+ for (ii = 0; ii < p-1; ii++)
+ printf ( "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb" );
+ for (ii = 0; ii < p+1; ii++)
+ printf ( "ccccccccccccccccccccccccccccccccccccc" );
+ }
+ fflush(stdout);
+ return 0;
+}