Searched refs:list_entry (Results 1 - 25 of 75) sorted by path

123

/freebsd-11-stable/contrib/atf/atf-c/detail/
H A Dlist.c39 struct list_entry { struct
40 struct list_entry *m_prev;
41 struct list_entry *m_next;
48 entry_to_citer(const atf_list_t *l, const struct list_entry *le)
58 entry_to_iter(atf_list_t *l, struct list_entry *le)
67 struct list_entry *
70 struct list_entry *le;
72 le = (struct list_entry *)malloc(sizeof(*le));
85 delete_entry(struct list_entry *le)
94 struct list_entry *
[all...]
/freebsd-11-stable/contrib/gcc/
H A Dgcse.c1381 rtx list_entry = modify_mem_list[bb->index];
1387 while (list_entry)
1392 && INSN_CUID (XEXP (list_entry, 0)) < uid_limit)
1394 && INSN_CUID (XEXP (list_entry, 0)) > uid_limit))
1396 list_entry = XEXP (list_entry, 1);
1400 setter = XEXP (list_entry, 0);
1418 list_entry = XEXP (list_entry, 1);
2506 rtx list_entry
1372 rtx list_entry = modify_mem_list[bb->index]; local
2495 rtx list_entry = canon_modify_mem_list[bb_index]; local
[all...]
H A Dpostreload-gcse.c617 struct modifies_mem *list_entry = modifies_mem_list;
619 while (list_entry)
621 rtx setter = list_entry->insn;
629 list_entry = list_entry->next;
648 list_entry = list_entry->next;
671 struct modifies_mem *list_entry;
673 list_entry = (struct modifies_mem *) obstack_alloc (&modifies_mem_obstack,
675 list_entry
607 struct modifies_mem *list_entry = modifies_mem_list; local
660 struct modifies_mem *list_entry; local
[all...]
/freebsd-11-stable/sys/compat/ndis/
H A Dkern_ndis.c473 list_entry *l;
H A Dntoskrnl_var.h215 struct list_entry { struct
216 struct list_entry *nle_flink;
217 struct list_entry *nle_blink;
220 typedef struct list_entry list_entry; typedef in typeref:struct:list_entry
230 list_entry *b; \
231 list_entry *f; \
241 static __inline__ list_entry *
242 RemoveHeadList(list_entry *l)
244 list_entry *
[all...]
H A Dsubr_ndis.c248 static list_entry *NdisInterlockedInsertHeadList(list_entry *,
249 list_entry *, ndis_spin_lock *);
250 static list_entry *NdisInterlockedRemoveHeadList(list_entry *,
252 static list_entry *NdisInterlockedInsertTailList(list_entry *,
253 list_entry *, ndis_spin_lock *);
774 list_entry *e;
1572 list_entry *
[all...]
H A Dsubr_ntoskrnl.c89 list_entry kq_disp;
118 list_entry ce_list;
123 static struct list_entry ntoskrnl_calllist;
127 static struct list_entry ntoskrnl_intlist;
167 static uint8_t ntoskrnl_insert_dpc(list_entry *, kdpc *);
397 list_entry *l;
720 list_entry *e;
1257 list_entry *l;
1495 list_entry *e;
2736 list_entry *
[all...]
H A Dsubr_usbd.c1103 list_entry *l;
1204 list_entry *l;
/freebsd-11-stable/sys/contrib/vchiq/interface/compat/
H A Dlist.h201 #define list_entry(PTR, TYPE, FIELD) container_of(PTR, TYPE, FIELD) macro
203 list_entry(list_first((PTR)), TYPE, FIELD)
205 list_entry(list_last((PTR)), TYPE, FIELD)
207 list_entry(list_next(&(ENTRY)->FIELD), typeof(*(ENTRY)), FIELD)
209 list_entry(list_prev(&(ENTRY)->FIELD), typeof(*(ENTRY)), FIELD)
222 for ((VAR) = list_entry(list_first((HEAD)), typeof(*(VAR)), FIELD); \
224 (VAR) = list_entry(list_next(&(VAR)->FIELD), typeof(*(VAR)), \
228 for ((VAR) = list_entry(list_last((HEAD)), typeof(*(VAR)), FIELD); \
230 (VAR) = list_entry(list_prev(&(VAR)->FIELD), typeof(*(VAR)), \
234 for ((VAR) = list_entry(list_firs
[all...]
/freebsd-11-stable/sys/contrib/vchiq/interface/vchiq_arm/
H A Dvchiq_arm.c730 if (list_entry(pos, struct bulk_waiter_node,
732 waiter = list_entry(pos,
1341 waiter = list_entry(pos,
H A Dvchiq_kern_lib.c149 waiter = list_entry(pos,
399 if (list_entry(pos, struct bulk_waiter_node,
401 waiter = list_entry(pos,
/freebsd-11-stable/sys/dev/bxe/
H A Decore_sp.c1358 list_entry((pos)->member.next, typeof(*(pos)), member)
/freebsd-11-stable/sys/dev/cxgbe/iw_cxgbe/
H A Dresource.c112 entry = list_entry(uctx->cqids.next, struct c4iw_qid_list,
182 entry = list_entry(uctx->qpids.next, struct c4iw_qid_list,
/freebsd-11-stable/sys/dev/drm/
H A Ddrm_linux_list.h42 #define list_entry(ptr, type, member) container_of(ptr,type,member) macro
105 for (pos = list_entry((head)->next, __typeof(*pos), member), \
106 n = list_entry(pos->member.next, __typeof(*pos), member); \
108 pos = n, n = list_entry(n->member.next, __typeof(*n), member))
H A Ddrm_mm.c58 entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
71 entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
97 list_entry(mm->unused_nodes.next,
156 entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
241 list_entry(cur_head->prev, struct drm_mm_node, ml_entry);
249 list_entry(cur_head->next, struct drm_mm_node, ml_entry);
296 entry = list_entry(list, struct drm_mm_node, fl_entry);
346 entry = list_entry(bnode, struct drm_mm_node, fl_entry);
H A Dmach64_dma.c521 list_entry(ptr, drm_mach64_freelist_t, list);
1228 entry = list_entry(ptr, drm_mach64_freelist_t, list);
1464 entry = list_entry(ptr, drm_mach64_freelist_t, list);
1469 entry = list_entry(ptr, drm_mach64_freelist_t, list);
1475 entry = list_entry(ptr, drm_mach64_freelist_t, list);
1496 entry = list_entry(ptr, drm_mach64_freelist_t, list);
1544 entry = list_entry(ptr, drm_mach64_freelist_t, list);
1623 entry = list_entry(ptr, drm_mach64_freelist_t, list);
1636 entry = list_entry(ptr, drm_mach64_freelist_t, list);
1644 entry = list_entry(pt
[all...]
H A Dmach64_drv.h730 *entry = list_entry(ptr, drm_mach64_freelist_t, list);
736 *entry = list_entry(ptr, drm_mach64_freelist_t, list);
811 _entry = list_entry(ptr, drm_mach64_freelist_t, list); \
854 _entry = list_entry(ptr, drm_mach64_freelist_t, list); \
H A Dmga_dma.c287 buf_priv->list_entry = entry;
327 SET_AGE(&buf_priv->list_entry->age, MGA_BUFFER_FREE, 0);
372 buf_priv->list_entry->age.head -
373 dev_priv->primary->offset, buf_priv->list_entry->age.wrap);
375 entry = buf_priv->list_entry;
378 if (buf_priv->list_entry->age.head == MGA_BUFFER_USED) {
H A Dmga_drv.h75 drm_mga_freelist_t *list_entry; member in struct:__anon9792
375 drm_mga_freelist_t *entry = (buf_priv)->list_entry; \
H A Dr128_cce.c795 buf_priv->list_entry = entry;
H A Dr128_drv.h134 drm_r128_freelist_t *list_entry; member in struct:drm_r128_buf_priv
/freebsd-11-stable/sys/dev/drm2/
H A Ddrm_ioctl.c167 r_list = list_entry(list, struct drm_map_list, head);
H A Ddrm_linux_list.h42 #define list_entry(ptr, type, member) container_of(ptr,type,member) macro
124 for (pos = list_entry((head)->next, __typeof(*pos), member); \
126 pos = list_entry(pos->member.next, __typeof(*pos), member))
129 for (pos = list_entry(pos->member.prev, __typeof(*pos), member); \
131 pos = list_entry(pos->member.prev, __typeof(*pos), member))
141 for (pos = list_entry((head)->next, __typeof(*pos), member), \
142 n = list_entry(pos->member.next, __typeof(*pos), member); \
144 pos = n, n = list_entry(n->member.next, __typeof(*n), member))
147 for (n = list_entry(pos->member.next, __typeof(*pos), member); \
149 pos = n, n = list_entry(
[all...]
H A Ddrm_mm.c64 list_entry(mm->unused_nodes.next,
110 list_entry(hole_node->node_list.next, struct drm_mm_node,
324 list_entry(node->node_list.prev, struct drm_mm_node, node_list);
561 prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
620 prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
H A Ddrm_mm.h97 next = entry ? list_entry(entry->node_list.next, \
100 next = entry ? list_entry(entry->node_list.next, \

Completed in 300 milliseconds

123