diff options
| -rw-r--r-- | src/tsort.c | 4 | ||||
| -rw-r--r-- | src/uniq.c | 10 |
2 files changed, 7 insertions, 7 deletions
diff --git a/src/tsort.c b/src/tsort.c index f496d08ec..6f16bafe3 100644 --- a/src/tsort.c +++ b/src/tsort.c @@ -1,5 +1,5 @@ /* tsort - topological sort. - Copyright (C) 1998-2004 Free Software Foundation, Inc. + Copyright (C) 1998-2005 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -442,7 +442,7 @@ tsort (const char *file) struct item *root; struct item *j = NULL; struct item *k = NULL; - register FILE *fp; + FILE *fp; token_buffer tokenbuffer; /* Intialize the head of the tree will hold the strings we're sorting. */ diff --git a/src/uniq.c b/src/uniq.c index 8a9fc9627..344245a1c 100644 --- a/src/uniq.c +++ b/src/uniq.c @@ -1,5 +1,5 @@ /* uniq -- remove duplicate lines from a sorted file - Copyright (C) 86, 91, 1995-2004 Free Software Foundation, Inc. + Copyright (C) 86, 91, 1995-2005 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -191,10 +191,10 @@ size_opt (char const *opt, char const *msgid) static char * find_field (const struct linebuffer *line) { - register size_t count; - register char *lp = line->buffer; - register size_t size = line->length - 1; - register size_t i = 0; + size_t count; + char *lp = line->buffer; + size_t size = line->length - 1; + size_t i = 0; for (count = 0; count < skip_fields && i < size; count++) { |