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

  /src/external/cddl/osnet/dist/uts/common/sys/
list_impl.h 46 struct list_node list_head; member in struct:list
  /src/sys/external/bsd/drm/dist/bsd-core/
drm_linux_list.h 35 struct list_head { struct
36 struct list_head *next, *prev;
43 INIT_LIST_HEAD(struct list_head *head) {
49 list_empty(struct list_head *head) {
54 list_add(struct list_head *new, struct list_head *head) {
62 list_add_tail(struct list_head *entry, struct list_head *head) {
70 list_del(struct list_head *entry) {
76 list_del_init(struct list_head *entry)
    [all...]
  /src/sbin/efi/
getvars.c 57 efi_var_head_t *list_head; member in struct:fn_args
101 efi_var_head_t *head = args->list_head;
138 static efi_var_head_t list_head; local
145 assert(SLIST_EMPTY(&list_head));
147 SLIST_INIT(&list_head);
150 args.list_head = &list_head;
160 SLIST_FOREACH(elm, &list_head, entry) {
168 return &list_head;
191 efi_var_head_t *list_head = vp local
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvif/
list.h 48 * data type 'struct list_head').
52 * struct list_head list_of_foos;
58 * struct list_head entry;
104 * to-be-linked struct. struct list_head is required for both the head of the
107 * Position and name of the struct list_head field is irrelevant.
109 * There are no requirements for a list head, any struct list_head can be a list
112 struct list_head { struct
113 struct list_head *next, *prev;
126 #define LIST_HEAD(name) \
127 struct list_head name = LIST_HEAD_INIT(name
    [all...]
  /src/external/cddl/osnet/dist/uts/common/os/
list.c 44 #define list_empty(a) ((a)->list_head.list_next == &(a)->list_head)
76 list->list_head.list_next = list->list_head.list_prev =
77 &list->list_head;
83 list_node_t *node = &list->list_head;
86 ASSERT(list->list_head.list_next == node);
87 ASSERT(list->list_head.list_prev == node);
117 list_node_t *lold = &list->list_head;
124 list_node_t *lold = &list->list_head;
158 list_head(list_t *list) function
    [all...]
  /src/sys/external/bsd/common/include/linux/
types.h 100 struct list_head { struct
101 struct list_head *prev;
102 struct list_head *next;
  /src/sys/external/bsd/drm2/dist/drm/radeon/
mkregtable.c 47 struct list_head { struct
48 struct list_head *next, *prev;
52 static inline void INIT_LIST_HEAD(struct list_head *list)
65 static inline void __list_add(struct list_head *new,
66 struct list_head *prev, struct list_head *next)
74 extern void __list_add(struct list_head *new,
75 struct list_head *prev, struct list_head *next);
86 static inline void list_add_tail(struct list_head *new, struct list_head *head
    [all...]
  /src/external/gpl3/binutils/dist/binutils/
coffgrok.h 170 struct coff_scope * list_head; /* Children. */ member in struct:coff_scope
  /src/external/gpl3/binutils.old/dist/binutils/
coffgrok.h 170 struct coff_scope * list_head; /* Children. */ member in struct:coff_scope
  /src/external/gpl3/gcc/dist/gcc/
genrecog.cc 818 to "T *prev, *next;" and a function "void set_parent (list_head <T> *)" class
821 class list_head
832 void set_parent (list_head *);
835 list_head ();
848 list_head <T>::range::range (T *start_in) : start (start_in), end (start_in) {}
853 list_head <T>::range::range (T *start_in, T *end_in)
858 list_head <T>::range::set_parent (list_head <T> *owner)
866 list_head <T>::list_head () : first (0), last (0) {
863 list_head <T>::list_head () : first (0), last (0) {} function in class:list_head
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
genrecog.cc 818 to "T *prev, *next;" and a function "void set_parent (list_head <T> *)" class
821 class list_head
832 void set_parent (list_head *);
835 list_head ();
848 list_head <T>::range::range (T *start_in) : start (start_in), end (start_in) {}
853 list_head <T>::range::range (T *start_in, T *end_in)
858 list_head <T>::range::set_parent (list_head <T> *owner)
866 list_head <T>::list_head () : first (0), last (0) {
863 list_head <T>::list_head () : first (0), last (0) {} function in class:list_head
    [all...]

Completed in 29 milliseconds