diff options
author | rgrimes <rgrimes@FreeBSD.org> | 1995-05-30 05:05:38 +0000 |
---|---|---|
committer | rgrimes <rgrimes@FreeBSD.org> | 1995-05-30 05:05:38 +0000 |
commit | 2ad6f3dee6bc54535003f4ab26bbc587b7efa38c (patch) | |
tree | a3959baf797787918878bec6d58d6a0fb743ad0a /gnu/usr.bin/grep | |
parent | 4f960dd75f181e9fa2edc44324f15f0ab5c64b37 (diff) | |
download | FreeBSD-src-2ad6f3dee6bc54535003f4ab26bbc587b7efa38c.zip FreeBSD-src-2ad6f3dee6bc54535003f4ab26bbc587b7efa38c.tar.gz |
Remove trailing whitespace.
Diffstat (limited to 'gnu/usr.bin/grep')
-rw-r--r-- | gnu/usr.bin/grep/dfa.c | 18 | ||||
-rw-r--r-- | gnu/usr.bin/grep/grep.c | 4 | ||||
-rw-r--r-- | gnu/usr.bin/grep/kwset.c | 2 | ||||
-rw-r--r-- | gnu/usr.bin/grep/obstack.h | 2 | ||||
-rw-r--r-- | gnu/usr.bin/grep/search.c | 2 |
5 files changed, 14 insertions, 14 deletions
diff --git a/gnu/usr.bin/grep/dfa.c b/gnu/usr.bin/grep/dfa.c index 4a02d0d..0409b1e 100644 --- a/gnu/usr.bin/grep/dfa.c +++ b/gnu/usr.bin/grep/dfa.c @@ -549,7 +549,7 @@ lex() notset(ccl); laststart = 0; return lasttok = CSET + charclass_index(ccl); - + case '[': if (backslash) goto normal_char; @@ -1907,7 +1907,7 @@ dfacomp(s, len, d, searchflag) copy = malloc(len); if (!copy) dfaerror("out of memory"); - + /* This is a kludge. */ case_fold = 0; for (i = 0; i < len; ++i) @@ -1997,9 +1997,9 @@ dfafree(d) Type left right is in ---- ---- ----- -- -- char c # c # c # c # c - + CSET ZERO ZERO ZERO ZERO - + STAR ZERO ZERO ZERO ZERO QMARK ZERO ZERO ZERO ZERO @@ -2010,12 +2010,12 @@ dfafree(d) p->left : q->right : q->is!=ZERO) ? q->in plus p->is##q->left p->right##q->is p->is##q->is : p->right##q->left ZERO - + OR longest common longest common (do p->is and substrings common to leading trailing q->is have same p->in and q->in - (sub)sequence (sub)sequence length and - of p->left of p->right content) ? - and q->left and q->right p->is : NULL + (sub)sequence (sub)sequence length and + of p->left of p->right content) ? + and q->left and q->right p->is : NULL If there's anything else we recognize in the tree, all four sequences get set to zero-length sequences. If there's something we don't recognize in the tree, @@ -2042,7 +2042,7 @@ dfafree(d) Does optimization actually accomplish anything, or is the automaton you get from "psi|epsilon" (for example) the same as the one you get from "psi" (for example)? - + Are optimizable r.e.'s likely to be used in real-life situations (something like 'ab*' is probably unlikely; something like is 'psi|epsilon' is likelier)? */ diff --git a/gnu/usr.bin/grep/grep.c b/gnu/usr.bin/grep/grep.c index 07872a1..dc33298 100644 --- a/gnu/usr.bin/grep/grep.c +++ b/gnu/usr.bin/grep/grep.c @@ -90,7 +90,7 @@ memchr(vp, c, n) return 0; } #endif - + /* Define flags declared in grep.h. */ char *matcher; int match_icase; @@ -591,7 +591,7 @@ setmatcher(name) return 1; } return 0; -} +} int main(argc, argv) diff --git a/gnu/usr.bin/grep/kwset.c b/gnu/usr.bin/grep/kwset.c index 9b09071..afbeb64 100644 --- a/gnu/usr.bin/grep/kwset.c +++ b/gnu/usr.bin/grep/kwset.c @@ -758,7 +758,7 @@ cwexec(kws, text, len, kwsmatch) } return mch; } - + /* Search through the given text for a match of any member of the given keyword set. Return a pointer to the first character of the matching substring, or NULL if no match is found. If FOUNDLEN diff --git a/gnu/usr.bin/grep/obstack.h b/gnu/usr.bin/grep/obstack.h index 8a18e45..09d2c32 100644 --- a/gnu/usr.bin/grep/obstack.h +++ b/gnu/usr.bin/grep/obstack.h @@ -321,7 +321,7 @@ __extension__ \ /* These assume that the obstack alignment is good enough for pointers or ints, and that the data added so far to the current object shares that much alignment. */ - + #define obstack_ptr_grow(OBSTACK,datum) \ __extension__ \ ({ struct obstack *__o = (OBSTACK); \ diff --git a/gnu/usr.bin/grep/search.c b/gnu/usr.bin/grep/search.c index 43c2d12..2b89338 100644 --- a/gnu/usr.bin/grep/search.c +++ b/gnu/usr.bin/grep/search.c @@ -128,7 +128,7 @@ kwsinit() if (!(kwset = kwsalloc(match_icase ? trans : (char *) 0))) fatal("memory exhausted", 0); -} +} /* If the DFA turns out to have some set of fixed strings one of which must occur in the match, then we build a kwset matcher |