grep-devel
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Grep-devel] [PATCH] maint: space before paren


From: Paul Eggert
Subject: [Grep-devel] [PATCH] maint: space before paren
Date: Thu, 29 Dec 2016 19:23:36 -0800

---
 src/dosbuf.c |  8 ++++----
 src/grep.c   | 12 ++++++------
 src/kwset.c  | 20 ++++++++++----------
 3 files changed, 20 insertions(+), 20 deletions(-)

diff --git a/src/dosbuf.c b/src/dosbuf.c
index 839cc3a..accc3ff 100644
--- a/src/dosbuf.c
+++ b/src/dosbuf.c
@@ -113,7 +113,7 @@ undossify_input (char *buf, size_t buflen)
 
   /* Guess if this file is binary, unless we already know that.  */
   if (dos_file_type == UNKNOWN)
-    dos_file_type = guess_type(buf, buflen);
+    dos_file_type = guess_type (buf, buflen);
 
   /* If this file is to be treated as DOS Text, strip the CR characters
      and maybe build the table for character position mapping on output.  */
@@ -143,9 +143,9 @@ undossify_input (char *buf, size_t buflen)
                   if (inp_map_idx >= dos_pos_map_size - 1)
                     {
                       dos_pos_map_size = inp_map_idx ? inp_map_idx * 2 : 1000;
-                      dos_pos_map = xrealloc(dos_pos_map,
-                                             dos_pos_map_size *
-                                             sizeof(struct dos_map));
+                      dos_pos_map = xrealloc (dos_pos_map,
+                                              (dos_pos_map_size
+                                               * sizeof (struct dos_map)));
                     }
 
                   if (!inp_map_idx)
diff --git a/src/grep.c b/src/grep.c
index ab47839..e64c430 100644
--- a/src/grep.c
+++ b/src/grep.c
@@ -1921,19 +1921,19 @@ usage (int status)
   if (status != 0)
     {
       fprintf (stderr, _("Usage: %s [OPTION]... PATTERN [FILE]...\n"),
-               getprogname());
+               getprogname ());
       fprintf (stderr, _("Try '%s --help' for more information.\n"),
-               getprogname());
+               getprogname ());
     }
   else
     {
-      printf (_("Usage: %s [OPTION]... PATTERN [FILE]...\n"), getprogname());
+      printf (_("Usage: %s [OPTION]... PATTERN [FILE]...\n"), getprogname ());
       printf (_("Search for PATTERN in each FILE or standard input.\n"));
       printf (_("PATTERN is, by default, a basic regular expression 
(BRE).\n"));
       printf (_("\
 Example: %s -i 'hello world' menu.h main.c\n\
 \n\
-Regexp selection and interpretation:\n"), getprogname());
+Regexp selection and interpretation:\n"), getprogname ());
       printf (_("\
   -E, --extended-regexp     PATTERN is an extended regular expression (ERE)\n\
   -F, --fixed-strings       PATTERN is a set of newline-separated strings\n\
@@ -2764,7 +2764,7 @@ main (int argc, char **argv)
 
   if (show_version)
     {
-      version_etc (stdout, getprogname(), PACKAGE_NAME, VERSION, AUTHORS,
+      version_etc (stdout, getprogname (), PACKAGE_NAME, VERSION, AUTHORS,
                    (char *) NULL);
       return EXIT_SUCCESS;
     }
@@ -2931,6 +2931,6 @@ main (int argc, char **argv)
     status &= grep_command_line_arg (*files++);
   while (*files != NULL);
 
-  /* We register via atexit() to test stdout.  */
+  /* We register via atexit to test stdout.  */
   return errseen ? EXIT_TROUBLE : status;
 }
diff --git a/src/kwset.c b/src/kwset.c
index 2e59be0..30c0f04 100644
--- a/src/kwset.c
+++ b/src/kwset.c
@@ -310,8 +310,8 @@ enqueue (struct tree *tree, struct trie **last)
 {
   if (!tree)
     return;
-  enqueue(tree->llink, last);
-  enqueue(tree->rlink, last);
+  enqueue (tree->llink, last);
+  enqueue (tree->rlink, last);
   (*last) = (*last)->next = tree->trie;
 }
 
@@ -327,8 +327,8 @@ treefails (struct tree const *tree, struct trie const *fail,
   if (!tree)
     return;
 
-  treefails(tree->llink, fail, recourse, reverse);
-  treefails(tree->rlink, fail, recourse, reverse);
+  treefails (tree->llink, fail, recourse, reverse);
+  treefails (tree->rlink, fail, recourse, reverse);
 
   /* Find, in the chain of fails going back to the root, the first
      node that has a descendant on the current label. */
@@ -360,8 +360,8 @@ treedelta (struct tree const *tree, ptrdiff_t depth, 
unsigned char delta[])
 {
   if (!tree)
     return;
-  treedelta(tree->llink, depth, delta);
-  treedelta(tree->rlink, depth, delta);
+  treedelta (tree->llink, depth, delta);
+  treedelta (tree->rlink, depth, delta);
   if (depth < delta[tree->label])
     delta[tree->label] = depth;
 }
@@ -372,9 +372,9 @@ hasevery (struct tree const *a, struct tree const *b)
 {
   if (!b)
     return true;
-  if (!hasevery(a, b->llink))
+  if (!hasevery (a, b->llink))
     return false;
-  if (!hasevery(a, b->rlink))
+  if (!hasevery (a, b->rlink))
     return false;
   while (a && b->label != a->label)
     if (b->label < a->label)
@@ -391,8 +391,8 @@ treenext (struct tree const *tree, struct trie *next[])
 {
   if (!tree)
     return;
-  treenext(tree->llink, next);
-  treenext(tree->rlink, next);
+  treenext (tree->llink, next);
+  treenext (tree->rlink, next);
   next[tree->label] = tree->trie;
 }
 
-- 
2.7.4




reply via email to

[Prev in Thread] Current Thread [Next in Thread]