[BACK]Return to tsort.c CVS log [TXT][DIR] Up to [local] / src / usr.bin / tsort

Diff for /src/usr.bin/tsort/tsort.c between version 1.12 and 1.13

version 1.12, 2002/02/16 21:27:55 version 1.13, 2002/02/17 19:42:33
Line 132 
Line 132 
 static void usage(void);  static void usage(void);
 static struct node *new_node(const char *, const char *);  static struct node *new_node(const char *, const char *);
   
 static unsigned int read_pairs __P((FILE *, struct ohash *, int,  static unsigned int read_pairs(FILE *, struct ohash *, int,
     const char *, unsigned int, int));      const char *, unsigned int, int);
 static void split_nodes(struct ohash *, struct array *, struct array *);  static void split_nodes(struct ohash *, struct array *, struct array *);
 static void make_transparent(struct ohash *);  static void make_transparent(struct ohash *);
 static void insert_arc(struct node *, struct node *);  static void insert_arc(struct node *, struct node *);
Line 143 
Line 143 
 static void dump_array(struct array *);  static void dump_array(struct array *);
 static void dump_hash(struct ohash *);  static void dump_hash(struct ohash *);
 #endif  #endif
 static unsigned int read_hints __P((FILE *, struct ohash *, int,  static unsigned int read_hints(FILE *, struct ohash *, int,
     const char *, unsigned int));      const char *, unsigned int);
 static struct node *find_smallest_node(struct array *);  static struct node *find_smallest_node(struct array *);
 static struct node *find_good_cycle_break(struct array *);  static struct node *find_good_cycle_break(struct array *);
 static void print_cycle(struct array *);  static void print_cycle(struct array *);

Legend:
Removed from v.1.12  
changed lines
  Added in v.1.13