1154465Sdougb# if 0 298567Sobrien/* $NetBSD: rcorder.c,v 1.7 2000/08/04 07:33:55 enami Exp $ */ 3154465Sdougb#endif 478344Sobrien 578344Sobrien/* 678344Sobrien * Copyright (c) 1998, 1999 Matthew R. Green 778344Sobrien * All rights reserved. 878344Sobrien * Copyright (c) 1998 978344Sobrien * Perry E. Metzger. All rights reserved. 1078344Sobrien * 1178344Sobrien * Redistribution and use in source and binary forms, with or without 1278344Sobrien * modification, are permitted provided that the following conditions 1378344Sobrien * are met: 1478344Sobrien * 1. Redistributions of source code must retain the above copyright 1578344Sobrien * notice, this list of conditions and the following disclaimer. 1678344Sobrien * 2. Redistributions in binary form must reproduce the above copyright 1778344Sobrien * notice, this list of conditions and the following disclaimer in the 1878344Sobrien * documentation and/or other materials provided with the distribution. 1978344Sobrien * 3. All advertising materials mentioning features or use of this software 2078344Sobrien * must display the following acknowledgement: 2178344Sobrien * This product includes software developed for the NetBSD Project 2278344Sobrien * by Perry E. Metzger. 2378344Sobrien * 4. The name of the author may not be used to endorse or promote products 2478344Sobrien * derived from this software without specific prior written permission. 2578344Sobrien * 2678344Sobrien * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 2778344Sobrien * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 2878344Sobrien * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 2978344Sobrien * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 3078344Sobrien * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 3178344Sobrien * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 3278344Sobrien * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 3378344Sobrien * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 3478344Sobrien * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 3578344Sobrien * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 3678344Sobrien */ 3778344Sobrien 3878344Sobrien#include <sys/types.h> 39154465Sdougb__FBSDID("$FreeBSD$"); 40154465Sdougb 4178344Sobrien#include <sys/stat.h> 4278344Sobrien 4378344Sobrien#include <err.h> 4478344Sobrien#include <stdio.h> 4578344Sobrien#include <stdlib.h> 4678344Sobrien#include <string.h> 4778344Sobrien#include <unistd.h> 4878344Sobrien#include <util.h> 4978344Sobrien 5078344Sobrien#include "ealloc.h" 5178344Sobrien#include "sprite.h" 5278344Sobrien#include "hash.h" 5378344Sobrien 5478344Sobrien#ifdef DEBUG 5578344Sobrienint debug = 0; 5678344Sobrien# define DPRINTF(args) if (debug) { fflush(stdout); fprintf args; } 5778344Sobrien#else 5878344Sobrien# define DPRINTF(args) 5978344Sobrien#endif 6078344Sobrien 6178344Sobrien#define REQUIRE_STR "# REQUIRE:" 6278344Sobrien#define REQUIRE_LEN (sizeof(REQUIRE_STR) - 1) 6378344Sobrien#define REQUIRES_STR "# REQUIRES:" 6478344Sobrien#define REQUIRES_LEN (sizeof(REQUIRES_STR) - 1) 6578344Sobrien#define PROVIDE_STR "# PROVIDE:" 6678344Sobrien#define PROVIDE_LEN (sizeof(PROVIDE_STR) - 1) 6778344Sobrien#define PROVIDES_STR "# PROVIDES:" 6878344Sobrien#define PROVIDES_LEN (sizeof(PROVIDES_STR) - 1) 6978344Sobrien#define BEFORE_STR "# BEFORE:" 7078344Sobrien#define BEFORE_LEN (sizeof(BEFORE_STR) - 1) 7178344Sobrien#define KEYWORD_STR "# KEYWORD:" 7278344Sobrien#define KEYWORD_LEN (sizeof(KEYWORD_STR) - 1) 7378344Sobrien#define KEYWORDS_STR "# KEYWORDS:" 7478344Sobrien#define KEYWORDS_LEN (sizeof(KEYWORDS_STR) - 1) 7578344Sobrien 7678344Sobrienint exit_code; 7778344Sobrienint file_count; 7878344Sobrienchar **file_list; 7978344Sobrien 8078344Sobrientypedef int bool; 8178344Sobrien#define TRUE 1 8278344Sobrien#define FALSE 0 8378344Sobrientypedef bool flag; 8478344Sobrien#define SET TRUE 8578344Sobrien#define RESET FALSE 8678344Sobrien 8778344SobrienHash_Table provide_hash_s, *provide_hash; 8878344Sobrien 8978344Sobrientypedef struct provnode provnode; 9078344Sobrientypedef struct filenode filenode; 9178344Sobrientypedef struct f_provnode f_provnode; 9278344Sobrientypedef struct f_reqnode f_reqnode; 9378344Sobrientypedef struct strnodelist strnodelist; 9478344Sobrien 9578344Sobrienstruct provnode { 9678344Sobrien flag head; 9778344Sobrien flag in_progress; 9878344Sobrien filenode *fnode; 9978344Sobrien provnode *next, *last; 10078344Sobrien}; 10178344Sobrien 10278344Sobrienstruct f_provnode { 10378344Sobrien provnode *pnode; 10478344Sobrien f_provnode *next; 10578344Sobrien}; 10678344Sobrien 10778344Sobrienstruct f_reqnode { 10878344Sobrien Hash_Entry *entry; 10978344Sobrien f_reqnode *next; 11078344Sobrien}; 11178344Sobrien 11278344Sobrienstruct strnodelist { 11378344Sobrien filenode *node; 11478344Sobrien strnodelist *next; 11578344Sobrien char s[1]; 11678344Sobrien}; 11778344Sobrien 11878344Sobrienstruct filenode { 11978344Sobrien char *filename; 12078344Sobrien flag in_progress; 12178344Sobrien filenode *next, *last; 12278344Sobrien f_reqnode *req_list; 12378344Sobrien f_provnode *prov_list; 12478344Sobrien strnodelist *keyword_list; 12578344Sobrien}; 12678344Sobrien 12778344Sobrienfilenode fn_head_s, *fn_head; 12878344Sobrien 12978344Sobrienstrnodelist *bl_list; 13078344Sobrienstrnodelist *keep_list; 13178344Sobrienstrnodelist *skip_list; 13278344Sobrien 133173412Skevlovoid do_file(filenode *fnode); 134173412Skevlovoid strnode_add(strnodelist **, char *, filenode *); 135173412Skevloint skip_ok(filenode *fnode); 136173412Skevloint keep_ok(filenode *fnode); 137173412Skevlovoid satisfy_req(f_reqnode *rnode, char *filename); 138173412Skevlovoid crunch_file(char *); 139173412Skevlovoid parse_require(filenode *, char *); 140173412Skevlovoid parse_provide(filenode *, char *); 141173412Skevlovoid parse_before(filenode *, char *); 142173412Skevlovoid parse_keywords(filenode *, char *); 143173412Skevlofilenode *filenode_new(char *); 144173412Skevlovoid add_require(filenode *, char *); 145173412Skevlovoid add_provide(filenode *, char *); 146173412Skevlovoid add_before(filenode *, char *); 147173412Skevlovoid add_keyword(filenode *, char *); 148173412Skevlovoid insert_before(void); 149173412SkevloHash_Entry *make_fake_provision(filenode *); 150173412Skevlovoid crunch_all_files(void); 151173412Skevlovoid initialize(void); 152173412Skevlovoid generate_ordering(void); 153173412Skevloint main(int, char *[]); 15478344Sobrien 15578344Sobrienint 156201227Sedmain(int argc, char *argv[]) 15778344Sobrien{ 15878344Sobrien int ch; 15978344Sobrien 16078344Sobrien while ((ch = getopt(argc, argv, "dk:s:")) != -1) 16178344Sobrien switch (ch) { 16278344Sobrien case 'd': 16378344Sobrien#ifdef DEBUG 16478344Sobrien debug = 1; 16578344Sobrien#else 16678344Sobrien warnx("debugging not compiled in, -d ignored"); 16778344Sobrien#endif 16878344Sobrien break; 16978344Sobrien case 'k': 17078344Sobrien strnode_add(&keep_list, optarg, 0); 17178344Sobrien break; 17278344Sobrien case 's': 17378344Sobrien strnode_add(&skip_list, optarg, 0); 17478344Sobrien break; 17578344Sobrien default: 17678344Sobrien /* XXX should crunch it? */ 17778344Sobrien break; 17878344Sobrien } 17978344Sobrien argc -= optind; 18078344Sobrien argv += optind; 18178344Sobrien 18278344Sobrien file_count = argc; 18378344Sobrien file_list = argv; 18478344Sobrien 18578344Sobrien DPRINTF((stderr, "parse_args\n")); 18678344Sobrien initialize(); 18778344Sobrien DPRINTF((stderr, "initialize\n")); 18878344Sobrien crunch_all_files(); 18978344Sobrien DPRINTF((stderr, "crunch_all_files\n")); 19078344Sobrien generate_ordering(); 19178344Sobrien DPRINTF((stderr, "generate_ordering\n")); 19278344Sobrien 19378344Sobrien exit(exit_code); 19478344Sobrien} 19578344Sobrien 19678344Sobrien/* 19778344Sobrien * initialise various variables. 19878344Sobrien */ 19978344Sobrienvoid 200201227Sedinitialize(void) 20178344Sobrien{ 20278344Sobrien 20378344Sobrien fn_head = &fn_head_s; 20478344Sobrien 20578344Sobrien provide_hash = &provide_hash_s; 20678344Sobrien Hash_InitTable(provide_hash, file_count); 20778344Sobrien} 20878344Sobrien 20978344Sobrien/* generic function to insert a new strnodelist element */ 21078344Sobrienvoid 211201227Sedstrnode_add(strnodelist **listp, char *s, filenode *fnode) 21278344Sobrien{ 21378344Sobrien strnodelist *ent; 21478344Sobrien 21578344Sobrien ent = emalloc(sizeof *ent + strlen(s)); 21678344Sobrien ent->node = fnode; 21778344Sobrien strcpy(ent->s, s); 21878344Sobrien ent->next = *listp; 21978344Sobrien *listp = ent; 22078344Sobrien} 22178344Sobrien 22278344Sobrien/* 22378344Sobrien * below are the functions that deal with creating the lists 22478344Sobrien * from the filename's given and the dependancies and provisions 22578344Sobrien * in each of these files. no ordering or checking is done here. 22678344Sobrien */ 22778344Sobrien 22878344Sobrien/* 22978344Sobrien * we have a new filename, create a new filenode structure. 23078344Sobrien * fill in the bits, and put it in the filenode linked list 23178344Sobrien */ 23278344Sobrienfilenode * 233201227Sedfilenode_new(char *filename) 23478344Sobrien{ 23578344Sobrien filenode *temp; 23678344Sobrien 23778344Sobrien temp = emalloc(sizeof(*temp)); 23878344Sobrien memset(temp, 0, sizeof(*temp)); 23978344Sobrien temp->filename = estrdup(filename); 24078344Sobrien temp->req_list = NULL; 24178344Sobrien temp->prov_list = NULL; 24278344Sobrien temp->keyword_list = NULL; 24378344Sobrien temp->in_progress = RESET; 24478344Sobrien /* 24578344Sobrien * link the filenode into the list of filenodes. 24678344Sobrien * note that the double linking means we can delete a 24778344Sobrien * filenode without searching for where it belongs. 24878344Sobrien */ 24978344Sobrien temp->next = fn_head->next; 25078344Sobrien if (temp->next != NULL) 25178344Sobrien temp->next->last = temp; 25278344Sobrien temp->last = fn_head; 25378344Sobrien fn_head->next = temp; 25478344Sobrien return (temp); 25578344Sobrien} 25678344Sobrien 25778344Sobrien/* 25878344Sobrien * add a requirement to a filenode. 25978344Sobrien */ 26078344Sobrienvoid 261201227Sedadd_require(filenode *fnode, char *s) 26278344Sobrien{ 26378344Sobrien Hash_Entry *entry; 26478344Sobrien f_reqnode *rnode; 26578344Sobrien int new; 26678344Sobrien 26778344Sobrien entry = Hash_CreateEntry(provide_hash, s, &new); 26878344Sobrien if (new) 26978344Sobrien Hash_SetValue(entry, NULL); 27078344Sobrien rnode = emalloc(sizeof(*rnode)); 27178344Sobrien rnode->entry = entry; 27278344Sobrien rnode->next = fnode->req_list; 27378344Sobrien fnode->req_list = rnode; 27478344Sobrien} 27578344Sobrien 27678344Sobrien/* 27778344Sobrien * add a provision to a filenode. if this provision doesn't 27878344Sobrien * have a head node, create one here. 27978344Sobrien */ 28078344Sobrienvoid 281201227Sedadd_provide(filenode *fnode, char *s) 28278344Sobrien{ 28378344Sobrien Hash_Entry *entry; 28478344Sobrien f_provnode *f_pnode; 28578344Sobrien provnode *pnode, *head; 28678344Sobrien int new; 28778344Sobrien 28878344Sobrien entry = Hash_CreateEntry(provide_hash, s, &new); 28978344Sobrien head = Hash_GetValue(entry); 29078344Sobrien 29178344Sobrien /* create a head node if necessary. */ 29278344Sobrien if (head == NULL) { 29378344Sobrien head = emalloc(sizeof(*head)); 29478344Sobrien head->head = SET; 29578344Sobrien head->in_progress = RESET; 29678344Sobrien head->fnode = NULL; 29778344Sobrien head->last = head->next = NULL; 29878344Sobrien Hash_SetValue(entry, head); 29978344Sobrien } 30078344Sobrien#if 0 30178344Sobrien /* 30278344Sobrien * Don't warn about this. We want to be able to support 30378344Sobrien * scripts that do two complex things: 30478344Sobrien * 30578344Sobrien * - Two independent scripts which both provide the 30678344Sobrien * same thing. Both scripts must be executed in 30778344Sobrien * any order to meet the barrier. An example: 30878344Sobrien * 30978344Sobrien * Script 1: 31078344Sobrien * 31178344Sobrien * PROVIDE: mail 31278344Sobrien * REQUIRE: LOGIN 31378344Sobrien * 31478344Sobrien * Script 2: 31578344Sobrien * 31678344Sobrien * PROVIDE: mail 31778344Sobrien * REQUIRE: LOGIN 31878344Sobrien * 31978344Sobrien * - Two interdependent scripts which both provide the 32078344Sobrien * same thing. Both scripts must be executed in 32178344Sobrien * graph order to meet the barrier. An example: 32278344Sobrien * 32378344Sobrien * Script 1: 32478344Sobrien * 32578344Sobrien * PROVIDE: nameservice dnscache 32678344Sobrien * REQUIRE: SERVERS 32778344Sobrien * 32878344Sobrien * Script 2: 32978344Sobrien * 33078344Sobrien * PROVIDE: nameservice nscd 33178344Sobrien * REQUIRE: dnscache 33278344Sobrien */ 33378344Sobrien else if (new == 0) { 33478344Sobrien warnx("file `%s' provides `%s'.", fnode->filename, s); 33578344Sobrien warnx("\tpreviously seen in `%s'.", 33678344Sobrien head->next->fnode->filename); 33778344Sobrien } 33878344Sobrien#endif 33978344Sobrien 34078344Sobrien pnode = emalloc(sizeof(*pnode)); 34178344Sobrien pnode->head = RESET; 34278344Sobrien pnode->in_progress = RESET; 34378344Sobrien pnode->fnode = fnode; 34478344Sobrien pnode->next = head->next; 34578344Sobrien pnode->last = head; 34678344Sobrien head->next = pnode; 34778344Sobrien if (pnode->next != NULL) 34878344Sobrien pnode->next->last = pnode; 34978344Sobrien 35078344Sobrien f_pnode = emalloc(sizeof(*f_pnode)); 35178344Sobrien f_pnode->pnode = pnode; 35278344Sobrien f_pnode->next = fnode->prov_list; 35378344Sobrien fnode->prov_list = f_pnode; 35478344Sobrien} 35578344Sobrien 35678344Sobrien/* 35778344Sobrien * put the BEFORE: lines to a list and handle them later. 35878344Sobrien */ 35978344Sobrienvoid 360201227Sedadd_before(filenode *fnode, char *s) 36178344Sobrien{ 36278344Sobrien strnodelist *bf_ent; 36378344Sobrien 36478344Sobrien bf_ent = emalloc(sizeof *bf_ent + strlen(s)); 36578344Sobrien bf_ent->node = fnode; 36678344Sobrien strcpy(bf_ent->s, s); 36778344Sobrien bf_ent->next = bl_list; 36878344Sobrien bl_list = bf_ent; 36978344Sobrien} 37078344Sobrien 37178344Sobrien/* 37278344Sobrien * add a key to a filenode. 37378344Sobrien */ 37478344Sobrienvoid 375201227Sedadd_keyword(filenode *fnode, char *s) 37678344Sobrien{ 37778344Sobrien 37878344Sobrien strnode_add(&fnode->keyword_list, s, fnode); 37978344Sobrien} 38078344Sobrien 38178344Sobrien/* 38278344Sobrien * loop over the rest of a REQUIRE line, giving each word to 38378344Sobrien * add_require() to do the real work. 38478344Sobrien */ 38578344Sobrienvoid 386201227Sedparse_require(filenode *node, char *buffer) 38778344Sobrien{ 38878344Sobrien char *s; 38978344Sobrien 39078344Sobrien while ((s = strsep(&buffer, " \t\n")) != NULL) 39178344Sobrien if (*s != '\0') 39278344Sobrien add_require(node, s); 39378344Sobrien} 39478344Sobrien 39578344Sobrien/* 39678344Sobrien * loop over the rest of a PROVIDE line, giving each word to 39778344Sobrien * add_provide() to do the real work. 39878344Sobrien */ 39978344Sobrienvoid 400201227Sedparse_provide(filenode *node, char *buffer) 40178344Sobrien{ 40278344Sobrien char *s; 40378344Sobrien 40478344Sobrien while ((s = strsep(&buffer, " \t\n")) != NULL) 40578344Sobrien if (*s != '\0') 40678344Sobrien add_provide(node, s); 40778344Sobrien} 40878344Sobrien 40978344Sobrien/* 41078344Sobrien * loop over the rest of a BEFORE line, giving each word to 41178344Sobrien * add_before() to do the real work. 41278344Sobrien */ 41378344Sobrienvoid 414201227Sedparse_before(filenode *node, char *buffer) 41578344Sobrien{ 41678344Sobrien char *s; 41778344Sobrien 41878344Sobrien while ((s = strsep(&buffer, " \t\n")) != NULL) 41978344Sobrien if (*s != '\0') 42078344Sobrien add_before(node, s); 42178344Sobrien} 42278344Sobrien 42378344Sobrien/* 42478344Sobrien * loop over the rest of a KEYWORD line, giving each word to 42578344Sobrien * add_keyword() to do the real work. 42678344Sobrien */ 42778344Sobrienvoid 428201227Sedparse_keywords(filenode *node, char *buffer) 42978344Sobrien{ 43078344Sobrien char *s; 43178344Sobrien 43278344Sobrien while ((s = strsep(&buffer, " \t\n")) != NULL) 43378344Sobrien if (*s != '\0') 43478344Sobrien add_keyword(node, s); 43578344Sobrien} 43678344Sobrien 43778344Sobrien/* 43878344Sobrien * given a file name, create a filenode for it, read in lines looking 43978344Sobrien * for provision and requirement lines, building the graphs as needed. 44078344Sobrien */ 44178344Sobrienvoid 442201227Sedcrunch_file(char *filename) 44378344Sobrien{ 44478344Sobrien FILE *fp; 44578344Sobrien char *buf; 44678344Sobrien int require_flag, provide_flag, before_flag, keywords_flag; 44778344Sobrien enum { BEFORE_PARSING, PARSING, PARSING_DONE } state; 44878344Sobrien filenode *node; 44978344Sobrien char delims[3] = { '\\', '\\', '\0' }; 45078344Sobrien struct stat st; 45178344Sobrien 45278344Sobrien if ((fp = fopen(filename, "r")) == NULL) { 45378344Sobrien warn("could not open %s", filename); 45478344Sobrien return; 45578344Sobrien } 45678344Sobrien 45778344Sobrien if (fstat(fileno(fp), &st) == -1) { 45878344Sobrien warn("could not stat %s", filename); 45978344Sobrien fclose(fp); 46078344Sobrien return; 46178344Sobrien } 46278344Sobrien 46378344Sobrien if (!S_ISREG(st.st_mode)) { 46498567Sobrien#if 0 46578344Sobrien warnx("%s is not a file", filename); 46698567Sobrien#endif 46778344Sobrien fclose(fp); 46878344Sobrien return; 46978344Sobrien } 47078344Sobrien 47178344Sobrien node = filenode_new(filename); 47278344Sobrien 47378344Sobrien /* 47478344Sobrien * we don't care about length, line number, don't want # for comments, 47578344Sobrien * and have no flags. 47678344Sobrien */ 47778344Sobrien for (state = BEFORE_PARSING; state != PARSING_DONE && 47878344Sobrien (buf = fparseln(fp, NULL, NULL, delims, 0)) != NULL; free(buf)) { 47978344Sobrien require_flag = provide_flag = before_flag = keywords_flag = 0; 48078344Sobrien if (strncmp(REQUIRE_STR, buf, REQUIRE_LEN) == 0) 48178344Sobrien require_flag = REQUIRE_LEN; 48278344Sobrien else if (strncmp(REQUIRES_STR, buf, REQUIRES_LEN) == 0) 48378344Sobrien require_flag = REQUIRES_LEN; 48478344Sobrien else if (strncmp(PROVIDE_STR, buf, PROVIDE_LEN) == 0) 48578344Sobrien provide_flag = PROVIDE_LEN; 48678344Sobrien else if (strncmp(PROVIDES_STR, buf, PROVIDES_LEN) == 0) 48778344Sobrien provide_flag = PROVIDES_LEN; 48878344Sobrien else if (strncmp(BEFORE_STR, buf, BEFORE_LEN) == 0) 48978344Sobrien before_flag = BEFORE_LEN; 49078344Sobrien else if (strncmp(KEYWORD_STR, buf, KEYWORD_LEN) == 0) 49178344Sobrien keywords_flag = KEYWORD_LEN; 49278344Sobrien else if (strncmp(KEYWORDS_STR, buf, KEYWORDS_LEN) == 0) 49378344Sobrien keywords_flag = KEYWORDS_LEN; 49478344Sobrien else { 49578344Sobrien if (state == PARSING) 49678344Sobrien state = PARSING_DONE; 49778344Sobrien continue; 49878344Sobrien } 49978344Sobrien 50078344Sobrien state = PARSING; 50178344Sobrien if (require_flag) 50278344Sobrien parse_require(node, buf + require_flag); 50378344Sobrien else if (provide_flag) 50478344Sobrien parse_provide(node, buf + provide_flag); 50578344Sobrien else if (before_flag) 50678344Sobrien parse_before(node, buf + before_flag); 50778344Sobrien else if (keywords_flag) 50878344Sobrien parse_keywords(node, buf + keywords_flag); 50978344Sobrien } 51078344Sobrien fclose(fp); 51178344Sobrien} 51278344Sobrien 51378344SobrienHash_Entry * 514201227Sedmake_fake_provision(filenode *node) 51578344Sobrien{ 51678344Sobrien Hash_Entry *entry; 51778344Sobrien f_provnode *f_pnode; 51878344Sobrien provnode *head, *pnode; 51978344Sobrien static int i = 0; 52078344Sobrien int new; 52178344Sobrien char buffer[30]; 52278344Sobrien 52378344Sobrien do { 52478344Sobrien snprintf(buffer, sizeof buffer, "fake_prov_%08d", i++); 52578344Sobrien entry = Hash_CreateEntry(provide_hash, buffer, &new); 52678344Sobrien } while (new == 0); 52778344Sobrien head = emalloc(sizeof(*head)); 52878344Sobrien head->head = SET; 52978344Sobrien head->in_progress = RESET; 53078344Sobrien head->fnode = NULL; 53178344Sobrien head->last = head->next = NULL; 53278344Sobrien Hash_SetValue(entry, head); 53378344Sobrien 53478344Sobrien pnode = emalloc(sizeof(*pnode)); 53578344Sobrien pnode->head = RESET; 53678344Sobrien pnode->in_progress = RESET; 53778344Sobrien pnode->fnode = node; 53878344Sobrien pnode->next = head->next; 53978344Sobrien pnode->last = head; 54078344Sobrien head->next = pnode; 54178344Sobrien if (pnode->next != NULL) 54278344Sobrien pnode->next->last = pnode; 54378344Sobrien 54478344Sobrien f_pnode = emalloc(sizeof(*f_pnode)); 54578344Sobrien f_pnode->pnode = pnode; 54678344Sobrien f_pnode->next = node->prov_list; 54778344Sobrien node->prov_list = f_pnode; 54878344Sobrien 54978344Sobrien return (entry); 55078344Sobrien} 55178344Sobrien 55278344Sobrien/* 55378344Sobrien * go through the BEFORE list, inserting requirements into the graph(s) 55478344Sobrien * as required. in the before list, for each entry B, we have a file F 55578344Sobrien * and a string S. we create a "fake" provision (P) that F provides. 55678344Sobrien * for each entry in the provision list for S, add a requirement to 55778344Sobrien * that provisions filenode for P. 55878344Sobrien */ 55978344Sobrienvoid 560201227Sedinsert_before(void) 56178344Sobrien{ 56278344Sobrien Hash_Entry *entry, *fake_prov_entry; 56378344Sobrien provnode *pnode; 56478344Sobrien f_reqnode *rnode; 56578344Sobrien strnodelist *bl; 56678344Sobrien int new; 56778344Sobrien 56878344Sobrien while (bl_list != NULL) { 56978344Sobrien bl = bl_list->next; 57078344Sobrien 57178344Sobrien fake_prov_entry = make_fake_provision(bl_list->node); 57278344Sobrien 57378344Sobrien entry = Hash_CreateEntry(provide_hash, bl_list->s, &new); 57478344Sobrien if (new == 1) 57578344Sobrien warnx("file `%s' is before unknown provision `%s'", bl_list->node->filename, bl_list->s); 57678344Sobrien 57778344Sobrien for (pnode = Hash_GetValue(entry); pnode; pnode = pnode->next) { 57878344Sobrien if (pnode->head) 57978344Sobrien continue; 58078344Sobrien 58178344Sobrien rnode = emalloc(sizeof(*rnode)); 58278344Sobrien rnode->entry = fake_prov_entry; 58378344Sobrien rnode->next = pnode->fnode->req_list; 58478344Sobrien pnode->fnode->req_list = rnode; 58578344Sobrien } 58678344Sobrien 58778344Sobrien free(bl_list); 58878344Sobrien bl_list = bl; 58978344Sobrien } 59078344Sobrien} 59178344Sobrien 59278344Sobrien/* 59378344Sobrien * loop over all the files calling crunch_file() on them to do the 59478344Sobrien * real work. after we have built all the nodes, insert the BEFORE: 59578344Sobrien * lines into graph(s). 59678344Sobrien */ 59778344Sobrienvoid 598201227Sedcrunch_all_files(void) 59978344Sobrien{ 60078344Sobrien int i; 60178344Sobrien 60278344Sobrien for (i = 0; i < file_count; i++) 60378344Sobrien crunch_file(file_list[i]); 60478344Sobrien insert_before(); 60578344Sobrien} 60678344Sobrien 60778344Sobrien/* 60878344Sobrien * below are the functions that traverse the graphs we have built 60978344Sobrien * finding out the desired ordering, printing each file in turn. 61078344Sobrien * if missing requirements, or cyclic graphs are detected, a 61178344Sobrien * warning will be issued, and we will continue on.. 61278344Sobrien */ 61378344Sobrien 61478344Sobrien/* 61578344Sobrien * given a requirement node (in a filename) we attempt to satisfy it. 61678344Sobrien * we do some sanity checking first, to ensure that we have providers, 61778344Sobrien * aren't already satisfied and aren't already being satisfied (ie, 61878344Sobrien * cyclic). if we pass all this, we loop over the provision list 61978344Sobrien * calling do_file() (enter recursion) for each filenode in this 62078344Sobrien * provision. 62178344Sobrien */ 62278344Sobrienvoid 623201227Sedsatisfy_req(f_reqnode *rnode, char *filename) 62478344Sobrien{ 62578344Sobrien Hash_Entry *entry; 62678344Sobrien provnode *head; 62778344Sobrien 62878344Sobrien entry = rnode->entry; 62978344Sobrien head = Hash_GetValue(entry); 63078344Sobrien 63178344Sobrien if (head == NULL) { 63278344Sobrien warnx("requirement `%s' in file `%s' has no providers.", 63378344Sobrien Hash_GetKey(entry), filename); 63478344Sobrien exit_code = 1; 63578344Sobrien return; 63678344Sobrien } 63778344Sobrien 63878344Sobrien /* return if the requirement is already satisfied. */ 63978344Sobrien if (head->next == NULL) 64078344Sobrien return; 64178344Sobrien 64278344Sobrien /* 64378344Sobrien * if list is marked as in progress, 64478344Sobrien * print that there is a circular dependency on it and abort 64578344Sobrien */ 64678344Sobrien if (head->in_progress == SET) { 64778344Sobrien warnx("Circular dependency on provision `%s' in file `%s'.", 64878344Sobrien Hash_GetKey(entry), filename); 64978344Sobrien exit_code = 1; 65078344Sobrien return; 65178344Sobrien } 65278344Sobrien 65378344Sobrien head->in_progress = SET; 65478344Sobrien 65578344Sobrien /* 65678344Sobrien * while provision_list is not empty 65778344Sobrien * do_file(first_member_of(provision_list)); 65878344Sobrien */ 65978344Sobrien while (head->next != NULL) 66078344Sobrien do_file(head->next->fnode); 66178344Sobrien} 66278344Sobrien 66378344Sobrienint 664201227Sedskip_ok(filenode *fnode) 66578344Sobrien{ 66678344Sobrien strnodelist *s; 66778344Sobrien strnodelist *k; 66878344Sobrien 66978344Sobrien for (s = skip_list; s; s = s->next) 67078344Sobrien for (k = fnode->keyword_list; k; k = k->next) 67178344Sobrien if (strcmp(k->s, s->s) == 0) 67278344Sobrien return (0); 67378344Sobrien 67478344Sobrien return (1); 67578344Sobrien} 67678344Sobrien 67778344Sobrienint 678201227Sedkeep_ok(filenode *fnode) 67978344Sobrien{ 68078344Sobrien strnodelist *s; 68178344Sobrien strnodelist *k; 68278344Sobrien 68378344Sobrien for (s = keep_list; s; s = s->next) 68478344Sobrien for (k = fnode->keyword_list; k; k = k->next) 68578344Sobrien if (strcmp(k->s, s->s) == 0) 68678344Sobrien return (1); 68778344Sobrien 68878344Sobrien /* an empty keep_list means every one */ 68978344Sobrien return (!keep_list); 69078344Sobrien} 69178344Sobrien 69278344Sobrien/* 69378344Sobrien * given a filenode, we ensure we are not a cyclic graph. if this 69478344Sobrien * is ok, we loop over the filenodes requirements, calling satisfy_req() 69578344Sobrien * for each of them.. once we have done this, remove this filenode 69678344Sobrien * from each provision table, as we are now done. 697158759Sdelphij * 698158759Sdelphij * NOTE: do_file() is called recursively from several places and cannot 699158759Sdelphij * safely free() anything related to items that may be recursed on. 700158759Sdelphij * Circular dependancies will cause problems if we do. 70178344Sobrien */ 70278344Sobrienvoid 703201227Seddo_file(filenode *fnode) 70478344Sobrien{ 70578344Sobrien f_reqnode *r, *r_tmp; 70678344Sobrien f_provnode *p, *p_tmp; 70778344Sobrien provnode *pnode; 70878344Sobrien int was_set; 70978344Sobrien 71078344Sobrien DPRINTF((stderr, "do_file on %s.\n", fnode->filename)); 71178344Sobrien 71278344Sobrien /* 71378344Sobrien * if fnode is marked as in progress, 71478344Sobrien * print that fnode; is circularly depended upon and abort. 71578344Sobrien */ 71678344Sobrien if (fnode->in_progress == SET) { 71778344Sobrien warnx("Circular dependency on file `%s'.", 71878344Sobrien fnode->filename); 71978344Sobrien was_set = exit_code = 1; 72078344Sobrien } else 72178344Sobrien was_set = 0; 72278344Sobrien 72378344Sobrien /* mark fnode */ 72478344Sobrien fnode->in_progress = SET; 72578344Sobrien 72678344Sobrien /* 72778344Sobrien * for each requirement of fnode -> r 72878344Sobrien * satisfy_req(r, filename) 72978344Sobrien */ 73078344Sobrien r = fnode->req_list; 73178344Sobrien while (r != NULL) { 73278344Sobrien r_tmp = r; 73378344Sobrien satisfy_req(r, fnode->filename); 73478344Sobrien r = r->next; 735158759Sdelphij#if 0 736154465Sdougb if (was_set == 0) 737158759Sdelphij free(r_tmp); 738158759Sdelphij#endif 73978344Sobrien } 74078344Sobrien fnode->req_list = NULL; 74178344Sobrien 74278344Sobrien /* 74378344Sobrien * for each provision of fnode -> p 74478344Sobrien * remove fnode from provision list for p in hash table 74578344Sobrien */ 74678344Sobrien p = fnode->prov_list; 74778344Sobrien while (p != NULL) { 74878344Sobrien p_tmp = p; 74978344Sobrien pnode = p->pnode; 75078344Sobrien if (pnode->next != NULL) { 75178344Sobrien pnode->next->last = pnode->last; 75278344Sobrien } 75378344Sobrien if (pnode->last != NULL) { 75478344Sobrien pnode->last->next = pnode->next; 75578344Sobrien } 75678344Sobrien free(pnode); 75778344Sobrien p = p->next; 75878344Sobrien free(p_tmp); 75978344Sobrien } 76078344Sobrien fnode->prov_list = NULL; 76178344Sobrien 76278344Sobrien /* do_it(fnode) */ 76378344Sobrien DPRINTF((stderr, "next do: ")); 76478344Sobrien 76578344Sobrien /* if we were already in progress, don't print again */ 76678344Sobrien if (was_set == 0 && skip_ok(fnode) && keep_ok(fnode)) 76778344Sobrien printf("%s\n", fnode->filename); 76878344Sobrien 76978344Sobrien if (fnode->next != NULL) { 77078344Sobrien fnode->next->last = fnode->last; 77178344Sobrien } 77278344Sobrien if (fnode->last != NULL) { 77378344Sobrien fnode->last->next = fnode->next; 77478344Sobrien } 77578344Sobrien 77678344Sobrien DPRINTF((stderr, "nuking %s\n", fnode->filename)); 777158759Sdelphij#if 0 778154465Sdougb if (was_set == 0) { 779154465Sdougb free(fnode->filename); 780154465Sdougb free(fnode); 781154465Sdougb } 782158759Sdelphij#endif 78378344Sobrien} 78478344Sobrien 78578344Sobrienvoid 786201227Sedgenerate_ordering(void) 78778344Sobrien{ 78878344Sobrien 78978344Sobrien /* 79078344Sobrien * while there remain undone files{f}, 79178344Sobrien * pick an arbitrary f, and do_file(f) 79278344Sobrien * Note that the first file in the file list is perfectly 79378344Sobrien * arbitrary, and easy to find, so we use that. 79478344Sobrien */ 79578344Sobrien 79678344Sobrien /* 79778344Sobrien * N.B.: the file nodes "self delete" after they execute, so 79878344Sobrien * after each iteration of the loop, the head will be pointing 79978344Sobrien * to something totally different. The loop ends up being 80078344Sobrien * executed only once for every strongly connected set of 80178344Sobrien * nodes. 80278344Sobrien */ 80378344Sobrien while (fn_head->next != NULL) { 80478344Sobrien DPRINTF((stderr, "generate on %s\n", fn_head->next->filename)); 80578344Sobrien do_file(fn_head->next); 80678344Sobrien } 80778344Sobrien} 808