Lines Matching full:priority
41 uint8_t priority_add; /* highest irq priority */
101 /* return the highest priority found in mask (highest = smallest
105 int priority;
108 priority = 0;
109 while ((mask & (1 << ((priority + s->priority_add) & 7))) == 0)
110 priority++;
111 return priority;
117 int mask, cur_priority, priority;
120 priority = get_priority(s, mask);
121 if (priority == 8)
123 /* compute current priority. If special fully nested mode on the
125 for the priority computation. */
132 if (priority < cur_priority) {
133 /* higher priority found: an irq should be generated */
134 return (priority + s->priority_add) & 7;
289 int priority, cmd, irq;
322 priority = get_priority(s, s->isr);
323 if (priority != 8) {
324 irq = (priority + s->priority_add) & 7;
