os
/
freebsd-src
mirror of https://github.com/freebsd/freebsd-src.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Add missing static keywords to tsort(1)

This commit is contained in:
Ed Schouten 2011-11-06 08:17:47 +00:00
parent 1dca6e4e8a
commit 4fbf47feda
Notes: svn2git 2020-12-20 02:59:44 +00:00 
svn path=/head/; revision=227189
1 changed files with 19 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -96,18 +96,18 @@ typedef struct _buf {
int b_bsize;
} BUF;
DB *db;
NODE *graph, **cycle_buf, **longest_cycle;
int debug, longest, quiet;
static DB *db;
static NODE *graph, **cycle_buf, **longest_cycle;
static int debug, longest, quiet;
void add_arc(char *, char *);
int find_cycle(NODE *, NODE *, int, int);
NODE *get_node(char *);
void *grow_buf(void *, size_t);
void remove_node(NODE *);
void clear_cycle(void);
void tsort(void);
void usage(void);
static void add_arc(char *, char *);
static int find_cycle(NODE *, NODE *, int, int);
static NODE *get_node(char *);
static void *grow_buf(void *, size_t);
static void remove_node(NODE *);
static void clear_cycle(void);
static void tsort(void);
static void usage(void);
int
main(int argc, char *argv[])
@ -185,7 +185,7 @@ main(int argc, char *argv[])
}
/* double the size of oldbuf and return a pointer to the new buffer. */
void *
static void *
grow_buf(void *bp, size_t size)
{
if ((bp = realloc(bp, size)) == NULL)
@ -197,7 +197,7 @@ grow_buf(void *bp, size_t size)
* add an arc from node s1 to node s2 in the graph. If s1 or s2 are not in
* the graph, then add them.
*/
void
static void
add_arc(char *s1, char *s2)
{
NODE *n1;
@ -232,7 +232,7 @@ add_arc(char *s1, char *s2)
}
/* Find a node in the graph (insert if not found) and return a pointer to it. */
NODE *
static NODE *
get_node(char *name)
{
DBT data, key;
@ -284,7 +284,7 @@ get_node(char *name)
/*
* Clear the NODEST flag from all nodes.
*/
void
static void
clear_cycle(void)
{
NODE *n;
@ -294,7 +294,7 @@ clear_cycle(void)
}
/* do topological sort on graph */
void
static void
tsort(void)
{
NODE *n, *next;
@ -357,7 +357,7 @@ tsort(void)
}
/* print node and remove from graph (does not actually free node) */
void
static void
remove_node(NODE *n)
{
NODE **np;
@ -374,7 +374,7 @@ remove_node(NODE *n)
/* look for the longest? cycle from node from to node to. */
int
static int
find_cycle(NODE *from, NODE *to, int longest_len, int depth)
{
NODE **np;
@ -420,7 +420,7 @@ find_cycle(NODE *from, NODE *to, int longest_len, int depth)
return (longest_len);
}
void
static void
usage(void)
{
(void)fprintf(stderr, "usage: tsort [-dlq] [file]\n");