Lines Matching defs:prereqs

2080 	List_t*			prereqs;
2094 if (internal.assert_p->prereqs && (opr = associate(internal.assert_p, NiL, lhs, NiL)) && opr->prereqs && (opr = opr->prereqs->rule) && (opr->property & P_operator) && !opr->uname)
2405 prereqs = p;
2431 jointail = joint->prereqs = cons(r, NiL);
2476 for (p = prereqs, prereqs = q = 0; p; q = p, p = p->next)
2488 else if (!prereqs)
2489 prereqs = p;
2491 c = ((set.op & A_clear) && !prereqs && !*act) ? PREREQ_DELETE : PREREQ_APPEND;
2530 if (!internal.main->prereqs && !state.global && !(set.rule.property & P_operator) && !(set.op & A_special) && !special(r) && !special(&set.rule))
2532 internal.main->prereqs = cons(r, NiL);
2576 if ((r->property & P_metarule) && (prereqs || *act || (set.op & A_null)))
2579 if (!(x = (r->property & P_state) ? rulestate(r, 0) : staterule(RULE, r, NiL, 0)) || r->prereqs != x->prereqs)
2580 freelist(r->prereqs);
2583 if (!prereqs || prereqs->next)
2588 x = prereqs->rule;
2592 r->prereqs = listcopy(x->prereqs);
2607 for (p = prereqs; p; p = p->next)
2615 if (prereqs)
2617 p = name ? listcopy(prereqs) : prereqs;
2619 r->prereqs->next = append(p, r->prereqs->next);
2625 q = r->prereqs;
2626 r->prereqs = p;
2628 p = r->prereqs;
2629 r->prereqs = q;
2631 r->prereqs = (set.op & A_insert) ? append(p, r->prereqs) : append(r->prereqs, p);
2633 remdup(r->prereqs);
2741 r->prereqs = cons(joint, r->prereqs);
2779 if (internal.assign_p->prereqs && (r = associate(internal.assign_p, NiL, lhs, NiL)) && r->prereqs && (r = r->prereqs->rule) && (r->property & P_operator) && !r->uname)