Home
last modified time | relevance | path

Searched refs:head (Results 1 – 25 of 2127) sorted by relevance

12345678910>>...86

/netbsd-src/external/bsd/openldap/dist/include/
H A Dldap_queue.h143 #define LDAP_SLIST_HEAD_INITIALIZER(head) \ argument
157 #define LDAP_SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
159 #define LDAP_SLIST_FIRST(head) ((head)->slh_first) argument
161 #define LDAP_SLIST_FOREACH(var, head, field) \ argument
162 for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
164 #define LDAP_SLIST_INIT(head) { \ argument
165 (head)->slh_first = NULL; \
177 #define LDAP_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
178 (elm)->field.sle_next = (head)->slh_first; \
179 (head)->slh_first = (elm); \
[all …]
/netbsd-src/external/bsd/ntp/dist/sntp/libevent/compat/sys/
H A Dqueue.h95 #define SLIST_HEAD_INITIALIZER(head) \ argument
108 #define SLIST_FIRST(head) ((head)->slh_first) argument
109 #define SLIST_END(head) NULL argument
110 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
113 #define SLIST_FOREACH(var, head, field) \ argument
114 for((var) = SLIST_FIRST(head); \
115 (var) != SLIST_END(head); \
121 #define SLIST_INIT(head) { \ argument
122 SLIST_FIRST(head) = SLIST_END(head); \
130 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/netbsd-src/sys/sys/
H A Dqueue.h107 #define SLIST_HEAD_INITIALIZER(head) \ argument
118 #define SLIST_FIRST(head) ((head)->slh_first) argument
119 #define SLIST_END(head) NULL argument
120 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
123 #define SLIST_FOREACH(var, head, field) \ argument
124 for((var) = (head)->slh_first; \
125 (var) != SLIST_END(head); \
128 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
129 for ((var) = SLIST_FIRST((head)); \
130 (var) != SLIST_END(head) && \
[all …]
/netbsd-src/crypto/dist/ipsec-tools/src/include-glibc/sys/
H A Dqueue.h114 #define SLIST_HEAD_INITIALIZER(head) \ argument
125 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
127 #define SLIST_FIRST(head) ((head)->slh_first) argument
129 #define SLIST_FOREACH(var, head, field) \ argument
130 for ((var) = SLIST_FIRST((head)); \
134 #define SLIST_INIT(head) do { \ argument
135 SLIST_FIRST((head)) = NULL; \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
[all …]
/netbsd-src/external/bsd/ntp/dist/sntp/libevent/
H A Dht-internal.h43 #define HT_EMPTY(head) \ argument
44 ((head)->hth_n_entries == 0)
47 #define HT_SIZE(head) \ argument
48 ((head)->hth_n_entries)
51 #define HT_MEM_USAGE(head) \ argument
52 (sizeof(*head) + (head)->hth_table_length * sizeof(void*))
54 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
55 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
56 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
57 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
[all …]
/netbsd-src/external/bsd/libevent/dist/
H A Dht-internal.h42 #define HT_EMPTY(head) \ argument
43 ((head)->hth_n_entries == 0)
46 #define HT_SIZE(head) \ argument
47 ((head)->hth_n_entries)
50 #define HT_MEM_USAGE(head) \ argument
51 (sizeof(*head) + (head)->hth_table_length * sizeof(void*))
53 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
54 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
55 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
56 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
[all …]
/netbsd-src/sys/dev/dm/
H A Ddm_table.c67 dm_table_busy(dm_table_head_t *head, uint8_t table_id) in dm_table_busy() argument
71 mutex_enter(&head->table_mtx); in dm_table_busy()
74 id = head->cur_active_table; in dm_table_busy()
76 id = 1 - head->cur_active_table; in dm_table_busy()
78 head->io_cnt++; in dm_table_busy()
80 mutex_exit(&head->table_mtx); in dm_table_busy()
88 dm_table_unbusy(dm_table_head_t *head) in dm_table_unbusy() argument
91 KASSERT(head->io_cnt != 0); in dm_table_unbusy()
93 mutex_enter(&head->table_mtx); in dm_table_unbusy()
95 if (--head->io_cnt == 0) in dm_table_unbusy()
[all …]
/netbsd-src/sys/external/bsd/drm2/dist/drm/nouveau/dispnv04/
H A Dnouveau_dispnv04_hw.c43 NVWriteVgaSeq(struct drm_device *dev, int head, uint8_t index, uint8_t value) in NVWriteVgaSeq() argument
45 NVWritePRMVIO(dev, head, NV_PRMVIO_SRX, index); in NVWriteVgaSeq()
46 NVWritePRMVIO(dev, head, NV_PRMVIO_SR, value); in NVWriteVgaSeq()
50 NVReadVgaSeq(struct drm_device *dev, int head, uint8_t index) in NVReadVgaSeq() argument
52 NVWritePRMVIO(dev, head, NV_PRMVIO_SRX, index); in NVReadVgaSeq()
53 return NVReadPRMVIO(dev, head, NV_PRMVIO_SR); in NVReadVgaSeq()
57 NVWriteVgaGr(struct drm_device *dev, int head, uint8_t index, uint8_t value) in NVWriteVgaGr() argument
59 NVWritePRMVIO(dev, head, NV_PRMVIO_GRX, index); in NVWriteVgaGr()
60 NVWritePRMVIO(dev, head, NV_PRMVIO_GX, value); in NVWriteVgaGr()
64 NVReadVgaGr(struct drm_device *dev, int head, uint8_t index) in NVReadVgaGr() argument
[all …]
H A Dhw.h39 void NVWriteVgaSeq(struct drm_device *, int head, uint8_t index, uint8_t value);
40 uint8_t NVReadVgaSeq(struct drm_device *, int head, uint8_t index);
41 void NVWriteVgaGr(struct drm_device *, int head, uint8_t index, uint8_t value);
42 uint8_t NVReadVgaGr(struct drm_device *, int head, uint8_t index);
44 void NVBlankScreen(struct drm_device *, int head, bool blank);
50 void nouveau_hw_save_state(struct drm_device *, int head,
52 void nouveau_hw_load_state(struct drm_device *, int head,
54 void nouveau_hw_load_state_palette(struct drm_device *, int head,
62 int head, uint32_t reg) in NVReadCRTC() argument
66 if (head) in NVReadCRTC()
[all …]
/netbsd-src/external/gpl2/lvm2/dist/libdm/datastruct/
H A Dlist.c25 void dm_list_init(struct dm_list *head) in dm_list_init() argument
27 head->n = head->p = head; in dm_list_init()
34 void dm_list_add(struct dm_list *head, struct dm_list *elem) in dm_list_add() argument
36 assert(head->n); in dm_list_add()
38 elem->n = head; in dm_list_add()
39 elem->p = head->p; in dm_list_add()
41 head->p->n = elem; in dm_list_add()
42 head->p = elem; in dm_list_add()
49 void dm_list_add_h(struct dm_list *head, struct dm_list *elem) in dm_list_add_h() argument
51 assert(head->n); in dm_list_add_h()
[all …]
H A Dlist.h38 void dm_list_init(struct dm_list *head);
44 void dm_list_add(struct dm_list *head, struct dm_list *elem);
50 void dm_list_add_h(struct dm_list *head, struct dm_list *elem);
62 void dm_list_move(struct dm_list *head, struct dm_list *elem);
67 int dm_list_empty(const struct dm_list *head);
72 int dm_list_start(const struct dm_list *head, const struct dm_list *elem);
77 int dm_list_end(const struct dm_list *head, const struct dm_list *elem);
82 struct dm_list *dm_list_first(const struct dm_list *head);
87 struct dm_list *dm_list_last(const struct dm_list *head);
92 struct dm_list *dm_list_prev(const struct dm_list *head, const struct dm_list *elem);
[all …]
/netbsd-src/external/gpl2/lvm2/dist/lib/datastruct/
H A Dlist.c24 void dm_list_init(struct dm_list *head) in dm_list_init() argument
26 head->n = head->p = head; in dm_list_init()
33 void dm_list_add(struct dm_list *head, struct dm_list *elem) in dm_list_add() argument
35 assert(head->n); in dm_list_add()
37 elem->n = head; in dm_list_add()
38 elem->p = head->p; in dm_list_add()
40 head->p->n = elem; in dm_list_add()
41 head->p = elem; in dm_list_add()
48 void dm_list_add_h(struct dm_list *head, struct dm_list *elem) in dm_list_add_h() argument
50 assert(head->n); in dm_list_add_h()
[all …]
H A Dlist.h38 void dm_list_init(struct dm_list *head);
44 void dm_list_add(struct dm_list *head, struct dm_list *elem);
50 void dm_list_add_h(struct dm_list *head, struct dm_list *elem);
62 void dm_list_move(struct dm_list *head, struct dm_list *elem);
67 int dm_list_empty(const struct dm_list *head);
72 int dm_list_start(const struct dm_list *head, const struct dm_list *elem);
77 int dm_list_end(const struct dm_list *head, const struct dm_list *elem);
82 struct dm_list *dm_list_first(const struct dm_list *head);
87 struct dm_list *dm_list_last(const struct dm_list *head);
92 struct dm_list *dm_list_prev(const struct dm_list *head, const struct dm_list *elem);
[all …]
/netbsd-src/sys/altq/
H A Daltq_afmap.c85 struct afm_head *head; in afm_alloc() local
87 head = malloc(sizeof(struct afm_head), M_DEVBUF, M_WAITOK|M_ZERO); in afm_alloc()
88 if (head == NULL) in afm_alloc()
92 LIST_INIT(&head->afh_head); in afm_alloc()
94 head->afh_ifp = ifp; in afm_alloc()
97 LIST_INSERT_HEAD(&afhead_chain, head, afh_chain); in afm_alloc()
105 struct afm_head *head; in afm_dealloc() local
107 if ((head = afmhead_if(ifp)) == NULL) in afm_dealloc()
112 LIST_REMOVE(head, afh_chain); in afm_dealloc()
114 free(head, M_DEVBU in afm_dealloc()
125 struct afm_head *head; afm_top() local
140 struct afm_head *head; afm_add() local
185 struct afm_head *head; afm_removeall() local
203 struct afm_head *head; afm_lookup() local
221 afm_match4(struct afm_head * head,struct flowinfo_in * fp) afm_match4() argument
250 afm_match6(struct afm_head * head,struct flowinfo_in6 * fp) afm_match6() argument
291 struct afm_head *head; afm_match() local
331 struct afm_head *head; afmclose() local
[all...]
/netbsd-src/external/bsd/elftoolchain/dist/common/
H A Duthash.h141 #define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \ argument
145 HASH_TO_BKT(_hd_hh_item->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \
146 (head)->hh.tbl->buckets[_hd_bkt].count++; \
156 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \ argument
159 if (head) { \
161 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \
162 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \
163 …HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, …
168 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
171 if (head) { \
[all …]
/netbsd-src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/engine/disp/
H A Dnouveau_nvkm_engine_disp_nv50.c101 disp->head.nr = func->head.cnt(&disp->base, &disp->head.mask); in nv50_disp_oneinit_()
103 disp->head.nr, disp->head.mask); in nv50_disp_oneinit_()
104 for_each_set_bit(i, &disp->head.mask, disp->head.nr) { in nv50_disp_oneinit_()
105 ret = func->head.new(&disp->base, i); in nv50_disp_oneinit_()
187 nv50_disp_super_iedt(struct nvkm_head *head, struct nvkm_outp *outp, in nv50_disp_super_iedt() argument
191 struct nvkm_bios *bios = head->disp->engine.subdev.device->bios; in nv50_disp_super_iedt()
194 const u16 m = (0x0100 << head->id) | (l << 6) | outp->info.or; in nv50_disp_super_iedt()
202 nv50_disp_super_ied_on(struct nvkm_head *head, in nv50_disp_super_ied_on() argument
205 struct nvkm_subdev *subdev = &head->disp->engine.subdev; in nv50_disp_super_ied_on()
219 data = nv50_disp_super_iedt(head, outp, &ver, &hdr, &cnt, &len, &iedt); in nv50_disp_super_ied_on()
[all …]
H A Dnouveau_nvkm_engine_disp_head.c39 struct nvkm_head *head; in nvkm_head_find() local
40 list_for_each_entry(head, &disp->head, head) { in nvkm_head_find()
41 if (head->id == id) in nvkm_head_find()
42 return head; in nvkm_head_find()
49 struct nvkm_head *head, void *data, u32 size) in nvkm_head_mthd_scanoutpos() argument
61 head->func->state(head, &head->arm); in nvkm_head_mthd_scanoutpos()
62 args->v0.vtotal = head->arm.vtotal; in nvkm_head_mthd_scanoutpos()
63 args->v0.vblanks = head->arm.vblanks; in nvkm_head_mthd_scanoutpos()
64 args->v0.vblanke = head->arm.vblanke; in nvkm_head_mthd_scanoutpos()
65 args->v0.htotal = head->arm.htotal; in nvkm_head_mthd_scanoutpos()
[all …]
H A Dnouveau_nvkm_engine_disp_gf119.c45 struct nvkm_head *head; in gf119_disp_super() local
49 list_for_each_entry(head, &disp->base.head, head) { in gf119_disp_super()
50 mask[head->id] = nvkm_rd32(device, 0x6101d4 + (head->id * 0x800)); in gf119_disp_super()
51 HEAD_DBG(head, "%08x", mask[head->id]); in gf119_disp_super()
57 list_for_each_entry(head, &disp->base.head, head) { in gf119_disp_super()
58 if (!(mask[head->id] & 0x00001000)) in gf119_disp_super()
60 nv50_disp_super_1_0(disp, head); in gf119_disp_super()
64 list_for_each_entry(head, &disp->base.head, head) { in gf119_disp_super()
65 if (!(mask[head->id] & 0x00001000)) in gf119_disp_super()
67 nv50_disp_super_2_0(disp, head); in gf119_disp_super()
[all …]
/netbsd-src/crypto/external/bsd/heimdal/dist/lib/base/
H A Dheimqueue.h49 #define HEIM_TAILQ_HEAD_INITIALIZER(head) \ argument
50 { NULL, &(head).tqh_first }
61 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \ argument
62 if ((head)->tqh_first && \
63 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
64 panic("HEIM_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__);
65 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \ argument
66 if (*(head)->tqh_last != NULL) \
67 panic("HEIM_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__);
75 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) \ argument
[all …]
/netbsd-src/crypto/external/bsd/heimdal/dist/lib/asn1/
H A Dasn1_queue.h49 #define ASN1_TAILQ_HEAD_INITIALIZER(head) \ argument
50 { NULL, &(head).tqh_first }
61 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ argument
62 if ((head)->tqh_first && \
63 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
64 panic("ASN1_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__);
65 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ argument
66 if (*(head)->tqh_last != NULL) \
67 panic("ASN1_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__);
75 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ argument
[all …]
/netbsd-src/external/bsd/libevent/dist/WIN32-Code/
H A Dtree.h78 #define SPLAY_ROOT(head) (head)->sph_root argument
79 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
82 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
83 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
84 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
85 (head)->sph_root = tmp; \
88 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
89 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
90 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
91 (head)->sph_root = tmp; \
[all …]
/netbsd-src/external/bsd/ntp/dist/sntp/libevent/WIN32-Code/
H A Dtree.h79 #define SPLAY_ROOT(head) (head)->sph_root argument
80 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
83 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
84 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
85 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
86 (head)->sph_root = tmp; \
89 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
90 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
91 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
92 (head)->sph_root = tmp; \
[all …]
/netbsd-src/external/ibm-public/postfix/dist/src/global/
H A Dscache_multi.c103 SCACHE_MULTI_HEAD *head; /* parent linkage: list head */ member
118 SCACHE_MULTI_HEAD *head; /* parent linkage: list head */ member
141 SCACHE_MULTI_HEAD *head; in scache_multi_drop_endp() local
158 head = endp->head; in scache_multi_drop_endp()
159 head->cache->sess_count--; in scache_multi_drop_endp()
160 if (direction == BOTTOM_UP && ring_pred(head->ring) == head->ring) in scache_multi_drop_endp()
161 htable_delete(head->cache->endp_cache, head->parent_key, myfree); in scache_multi_drop_endp()
186 SCACHE_MULTI_HEAD *head = (SCACHE_MULTI_HEAD *) ptr; in scache_multi_free_endp() local
194 while ((ring = ring_succ(head->ring)) != head->ring) { in scache_multi_free_endp()
198 myfree((void *) head); in scache_multi_free_endp()
[all …]
/netbsd-src/sys/external/bsd/drm/dist/bsd-core/
H A Ddrm_linux_list.h43 INIT_LIST_HEAD(struct list_head *head) { in INIT_LIST_HEAD() argument
44 (head)->next = head; in INIT_LIST_HEAD()
45 (head)->prev = head; in INIT_LIST_HEAD()
49 list_empty(struct list_head *head) { in list_empty() argument
50 return (head)->next == head; in list_empty()
54 list_add(struct list_head *new, struct list_head *head) { in list_add() argument
55 (head)->next->prev = new; in list_add()
56 (new)->next = (head)->next; in list_add()
57 (new)->prev = head; in list_add()
58 (head)->next = new; in list_add()
[all …]
/netbsd-src/external/mit/libuv/dist/include/uv/
H A Dtree.h84 #define SPLAY_ROOT(head) (head)->sph_root argument
85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
89 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
90 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
91 (head)->sph_root = tmp; \
94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
95 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
96 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
97 (head)->sph_root = tmp; \
[all …]

12345678910>>...86