Lines Matching refs:prev
98 struct queue_entry *prev; /* previous element */
162 elt->prev = que;
163 elt->next->prev = elt;
173 elt->prev = que->prev;
174 elt->prev->next = elt;
175 que->prev = elt;
186 elt->next->prev = que;
199 if (que->prev != que) {
200 elt = que->prev;
201 elt->prev->next = que;
202 que->prev = elt->prev;
213 elt->next->prev = elt->prev;
214 elt->prev->next = elt->next;
223 entry->prev = pred;
224 (pred->next)->prev = entry;
232 (elt->next)->prev = elt->prev;
233 (elt->prev)->next = elt->next;
251 (q)->prev = (q);\
282 #define queue_last(q) ((q)->prev)
292 #define queue_prev(qc) ((qc)->prev)
339 __prev = (head)->prev; \
346 (elt)->field.prev = __prev; \
348 (head)->prev = (queue_entry_t) elt; \
368 (head)->prev = (queue_entry_t) (elt); \
371 ((type)__next)->field.prev = (queue_entry_t)(elt);\
374 (elt)->field.prev = head; \
397 (elt)->field.prev = (head); \
400 __prev = (elt)->field.prev = (head)->prev; \
403 (head)->prev = (queue_entry_t)(elt); \
408 (elt)->field.prev = (head); \
411 __prev = (elt)->field.prev = (cur)->field.prev; \
414 (cur)->field.prev = (queue_entry_t)(elt); \
435 (elt)->field.prev = (head); \
438 (head)->prev = (queue_entry_t)(elt); \
441 ((type)__next)->field.prev = (queue_entry_t)(elt);\
445 (elt)->field.prev = (queue_entry_t)(cur); \
446 if ((head)->prev == (queue_entry_t)(cur)) { \
449 (head)->prev = (queue_entry_t)(elt); \
452 ((type)__next)->field.prev = (queue_entry_t)(elt);\
480 __prev = (elt)->field.prev; \
483 (head)->prev = __prev; \
485 ((type)__next)->field.prev = __prev; \
493 (elt)->field.prev = NULL; \
513 (head)->prev = (head); \
515 ((type)(__next))->field.prev = (head); \
519 (entry)->field.prev = NULL; \
535 (entry) = (type) ((head)->prev); \
536 __prev = (entry)->field.prev; \
542 (head)->prev = __prev; \
545 (entry)->field.prev = NULL; \
553 ((type)((from)->prev))->field.next = (to); \
554 ((type)((from)->next))->field.prev = (to); \
573 ((type)((new)->next))->field.prev = (new); \
574 ((type)((new)->prev))->field.next = (new); \