15 	Node *node;  in graph()  local
19 	node = applyrules(target, cnt);  in graph()
21 	cyclechk(node);  in graph()
22 	node->flags |= PROBABLE;	/* make sure it doesn't get deleted */  in graph()
23 	vacuous(node);  in graph()
24 	ambiguous(node);  in graph()
25 	attribute(node);  in graph()
26 	return(node);  in graph()
33 	Node *node;  in applyrules()  local
45 	node = newnode(target);  in applyrules()
56 		node->flags |= PROBABLE;  in applyrules()
74 		head.n = node;  in applyrules()
84 			if(regexec(r->pat, node->name, rmatch, NREGEXP) == 0)  in applyrules()
87 			if(!match(node->name, r->target, stem)) continue;  in applyrules()
113 	a->next = node->prereqs;  in applyrules()
114 	node->prereqs = head.next;  in applyrules()
115 	return(node);  in applyrules()
119 togo(Node *node)  in togo()  argument
125 	for(a = node->prereqs; a; la = a, a = a->next)  in togo()
127 			if(a == node->prereqs)  in togo()
128 				node->prereqs = a->next;  in togo()
135 vacuous(Node *node)  in vacuous()  argument
138 	int vac = !(node->flags&PROBABLE);  in vacuous()
140 	if(node->flags&READY)  in vacuous()
141 		return(node->flags&VACUOUS);  in vacuous()
142 	node->flags |= READY;  in vacuous()
143 	for(a = node->prereqs; a; a = a->next)  in vacuous()
149 	for(a = node->prereqs; a; a = a->next)  in vacuous()
151 			for(la = node->prereqs; la; la = la->next)  in vacuous()
155 	togo(node);  in vacuous()
157 		node->flags |= VACUOUS;  in vacuous()
164 	register Node *node;  in newnode()  local
166 	node = (Node *)Malloc(sizeof(Node));  in newnode()
167 	symlook(name, S_NODE, (void *)node);  in newnode()
168 	node->name = name;  in newnode()
169 	node->time = timeof(name, 0);  in newnode()
170 	node->prereqs = 0;  in newnode()
171 	node->flags = node->time? PROBABLE : 0;  in newnode()
172 	node->next = 0;  in newnode()
173 	return(node);  in newnode()