HomeSort by relevance Sort by last modified time
    Searched defs:list_next (Results 1 - 8 of 8) sorted by null

  /onnv/onnv-gate/usr/src/lib/libproc/common/
Putil.h 50 #define list_next(elem) (void *)(((plist_t *)(elem))->list_forw) macro
  /onnv/onnv-gate/usr/src/uts/common/sys/
list_impl.h 39 struct list_node *list_next; member in struct:list_node
  /onnv/onnv-gate/usr/src/common/mms/mms/
mms_list.h 42 struct mms_list_node *list_next; member in struct:mms_list_node
56 ((mms_list_t *)((ptrdiff_t)((list)->list_head.list_next->list_prev) - \
63 #define mms_list_empty(a) ((a)->list_head.list_next == &(a)->list_head)
  /onnv/onnv-gate/usr/src/lib/smbsrv/libsmb/common/
smb_list.c 41 #define list_empty(a) ((a)->list_head.list_next == &(a)->list_head)
46 lnew->list_next = node->list_next; \
47 node->list_next->list_prev = lnew; \
48 node->list_next = lnew; \
53 lnew->list_next = node; \
55 node->list_prev->list_next = lnew; \
68 list->list_head.list_next = list->list_head.list_prev =
78 assert(list->list_head.list_next == node);
81 node->list_next = node->list_prev = NULL
140 list_next(list_t *list, void *object) function
    [all...]
  /onnv/onnv-gate/usr/src/uts/common/os/
list.c 40 #define list_empty(a) ((a)->list_head.list_next == &(a)->list_head)
45 lnew->list_next = (node)->list_next; \
46 (node)->list_next->list_prev = lnew; \
47 (node)->list_next = lnew; \
52 lnew->list_next = (node); \
54 (node)->list_prev->list_next = lnew; \
59 (node)->list_prev->list_next = (node)->list_next; \
60 (node)->list_next->list_prev = (node)->list_prev;
170 list_next(list_t *list, void *object) function
    [all...]
  /onnv/onnv-gate/usr/src/cmd/filebench/common/
parsertypes.h 50 struct list *list_next; member in struct:list
  /onnv/onnv-gate/usr/src/uts/common/sys/usb/usba/
usba_ugend.h 61 struct ugen_devt_list_entry *list_next; member in struct:ugen_devt_list_entry
  /onnv/onnv-gate/usr/src/uts/intel/io/heci/
heci_data_structures.h 161 #define list_next(p) ((p)->list_next) macro
164 for (p = list_next(h), n = list_next(p); \
166 p = n, n = list_next(p))
170 (ptr)->list_next = (ptr); (ptr)->list_prev = (ptr); \
179 #define list_empty(l) ((l)->list_next == (l))
180 #define list_del(p) { (p)->list_next->list_prev = (p)->list_prev; \
181 (p)->list_prev->list_next = (p)->list_next; }
    [all...]

Completed in 900 milliseconds