HomeSort by: relevance | last modified time | path
    Searched defs:list_next (Results 1 - 5 of 5) sorted by relevancy

  /src/external/cddl/osnet/dist/uts/common/sys/
list_impl.h 39 struct list_node *list_next; member in struct:list_node
  /src/external/cddl/osnet/dist/uts/common/os/
list.c 44 #define list_empty(a) ((a)->list_head.list_next == &(a)->list_head)
49 lnew->list_next = (node)->list_next; \
50 (node)->list_next->list_prev = lnew; \
51 (node)->list_next = lnew; \
56 lnew->list_next = (node); \
58 (node)->list_prev->list_next = lnew; \
63 (node)->list_prev->list_next = (node)->list_next; \
64 (node)->list_next->list_prev = (node)->list_prev;
174 list_next(list_t *list, void *object) function
    [all...]
  /src/usr.bin/fstat/
zfs_znode.h 60 struct list_node *list_next; member in struct:list_node
  /src/sys/external/bsd/common/include/linux/
list.h 80 list_next(const struct list_head *node) function
279 list_entry(list_next(&(ENTRY)->FIELD), typeof(*(ENTRY)), FIELD)
286 (VAR) = list_next((VAR)))
295 ((VAR) != (HEAD)) && ((NEXT) = list_next((VAR)), 1); \
304 (VAR) = list_entry(list_next(&(VAR)->FIELD), typeof(*(VAR)), \
310 ((NEXT) = list_entry(list_next(&(VAR)->FIELD), \
  /src/sys/dev/raidframe/
rf_dag.h 122 RF_DagNode_t *list_next; /* next in the list of DAG nodes for this DAG */ member in struct:RF_DagNode_s

Completed in 26 milliseconds