Searched refs:le_prev (Results 1 – 7 of 7) sorted by relevance
88 struct type **le_prev; /* address of previous next element */ \104 (listelm)->field.le_next->field.le_prev = \107 (elm)->field.le_prev = &(listelm)->field.le_next; \111 (elm)->field.le_prev = (listelm)->field.le_prev; \113 *(listelm)->field.le_prev = (elm); \114 (listelm)->field.le_prev = &(elm)->field.le_next; \119 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\121 (elm)->field.le_prev = &(head)->lh_first; \126 (elm)->field.le_next->field.le_prev = \127 (elm)->field.le_prev; \[all …]
93 struct type **le_prev; /* address of previous next element */ \105 (listelm)->field.le_next->field.le_prev = \108 (elm)->field.le_prev = &(listelm)->field.le_next; \113 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\115 (elm)->field.le_prev = &(head)->lh_first; \120 (elm)->field.le_next->field.le_prev = \121 (elm)->field.le_prev; \122 *(elm)->field.le_prev = (elm)->field.le_next; \
323 struct type **le_prev; /* address of previous next element */ \333 LIST_FIRST((head))->field.le_prev != \340 LIST_NEXT((elm), field)->field.le_prev != \346 if (*(elm)->field.le_prev != (elm)) \376 LIST_NEXT((listelm), field)->field.le_prev = \379 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \384 (elm)->field.le_prev = (listelm)->field.le_prev; \386 *(listelm)->field.le_prev = (elm); \387 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \393 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\[all …]
254 struct type **le_prev; /* address of previous next element */ \279 (listelm)->field.le_next->field.le_prev = \282 (elm)->field.le_prev = &(listelm)->field.le_next; \286 (elm)->field.le_prev = (listelm)->field.le_prev; \288 *(listelm)->field.le_prev = (elm); \289 (listelm)->field.le_prev = &(elm)->field.le_next; \294 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\296 (elm)->field.le_prev = &(head)->lh_first; \301 (elm)->field.le_next->field.le_prev = \302 (elm)->field.le_prev; \[all …]
107 struct type **le_prev; /* address of previous next element */ \116 (head)->lh_first->field.le_prev != &(head)->lh_first) \120 (elm)->field.le_next->field.le_prev != \123 if (*(elm)->field.le_prev != (elm)) \127 (elm)->field.le_prev = (void *)1L;142 (listelm)->field.le_next->field.le_prev = \145 (elm)->field.le_prev = &(listelm)->field.le_next; \151 (elm)->field.le_prev = (listelm)->field.le_prev; \153 *(listelm)->field.le_prev = (elm); \154 (listelm)->field.le_prev = &(elm)->field.le_next; \[all …]
122 struct ldi_event *le_prev; member
481 lhp->lh_events->le_prev = lep; in handle_event_add()494 if (lep->le_prev) in handle_event_remove()495 lep->le_prev->le_next = lep->le_next; in handle_event_remove()497 lep->le_next->le_prev = lep->le_prev; in handle_event_remove()