Lines Matching refs:ap

224 	struct arrowlist *ap;
230 for (ap = itree_next_arrow(bp, NULL); ap;
231 ap = itree_next_arrow(bp, ap)) {
232 ap->arrowp->pnode->u.arrow.needed = 1;
233 ipath_dummy_lut(ap->arrowp);
243 struct arrowlist *ap;
249 for (ap = itree_next_arrow(bp, NULL); ap;
250 ap = itree_next_arrow(bp, ap))
251 ap->arrowp->pnode->u.arrow.needed = 0;
1609 struct arrowlist *ap;
1618 for (ap = itree_next_arrow(bp, NULL); ap;
1619 ap = itree_next_arrow(bp, ap))
1620 ap->arrowp->mark = 0;
3584 struct arrowlist *ap;
3592 for (ap = itree_next_arrow(bp, NULL); ap;
3593 ap = itree_next_arrow(bp, ap)) {
3595 if ((ap->arrowp->mark & mark) &&
3608 struct arrowlist *ap;
3619 for (ap = itree_next_arrow(bp, NULL); ap;
3620 ap = itree_next_arrow(bp, ap)) {
3621 struct event *ep2 = ap->arrowp->head->myevent;
3627 if (ap->arrowp->arrow_marked == 0)
3629 ap->arrowp->arrow_marked = 0;
3630 ap->arrowp->mark &= ~EFFECTS_COUNTER;
3640 ap->arrowp->arrow_marked = 1;
3675 if (checkconstraints(fmep, ap->arrowp) == 0) {
3685 ap->arrowp->mark |= EFFECTS_COUNTER;
3700 ap->arrowp->maxdelay == 0ULL) {
3708 at_latest_by + ap->arrowp->maxdelay,
3833 struct arrowlist *ap;
3927 for (ap = itree_next_arrow(bp, NULL); ap;
3928 ap = itree_next_arrow(bp, ap))
3940 for (ap = itree_next_arrow(bp, NULL); ap;
3941 ap = itree_next_arrow(bp, ap)) {
3942 ep2 = ap->arrowp->head->myevent;
3944 (void) checkconstraints(fmep, ap->arrowp);
3945 if (!ap->arrowp->forever_false) {
3959 for (ap = itree_next_arrow(bp, NULL); ap;
3960 ap = itree_next_arrow(bp, ap)) {
3961 ep2 = ap->arrowp->head->myevent;
3965 ap->arrowp->mark |= REQMNTS_COUNTER;
3969 at_latest_by + ap->arrowp->maxdelay,
4052 struct arrowlist *ap;
4067 for (ap = itree_next_arrow(bp, NULL); ap;
4068 ap = itree_next_arrow(bp, ap)) {
4075 if (ap->arrowp->tail->myevent->cached_state &
4081 ap->arrowp->tail->myevent);
4091 if (checkconstraints(fmep, ap->arrowp) == 0)
4099 ap->arrowp->tail->myevent);
4104 ap->arrowp->tail->myevent->cached_state |=
4106 tail_event = ap->arrowp->tail->myevent;