emo/busybox
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

remove trailing whitespace

Browse Source
This commit is contained in:
Denis Vlasenko 2007-10-14 04:55:59 +00:00
parent be039374f3
commit 3f5fdc7572
11 changed files with 29 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
archival/bz/LICENSE
View File

@ -15,16 +15,16 @@ are met:
1. Redistributions of source code must retain the above copyright 1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer. notice, this list of conditions and the following disclaimer.
2. The origin of this software must not be misrepresented; you must 2. The origin of this software must not be misrepresented; you must
not claim that you wrote the original software. If you use this not claim that you wrote the original software. If you use this
software in a product, an acknowledgment in the product software in a product, an acknowledgment in the product
documentation would be appreciated but is not required. documentation would be appreciated but is not required.
3. Altered source versions must be plainly marked as such, and must 3. Altered source versions must be plainly marked as such, and must
not be misrepresented as being the original software. not be misrepresented as being the original software.
4. The name of the author may not be used to endorse or promote 4. The name of the author may not be used to endorse or promote
products derived from this software without specific prior written products derived from this software without specific prior written
permission. permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS

22
archival/bz/README
View File

@ -25,12 +25,12 @@ Please read and be aware of the following:
WARNING: WARNING:
This program and library (attempts to) compress data by This program and library (attempts to) compress data by
performing several non-trivial transformations on it. performing several non-trivial transformations on it.
Unless you are 100% familiar with *all* the algorithms Unless you are 100% familiar with *all* the algorithms
contained herein, and with the consequences of modifying them, contained herein, and with the consequences of modifying them,
you should NOT meddle with the compression or decompression you should NOT meddle with the compression or decompression
machinery. Incorrect changes can and very likely *will* machinery. Incorrect changes can and very likely *will*
lead to disastrous loss of data. lead to disastrous loss of data.
@ -50,16 +50,16 @@ DISCLAIMER:
PROGRAM UNLESS YOU ARE PREPARED TO ACCEPT THE POSSIBILITY, HOWEVER PROGRAM UNLESS YOU ARE PREPARED TO ACCEPT THE POSSIBILITY, HOWEVER
SMALL, THAT THE DATA WILL NOT BE RECOVERABLE. SMALL, THAT THE DATA WILL NOT BE RECOVERABLE.
That is not to say this program is inherently unreliable. That is not to say this program is inherently unreliable.
Indeed, I very much hope the opposite is true. bzip2/libbzip2 Indeed, I very much hope the opposite is true. bzip2/libbzip2
has been carefully constructed and extensively tested. has been carefully constructed and extensively tested.
PATENTS: PATENTS:
To the best of my knowledge, bzip2/libbzip2 does not use any To the best of my knowledge, bzip2/libbzip2 does not use any
patented algorithms. However, I do not have the resources patented algorithms. However, I do not have the resources
to carry out a patent search. Therefore I cannot give any to carry out a patent search. Therefore I cannot give any
guarantee of the above statement. guarantee of the above statement.

2
archival/bz/bzlib.c
View File

