1 #include	"mk.h"
2 
3 int runerrs;
4 
5 void
6 mk(char *target)
7 {
8 	Node *node;
9 	int did = 0;
10 
11 	nproc();		/* it can be updated dynamically */
12 	nrep();			/* it can be updated dynamically */
13 	runerrs = 0;
14 	node = graph(target);
15 	if(DEBUG(D_GRAPH)){
16 		dumpn("new target\n", node);
17 		Bflush(&bout);
18 	}
19 	clrmade(node);
20 	while(node->flags&NOTMADE){
21 		if(work(node, (Node *)0, (Arc *)0))
22 			did = 1;	/* found something to do */
23 		else {
24 			if(waitup(1, (int *)0) > 0){
25 				if(node->flags&(NOTMADE|BEINGMADE)){
26 					assert("must be run errors", runerrs);
27 					break;	/* nothing more waiting */
28 				}
29 			}
30 		}
31 	}
32 	if(node->flags&BEINGMADE)
33 		waitup(-1, (int *)0);
34 	while(jobs)
35 		waitup(-2, (int *)0);
36 	assert("target didn't get done", runerrs || (node->flags&MADE));
37 	if(did == 0)
38 		Bprint(&bout, "mk: '%s' is up to date\n", node->name);
39 }
40 
41 void
42 clrmade(Node *n)
43 {
44 	Arc *a;
45 
46 	n->flags &= ~(CANPRETEND|PRETENDING);
47 	if(strchr(n->name, '(') ==0 || n->time)
48 		n->flags |= CANPRETEND;
49 	MADESET(n, NOTMADE);
50 	for(a = n->prereqs; a; a = a->next)
51 		if(a->n)
52 			clrmade(a->n);
53 }
54 
55 static void
56 unpretend(Node *n)
57 {
58 	MADESET(n, NOTMADE);
59 	n->flags &= ~(CANPRETEND|PRETENDING);
60 	n->time = 0;
61 }
62 
63 int
64 work(Node *node, Node *p, Arc *parc)
65 {
66 	Arc *a, *ra;
67 	int weoutofdate;
68 	int ready;
69 	int did = 0;
70 
71 	/*print("work(%s) flags=0x%x time=%ld\n", node->name, node->flags, node->time);*//**/
72 	if(node->flags&BEINGMADE)
73 		return(did);
74 	if((node->flags&MADE) && (node->flags&PRETENDING) && p && outofdate(p, parc, 0)){
75 		if(explain)
76 			fprint(1, "unpretending %s(%ld) because %s is out of date(%ld)\n",
77 				node->name, node->time, p->name, p->time);
78 		unpretend(node);
79 	}
80 	/*
81 		have a look if we are pretending in case
82 		someone has been unpretended out from underneath us
83 	*/
84 	if(node->flags&MADE){
85 		if(node->flags&PRETENDING){
86 			node->time = 0;
87 		}else
88 			return(did);
89 	}
90 	/* consider no prerequsite case */
91 	if(node->prereqs == 0){
92 		if(node->time == 0){
93 			fprint(2, "mk: don't know how to make '%s'\n", node->name);
94 			if(kflag){
95 				node->flags |= BEINGMADE;
96 				runerrs++;
97 			} else
98 				Exit();
99 		} else
100 			MADESET(node, MADE);
101 		return(did);
102 	}
103 	/*
104 		now see if we are out of date or what
105 	*/
106 	ready = 1;
107 	weoutofdate = aflag;
108 	ra = 0;
109 	for(a = node->prereqs; a; a = a->next)
110 		if(a->n){
111 			did = work(a->n, node, a) || did;
112 			if(a->n->flags&(NOTMADE|BEINGMADE))
113 				ready = 0;
114 			if(outofdate(node, a, 0)){
115 				weoutofdate = 1;
116 				if((ra == 0) || (ra->n == 0)
117 						|| (ra->n->time < a->n->time))
118 					ra = a;
119 			}
120 		} else {
121 			if(node->time == 0){
122 				if(ra == 0)
123 					ra = a;
124 				weoutofdate = 1;
125 			}
126 		}
127 	if(ready == 0)	/* can't do anything now */
128 		return(did);
129 	if(weoutofdate == 0){
130 		MADESET(node, MADE);
131 		return(did);
132 	}
133 	/*
134 		can we pretend to be made?
135 	*/
136 	if((iflag == 0) && (node->time == 0) && (node->flags&(PRETENDING|CANPRETEND))
137 			&& p && ra->n && !outofdate(p, ra, 0)){
138 		node->flags &= ~CANPRETEND;
139 		MADESET(node, MADE);
140 		if(explain && ((node->flags&PRETENDING) == 0))
141 			fprint(1, "pretending %s has time %ld\n", node->name, node->time);
142 		node->flags |= PRETENDING;
143 		return(did);
144 	}
145 	/*
146 		node is out of date and we REALLY do have to do something.
147 		quickly rescan for pretenders
148 	*/
149 	for(a = node->prereqs; a; a = a->next)
150 		if(a->n && (a->n->flags&PRETENDING)){
151 			if(explain)
152 				Bprint(&bout, "unpretending %s because of %s because of %s\n",
153 				a->n->name, node->name, ra->n? ra->n->name : "rule with no prerequisites");
154 
155 			unpretend(a->n);
156 			did = work(a->n, node, a) || did;
157 			ready = 0;
158 		}
159 	if(ready == 0)	/* try later unless nothing has happened for -k's sake */
160 		return(did || work(node, p, parc));
161 	did = dorecipe(node) || did;
162 	return(did);
163 }
164 
165 void
166 update(int fake, Node *node)
167 {
168 	Arc *a;
169 
170 	MADESET(node, fake? BEINGMADE : MADE);
171 	if(((node->flags&VIRTUAL) == 0) && (access(node->name, 0) == 0)){
172 		node->time = timeof(node->name, 1);
173 		node->flags &= ~(CANPRETEND|PRETENDING);
174 		for(a = node->prereqs; a; a = a->next)
175 			if(a->prog)
176 				outofdate(node, a, 1);
177 	} else {
178 		node->time = 1;
179 		for(a = node->prereqs; a; a = a->next)
180 			if(a->n && outofdate(node, a, 1))
181 				node->time = a->n->time;
182 	}
183 /*	print("----node %s time=%ld flags=0x%x\n", node->name, node->time, node->flags);*//**/
184 }
185 
186 static int
187 pcmp(char *prog, char *p, char *q)
188 {
189 	char buf[3*NAMEBLOCK];
190 	int pid;
191 
192 	Bflush(&bout);
193 	sprint(buf, "%s '%s' '%s'\n", prog, p, q);
194 	pid = pipecmd(buf, 0, 0);
195 	while(waitup(-3, &pid) >= 0)
196 		;
197 	return(pid? 2:1);
198 }
199 
200 int
201 outofdate(Node *node, Arc *arc, int eval)
202 {
203 	char buf[3*NAMEBLOCK], *str;
204 	Symtab *sym;
205 	int ret;
206 
207 	str = 0;
208 	if(arc->prog){
209 		sprint(buf, "%s%c%s", node->name, 0377, arc->n->name);
210 		sym = symlook(buf, S_OUTOFDATE, 0);
211 		if(sym == 0 || eval){
212 			if(sym == 0)
213 				str = strdup(buf);
214 			ret = pcmp(arc->prog, node->name, arc->n->name);
215 			if(sym)
216 				sym->value = (void *)ret;
217 			else
218 				symlook(str, S_OUTOFDATE, (void *)ret);
219 		} else
220 			ret = (int)sym->value;
221 		return(ret-1);
222 	} else if(strchr(arc->n->name, '(') && arc->n->time == 0)  /* missing archive member */
223 		return 1;
224 	else
225 		return node->time < arc->n->time;
226 }