diff options
author | George Hazan <george.hazan@gmail.com> | 2012-05-19 09:28:14 +0000 |
---|---|---|
committer | George Hazan <george.hazan@gmail.com> | 2012-05-19 09:28:14 +0000 |
commit | b686ce8ec009372905e1d71c19323f7892589038 (patch) | |
tree | 5bed79c846115658e5f392eb2a721cd58a17ba00 /plugins/updater/bzip2-1.0.3/spewG.c | |
parent | 7a2c6126cd995cfdbd5f3167609cd7e09ffacf35 (diff) |
updater returned by request of Awkward
git-svn-id: http://svn.miranda-ng.org/main/trunk@67 1316c22d-e87f-b044-9b9b-93d7a3e3ba9c
Diffstat (limited to 'plugins/updater/bzip2-1.0.3/spewG.c')
-rw-r--r-- | plugins/updater/bzip2-1.0.3/spewG.c | 54 |
1 files changed, 54 insertions, 0 deletions
diff --git a/plugins/updater/bzip2-1.0.3/spewG.c b/plugins/updater/bzip2-1.0.3/spewG.c new file mode 100644 index 0000000000..14a364938d --- /dev/null +++ b/plugins/updater/bzip2-1.0.3/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.6 of 6 September 2010 + Copyright (C) 1996-2010 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; +} |