le_next 263 libdb/queue.h struct type *le_next; /* next element */ \ le_next 276 libdb/queue.h for((var) = (head)->lh_first; (var); (var) = (var)->field.le_next) le_next 283 libdb/queue.h if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \ le_next 284 libdb/queue.h (listelm)->field.le_next->field.le_prev = \ le_next 285 libdb/queue.h &(elm)->field.le_next; \ le_next 286 libdb/queue.h (listelm)->field.le_next = (elm); \ le_next 287 libdb/queue.h (elm)->field.le_prev = &(listelm)->field.le_next; \ le_next 292 libdb/queue.h (elm)->field.le_next = (listelm); \ le_next 294 libdb/queue.h (listelm)->field.le_prev = &(elm)->field.le_next; \ le_next 298 libdb/queue.h if (((elm)->field.le_next = (head)->lh_first) != NULL) \ le_next 299 libdb/queue.h (head)->lh_first->field.le_prev = &(elm)->field.le_next;\ le_next 304 libdb/queue.h #define LIST_NEXT(elm, field) ((elm)->field.le_next) le_next 307 libdb/queue.h if ((elm)->field.le_next != NULL) \ le_next 308 libdb/queue.h (elm)->field.le_next->field.le_prev = \ le_next 310 libdb/queue.h *(elm)->field.le_prev = (elm)->field.le_next; \