@ -259,7 +259,7 @@ void /*Bool*/ handle_compress(bz_stream *strm)
/*Bool progress_in = False;*/ /*Bool progress_in = False;*/
/*Bool progress_out = False;*/ /*Bool progress_out = False;*/
EState* s = strm->state; EState* s = strm->state;
while (1) { while (1) {
if (s->state == BZ_S_OUTPUT) { if (s->state == BZ_S_OUTPUT) {
/*progress_out |=*/ copy_output_until_stop(s); /*progress_out |=*/ copy_output_until_stop(s);

2
archival/bz/compress.c
View File

@ -414,7 +414,7 @@ void sendMTFValues(EState* s)
/* /*
* Increment the symbol frequencies for the selected table. * Increment the symbol frequencies for the selected table.
*/ */
/* 1% faster compress. +800 bytes */ /* 1% faster compress. +800 bytes */
#if CONFIG_BZIP2_FEATURE_SPEED >= 4 #if CONFIG_BZIP2_FEATURE_SPEED >= 4
if (nGroups == 6 && 50 == ge-gs+1) { if (nGroups == 6 && 50 == ge-gs+1) {
/*--- fast track the common case ---*/ /*--- fast track the common case ---*/

4
archival/bz/huffman.c
View File

@ -133,7 +133,7 @@ void BZ2_hbMakeCodeLengths(uint8_t *len,
} }
AssertH(nHeap < (BZ_MAX_ALPHA_SIZE+2), 2001); AssertH(nHeap < (BZ_MAX_ALPHA_SIZE+2), 2001);
while (nHeap > 1) { while (nHeap > 1) {
n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP1(heap, weight, nHeap); n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP1(heap, weight, nHeap);
n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP1(heap, weight, nHeap); n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP1(heap, weight, nHeap);
@ -160,7 +160,7 @@ void BZ2_hbMakeCodeLengths(uint8_t *len,
if (j > maxLen) if (j > maxLen)
tooLong = True; tooLong = True;
} }
if (!tooLong) if (!tooLong)
break; break;

2
ipsvd/tcpudp.c
View File

@ -45,7 +45,7 @@ struct globals {
unsigned max_per_host; unsigned max_per_host;
unsigned cur_per_host; unsigned cur_per_host;
unsigned cnum; unsigned cnum;
unsigned cmax; unsigned cmax;
}; };
#define G (*(struct globals*)&bb_common_bufsiz1) #define G (*(struct globals*)&bb_common_bufsiz1)
#define verbose (G.verbose ) #define verbose (G.verbose )

2
libbb/messages.c
View File

@ -47,7 +47,7 @@ const char bb_busybox_exec_path[] ALIGN1 = CONFIG_BUSYBOX_EXEC_PATH;
const char bb_default_login_shell[] ALIGN1 = LIBBB_DEFAULT_LOGIN_SHELL; const char bb_default_login_shell[] ALIGN1 = LIBBB_DEFAULT_LOGIN_SHELL;
/* util-linux manpage says /sbin:/bin:/usr/sbin:/usr/bin, /* util-linux manpage says /sbin:/bin:/usr/sbin:/usr/bin,
* but I want to save a few bytes here. Check libbb.h before changing! */ * but I want to save a few bytes here. Check libbb.h before changing! */
const char bb_PATH_root_path[] ALIGN1 = const char bb_PATH_root_path[] ALIGN1 =
"PATH=/sbin:/usr/sbin:/bin:/usr/bin" BB_ADDITIONAL_PATH; "PATH=/sbin:/usr/sbin:/bin:/usr/bin" BB_ADDITIONAL_PATH;

8
networking/httpd.c
View File

@ -175,7 +175,7 @@ static const uint16_t http_response_type[] ALIGN2 = {
HTTP_MOVED_TEMPORARILY, HTTP_MOVED_TEMPORARILY,
HTTP_REQUEST_TIMEOUT, HTTP_REQUEST_TIMEOUT,
HTTP_NOT_IMPLEMENTED, HTTP_NOT_IMPLEMENTED,
#if ENABLE_FEATURE_HTTPD_BASIC_AUTH #if ENABLE_FEATURE_HTTPD_BASIC_AUTH
HTTP_UNAUTHORIZED, HTTP_UNAUTHORIZED,
#endif #endif
HTTP_NOT_FOUND, HTTP_NOT_FOUND,
@ -1405,7 +1405,7 @@ static void send_cgi_and_exit(
/* /*
* Send a file response to a HTTP request, and exit * Send a file response to a HTTP request, and exit
* *
* Parameters: * Parameters:
* const char *url The requested URL (with leading /). * const char *url The requested URL (with leading /).
* headers Don't send headers before if FALSE. * headers Don't send headers before if FALSE.
@ -1992,7 +1992,7 @@ static void mini_httpd(int server_socket)
while (1) { while (1) {
int n; int n;
len_and_sockaddr fromAddr; len_and_sockaddr fromAddr;
/* Wait for connections... */ /* Wait for connections... */
fromAddr.len = LSA_SIZEOF_SA; fromAddr.len = LSA_SIZEOF_SA;
n = accept(server_socket, &fromAddr.sa, &fromAddr.len); n = accept(server_socket, &fromAddr.sa, &fromAddr.len);
@ -2037,7 +2037,7 @@ static void mini_httpd_nommu(int server_socket, int argc, char **argv)
while (1) { while (1) {
int n; int n;
len_and_sockaddr fromAddr; len_and_sockaddr fromAddr;
/* Wait for connections... */ /* Wait for connections... */
fromAddr.len = LSA_SIZEOF_SA; fromAddr.len = LSA_SIZEOF_SA;
n = accept(server_socket, &fromAddr.sa, &fromAddr.len); n = accept(server_socket, &fromAddr.sa, &fromAddr.len);

2
networking/nameif.c
View File

@ -4,7 +4,7 @@
* *
* Written 2000 by Andi Kleen. * Written 2000 by Andi Kleen.
* Busybox port 2002 by Nick Fedchik <nick@fedchik.org.ua> * Busybox port 2002 by Nick Fedchik <nick@fedchik.org.ua>
* Glenn McGrath * Glenn McGrath
* *
* Licensed under the GPL v2 or later, see the file LICENSE in this tarball. * Licensed under the GPL v2 or later, see the file LICENSE in this tarball.
*/ */

2
selinux/Config.in
View File

@ -109,7 +109,7 @@ config SETSEBOOL
default n default n
depends on SELINUX depends on SELINUX
help help
Enable support for change boolean. Enable support for change boolean.
semanage and -P option is not supported yet. semanage and -P option is not supported yet.
endmenu endmenu

2
util-linux/mount.c
View File

@ -675,7 +675,7 @@ find_kernel_nfs_mount_version(void)
} }
} }
static void static void
get_mountport(struct pmap *pm_mnt, get_mountport(struct pmap *pm_mnt,
struct sockaddr_in *server_addr, struct sockaddr_in *server_addr,
long unsigned prog, long unsigned prog,