| /src/external/gpl2/lvm2/dist/lib/datastruct/ |
| list.c | 22 * The list head's next and previous pointers point back to itself.
24 void dm_list_init(struct dm_list *head)
26 head->n = head->p = head;
30 * Insert an element before 'head'.
31 * If 'head' is the list head, this adds an element to the end of the list.
33 void dm_list_add(struct dm_list *head, struct dm_list *elem)
35 assert(head->n)
[all...] |
| list.h | 24 * A list consists of a list head plus elements.
26 * The list head's pointers point to the first and the last element.
35 * The list head's next and previous pointers point back to itself.
38 void dm_list_init(struct dm_list *head);
41 * Insert an element before 'head'.
42 * If 'head' is the list head, this adds an element to the end of the list.
44 void dm_list_add(struct dm_list *head, struct dm_list *elem);
47 * Insert an element after 'head'.
48 * If 'head' is the list head, this adds an element to the front of the list
[all...] |
| /src/external/gpl2/lvm2/dist/libdm/datastruct/ |
| list.c | 23 * The list head's next and previous pointers point back to itself.
25 void dm_list_init(struct dm_list *head)
27 head->n = head->p = head;
31 * Insert an element before 'head'.
32 * If 'head' is the list head, this adds an element to the end of the list.
34 void dm_list_add(struct dm_list *head, struct dm_list *elem)
36 assert(head->n)
[all...] |
| list.h | 24 * A list consists of a list head plus elements.
26 * The list head's pointers point to the first and the last element.
35 * The list head's next and previous pointers point back to itself.
38 void dm_list_init(struct dm_list *head);
41 * Insert an element before 'head'.
42 * If 'head' is the list head, this adds an element to the end of the list.
44 void dm_list_add(struct dm_list *head, struct dm_list *elem);
47 * Insert an element after 'head'.
48 * If 'head' is the list head, this adds an element to the front of the list
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/include/urcu/static/ |
| rculfstack.h | 30 s->head = NULL;
35 * take the RCU read-side lock. Even if "head" changes between two
39 * the head of the stack, ensuring consistency by making sure the new
40 * node->next is the same pointer value as the value replaced as head.
46 * retry if the old head was non-NULL (the value read by the first
47 * uatomic_cmpxchg() is used as old head for the following loop). The
51 * required if we first read the old head value). This design decision
62 struct cds_lfs_node_rcu *head = NULL; local
65 struct cds_lfs_node_rcu *old_head = head;
67 node->next = head;
93 struct cds_lfs_node_rcu *head; local
[all...] |
| lfstack.h | 29 * on the stack head returned by pop_all.
63 s->head = NULL;
86 s->head = NULL;
90 bool ___cds_lfs_empty_head(const struct cds_lfs_head *head)
92 return head == NULL;
103 return ___cds_lfs_empty_head(uatomic_load(&s._s->head, CMM_RELAXED));
114 * take the RCU read-side lock. Even if "head" changes between two
118 * the head of the stack, ensuring consistency by making sure the new
119 * node->next is the same pointer value as the value replaced as head.
125 * retry if the old head was non-NULL (the value read by the firs
142 struct cds_lfs_head *head = NULL; local
195 struct cds_lfs_head *head, *next_head; local
242 struct cds_lfs_head *head; local
[all...] |
| /src/libexec/httpd/ |
| netbsd_queue.h | 55 #define SIMPLEQ_INIT(head) do { \
56 (head)->sqh_first = NULL; \
57 (head)->sqh_last = &(head)->sqh_first; \
60 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \
62 *(head)->sqh_last = (elm); \
63 (head)->sqh_last = &(elm)->field.sqe_next; \
66 #define SIMPLEQ_FOREACH(var, head, field) \
67 for ((var) = ((head)->sqh_first); \
71 #define SIMPLEQ_FOREACH_SAFE(var, head, field, next)
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/src/ |
| wfcqueue.c | 23 void cds_wfcq_init(struct cds_wfcq_head *head,
26 _cds_wfcq_init(head, tail);
29 void cds_wfcq_destroy(struct cds_wfcq_head *head,
32 _cds_wfcq_destroy(head, tail);
35 void __cds_wfcq_init(struct __cds_wfcq_head *head,
38 ___cds_wfcq_init(head, tail);
41 bool cds_wfcq_empty(cds_wfcq_head_const_ptr_t head,
45 return _cds_wfcq_empty(head, tail);
48 bool cds_wfcq_enqueue(cds_wfcq_head_ptr_t head,
52 return _cds_wfcq_enqueue(head, tail, node)
[all...] |
| /src/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/ |
| mechqueue.h | 47 #define HEIM_SLIST_HEAD_INITIALIZER(head) \
58 #define HEIM_SLIST_INIT(head) do { \
59 (head)->slh_first = NULL; \
67 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \
68 (elm)->field.sle_next = (head)->slh_first; \
69 (head)->slh_first = (elm); \
72 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \
73 (head)->slh_first = (head)->slh_first->field.sle_next; \
76 #define HEIM_SLIST_REMOVE(head, elm, type, field) do {
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/nouveau/dispnv50/ |
| nouveau_dispnv50_curs907a.c | 30 curs907a_new(struct nouveau_drm *drm, int head, s32 oclass,
33 return curs507a_new_(&curs507a, drm, head, oclass,
34 0x00000001 << (head * 4), pwndw);
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/engine/disp/ |
| nouveau_nvkm_engine_disp_head.c | 29 #include "head.h"
39 struct nvkm_head *head; local
40 list_for_each_entry(head, &disp->head, head) {
41 if (head->id == id)
42 return head;
49 struct nvkm_head *head, void *data, u32 size)
56 nvif_ioctl(object, "head scanoutpos size %d\n", size);
58 nvif_ioctl(object, "head scanoutpos vers %d\n"
88 struct nvkm_head *head = *phead; local
101 struct nvkm_head *head; local
[all...] |
| /src/external/bsd/libevent/dist/ |
| ht-internal.h | 42 #define HT_EMPTY(head) \
43 ((head)->hth_n_entries == 0)
45 /* How many elements in 'head'? */
46 #define HT_SIZE(head) \
47 ((head)->hth_n_entries)
50 #define HT_MEM_USAGE(head) \
51 (sizeof(*head) + (head)->hth_table_length * sizeof(void*))
53 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)
[all...] |
| /src/external/bsd/ntp/dist/sntp/libevent/ |
| ht-internal.h | 43 #define HT_EMPTY(head) \
44 ((head)->hth_n_entries == 0)
46 /* How many elements in 'head'? */
47 #define HT_SIZE(head) \
48 ((head)->hth_n_entries)
51 #define HT_MEM_USAGE(head) \
52 (sizeof(*head) + (head)->hth_table_length * sizeof(void*))
54 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)
[all...] |
| /src/sys/dev/dm/ |
| dm_table.c | 67 dm_table_busy(dm_table_head_t *head, uint8_t table_id)
71 mutex_enter(&head->table_mtx);
74 id = head->cur_active_table;
76 id = 1 - head->cur_active_table;
78 head->io_cnt++;
80 mutex_exit(&head->table_mtx);
88 dm_table_unbusy(dm_table_head_t *head)
91 KASSERT(head->io_cnt != 0);
93 mutex_enter(&head->table_mtx);
95 if (--head->io_cnt == 0
340 dm_table_head_t *head; local
[all...] |
| /src/external/bsd/openldap/dist/include/ |
| ldap_queue.h | 69 * added to the list after an existing element or at the head of the list.
70 * Elements being removed from the head of the list should use the explicit
77 * head of the list and the other to the tail of the list. The elements are
80 * to the list after an existing element, at the head of the list, or at the
81 * end of the list. Elements being removed from the head of the tail queue
91 * or after an existing element or at the head of the list. A list
94 * A tail queue is headed by a pair of pointers, one to the head of the
98 * after an existing element, at the head of the list, or at the end of
101 * A circle queue is headed by a pair of pointers, one to the head of the
105 * an existing element, at the head of the list, or at the end of the list
[all...] |
| /src/sys/external/bsd/drm/dist/bsd-core/ |
| drm_linux_list.h | 43 INIT_LIST_HEAD(struct list_head *head) {
44 (head)->next = head;
45 (head)->prev = head;
49 list_empty(struct list_head *head) {
50 return (head)->next == head;
54 list_add(struct list_head *new, struct list_head *head) {
55 (head)->next->prev = new
[all...] |
| /src/usr.bin/head/ |
| Makefile | 4 PROG= head
|
| /src/external/lgpl2/userspace-rcu/dist/include/urcu/ |
| rculist.h | 19 /* Add new element at the head of the list. */
21 void cds_list_add_rcu(struct cds_list_head *newp, struct cds_list_head *head)
23 newp->next = head->next;
24 newp->prev = head;
25 head->next->prev = newp;
26 rcu_assign_pointer(head->next, newp);
32 struct cds_list_head *head)
34 newp->next = head;
35 newp->prev = head->prev;
36 rcu_assign_pointer(head->prev->next, newp)
[all...] |
| wfcqueue.h | 49 * Do not put head and tail on the same cache-line if concurrent
95 static inline struct __cds_wfcq_head *__cds_wfcq_head_cast(struct __cds_wfcq_head *head)
97 return head;
104 static inline struct cds_wfcq_head *cds_wfcq_head_cast(struct cds_wfcq_head *head)
106 return head;
113 static inline const struct __cds_wfcq_head *__cds_wfcq_head_const_cast(const struct __cds_wfcq_head *head)
115 return head;
122 static inline const struct cds_wfcq_head *cds_wfcq_head_const_cast(const struct cds_wfcq_head *head)
124 return head;
133 static inline cds_wfcq_head_ptr_t __cds_wfcq_head_cast(struct __cds_wfcq_head *head)
[all...] |
| /src/external/bsd/ntp/dist/sntp/libevent/compat/sys/ |
| queue.h | 48 * added to the list after an existing element or at the head of the list.
49 * Elements being removed from the head of the list should use the explicit
59 * or after an existing element or at the head of the list. A list
62 * A simple queue is headed by a pair of pointers, one the head of the
65 * head of the list. New elements can be added to the list before or after
66 * an existing element, at the head of the list, or at the end of the
69 * A tail queue is headed by a pair of pointers, one to the head of the
73 * after an existing element, at the head of the list, or at the end of
76 * A circle queue is headed by a pair of pointers, one to the head of the
80 * an existing element, at the head of the list, or at the end of the list
[all...] |
| /src/crypto/dist/ipsec-tools/src/include-glibc/sys/ |
| queue.h | 50 * added to the list after an existing element or at the head of the list.
51 * Elements being removed from the head of the list should use the explicit
58 * head of the list and the other to the tail of the list. The elements are
61 * to the list after an existing element, at the head of the list, or at the
62 * end of the list. Elements being removed from the head of the tail queue
72 * or after an existing element or at the head of the list. A list
75 * A tail queue is headed by a pair of pointers, one to the head of the
79 * after an existing element, at the head of the list, or at the end of
114 #define SLIST_HEAD_INITIALIZER(head) \
125 #define SLIST_EMPTY(head) ((head)->slh_first == NULL
427 *head = (struct quehead *)b; local
[all...] |
| /src/sys/sys/ |
| queue.h | 45 * head of the list. Elements being removed from the head of the list
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
69 * after an existing element, at the head of the list, or at the end of
107 #define SLIST_HEAD_INITIALIZER(head) \
118 #define SLIST_FIRST(head) ((head)->slh_first
[all...] |
| /src/external/bsd/pcc/dist/pcc/cc/driver/ |
| strlist.h | 62 #define STRLIST_FIRST(head) ((head)->first)
64 #define STRLIST_FOREACH(var, head) \
65 for ((var) = STRLIST_FIRST(head); \
68 #define STRLIST_FOREACH_MUTABLE(var, head, var2) \
69 for ((var) = STRLIST_FIRST(head); \
72 #define STRLIST_EMPTY(head) (STRLIST_FIRST(head) == NULL)
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/engine/fifo/ |
| cgrp.h | 9 struct list_head head; member in struct:nvkm_fifo_cgrp
|
| /src/tests/usr.bin/nbperf/ |
| h_nbperf.sh | 30 head -n $4 $1 | nbperf -m hash.map -o hash.c -a $2 2> /dev/null
32 head -n $4 $1 | ./testprog | $3
|
