SecBSD/src
2
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

zap trailing whitespace and tabs

Browse Source
This commit is contained in:
purplerain 2023-09-16 04:38:16 +00:00
parent 8b897ac235
commit 2990d002be
Signed by: purplerain
GPG Key ID: F42C07F07E2E35B7
179 changed files with 992 additions and 992 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
usr.bin/gprof/gprof.callg
View File

@ -105,4 +105,4 @@ index the index of this child in the call graph listing,
fields as a function entry. Below it are listed
the members of the cycle, and their contributions
to the time and call counts of the cycle.

2
usr.bin/gprof/gprof.flat
View File

@ -29,4 +29,4 @@ name the name of the function. This is the minor sort
the function in the gprof listing. If the index is
in parenthesis it shows where it would appear in
the gprof listing if it were to be printed.

2
usr.bin/lex/options.h
View File

@ -32,7 +32,7 @@
/* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED */
/* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR */
/* PURPOSE. */
#ifndef OPTIONS_H
#define OPTIONS_H
#include "scanopt.h"

6
usr.bin/lex/scanopt.c
View File

@ -586,7 +586,7 @@ static int scanopt_err (s, opt_offset, is_short, err)
}
return err;
}
/* Internal. Match str against the regex ^--([^=]+)(=(.*))?
* return 1 if *looks* like a long option.
@ -634,7 +634,7 @@ static int matchlongopt (str, optname, optlen, arg, arglen)
return 1;
}
/* Internal. Look up long or short option by name.
* Long options must match a non-ambiguous prefix, or exact match.
@ -704,7 +704,7 @@ static int find_opt (s, lookup_long, optstart, len, err_code, opt_offset)
return *err_code ? 0 : 1;
}
int scanopt (svoid, arg, optindex)
scanopt_t *svoid;

4
usr.bin/lex/scanopt.h
View File

@ -32,7 +32,7 @@
/* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED */
/* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR */
/* PURPOSE. */
#ifndef SCANOPT_H
#define SCANOPT_H
@ -77,7 +77,7 @@ extern "C" {
/* Used internally by scanopt() to maintain state. */
/* Never modify these value directly. */
typedef void *scanopt_t;
/* Initializes scanner and checks option list for errors.
* Parameters:

2
usr.bin/lex/tables.c
View File

@ -33,7 +33,7 @@
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE.
*/
#include "flexdef.h"
#include "tables.h"

2
usr.bin/lex/tables.h
View File

@ -33,7 +33,7 @@
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE.
*/
#ifndef TABLES_H
#define TABLES_H

2
usr.bin/lex/tables_shared.c
View File

@ -36,7 +36,7 @@ dnl WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
dnl PURPOSE.
dnl
*/
/* This file is meant to be included in both the skeleton and the actual
* flex code (hence the name "_shared").
*/

2
usr.bin/lex/tables_shared.h
View File

@ -34,7 +34,7 @@ dnl THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
dnl IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
dnl WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
dnl PURPOSE.
dnl
dnl This file is meant to be included in both the skeleton and the actual
dnl flex code (hence the name "_shared").

10
usr.bin/tsort/tsort.c
View File

@ -199,7 +199,7 @@ ereallocarray(void *p, size_t n, size_t s)
return emem(reallocarray(p, n, s));
}
/***
*** Hash table.
***/
@ -390,7 +390,7 @@ read_hints(FILE *f, struct ohash *h, int quiet, const char *name,
return order;
}
/***
*** Standard heap handling routines.
***/
@ -520,7 +520,7 @@ make_transparent(struct ohash *hash)
} while (adjusted);
}
/***
*** Search through hash array for nodes.
***/
@ -597,7 +597,7 @@ find_smallest_node(struct array *h)
return u;
}
/***
*** Graph algorithms.
***/
@ -816,7 +816,7 @@ find_normal_cycle(struct array *h, struct array *c)
return b;
}
#define plural(n) ((n) > 1 ? "s" : "")
static void

6
usr.bin/vi/docs/tutorial/vi.advanced
View File

@ -577,9 +577,9 @@ nroff -i form.mac | awk "length != 0 { print }"
.na
.nh
.ll 79
.ec 
.c2 
.cc 
.ec
.c2
.cc
**************************************
Determine the line numbers of the two lines of file f. They should be