113 	a->next = node->prereqs;  in applyrules()
114 	node->prereqs = head.next;  in applyrules()
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()
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()
170 	node->prereqs = 0;  in newnode()
184 	for(a = n->prereqs; a; a = a->next){  in dumpn()
198 			for(a = a->n->prereqs; a; a = a->next)  in trace()
211 	if((n->flags&CYCLE) && n->prereqs){  in cyclechk()
216 	for(a = n->prereqs; a; a = a->next)  in cyclechk()
231 	for(a = n->prereqs; a; a = a->next){  in ambiguous()
267 	for(a = n->prereqs; a; a = a->next){  in attribute()