Source-Changes-HG archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]
[src/trunk]: src/lib Revert white space changes for imported sources.
details: https://anonhg.NetBSD.org/src/rev/a00bbc315a77
branches: trunk
changeset: 474311:a00bbc315a77
user: simonb <simonb%NetBSD.org@localhost>
date: Sat Jul 03 12:30:16 1999 +0000
description:
Revert white space changes for imported sources.
diffstat:
lib/libbz2/LICENSE | 12 +-
lib/libbz2/README | 8 +-
lib/libbz2/blocksort.c | 30 +-
lib/libbz2/bzlib.c | 224 ++++++++++++++--------------
lib/libbz2/bzlib.h | 160 ++++++++++----------
lib/libbz2/bzlib_private.h | 34 ++--
lib/libbz2/compress.c | 64 ++++----
lib/libbz2/crctable.c | 12 +-
lib/libbz2/decompress.c | 56 +++---
lib/libbz2/huffman.c | 20 +-
lib/libbz2/manual.texi | 346 ++++++++++++++++++++++----------------------
lib/libbz2/manual_1.html | 20 +-
lib/libbz2/manual_3.html | 264 ++++++++++++++++----------------
lib/libbz2/manual_4.html | 48 +++---
lib/libbz2/randtable.c | 116 +++++++-------
lib/libntp/COPYRIGHT | 8 +-
lib/libntp/Makefile | 4 +-
lib/libntp/a_md512crypt.c | 4 +-
lib/libntp/a_md5decrypt.c | 4 +-
lib/libntp/a_md5encrypt.c | 4 +-
lib/libntp/atoint.c | 4 +-
lib/libntp/atolfp.c | 12 +-
lib/libntp/auth12crypt.c | 4 +-
lib/libntp/authdecrypt.c | 8 +-
lib/libntp/authdes.c | 4 +-
lib/libntp/authencrypt.c | 4 +-
lib/libntp/authkeys.c | 14 +-
lib/libntp/authreadkeys.c | 12 +-
lib/libntp/authusekey.c | 8 +-
lib/libntp/caljulian.c | 6 +-
lib/libntp/calleapwhen.c | 4 +-
lib/libntp/caltontp.c | 6 +-
lib/libntp/calyearstart.c | 4 +-
lib/libntp/clocktypes.c | 4 +-
lib/libntp/decodenetnum.c | 4 +-
lib/libntp/dofptoa.c | 8 +-
lib/libntp/dolfptoa.c | 4 +-
lib/libntp/findconfig.c | 10 +-
lib/libntp/getopt.c | 6 +-
lib/libntp/hextolfp.c | 6 +-
lib/libntp/humandate.c | 12 +-
lib/libntp/machines.c | 18 +-
lib/libntp/mexit.c | 6 +-
lib/libntp/mstolfp.c | 6 +-
lib/libntp/msyslog.c | 10 +-
lib/libntp/netof.c | 4 +-
lib/libntp/numtohost.c | 6 +-
lib/libntp/prettydate.c | 6 +-
lib/libntp/refnumtoa.c | 6 +-
lib/libntp/statestr.c | 6 +-
lib/libntp/syssignal.c | 6 +-
lib/libntp/systime.c | 10 +-
lib/libntp/utvtoa.c | 4 +-
lib/libwrap/clean_exit.c | 6 +-
lib/libwrap/diag.c | 10 +-
lib/libwrap/eval.c | 12 +-
lib/libwrap/hosts_access.3 | 4 +-
lib/libwrap/hosts_access.5 | 22 +-
lib/libwrap/hosts_access.c | 18 +-
lib/libwrap/hosts_ctl.c | 8 +-
lib/libwrap/hosts_options.5 | 10 +-
lib/libwrap/misc.c | 6 +-
lib/libwrap/options.c | 20 +-
lib/libwrap/percent_x.c | 8 +-
lib/libwrap/refuse.c | 6 +-
lib/libwrap/rfc931.c | 8 +-
lib/libwrap/shell_cmd.c | 8 +-
lib/libwrap/socket.c | 16 +-
lib/libwrap/tcpd.h | 4 +-
lib/libwrap/update.c | 14 +-
lib/libwrap/workarounds.c | 8 +-
lib/libz/ChangeLog | 8 +-
lib/libz/README | 6 +-
lib/libz/adler32.c | 4 +-
lib/libz/algorithm.doc | 74 ++++----
lib/libz/compress.c | 4 +-
lib/libz/crc32.c | 6 +-
lib/libz/deflate.c | 12 +-
lib/libz/deflate.h | 6 +-
lib/libz/example.c | 6 +-
lib/libz/gzio.c | 20 +-
lib/libz/infblock.c | 6 +-
lib/libz/infblock.h | 4 +-
lib/libz/infcodes.c | 4 +-
lib/libz/infcodes.h | 4 +-
lib/libz/inffast.c | 4 +-
lib/libz/inffast.h | 4 +-
lib/libz/inflate.c | 6 +-
lib/libz/inftrees.c | 4 +-
lib/libz/inftrees.h | 4 +-
lib/libz/infutil.c | 4 +-
lib/libz/infutil.h | 6 +-
lib/libz/minigzip.c | 8 +-
lib/libz/trees.c | 6 +-
lib/libz/uncompr.c | 4 +-
lib/libz/zconf.h | 4 +-
lib/libz/zlib.h | 24 +-
lib/libz/zutil.c | 4 +-
98 files changed, 1052 insertions(+), 1052 deletions(-)
diffs (truncated from 6335 to 300 lines):
diff -r cbee157a2ae6 -r a00bbc315a77 lib/libbz2/LICENSE
--- a/lib/libbz2/LICENSE Sat Jul 03 12:09:52 1999 +0000
+++ b/lib/libbz2/LICENSE Sat Jul 03 12:30:16 1999 +0000
@@ -9,16 +9,16 @@
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
-2. The origin of this software must not be misrepresented; you must
- not claim that you wrote the original software. If you use this
- software in a product, an acknowledgment in the product
+2. The origin of this software must not be misrepresented; you must
+ not claim that you wrote the original software. If you use this
+ software in a product, an acknowledgment in the product
documentation would be appreciated but is not required.
3. Altered source versions must be plainly marked as such, and must
not be misrepresented as being the original software.
-4. The name of the author may not be used to endorse or promote
- products derived from this software without specific prior written
+4. The name of the author may not be used to endorse or promote
+ products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
@@ -37,4 +37,4 @@
jseward%acm.org@localhost
bzip2/libbzip2 version 0.9.0 of 28 June 1998
-$NetBSD: LICENSE,v 1.3 1999/07/02 15:55:41 simonb Exp $
+$NetBSD: LICENSE,v 1.4 1999/07/03 12:30:16 simonb Exp $
diff -r cbee157a2ae6 -r a00bbc315a77 lib/libbz2/README
--- a/lib/libbz2/README Sat Jul 03 12:09:52 1999 +0000
+++ b/lib/libbz2/README Sat Jul 03 12:30:16 1999 +0000
@@ -1,4 +1,4 @@
-$NetBSD: README,v 1.3 1999/07/02 15:55:41 simonb Exp $
+$NetBSD: README,v 1.4 1999/07/03 12:30:16 simonb Exp $
This is the README for bzip2, a block-sorting file compressor, version
@@ -26,7 +26,7 @@
To install bzip2 properly:
-* Copy the binaries "bzip2" and "bzip2recover" to a publically visible
+* Copy the binaries "bzip2" and "bzip2recover" to a publically visible
place, possibly /usr/bin or /usr/local/bin.
* In that directory, make "bunzip2" and "bzcat" be symbolic links
@@ -37,7 +37,7 @@
If you want to program with the library, you'll need to copy libbz2.a
and bzlib.h to /usr/lib and /usr/include respectively.
-
+
HOW TO BUILD -- Windows 95, NT, DOS, Mac, etc.
@@ -121,7 +121,7 @@
bzip-0.21 and bzip2-0.1pl2, and the changes in bzip2 are largely a
result of this feedback. I thank you for your comments.
-At least for the time being, bzip2's "home" is
+At least for the time being, bzip2's "home" is
http://www.muraroa.demon.co.uk.
Julian Seward
diff -r cbee157a2ae6 -r a00bbc315a77 lib/libbz2/blocksort.c
--- a/lib/libbz2/blocksort.c Sat Jul 03 12:09:52 1999 +0000
+++ b/lib/libbz2/blocksort.c Sat Jul 03 12:30:16 1999 +0000
@@ -1,4 +1,4 @@
-/* $NetBSD: blocksort.c,v 1.3 1999/07/02 15:55:41 simonb Exp $ */
+/* $NetBSD: blocksort.c,v 1.4 1999/07/03 12:30:16 simonb Exp $ */
/*-------------------------------------------------------------*/
/*--- Block sorting machinery ---*/
@@ -18,16 +18,16 @@
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- 2. The origin of this software must not be misrepresented; you must
- not claim that you wrote the original software. If you use this
- software in a product, an acknowledgment in the product
+ 2. The origin of this software must not be misrepresented; you must
+ not claim that you wrote the original software. If you use this
+ software in a product, an acknowledgment in the product
documentation would be appreciated but is not required.
3. Altered source versions must be plainly marked as such, and must
not be misrepresented as being the original software.
- 4. The name of the author may not be used to endorse or promote
- products derived from this software without specific prior written
+ 4. The name of the author may not be used to endorse or promote
+ products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
@@ -75,8 +75,8 @@
static __inline__ Bool fullGtU ( UChar* block,
UInt16* quadrant,
UInt32 nblock,
- Int32* workDone,
- Int32 i1,
+ Int32* workDone,
+ Int32 i1,
Int32 i2
)
{
@@ -505,7 +505,7 @@
/*--
Step 1:
Complete the big bucket [ss] by quicksorting
- any unsorted small buckets [ss, j], for j != ss.
+ any unsorted small buckets [ss, j], for j != ss.
Hopefully previous pointer-scanning phases have already
completed many of the small buckets [ss, j], so
we don't have to sort them at all.
@@ -532,7 +532,7 @@
/*--
Step 2:
Deal specially with case [ss, ss]. This establishes the
- sorted order for [ss, ss] without any comparisons.
+ sorted order for [ss, ss] without any comparisons.
A clever trick, cryptically described as steps Q6b and Q6c
in SRC-124 (aka BW94). This makes it entirely practical to
not use a preliminary run-length coder, but unfortunately
@@ -573,7 +573,7 @@
updating for the last bucket is pointless.
The quadrant array provides a way to incrementally
- cache sort orderings, as they appear, so as to
+ cache sort orderings, as they appear, so as to
make subsequent comparisons in fullGtU() complete
faster. For repetitive blocks this makes a big
difference (but not big enough to be able to avoid
@@ -583,9 +583,9 @@
for 0 <= i < nblock and 0 <= j <= nblock
- if block[i] != block[j],
+ if block[i] != block[j],
- then the relative values of quadrant[i] and
+ then the relative values of quadrant[i] and
quadrant[j] are meaningless.
else {
@@ -680,7 +680,7 @@
if (s->verbosity >= 3)
VPrintf3( " %d work, %d block, ratio %5.2f\n",
- s->workDone, s->nblock-1,
+ s->workDone, s->nblock-1,
(float)(s->workDone) / (float)(s->nblock-1) );
if (s->workDone > s->workLimit && s->firstAttempt) {
@@ -693,7 +693,7 @@
sortMain ( s );
if (s->verbosity >= 3)
VPrintf3( " %d work, %d block, ratio %f\n",
- s->workDone, s->nblock-1,
+ s->workDone, s->nblock-1,
(float)(s->workDone) / (float)(s->nblock-1) );
}
diff -r cbee157a2ae6 -r a00bbc315a77 lib/libbz2/bzlib.c
--- a/lib/libbz2/bzlib.c Sat Jul 03 12:09:52 1999 +0000
+++ b/lib/libbz2/bzlib.c Sat Jul 03 12:30:16 1999 +0000
@@ -1,4 +1,4 @@
-/* $NetBSD: bzlib.c,v 1.4 1999/07/02 15:55:41 simonb Exp $ */
+/* $NetBSD: bzlib.c,v 1.5 1999/07/03 12:30:16 simonb Exp $ */
/*-------------------------------------------------------------*/
/*--- Library top-level functions. ---*/
@@ -18,16 +18,16 @@
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- 2. The origin of this software must not be misrepresented; you must
- not claim that you wrote the original software. If you use this
- software in a product, an acknowledgment in the product
+ 2. The origin of this software must not be misrepresented; you must
+ not claim that you wrote the original software. If you use this
+ software in a product, an acknowledgment in the product
documentation would be appreciated but is not required.
3. Altered source versions must be plainly marked as such, and must
not be misrepresented as being the original software.
- 4. The name of the author may not be used to endorse or promote
- products derived from this software without specific prior written
+ 4. The name of the author may not be used to endorse or promote
+ products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
@@ -71,7 +71,7 @@
#ifndef BZ_NO_STDIO
void bz__AssertH__fail ( int errcode )
{
- fprintf(stderr,
+ fprintf(stderr,
"\n\nbzip2/libbzip2, v0.9.0: internal error number %d.\n"
"This is a bug in bzip2/libbzip2, v0.9.0. Please report\n"
"it to me at: jseward%acm.org@localhost. If this happened when\n"
@@ -135,8 +135,8 @@
/*---------------------------------------------------*/
-int BZ_API(bzCompressInit)
- ( bz_stream* strm,
+int BZ_API(bzCompressInit)
+ ( bz_stream* strm,
int blockSize100k,
int verbosity,
int workFactor )
@@ -144,7 +144,7 @@
Int32 n;
EState* s;
- if (strm == NULL ||
+ if (strm == NULL ||
blockSize100k < 1 || blockSize100k > 9 ||
workFactor < 0 || workFactor > 250)
return BZ_PARAM_ERROR;
@@ -286,7 +286,7 @@
/*-- no input? --*/
if (s->strm->avail_in == 0) break;
progress_in = True;
- ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) );
+ ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) );
s->strm->next_in++;
s->strm->avail_in--;
s->strm->total_in++;
@@ -303,7 +303,7 @@
/*-- flush/finish end? --*/
if (s->avail_in_expect == 0) break;
progress_in = True;
- ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) );
+ ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) );
s->strm->next_in++;
s->strm->avail_in--;
s->strm->total_in++;
@@ -334,7 +334,7 @@
s->strm->avail_out--;
s->strm->next_out++;
s->strm->total_out++;
-
+
}
return progress_out;
@@ -348,13 +348,13 @@
Bool progress_in = False;
Bool progress_out = False;
EState* s = strm->state;
-
+
while (True) {
if (s->state == BZ_S_OUTPUT) {
progress_out |= copy_output_until_stop ( s );
if (s->state_out_pos < s->numZ) break;
- if (s->mode != BZ_M_RUNNING &&
+ if (s->mode != BZ_M_RUNNING &&
s->avail_in_expect == 0 &&
isempty_RL(s)) break;
prepare_new_block ( s );
@@ -404,7 +404,7 @@
if (action == BZ_RUN) {
progress = handle_compress ( strm );
return progress ? BZ_RUN_OK : BZ_PARAM_ERROR;
- }
+ }
else
if (action == BZ_FLUSH) {
s->avail_in_expect = strm->avail_in;
@@ -417,7 +417,7 @@
s->mode = BZ_M_FINISHING;
goto preswitch;
}
- else
+ else
return BZ_PARAM_ERROR;
case BZ_M_FLUSHING:
@@ -458,7 +458,7 @@
if (s->ftab != NULL) BZFREE(s->ftab);
BZFREE(strm->state);
- strm->state = NULL;
+ strm->state = NULL;
return BZ_OK;
}
@@ -469,8 +469,8 @@
/*---------------------------------------------------*/
/*---------------------------------------------------*/
Home |
Main Index |
Thread Index |
Old Index