Home
last modified time | relevance | path

Searched defs:head (Results 1 – 25 of 159) sorted by relevance

1234567

/minix/sys/sys/
H A Dqueue.h123 #define SLIST_END(head) NULL argument
141 #define SLIST_INIT(head) do { \ argument
199 #define LIST_END(head) NULL argument
249 #define LIST_INIT(head) do { \ argument
318 #define SIMPLEQ_END(head) NULL argument
421 #define TAILQ_END(head) (NULL) argument
423 #define TAILQ_LAST(head, headname) \ argument
488 #define TAILQ_INIT(head) do { \ argument
586 #define STAILQ_END(head) NULL argument
593 #define STAILQ_INIT(head) do { \ argument
[all …]
H A Dtree.h78 #define SPLAY_ROOT(head) (head)->sph_root argument
79 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
88 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
94 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
100 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
286 #define SPLAY_FOREACH(x, name, head) \ argument
318 #define RB_ROOT(head) (head)->rbh_root argument
319 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
731 #define RB_FOREACH(x, name, head) \ argument
741 #define RB_FOREACH_SAFE(x, name, head, y) \ argument
[all …]
H A Dgcq.h51 #define GCQ_INIT_HEAD(head) { GCQ_INIT((head).hq) } argument
68 gcq_hq(struct gcq_head *head) in gcq_hq()
81 gcq_init_head(struct gcq_head *head) in gcq_init_head()
95 gcq_empty(struct gcq_head *head) in gcq_empty()
134 gcq_insert_head(struct gcq_head *head, struct gcq *q) in gcq_insert_head()
140 gcq_insert_tail(struct gcq_head *head, struct gcq *q) in gcq_insert_tail()
250 gcq_remove_all(struct gcq_head *head) in gcq_remove_all()
291 #define _GCQ_NP(var, current, head, start, np, fn) \ argument
329 #define GCQ_GOT_NEXT(var, current, head, start) \ argument
331 #define GCQ_GOT_PREV(var, current, head, start) \ argument
[all …]
/minix/crypto/external/bsd/heimdal/dist/base/
H A Dheimqueue.h49 #define HEIM_TAILQ_HEAD_INITIALIZER(head) \ argument
84 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) argument
85 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) argument
87 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) argument
91 #define HEIM_TAILQ_INIT(head) do { \ argument
96 #define HEIM_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
107 #define HEIM_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
134 #define HEIM_TAILQ_REMOVE(head, elm, field) do { \ argument
146 #define HEIM_TAILQ_FOREACH(var, head, field) \ argument
160 #define HEIM_TAILQ_FIRST(head) ((head)->tqh_first) argument
[all …]
/minix/crypto/external/bsd/heimdal/dist/lib/asn1/
H A Dasn1_queue.h49 #define ASN1_TAILQ_HEAD_INITIALIZER(head) \ argument
84 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) argument
85 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) argument
87 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) argument
91 #define ASN1_TAILQ_INIT(head) do { \ argument
96 #define ASN1_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
107 #define ASN1_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
134 #define ASN1_TAILQ_REMOVE(head, elm, field) do { \ argument
146 #define ASN1_TAILQ_FOREACH(var, head, field) \ argument
160 #define ASN1_TAILQ_FIRST(head) ((head)->tqh_first) argument
[all …]
/minix/minix/lib/libmagicrt/include/common/ut/
H A Dutlist.h306 #define LL_PREPEND(head,add) \ argument
309 #define LL_PREPEND2(head,add,next) \ argument
330 #define LL_APPEND(head,add) \ argument
333 #define LL_APPEND2(head,add,next) \ argument
346 #define LL_DELETE(head,del) \ argument
349 #define LL_DELETE2(head,del,next) \ argument
366 #define LL_APPEND_VS2008(head,add) \ argument
369 #define LL_APPEND2_VS2008(head,add,next) \ argument
381 #define LL_DELETE_VS2008(head,del) \ argument
384 #define LL_DELETE2_VS2008(head,del,next) \ argument
[all …]
H A Duthash.h94 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
141 #define HASH_MAKE_TABLE(hh,head) \ argument
160 #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ argument
163 #define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced) \ argument
173 #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ argument
215 #define HASH_DELETE(hh,head,delptr) \ argument
330 #define HASH_FSCK(hh,head) argument
344 #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) argument
718 #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) argument
869 #define HASH_COUNT(head) HASH_CNT(hh,head) argument
[all …]
/minix/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/
H A Dmechqueue.h47 #define HEIM_SLIST_HEAD_INITIALIZER(head) \ argument
58 #define HEIM_SLIST_INIT(head) do { \ argument
67 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
72 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \ argument
76 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \ argument
89 #define HEIM_SLIST_FOREACH(var, head, field) \ argument
95 #define HEIM_SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
96 #define HEIM_SLIST_FIRST(head) ((head)->slh_first) argument
/minix/libexec/httpd/
H A Dnetbsd_queue.h55 #define SIMPLEQ_INIT(head) do { \ argument
60 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
66 #define SIMPLEQ_FOREACH(var, head, field) \ argument
71 #define SIMPLEQ_FOREACH_SAFE(var, head, field, next) \ argument
79 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
/minix/external/bsd/libevent/dist/
H A Dht-internal.h42 #define HT_EMPTY(head) \ argument
46 #define HT_SIZE(head) \ argument
49 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
50 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
53 #define HT_START(name, head) name##_HT_START(head) argument
54 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) argument
56 #define HT_CLEAR(name, head) name##_HT_CLEAR(head) argument
57 #define HT_INIT(name, head) name##_HT_INIT(head) argument
118 #define _HT_BUCKET(head, field, elm, hashfn) \ argument
121 #define HT_FOREACH(x, name, head) \ argument
[all …]
/minix/external/bsd/elftoolchain/dist/common/
H A D_elftc.h82 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
110 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
122 #define STAILQ_HEAD_INITIALIZER(head) \ argument
127 #define STAILQ_FOREACH(var, head, field) \ argument
134 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
141 #define STAILQ_INIT(head) do { \ argument
148 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
156 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
172 #define STAILQ_LAST(head, type, field) \ argument
198 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
[all …]
H A Duthash.h98 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
144 #define HASH_MAKE_TABLE(hh,head) \ argument
163 #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ argument
166 #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ argument
208 #define HASH_DELETE(hh,head,delptr) \ argument
245 #define HASH_FIND_STR(head,findstr,out) \ argument
317 #define HASH_FSCK(hh,head) argument
331 #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) argument
705 #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) argument
850 #define HASH_COUNT(head) HASH_CNT(hh,head) argument
[all …]
/minix/sys/ufs/chfs/
H A Debh_misc.h46 #define EBH_TREE_DESTROY(name, head, type) \ argument
57 #define EBH_TREE_DESTROY_MUTEX(name, head, type) \ argument
71 #define EBH_QUEUE_DESTROY(head, type, entry) \ argument
/minix/minix/fs/isofs/
H A Duthash.h103 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
150 #define HASH_MAKE_TABLE(hh,head) \ argument
169 #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ argument
172 #define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced) \ argument
182 #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ argument
224 #define HASH_DELETE(hh,head,delptr) \ argument
339 #define HASH_FSCK(hh,head) argument
353 #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) argument
729 #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) argument
889 #define HASH_COUNT(head) HASH_CNT(hh,head) argument
[all …]
/minix/external/bsd/libevent/dist/WIN32-Code/
H A Dtree.h78 #define SPLAY_ROOT(head) (head)->sph_root argument
94 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
100 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
286 #define SPLAY_FOREACH(x, name, head) \ argument
318 #define RB_ROOT(head) (head)->rbh_root argument
319 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
673 #define RB_FOREACH(x, name, head) \ argument
755 #define SPLAY_ROOT(head) (head)->sph_root argument
963 #define SPLAY_FOREACH(x, name, head) \ argument
995 #define RB_ROOT(head) (head)->rbh_root argument
[all …]
/minix/crypto/external/bsd/heimdal/dist/admin/
H A Dpurge.c52 get_entry (krb5_principal princ, struct e *head) in get_entry()
63 add_entry (krb5_principal princ, int vno, time_t timestamp, struct e **head) in add_entry()
89 delete_list (struct e *head) in delete_list()
112 struct e *head = NULL; in kt_purge() local
/minix/lib/libc/citrus/
H A Dcitrus_hash.h37 #define _CITRUS_HASH_INIT(head, hashsize) \ argument
44 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \ argument
46 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \ argument
H A Dcitrus_mmap.c55 void *head; in _citrus_map_file() local
/minix/lib/libc/stdlib/
H A Dhcreate.c102 hcreate_r(size_t nel, struct hsearch_data *head) in hcreate_r()
157 hdestroy1_r(struct hsearch_data *head, void (*freekey)(void *), in hdestroy1_r()
187 hdestroy_r(struct hsearch_data *head) in hdestroy_r()
202 hsearch_r(ENTRY item, ACTION action, ENTRY **itemp, struct hsearch_data *head) in hsearch_r()
/minix/lib/libc/db/mpool/
H A Dmpool.c126 struct _hqh *head; in mpool_new() local
160 struct _hqh *head; in mpool_get() local
306 struct _hqh *head; in mpool_bkt() local
398 struct _hqh *head; in mpool_look() local
/minix/minix/lib/libddekit/src/
H A Dinitcall.c13 static struct __ddekit_initcall_s head = {0,0,0}; variable
/minix/games/monop/
H A Dprop.c63 add_list(int plr, OWN **head, int op_sqr) in add_list()
95 del_list(int plr, OWN **head, short op_sqr) in del_list()
/minix/external/bsd/llvm/dist/clang/test/CodeGen/
H A Ddisable-tail-calls.c9 List *find(List *head, int data) { in find()
/minix/lib/libc/rpc/
H A Dpmap_getmaps.c84 struct pmaplist *head = NULL; in __weak_alias() local
/minix/lib/libc/locale/
H A Dnewlocale.c47 char head[_LOCALENAME_LEN_MAX * (_LC_LAST - 1)], *tail; in __weak_alias() local

1234567