mirror of
https://gitlab.com/bzip2/bzip2.git
synced 2025-08-09 13:22:45 +03:00
7b44372099
Increase the project version to 1.1.0 as this is a new feature version. As for all new feature versions, increase the libtool .so version. Only increase the revision, as no API's were added or removed. It may look like I've increased it by 2, but that's because v1.0.8 used Makefiles and was at 1:8:0. See http://www.gnu.org/software/libtool/manual/html_node/Updating-version-info.html
55 lines
1.7 KiB
C
55 lines
1.7 KiB
C
|
|
/* 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.1.0 of 6 September 2010
|
|
Copyright (C) 1996-2010 Julian Seward <jseward@acm.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;
|
|
}
|