Lines Matching full:pending

37 	/* Grab CPPR of the most favored pending interrupt */  in GLUE()
40 xc->pending |= 1 << cppr; in GLUE()
81 * pending. in GLUE()
111 u8 pending, int scan_type) in GLUE()
116 /* Find highest pending priority */ in GLUE()
117 while ((xc->mfrr != 0xff || pending != 0) && hirq == 0) { in GLUE()
123 * If pending is 0 this will return 0xff which is what in GLUE()
126 prio = ffs(pending) - 1; in GLUE()
167 * This is safe because if we have another pending MFRR in GLUE()
190 /* Clear the pending bit if the queue is now empty */ in GLUE()
192 pending &= ~(1 << prio); in GLUE()
210 * If the most favoured prio we found pending is less in GLUE()
211 * favored (or equal) than a pending IPI, we return in GLUE()
231 /* Update the pending bits */ in GLUE()
232 xc->pending = pending; in GLUE()
236 * all we needed was cleanup the stale pending bits and check in GLUE()
249 * for pending IPIs. in GLUE()
277 /* First collect pending bits from HW */ in GLUE()
280 pr_devel(" new pending=0x%02x hw_cppr=%d cppr=%d\n", in GLUE()
281 xc->pending, xc->hw_cppr, xc->cppr); in GLUE()
287 hirq = GLUE(X_PFX,scan_interrupts)(xc, xc->pending, scan_fetch); in GLUE()
321 u8 pending = xc->pending; in GLUE() local
336 pending = 0xff; in GLUE()
338 /* Grab pending interrupt if any */ in GLUE()
342 pending |= 1 << pipr; in GLUE()
345 hirq = GLUE(X_PFX,scan_interrupts)(xc, pending, scan_poll); in GLUE()
355 u8 pending, prio; in GLUE() local
357 pending = xc->pending; in GLUE()
360 pending |= 1 << xc->mfrr; in GLUE()
362 pending |= 0x80; in GLUE()
364 if (!pending) in GLUE()
366 prio = ffs(pending) - 1; in GLUE()
462 * We are masking less, we need to look for pending things in GLUE()
463 * to deliver and set VP pending bits accordingly to trigger in GLUE()
589 /* Re-evaluate pending IRQs and update HW */ in GLUE()
590 GLUE(X_PFX,scan_interrupts)(xc, xc->pending, scan_eoi); in GLUE()
592 pr_devel(" after scan pending=%02x\n", xc->pending); in GLUE()