Lines Matching defs:filenode
105 typedef struct filenode filenode;
113 filenode *fnode;
128 filenode *node;
133 struct filenode {
136 filenode *next, *last;
142 filenode fn_head_s, *fn_head;
148 void do_file(filenode *fnode);
149 void strnode_add(strnodelist **, char *, filenode *);
150 int skip_ok(filenode *fnode);
151 int keep_ok(filenode *fnode);
154 void parse_line(filenode *, char *, void (*)(filenode *, char *));
155 filenode *filenode_new(char *);
156 void add_require(filenode *, char *);
157 void add_provide(filenode *, char *);
158 void add_before(filenode *, char *);
159 void add_keyword(filenode *, char *);
161 Hash_Entry *make_fake_provision(filenode *);
222 strnode_add(strnodelist **listp, char *s, filenode *fnode)
240 * we have a new filename, create a new filenode structure.
241 * fill in the bits, and put it in the filenode linked list
243 filenode *
246 filenode *temp;
256 * link the filenode into the list of filenodes.
258 * filenode without searching for where it belongs.
269 * add a requirement to a filenode.
272 add_require(filenode *fnode, char *s)
288 * add a provision to a filenode. if this provision doesn't
292 add_provide(filenode *fnode, char *s)
371 add_before(filenode *fnode, char *s)
378 * add a key to a filenode.
381 add_keyword(filenode *fnode, char *s)
392 parse_line(filenode *node, char *buffer, void (*add_func)(filenode *, char *))
402 * given a file name, create a filenode for it, read in lines looking
412 filenode *node;
478 make_fake_provision(filenode *node)
521 * that provisions filenode for P.
584 * calling do_file() (enter recursion) for each filenode in this
629 skip_ok(filenode *fnode)
643 keep_ok(filenode *fnode)
658 filenode, we ensure we are not a cyclic graph. if this
660 * for each of them.. once we have done this, remove this filenode
668 do_file(filenode *fnode)