Symbol: head
bin/pkill/pkill.c
699
makelist(struct listhead *head, enum listtype type, char *src)
bin/pkill/pkill.c
720
SLIST_INSERT_HEAD(head, li, li_chain);
crypto/heimdal/admin/purge.c
110
struct e *head = NULL;
crypto/heimdal/admin/purge.c
129
add_entry (entry.principal, entry.vno, entry.timestamp, &head);
crypto/heimdal/admin/purge.c
143
struct e *e = get_entry (entry.principal, head);
crypto/heimdal/admin/purge.c
167
delete_list (head);
crypto/heimdal/admin/purge.c
50
get_entry (krb5_principal princ, struct e *head)
crypto/heimdal/admin/purge.c
54
for (e = head; e != NULL; e = e->next)
crypto/heimdal/admin/purge.c
61
add_entry (krb5_principal princ, int vno, time_t timestamp, struct e **head)
crypto/heimdal/admin/purge.c
66
e = get_entry (princ, *head);
crypto/heimdal/admin/purge.c
82
e->next = *head;
crypto/heimdal/admin/purge.c
83
*head = e;
crypto/heimdal/admin/purge.c
87
delete_list (struct e *head)
crypto/heimdal/admin/purge.c
89
while (head != NULL) {
crypto/heimdal/admin/purge.c
90
struct e *next = head->next;
crypto/heimdal/admin/purge.c
91
krb5_free_principal (context, head->principal);
crypto/heimdal/admin/purge.c
92
free (head);
crypto/heimdal/admin/purge.c
93
head = next;
crypto/heimdal/base/heimbase.c
386
struct heim_auto_release *head;
crypto/heimdal/base/heimbase.c
395
if (tls->head)
crypto/heimdal/base/heimbase.c
396
heim_release(tls->head);
crypto/heimdal/base/heimbase.c
455
if (tls->current != tls->head)
crypto/heimdal/base/heimbase.c
499
if (tls->head == NULL)
crypto/heimdal/base/heimbase.c
500
tls->head = ar;
crypto/heimdal/base/heimqueue.h
100
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/heimdal/base/heimqueue.h
101
(head)->tqh_first = (elm); \
crypto/heimdal/base/heimqueue.h
102
(elm)->field.tqe_prev = &(head)->tqh_first; \
crypto/heimdal/base/heimqueue.h
105
#define HEIM_TAILQ_INSERT_TAIL(head, elm, field) do { \
crypto/heimdal/base/heimqueue.h
106
QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL((head), (elm), field) \
crypto/heimdal/base/heimqueue.h
108
(elm)->field.tqe_prev = (head)->tqh_last; \
crypto/heimdal/base/heimqueue.h
109
*(head)->tqh_last = (elm); \
crypto/heimdal/base/heimqueue.h
110
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/heimdal/base/heimqueue.h
113
#define HEIM_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
crypto/heimdal/base/heimqueue.h
119
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/heimdal/base/heimqueue.h
132
#define HEIM_TAILQ_REMOVE(head, elm, field) do { \
crypto/heimdal/base/heimqueue.h
133
QUEUEDEBUG_HEIM_TAILQ_PREREMOVE((head), (elm), field) \
crypto/heimdal/base/heimqueue.h
139
(head)->tqh_last = (elm)->field.tqe_prev; \
crypto/heimdal/base/heimqueue.h
144
#define HEIM_TAILQ_FOREACH(var, head, field) \
crypto/heimdal/base/heimqueue.h
145
for ((var) = ((head)->tqh_first); \
crypto/heimdal/base/heimqueue.h
149
#define HEIM_TAILQ_FOREACH_REVERSE(var, head, headname, field) \
crypto/heimdal/base/heimqueue.h
150
for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last)); \
crypto/heimdal/base/heimqueue.h
157
#define HEIM_TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
crypto/heimdal/base/heimqueue.h
158
#define HEIM_TAILQ_FIRST(head) ((head)->tqh_first)
crypto/heimdal/base/heimqueue.h
161
#define HEIM_TAILQ_LAST(head, headname) \
crypto/heimdal/base/heimqueue.h
162
(*(((struct headname *)((head)->tqh_last))->tqh_last))
crypto/heimdal/base/heimqueue.h
47
#define HEIM_TAILQ_HEAD_INITIALIZER(head) \
crypto/heimdal/base/heimqueue.h
48
{ NULL, &(head).tqh_first }
crypto/heimdal/base/heimqueue.h
59
#define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \
crypto/heimdal/base/heimqueue.h
60
if ((head)->tqh_first && \
crypto/heimdal/base/heimqueue.h
61
(head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
crypto/heimdal/base/heimqueue.h
62
panic("HEIM_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__);
crypto/heimdal/base/heimqueue.h
63
#define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \
crypto/heimdal/base/heimqueue.h
64
if (*(head)->tqh_last != NULL) \
crypto/heimdal/base/heimqueue.h
65
panic("HEIM_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__);
crypto/heimdal/base/heimqueue.h
73
#define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) \
crypto/heimdal/base/heimqueue.h
75
(head)->tqh_last != &(elm)->field.tqe_next) \
crypto/heimdal/base/heimqueue.h
77
(head), (elm), __FILE__, __LINE__);
crypto/heimdal/base/heimqueue.h
82
#define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field)
crypto/heimdal/base/heimqueue.h
83
#define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field)
crypto/heimdal/base/heimqueue.h
85
#define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field)
crypto/heimdal/base/heimqueue.h
89
#define HEIM_TAILQ_INIT(head) do { \
crypto/heimdal/base/heimqueue.h
90
(head)->tqh_first = NULL; \
crypto/heimdal/base/heimqueue.h
91
(head)->tqh_last = &(head)->tqh_first; \
crypto/heimdal/base/heimqueue.h
94
#define HEIM_TAILQ_INSERT_HEAD(head, elm, field) do { \
crypto/heimdal/base/heimqueue.h
95
QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD((head), (elm), field) \
crypto/heimdal/base/heimqueue.h
96
if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
crypto/heimdal/base/heimqueue.h
97
(head)->tqh_first->field.tqe_prev = \
crypto/heimdal/lib/asn1/asn1_queue.h
100
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/heimdal/lib/asn1/asn1_queue.h
101
(head)->tqh_first = (elm); \
crypto/heimdal/lib/asn1/asn1_queue.h
102
(elm)->field.tqe_prev = &(head)->tqh_first; \
crypto/heimdal/lib/asn1/asn1_queue.h
105
#define ASN1_TAILQ_INSERT_TAIL(head, elm, field) do { \
crypto/heimdal/lib/asn1/asn1_queue.h
106
QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL((head), (elm), field) \
crypto/heimdal/lib/asn1/asn1_queue.h
108
(elm)->field.tqe_prev = (head)->tqh_last; \
crypto/heimdal/lib/asn1/asn1_queue.h
109
*(head)->tqh_last = (elm); \
crypto/heimdal/lib/asn1/asn1_queue.h
110
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/heimdal/lib/asn1/asn1_queue.h
113
#define ASN1_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
crypto/heimdal/lib/asn1/asn1_queue.h
119
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/heimdal/lib/asn1/asn1_queue.h
132
#define ASN1_TAILQ_REMOVE(head, elm, field) do { \
crypto/heimdal/lib/asn1/asn1_queue.h
133
QUEUEDEBUG_ASN1_TAILQ_PREREMOVE((head), (elm), field) \
crypto/heimdal/lib/asn1/asn1_queue.h
139
(head)->tqh_last = (elm)->field.tqe_prev; \
crypto/heimdal/lib/asn1/asn1_queue.h
144
#define ASN1_TAILQ_FOREACH(var, head, field) \
crypto/heimdal/lib/asn1/asn1_queue.h
145
for ((var) = ((head)->tqh_first); \
crypto/heimdal/lib/asn1/asn1_queue.h
149
#define ASN1_TAILQ_FOREACH_REVERSE(var, head, headname, field) \
crypto/heimdal/lib/asn1/asn1_queue.h
150
for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last)); \
crypto/heimdal/lib/asn1/asn1_queue.h
157
#define ASN1_TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
crypto/heimdal/lib/asn1/asn1_queue.h
158
#define ASN1_TAILQ_FIRST(head) ((head)->tqh_first)
crypto/heimdal/lib/asn1/asn1_queue.h
161
#define ASN1_TAILQ_LAST(head, headname) \
crypto/heimdal/lib/asn1/asn1_queue.h
162
(*(((struct headname *)((head)->tqh_last))->tqh_last))
crypto/heimdal/lib/asn1/asn1_queue.h
47
#define ASN1_TAILQ_HEAD_INITIALIZER(head) \
crypto/heimdal/lib/asn1/asn1_queue.h
48
{ NULL, &(head).tqh_first }
crypto/heimdal/lib/asn1/asn1_queue.h
59
#define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \
crypto/heimdal/lib/asn1/asn1_queue.h
60
if ((head)->tqh_first && \
crypto/heimdal/lib/asn1/asn1_queue.h
61
(head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
crypto/heimdal/lib/asn1/asn1_queue.h
62
panic("ASN1_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__);
crypto/heimdal/lib/asn1/asn1_queue.h
63
#define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \
crypto/heimdal/lib/asn1/asn1_queue.h
64
if (*(head)->tqh_last != NULL) \
crypto/heimdal/lib/asn1/asn1_queue.h
65
panic("ASN1_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__);
crypto/heimdal/lib/asn1/asn1_queue.h
73
#define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \
crypto/heimdal/lib/asn1/asn1_queue.h
75
(head)->tqh_last != &(elm)->field.tqe_next) \
crypto/heimdal/lib/asn1/asn1_queue.h
77
(head), (elm), __FILE__, __LINE__);
crypto/heimdal/lib/asn1/asn1_queue.h
82
#define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field)
crypto/heimdal/lib/asn1/asn1_queue.h
83
#define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field)
crypto/heimdal/lib/asn1/asn1_queue.h
85
#define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field)
crypto/heimdal/lib/asn1/asn1_queue.h
89
#define ASN1_TAILQ_INIT(head) do { \
crypto/heimdal/lib/asn1/asn1_queue.h
90
(head)->tqh_first = NULL; \
crypto/heimdal/lib/asn1/asn1_queue.h
91
(head)->tqh_last = &(head)->tqh_first; \
crypto/heimdal/lib/asn1/asn1_queue.h
94
#define ASN1_TAILQ_INSERT_HEAD(head, elm, field) do { \
crypto/heimdal/lib/asn1/asn1_queue.h
95
QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD((head), (elm), field) \
crypto/heimdal/lib/asn1/asn1_queue.h
96
if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
crypto/heimdal/lib/asn1/asn1_queue.h
97
(head)->tqh_first->field.tqe_prev = \
crypto/heimdal/lib/asn1/asn1parse.c
2804
add_oid_to_tail(struct objid *head, struct objid *tail)
crypto/heimdal/lib/asn1/asn1parse.c
2807
o = head;
crypto/heimdal/lib/asn1/asn1parse.y
981
add_oid_to_tail(struct objid *head, struct objid *tail)
crypto/heimdal/lib/asn1/asn1parse.y
984
o = head;
crypto/heimdal/lib/gssapi/mech/mechqueue.h
45
#define HEIM_SLIST_HEAD_INITIALIZER(head) \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
56
#define HEIM_SLIST_INIT(head) do { \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
57
(head)->slh_first = NULL; \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
65
#define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
66
(elm)->field.sle_next = (head)->slh_first; \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
67
(head)->slh_first = (elm); \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
70
#define HEIM_SLIST_REMOVE_HEAD(head, field) do { \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
71
(head)->slh_first = (head)->slh_first->field.sle_next; \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
74
#define HEIM_SLIST_REMOVE(head, elm, type, field) do { \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
75
if ((head)->slh_first == (elm)) { \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
76
HEIM_SLIST_REMOVE_HEAD((head), field); \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
79
struct type *curelm = (head)->slh_first; \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
87
#define HEIM_SLIST_FOREACH(var, head, field) \
crypto/heimdal/lib/gssapi/mech/mechqueue.h
88
for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
crypto/heimdal/lib/gssapi/mech/mechqueue.h
93
#define HEIM_SLIST_EMPTY(head) ((head)->slh_first == NULL)
crypto/heimdal/lib/gssapi/mech/mechqueue.h
94
#define HEIM_SLIST_FIRST(head) ((head)->slh_first)
crypto/heimdal/lib/hdb/keytab.c
141
struct hdb_dbinfo *head, *dbinfo = NULL;
crypto/heimdal/lib/hdb/keytab.c
145
ret = hdb_get_dbinfo(context, &head);
crypto/heimdal/lib/hdb/keytab.c
149
while ((dbinfo = hdb_dbinfo_get_next(head, dbinfo)) != NULL) {
crypto/heimdal/lib/hdb/keytab.c
161
hdb_free_dbinfo(context, &head);
crypto/heimdal/lib/kadm5/ad.c
292
for (rr = r->head ; rr != NULL; rr = rr->next) {
crypto/heimdal/lib/kafs/common.c
151
struct rk_resource_record *rr = r->head;
crypto/heimdal/lib/krb5/config_file.c
576
krb5_config_section **head)
crypto/heimdal/lib/krb5/config_file.c
580
*head = NULL;
crypto/heimdal/lib/krb5/config_file.c
585
if (*head == NULL)
crypto/heimdal/lib/krb5/config_file.c
586
*head = d;
crypto/heimdal/lib/krb5/get_host_realm.c
119
ret = copy_txt_to_realms (r->head, realms);
crypto/heimdal/lib/krb5/get_host_realm.c
52
copy_txt_to_realms (struct rk_resource_record *head,
crypto/heimdal/lib/krb5/get_host_realm.c
58
for(n = 0, rr = head; rr; rr = rr->next)
crypto/heimdal/lib/krb5/get_host_realm.c
72
for (i = 0, rr = head; rr; rr = rr->next) {
crypto/heimdal/lib/krb5/krbhst.c
115
for(num_srv = 0, rr = r->head; rr; rr = rr->next)
crypto/heimdal/lib/krb5/krbhst.c
95
for(num_srv = 0, rr = r->head; rr; rr = rr->next)
crypto/heimdal/lib/krb5/transited.c
242
append_realm(struct tr_realm *head, struct tr_realm *r)
crypto/heimdal/lib/krb5/transited.c
245
if(head == NULL){
crypto/heimdal/lib/krb5/transited.c
249
p = head;
crypto/heimdal/lib/krb5/transited.c
252
return head;
crypto/heimdal/lib/roken/resolve-test.c
107
for(rr = r->head; rr;rr=rr->next){
crypto/heimdal/lib/roken/resolve.c
119
for(rr = r->head; rr;){
crypto/heimdal/lib/roken/resolve.c
473
rr = &r->head;
crypto/heimdal/lib/roken/resolve.c
635
for(rr = r->head; rr; rr = rr->next)
crypto/heimdal/lib/roken/resolve.c
648
for(ss = srvs, headp = &r->head; *headp; )
crypto/heimdal/lib/roken/resolve.c
660
headp = &r->head;
crypto/heimdal/lib/roken/resolve.c
898
r->head = parse_dns_record(pRec);
crypto/heimdal/lib/roken/resolve.c
900
if (r->head == NULL) {
crypto/heimdal/lib/roken/resolve.h
228
struct rk_resource_record *head;
crypto/krb5/src/include/k5-queue.h
110
#define K5_LIST_INIT(head) do { \
crypto/krb5/src/include/k5-queue.h
111
(head)->lh_first = NULL; \
crypto/krb5/src/include/k5-queue.h
129
#define K5_LIST_INSERT_HEAD(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
130
if (((elm)->field.le_next = (head)->lh_first) != NULL) \
crypto/krb5/src/include/k5-queue.h
131
(head)->lh_first->field.le_prev = &(elm)->field.le_next;\
crypto/krb5/src/include/k5-queue.h
132
(head)->lh_first = (elm); \
crypto/krb5/src/include/k5-queue.h
133
(elm)->field.le_prev = &(head)->lh_first; \
crypto/krb5/src/include/k5-queue.h
143
#define K5_LIST_FOREACH(var, head, field) \
crypto/krb5/src/include/k5-queue.h
144
for ((var) = ((head)->lh_first); \
crypto/krb5/src/include/k5-queue.h
148
#define K5_LIST_FOREACH_SAFE(var, head, field, tvar) \
crypto/krb5/src/include/k5-queue.h
149
for ((var) = K5_LIST_FIRST((head)); \
crypto/krb5/src/include/k5-queue.h
155
#define K5_LIST_EMPTY(head) ((head)->lh_first == NULL)
crypto/krb5/src/include/k5-queue.h
156
#define K5_LIST_FIRST(head) ((head)->lh_first)
crypto/krb5/src/include/k5-queue.h
168
#define K5_SLIST_HEAD_INITIALIZER(head) \
crypto/krb5/src/include/k5-queue.h
179
#define K5_SLIST_INIT(head) do { \
crypto/krb5/src/include/k5-queue.h
180
(head)->slh_first = NULL; \
crypto/krb5/src/include/k5-queue.h
188
#define K5_SLIST_INSERT_HEAD(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
189
(elm)->field.sle_next = (head)->slh_first; \
crypto/krb5/src/include/k5-queue.h
190
(head)->slh_first = (elm); \
crypto/krb5/src/include/k5-queue.h
193
#define K5_SLIST_REMOVE_HEAD(head, field) do { \
crypto/krb5/src/include/k5-queue.h
194
(head)->slh_first = (head)->slh_first->field.sle_next; \
crypto/krb5/src/include/k5-queue.h
197
#define K5_SLIST_REMOVE(head, elm, type, field) do { \
crypto/krb5/src/include/k5-queue.h
198
if ((head)->slh_first == (elm)) { \
crypto/krb5/src/include/k5-queue.h
199
K5_SLIST_REMOVE_HEAD((head), field); \
crypto/krb5/src/include/k5-queue.h
202
struct type *curelm = (head)->slh_first; \
crypto/krb5/src/include/k5-queue.h
215
#define K5_SLIST_FOREACH(var, head, field) \
crypto/krb5/src/include/k5-queue.h
216
for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
crypto/krb5/src/include/k5-queue.h
218
#define K5_SLIST_FOREACH_SAFE(var, head, field, tvar) \
crypto/krb5/src/include/k5-queue.h
219
for ((var) = K5_SLIST_FIRST((head)); \
crypto/krb5/src/include/k5-queue.h
226
#define K5_SLIST_EMPTY(head) ((head)->slh_first == NULL)
crypto/krb5/src/include/k5-queue.h
227
#define K5_SLIST_FIRST(head) ((head)->slh_first)
crypto/krb5/src/include/k5-queue.h
240
#define K5_STAILQ_HEAD_INITIALIZER(head) \
crypto/krb5/src/include/k5-queue.h
241
{ NULL, &(head).stqh_first }
crypto/krb5/src/include/k5-queue.h
251
#define K5_STAILQ_INIT(head) do { \
crypto/krb5/src/include/k5-queue.h
252
(head)->stqh_first = NULL; \
crypto/krb5/src/include/k5-queue.h
253
(head)->stqh_last = &(head)->stqh_first; \
crypto/krb5/src/include/k5-queue.h
256
#define K5_STAILQ_INSERT_HEAD(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
257
if (((elm)->field.stqe_next = (head)->stqh_first) == NULL) \
crypto/krb5/src/include/k5-queue.h
258
(head)->stqh_last = &(elm)->field.stqe_next; \
crypto/krb5/src/include/k5-queue.h
259
(head)->stqh_first = (elm); \
crypto/krb5/src/include/k5-queue.h
262
#define K5_STAILQ_INSERT_TAIL(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
264
*(head)->stqh_last = (elm); \
crypto/krb5/src/include/k5-queue.h
265
(head)->stqh_last = &(elm)->field.stqe_next; \
crypto/krb5/src/include/k5-queue.h
268
#define K5_STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
270
(head)->stqh_last = &(elm)->field.stqe_next; \
crypto/krb5/src/include/k5-queue.h
274
#define K5_STAILQ_REMOVE_HEAD(head, field) do { \
crypto/krb5/src/include/k5-queue.h
275
if (((head)->stqh_first = (head)->stqh_first->field.stqe_next) == NULL) \
crypto/krb5/src/include/k5-queue.h
276
(head)->stqh_last = &(head)->stqh_first; \
crypto/krb5/src/include/k5-queue.h
279
#define K5_STAILQ_REMOVE(head, elm, type, field) do { \
crypto/krb5/src/include/k5-queue.h
280
if ((head)->stqh_first == (elm)) { \
crypto/krb5/src/include/k5-queue.h
281
K5_STAILQ_REMOVE_HEAD((head), field); \
crypto/krb5/src/include/k5-queue.h
283
struct type *curelm = (head)->stqh_first; \
crypto/krb5/src/include/k5-queue.h
288
(head)->stqh_last = &(curelm)->field.stqe_next; \
crypto/krb5/src/include/k5-queue.h
292
#define K5_STAILQ_FOREACH(var, head, field) \
crypto/krb5/src/include/k5-queue.h
293
for ((var) = ((head)->stqh_first); \
crypto/krb5/src/include/k5-queue.h
297
#define K5_STAILQ_FOREACH_SAFE(var, head, field, tvar) \
crypto/krb5/src/include/k5-queue.h
298
for ((var) = K5_STAILQ_FIRST((head)); \
crypto/krb5/src/include/k5-queue.h
310
#define K5_STAILQ_LAST(head, type, field) \
crypto/krb5/src/include/k5-queue.h
311
(K5_STAILQ_EMPTY((head)) ? \
crypto/krb5/src/include/k5-queue.h
314
((char *)((head)->stqh_last) - offsetof(struct type, field))))
crypto/krb5/src/include/k5-queue.h
319
#define K5_STAILQ_EMPTY(head) ((head)->stqh_first == NULL)
crypto/krb5/src/include/k5-queue.h
320
#define K5_STAILQ_FIRST(head) ((head)->stqh_first)
crypto/krb5/src/include/k5-queue.h
333
#define K5_SIMPLEQ_HEAD_INITIALIZER(head) \
crypto/krb5/src/include/k5-queue.h
334
{ NULL, &(head).sqh_first }
crypto/krb5/src/include/k5-queue.h
344
#define K5_SIMPLEQ_INIT(head) do { \
crypto/krb5/src/include/k5-queue.h
345
(head)->sqh_first = NULL; \
crypto/krb5/src/include/k5-queue.h
346
(head)->sqh_last = &(head)->sqh_first; \
crypto/krb5/src/include/k5-queue.h
349
#define K5_SIMPLEQ_INSERT_HEAD(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
350
if (((elm)->field.sqe_next = (head)->sqh_first) == NULL) \
crypto/krb5/src/include/k5-queue.h
351
(head)->sqh_last = &(elm)->field.sqe_next; \
crypto/krb5/src/include/k5-queue.h
352
(head)->sqh_first = (elm); \
crypto/krb5/src/include/k5-queue.h
355
#define K5_SIMPLEQ_INSERT_TAIL(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
357
*(head)->sqh_last = (elm); \
crypto/krb5/src/include/k5-queue.h
358
(head)->sqh_last = &(elm)->field.sqe_next; \
crypto/krb5/src/include/k5-queue.h
361
#define K5_SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
363
(head)->sqh_last = &(elm)->field.sqe_next; \
crypto/krb5/src/include/k5-queue.h
367
#define K5_SIMPLEQ_REMOVE_HEAD(head, field) do { \
crypto/krb5/src/include/k5-queue.h
368
if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \
crypto/krb5/src/include/k5-queue.h
369
(head)->sqh_last = &(head)->sqh_first; \
crypto/krb5/src/include/k5-queue.h
372
#define K5_SIMPLEQ_REMOVE(head, elm, type, field) do { \
crypto/krb5/src/include/k5-queue.h
373
if ((head)->sqh_first == (elm)) { \
crypto/krb5/src/include/k5-queue.h
374
K5_SIMPLEQ_REMOVE_HEAD((head), field); \
crypto/krb5/src/include/k5-queue.h
376
struct type *curelm = (head)->sqh_first; \
crypto/krb5/src/include/k5-queue.h
381
(head)->sqh_last = &(curelm)->field.sqe_next; \
crypto/krb5/src/include/k5-queue.h
385
#define K5_SIMPLEQ_FOREACH(var, head, field) \
crypto/krb5/src/include/k5-queue.h
386
for ((var) = ((head)->sqh_first); \
crypto/krb5/src/include/k5-queue.h
390
#define K5_SIMPLEQ_FOREACH_SAFE(var, head, field, next) \
crypto/krb5/src/include/k5-queue.h
391
for ((var) = ((head)->sqh_first); \
crypto/krb5/src/include/k5-queue.h
403
#define K5_SIMPLEQ_LAST(head, type, field) \
crypto/krb5/src/include/k5-queue.h
404
(K5_SIMPLEQ_EMPTY((head)) ? \
crypto/krb5/src/include/k5-queue.h
407
((char *)((head)->sqh_last) - offsetof(struct type, field))))
crypto/krb5/src/include/k5-queue.h
412
#define K5_SIMPLEQ_EMPTY(head) ((head)->sqh_first == NULL)
crypto/krb5/src/include/k5-queue.h
413
#define K5_SIMPLEQ_FIRST(head) ((head)->sqh_first)
crypto/krb5/src/include/k5-queue.h
427
#define K5_TAILQ_HEAD_INITIALIZER(head) \
crypto/krb5/src/include/k5-queue.h
428
{ NULL, &(head).tqh_first }
crypto/krb5/src/include/k5-queue.h
440
#define K5_TAILQ_INIT(head) do { \
crypto/krb5/src/include/k5-queue.h
441
(head)->tqh_first = NULL; \
crypto/krb5/src/include/k5-queue.h
442
(head)->tqh_last = &(head)->tqh_first; \
crypto/krb5/src/include/k5-queue.h
445
#define K5_TAILQ_INSERT_HEAD(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
446
if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
crypto/krb5/src/include/k5-queue.h
447
(head)->tqh_first->field.tqe_prev = \
crypto/krb5/src/include/k5-queue.h
450
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/krb5/src/include/k5-queue.h
451
(head)->tqh_first = (elm); \
crypto/krb5/src/include/k5-queue.h
452
(elm)->field.tqe_prev = &(head)->tqh_first; \
crypto/krb5/src/include/k5-queue.h
455
#define K5_TAILQ_INSERT_TAIL(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
457
(elm)->field.tqe_prev = (head)->tqh_last; \
crypto/krb5/src/include/k5-queue.h
458
*(head)->tqh_last = (elm); \
crypto/krb5/src/include/k5-queue.h
459
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/krb5/src/include/k5-queue.h
462
#define K5_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
467
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/krb5/src/include/k5-queue.h
479
#define K5_TAILQ_REMOVE(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
484
(head)->tqh_last = (elm)->field.tqe_prev; \
crypto/krb5/src/include/k5-queue.h
488
#define K5_TAILQ_FOREACH(var, head, field) \
crypto/krb5/src/include/k5-queue.h
489
for ((var) = ((head)->tqh_first); \
crypto/krb5/src/include/k5-queue.h
493
#define K5_TAILQ_FOREACH_SAFE(var, head, field, next) \
crypto/krb5/src/include/k5-queue.h
494
for ((var) = ((head)->tqh_first); \
crypto/krb5/src/include/k5-queue.h
498
#define K5_TAILQ_FOREACH_REVERSE(var, head, headname, field) \
crypto/krb5/src/include/k5-queue.h
499
for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last)); \
crypto/krb5/src/include/k5-queue.h
503
#define K5_TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, prev) \
crypto/krb5/src/include/k5-queue.h
504
for ((var) = K5_TAILQ_LAST((head), headname); \
crypto/krb5/src/include/k5-queue.h
520
#define K5_TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
crypto/krb5/src/include/k5-queue.h
521
#define K5_TAILQ_FIRST(head) ((head)->tqh_first)
crypto/krb5/src/include/k5-queue.h
524
#define K5_TAILQ_LAST(head, headname) \
crypto/krb5/src/include/k5-queue.h
525
(*(((struct headname *)((head)->tqh_last))->tqh_last))
crypto/krb5/src/include/k5-queue.h
539
#define K5_CIRCLEQ_HEAD_INITIALIZER(head) \
crypto/krb5/src/include/k5-queue.h
540
{ (void *)&head, (void *)&head }
crypto/krb5/src/include/k5-queue.h
551
#define K5_CIRCLEQ_INIT(head) do { \
crypto/krb5/src/include/k5-queue.h
552
(head)->cqh_first = (void *)(head); \
crypto/krb5/src/include/k5-queue.h
553
(head)->cqh_last = (void *)(head); \
crypto/krb5/src/include/k5-queue.h
556
#define K5_CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
559
if ((listelm)->field.cqe_next == (void *)(head)) \
crypto/krb5/src/include/k5-queue.h
560
(head)->cqh_last = (elm); \
crypto/krb5/src/include/k5-queue.h
566
#define K5_CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
569
if ((listelm)->field.cqe_prev == (void *)(head)) \
crypto/krb5/src/include/k5-queue.h
570
(head)->cqh_first = (elm); \
crypto/krb5/src/include/k5-queue.h
576
#define K5_CIRCLEQ_INSERT_HEAD(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
577
(elm)->field.cqe_next = (head)->cqh_first; \
crypto/krb5/src/include/k5-queue.h
578
(elm)->field.cqe_prev = (void *)(head); \
crypto/krb5/src/include/k5-queue.h
579
if ((head)->cqh_last == (void *)(head)) \
crypto/krb5/src/include/k5-queue.h
580
(head)->cqh_last = (elm); \
crypto/krb5/src/include/k5-queue.h
582
(head)->cqh_first->field.cqe_prev = (elm); \
crypto/krb5/src/include/k5-queue.h
583
(head)->cqh_first = (elm); \
crypto/krb5/src/include/k5-queue.h
586
#define K5_CIRCLEQ_INSERT_TAIL(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
587
(elm)->field.cqe_next = (void *)(head); \
crypto/krb5/src/include/k5-queue.h
588
(elm)->field.cqe_prev = (head)->cqh_last; \
crypto/krb5/src/include/k5-queue.h
589
if ((head)->cqh_first == (void *)(head)) \
crypto/krb5/src/include/k5-queue.h
590
(head)->cqh_first = (elm); \
crypto/krb5/src/include/k5-queue.h
592
(head)->cqh_last->field.cqe_next = (elm); \
crypto/krb5/src/include/k5-queue.h
593
(head)->cqh_last = (elm); \
crypto/krb5/src/include/k5-queue.h
596
#define K5_CIRCLEQ_REMOVE(head, elm, field) do { \
crypto/krb5/src/include/k5-queue.h
597
if ((elm)->field.cqe_next == (void *)(head)) \
crypto/krb5/src/include/k5-queue.h
598
(head)->cqh_last = (elm)->field.cqe_prev; \
crypto/krb5/src/include/k5-queue.h
602
if ((elm)->field.cqe_prev == (void *)(head)) \
crypto/krb5/src/include/k5-queue.h
603
(head)->cqh_first = (elm)->field.cqe_next; \
crypto/krb5/src/include/k5-queue.h
609
#define K5_CIRCLEQ_FOREACH(var, head, field) \
crypto/krb5/src/include/k5-queue.h
610
for ((var) = ((head)->cqh_first); \
crypto/krb5/src/include/k5-queue.h
611
(var) != (const void *)(head); \
crypto/krb5/src/include/k5-queue.h
614
#define K5_CIRCLEQ_FOREACH_REVERSE(var, head, field) \
crypto/krb5/src/include/k5-queue.h
615
for ((var) = ((head)->cqh_last); \
crypto/krb5/src/include/k5-queue.h
616
(var) != (const void *)(head); \
crypto/krb5/src/include/k5-queue.h
622
#define K5_CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head))
crypto/krb5/src/include/k5-queue.h
623
#define K5_CIRCLEQ_FIRST(head) ((head)->cqh_first)
crypto/krb5/src/include/k5-queue.h
624
#define K5_CIRCLEQ_LAST(head) ((head)->cqh_last)
crypto/krb5/src/include/k5-queue.h
628
#define K5_CIRCLEQ_LOOP_NEXT(head, elm, field) \
crypto/krb5/src/include/k5-queue.h
629
(((elm)->field.cqe_next == (void *)(head)) \
crypto/krb5/src/include/k5-queue.h
630
? ((head)->cqh_first) \
crypto/krb5/src/include/k5-queue.h
632
#define K5_CIRCLEQ_LOOP_PREV(head, elm, field) \
crypto/krb5/src/include/k5-queue.h
633
(((elm)->field.cqe_prev == (void *)(head)) \
crypto/krb5/src/include/k5-queue.h
634
? ((head)->cqh_last) \
crypto/krb5/src/include/k5-queue.h
98
#define K5_LIST_HEAD_INITIALIZER(head) \
crypto/krb5/src/kadmin/dbutil/dump.c
1072
char head[128];
crypto/krb5/src/kadmin/dbutil/dump.c
1077
nread = sscanf(buf, "%127s %u %u %u %u", head, &u[0], &u[1], &u[2], &u[3]);
crypto/krb5/src/kadmin/dbutil/dump.c
1081
if (!strcmp(head, ipropx_1_version.header)) {
crypto/krb5/src/kadmin/dbutil/dump.c
1094
} else if (!strcmp(head, iprop_version.header)) {
crypto/krb5/src/lib/crypto/crypto_tests/t_cksums.c
166
printhex(const char *head, void *data, size_t len)
crypto/krb5/src/lib/crypto/crypto_tests/t_cksums.c
170
printf("%s", head);
crypto/krb5/src/lib/crypto/crypto_tests/t_cksums.c
174
printf("\n%*s", (int)strlen(head), "");
crypto/krb5/src/lib/crypto/crypto_tests/t_decrypt.c
510
printhex(const char *head, void *data, size_t len)
crypto/krb5/src/lib/crypto/crypto_tests/t_decrypt.c
514
printf("%s", head);
crypto/krb5/src/lib/crypto/crypto_tests/t_decrypt.c
518
printf("\n%*s", (int)strlen(head), "");
crypto/krb5/src/lib/crypto/crypto_tests/t_derive.c
270
printhex(const char *head, void *data, size_t len)
crypto/krb5/src/lib/crypto/crypto_tests/t_derive.c
274
printf("%s", head);
crypto/krb5/src/lib/crypto/crypto_tests/t_derive.c
278
printf("\n%*s", (int)strlen(head), "");
crypto/krb5/src/lib/crypto/crypto_tests/t_str2key.c
442
printhex(const char *head, void *data, size_t len)
crypto/krb5/src/lib/crypto/crypto_tests/t_str2key.c
446
printf("%s", head);
crypto/krb5/src/lib/crypto/crypto_tests/t_str2key.c
450
printf("\n%*s", (int)strlen(head), "");
crypto/krb5/src/lib/krb5/os/dnssrv.c
131
struct srv_dns_entry *head = NULL, *srv = NULL;
crypto/krb5/src/lib/krb5/os/dnssrv.c
171
place_srv_entry(&head, srv);
crypto/krb5/src/lib/krb5/os/dnssrv.c
178
*answers = head;
crypto/krb5/src/lib/krb5/os/dnssrv.c
197
struct srv_dns_entry *head = NULL, *uri = NULL;
crypto/krb5/src/lib/krb5/os/dnssrv.c
241
place_srv_entry(&head, uri);
crypto/krb5/src/lib/krb5/os/dnssrv.c
247
*answers = head;
crypto/krb5/src/lib/krb5/os/dnssrv.c
269
struct srv_dns_entry *head = NULL, *srv = NULL;
crypto/krb5/src/lib/krb5/os/dnssrv.c
339
place_srv_entry(&head, srv);
crypto/krb5/src/lib/krb5/os/dnssrv.c
345
*answers = head;
crypto/krb5/src/lib/krb5/os/dnssrv.c
83
place_srv_entry(struct srv_dns_entry **head, struct srv_dns_entry *new)
crypto/krb5/src/lib/krb5/os/dnssrv.c
87
if (*head == NULL || (*head)->priority > new->priority) {
crypto/krb5/src/lib/krb5/os/dnssrv.c
88
new->next = *head;
crypto/krb5/src/lib/krb5/os/dnssrv.c
89
*head = new;
crypto/krb5/src/lib/krb5/os/dnssrv.c
93
for (entry = *head; entry != NULL; entry = entry->next) {
crypto/krb5/src/lib/krb5/os/locate_kdc.c
362
struct srv_dns_entry *head = NULL, *entry = NULL;
crypto/krb5/src/lib/krb5/os/locate_kdc.c
371
sitename, &head);
crypto/krb5/src/lib/krb5/os/locate_kdc.c
376
if (head == NULL)
crypto/krb5/src/lib/krb5/os/locate_kdc.c
380
if (head->next == NULL && head->host[0] == '\0') {
crypto/krb5/src/lib/krb5/os/locate_kdc.c
385
for (entry = head; entry != NULL; entry = entry->next) {
crypto/krb5/src/lib/krb5/os/locate_kdc.c
394
krb5int_free_srv_dns_data(head);
crypto/krb5/src/lib/rpc/pmap_getmaps.c
69
struct pmaplist *head = (struct pmaplist *)NULL;
crypto/krb5/src/lib/rpc/pmap_getmaps.c
81
(xdrproc_t)xdr_pmaplist, &head,
crypto/krb5/src/lib/rpc/pmap_getmaps.c
89
return (head);
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
100
(head)->lh_first = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
101
(elm)->field.le_prev = &(head)->lh_first; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
129
#define TAILQ_INIT(head) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
130
(head)->tqh_first = NULL; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
131
(head)->tqh_last = &(head)->tqh_first; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
134
#define TAILQ_INSERT_HEAD(head, elm, field) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
135
if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
139
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
140
(head)->tqh_first = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
141
(elm)->field.tqe_prev = &(head)->tqh_first; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
144
#define TAILQ_INSERT_TAIL(head, elm, field) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
146
(elm)->field.tqe_prev = (head)->tqh_last; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
147
*(head)->tqh_last = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
148
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
151
#define TAILQ_INSERT_AFTER(head, listelm, elm, field) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
156
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
161
#define TAILQ_REMOVE(head, elm, field) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
166
(head)->tqh_last = (elm)->field.tqe_prev; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
188
#define CIRCLEQ_INIT(head) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
189
(head)->cqh_first = (void *)(head); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
190
(head)->cqh_last = (void *)(head); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
193
#define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
196
if ((listelm)->field.cqe_next == (void *)(head)) \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
197
(head)->cqh_last = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
203
#define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
206
if ((listelm)->field.cqe_prev == (void *)(head)) \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
207
(head)->cqh_first = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
213
#define CIRCLEQ_INSERT_HEAD(head, elm, field) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
214
(elm)->field.cqe_next = (head)->cqh_first; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
215
(elm)->field.cqe_prev = (void *)(head); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
216
if ((head)->cqh_last == (void *)(head)) \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
217
(head)->cqh_last = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
219
(head)->cqh_first->field.cqe_prev = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
220
(head)->cqh_first = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
223
#define CIRCLEQ_INSERT_TAIL(head, elm, field) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
224
(elm)->field.cqe_next = (void *)(head); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
225
(elm)->field.cqe_prev = (head)->cqh_last; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
226
if ((head)->cqh_first == (void *)(head)) \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
227
(head)->cqh_first = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
229
(head)->cqh_last->field.cqe_next = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
230
(head)->cqh_last = (elm); \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
233
#define CIRCLEQ_REMOVE(head, elm, field) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
234
if ((elm)->field.cqe_next == (void *)(head)) \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
235
(head)->cqh_last = (elm)->field.cqe_prev; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
239
if ((elm)->field.cqe_prev == (void *)(head)) \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
240
(head)->cqh_first = (elm)->field.cqe_next; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
85
#define LIST_INIT(head) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
86
(head)->lh_first = NULL; \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
97
#define LIST_INSERT_HEAD(head, elm, field) { \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
98
if (((elm)->field.le_next = (head)->lh_first) != NULL) \
crypto/krb5/src/plugins/kdb/db2/libdb2/include/db-queue.h
99
(head)->lh_first->field.le_prev = &(elm)->field.le_next;\
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
111
struct _hqh *head;
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
136
head = &mp->hqh[HASHKEY(bp->pgno)];
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
137
TAILQ_INSERT_HEAD(head, bp, hq);
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
145
struct _hqh *head;
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
159
head = &mp->hqh[HASHKEY(bp->pgno)];
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
160
TAILQ_REMOVE(head, bp, hq);
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
174
struct _hqh *head;
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
196
head = &mp->hqh[HASHKEY(bp->pgno)];
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
197
TAILQ_REMOVE(head, bp, hq);
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
198
TAILQ_INSERT_HEAD(head, bp, hq);
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
251
head = &mp->hqh[HASHKEY(bp->pgno)];
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
252
TAILQ_INSERT_HEAD(head, bp, hq);
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
334
struct _hqh *head;
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
357
head = &mp->hqh[HASHKEY(bp->pgno)];
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
358
TAILQ_REMOVE(head, bp, hq);
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
434
struct _hqh *head;
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
437
head = &mp->hqh[HASHKEY(pgno)];
crypto/krb5/src/plugins/kdb/db2/libdb2/mpool/mpool.c
438
for (bp = head->tqh_first; bp != NULL; bp = bp->hq.tqe_next)
crypto/krb5/src/util/verto/ev.c
1768
WL head;
crypto/krb5/src/util/verto/ev.c
1795
WL head;
crypto/krb5/src/util/verto/ev.c
2043
for (w = (ev_io *)anfd->head; w; w = (ev_io *)((WL)w)->next)
crypto/krb5/src/util/verto/ev.c
2083
if (anfd->reify & EV__IOFDSET && anfd->head)
crypto/krb5/src/util/verto/ev.c
2117
for (w = (ev_io *)anfd->head; w; w = (ev_io *)((WL)w)->next)
crypto/krb5/src/util/verto/ev.c
2152
while ((w = (ev_io *)anfds [fd].head))
crypto/krb5/src/util/verto/ev.c
2379
WL head;
crypto/krb5/src/util/verto/ev.c
2597
for (w = signals [signum].head; w; w = w->next)
crypto/krb5/src/util/verto/ev.c
3154
for (w = w2 = anfds [i].head; w; w = w->next)
crypto/krb5/src/util/verto/ev.c
3760
wlist_add (WL *head, WL elem)
crypto/krb5/src/util/verto/ev.c
3762
elem->next = *head;
crypto/krb5/src/util/verto/ev.c
3763
*head = elem;
crypto/krb5/src/util/verto/ev.c
3767
wlist_del (WL *head, WL elem)
crypto/krb5/src/util/verto/ev.c
3769
while (*head)
crypto/krb5/src/util/verto/ev.c
3771
if (expect_true (*head == elem))
crypto/krb5/src/util/verto/ev.c
3773
*head = elem->next;
crypto/krb5/src/util/verto/ev.c
3777
head = &(*head)->next;
crypto/krb5/src/util/verto/ev.c
3850
wlist_add (&anfds[fd].head, (WL)w);
crypto/krb5/src/util/verto/ev.c
3872
wlist_del (&anfds[w->fd].head, (WL)w);
crypto/krb5/src/util/verto/ev.c
4090
wlist_add (&signals [w->signum - 1].head, (WL)w);
crypto/krb5/src/util/verto/ev.c
4132
wlist_del (&signals [w->signum - 1].head, (WL)w);
crypto/krb5/src/util/verto/ev.c
4135
if (!signals [w->signum - 1].head)
crypto/krb5/src/util/verto/ev.c
4282
wlist_add (&fs_hash [w->wd & ((EV_INOTIFY_HASHSIZE) - 1)].head, (WL)w);
crypto/krb5/src/util/verto/ev.c
4301
wlist_del (&fs_hash [slot].head, (WL)w);
crypto/krb5/src/util/verto/ev.c
4318
for (w_ = fs_hash [slot & ((EV_INOTIFY_HASHSIZE) - 1)].head; w_; )
crypto/krb5/src/util/verto/ev.c
4327
wlist_del (&fs_hash [slot & ((EV_INOTIFY_HASHSIZE) - 1)].head, (WL)w);
crypto/krb5/src/util/verto/ev.c
4421
WL w_ = fs_hash [slot].head;
crypto/krb5/src/util/verto/ev.c
4422
fs_hash [slot].head = 0;
crypto/krb5/src/util/verto/ev.c
4996
for (wl = anfds [i].head; wl; )
crypto/krb5/src/util/verto/ev.c
5078
for (wl = signals [i].head; wl; )
crypto/openssh/openbsd-compat/getrrsetbyname.c
459
struct dns_query *head, *curr, *prev;
crypto/openssh/openbsd-compat/getrrsetbyname.c
469
for (i = 1, head = NULL, prev = NULL; i <= count; i++, prev = curr) {
crypto/openssh/openbsd-compat/getrrsetbyname.c
472
free_dns_query(head);
crypto/openssh/openbsd-compat/getrrsetbyname.c
479
if (head == NULL)
crypto/openssh/openbsd-compat/getrrsetbyname.c
480
head = curr;
crypto/openssh/openbsd-compat/getrrsetbyname.c
488
free_dns_query(head);
crypto/openssh/openbsd-compat/getrrsetbyname.c
493
free_dns_query(head);
crypto/openssh/openbsd-compat/getrrsetbyname.c
511
return (head);
crypto/openssh/openbsd-compat/getrrsetbyname.c
518
struct dns_rr *head, *curr, *prev;
crypto/openssh/openbsd-compat/getrrsetbyname.c
528
for (i = 1, head = NULL, prev = NULL; i <= count; i++, prev = curr) {
crypto/openssh/openbsd-compat/getrrsetbyname.c
531
free_dns_rr(head);
crypto/openssh/openbsd-compat/getrrsetbyname.c
539
if (head == NULL)
crypto/openssh/openbsd-compat/getrrsetbyname.c
540
head = curr;
crypto/openssh/openbsd-compat/getrrsetbyname.c
548
free_dns_rr(head);
crypto/openssh/openbsd-compat/getrrsetbyname.c
553
free_dns_rr(head);
crypto/openssh/openbsd-compat/getrrsetbyname.c
583
free_dns_rr(head);
crypto/openssh/openbsd-compat/getrrsetbyname.c
592
return (head);
crypto/openssh/openbsd-compat/sys-queue.h
191
#define SLIST_HEAD_INITIALIZER(head) \
crypto/openssh/openbsd-compat/sys-queue.h
202
#define SLIST_FIRST(head) ((head)->slh_first)
crypto/openssh/openbsd-compat/sys-queue.h
203
#define SLIST_END(head) NULL
crypto/openssh/openbsd-compat/sys-queue.h
204
#define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head))
crypto/openssh/openbsd-compat/sys-queue.h
207
#define SLIST_FOREACH(var, head, field) \
crypto/openssh/openbsd-compat/sys-queue.h
208
for((var) = SLIST_FIRST(head); \
crypto/openssh/openbsd-compat/sys-queue.h
209
(var) != SLIST_END(head); \
crypto/openssh/openbsd-compat/sys-queue.h
212
#define SLIST_FOREACH_SAFE(var, head, field, tvar) \
crypto/openssh/openbsd-compat/sys-queue.h
213
for ((var) = SLIST_FIRST(head); \
crypto/openssh/openbsd-compat/sys-queue.h
220
#define SLIST_INIT(head) { \
crypto/openssh/openbsd-compat/sys-queue.h
221
SLIST_FIRST(head) = SLIST_END(head); \
crypto/openssh/openbsd-compat/sys-queue.h
229
#define SLIST_INSERT_HEAD(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
230
(elm)->field.sle_next = (head)->slh_first; \
crypto/openssh/openbsd-compat/sys-queue.h
231
(head)->slh_first = (elm); \
crypto/openssh/openbsd-compat/sys-queue.h
238
#define SLIST_REMOVE_HEAD(head, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
239
(head)->slh_first = (head)->slh_first->field.sle_next; \
crypto/openssh/openbsd-compat/sys-queue.h
242
#define SLIST_REMOVE(head, elm, type, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
243
if ((head)->slh_first == (elm)) { \
crypto/openssh/openbsd-compat/sys-queue.h
244
SLIST_REMOVE_HEAD((head), field); \
crypto/openssh/openbsd-compat/sys-queue.h
246
struct type *curelm = (head)->slh_first; \
crypto/openssh/openbsd-compat/sys-queue.h
264
#define LIST_HEAD_INITIALIZER(head) \
crypto/openssh/openbsd-compat/sys-queue.h
276
#define LIST_FIRST(head) ((head)->lh_first)
crypto/openssh/openbsd-compat/sys-queue.h
277
#define LIST_END(head) NULL
crypto/openssh/openbsd-compat/sys-queue.h
278
#define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head))
crypto/openssh/openbsd-compat/sys-queue.h
281
#define LIST_FOREACH(var, head, field) \
crypto/openssh/openbsd-compat/sys-queue.h
282
for((var) = LIST_FIRST(head); \
crypto/openssh/openbsd-compat/sys-queue.h
283
(var)!= LIST_END(head); \
crypto/openssh/openbsd-compat/sys-queue.h
286
#define LIST_FOREACH_SAFE(var, head, field, tvar) \
crypto/openssh/openbsd-compat/sys-queue.h
287
for ((var) = LIST_FIRST(head); \
crypto/openssh/openbsd-compat/sys-queue.h
294
#define LIST_INIT(head) do { \
crypto/openssh/openbsd-compat/sys-queue.h
295
LIST_FIRST(head) = LIST_END(head); \
crypto/openssh/openbsd-compat/sys-queue.h
313
#define LIST_INSERT_HEAD(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
314
if (((elm)->field.le_next = (head)->lh_first) != NULL) \
crypto/openssh/openbsd-compat/sys-queue.h
315
(head)->lh_first->field.le_prev = &(elm)->field.le_next;\
crypto/openssh/openbsd-compat/sys-queue.h
316
(head)->lh_first = (elm); \
crypto/openssh/openbsd-compat/sys-queue.h
317
(elm)->field.le_prev = &(head)->lh_first; \
crypto/openssh/openbsd-compat/sys-queue.h
348
#define SIMPLEQ_HEAD_INITIALIZER(head) \
crypto/openssh/openbsd-compat/sys-queue.h
349
{ NULL, &(head).sqh_first }
crypto/openssh/openbsd-compat/sys-queue.h
359
#define SIMPLEQ_FIRST(head) ((head)->sqh_first)
crypto/openssh/openbsd-compat/sys-queue.h
360
#define SIMPLEQ_END(head) NULL
crypto/openssh/openbsd-compat/sys-queue.h
361
#define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head))
crypto/openssh/openbsd-compat/sys-queue.h
364
#define SIMPLEQ_FOREACH(var, head, field) \
crypto/openssh/openbsd-compat/sys-queue.h
365
for((var) = SIMPLEQ_FIRST(head); \
crypto/openssh/openbsd-compat/sys-queue.h
366
(var) != SIMPLEQ_END(head); \
crypto/openssh/openbsd-compat/sys-queue.h
369
#define SIMPLEQ_FOREACH_SAFE(var, head, field, tvar) \
crypto/openssh/openbsd-compat/sys-queue.h
370
for ((var) = SIMPLEQ_FIRST(head); \
crypto/openssh/openbsd-compat/sys-queue.h
377
#define SIMPLEQ_INIT(head) do { \
crypto/openssh/openbsd-compat/sys-queue.h
378
(head)->sqh_first = NULL; \
crypto/openssh/openbsd-compat/sys-queue.h
379
(head)->sqh_last = &(head)->sqh_first; \
crypto/openssh/openbsd-compat/sys-queue.h
382
#define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
383
if (((elm)->field.sqe_next = (head)->sqh_first) == NULL) \
crypto/openssh/openbsd-compat/sys-queue.h
384
(head)->sqh_last = &(elm)->field.sqe_next; \
crypto/openssh/openbsd-compat/sys-queue.h
385
(head)->sqh_first = (elm); \
crypto/openssh/openbsd-compat/sys-queue.h
388
#define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
390
*(head)->sqh_last = (elm); \
crypto/openssh/openbsd-compat/sys-queue.h
391
(head)->sqh_last = &(elm)->field.sqe_next; \
crypto/openssh/openbsd-compat/sys-queue.h
394
#define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
396
(head)->sqh_last = &(elm)->field.sqe_next; \
crypto/openssh/openbsd-compat/sys-queue.h
400
#define SIMPLEQ_REMOVE_HEAD(head, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
401
if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \
crypto/openssh/openbsd-compat/sys-queue.h
402
(head)->sqh_last = &(head)->sqh_first; \
crypto/openssh/openbsd-compat/sys-queue.h
405
#define SIMPLEQ_REMOVE_AFTER(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
408
(head)->sqh_last = &(elm)->field.sqe_next; \
crypto/openssh/openbsd-compat/sys-queue.h
437
#define XSIMPLEQ_XOR(head, ptr) ((__typeof(ptr))((head)->sqx_cookie ^ \
crypto/openssh/openbsd-compat/sys-queue.h
439
#define XSIMPLEQ_FIRST(head) XSIMPLEQ_XOR(head, ((head)->sqx_first))
crypto/openssh/openbsd-compat/sys-queue.h
440
#define XSIMPLEQ_END(head) NULL
crypto/openssh/openbsd-compat/sys-queue.h
441
#define XSIMPLEQ_EMPTY(head) (XSIMPLEQ_FIRST(head) == XSIMPLEQ_END(head))
crypto/openssh/openbsd-compat/sys-queue.h
442
#define XSIMPLEQ_NEXT(head, elm, field) XSIMPLEQ_XOR(head, ((elm)->field.sqx_next))
crypto/openssh/openbsd-compat/sys-queue.h
445
#define XSIMPLEQ_FOREACH(var, head, field) \
crypto/openssh/openbsd-compat/sys-queue.h
446
for ((var) = XSIMPLEQ_FIRST(head); \
crypto/openssh/openbsd-compat/sys-queue.h
447
(var) != XSIMPLEQ_END(head); \
crypto/openssh/openbsd-compat/sys-queue.h
448
(var) = XSIMPLEQ_NEXT(head, var, field))
crypto/openssh/openbsd-compat/sys-queue.h
450
#define XSIMPLEQ_FOREACH_SAFE(var, head, field, tvar) \
crypto/openssh/openbsd-compat/sys-queue.h
451
for ((var) = XSIMPLEQ_FIRST(head); \
crypto/openssh/openbsd-compat/sys-queue.h
452
(var) && ((tvar) = XSIMPLEQ_NEXT(head, var, field), 1); \
crypto/openssh/openbsd-compat/sys-queue.h
458
#define XSIMPLEQ_INIT(head) do { \
crypto/openssh/openbsd-compat/sys-queue.h
459
arc4random_buf(&(head)->sqx_cookie, sizeof((head)->sqx_cookie)); \
crypto/openssh/openbsd-compat/sys-queue.h
460
(head)->sqx_first = XSIMPLEQ_XOR(head, NULL); \
crypto/openssh/openbsd-compat/sys-queue.h
461
(head)->sqx_last = XSIMPLEQ_XOR(head, &(head)->sqx_first); \
crypto/openssh/openbsd-compat/sys-queue.h
464
#define XSIMPLEQ_INSERT_HEAD(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
465
if (((elm)->field.sqx_next = (head)->sqx_first) == \
crypto/openssh/openbsd-compat/sys-queue.h
466
XSIMPLEQ_XOR(head, NULL)) \
crypto/openssh/openbsd-compat/sys-queue.h
467
(head)->sqx_last = XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \
crypto/openssh/openbsd-compat/sys-queue.h
468
(head)->sqx_first = XSIMPLEQ_XOR(head, (elm)); \
crypto/openssh/openbsd-compat/sys-queue.h
471
#define XSIMPLEQ_INSERT_TAIL(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
472
(elm)->field.sqx_next = XSIMPLEQ_XOR(head, NULL); \
crypto/openssh/openbsd-compat/sys-queue.h
473
*(XSIMPLEQ_XOR(head, (head)->sqx_last)) = XSIMPLEQ_XOR(head, (elm)); \
crypto/openssh/openbsd-compat/sys-queue.h
474
(head)->sqx_last = XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \
crypto/openssh/openbsd-compat/sys-queue.h
477
#define XSIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
479
XSIMPLEQ_XOR(head, NULL)) \
crypto/openssh/openbsd-compat/sys-queue.h
480
(head)->sqx_last = XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \
crypto/openssh/openbsd-compat/sys-queue.h
481
(listelm)->field.sqx_next = XSIMPLEQ_XOR(head, (elm)); \
crypto/openssh/openbsd-compat/sys-queue.h
484
#define XSIMPLEQ_REMOVE_HEAD(head, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
485
if (((head)->sqx_first = XSIMPLEQ_XOR(head, \
crypto/openssh/openbsd-compat/sys-queue.h
486
(head)->sqx_first)->field.sqx_next) == XSIMPLEQ_XOR(head, NULL)) \
crypto/openssh/openbsd-compat/sys-queue.h
487
(head)->sqx_last = XSIMPLEQ_XOR(head, &(head)->sqx_first); \
crypto/openssh/openbsd-compat/sys-queue.h
490
#define XSIMPLEQ_REMOVE_AFTER(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
491
if (((elm)->field.sqx_next = XSIMPLEQ_XOR(head, \
crypto/openssh/openbsd-compat/sys-queue.h
493
== XSIMPLEQ_XOR(head, NULL)) \
crypto/openssh/openbsd-compat/sys-queue.h
494
(head)->sqx_last = \
crypto/openssh/openbsd-compat/sys-queue.h
495
XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \
crypto/openssh/openbsd-compat/sys-queue.h
508
#define TAILQ_HEAD_INITIALIZER(head) \
crypto/openssh/openbsd-compat/sys-queue.h
509
{ NULL, &(head).tqh_first }
crypto/openssh/openbsd-compat/sys-queue.h
520
#define TAILQ_FIRST(head) ((head)->tqh_first)
crypto/openssh/openbsd-compat/sys-queue.h
521
#define TAILQ_END(head) NULL
crypto/openssh/openbsd-compat/sys-queue.h
523
#define TAILQ_LAST(head, headname) \
crypto/openssh/openbsd-compat/sys-queue.h
524
(*(((struct headname *)((head)->tqh_last))->tqh_last))
crypto/openssh/openbsd-compat/sys-queue.h
528
#define TAILQ_EMPTY(head) \
crypto/openssh/openbsd-compat/sys-queue.h
529
(TAILQ_FIRST(head) == TAILQ_END(head))
crypto/openssh/openbsd-compat/sys-queue.h
531
#define TAILQ_FOREACH(var, head, field) \
crypto/openssh/openbsd-compat/sys-queue.h
532
for((var) = TAILQ_FIRST(head); \
crypto/openssh/openbsd-compat/sys-queue.h
533
(var) != TAILQ_END(head); \
crypto/openssh/openbsd-compat/sys-queue.h
536
#define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
crypto/openssh/openbsd-compat/sys-queue.h
537
for ((var) = TAILQ_FIRST(head); \
crypto/openssh/openbsd-compat/sys-queue.h
538
(var) != TAILQ_END(head) && \
crypto/openssh/openbsd-compat/sys-queue.h
543
#define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
crypto/openssh/openbsd-compat/sys-queue.h
544
for((var) = TAILQ_LAST(head, headname); \
crypto/openssh/openbsd-compat/sys-queue.h
545
(var) != TAILQ_END(head); \
crypto/openssh/openbsd-compat/sys-queue.h
548
#define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
crypto/openssh/openbsd-compat/sys-queue.h
549
for ((var) = TAILQ_LAST(head, headname); \
crypto/openssh/openbsd-compat/sys-queue.h
550
(var) != TAILQ_END(head) && \
crypto/openssh/openbsd-compat/sys-queue.h
557
#define TAILQ_INIT(head) do { \
crypto/openssh/openbsd-compat/sys-queue.h
558
(head)->tqh_first = NULL; \
crypto/openssh/openbsd-compat/sys-queue.h
559
(head)->tqh_last = &(head)->tqh_first; \
crypto/openssh/openbsd-compat/sys-queue.h
562
#define TAILQ_INSERT_HEAD(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
563
if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
crypto/openssh/openbsd-compat/sys-queue.h
564
(head)->tqh_first->field.tqe_prev = \
crypto/openssh/openbsd-compat/sys-queue.h
567
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/openssh/openbsd-compat/sys-queue.h
568
(head)->tqh_first = (elm); \
crypto/openssh/openbsd-compat/sys-queue.h
569
(elm)->field.tqe_prev = &(head)->tqh_first; \
crypto/openssh/openbsd-compat/sys-queue.h
572
#define TAILQ_INSERT_TAIL(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
574
(elm)->field.tqe_prev = (head)->tqh_last; \
crypto/openssh/openbsd-compat/sys-queue.h
575
*(head)->tqh_last = (elm); \
crypto/openssh/openbsd-compat/sys-queue.h
576
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/openssh/openbsd-compat/sys-queue.h
579
#define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
584
(head)->tqh_last = &(elm)->field.tqe_next; \
crypto/openssh/openbsd-compat/sys-queue.h
596
#define TAILQ_REMOVE(head, elm, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
601
(head)->tqh_last = (elm)->field.tqe_prev; \
crypto/openssh/openbsd-compat/sys-queue.h
607
#define TAILQ_REPLACE(head, elm, elm2, field) do { \
crypto/openssh/openbsd-compat/sys-queue.h
612
(head)->tqh_last = &(elm2)->field.tqe_next; \
crypto/openssh/openbsd-compat/sys-tree.h
100
#define SPLAY_LINKLEFT(head, tmp, field) do { \
crypto/openssh/openbsd-compat/sys-tree.h
101
SPLAY_LEFT(tmp, field) = (head)->sph_root; \
crypto/openssh/openbsd-compat/sys-tree.h
102
tmp = (head)->sph_root; \
crypto/openssh/openbsd-compat/sys-tree.h
103
(head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
crypto/openssh/openbsd-compat/sys-tree.h
106
#define SPLAY_LINKRIGHT(head, tmp, field) do { \
crypto/openssh/openbsd-compat/sys-tree.h
107
SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
crypto/openssh/openbsd-compat/sys-tree.h
108
tmp = (head)->sph_root; \
crypto/openssh/openbsd-compat/sys-tree.h
109
(head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
crypto/openssh/openbsd-compat/sys-tree.h
112
#define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
crypto/openssh/openbsd-compat/sys-tree.h
113
SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
crypto/openssh/openbsd-compat/sys-tree.h
114
SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
crypto/openssh/openbsd-compat/sys-tree.h
115
SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
crypto/openssh/openbsd-compat/sys-tree.h
116
SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
crypto/openssh/openbsd-compat/sys-tree.h
129
name##_SPLAY_FIND(struct name *head, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
131
if (SPLAY_EMPTY(head)) \
crypto/openssh/openbsd-compat/sys-tree.h
133
name##_SPLAY(head, elm); \
crypto/openssh/openbsd-compat/sys-tree.h
134
if ((cmp)(elm, (head)->sph_root) == 0) \
crypto/openssh/openbsd-compat/sys-tree.h
135
return (head->sph_root); \
crypto/openssh/openbsd-compat/sys-tree.h
140
name##_SPLAY_NEXT(struct name *head, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
142
name##_SPLAY(head, elm); \
crypto/openssh/openbsd-compat/sys-tree.h
154
name##_SPLAY_MIN_MAX(struct name *head, int val) \
crypto/openssh/openbsd-compat/sys-tree.h
156
name##_SPLAY_MINMAX(head, val); \
crypto/openssh/openbsd-compat/sys-tree.h
157
return (SPLAY_ROOT(head)); \
crypto/openssh/openbsd-compat/sys-tree.h
165
name##_SPLAY_INSERT(struct name *head, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
167
if (SPLAY_EMPTY(head)) { \
crypto/openssh/openbsd-compat/sys-tree.h
171
name##_SPLAY(head, elm); \
crypto/openssh/openbsd-compat/sys-tree.h
172
__comp = (cmp)(elm, (head)->sph_root); \
crypto/openssh/openbsd-compat/sys-tree.h
174
SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
crypto/openssh/openbsd-compat/sys-tree.h
175
SPLAY_RIGHT(elm, field) = (head)->sph_root; \
crypto/openssh/openbsd-compat/sys-tree.h
176
SPLAY_LEFT((head)->sph_root, field) = NULL; \
crypto/openssh/openbsd-compat/sys-tree.h
178
SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
crypto/openssh/openbsd-compat/sys-tree.h
179
SPLAY_LEFT(elm, field) = (head)->sph_root; \
crypto/openssh/openbsd-compat/sys-tree.h
180
SPLAY_RIGHT((head)->sph_root, field) = NULL; \
crypto/openssh/openbsd-compat/sys-tree.h
182
return ((head)->sph_root); \
crypto/openssh/openbsd-compat/sys-tree.h
184
(head)->sph_root = (elm); \
crypto/openssh/openbsd-compat/sys-tree.h
189
name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
192
if (SPLAY_EMPTY(head)) \
crypto/openssh/openbsd-compat/sys-tree.h
194
name##_SPLAY(head, elm); \
crypto/openssh/openbsd-compat/sys-tree.h
195
if ((cmp)(elm, (head)->sph_root) == 0) { \
crypto/openssh/openbsd-compat/sys-tree.h
196
if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
crypto/openssh/openbsd-compat/sys-tree.h
197
(head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
crypto/openssh/openbsd-compat/sys-tree.h
199
__tmp = SPLAY_RIGHT((head)->sph_root, field); \
crypto/openssh/openbsd-compat/sys-tree.h
200
(head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
crypto/openssh/openbsd-compat/sys-tree.h
201
name##_SPLAY(head, elm); \
crypto/openssh/openbsd-compat/sys-tree.h
202
SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
crypto/openssh/openbsd-compat/sys-tree.h
210
name##_SPLAY(struct name *head, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
218
while ((__comp = (cmp)(elm, (head)->sph_root))) { \
crypto/openssh/openbsd-compat/sys-tree.h
220
__tmp = SPLAY_LEFT((head)->sph_root, field); \
crypto/openssh/openbsd-compat/sys-tree.h
224
SPLAY_ROTATE_RIGHT(head, __tmp, field); \
crypto/openssh/openbsd-compat/sys-tree.h
225
if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
crypto/openssh/openbsd-compat/sys-tree.h
228
SPLAY_LINKLEFT(head, __right, field); \
crypto/openssh/openbsd-compat/sys-tree.h
230
__tmp = SPLAY_RIGHT((head)->sph_root, field); \
crypto/openssh/openbsd-compat/sys-tree.h
234
SPLAY_ROTATE_LEFT(head, __tmp, field); \
crypto/openssh/openbsd-compat/sys-tree.h
235
if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
crypto/openssh/openbsd-compat/sys-tree.h
238
SPLAY_LINKRIGHT(head, __left, field); \
crypto/openssh/openbsd-compat/sys-tree.h
241
SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
crypto/openssh/openbsd-compat/sys-tree.h
247
void name##_SPLAY_MINMAX(struct name *head, int __comp) \
crypto/openssh/openbsd-compat/sys-tree.h
256
__tmp = SPLAY_LEFT((head)->sph_root, field); \
crypto/openssh/openbsd-compat/sys-tree.h
260
SPLAY_ROTATE_RIGHT(head, __tmp, field); \
crypto/openssh/openbsd-compat/sys-tree.h
261
if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
crypto/openssh/openbsd-compat/sys-tree.h
264
SPLAY_LINKLEFT(head, __right, field); \
crypto/openssh/openbsd-compat/sys-tree.h
266
__tmp = SPLAY_RIGHT((head)->sph_root, field); \
crypto/openssh/openbsd-compat/sys-tree.h
270
SPLAY_ROTATE_LEFT(head, __tmp, field); \
crypto/openssh/openbsd-compat/sys-tree.h
271
if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
crypto/openssh/openbsd-compat/sys-tree.h
274
SPLAY_LINKRIGHT(head, __left, field); \
crypto/openssh/openbsd-compat/sys-tree.h
277
SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
crypto/openssh/openbsd-compat/sys-tree.h
292
#define SPLAY_FOREACH(x, name, head) \
crypto/openssh/openbsd-compat/sys-tree.h
293
for ((x) = SPLAY_MIN(name, head); \
crypto/openssh/openbsd-compat/sys-tree.h
295
(x) = SPLAY_NEXT(name, head, x))
crypto/openssh/openbsd-compat/sys-tree.h
324
#define RB_ROOT(head) (head)->rbh_root
crypto/openssh/openbsd-compat/sys-tree.h
325
#define RB_EMPTY(head) (RB_ROOT(head) == NULL)
crypto/openssh/openbsd-compat/sys-tree.h
342
#define RB_ROTATE_LEFT(head, elm, tmp, field) do { \
crypto/openssh/openbsd-compat/sys-tree.h
354
(head)->rbh_root = (tmp); \
crypto/openssh/openbsd-compat/sys-tree.h
362
#define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \
crypto/openssh/openbsd-compat/sys-tree.h
374
(head)->rbh_root = (tmp); \
crypto/openssh/openbsd-compat/sys-tree.h
408
name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
423
RB_ROTATE_LEFT(head, parent, tmp, field);\
crypto/openssh/openbsd-compat/sys-tree.h
429
RB_ROTATE_RIGHT(head, gparent, tmp, field); \
crypto/openssh/openbsd-compat/sys-tree.h
439
RB_ROTATE_RIGHT(head, parent, tmp, field);\
crypto/openssh/openbsd-compat/sys-tree.h
445
RB_ROTATE_LEFT(head, gparent, tmp, field); \
crypto/openssh/openbsd-compat/sys-tree.h
448
RB_COLOR(head->rbh_root, field) = RB_BLACK; \
crypto/openssh/openbsd-compat/sys-tree.h
452
name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
456
elm != RB_ROOT(head)) { \
crypto/openssh/openbsd-compat/sys-tree.h
461
RB_ROTATE_LEFT(head, parent, tmp, field);\
crypto/openssh/openbsd-compat/sys-tree.h
478
RB_ROTATE_RIGHT(head, tmp, oleft, field);\
crypto/openssh/openbsd-compat/sys-tree.h
485
RB_ROTATE_LEFT(head, parent, tmp, field);\
crypto/openssh/openbsd-compat/sys-tree.h
486
elm = RB_ROOT(head); \
crypto/openssh/openbsd-compat/sys-tree.h
493
RB_ROTATE_RIGHT(head, parent, tmp, field);\
crypto/openssh/openbsd-compat/sys-tree.h
510
RB_ROTATE_LEFT(head, tmp, oright, field);\
crypto/openssh/openbsd-compat/sys-tree.h
517
RB_ROTATE_RIGHT(head, parent, tmp, field);\
crypto/openssh/openbsd-compat/sys-tree.h
518
elm = RB_ROOT(head); \
crypto/openssh/openbsd-compat/sys-tree.h
528
name##_RB_REMOVE(struct name *head, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
553
RB_ROOT(head) = child; \
crypto/openssh/openbsd-compat/sys-tree.h
564
RB_ROOT(head) = elm; \
crypto/openssh/openbsd-compat/sys-tree.h
587
RB_ROOT(head) = child; \
crypto/openssh/openbsd-compat/sys-tree.h
590
name##_RB_REMOVE_COLOR(head, parent, child); \
crypto/openssh/openbsd-compat/sys-tree.h
596
name##_RB_INSERT(struct name *head, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
601
tmp = RB_ROOT(head); \
crypto/openssh/openbsd-compat/sys-tree.h
620
RB_ROOT(head) = elm; \
crypto/openssh/openbsd-compat/sys-tree.h
621
name##_RB_INSERT_COLOR(head, elm); \
crypto/openssh/openbsd-compat/sys-tree.h
627
name##_RB_FIND(struct name *head, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
629
struct type *tmp = RB_ROOT(head); \
crypto/openssh/openbsd-compat/sys-tree.h
645
name##_RB_NFIND(struct name *head, struct type *elm) \
crypto/openssh/openbsd-compat/sys-tree.h
647
struct type *tmp = RB_ROOT(head); \
crypto/openssh/openbsd-compat/sys-tree.h
709
name##_RB_MINMAX(struct name *head, int val) \
crypto/openssh/openbsd-compat/sys-tree.h
711
struct type *tmp = RB_ROOT(head); \
crypto/openssh/openbsd-compat/sys-tree.h
735
#define RB_FOREACH(x, name, head) \
crypto/openssh/openbsd-compat/sys-tree.h
736
for ((x) = RB_MIN(name, head); \
crypto/openssh/openbsd-compat/sys-tree.h
740
#define RB_FOREACH_SAFE(x, name, head, y) \
crypto/openssh/openbsd-compat/sys-tree.h
741
for ((x) = RB_MIN(name, head); \
crypto/openssh/openbsd-compat/sys-tree.h
745
#define RB_FOREACH_REVERSE(x, name, head) \
crypto/openssh/openbsd-compat/sys-tree.h
746
for ((x) = RB_MAX(name, head); \
crypto/openssh/openbsd-compat/sys-tree.h
750
#define RB_FOREACH_REVERSE_SAFE(x, name, head, y) \
crypto/openssh/openbsd-compat/sys-tree.h
751
for ((x) = RB_MAX(name, head); \
crypto/openssh/openbsd-compat/sys-tree.h
84
#define SPLAY_ROOT(head) (head)->sph_root
crypto/openssh/openbsd-compat/sys-tree.h
85
#define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
crypto/openssh/openbsd-compat/sys-tree.h
88
#define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
crypto/openssh/openbsd-compat/sys-tree.h
89
SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
crypto/openssh/openbsd-compat/sys-tree.h
90
SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
crypto/openssh/openbsd-compat/sys-tree.h
91
(head)->sph_root = tmp; \
crypto/openssh/openbsd-compat/sys-tree.h
94
#define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
crypto/openssh/openbsd-compat/sys-tree.h
95
SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
crypto/openssh/openbsd-compat/sys-tree.h
96
SPLAY_LEFT(tmp, field) = (head)->sph_root; \
crypto/openssh/openbsd-compat/sys-tree.h
97
(head)->sph_root = tmp; \
crypto/openssl/crypto/bn/bn_ctx.c
165
BN_POOL_ITEM *pool = ctx->pool.head;
crypto/openssl/crypto/bn/bn_ctx.c
296
p->head = p->current = p->tail = NULL;
crypto/openssl/crypto/bn/bn_ctx.c
305
while (p->head) {
crypto/openssl/crypto/bn/bn_ctx.c
306
for (loop = 0, bn = p->head->vals; loop++ < BN_CTX_POOL_SIZE; bn++)
crypto/openssl/crypto/bn/bn_ctx.c
309
p->current = p->head->next;
crypto/openssl/crypto/bn/bn_ctx.c
310
OPENSSL_free(p->head);
crypto/openssl/crypto/bn/bn_ctx.c
311
p->head = p->current;
crypto/openssl/crypto/bn/bn_ctx.c
33
BN_POOL_ITEM *head, *current, *tail;
crypto/openssl/crypto/bn/bn_ctx.c
334
if (p->head == NULL)
crypto/openssl/crypto/bn/bn_ctx.c
335
p->head = p->current = p->tail = item;
crypto/openssl/crypto/bn/bn_ctx.c
348
p->current = p->head;
crypto/openssl/crypto/bn/bn_ctx.c
85
BN_POOL_ITEM *item = ctx->pool.head;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
33
SHA_CTX head, tail, md;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
554
key->md = key->head;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
782
SHA1_Init(&key->head);
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
783
SHA1_Update(&key->head, ptr, arg);
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
784
SHA1_Final(hmac_key, &key->head);
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
791
SHA1_Init(&key->head);
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
792
SHA1_Update(&key->head, hmac_key, sizeof(hmac_key));
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
821
key->md = key->head;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
84
SHA1_Init(&key->head); /* handy when benchmarking */
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
85
key->tail = key->head;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
86
key->md = key->head;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha1.c
861
key->md = key->head;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
33
SHA256_CTX head, tail, md;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
558
key->md = key->head;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
755
SHA256_Init(&key->head);
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
756
SHA256_Update(&key->head, ptr, arg);
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
757
SHA256_Final(hmac_key, &key->head);
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
764
SHA256_Init(&key->head);
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
765
SHA256_Update(&key->head, hmac_key, sizeof(hmac_key));
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
79
SHA256_Init(&key->head); /* handy when benchmarking */
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
794
key->md = key->head;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
80
key->tail = key->head;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
81
key->md = key->head;
crypto/openssl/crypto/evp/e_aes_cbc_hmac_sha256.c
837
key->md = key->head;
crypto/openssl/crypto/evp/e_rc4_hmac_md5.c
195
MD5_Init(&key->head);
crypto/openssl/crypto/evp/e_rc4_hmac_md5.c
196
MD5_Update(&key->head, ptr, arg);
crypto/openssl/crypto/evp/e_rc4_hmac_md5.c
197
MD5_Final(hmac_key, &key->head);
crypto/openssl/crypto/evp/e_rc4_hmac_md5.c
204
MD5_Init(&key->head);
crypto/openssl/crypto/evp/e_rc4_hmac_md5.c
205
MD5_Update(&key->head, hmac_key, sizeof(hmac_key));
crypto/openssl/crypto/evp/e_rc4_hmac_md5.c
233
key->md = key->head;
crypto/openssl/crypto/evp/e_rc4_hmac_md5.c
33
MD5_CTX head, tail, md;
crypto/openssl/crypto/evp/e_rc4_hmac_md5.c
56
MD5_Init(&key->head); /* handy when benchmarking */
crypto/openssl/crypto/evp/e_rc4_hmac_md5.c
57
key->tail = key->head;
crypto/openssl/crypto/evp/e_rc4_hmac_md5.c
58
key->md = key->head;
crypto/openssl/include/internal/quic_sf_list.h
43
STREAM_FRAME *head, *tail;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha.h
55
SHA_CTX head, tail, md;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha.h
60
SHA256_CTX head, tail, md;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
494
sctx->md = sctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
57
SHA1_Init(&sctx->head); /* handy when benchmarking */
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
58
sctx->tail = sctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
59
sctx->md = sctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
638
SHA1_Init(&ctx->head);
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
639
sha1_update(&ctx->head, mac, len);
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
640
SHA1_Final(hmac_key, &ctx->head);
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
647
SHA1_Init(&ctx->head);
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
648
sha1_update(&ctx->head, hmac_key, sizeof(hmac_key));
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
681
sctx->md = sctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha1_hw.c
733
sctx->md = sctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
530
sctx->md = sctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
59
SHA256_Init(&sctx->head); /* handy when benchmarking */
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
60
sctx->tail = sctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
61
sctx->md = sctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
690
SHA256_Init(&ctx->head);
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
691
sha256_update(&ctx->head, mackey, len);
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
692
SHA256_Final(hmac_key, &ctx->head);
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
699
SHA256_Init(&ctx->head);
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
700
sha256_update(&ctx->head, hmac_key, sizeof(hmac_key));
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
733
sctx->md = sctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_aes_cbc_hmac_sha256_hw.c
784
sctx->md = sctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_rc4_hmac_md5.h
20
MD5_CTX head, tail, md;
crypto/openssl/providers/implementations/ciphers/cipher_rc4_hmac_md5_hw.c
184
ctx->md = ctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_rc4_hmac_md5_hw.c
201
MD5_Init(&ctx->head);
crypto/openssl/providers/implementations/ciphers/cipher_rc4_hmac_md5_hw.c
202
MD5_Update(&ctx->head, key, len);
crypto/openssl/providers/implementations/ciphers/cipher_rc4_hmac_md5_hw.c
203
MD5_Final(hmac_key, &ctx->head);
crypto/openssl/providers/implementations/ciphers/cipher_rc4_hmac_md5_hw.c
210
MD5_Init(&ctx->head);
crypto/openssl/providers/implementations/ciphers/cipher_rc4_hmac_md5_hw.c
211
MD5_Update(&ctx->head, hmac_key, sizeof(hmac_key));
crypto/openssl/providers/implementations/ciphers/cipher_rc4_hmac_md5_hw.c
41
MD5_Init(&ctx->head); /* handy when benchmarking */
crypto/openssl/providers/implementations/ciphers/cipher_rc4_hmac_md5_hw.c
42
ctx->tail = ctx->head;
crypto/openssl/providers/implementations/ciphers/cipher_rc4_hmac_md5_hw.c
43
ctx->md = ctx->head;
crypto/openssl/ssl/quic/quic_cfq.c
101
if (l->head == n)
crypto/openssl/ssl/quic/quic_cfq.c
102
l->head = n->next;
crypto/openssl/ssl/quic/quic_cfq.c
114
n->next = l->head;
crypto/openssl/ssl/quic/quic_cfq.c
116
l->head = n;
crypto/openssl/ssl/quic/quic_cfq.c
130
if (l->head == NULL)
crypto/openssl/ssl/quic/quic_cfq.c
131
l->head = n;
crypto/openssl/ssl/quic/quic_cfq.c
151
QUIC_CFQ_ITEM_EX *p = l->head, *pprev = NULL;
crypto/openssl/ssl/quic/quic_cfq.c
154
l->head = l->tail = n;
crypto/openssl/ssl/quic/quic_cfq.c
197
for (p = l->head; p != NULL; p = pnext) {
crypto/openssl/ssl/quic/quic_cfq.c
217
QUIC_CFQ_ITEM_EX *item = cfq->free_list.head;
crypto/openssl/ssl/quic/quic_cfq.c
338
QUIC_CFQ_ITEM_EX *item = cfq->new_list.head;
crypto/openssl/ssl/quic/quic_cfq.c
70
QUIC_CFQ_ITEM_EX *head, *tail;
crypto/openssl/ssl/quic/quic_sf_list.c
117
for (sf = fl->head; sf != NULL && sf->range.start < range->start;
crypto/openssl/ssl/quic/quic_sf_list.c
145
if (fl->head == drop_frame)
crypto/openssl/ssl/quic/quic_sf_list.c
146
fl->head = next_frame;
crypto/openssl/ssl/quic/quic_sf_list.c
171
fl->head = new_frame;
crypto/openssl/ssl/quic/quic_sf_list.c
190
sf = fl->head;
crypto/openssl/ssl/quic/quic_sf_list.c
232
for (sf = fl->head; sf != NULL && sf->range.end <= limit;) {
crypto/openssl/ssl/quic/quic_sf_list.c
239
fl->head = sf;
crypto/openssl/ssl/quic/quic_sf_list.c
276
STREAM_FRAME *sf = fl->head, *prev_frame = NULL;
crypto/openssl/ssl/quic/quic_sf_list.c
57
for (sf = fl->head; sf != NULL; sf = next_frame) {
crypto/openssl/ssl/quic/quic_sf_list.c
98
fl->tail = fl->head = stream_frame_new(range, pkt, data);
crypto/openssl/ssl/quic/quic_srtm.c
225
static void sorted_insert_seq_num(SRTM_ITEM *head, SRTM_ITEM *item, SRTM_ITEM **new_head)
crypto/openssl/ssl/quic/quic_srtm.c
228
SRTM_ITEM *cur = head, **fixup = new_head;
crypto/openssl/ssl/quic/quic_srtm.c
230
*new_head = head;
crypto/openssl/ssl/quic/quic_srtm.c
246
static void sorted_insert_srt(SRTM_ITEM *head, SRTM_ITEM *item, SRTM_ITEM **new_head)
crypto/openssl/ssl/quic/quic_srtm.c
249
SRTM_ITEM *cur = head, **fixup = new_head;
crypto/openssl/ssl/quic/quic_srtm.c
251
*new_head = head;
crypto/openssl/ssl/quic/quic_srtm.c
290
SRTM_ITEM *item = NULL, *head = NULL, *new_head, *r_item;
crypto/openssl/ssl/quic/quic_srtm.c
296
if ((item = srtm_find(srtm, opaque, seq_num, &head, NULL)) != NULL)
crypto/openssl/ssl/quic/quic_srtm.c
311
if (head == NULL) {
crypto/openssl/ssl/quic/quic_srtm.c
319
sorted_insert_seq_num(head, item, &new_head);
crypto/openssl/ssl/quic/quic_srtm.c
320
if (new_head != head) { /* head changed, update in lhash */
crypto/openssl/ssl/quic/quic_txpim.c
24
QUIC_TXPIM_PKT_EX *head, *tail;
crypto/openssl/ssl/quic/quic_txpim.c
48
for (n = l->head; n != NULL; n = nnext) {
crypto/openssl/ssl/quic/quic_txpim.c
55
l->head = l->tail = NULL;
crypto/openssl/ssl/quic/quic_txpim.c
70
if (l->head == n)
crypto/openssl/ssl/quic/quic_txpim.c
71
l->head = n->next;
crypto/openssl/ssl/quic/quic_txpim.c
88
if (l->head == NULL)
crypto/openssl/ssl/quic/quic_txpim.c
89
l->head = n;
crypto/openssl/ssl/quic/quic_txpim.c
94
QUIC_TXPIM_PKT_EX *ex = txpim->free_list.head;
crypto/openssl/ssl/ssl_ciph.c
1418
CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr;
crypto/openssl/ssl/ssl_ciph.c
1456
disabled_mac, co_list, &head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1468
-1, &head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1469
ssl_cipher_apply_rule(0, SSL_kECDHE, 0, 0, 0, 0, 0, CIPHER_ADD, -1, &head,
crypto/openssl/ssl/ssl_ciph.c
1471
ssl_cipher_apply_rule(0, SSL_kECDHE, 0, 0, 0, 0, 0, CIPHER_DEL, -1, &head,
crypto/openssl/ssl/ssl_ciph.c
1476
&head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1478
&head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1486
-1, &head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1489
ssl_cipher_apply_rule(0, 0, 0, 0, 0, 0, 0, CIPHER_ADD, -1, &head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1492
ssl_cipher_apply_rule(0, 0, 0, 0, SSL_MD5, 0, 0, CIPHER_ORD, -1, &head,
crypto/openssl/ssl/ssl_ciph.c
1500
ssl_cipher_apply_rule(0, 0, SSL_aNULL, 0, 0, 0, 0, CIPHER_ORD, -1, &head,
crypto/openssl/ssl/ssl_ciph.c
1503
ssl_cipher_apply_rule(0, SSL_kRSA, 0, 0, 0, 0, 0, CIPHER_ORD, -1, &head,
crypto/openssl/ssl/ssl_ciph.c
1505
ssl_cipher_apply_rule(0, SSL_kPSK, 0, 0, 0, 0, 0, CIPHER_ORD, -1, &head,
crypto/openssl/ssl/ssl_ciph.c
1509
ssl_cipher_apply_rule(0, 0, 0, SSL_RC4, 0, 0, 0, CIPHER_ORD, -1, &head,
crypto/openssl/ssl/ssl_ciph.c
1516
if (!ssl_cipher_strength_sort(&head, &tail)) {
crypto/openssl/ssl/ssl_ciph.c
1525
&head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1541
&head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1543
CIPHER_BUMP, -1, &head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1545
CIPHER_BUMP, -1, &head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1548
ssl_cipher_apply_rule(0, 0, 0, 0, 0, 0, 0, CIPHER_DEL, -1, &head, &tail);
crypto/openssl/ssl/ssl_ciph.c
1567
disabled_mac, head);
crypto/openssl/ssl/ssl_ciph.c
1577
&head, &tail, ca_list, c);
crypto/openssl/ssl/ssl_ciph.c
1584
ok = ssl_cipher_process_rulestr(rule_p, &head, &tail, ca_list, c);
crypto/openssl/ssl/ssl_ciph.c
1633
for (curr = head; curr != NULL; curr = curr->next) {
crypto/openssl/ssl/ssl_ciph.c
604
static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr,
crypto/openssl/ssl/ssl_ciph.c
609
if (curr == *head)
crypto/openssl/ssl/ssl_ciph.c
610
*head = curr->next;
crypto/openssl/ssl/ssl_ciph.c
621
static void ll_append_head(CIPHER_ORDER **head, CIPHER_ORDER *curr,
crypto/openssl/ssl/ssl_ciph.c
624
if (curr == *head)
crypto/openssl/ssl/ssl_ciph.c
632
(*head)->prev = curr;
crypto/openssl/ssl/ssl_ciph.c
633
curr->next = *head;
crypto/openssl/ssl/ssl_ciph.c
635
*head = curr;
crypto/openssl/ssl/ssl_ciph.c
709
CIPHER_ORDER *head)
crypto/openssl/ssl/ssl_ciph.c
722
ciph_curr = head;
crypto/openssl/ssl/ssl_ciph.c
772
CIPHER_ORDER *head, *tail, *curr, *next, *last;
crypto/openssl/ssl/ssl_ciph.c
789
head = *head_p;
crypto/openssl/ssl/ssl_ciph.c
794
last = head;
crypto/openssl/ssl/ssl_ciph.c
796
next = head;
crypto/openssl/ssl/ssl_ciph.c
861
ll_append_tail(&head, curr, &tail);
crypto/openssl/ssl/ssl_ciph.c
869
ll_append_tail(&head, curr, &tail);
crypto/openssl/ssl/ssl_ciph.c
879
ll_append_head(&head, curr, &tail);
crypto/openssl/ssl/ssl_ciph.c
884
ll_append_head(&head, curr, &tail);
crypto/openssl/ssl/ssl_ciph.c
887
if (head == curr)
crypto/openssl/ssl/ssl_ciph.c
888
head = curr->next;
crypto/openssl/ssl/ssl_ciph.c
903
*head_p = head;
include/res_update.h
56
ns_updrec *head;
krb5/lib/gssapi/error_map.h
108
e->next = head->first;
krb5/lib/gssapi/error_map.h
109
head->first = e;
krb5/lib/gssapi/error_map.h
33
static inline int gsserrmap_init (struct gsserrmap__head *head)
krb5/lib/gssapi/error_map.h
35
head->first = NULL;
krb5/lib/gssapi/error_map.h
38
static inline void gsserrmap_destroy (struct gsserrmap__head *head)
krb5/lib/gssapi/error_map.h
43
for (e = head->first; e; e = e_next) {
krb5/lib/gssapi/error_map.h
51
head->first = NULL;
krb5/lib/gssapi/error_map.h
55
gsserrmap__find_node (struct gsserrmap__head *head, OM_uint32 key)
krb5/lib/gssapi/error_map.h
58
for (e = head->first; e; e = e->next)
krb5/lib/gssapi/error_map.h
65
gsserrmap_find (struct gsserrmap__head *head, OM_uint32 key)
krb5/lib/gssapi/error_map.h
67
struct gsserrmap__element *e = gsserrmap__find_node(head, key);
krb5/lib/gssapi/error_map.h
85
gsserrmap_replace_or_insert (struct gsserrmap__head *head,
krb5/lib/gssapi/error_map.h
88
struct gsserrmap__element *e = gsserrmap__find_node(head, key);
lib/lib80211/lib80211_regdomain.c
561
cleanup_bands(netband_head *head)
lib/lib80211/lib80211_regdomain.c
566
nb = LIST_FIRST(head);
lib/libc/db/mpool/mpool.c
111
struct _hqh *head;
lib/libc/db/mpool/mpool.c
136
head = &mp->hqh[HASHKEY(bp->pgno)];
lib/libc/db/mpool/mpool.c
137
TAILQ_INSERT_HEAD(head, bp, hq);
lib/libc/db/mpool/mpool.c
145
struct _hqh *head;
lib/libc/db/mpool/mpool.c
159
head = &mp->hqh[HASHKEY(bp->pgno)];
lib/libc/db/mpool/mpool.c
160
TAILQ_REMOVE(head, bp, hq);
lib/libc/db/mpool/mpool.c
177
struct _hqh *head;
lib/libc/db/mpool/mpool.c
199
head = &mp->hqh[HASHKEY(bp->pgno)];
lib/libc/db/mpool/mpool.c
200
TAILQ_REMOVE(head, bp, hq);
lib/libc/db/mpool/mpool.c
201
TAILQ_INSERT_HEAD(head, bp, hq);
lib/libc/db/mpool/mpool.c
256
head = &mp->hqh[HASHKEY(bp->pgno)];
lib/libc/db/mpool/mpool.c
257
TAILQ_INSERT_HEAD(head, bp, hq);
lib/libc/db/mpool/mpool.c
341
struct _hqh *head;
lib/libc/db/mpool/mpool.c
364
head = &mp->hqh[HASHKEY(bp->pgno)];
lib/libc/db/mpool/mpool.c
365
TAILQ_REMOVE(head, bp, hq);
lib/libc/db/mpool/mpool.c
430
struct _hqh *head;
lib/libc/db/mpool/mpool.c
433
head = &mp->hqh[HASHKEY(pgno)];
lib/libc/db/mpool/mpool.c
434
TAILQ_FOREACH(bp, head, hq)
lib/libc/gen/fts-compat.c
1007
fts_sort(FTS *sp, FTSENT *head, int nitems)
lib/libc/gen/fts-compat.c
1023
return (head);
lib/libc/gen/fts-compat.c
1026
for (ap = sp->fts_array, p = head; p; p = p->fts_link)
lib/libc/gen/fts-compat.c
1029
for (head = *(ap = sp->fts_array); --nitems; ++ap)
lib/libc/gen/fts-compat.c
1032
return (head);
lib/libc/gen/fts-compat.c
1083
fts_lfree(FTSENT *head)
lib/libc/gen/fts-compat.c
1088
while ((p = head)) {
lib/libc/gen/fts-compat.c
1089
head = head->fts_link;
lib/libc/gen/fts-compat.c
1126
fts_padjust(FTS *sp, FTSENT *head)
lib/libc/gen/fts-compat.c
1143
for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
lib/libc/gen/fts-compat.c
639
FTSENT *p, *head;
lib/libc/gen/fts-compat.c
750
for (head = tail = NULL, nitems = 0;
lib/libc/gen/fts-compat.c
769
fts_lfree(head);
lib/libc/gen/fts-compat.c
793
fts_lfree(head);
lib/libc/gen/fts-compat.c
843
if (head == NULL)
lib/libc/gen/fts-compat.c
844
head = tail = p;
lib/libc/gen/fts-compat.c
869
fts_padjust(sp, head);
lib/libc/gen/fts-compat.c
907
head = fts_sort(sp, head, nitems);
lib/libc/gen/fts-compat.c
908
return (head);
lib/libc/gen/fts-compat11.c
1014
return (head);
lib/libc/gen/fts-compat11.c
1017
for (ap = sp->fts_array, p = head; p; p = p->fts_link)
lib/libc/gen/fts-compat11.c
1020
for (head = *(ap = sp->fts_array); --nitems; ++ap)
lib/libc/gen/fts-compat11.c
1023
return (head);
lib/libc/gen/fts-compat11.c
1074
fts_lfree(FTSENT11 *head)
lib/libc/gen/fts-compat11.c
1079
while ((p = head)) {
lib/libc/gen/fts-compat11.c
1080
head = head->fts_link;
lib/libc/gen/fts-compat11.c
1105
fts_padjust(FTS11 *sp, FTSENT11 *head)
lib/libc/gen/fts-compat11.c
1122
for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
lib/libc/gen/fts-compat11.c
636
FTSENT11 *p, *head;
lib/libc/gen/fts-compat11.c
749
for (head = tail = NULL, nitems = 0;
lib/libc/gen/fts-compat11.c
768
fts_lfree(head);
lib/libc/gen/fts-compat11.c
828
if (head == NULL)
lib/libc/gen/fts-compat11.c
829
head = tail = p;
lib/libc/gen/fts-compat11.c
854
fts_padjust(sp, head);
lib/libc/gen/fts-compat11.c
874
fts_lfree(head);
lib/libc/gen/fts-compat11.c
890
head = fts_sort(sp, head, nitems);
lib/libc/gen/fts-compat11.c
891
return (head);
lib/libc/gen/fts-compat11.c
998
fts_sort(FTS11 *sp, FTSENT11 *head, size_t nitems)
lib/libc/gen/fts.c
1092
fts_sort(FTS *sp, FTSENT *head, size_t nitems)
lib/libc/gen/fts.c
1108
return (head);
lib/libc/gen/fts.c
1111
for (ap = sp->fts_array, p = head; p; p = p->fts_link)
lib/libc/gen/fts.c
1125
for (head = *(ap = sp->fts_array); --nitems; ++ap)
lib/libc/gen/fts.c
1128
return (head);
lib/libc/gen/fts.c
1167
fts_lfree(FTSENT *head)
lib/libc/gen/fts.c
1172
while ((p = head)) {
lib/libc/gen/fts.c
1173
head = head->fts_link;
lib/libc/gen/fts.c
1198
fts_padjust(FTS *sp, FTSENT *head)
lib/libc/gen/fts.c
1215
for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
lib/libc/gen/fts.c
731
FTSENT *p, *head;
lib/libc/gen/fts.c
840
for (head = tail = NULL, nitems = 0;
lib/libc/gen/fts.c
859
fts_lfree(head);
lib/libc/gen/fts.c
932
if (head == NULL)
lib/libc/gen/fts.c
933
head = tail = p;
lib/libc/gen/fts.c
958
fts_padjust(sp, head);
lib/libc/gen/fts.c
978
fts_lfree(head);
lib/libc/gen/fts.c
994
head = fts_sort(sp, head, nitems);
lib/libc/gen/fts.c
995
return (head);
lib/libc/iconv/citrus_hash.h
39
#define _CITRUS_HASH_INIT(head, hashsize) \
lib/libc/iconv/citrus_hash.h
44
LIST_INIT(&(head)->chh_table[_ch_loop]); \
lib/libc/iconv/citrus_hash.h
47
#define _CITRUS_HASH_INSERT(head, elm, field, hashval) \
lib/libc/iconv/citrus_hash.h
48
LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
lib/libc/iconv/citrus_hash.h
49
#define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \
lib/libc/iconv/citrus_hash.h
51
LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \
lib/libc/iconv/citrus_memstream.c
116
void *chr, *head;
lib/libc/iconv/citrus_memstream.c
122
head = _region_offset(&ms->ms_region, ms->ms_pos);
lib/libc/iconv/citrus_memstream.c
123
chr = memchr(head, ch, _memstream_remainder(ms));
lib/libc/iconv/citrus_memstream.c
125
_region_init(r, head, _memstream_remainder(ms));
lib/libc/iconv/citrus_memstream.c
129
sz = (char *)chr - (char *)head;
lib/libc/iconv/citrus_memstream.c
131
_region_init(r, head, sz);
lib/libc/iconv/citrus_mmap.c
55
void *head;
lib/libc/iconv/citrus_mmap.c
74
head = mmap(NULL, (size_t)st.st_size, PROT_READ, MAP_FILE|MAP_PRIVATE,
lib/libc/iconv/citrus_mmap.c
76
if (head == MAP_FAILED) {
lib/libc/iconv/citrus_mmap.c
80
_region_init(r, head, (size_t)st.st_size);
lib/libc/include/isc/list.h
30
#define LIST(type) struct { type *head, *tail; }
lib/libc/include/isc/list.h
32
do { (list).head = NULL; (list).tail = NULL; } while (0)
lib/libc/include/isc/list.h
45
#define HEAD(list) ((list).head)
lib/libc/include/isc/list.h
47
#define EMPTY(list) ((list).head == NULL)
lib/libc/include/isc/list.h
52
if ((list).head != NULL) \
lib/libc/include/isc/list.h
53
(list).head->link.prev = (elt); \
lib/libc/include/isc/list.h
57
(elt)->link.next = (list).head; \
lib/libc/include/isc/list.h
58
(list).head = (elt); \
lib/libc/include/isc/list.h
67
(list).head = (elt); \
lib/libc/include/isc/list.h
85
INSIST((list).head == (elt)); \
lib/libc/include/isc/list.h
86
(list).head = (elt)->link.next; \
lib/libc/net/getaddrinfo.c
729
get_addrselectpolicy(struct policyhead *head)
lib/libc/net/getaddrinfo.c
753
free_addrselectpolicy(head); /* make the list empty */
lib/libc/net/getaddrinfo.c
757
TAILQ_INSERT_TAIL(head, new, pc_entry);
lib/libc/net/getaddrinfo.c
768
free_addrselectpolicy(struct policyhead *head)
lib/libc/net/getaddrinfo.c
772
for (ent = TAILQ_FIRST(head); ent; ent = nent) {
lib/libc/net/getaddrinfo.c
774
TAILQ_REMOVE(head, ent, pc_entry);
lib/libc/net/getaddrinfo.c
780
match_addrselectpolicy(struct sockaddr *addr, struct policyhead *head)
lib/libc/net/getaddrinfo.c
806
for (ent = TAILQ_FIRST(head); ent; ent = TAILQ_NEXT(ent, pc_entry)) {
lib/libc/net/name6.c
731
get_addrselectpolicy(struct policyhead *head)
lib/libc/net/name6.c
753
free_addrselectpolicy(head); /* make the list empty */
lib/libc/net/name6.c
757
TAILQ_INSERT_TAIL(head, new, pc_entry);
lib/libc/net/name6.c
768
free_addrselectpolicy(struct policyhead *head)
lib/libc/net/name6.c
772
for (ent = TAILQ_FIRST(head); ent; ent = nent) {
lib/libc/net/name6.c
774
TAILQ_REMOVE(head, ent, pc_entry);
lib/libc/net/name6.c
780
match_addrselectpolicy(struct sockaddr *addr, struct policyhead *head)
lib/libc/net/name6.c
806
for (ent = TAILQ_FIRST(head); ent; ent = TAILQ_NEXT(ent, pc_entry)) {
lib/libc/rpc/getnetconfig.c
100
struct netconfig_list *head; /* head of the list */
lib/libc/rpc/getnetconfig.c
176
nc_vars->nc_configs = ni.head;
lib/libc/rpc/getnetconfig.c
233
ncp->nc_configs = ni.head;
lib/libc/rpc/getnetconfig.c
316
if (ni.head == NULL) { /* first entry */
lib/libc/rpc/getnetconfig.c
317
ni.head = ni.tail = list;
lib/libc/rpc/getnetconfig.c
370
q = ni.head;
lib/libc/rpc/getnetconfig.c
372
ni.head = NULL;
lib/libc/rpc/getnetconfig.c
426
if (ni.head != NULL) {
lib/libc/rpc/getnetconfig.c
427
for (list = ni.head; list; list = list->next) {
lib/libc/rpc/pmap_getmaps.c
70
struct pmaplist *head = NULL;
lib/libc/rpc/pmap_getmaps.c
85
(xdrproc_t)xdr_pmaplist, &head, minutetimeout) !=
lib/libc/rpc/pmap_getmaps.c
92
return (head);
lib/libc/rpc/rpcb_clnt.c
1052
rpcblist_ptr head = NULL;
lib/libc/rpc/rpcb_clnt.c
1059
return (head);
lib/libc/rpc/rpcb_clnt.c
1063
(char *)(void *)&head, tottimeout);
lib/libc/rpc/rpcb_clnt.c
1081
(char *)(void *)&head, tottimeout) == RPC_SUCCESS)
lib/libc/rpc/rpcb_clnt.c
1089
return (head);
lib/libc/tests/sys/queue_test.c
108
ATF_REQUIRE_EQ(SLIST_FIRST(&head), n1);
lib/libc/tests/sys/queue_test.c
110
SLIST_REMOVE_HEAD(&head, entries);
lib/libc/tests/sys/queue_test.c
113
ATF_REQUIRE_EQ(SLIST_FIRST(&head), n2);
lib/libc/tests/sys/queue_test.c
117
SLIST_FOREACH(np, &head, entries) {
lib/libc/tests/sys/queue_test.c
131
SLIST_FOREACH(np, &head, entries) {
lib/libc/tests/sys/queue_test.c
140
ATF_REQUIRE_EQ(SLIST_FIRST(&head), n2);
lib/libc/tests/sys/queue_test.c
153
STAILQ_HEAD(stailhead, entry) head = STAILQ_HEAD_INITIALIZER(head);
lib/libc/tests/sys/queue_test.c
161
STAILQ_INIT(&head);
lib/libc/tests/sys/queue_test.c
162
ATF_REQUIRE(STAILQ_EMPTY(&head));
lib/libc/tests/sys/queue_test.c
166
STAILQ_FOREACH(np, &head, entries) {
lib/libc/tests/sys/queue_test.c
177
STAILQ_INSERT_HEAD(&head, n1, entries);
lib/libc/tests/sys/queue_test.c
180
STAILQ_FOREACH(np, &head, entries) {
lib/libc/tests/sys/queue_test.c
194
STAILQ_INSERT_TAIL(&head, n2, entries);
lib/libc/tests/sys/queue_test.c
200
STAILQ_INSERT_TAIL(&head, n3, entries);
lib/libc/tests/sys/queue_test.c
203
STAILQ_FOREACH(np, &head, entries) {
lib/libc/tests/sys/queue_test.c
213
STAILQ_REMOVE_HEAD(&head, entries);
lib/libc/tests/sys/queue_test.c
217
STAILQ_FOREACH(np, &head, entries) {
lib/libc/tests/sys/queue_test.c
42
SLIST_HEAD(stailhead, entry) head = SLIST_HEAD_INITIALIZER(head);
lib/libc/tests/sys/queue_test.c
49
SLIST_INIT(&head);
lib/libc/tests/sys/queue_test.c
53
ATF_REQUIRE(SLIST_EMPTY(&head));
lib/libc/tests/sys/queue_test.c
57
SLIST_FOREACH(np, &head, entries) {
lib/libc/tests/sys/queue_test.c
68
SLIST_INSERT_HEAD(&head, n1, entries);
lib/libc/tests/sys/queue_test.c
71
ATF_REQUIRE_EQ(SLIST_FIRST(&head), n1);
lib/libc/tests/sys/queue_test.c
74
SLIST_FOREACH(np, &head, entries) {
lib/libc/tests/sys/queue_test.c
97
SLIST_FOREACH(np, &head, entries) {
lib/libiconv_modules/HZ/citrus_hz.c
187
int bit, ch, head, len, tail;
lib/libiconv_modules/HZ/citrus_hz.c
199
bit = head = tail = 0;
lib/libiconv_modules/HZ/citrus_hz.c
235
++head;
lib/libiconv_modules/HZ/citrus_hz.c
278
if (graphic->length == (tail - head)) {
lib/libiconv_modules/UES/citrus_ues.c
193
int ch, head, num, tail;
lib/libiconv_modules/UES/citrus_ues.c
208
head = tail;
lib/libiconv_modules/UES/citrus_ues.c
209
if (psenc->chlen == head) {
lib/libiconv_modules/UES/citrus_ues.c
214
ch = (unsigned char)psenc->ch[head++];
lib/libiconv_modules/UES/citrus_ues.c
216
if (psenc->chlen == head) {
lib/libiconv_modules/UES/citrus_ues.c
221
switch (psenc->ch[head]) {
lib/libiconv_modules/UES/citrus_ues.c
234
++head;
lib/libiconv_modules/UES/citrus_ues.c
236
for (; head < tail; ++head) {
lib/libiconv_modules/UES/citrus_ues.c
237
if (psenc->chlen == head) {
lib/libiconv_modules/UES/citrus_ues.c
246
num = to_int((int)(unsigned char)psenc->ch[head]);
lib/libiconv_modules/UES/citrus_ues.c
253
head = 0;
lib/libiconv_modules/UES/citrus_ues.c
284
head = psenc->chlen;
lib/libiconv_modules/UES/citrus_ues.c
285
if (--head > 0)
lib/libiconv_modules/UES/citrus_ues.c
286
memmove(&psenc->ch[0], &psenc->ch[1], head);
lib/libiconv_modules/UES/citrus_ues.c
289
psenc->chlen = head;
lib/libiconv_modules/VIQR/citrus_viqr.c
104
mnemonic_ext_find(wchar_t wc, const mnemonic_def_t *head, size_t n)
lib/libiconv_modules/VIQR/citrus_viqr.c
109
mid = head + (n >> 1);
lib/libiconv_modules/VIQR/citrus_viqr.c
113
head = mid + 1;
lib/libnetmap/nmport.c
907
ring->head = ring->cur = nm_ring_next(ring, i);
lib/libpmc/pmu-events/list.h
169
#define list_for_each(p, head) \
lib/libpmc/pmu-events/list.h
170
for (p = (head)->next; p != (head); p = (p)->next)
lib/libpmc/pmu-events/list.h
172
#define list_for_each_safe(p, n, head) \
lib/libpmc/pmu-events/list.h
173
for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
lib/libpmc/pmu-events/list.h
192
#define list_for_each_entry_safe_from(pos, n, head, member) \
lib/libpmc/pmu-events/list.h
194
&(pos)->member != (head); \
lib/libpmc/pmu-events/list.h
213
list_add(struct list_head *new, struct list_head *head)
lib/libpmc/pmu-events/list.h
216
linux_list_add(new, head, head->next);
lib/libpmc/pmu-events/list.h
220
list_add_tail(struct list_head *new, struct list_head *head)
lib/libpmc/pmu-events/list.h
223
linux_list_add(new, head->prev, head);
lib/libpmc/pmu-events/list.h
227
list_move(struct list_head *list, struct list_head *head)
lib/libpmc/pmu-events/list.h
231
list_add(list, head);
lib/libpmc/pmu-events/list.h
235
list_move_tail(struct list_head *entry, struct list_head *head)
lib/libpmc/pmu-events/list.h
239
list_add_tail(entry, head);
lib/libpmc/pmu-events/list.h
260
list_splice(const struct list_head *list, struct list_head *head)
lib/libpmc/pmu-events/list.h
263
linux_list_splice(list, head, head->next);
lib/libpmc/pmu-events/list.h
267
list_splice_tail(struct list_head *list, struct list_head *head)
lib/libpmc/pmu-events/list.h
270
linux_list_splice(list, head->prev, head);
lib/libpmc/pmu-events/list.h
274
list_splice_init(struct list_head *list, struct list_head *head)
lib/libpmc/pmu-events/list.h
277
linux_list_splice(list, head, head->next);
lib/libpmc/pmu-events/list.h
282
list_splice_tail_init(struct list_head *list, struct list_head *head)
lib/libpmc/pmu-events/list.h
285
linux_list_splice(list, head->prev, head);
lib/libpmc/pmu-events/list.h
303
#define INIT_HLIST_HEAD(head) (head)->first = NULL
lib/libpmc/pmu-events/list.h
385
static inline int list_is_singular(const struct list_head *head)
lib/libpmc/pmu-events/list.h
387
return !list_empty(head) && (head->next == head->prev);
lib/libpmc/pmu-events/list.h
391
struct list_head *head, struct list_head *entry)
lib/libpmc/pmu-events/list.h
394
list->next = head->next;
lib/libpmc/pmu-events/list.h
398
head->next = new_first;
lib/libpmc/pmu-events/list.h
399
new_first->prev = head;
lib/libpmc/pmu-events/list.h
403
struct list_head *head, struct list_head *entry)
lib/libpmc/pmu-events/list.h
405
if (list_empty(head))
lib/libpmc/pmu-events/list.h
407
if (list_is_singular(head) &&
lib/libpmc/pmu-events/list.h
408
(head->next != entry && head != entry))
lib/libpmc/pmu-events/list.h
410
if (entry == head)
lib/libpmc/pmu-events/list.h
413
__list_cut_position(list, head, entry);
lib/libpmc/pmu-events/list.h
417
const struct list_head *head)
lib/libpmc/pmu-events/list.h
419
return list->next == head;
lib/libpmc/pmu-events/list.h
424
#define hlist_for_each(p, head) \
lib/libpmc/pmu-events/list.h
425
for (p = (head)->first; p; p = (p)->next)
lib/libpmc/pmu-events/list.h
427
#define hlist_for_each_safe(p, n, head) \
lib/libpmc/pmu-events/list.h
428
for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)
lib/libpmc/pmu-events/list.h
433
#define hlist_for_each_entry(pos, head, member) \
lib/libpmc/pmu-events/list.h
434
for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
lib/libpmc/pmu-events/list.h
447
#define hlist_for_each_entry_safe(pos, n, head, member) \
lib/libpmc/pmu-events/list.h
448
for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member); \
lib/libpmc/pmu-events/list.h
452
extern void list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
lib/libpmc/pmu-events/list.h
79
list_empty(const struct list_head *head)
lib/libpmc/pmu-events/list.h
82
return (head->next == head);
lib/libpmc/pmu-events/list.h
86
list_empty_careful(const struct list_head *head)
lib/libpmc/pmu-events/list.h
88
struct list_head *next = head->next;
lib/libpmc/pmu-events/list.h
90
return ((next == head) && (next == head->prev));
lib/libprocstat/libprocstat.c
361
procstat_freefiles(struct procstat *procstat, struct filestat_list *head)
lib/libprocstat/libprocstat.c
365
STAILQ_FOREACH_SAFE(fst, head, next, tmp) {
lib/libprocstat/libprocstat.c
370
free(head);
lib/libprocstat/libprocstat.c
467
struct filestat_list *head;
lib/libprocstat/libprocstat.c
506
head = malloc(sizeof(*head));
lib/libprocstat/libprocstat.c
507
if (head == NULL)
lib/libprocstat/libprocstat.c
509
STAILQ_INIT(head);
lib/libprocstat/libprocstat.c
517
STAILQ_INSERT_TAIL(head, entry, next);
lib/libprocstat/libprocstat.c
524
STAILQ_INSERT_TAIL(head, entry, next);
lib/libprocstat/libprocstat.c
531
STAILQ_INSERT_TAIL(head, entry, next);
lib/libprocstat/libprocstat.c
540
STAILQ_INSERT_TAIL(head, entry, next);
lib/libprocstat/libprocstat.c
547
STAILQ_INSERT_TAIL(head, entry, next);
lib/libprocstat/libprocstat.c
555
STAILQ_INSERT_TAIL(head, entry, next);
lib/libprocstat/libprocstat.c
639
STAILQ_INSERT_TAIL(head, entry, next);
lib/libprocstat/libprocstat.c
692
STAILQ_INSERT_TAIL(head, entry, next);
lib/libprocstat/libprocstat.c
698
return (head);
lib/libprocstat/libprocstat.c
859
struct filestat_list *head;
lib/libprocstat/libprocstat.c
888
head = malloc(sizeof(*head));
lib/libprocstat/libprocstat.c
889
if (head == NULL)
lib/libprocstat/libprocstat.c
891
STAILQ_INIT(head);
lib/libprocstat/libprocstat.c
913
STAILQ_INSERT_TAIL(head, entry, next);
lib/libprocstat/libprocstat.c
940
STAILQ_INSERT_TAIL(head, entry, next);
lib/libprocstat/libprocstat.c
944
return (head);
lib/libprocstat/libprocstat.h
214
struct filestat_list *head);
lib/libthr/thread/thr_list.c
259
struct thread_hash_head *head;
lib/libthr/thread/thr_list.c
261
head = &thr_hashtable[THREAD_HASH(thread)];
lib/libthr/thread/thr_list.c
262
LIST_INSERT_HEAD(head, thread, hle);
lib/libthr/thread/thr_list.c
275
struct thread_hash_head *head;
lib/libthr/thread/thr_list.c
277
head = &thr_hashtable[THREAD_HASH(thread)];
lib/libthr/thread/thr_list.c
278
LIST_FOREACH(td, head, hle) {
lib/libusb/libusb_global_linux.h
81
#define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
lib/libusb/libusb_global_linux.h
82
for ((var) = TAILQ_FIRST((head)); \
lib/libutil/property.c
206
if (head == NULL) {
lib/libutil/property.c
207
if ((head = ptr = property_alloc(hold_n, hold_v)) == NULL)
lib/libutil/property.c
211
properties_free(head);
lib/libutil/property.c
225
if (head == NULL && (head = property_alloc(NULL, NULL)) == NULL)
lib/libutil/property.c
228
return (head);
lib/libutil/property.c
72
properties head, ptr;
lib/libutil/property.c
81
head = ptr = NULL;
lib/libutil/property.c
94
properties_free(head);
libexec/tftpd/tests/functional.c
202
#define TFTPD_TC_DEFINE(name, head, ...) \
libexec/tftpd/tests/functional.c
208
head \
libexec/tftpd/tests/functional.c
228
head \
sbin/camcontrol/camcontrol.c
4386
dlist[i].head,
sbin/camcontrol/camcontrol.c
4392
dlist[i].head,
sbin/camcontrol/camcontrol.c
4422
dlist[i].head,
sbin/camcontrol/camcontrol.c
4428
dlist[i].head,
sbin/fsck_msdosfs/dir.c
1086
reconnect(struct fat_descriptor *fat, cl_t head, size_t length)
sbin/fsck_msdosfs/dir.c
1125
lfcl = p ? fat_get_cl_next(fat, lfcl) : lostDir->head;
sbin/fsck_msdosfs/dir.c
1129
lfcl = (lostDir->head < boot->NumClusters) ? lostDir->head : 0;
sbin/fsck_msdosfs/dir.c
1147
len = snprintf(d.name, sizeof(d.name), "%u", head);
sbin/fsck_msdosfs/dir.c
1149
d.head = head;
sbin/fsck_msdosfs/dir.c
1155
p[26] = (u_char)d.head;
sbin/fsck_msdosfs/dir.c
1156
p[27] = (u_char)(d.head >> 8);
sbin/fsck_msdosfs/dir.c
1158
p[20] = (u_char)(d.head >> 16);
sbin/fsck_msdosfs/dir.c
1159
p[21] = (u_char)(d.head >> 24);
sbin/fsck_msdosfs/dir.c
256
rootDir->head = boot->bpbRootClust;
sbin/fsck_msdosfs/dir.c
398
if (dir->head == CLUST_FREE) {
sbin/fsck_msdosfs/dir.c
401
if (!fat_is_valid_cl(fat, dir->head) || !fat_is_cl_head(fat, dir->head)) {
sbin/fsck_msdosfs/dir.c
403
fullpath(dir), dir->size, dir->head);
sbin/fsck_msdosfs/dir.c
410
dir->head = CLUST_FREE;
sbin/fsck_msdosfs/dir.c
416
ret = checkchain(fat, dir->head, &chainsize);
sbin/fsck_msdosfs/dir.c
454
for (cl = dir->head, len = sz = 0;
sbin/fsck_msdosfs/dir.c
487
cl = dir->head;
sbin/fsck_msdosfs/dir.c
566
cl = dir->head;
sbin/fsck_msdosfs/dir.c
592
mod |= checkchain(fat, dir->head, &dirclusters);
sbin/fsck_msdosfs/dir.c
795
dirent.head = p[26] | (p[27] << 8);
sbin/fsck_msdosfs/dir.c
797
dirent.head |= (p[20] << 16) | (p[21] << 24);
sbin/fsck_msdosfs/dir.c
849
((!fat_is_valid_cl(fat, dirent.head) ||
sbin/fsck_msdosfs/dir.c
850
!fat_is_cl_head(fat, dirent.head)))) {
sbin/fsck_msdosfs/dir.c
851
if (!fat_is_valid_cl(fat, dirent.head)) {
sbin/fsck_msdosfs/dir.c
854
dirent.head);
sbin/fsck_msdosfs/dir.c
874
dirent.head = 0;
sbin/fsck_msdosfs/dir.c
901
if (dirent.head != dir->head) {
sbin/fsck_msdosfs/dir.c
905
dirent.head = dir->head;
sbin/fsck_msdosfs/dir.c
906
p[26] = (u_char)dirent.head;
sbin/fsck_msdosfs/dir.c
907
p[27] = (u_char)(dirent.head >> 8);
sbin/fsck_msdosfs/dir.c
909
p[20] = (u_char)(dirent.head >> 16);
sbin/fsck_msdosfs/dir.c
910
p[21] = (u_char)(dirent.head >> 24);
sbin/fsck_msdosfs/dir.c
920
if (dirent.head) {
sbin/fsck_msdosfs/dir.c
924
dirent.head = 0;
sbin/fsck_msdosfs/dir.c
932
} else if (dirent.head != dir->parent->head) {
sbin/fsck_msdosfs/dir.c
936
dirent.head = dir->parent->head;
sbin/fsck_msdosfs/dir.c
937
p[26] = (u_char)dirent.head;
sbin/fsck_msdosfs/dir.c
938
p[27] = (u_char)(dirent.head >> 8);
sbin/fsck_msdosfs/dir.c
940
p[20] = (u_char)(dirent.head >> 16);
sbin/fsck_msdosfs/dir.c
941
p[21] = (u_char)(dirent.head >> 24);
sbin/fsck_msdosfs/dir.c
954
if (dirent.head == dir->head) {
sbin/fsck_msdosfs/dosfs.h
116
cl_t head; /* cluster no */
sbin/fsck_msdosfs/fat.c
1034
checkchain(struct fat_descriptor *fat, cl_t head, size_t *chainsize)
sbin/fsck_msdosfs/fat.c
1045
assert(valid_cl(fat, head));
sbin/fsck_msdosfs/fat.c
1046
assert(fat_is_cl_head(fat, head));
sbin/fsck_msdosfs/fat.c
1051
fat_clear_cl_head(fat, head);
sbin/fsck_msdosfs/fat.c
1068
prev_cl = current_cl = head;
sbin/fsck_msdosfs/fat.c
1093
head, rsrvdcltype(next_cl));
sbin/fsck_msdosfs/fat.c
1097
head,
sbin/fsck_msdosfs/fat.c
1120
clearchain(struct fat_descriptor *fat, cl_t head)
sbin/fsck_msdosfs/fat.c
1125
current_cl = head;
sbin/fsck_msdosfs/fat.c
1247
cl_t head;
sbin/fsck_msdosfs/fat.c
1262
for (head = CLUST_FIRST;
sbin/fsck_msdosfs/fat.c
1263
chains > 0 && head < boot->NumClusters;
sbin/fsck_msdosfs/fat.c
1269
if (head % LONG_BIT == 0 &&
sbin/fsck_msdosfs/fat.c
1270
!fat_is_cl_head_in_range(fat, head)) {
sbin/fsck_msdosfs/fat.c
1271
head += LONG_BIT;
sbin/fsck_msdosfs/fat.c
1274
if (fat_is_cl_head(fat, head)) {
sbin/fsck_msdosfs/fat.c
1275
ret = checkchain(fat, head, &chainlength);
sbin/fsck_msdosfs/fat.c
1279
head, chainlength);
sbin/fsck_msdosfs/fat.c
1280
mod |= ret = reconnect(fat, head,
sbin/fsck_msdosfs/fat.c
1286
clearchain(fat, head);
sbin/fsck_msdosfs/fat.c
1291
head++;
sbin/fsck_msdosfs/fat.c
1314
for (head = CLUST_FIRST; head < boot->NumClusters; head++)
sbin/fsck_msdosfs/fat.c
1315
if (fat_get_cl_next(fat, head) == CLUST_FREE) {
sbin/fsck_msdosfs/fat.c
1316
boot->FSNext = head;
sbin/ipf/common/ipf_y.y
312
with keep head group
sbin/ipf/common/ipf_y.y
477
head: | IPFY_HEAD groupname { DOALL(setgrhead(&fr, $2););
sbin/ipfw/ipfw2.c
2658
rh.range.head.length = sizeof(*rt);
sbin/ipfw/ipfw2.c
2659
rh.range.head.type = IPFW_TLV_RANGE;
sbin/ipfw/ipfw2.c
2879
switch (ctlv->head.type) {
sbin/ipfw/ipfw2.c
3095
if (ctlv->head.type == IPFW_TLV_TBLNAME_LIST) {
sbin/ipfw/ipfw2.c
3098
readsz += ctlv->head.length;
sbin/ipfw/ipfw2.c
3099
ctlv = (ipfw_obj_ctlv *)((caddr_t)ctlv + ctlv->head.length);
sbin/ipfw/ipfw2.c
3104
if (ctlv->head.type == IPFW_TLV_RULE_LIST) {
sbin/ipfw/ipfw2.c
3107
readsz += ctlv->head.length;
sbin/ipfw/ipfw2.c
3109
ctlv->head.length);
sbin/ipfw/ipfw2.c
3328
if (tstate->idx[i].head.type != otype)
sbin/ipfw/ipfw2.c
3345
ntlv->head.type = otype;
sbin/ipfw/ipfw2.c
3346
ntlv->head.length = sizeof(ipfw_obj_ntlv);
sbin/ipfw/ipfw2.c
5775
if (a->head.type < b->head.type)
sbin/ipfw/ipfw2.c
5777
else if (a->head.type > b->head.type)
sbin/ipfw/ipfw2.c
5811
if (key.type < ntlv->head.type)
sbin/ipfw/ipfw2.c
5813
else if (key.type > ntlv->head.type)
sbin/ipfw/ipfw2.c
5915
ctlv->head.type = IPFW_TLV_TBLNAME_LIST;
sbin/ipfw/ipfw2.c
5916
ctlv->head.length = sizeof(ipfw_obj_ctlv) + tlen;
sbin/ipfw/ipfw2.c
5923
ctlv = (ipfw_obj_ctlv *)((caddr_t)ctlv + ctlv->head.length);
sbin/ipfw/ipfw2.c
5924
ctlv->head.type = IPFW_TLV_RULE_LIST;
sbin/ipfw/ipfw2.c
5925
ctlv->head.length = sizeof(ipfw_obj_ctlv) + rlen;
sbin/ipfw/ipfw2.c
5932
ctlv->head.type = IPFW_TLV_RULE_LIST;
sbin/ipfw/ipfw2.c
5933
ctlv->head.length = sizeof(ipfw_obj_ctlv) + rlen;
sbin/ipfw/ipfw2.c
6085
if (ntlv[i].head.type != IPFW_TLV_EACTION)
sbin/ipfw/ipfw2.c
6126
name = match_value(otypes, ntlv->head.type);
sbin/ipfw/ipfw2.c
6130
ntlv->head.type);
sbin/ipfw/ipfw2.c
6133
ntlv->idx, ntlv->head.type, ntlv->name);
sbin/ipfw/nat.c
1131
oh->ntlv.head.length = sizeof(oh->ntlv);
sbin/ipfw/nat.c
883
oh->ntlv.head.length = sizeof(oh->ntlv);
sbin/ipfw/nat.c
994
ntlv->head.type = IPFW_TLV_EACTION_NAME(1); /* it doesn't matter */
sbin/ipfw/nat.c
995
ntlv->head.length = sizeof(ipfw_obj_ntlv);
sbin/ipfw/nat64clat.c
152
ntlv->head.type = IPFW_TLV_EACTION_NAME(1); /* it doesn't matter */
sbin/ipfw/nat64clat.c
153
ntlv->head.length = sizeof(ipfw_obj_ntlv);
sbin/ipfw/nat64lsn.c
182
od->head.type = IPFW_TLV_OBJDATA;
sbin/ipfw/nat64lsn.c
183
od->head.length = sizeof(*od) + sizeof(next_idx);
sbin/ipfw/nat64lsn.c
309
ntlv->head.type = IPFW_TLV_EACTION_NAME(1); /* it doesn't matter */
sbin/ipfw/nat64lsn.c
310
ntlv->head.length = sizeof(ipfw_obj_ntlv);
sbin/ipfw/nat64lsn.c
97
sz = od->head.length - sizeof(*od);
sbin/ipfw/nat64stl.c
184
ntlv->head.type = IPFW_TLV_EACTION_NAME(1); /* it doesn't matter */
sbin/ipfw/nat64stl.c
185
ntlv->head.length = sizeof(ipfw_obj_ntlv);
sbin/ipfw/nptv6.c
143
ntlv->head.type = IPFW_TLV_EACTION_NAME(1); /* it doesn't matter */
sbin/ipfw/nptv6.c
144
ntlv->head.length = sizeof(ipfw_obj_ntlv);
sbin/ipfw/tables.c
1019
ptent->head.flags |= IPFW_TF_UPDATE;
sbin/ipfw/tables.c
1132
tent->head.length = sizeof(*tent);
sbin/ipfw/tables.c
1802
tent = (ipfw_obj_tentry *)((caddr_t)tent + tent->head.length);
sbin/ipfw/tables.c
318
ntlv->head.type = IPFW_TLV_TBL_NAME;
sbin/ipfw/tables.c
319
ntlv->head.length = sizeof(ipfw_obj_ntlv);
sbin/ipfw/tables.c
922
ctlv->head.length = sz;
sbin/ipfw/tables.c
930
tent->head.length = sizeof(ipfw_obj_tentry);
sbin/md5/md5.c
296
static struct chksumrec *head = NULL;
sbin/md5/md5.c
297
static struct chksumrec **next = &head;
sbin/md5/md5.c
596
for (rec = head; rec != NULL; rec = rec->next) {
sbin/md5/md5.c
601
rec = head;
sbin/mount_nfs/mount_nfs.c
1083
} *head;
sbin/mount_nfs/mount_nfs.c
1087
for (p = head; p != NULL; p = p->next)
sbin/mount_nfs/mount_nfs.c
1096
p->next = head;
sbin/mount_nfs/mount_nfs.c
1097
head = p;
sbin/pfctl/pfctl_optimize.c
1020
remove_from_skipsteps(struct skiplist *head, struct superblock *block,
sbin/pfctl/pfctl_optimize.c
1046
TAILQ_REMOVE(head, sk, ps_entry);
sbin/pfctl/pfctl_optimize.c
1047
TAILQ_INSERT_AFTER(head, next, sk, ps_entry);
sbin/pfctl/pfctl_optimize.c
664
TAILQ_HEAD( , pf_opt_rule) head;
sbin/pfctl/pfctl_optimize.c
725
TAILQ_INIT(&head);
sbin/pfctl/pfctl_optimize.c
726
TAILQ_CONCAT(&head, &block->sb_rules, por_entry);
sbin/pfctl/pfctl_optimize.c
728
while (!TAILQ_EMPTY(&head)) {
sbin/pfctl/pfctl_optimize.c
747
TAILQ_CONCAT(&block->sb_rules, &head, por_entry);
sbin/pfctl/pfctl_optimize.c
789
TAILQ_REMOVE(&head, por, por_entry);
sbin/pfctl/pfctl_parser.h
259
#define SIMPLEQ_END(head) NULL
sbin/pfctl/pfctl_parser.h
263
#define SIMPLEQ_FOREACH(var, head, field) \
sbin/pfctl/pfctl_parser.h
264
for((var) = SIMPLEQ_FIRST(head); \
sbin/pfctl/pfctl_parser.h
265
(var) != SIMPLEQ_END(head); \
sbin/rcorder/rcorder.c
1018
provnode *head, *pnode;
sbin/rcorder/rcorder.c
1032
head = Hash_GetValue(entry);
sbin/rcorder/rcorder.c
1034
if (head == NULL || head->next == NULL) {
sbin/rcorder/rcorder.c
104
flag head;
sbin/rcorder/rcorder.c
1041
if (head->next->next == NULL &&
sbin/rcorder/rcorder.c
1043
basename(head->next->fnode->filename)) == 0) {
sbin/rcorder/rcorder.c
1047
for (pnode = head->next; pnode; pnode = pnode->next)
sbin/rcorder/rcorder.c
313
provnode *pnode, *head;
sbin/rcorder/rcorder.c
317
head = Hash_GetValue(entry);
sbin/rcorder/rcorder.c
320
if (head == NULL) {
sbin/rcorder/rcorder.c
321
head = emalloc(sizeof(*head));
sbin/rcorder/rcorder.c
322
head->head = SET;
sbin/rcorder/rcorder.c
323
head->in_progress = RESET;
sbin/rcorder/rcorder.c
324
head->fnode = NULL;
sbin/rcorder/rcorder.c
325
head->sequence = 0;
sbin/rcorder/rcorder.c
326
head->last = head->next = NULL;
sbin/rcorder/rcorder.c
327
Hash_SetValue(entry, head);
sbin/rcorder/rcorder.c
365
head->next->fnode->filename);
sbin/rcorder/rcorder.c
370
pnode->head = RESET;
sbin/rcorder/rcorder.c
373
pnode->next = head->next;
sbin/rcorder/rcorder.c
374
pnode->last = head;
sbin/rcorder/rcorder.c
375
head->next = pnode;
sbin/rcorder/rcorder.c
548
provnode *head, *pnode;
sbin/rcorder/rcorder.c
557
head = emalloc(sizeof(*head));
sbin/rcorder/rcorder.c
558
head->head = SET;
sbin/rcorder/rcorder.c
559
head->in_progress = RESET;
sbin/rcorder/rcorder.c
560
head->fnode = NULL;
sbin/rcorder/rcorder.c
561
head->last = head->next = NULL;
sbin/rcorder/rcorder.c
562
Hash_SetValue(entry, head);
sbin/rcorder/rcorder.c
565
pnode->head = RESET;
sbin/rcorder/rcorder.c
568
pnode->next = head->next;
sbin/rcorder/rcorder.c
569
pnode->last = head;
sbin/rcorder/rcorder.c
570
head->next = pnode;
sbin/rcorder/rcorder.c
614
if (pnode->head)
sbin/rcorder/rcorder.c
655
provnode *head;
sbin/rcorder/rcorder.c
662
head = Hash_GetValue(entry);
sbin/rcorder/rcorder.c
682
((head == NULL ||
sbin/rcorder/rcorder.c
683
(head->next && head->in_progress == SET)) ?
sbin/rcorder/rcorder.c
689
if (head == NULL || head->next == NULL)
sbin/rcorder/rcorder.c
693
rfpnode = head->next->fnode->prov_list;
sbin/rcorder/rcorder.c
707
generate_loop_for_req(strnodelist *stack_tail, provnode *head,
sbin/rcorder/rcorder.c
718
for (pnode = head->next; pnode; pnode = pnode->next) {
sbin/rcorder/rcorder.c
789
provnode *head;
sbin/rcorder/rcorder.c
794
head = Hash_GetValue(entry);
sbin/rcorder/rcorder.c
799
if (head == NULL) {
sbin/rcorder/rcorder.c
807
if (head->next == NULL)
sbin/rcorder/rcorder.c
814
if (head->in_progress == SET) {
sbin/rcorder/rcorder.c
816
buf = generate_loop_for_req(stack_ptr, head,
sbin/rcorder/rcorder.c
832
head->in_progress = SET;
sbin/rcorder/rcorder.c
841
while (head->next != NULL)
sbin/rcorder/rcorder.c
842
do_file(head->next->fnode, &stack_item);
sbin/rcorder/rcorder.c
889
provnode *pnode, *head;
sbin/rcorder/rcorder.c
918
head = Hash_GetValue(r->entry);
sbin/rcorder/rcorder.c
919
if (head && head->sequence > fnode->sequence)
sbin/rcorder/rcorder.c
920
fnode->sequence = head->sequence;
sbin/rcorder/rcorder.c
948
head = Hash_GetValue(p->entry);
sbin/rcorder/rcorder.c
949
if (head->sequence < fnode->sequence)
sbin/rcorder/rcorder.c
950
head->sequence = fnode->sequence;
sbin/routed/radix.c
100
for (x = head, v = v_arg; x->rn_b >= 0;) {
sbin/routed/radix.c
111
struct radix_node *head,
sbin/routed/radix.c
117
for (x = head; x->rn_b >= 0;) {
sbin/routed/radix.c
154
rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)
sbin/routed/radix.c
161
head->rnh_treetop->rn_off)) == NULL)
sbin/routed/radix.c
165
x = rn_match(v_arg, head);
sbin/routed/radix.c
195
struct radix_node_head *head)
sbin/routed/radix.c
198
struct radix_node *t = head->rnh_treetop, *x;
sbin/routed/radix.c
334
struct radix_node_head *head,
sbin/routed/radix.c
339
struct radix_node *top = head->rnh_treetop;
sbin/routed/radix.c
511
struct radix_node_head *head,
sbin/routed/radix.c
516
struct radix_node *saved_tt, *top = head->rnh_treetop;
sbin/routed/radix.c
539
saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
sbin/routed/radix.c
56
struct radix_node_head *head, struct radix_node treenodes[2]);
sbin/routed/radix.c
57
static struct radix_node *rn_match(void *v_arg, struct radix_node_head *head);
sbin/routed/radix.c
654
struct radix_node_head *head)
sbin/routed/radix.c
664
x = head->rnh_treetop;
sbin/routed/radix.c
842
rn_inithead(struct radix_node_head **head, int off)
sbin/routed/radix.c
846
if (*head)
sbin/routed/radix.c
850
*head = rnh;
sbin/routed/radix.c
95
struct radix_node *head)
sbin/routed/radix.h
111
struct radix_node_head *head, struct radix_node nodes[]);
sbin/routed/radix.h
114
struct radix_node_head *head, struct radix_node nodes[]);
sbin/routed/radix.h
116
(void *v, void *mask, struct radix_node_head *head);
sbin/routed/radix.h
118
(void *v, void *mask, struct radix_node_head *head);
sbin/routed/radix.h
120
(void *v, struct radix_node_head *head);
sbin/routed/radix.h
122
(void *v, void *mask, struct radix_node_head *head);
sbin/routed/radix.h
124
(void *v, struct radix_node_head *head);
sbin/routed/radix.h
126
(struct radix_node_head *head,
sbin/routed/radix.h
138
int rn_inithead(struct radix_node_head **head, int off);
stand/efi/libefi/devpath.c
103
char *name, *tail, *head;
stand/efi/libefi/devpath.c
112
rv = asprintf(&head, "%sVendor(%s)[%x:", type, uuid, size);
stand/efi/libefi/devpath.c
119
rv = asprintf(&name, "%s%02x", head,
stand/efi/libefi/devpath.c
123
free(head);
stand/efi/libefi/devpath.c
126
free(head);
stand/efi/libefi/devpath.c
127
head = name;
stand/efi/libefi/devpath.c
131
if (asprintf(&name, "%s]%s", head, tail) < 0)
stand/efi/libefi/devpath.c
133
free(head);
stand/efi/libefi/efizfs.c
79
insert_zfs(EFI_HANDLE handle, uint64_t guid, bool head)
stand/efi/libefi/efizfs.c
87
if (head)
stand/i386/libi386/biosdisk.c
551
struct edd_params head;
stand/i386/libi386/biosdisk.c
558
params = &dparams.head;
stand/i386/libi386/biossmap.c
103
STAILQ_FOREACH(cur, &head, bufs)
stand/i386/libi386/biossmap.c
109
cur = STAILQ_FIRST(&head);
stand/i386/libi386/biossmap.c
57
STAILQ_HEAD(smap_head, smap_buf) head =
stand/i386/libi386/biossmap.c
58
STAILQ_HEAD_INITIALIZER(head);
stand/i386/libi386/biossmap.c
62
STAILQ_INIT(&head);
stand/i386/libi386/biossmap.c
87
STAILQ_INSERT_TAIL(&head, next, bufs);
stand/i386/libi386/biossmap.c
96
STAILQ_FOREACH(cur, &head, bufs)
stand/libsa/zfs/nvlist.c
1162
nvp_header_t head, *hp;
stand/libsa/zfs/nvlist.c
1203
head.encoded_size = NVPE_SIZE(namelen, encoded_size);
stand/libsa/zfs/nvlist.c
1204
head.decoded_size = NVP_SIZE(namelen + 1, decoded_size);
stand/libsa/zfs/nvlist.c
1206
if (nvl->nv_asize - nvl->nv_size < head.encoded_size + 8) {
stand/libsa/zfs/nvlist.c
1207
ptr = realloc(nvl->nv_data, nvl->nv_asize + head.encoded_size);
stand/libsa/zfs/nvlist.c
1211
nvl->nv_asize += head.encoded_size;
stand/libsa/zfs/nvlist.c
1214
bzero(nvl->nv_idx, head.encoded_size + 8);
stand/libsa/zfs/nvlist.c
1216
*hp = head;
stand/libsa/zfs/nvlist.c
1343
nvl->nv_size += head.encoded_size;
stand/libsa/zfs/nvlist.c
800
uint8_t *head, *tail;
stand/libsa/zfs/nvlist.c
820
head = (uint8_t *)nvp;
stand/libsa/zfs/nvlist.c
835
tail = head + nvp->encoded_size;
stand/libsa/zfs/nvlist.c
840
bcopy(tail, head, size);
stand/libsa/zfs/nvlist.c
844
head = head + nvp->encoded_size;
stand/libsa/zfs/nvlist.c
845
nvp = (nvp_header_t *)head;
stand/libsa/zfs/zfs.c
461
size_t res, head, tail, total_size, full_sec_size;
stand/libsa/zfs/zfs.c
504
head = offset % secsz;
stand/libsa/zfs/zfs.c
505
total_size = roundup2(head + bytes, secsz);
stand/libsa/zfs/zfs.c
506
tail = total_size - (head + bytes);
stand/libsa/zfs/zfs.c
507
do_tail_read = ((tail > 0) && (head + bytes > secsz));
stand/libsa/zfs/zfs.c
509
if (head > 0)
stand/libsa/zfs/zfs.c
515
if ((head > 0) || do_tail_read || bytes < secsz) {
stand/libsa/zfs/zfs.c
529
if (head > 0) {
stand/libsa/zfs/zfs.c
535
memcpy(outbuf, bouncebuf + head, min(secsz - head, bytes));
stand/libsa/zfs/zfs.c
536
outbuf += min(secsz - head, bytes);
stand/libsa/zfs/zfs.c
583
size_t head, tail, total_size, full_sec_size;
stand/libsa/zfs/zfs.c
598
head = offset % secsz;
stand/libsa/zfs/zfs.c
599
total_size = roundup2(head + bytes, secsz);
stand/libsa/zfs/zfs.c
600
tail = total_size - (head + bytes);
stand/libsa/zfs/zfs.c
601
do_tail_write = ((tail > 0) && (head + bytes > secsz));
stand/libsa/zfs/zfs.c
603
if (head > 0)
stand/libsa/zfs/zfs.c
609
if ((head > 0) || do_tail_write || bytes < secsz) {
stand/libsa/zfs/zfs.c
623
if (head > 0) {
stand/libsa/zfs/zfs.c
629
memcpy(bouncebuf + head, outbuf, min(secsz - head, bytes));
stand/libsa/zfs/zfs.c
636
outbuf += min(secsz - head, bytes);
sys/amd64/linux/linux_proto.h
1021
char head_l_[PADL_(struct linux_robust_list_head *)]; struct linux_robust_list_head * head; char head_r_[PADR_(struct linux_robust_list_head *)];
sys/amd64/linux/linux_proto.h
1026
char head_l_[PADL_(struct linux_robust_list_head **)]; struct linux_robust_list_head ** head; char head_r_[PADR_(struct linux_robust_list_head **)];
sys/amd64/linux/linux_systrace_args.c
2098
uarg[a++] = (intptr_t)p->head; /* struct linux_robust_list_head * */
sys/amd64/linux/linux_systrace_args.c
2107
uarg[a++] = (intptr_t)p->head; /* struct linux_robust_list_head ** */
sys/amd64/linux32/linux32_proto.h
1090
char head_l_[PADL_(struct linux_robust_list_head *)]; struct linux_robust_list_head * head; char head_r_[PADR_(struct linux_robust_list_head *)];
sys/amd64/linux32/linux32_proto.h
1095
char head_l_[PADL_(struct linux_robust_list_head **)]; struct linux_robust_list_head ** head; char head_r_[PADR_(struct linux_robust_list_head **)];
sys/amd64/linux32/linux32_systrace_args.c
2216
uarg[a++] = (intptr_t)p->head; /* struct linux_robust_list_head * */
sys/amd64/linux32/linux32_systrace_args.c
2225
uarg[a++] = (intptr_t)p->head; /* struct linux_robust_list_head ** */
sys/arm/arm/pmap-v6.c
1515
pmap_pte2list_alloc(vm_offset_t *head)
sys/arm/arm/pmap-v6.c
1520
va = *head;
sys/arm/arm/pmap-v6.c
1524
*head = *pte2p;
sys/arm/arm/pmap-v6.c
1525
if (*head & PTE2_V)
sys/arm/arm/pmap-v6.c
1532
pmap_pte2list_free(vm_offset_t *head, vm_offset_t va)
sys/arm/arm/pmap-v6.c
1539
*pte2p = *head; /* virtual! PTE2_V is 0 though */
sys/arm/arm/pmap-v6.c
1540
*head = va;
sys/arm/arm/pmap-v6.c
1544
pmap_pte2list_init(vm_offset_t *head, void *base, int npages)
sys/arm/arm/pmap-v6.c
1549
*head = 0;
sys/arm/arm/pmap-v6.c
1552
pmap_pte2list_free(head, va);
sys/arm/nvidia/drm2/tegra_dc.c
324
head) {
sys/arm/nvidia/drm2/tegra_dc.c
812
list_for_each_entry(tmp, &crtc->dev->mode_config.crtc_list, head) {
sys/arm/nvidia/drm2/tegra_host1x.c
266
list_for_each_entry(crtc, &drm->mode_config.crtc_list, head)
sys/arm/nvidia/drm2/tegra_host1x.c
286
list_for_each_entry(crtc, &drm_dev->mode_config.crtc_list, head) {
sys/arm/nvidia/drm2/tegra_host1x.c
300
list_for_each_entry(crtc, &drm_dev->mode_config.crtc_list, head) {
sys/arm64/linux/linux_proto.h
433
char head_l_[PADL_(struct linux_robust_list_head *)]; struct linux_robust_list_head * head; char head_r_[PADR_(struct linux_robust_list_head *)];
sys/arm64/linux/linux_proto.h
438
char head_l_[PADL_(struct linux_robust_list_head **)]; struct linux_robust_list_head ** head; char head_r_[PADR_(struct linux_robust_list_head **)];
sys/arm64/linux/linux_sigframe.h
40
struct _l_aarch64_ctx head;
sys/arm64/linux/linux_sigframe.h
47
struct _l_aarch64_ctx head;
sys/arm64/linux/linux_systrace_args.c
801
uarg[a++] = (intptr_t)p->head; /* struct linux_robust_list_head * */
sys/arm64/linux/linux_systrace_args.c
810
uarg[a++] = (intptr_t)p->head; /* struct linux_robust_list_head ** */
sys/arm64/linux/linux_sysvec.c
379
fpsimd->head.magic = L_FPSIMD_MAGIC;
sys/arm64/linux/linux_sysvec.c
380
fpsimd->head.size = sizeof(struct l_fpsimd_context);
sys/arm64/linux/linux_sysvec.c
390
esr->head.magic = L_ESR_MAGIC;
sys/arm64/linux/linux_sysvec.c
391
esr->head.size = sizeof(struct l_esr_context);
sys/cam/scsi/scsi_da.h
426
uint8_t head;
sys/cam/scsi/scsi_da.h
436
uint8_t head;
sys/compat/linux/linux_futex.c
1016
struct linux_robust_list_head *head;
sys/compat/linux/linux_futex.c
1023
head = em->robust_futexes;
sys/compat/linux/linux_futex.c
1024
if (head == NULL)
sys/compat/linux/linux_futex.c
1027
if (fetch_robust_entry(&entry, PTRIN(&head->list.next), &pi))
sys/compat/linux/linux_futex.c
1030
error = copyin(&head->futex_offset, &futex_offset,
sys/compat/linux/linux_futex.c
1035
if (fetch_robust_entry(&pending, PTRIN(&head->pending_list), &pip))
sys/compat/linux/linux_futex.c
1038
while (entry != &head->list) {
sys/compat/linux/linux_futex.c
881
em->robust_futexes = args->head;
sys/compat/linux/linux_futex.c
890
struct linux_robust_list_head *head;
sys/compat/linux/linux_futex.c
898
head = em->robust_futexes;
sys/compat/linux/linux_futex.c
917
head = em->robust_futexes;
sys/compat/linux/linux_futex.c
927
return (copyout(&head, args->head, sizeof(l_uintptr_t)));
sys/compat/linux/linux_futex.c
994
struct linux_robust_list **head, unsigned int *pi)
sys/compat/linux/linux_futex.c
999
error = copyin((const void *)head, &uentry, sizeof(uentry));
sys/compat/linuxkpi/common/include/linux/circ_buf.h
30
#define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size) - 1))
sys/compat/linuxkpi/common/include/linux/circ_buf.h
31
#define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head) + 1),(size))
sys/compat/linuxkpi/common/include/linux/hashtable.h
111
if (!CK_LIST_EMPTY(&ht[x].head))
sys/compat/linuxkpi/common/include/linux/hashtable.h
131
const struct lkpi_hash_entry *__first = CK_LIST_FIRST(&(ht)->head); \
sys/compat/linuxkpi/common/include/linux/hashtable.h
48
CK_LIST_HEAD(, lkpi_hash_entry) head;
sys/compat/linuxkpi/common/include/linux/hashtable.h
72
CK_LIST_INIT(&ht[x].head);
sys/compat/linuxkpi/common/include/linux/hashtable.h
95
CK_LIST_INSERT_HEAD(&__head->head, \
sys/compat/linuxkpi/common/include/linux/kfifo.h
107
*(_e) = (_kf)->head[(_kf)->first]; \
sys/compat/linuxkpi/common/include/linux/kfifo.h
122
(_kf)->head = kmalloc(sizeof(__typeof(*(_kf)->head)) * (_s), _gfp); \
sys/compat/linuxkpi/common/include/linux/kfifo.h
123
if ((_kf)->head == NULL) \
sys/compat/linuxkpi/common/include/linux/kfifo.h
135
kfree((_kf)->head); \
sys/compat/linuxkpi/common/include/linux/kfifo.h
136
(_kf)->head = NULL; \
sys/compat/linuxkpi/common/include/linux/kfifo.h
42
(_kf).total = nitems((_kf).head); \
sys/compat/linuxkpi/common/include/linux/kfifo.h
54
_type head[_size]; \
sys/compat/linuxkpi/common/include/linux/kfifo.h
63
_type *head; \
sys/compat/linuxkpi/common/include/linux/kfifo.h
89
(_kf)->head[(_kf)->last] = (_e); \
sys/compat/linuxkpi/common/include/linux/list.h
102
list_empty_careful(const struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
104
struct list_head *next = head->next;
sys/compat/linuxkpi/common/include/linux/list.h
106
return ((next == head) && (next == head->prev));
sys/compat/linuxkpi/common/include/linux/list.h
185
#define list_for_each(p, head) \
sys/compat/linuxkpi/common/include/linux/list.h
186
for (p = (head)->next; p != (head); p = (p)->next)
sys/compat/linuxkpi/common/include/linux/list.h
188
#define list_for_each_safe(p, n, head) \
sys/compat/linuxkpi/common/include/linux/list.h
189
for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
sys/compat/linuxkpi/common/include/linux/list.h
208
#define list_for_each_entry_safe_from(pos, n, head, member) \
sys/compat/linuxkpi/common/include/linux/list.h
210
&(pos)->member != (head); \
sys/compat/linuxkpi/common/include/linux/list.h
237
#define list_for_each_rcu(p, head) \
sys/compat/linuxkpi/common/include/linux/list.h
238
for (p = rcu_dereference((head)->next); \
sys/compat/linuxkpi/common/include/linux/list.h
239
p != (head); \
sys/compat/linuxkpi/common/include/linux/list.h
243
list_add(struct list_head *new, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
246
__list_add(new, head, head->next);
sys/compat/linuxkpi/common/include/linux/list.h
250
list_add_tail(struct list_head *new, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
253
__list_add(new, head->prev, head);
sys/compat/linuxkpi/common/include/linux/list.h
257
list_move(struct list_head *list, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
261
list_add(list, head);
sys/compat/linuxkpi/common/include/linux/list.h
265
list_move_tail(struct list_head *entry, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
269
list_add_tail(entry, head);
sys/compat/linuxkpi/common/include/linux/list.h
273
list_rotate_to_front(struct list_head *entry, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
276
list_move_tail(entry, head);
sys/compat/linuxkpi/common/include/linux/list.h
280
list_bulk_move_tail(struct list_head *head, struct list_head *first,
sys/compat/linuxkpi/common/include/linux/list.h
285
head->prev->next = first;
sys/compat/linuxkpi/common/include/linux/list.h
286
first->prev = head->prev;
sys/compat/linuxkpi/common/include/linux/list.h
287
last->next = head;
sys/compat/linuxkpi/common/include/linux/list.h
288
head->prev = last;
sys/compat/linuxkpi/common/include/linux/list.h
309
list_splice(const struct list_head *list, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
312
linux_list_splice(list, head, head->next);
sys/compat/linuxkpi/common/include/linux/list.h
316
list_splice_tail(struct list_head *list, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
319
linux_list_splice(list, head->prev, head);
sys/compat/linuxkpi/common/include/linux/list.h
323
list_splice_init(struct list_head *list, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
326
linux_list_splice(list, head, head->next);
sys/compat/linuxkpi/common/include/linux/list.h
331
list_splice_tail_init(struct list_head *list, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
334
linux_list_splice(list, head->prev, head);
sys/compat/linuxkpi/common/include/linux/list.h
350
#define INIT_HLIST_HEAD(head) (head)->first = NULL
sys/compat/linuxkpi/common/include/linux/list.h
433
static inline int list_is_singular(const struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
435
return !list_empty(head) && (head->next == head->prev);
sys/compat/linuxkpi/common/include/linux/list.h
439
struct list_head *head, struct list_head *entry)
sys/compat/linuxkpi/common/include/linux/list.h
442
list->next = head->next;
sys/compat/linuxkpi/common/include/linux/list.h
446
head->next = new_first;
sys/compat/linuxkpi/common/include/linux/list.h
447
new_first->prev = head;
sys/compat/linuxkpi/common/include/linux/list.h
451
struct list_head *head, struct list_head *entry)
sys/compat/linuxkpi/common/include/linux/list.h
453
if (list_empty(head))
sys/compat/linuxkpi/common/include/linux/list.h
455
if (list_is_singular(head) &&
sys/compat/linuxkpi/common/include/linux/list.h
456
(head->next != entry && head != entry))
sys/compat/linuxkpi/common/include/linux/list.h
458
if (entry == head)
sys/compat/linuxkpi/common/include/linux/list.h
461
__list_cut_position(list, head, entry);
sys/compat/linuxkpi/common/include/linux/list.h
465
const struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
468
return (list->prev == head);
sys/compat/linuxkpi/common/include/linux/list.h
472
const struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
474
return list->next == head;
sys/compat/linuxkpi/common/include/linux/list.h
493
#define hlist_for_each(p, head) \
sys/compat/linuxkpi/common/include/linux/list.h
494
for (p = (head)->first; p; p = (p)->next)
sys/compat/linuxkpi/common/include/linux/list.h
496
#define hlist_for_each_safe(p, n, head) \
sys/compat/linuxkpi/common/include/linux/list.h
497
for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)
sys/compat/linuxkpi/common/include/linux/list.h
502
#define hlist_for_each_entry(pos, head, member) \
sys/compat/linuxkpi/common/include/linux/list.h
503
for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
sys/compat/linuxkpi/common/include/linux/list.h
516
#define hlist_for_each_entry_safe(pos, n, head, member) \
sys/compat/linuxkpi/common/include/linux/list.h
517
for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member); \
sys/compat/linuxkpi/common/include/linux/list.h
522
extern void list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
sys/compat/linuxkpi/common/include/linux/list.h
525
extern void list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
sys/compat/linuxkpi/common/include/linux/list.h
95
list_empty(const struct list_head *head)
sys/compat/linuxkpi/common/include/linux/list.h
98
return (head->next == head);
sys/compat/linuxkpi/common/include/linux/llist.h
24
llist_del_all(struct llist_head *head)
sys/compat/linuxkpi/common/include/linux/llist.h
26
return ((void *)atomic_readandclear_ptr((uintptr_t *)&head->first));
sys/compat/linuxkpi/common/include/linux/llist.h
30
llist_del_first(struct llist_head *head)
sys/compat/linuxkpi/common/include/linux/llist.h
35
first = head->first;
sys/compat/linuxkpi/common/include/linux/llist.h
39
} while (atomic_cmpset_ptr((uintptr_t *)&head->first,
sys/compat/linuxkpi/common/include/linux/llist.h
46
llist_add(struct llist_node *new, struct llist_head *head)
sys/compat/linuxkpi/common/include/linux/llist.h
51
new->next = first = head->first;
sys/compat/linuxkpi/common/include/linux/llist.h
52
} while (atomic_cmpset_ptr((uintptr_t *)&head->first,
sys/compat/linuxkpi/common/include/linux/llist.h
60
struct llist_head *head)
sys/compat/linuxkpi/common/include/linux/llist.h
65
new_last->next = first = head->first;
sys/compat/linuxkpi/common/include/linux/llist.h
66
} while (atomic_cmpset_ptr((uintptr_t *)&head->first,
sys/compat/linuxkpi/common/include/linux/llist.h
73
init_llist_head(struct llist_head *head)
sys/compat/linuxkpi/common/include/linux/llist.h
75
head->first = NULL;
sys/compat/linuxkpi/common/include/linux/llist.h
79
llist_empty(struct llist_head *head)
sys/compat/linuxkpi/common/include/linux/llist.h
81
return (head->first == NULL);
sys/compat/linuxkpi/common/include/linux/netdevice.h
365
netif_receive_skb_list(struct list_head *head)
sys/compat/linuxkpi/common/include/linux/rbtree.h
116
#define rbtree_postorder_for_each_entry_safe(x, y, head, member) \
sys/compat/linuxkpi/common/include/linux/rbtree.h
117
for ((x) = rb_entry_safe(__rb_deepest_left((head)->rb_node), \
sys/compat/linuxkpi/common/include/linux/rculist.h
108
#define hlist_for_each_entry_rcu(pos, head, member) \
sys/compat/linuxkpi/common/include/linux/rculist.h
109
for (pos = hlist_entry_safe (rcu_dereference_raw(hlist_first_rcu(head)),\
sys/compat/linuxkpi/common/include/linux/rculist.h
37
#define list_next_rcu(head) (*((struct list_head **)(&(head)->next)))
sys/compat/linuxkpi/common/include/linux/rculist.h
38
#define list_prev_rcu(head) (*((struct list_head **)(&(head)->prev)))
sys/compat/linuxkpi/common/include/linux/rculist.h
40
#define list_for_each_entry_rcu(pos, head, member) \
sys/compat/linuxkpi/common/include/linux/rculist.h
41
for (pos = list_entry_rcu((head)->next, typeof(*(pos)), member); \
sys/compat/linuxkpi/common/include/linux/rculist.h
42
&(pos)->member != (head); \
sys/compat/linuxkpi/common/include/linux/rculist.h
45
#define list_for_each_entry_from_rcu(pos, head, member) \
sys/compat/linuxkpi/common/include/linux/rculist.h
47
&(pos)->member != (head); \
sys/compat/linuxkpi/common/include/linux/rculist.h
50
#define list_for_each_entry_lockless(pos, head, member) \
sys/compat/linuxkpi/common/include/linux/rculist.h
51
list_for_each_entry_rcu(pos, head, member)
sys/compat/linuxkpi/common/include/linux/rculist.h
64
list_add_rcu(struct list_head *new, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/rculist.h
66
linux_list_add_rcu(new, head, head->next);
sys/compat/linuxkpi/common/include/linux/rculist.h
70
list_add_tail_rcu(struct list_head *new, struct list_head *head)
sys/compat/linuxkpi/common/include/linux/rculist.h
72
linux_list_add_rcu(new, head->prev, head);
sys/compat/linuxkpi/common/include/linux/rculist.h
94
#define hlist_first_rcu(head) (*((struct hlist_node **)(&(head)->first)))
sys/compat/linuxkpi/common/include/linux/skbuff.h
1028
return (skb->head + skb->mac_header);
sys/compat/linuxkpi/common/include/linux/skbuff.h
1035
skb->mac_header = skb->data - skb->head;
sys/compat/linuxkpi/common/include/linux/skbuff.h
1079
skb->tail = (uint8_t *)(uintptr_t)(skb->data - skb->head);
sys/compat/linuxkpi/common/include/linux/skbuff.h
156
uint8_t *head; /* Head of buffer. */
sys/compat/linuxkpi/common/include/linux/skbuff.h
308
KASSERT(skb->data == skb->head, ("%s: skb %p not empty head %p data %p "
sys/compat/linuxkpi/common/include/linux/skbuff.h
309
"tail %p\n", __func__, skb, skb->head, skb->data, skb->tail));
sys/compat/linuxkpi/common/include/linux/skbuff.h
313
skb->head, skb->data, skb->tail, skb->len));
sys/compat/linuxkpi/common/include/linux/skbuff.h
327
KASSERT(((skb->data - len) >= skb->head), ("%s: skb %p (data %p - "
sys/compat/linuxkpi/common/include/linux/skbuff.h
381
KASSERT((skb->data - skb->head) >= 0, ("%s: skb %p headroom < 0, "
sys/compat/linuxkpi/common/include/linux/skbuff.h
382
"data %p head %p\n", __func__, skb, skb->data, skb->head));
sys/compat/linuxkpi/common/include/linux/skbuff.h
383
return (skb->data - skb->head);
sys/compat/linuxkpi/common/include/linux/skbuff.h
399
skb, skb->tail, len, skb->end, skb->head, skb->data, skb->len));
sys/compat/linuxkpi/common/include/linux/skbuff.h
409
__func__, skb, skb->len, skb->head, skb->data, skb->tail, skb->end,
sys/compat/linuxkpi/common/include/linux/skbuff.h
510
skb, skb->head, skb->data, skb->tail, skb->end, skb->len, fragno,
sys/compat/linuxkpi/common/include/linux/skbuff.h
951
skb->l4hdroff = skb->data - skb->head;
sys/compat/linuxkpi/common/include/linux/skbuff.h
959
return (skb->head + skb->l4hdroff);
sys/compat/linuxkpi/common/include/linux/skbuff.h
967
return (skb->head + skb->l3hdroff);
sys/compat/linuxkpi/common/include/linux/types.h
92
typedef void (*rcu_callback_t)(struct rcu_head *head);
sys/compat/linuxkpi/common/include/linux/types.h
93
typedef void (*call_rcu_func_t)(struct rcu_head *head, rcu_callback_t func);
sys/compat/linuxkpi/common/include/linux/wait.h
266
list_add_tail(&wq->entry, &wqh->head);
sys/compat/linuxkpi/common/include/linux/wait.h
84
struct list_head head; /* >= v4.13 */
sys/compat/linuxkpi/common/include/net/cfg80211.h
477
const uint8_t *head;
sys/compat/linuxkpi/common/src/linux_80211.c
7511
skb->truesize, skb->head, skb->data, skb->tail, skb->end,
sys/compat/linuxkpi/common/src/linux_compat.c
145
#define RB_ROOT(head) (head)->rbh_root
sys/compat/linuxkpi/common/src/linux_compat.c
2593
list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
sys/compat/linuxkpi/common/src/linux_compat.c
2601
list_for_each(le, head)
sys/compat/linuxkpi/common/src/linux_compat.c
2605
list_for_each(le, head)
sys/compat/linuxkpi/common/src/linux_compat.c
2610
INIT_LIST_HEAD(head);
sys/compat/linuxkpi/common/src/linux_compat.c
2612
list_add_tail(ar[i], head);
sys/compat/linuxkpi/common/src/linux_idr.c
139
cacheval->ary[0] = lic->head;
sys/compat/linuxkpi/common/src/linux_idr.c
140
lic->head = cacheval;
sys/compat/linuxkpi/common/src/linux_idr.c
364
struct idr_layer *head;
sys/compat/linuxkpi/common/src/linux_idr.c
375
for (head = NULL; need; need--) {
sys/compat/linuxkpi/common/src/linux_idr.c
380
if (head != NULL) {
sys/compat/linuxkpi/common/src/linux_idr.c
384
head = il = iln;
sys/compat/linuxkpi/common/src/linux_idr.c
386
if (head == NULL)
sys/compat/linuxkpi/common/src/linux_idr.c
390
idr->free = head;
sys/compat/linuxkpi/common/src/linux_idr.c
50
struct idr_layer *head;
sys/compat/linuxkpi/common/src/linux_idr.c
74
retval = lic->head;
sys/compat/linuxkpi/common/src/linux_idr.c
76
lic->head = retval->ary[0];
sys/compat/linuxkpi/common/src/linux_rcu.c
120
struct linux_epoch_head *head;
sys/compat/linuxkpi/common/src/linux_rcu.c
127
head = &linux_epoch_head[j];
sys/compat/linuxkpi/common/src/linux_rcu.c
129
TASK_INIT(&head->task, 0, linux_rcu_cleaner_func, head);
sys/compat/linuxkpi/common/src/linux_rcu.c
130
init_llist_head(&head->cb_head);
sys/compat/linuxkpi/common/src/linux_rcu.c
150
struct linux_epoch_head *head = context;
sys/compat/linuxkpi/common/src/linux_rcu.c
158
llist_for_each_safe(node, next, llist_del_all(&head->cb_head)) {
sys/compat/linuxkpi/common/src/linux_rcu.c
165
linux_synchronize_rcu(head - linux_epoch_head);
sys/compat/linuxkpi/common/src/linux_rcu.c
395
struct linux_epoch_head *head;
sys/compat/linuxkpi/common/src/linux_rcu.c
405
head = &linux_epoch_head[type];
sys/compat/linuxkpi/common/src/linux_rcu.c
408
taskqueue_drain(linux_irq_work_tq, &head->task);
sys/compat/linuxkpi/common/src/linux_rcu.c
415
struct linux_epoch_head *head;
sys/compat/linuxkpi/common/src/linux_rcu.c
420
head = &linux_epoch_head[type];
sys/compat/linuxkpi/common/src/linux_rcu.c
423
llist_add(&rcu->node, &head->cb_head);
sys/compat/linuxkpi/common/src/linux_rcu.c
424
taskqueue_enqueue(linux_irq_work_tq, &head->task);
sys/compat/linuxkpi/common/src/linux_skbuff.c
140
skb->head = skb->data = (uint8_t *)p;
sys/compat/linuxkpi/common/src/linux_skbuff.c
142
skb->end = skb->head + size;
sys/compat/linuxkpi/common/src/linux_skbuff.c
180
skb->head = skb->data = data;
sys/compat/linuxkpi/common/src/linux_skbuff.c
182
skb->end = skb->head + fragsz;
sys/compat/linuxkpi/common/src/linux_skbuff.c
196
len = skb->end - skb->head + skb->data_len;
sys/compat/linuxkpi/common/src/linux_skbuff.c
208
memcpy(new->head, skb->data - headroom, headroom + skb->len);
sys/compat/linuxkpi/common/src/linux_skbuff.c
273
p = skb->head;
sys/compat/linuxkpi/common/src/linux_skbuff.c
275
skb->head = NULL;
sys/compat/linuxkpi/common/src/linux_skbuff.c
280
free(skb->head, M_LKPISKB);
sys/compat/linuxkpi/common/src/linux_skbuff.c
283
kfree(skb->head);
sys/compat/linuxkpi/common/src/linux_skbuff.c
330
skb->head, skb->data, skb->tail, skb->end);
sys/compat/linuxkpi/common/src/linux_slab.c
103
linux_kmem_cache_free_rcu_callback(struct rcu_head *head)
sys/compat/linuxkpi/common/src/linux_slab.c
106
container_of(head, struct linux_kmem_rcu, rcu_head);
sys/compat/linuxkpi/common/src/linux_tasklet.c
116
TAILQ_INIT(&tw->head);
sys/compat/linuxkpi/common/src/linux_tasklet.c
202
TAILQ_INSERT_TAIL(&tw->head, ts, entry);
sys/compat/linuxkpi/common/src/linux_tasklet.c
53
TAILQ_HEAD(tasklet_list, tasklet_struct) head;
sys/compat/linuxkpi/common/src/linux_tasklet.c
72
last = TAILQ_LAST(&tw->head, tasklet_list);
sys/compat/linuxkpi/common/src/linux_tasklet.c
74
ts = TAILQ_FIRST(&tw->head);
sys/compat/linuxkpi/common/src/linux_tasklet.c
77
TAILQ_REMOVE(&tw->head, ts, entry);
sys/compat/linuxkpi/common/src/linux_tasklet.c
94
TAILQ_INSERT_TAIL(&tw->head, ts, entry);
sys/dev/aq/aq_ring.c
587
uint32_t head;
sys/dev/aq/aq_ring.c
592
head = tdm_tx_desc_head_ptr_get(&aq_dev->hw, ring->index);
sys/dev/aq/aq_ring.c
593
AQ_DBG_PRINT("swhead %d hwhead %d", ring->tx_head, head);
sys/dev/aq/aq_ring.c
595
if (ring->tx_head == head) {
sys/dev/aq/aq_ring.c
600
avail = aq_avail_desc(head, ring->tx_head, ring->tx_size);
sys/dev/aq/aq_ring.c
602
ring->tx_head = head;
sys/dev/ath/if_ath_descdma.c
144
struct ath_descdma *dd, ath_bufhead *head,
sys/dev/ath/if_ath_descdma.c
237
struct ath_descdma *dd, ath_bufhead *head,
sys/dev/ath/if_ath_descdma.c
249
error = ath_descdma_alloc_desc(sc, dd, head, name, ds_size,
sys/dev/ath/if_ath_descdma.c
270
TAILQ_INIT(head);
sys/dev/ath/if_ath_descdma.c
294
ath_descdma_cleanup(sc, dd, head);
sys/dev/ath/if_ath_descdma.c
298
TAILQ_INSERT_TAIL(head, bf, bf_list);
sys/dev/ath/if_ath_descdma.c
326
struct ath_descdma *dd, ath_bufhead *head,
sys/dev/ath/if_ath_descdma.c
359
TAILQ_INIT(head);
sys/dev/ath/if_ath_descdma.c
371
ath_descdma_cleanup(sc, dd, head);
sys/dev/ath/if_ath_descdma.c
374
TAILQ_INSERT_TAIL(head, bf, bf_list);
sys/dev/ath/if_ath_descdma.c
384
struct ath_descdma *dd, ath_bufhead *head)
sys/dev/ath/if_ath_descdma.c
396
if (head != NULL) {
sys/dev/ath/if_ath_descdma.c
397
TAILQ_FOREACH(bf, head, bf_list) {
sys/dev/ath/if_ath_descdma.c
434
if (head != NULL)
sys/dev/ath/if_ath_descdma.c
435
TAILQ_INIT(head);
sys/dev/ath/if_ath_descdma.h
33
struct ath_descdma *dd, ath_bufhead *head, const char *name,
sys/dev/ath/if_ath_descdma.h
36
ath_bufhead *head, const char *name, int ds_size, int nbuf,
sys/dev/ath/if_ath_descdma.h
39
struct ath_descdma *dd, ath_bufhead *head, const char *name,
sys/dev/ath/if_ath_descdma.h
42
struct ath_descdma *dd, ath_bufhead *head);
sys/dev/atkbdc/atkbdc.c
275
sc->kbd.head = sc->kbd.tail = 0;
sys/dev/atkbdc/atkbdc.c
276
sc->aux.head = sc->aux.tail = 0;
sys/dev/atkbdc/atkbdc.c
396
if (nextq(q->tail) != q->head) {
sys/dev/atkbdc/atkbdc.c
415
if (q->tail != q->head) {
sys/dev/atkbdc/atkbdc.c
416
c = q->q[q->head];
sys/dev/atkbdc/atkbdc.c
417
q->head = nextq(q->head);
sys/dev/atkbdc/atkbdc.c
66
#define availq(q) ((q)->head != (q)->tail)
sys/dev/atkbdc/atkbdc.c
68
#define emptyq(q) ((q)->tail = (q)->head = (q)->qcount = 0)
sys/dev/atkbdc/atkbdc.c
70
#define emptyq(q) ((q)->tail = (q)->head = 0)
sys/dev/atkbdc/atkbdcreg.h
182
int head;
sys/dev/atkbdc/psm.c
170
int head; /* head pointer */
sys/dev/atkbdc/psm.c
2244
sc->queue.head = 0;
sys/dev/atkbdc/psm.c
2479
if (l > sizeof(sc->queue.buf) - sc->queue.head) {
sys/dev/atkbdc/psm.c
2480
bcopy(&sc->queue.buf[sc->queue.head], &buf[0],
sys/dev/atkbdc/psm.c
2481
sizeof(sc->queue.buf) - sc->queue.head);
sys/dev/atkbdc/psm.c
2483
&buf[sizeof(sc->queue.buf) - sc->queue.head],
sys/dev/atkbdc/psm.c
2484
l - (sizeof(sc->queue.buf) - sc->queue.head));
sys/dev/atkbdc/psm.c
2486
bcopy(&sc->queue.buf[sc->queue.head], &buf[0], l);
sys/dev/atkbdc/psm.c
2488
sc->queue.head = (sc->queue.head + l) % sizeof(sc->queue.buf);
sys/dev/atkbdc/psm.c
2543
sc->queue.head = 0;
sys/dev/bnxt/bnxt_re/bnxt_re.h
392
&(_rdev)->res_list[_type].head); \
sys/dev/bnxt/bnxt_re/bnxt_re.h
433
struct list_head head;
sys/dev/bxe/ecore_sp.c
1387
if (ECORE_LIST_IS_EMPTY(&o->head)) {
sys/dev/bxe/ecore_sp.c
1394
*ppos = ECORE_LIST_FIRST_ENTRY(&o->head,
sys/dev/bxe/ecore_sp.c
1404
if (ECORE_LIST_IS_LAST(&pos->link, &o->head))
sys/dev/bxe/ecore_sp.c
2002
&cam_obj->head);
sys/dev/bxe/ecore_sp.c
2040
ECORE_LIST_REMOVE_ENTRY(&reg_elem->link, &o->head);
sys/dev/bxe/ecore_sp.c
2071
&cam_obj->head);
sys/dev/bxe/ecore_sp.c
2253
ECORE_LIST_FOR_EACH_ENTRY(pos, &o->head, link,
sys/dev/bxe/ecore_sp.c
2302
ECORE_LIST_INIT(&o->head);
sys/dev/bxe/ecore_sp.c
664
ECORE_LIST_FOR_EACH_ENTRY(pos, &o->head, link,
sys/dev/bxe/ecore_sp.c
696
ECORE_LIST_FOR_EACH_ENTRY(pos, &o->head, link,
sys/dev/bxe/ecore_sp.c
713
ECORE_LIST_FOR_EACH_ENTRY(pos, &o->head, link,
sys/dev/bxe/ecore_sp.c
730
ECORE_LIST_FOR_EACH_ENTRY(pos, &o->head, link,
sys/dev/bxe/ecore_sp.c
751
ECORE_LIST_FOR_EACH_ENTRY(pos, &o->head, link,
sys/dev/bxe/ecore_sp.c
772
ECORE_LIST_FOR_EACH_ENTRY(pos, &o->head, link,
sys/dev/bxe/ecore_sp.c
790
ECORE_LIST_FOR_EACH_ENTRY(pos, &o->head, link,
sys/dev/bxe/ecore_sp.c
808
ECORE_LIST_FOR_EACH_ENTRY(pos, &o->head, link,
sys/dev/bxe/ecore_sp.c
831
ECORE_LIST_FOR_EACH_ENTRY(pos, &o->head, link,
sys/dev/bxe/ecore_sp.h
282
ecore_list_entry_t *head, *tail;
sys/dev/bxe/ecore_sp.h
289
(_list)->head = NULL; \
sys/dev/bxe/ecore_sp.h
304
(cast *)((_list)->head)
sys/dev/bxe/ecore_sp.h
314
(_elem)->next = (_list)->head; \
sys/dev/bxe/ecore_sp.h
318
(_list)->head->prev = (_elem); \
sys/dev/bxe/ecore_sp.h
320
(_list)->head = (_elem); \
sys/dev/bxe/ecore_sp.h
332
(_list)->head = (_elem); \
sys/dev/bxe/ecore_sp.h
341
(_list1)->tail->next = (_list2)->head; \
sys/dev/bxe/ecore_sp.h
342
if ((_list2)->head) { \
sys/dev/bxe/ecore_sp.h
343
(_list2)->head->prev = (_list1)->tail; \
sys/dev/bxe/ecore_sp.h
347
(_list2)->head = (_list1)->head; \
sys/dev/bxe/ecore_sp.h
349
(_list1)->head = NULL; \
sys/dev/bxe/ecore_sp.h
357
if ((_list)->head == (_elem)) { \
sys/dev/bxe/ecore_sp.h
358
if ((_list)->head) { \
sys/dev/bxe/ecore_sp.h
359
(_list)->head = (_list)->head->next; \
sys/dev/bxe/ecore_sp.h
360
if ((_list)->head) { \
sys/dev/bxe/ecore_sp.h
361
(_list)->head->prev = (ecore_list_entry_t *)0; \
sys/dev/bxe/ecore_sp.h
373
(_list)->head = (ecore_list_entry_t *)0; \
sys/dev/bxe/ecore_sp.h
754
ecore_list_t head;
sys/dev/ciss/cissvar.h
358
ciss_enqueue_complete(struct ciss_request *ac, cr_qhead_t *head)
sys/dev/ciss/cissvar.h
361
STAILQ_INSERT_TAIL(head, ac, cr_link);
sys/dev/ciss/cissvar.h
365
ciss_dequeue_complete(struct ciss_softc *sc, cr_qhead_t *head)
sys/dev/ciss/cissvar.h
369
if ((ac = STAILQ_FIRST(head)) != NULL)
sys/dev/ciss/cissvar.h
370
STAILQ_REMOVE_HEAD(head, cr_link);
sys/dev/cxgbe/adapter.h
1179
#define IDXDIFF(head, tail, wrap) \
sys/dev/cxgbe/adapter.h
1180
((head) >= (tail) ? (head) - (tail) : (wrap) - (tail) + (head))
sys/dev/cxgbe/nvmf/nvmf_che.c
1262
TAILQ_FOREACH(cb, &qp->rx_buffers.head, link) {
sys/dev/cxgbe/nvmf/nvmf_che.c
1272
TAILQ_REMOVE(&qp->rx_buffers.head, cb, link);
sys/dev/cxgbe/nvmf/nvmf_che.c
174
TAILQ_HEAD(, nvmf_che_command_buffer) head;
sys/dev/cxgbe/nvmf/nvmf_che.c
2627
TAILQ_INIT(&qp->rx_buffers.head);
sys/dev/cxgbe/nvmf/nvmf_che.c
2628
TAILQ_INIT(&qp->tx_buffers.head);
sys/dev/cxgbe/nvmf/nvmf_che.c
2735
TAILQ_FOREACH_SAFE(cb, &qp->rx_buffers.head, link, ncb) {
sys/dev/cxgbe/nvmf/nvmf_che.c
2749
TAILQ_FOREACH_SAFE(cb, &qp->tx_buffers.head, link, ncb) {
sys/dev/cxgbe/nvmf/nvmf_che.c
2948
TAILQ_INSERT_TAIL(&qp->rx_buffers.head, cb, link);
sys/dev/cxgbe/nvmf/nvmf_che.c
438
TAILQ_INSERT_HEAD(&list->head, cb, link);
sys/dev/cxgbe/nvmf/nvmf_che.c
448
TAILQ_FOREACH(cb, &list->head, link) {
sys/dev/cxgbe/nvmf/nvmf_che.c
460
TAILQ_REMOVE(&list->head, cb, link);
sys/dev/cxgbe/t4_filter.c
141
LIST_HEAD(, filter_entry) *head;
sys/dev/cxgbe/t4_filter.c
149
head = t->hftid_hash_tid;
sys/dev/cxgbe/t4_filter.c
151
LIST_FOREACH_SAFE(f, &head[i], link_tid, ftmp) {
sys/dev/cxgbe/t4_filter.c
157
head = t->hftid_hash_4t;
sys/dev/cxgbe/t4_filter.c
159
LIST_FOREACH_SAFE(f, &head[i], link_4t, ftmp) {
sys/dev/cxgbe/t4_filter.c
189
LIST_HEAD(, filter_entry) *head = t->hftid_hash_4t;
sys/dev/cxgbe/t4_filter.c
191
MPASS(head != NULL);
sys/dev/cxgbe/t4_filter.c
194
LIST_INSERT_HEAD(&head[hash & t->hftid_4t_mask], f, link_4t);
sys/dev/cxgbe/t4_filter.c
202
LIST_HEAD(, filter_entry) *head = t->hftid_hash_tid;
sys/dev/cxgbe/t4_filter.c
210
LIST_INSERT_HEAD(&head[hash & t->hftid_tid_mask], f, link_tid);
sys/dev/cxgbe/t4_filter.c
265
LIST_HEAD(, filter_entry) *head = t->hftid_hash_4t;
sys/dev/cxgbe/t4_filter.c
269
MPASS(head != NULL);
sys/dev/cxgbe/t4_filter.c
274
LIST_FOREACH(f, &head[hash & t->hftid_4t_mask], link_4t) {
sys/dev/cxgbe/t4_filter.c
286
LIST_HEAD(, filter_entry) *head = t->hftid_hash_tid;
sys/dev/cxgbe/t4_filter.c
291
MPASS(head != NULL);
sys/dev/cxgbe/t4_filter.c
294
LIST_FOREACH(f, &head[hash & t->hftid_tid_mask], link_tid) {
sys/dev/cxgbe/t4_netmap.c
1116
const u_int head = kring->rhead;
sys/dev/cxgbe/t4_netmap.c
1127
npkt_remaining = head >= kring->nr_hwcur ? head - kring->nr_hwcur :
sys/dev/cxgbe/t4_netmap.c
1128
kring->nkr_num_slots - kring->nr_hwcur + head;
sys/dev/cxgbe/t4_netmap.c
1155
MPASS(kring->nr_hwcur == head);
sys/dev/cxgbe/t4_netmap.c
1180
u_int const head = kring->rhead;
sys/dev/cxgbe/t4_netmap.c
1200
n = head >= kring->nr_hwcur ? head - kring->nr_hwcur :
sys/dev/cxgbe/t4_netmap.c
1201
kring->nkr_num_slots - kring->nr_hwcur + head;
sys/dev/dpaa2/dpaa2_ni.c
3030
.head = NULL,
sys/dev/dpaa2/dpaa2_ni.c
3200
if (ctx->head == NULL) {
sys/dev/dpaa2/dpaa2_ni.c
3202
ctx->head = m;
sys/dev/dpaa2/dpaa2_ni.c
3205
KASSERT(ctx->head != NULL, ("%s: head is NULL", __func__));
sys/dev/dpaa2/dpaa2_ni.c
3213
if_input(sc->ifp, ctx->head);
sys/dev/dpaa2/dpaa2_ni.c
379
struct mbuf *head;
sys/dev/drm2/drmP.h
1545
list_for_each_entry(_entry, &dev->maplist, head)
sys/dev/drm2/drmP.h
317
struct list_head head;
sys/dev/drm2/drmP.h
401
struct list_head head;
sys/dev/drm2/drmP.h
474
struct list_head head;
sys/dev/drm2/drmP.h
533
struct list_head head; /**< list head */
sys/dev/drm2/drmP.h
545
struct list_head head; /**< list head */
sys/dev/drm2/drmP.h
647
struct list_head head; /**< each minor contains a list of masters */
sys/dev/drm2/drm_agpsupport.c
225
list_add(&entry->head, &dev->agp->memory);
sys/dev/drm2/drm_agpsupport.c
259
list_for_each_entry(entry, &dev->agp->memory, head) {
sys/dev/drm2/drm_agpsupport.c
374
list_del(&entry->head);
sys/dev/drm2/drm_agpsupport.c
403
struct drm_agp_head *head = NULL;
sys/dev/drm2/drm_agpsupport.c
405
if (!(head = malloc(sizeof(*head), DRM_MEM_AGPLISTS, M_NOWAIT)))
sys/dev/drm2/drm_agpsupport.c
407
memset((void *)head, 0, sizeof(*head));
sys/dev/drm2/drm_agpsupport.c
408
head->bridge = agp_find_device();
sys/dev/drm2/drm_agpsupport.c
409
if (!head->bridge) {
sys/dev/drm2/drm_agpsupport.c
410
free(head, DRM_MEM_AGPLISTS);
sys/dev/drm2/drm_agpsupport.c
413
agp_get_info(head->bridge, &head->agp_info);
sys/dev/drm2/drm_agpsupport.c
415
INIT_LIST_HEAD(&head->memory);
sys/dev/drm2/drm_agpsupport.c
416
head->cant_use_aperture = 0;
sys/dev/drm2/drm_agpsupport.c
417
head->base = head->agp_info.ai_aperture_base;
sys/dev/drm2/drm_agpsupport.c
418
return head;
sys/dev/drm2/drm_auth.c
122
list_del(&pt->head);
sys/dev/drm2/drm_auth.c
92
list_add_tail(&entry->head, &master->magicfree);
sys/dev/drm2/drm_bufs.c
115
list_for_each_entry(entry, &dev->maplist, head) {
sys/dev/drm2/drm_bufs.c
368
list_for_each_entry(entry, &dev->agp->memory, head) {
sys/dev/drm2/drm_bufs.c
427
list_add(&list->head, &dev->maplist);
sys/dev/drm2/drm_bufs.c
517
list_for_each_entry_safe(r_list, list_t, &dev->maplist, head) {
sys/dev/drm2/drm_bufs.c
520
list_del(&r_list->head);
sys/dev/drm2/drm_bufs.c
606
list_for_each_entry(r_list, &dev->maplist, head) {
sys/dev/drm2/drm_bufs.c
728
list_for_each_entry(agp_entry, &dev->agp->memory, head) {
sys/dev/drm2/drm_context.c
228
list_for_each_entry(r_list, &dev->maplist, head) {
sys/dev/drm2/drm_context.c
373
INIT_LIST_HEAD(&ctx_entry->head);
sys/dev/drm2/drm_context.c
378
list_add(&ctx_entry->head, &dev->ctxlist);
sys/dev/drm2/drm_context.c
479
list_for_each_entry_safe(pos, n, &dev->ctxlist, head) {
sys/dev/drm2/drm_context.c
481
list_del(&pos->head);
sys/dev/drm2/drm_crtc.c
1026
list_for_each_entry(crtc, &dev->mode_config.crtc_list, head)
sys/dev/drm2/drm_crtc.c
1029
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head)
sys/dev/drm2/drm_crtc.c
1033
list_for_each_entry(connector, &dev->mode_config.connector_list, head)
sys/dev/drm2/drm_crtc.c
1064
head) {
sys/dev/drm2/drm_crtc.c
1069
&dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc.c
1074
head) {
sys/dev/drm2/drm_crtc.c
1079
head) {
sys/dev/drm2/drm_crtc.c
1083
list_for_each_entry_safe(fb, fbt, &dev->mode_config.fb_list, head) {
sys/dev/drm2/drm_crtc.c
1088
head) {
sys/dev/drm2/drm_crtc.c
1092
list_for_each_entry_safe(crtc, ct, &dev->mode_config.crtc_list, head) {
sys/dev/drm2/drm_crtc.c
1274
head) {
sys/dev/drm2/drm_crtc.c
1302
head) {
sys/dev/drm2/drm_crtc.c
1333
head) {
sys/dev/drm2/drm_crtc.c
1495
list_for_each_entry(mode, &connector->modes, head)
sys/dev/drm2/drm_crtc.c
1517
list_for_each_entry(mode, &connector->modes, head) {
sys/dev/drm2/drm_crtc.c
1639
list_for_each_entry(plane, &config->plane_list, head) {
sys/dev/drm2/drm_crtc.c
2571
list_add_tail(&mode->head, &connector->user_modes);
sys/dev/drm2/drm_crtc.c
2582
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc.c
2591
list_add_tail(&dup_mode->head, &list);
sys/dev/drm2/drm_crtc.c
2595
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc.c
2605
list_for_each_entry_safe(dup_mode, next, &list, head)
sys/dev/drm2/drm_crtc.c
2620
list_for_each_entry_safe(match_mode, t, &connector->user_modes, head) {
sys/dev/drm2/drm_crtc.c
2622
list_del(&match_mode->head);
sys/dev/drm2/drm_crtc.c
2639
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc.c
2773
list_add_tail(&property->head, &dev->mode_config.property_list);
sys/dev/drm2/drm_crtc.c
2873
list_for_each_entry(prop_enum, &property->enum_blob_list, head) {
sys/dev/drm2/drm_crtc.c
2889
list_add_tail(&prop_enum->head, &property->enum_blob_list);
sys/dev/drm2/drm_crtc.c
2898
list_for_each_entry_safe(prop_enum, pt, &property->enum_blob_list, head) {
sys/dev/drm2/drm_crtc.c
2899
list_del(&prop_enum->head);
sys/dev/drm2/drm_crtc.c
2906
list_del(&property->head);
sys/dev/drm2/drm_crtc.c
293
list_add(&fb->head, &dev->mode_config.fb_list);
sys/dev/drm2/drm_crtc.c
2993
list_for_each_entry(prop_enum, &property->enum_blob_list, head)
sys/dev/drm2/drm_crtc.c
2996
list_for_each_entry(prop_blob, &property->enum_blob_list, head)
sys/dev/drm2/drm_crtc.c
3021
list_for_each_entry(prop_enum, &property->enum_blob_list, head) {
sys/dev/drm2/drm_crtc.c
3045
list_for_each_entry(prop_blob, &property->enum_blob_list, head) {
sys/dev/drm2/drm_crtc.c
3087
list_add_tail(&blob->head, &dev->mode_config.property_blob_list);
sys/dev/drm2/drm_crtc.c
3095
list_del(&blob->head);
sys/dev/drm2/drm_crtc.c
352
list_del(&fb->head);
sys/dev/drm2/drm_crtc.c
3628
list_for_each_entry(crtc, &dev->mode_config.crtc_list, head)
sys/dev/drm2/drm_crtc.c
3632
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head)
sys/dev/drm2/drm_crtc.c
3636
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc.c
376
list_for_each_entry(crtc, &dev->mode_config.crtc_list, head) {
sys/dev/drm2/drm_crtc.c
388
list_for_each_entry(plane, &dev->mode_config.plane_list, head) {
sys/dev/drm2/drm_crtc.c
437
list_add_tail(&crtc->head, &dev->mode_config.crtc_list);
sys/dev/drm2/drm_crtc.c
465
list_del(&crtc->head);
sys/dev/drm2/drm_crtc.c
483
list_add(&mode->head, &connector->probed_modes);
sys/dev/drm2/drm_crtc.c
500
list_del(&mode->head);
sys/dev/drm2/drm_crtc.c
546
list_add_tail(&connector->head, &dev->mode_config.connector_list);
sys/dev/drm2/drm_crtc.c
578
list_for_each_entry_safe(mode, t, &connector->probed_modes, head)
sys/dev/drm2/drm_crtc.c
581
list_for_each_entry_safe(mode, t, &connector->modes, head)
sys/dev/drm2/drm_crtc.c
584
list_for_each_entry_safe(mode, t, &connector->user_modes, head)
sys/dev/drm2/drm_crtc.c
589
list_del(&connector->head);
sys/dev/drm2/drm_crtc.c
601
list_for_each_entry(connector, &dev->mode_config.connector_list, head)
sys/dev/drm2/drm_crtc.c
625
list_add_tail(&encoder->head, &dev->mode_config.encoder_list);
sys/dev/drm2/drm_crtc.c
640
list_del(&encoder->head);
sys/dev/drm2/drm_crtc.c
674
list_add_tail(&plane->head, &dev->mode_config.plane_list);
sys/dev/drm2/drm_crtc.c
677
INIT_LIST_HEAD(&plane->head);
sys/dev/drm2/drm_crtc.c
695
if (!list_empty(&plane->head)) {
sys/dev/drm2/drm_crtc.c
696
list_del(&plane->head);
sys/dev/drm2/drm_crtc.h
124
struct list_head head;
sys/dev/drm2/drm_crtc.h
252
struct list_head head;
sys/dev/drm2/drm_crtc.h
271
struct list_head head;
sys/dev/drm2/drm_crtc.h
278
struct list_head head;
sys/dev/drm2/drm_crtc.h
283
struct list_head head;
sys/dev/drm2/drm_crtc.h
386
struct list_head head;
sys/dev/drm2/drm_crtc.h
492
struct list_head head;
sys/dev/drm2/drm_crtc.h
566
struct list_head head;
sys/dev/drm2/drm_crtc.h
651
struct list_head head;
sys/dev/drm2/drm_crtc.h
909
extern void drm_mode_list_concat(struct list_head *head,
sys/dev/drm2/drm_crtc_helper.c
1044
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc_helper.c
1082
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc_helper.c
126
list_for_each_entry(mode, &connector->modes, head)
sys/dev/drm2/drm_crtc_helper.c
178
list_for_each_entry(mode, &connector->modes, head) {
sys/dev/drm2/drm_crtc_helper.c
190
list_for_each_entry(mode, &connector->modes, head)
sys/dev/drm2/drm_crtc_helper.c
197
list_for_each_entry(mode, &connector->modes, head) {
sys/dev/drm2/drm_crtc_helper.c
222
list_for_each_entry(connector, &dev->mode_config.connector_list, head)
sys/dev/drm2/drm_crtc_helper.c
246
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head)
sys/dev/drm2/drm_crtc_helper.c
280
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc_helper.c
287
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) {
sys/dev/drm2/drm_crtc_helper.c
295
list_for_each_entry(crtc, &dev->mode_config.crtc_list, head) {
sys/dev/drm2/drm_crtc_helper.c
328
list_for_each_entry(tmp, &dev->mode_config.crtc_list, head) {
sys/dev/drm2/drm_crtc_helper.c
350
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) {
sys/dev/drm2/drm_crtc_helper.c
422
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) {
sys/dev/drm2/drm_crtc_helper.c
441
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) {
sys/dev/drm2/drm_crtc_helper.c
461
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) {
sys/dev/drm2/drm_crtc_helper.c
476
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) {
sys/dev/drm2/drm_crtc_helper.c
518
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) {
sys/dev/drm2/drm_crtc_helper.c
522
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc_helper.c
59
&dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc_helper.c
619
list_for_each_entry(crtc, &dev->mode_config.crtc_list, head) {
sys/dev/drm2/drm_crtc_helper.c
62
list_move_tail(&connector->head, &panel_list);
sys/dev/drm2/drm_crtc_helper.c
624
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) {
sys/dev/drm2/drm_crtc_helper.c
629
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc_helper.c
669
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc_helper.c
703
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc_helper.c
790
list_for_each_entry(crtc, &dev->mode_config.crtc_list, head) {
sys/dev/drm2/drm_crtc_helper.c
795
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) {
sys/dev/drm2/drm_crtc_helper.c
80
list_for_each_entry(mode, &connector->modes, head) {
sys/dev/drm2/drm_crtc_helper.c
800
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_crtc_helper.c
823
list_for_each_entry(connector, &dev->mode_config.connector_list, head)
sys/dev/drm2/drm_crtc_helper.c
836
list_for_each_entry(connector, &dev->mode_config.connector_list, head)
sys/dev/drm2/drm_crtc_helper.c
928
list_for_each_entry(crtc, &dev->mode_config.crtc_list, head) {
sys/dev/drm2/drm_crtc_helper.c
941
list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) {
sys/dev/drm2/drm_crtc_helper.c
987
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_drv.c
208
list_for_each_entry_safe(entry, tempe, &dev->agp->memory, head) {
sys/dev/drm2/drm_drv.c
230
list_for_each_entry_safe(vma, vma_temp, &dev->vmalist, head) {
sys/dev/drm2/drm_drv.c
231
list_del(&vma->head);
sys/dev/drm2/drm_drv.c
501
list_for_each_entry(entry, &dev->maplist, head) {
sys/dev/drm2/drm_edid.c
1082
list_for_each_entry(m, &connector->probed_modes, head) {
sys/dev/drm2/drm_edid.c
1835
list_for_each_entry(connector, &dev->mode_config.connector_list, head)
sys/dev/drm2/drm_edid.c
511
struct drm_display_mode, head);
sys/dev/drm2/drm_edid.c
513
list_for_each_entry_safe(cur_mode, t, &connector->probed_modes, head) {
sys/dev/drm2/drm_edid.c
787
list_for_each_entry(m, &connector->probed_modes, head)
sys/dev/drm2/drm_fb_helper.c
1042
list_for_each_entry(mode, &fb_connector->connector->modes, head) {
sys/dev/drm2/drm_fb_helper.c
1075
list_for_each_entry(mode, &fb_helper_conn->connector->modes, head) {
sys/dev/drm2/drm_fb_helper.c
1096
list_add(&mode->head, &fb_helper_conn->connector->modes);
sys/dev/drm2/drm_fb_helper.c
1193
list_for_each_entry(mode, &fb_helper_conn->connector->modes, head) {
sys/dev/drm2/drm_fb_helper.c
1234
list_for_each_entry(modes[i], &fb_helper_conn->connector->modes, head)
sys/dev/drm2/drm_fb_helper.c
1459
list_for_each_entry(crtc, &dev->mode_config.crtc_list, head) {
sys/dev/drm2/drm_fb_helper.c
154
list_for_each_entry(connector, &dev->mode_config.connector_list, head) {
sys/dev/drm2/drm_fb_helper.c
296
list_for_each_entry(c, &dev->mode_config.crtc_list, head) {
sys/dev/drm2/drm_fb_helper.c
539
list_for_each_entry(crtc, &dev->mode_config.crtc_list, head) {
sys/dev/drm2/drm_fops.c
379
list_for_each_entry_safe(pos, n, &dev->ctxlist, head) {
sys/dev/drm2/drm_fops.c
388
list_del(&pos->head);
sys/dev/drm2/drm_hashtab.c
100
LIST_FOREACH(entry, h_list, head) {
sys/dev/drm2/drm_hashtab.c
108
LIST_INSERT_AFTER(parent, item, head);
sys/dev/drm2/drm_hashtab.c
110
LIST_INSERT_HEAD(h_list, item, head);
sys/dev/drm2/drm_hashtab.c
165
LIST_REMOVE(entry, head);
sys/dev/drm2/drm_hashtab.c
173
LIST_REMOVE(item, head);
sys/dev/drm2/drm_hashtab.c
67
LIST_FOREACH(entry, h_list, head)
sys/dev/drm2/drm_hashtab.c
80
LIST_FOREACH(entry, h_list, head) {
sys/dev/drm2/drm_hashtab.h
43
LIST_ENTRY(drm_hash_item) head;
sys/dev/drm2/drm_ioctl.c
165
r_list = list_entry(list, struct drm_map_list, head);
sys/dev/drm2/drm_linux_list.h
109
#define list_for_each(entry, head) \
sys/dev/drm2/drm_linux_list.h
110
for (entry = (head)->next; entry != head; entry = (entry)->next)
sys/dev/drm2/drm_linux_list.h
112
#define list_for_each_prev(entry, head) \
sys/dev/drm2/drm_linux_list.h
113
for (entry = (head)->prev; entry != (head); \
sys/dev/drm2/drm_linux_list.h
116
#define list_for_each_safe(entry, temp, head) \
sys/dev/drm2/drm_linux_list.h
117
for (entry = (head)->next, temp = (entry)->next; \
sys/dev/drm2/drm_linux_list.h
118
entry != head; \
sys/dev/drm2/drm_linux_list.h
121
#define list_for_each_entry(pos, head, member) \
sys/dev/drm2/drm_linux_list.h
122
for (pos = list_entry((head)->next, __typeof(*pos), member); \
sys/dev/drm2/drm_linux_list.h
123
&pos->member != (head); \
sys/dev/drm2/drm_linux_list.h
126
#define list_for_each_entry_continue_reverse(pos, head, member) \
sys/dev/drm2/drm_linux_list.h
128
&pos->member != (head); \
sys/dev/drm2/drm_linux_list.h
138
#define list_for_each_entry_safe(pos, n, head, member) \
sys/dev/drm2/drm_linux_list.h
139
for (pos = list_entry((head)->next, __typeof(*pos), member), \
sys/dev/drm2/drm_linux_list.h
141
&pos->member != (head); \
sys/dev/drm2/drm_linux_list.h
144
#define list_for_each_entry_safe_from(pos, n, head, member) \
sys/dev/drm2/drm_linux_list.h
146
&pos->member != (head); \
sys/dev/drm2/drm_linux_list.h
168
list_splice(const struct list_head *list, struct list_head *head)
sys/dev/drm2/drm_linux_list.h
173
__list_splice(list, head, head->next);
sys/dev/drm2/drm_linux_list.h
176
void drm_list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
sys/dev/drm2/drm_linux_list.h
191
#define INIT_HLIST_HEAD(head) (head)->first = NULL
sys/dev/drm2/drm_linux_list.h
275
#define hlist_for_each(p, head) \
sys/dev/drm2/drm_linux_list.h
276
for (p = (head)->first; p; p = p->next)
sys/dev/drm2/drm_linux_list.h
278
#define hlist_for_each_safe(p, n, head) \
sys/dev/drm2/drm_linux_list.h
279
for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)
sys/dev/drm2/drm_linux_list.h
281
#define hlist_for_each_entry(tp, p, head, field) \
sys/dev/drm2/drm_linux_list.h
282
for (p = (head)->first; \
sys/dev/drm2/drm_linux_list.h
292
#define hlist_for_each_entry_safe(tpos, pos, n, head, member) \
sys/dev/drm2/drm_linux_list.h
293
for (pos = (head)->first; \
sys/dev/drm2/drm_linux_list.h
43
INIT_LIST_HEAD(struct list_head *head) {
sys/dev/drm2/drm_linux_list.h
44
(head)->next = head;
sys/dev/drm2/drm_linux_list.h
45
(head)->prev = head;
sys/dev/drm2/drm_linux_list.h
54
list_empty(const struct list_head *head) {
sys/dev/drm2/drm_linux_list.h
55
return (head)->next == head;
sys/dev/drm2/drm_linux_list.h
59
list_add(struct list_head *new, struct list_head *head) {
sys/dev/drm2/drm_linux_list.h
60
(head)->next->prev = new;
sys/dev/drm2/drm_linux_list.h
61
(new)->next = (head)->next;
sys/dev/drm2/drm_linux_list.h
62
(new)->prev = head;
sys/dev/drm2/drm_linux_list.h
63
(head)->next = new;
sys/dev/drm2/drm_linux_list.h
67
list_add_tail(struct list_head *entry, struct list_head *head) {
sys/dev/drm2/drm_linux_list.h
68
(entry)->prev = (head)->prev;
sys/dev/drm2/drm_linux_list.h
69
(entry)->next = head;
sys/dev/drm2/drm_linux_list.h
70
(head)->prev->next = entry;
sys/dev/drm2/drm_linux_list.h
71
(head)->prev = entry;
sys/dev/drm2/drm_linux_list.h
89
static inline void list_move(struct list_head *list, struct list_head *head)
sys/dev/drm2/drm_linux_list.h
92
list_add(list, head);
sys/dev/drm2/drm_linux_list.h
96
struct list_head *head)
sys/dev/drm2/drm_linux_list.h
99
list_add_tail(list, head);
sys/dev/drm2/drm_linux_list_sort.c
53
drm_list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
sys/dev/drm2/drm_linux_list_sort.c
61
list_for_each(le, head)
sys/dev/drm2/drm_linux_list_sort.c
65
list_for_each(le, head)
sys/dev/drm2/drm_linux_list_sort.c
70
INIT_LIST_HEAD(head);
sys/dev/drm2/drm_linux_list_sort.c
72
list_add_tail(ar[i], head);
sys/dev/drm2/drm_mm.c
631
struct list_head *head = &mm->head_node.node_list;
sys/dev/drm2/drm_mm.c
633
return (head->next->next == head);
sys/dev/drm2/drm_modes.c
518
void drm_mode_list_concat(struct list_head *head, struct list_head *new)
sys/dev/drm2/drm_modes.c
523
list_for_each_safe(entry, tmp, head) {
sys/dev/drm2/drm_modes.c
711
INIT_LIST_HEAD(&dst->head);
sys/dev/drm2/drm_modes.c
801
list_for_each_entry(mode, mode_list, head) {
sys/dev/drm2/drm_modes.c
837
list_for_each_entry(mode, mode_list, head) {
sys/dev/drm2/drm_modes.c
869
list_for_each_entry_safe(mode, t, mode_list, head) {
sys/dev/drm2/drm_modes.c
871
list_del(&mode->head);
sys/dev/drm2/drm_modes.c
901
struct drm_display_mode *a = list_entry(lh_a, struct drm_display_mode, head);
sys/dev/drm2/drm_modes.c
902
struct drm_display_mode *b = list_entry(lh_b, struct drm_display_mode, head);
sys/dev/drm2/drm_modes.c
955
head) {
sys/dev/drm2/drm_modes.c
958
list_for_each_entry(mode, &connector->modes, head) {
sys/dev/drm2/drm_modes.c
965
list_del(&pmode->head);
sys/dev/drm2/drm_modes.c
972
list_move_tail(&pmode->head, &connector->modes);
sys/dev/drm2/drm_stub.c
118
list_add_tail(&master->head, &minor->master_list);
sys/dev/drm2/drm_stub.c
136
list_del(&master->head);
sys/dev/drm2/drm_stub.c
141
list_for_each_entry_safe(r_list, list_temp, &dev->maplist, head) {
sys/dev/drm2/drm_stub.c
154
list_for_each_entry_safe(pt, next, &master->magicfree, head) {
sys/dev/drm2/drm_stub.c
155
list_del(&pt->head);
sys/dev/drm2/drm_stub.c
474
list_for_each_entry_safe(r_list, list_temp, &dev->maplist, head)
sys/dev/drm2/drm_sysctl.c
211
list_for_each_entry(entry, &dev->maplist, head) {
sys/dev/drm2/drm_sysctl.c
224
list_for_each_entry(entry, &dev->maplist, head) {
sys/dev/drm2/ttm/ttm_execbuf_util.c
121
list_for_each_entry(entry, list, head) {
sys/dev/drm2/ttm/ttm_execbuf_util.c
127
entry = list_first_entry(list, struct ttm_validate_buffer, head);
sys/dev/drm2/ttm/ttm_execbuf_util.c
134
list_for_each_entry(entry, list, head) {
sys/dev/drm2/ttm/ttm_execbuf_util.c
214
bo = list_first_entry(list, struct ttm_validate_buffer, head)->bo;
sys/dev/drm2/ttm/ttm_execbuf_util.c
222
list_for_each_entry(entry, list, head) {
sys/dev/drm2/ttm/ttm_execbuf_util.c
232
list_for_each_entry(entry, list, head) {
sys/dev/drm2/ttm/ttm_execbuf_util.c
38
list_for_each_entry(entry, list, head) {
sys/dev/drm2/ttm/ttm_execbuf_util.c
58
list_for_each_entry(entry, list, head) {
sys/dev/drm2/ttm/ttm_execbuf_util.c
74
list_for_each_entry(entry, list, head) {
sys/dev/drm2/ttm/ttm_execbuf_util.c
92
entry = list_first_entry(list, struct ttm_validate_buffer, head);
sys/dev/drm2/ttm/ttm_execbuf_util.h
48
struct list_head head;
sys/dev/drm2/ttm/ttm_object.c
112
struct list_head head;
sys/dev/drm2/ttm/ttm_object.c
295
list_add_tail(&ref->head, &tfile->ref_list);
sys/dev/drm2/ttm/ttm_object.c
322
list_del(&ref->head);
sys/dev/drm2/ttm/ttm_object.c
372
ref = list_entry(list, struct ttm_ref_object, head);
sys/dev/ena/ena_netmap.c
113
int nm_i, qid, head, lim, rc;
sys/dev/ena/ena_netmap.c
122
head = kring->rhead;
sys/dev/ena/ena_netmap.c
129
if ((nm_i == head) && rx_ring->initialized) {
sys/dev/eqos/if_eqos.c
275
int first = sc->tx.head;
sys/dev/eqos/if_eqos.c
295
if (TX_QUEUED(sc->tx.head, sc->tx.tail) + nsegs > TX_DESC_COUNT) {
sys/dev/eqos/if_eqos.c
309
eqos_setup_txdesc(sc, sc->tx.head, flags, segs[idx].ds_addr,
sys/dev/eqos/if_eqos.c
313
sc->tx.head = TX_NEXT(sc->tx.head);
sys/dev/eqos/if_eqos.c
602
if (TX_QUEUED(sc->tx.head, sc->tx.tail) >=
sys/dev/eqos/if_eqos.c
626
(uint32_t)sc->tx.desc_ring_paddr + DESC_OFFSET(sc->tx.head));
sys/dev/eqos/if_eqos.c
701
rdes3 = le32toh(sc->rx.desc_ring[sc->rx.head].des3);
sys/dev/eqos/if_eqos.c
709
sc->rx.buf_map[sc->rx.head].map, BUS_DMASYNC_POSTREAD);
sys/dev/eqos/if_eqos.c
711
sc->rx.buf_map[sc->rx.head].map);
sys/dev/eqos/if_eqos.c
715
m = sc->rx.buf_map[sc->rx.head].mbuf;
sys/dev/eqos/if_eqos.c
730
if ((error = eqos_setup_rxbuf(sc, sc->rx.head, m)))
sys/dev/eqos/if_eqos.c
738
(uint32_t)sc->rx.desc_ring_paddr + DESC_OFFSET(sc->rx.head));
sys/dev/eqos/if_eqos.c
740
sc->rx.head = RX_NEXT(sc->rx.head);
sys/dev/eqos/if_eqos.c
753
while (sc->tx.tail != sc->tx.head) {
sys/dev/eqos/if_eqos.c
783
if (sc->tx.tail == sc->tx.head)
sys/dev/eqos/if_eqos_var.h
70
u_int head;
sys/dev/evdev/cdev.c
182
struct input_event *head;
sys/dev/evdev/cdev.c
227
head = client->ec_buffer + client->ec_buffer_head;
sys/dev/evdev/cdev.c
231
TV_CP(*head, event.t32, time);
sys/dev/evdev/cdev.c
232
CP(*head, event.t32, type);
sys/dev/evdev/cdev.c
233
CP(*head, event.t32, code);
sys/dev/evdev/cdev.c
234
CP(*head, event.t32, value);
sys/dev/evdev/cdev.c
237
bcopy(head, &event.t, evsize);
sys/dev/evdev/cdev.c
825
size_t count, head, tail, ready;
sys/dev/evdev/cdev.c
828
head = client->ec_buffer_head;
sys/dev/evdev/cdev.c
834
if ((tail + 1) % count == head) {
sys/dev/evdev/cdev.c
837
head = (tail + count - 1) % count;
sys/dev/evdev/cdev.c
838
client->ec_buffer[head] = (struct input_event) {
sys/dev/evdev/cdev.c
851
client->ec_buffer_head = head;
sys/dev/evdev/cdev.c
852
client->ec_buffer_ready = head;
sys/dev/evdev/cdev.c
874
size_t i, head, tail, ready, size;
sys/dev/evdev/cdev.c
876
head = client->ec_buffer_head;
sys/dev/evdev/cdev.c
883
head, ready, tail, size);
sys/dev/evdev/cdev.c
891
if (i < head || i > tail)
sys/dev/evdev/cdev.c
897
if (i == head)
sys/dev/evdev/cdev.c
912
size_t head, tail, count, i;
sys/dev/evdev/cdev.c
917
i = head = client->ec_buffer_head;
sys/dev/evdev/uinput.c
177
size_t head, tail;
sys/dev/evdev/uinput.c
181
head = state->ucs_buffer_head;
sys/dev/evdev/uinput.c
191
if (tail == head) {
sys/dev/evdev/uinput.c
194
head = (head + 1) % UINPUT_BUFFER_SIZE;
sys/dev/evdev/uinput.c
195
state->ucs_buffer_head = head;
sys/dev/fdc/fdc.c
1001
head << 2 | fd->fdsu, 0))
sys/dev/fdc/fdc.c
1008
head << 2 | fd->fdsu, /* head & unit */
sys/dev/fdc/fdc.c
1010
head, /* head */
sys/dev/fdc/fdc.c
1023
head << 2 | fd->fdsu, /* head & unit */
sys/dev/fdc/fdc.c
1025
head, /* head */
sys/dev/fdc/fdc.c
1117
idp->head = fdc->status[4];
sys/dev/fdc/fdc.c
1122
idp->cyl, idp->head, idp->sec, idp->secshift);
sys/dev/fdc/fdc.c
1189
bioq_disksort(&fdc->head, bp);
sys/dev/fdc/fdc.c
1190
wakeup(&fdc->head);
sys/dev/fdc/fdc.c
1284
(finfo->cyl * fd->ft->heads + finfo->head) *
sys/dev/fdc/fdc.c
1290
(idfield->cyl * fd->ft->heads + idfield->head) *
sys/dev/fdc/fdc.c
1356
id.cyl = id.head = 0;
sys/dev/fdc/fdc.c
1360
if (id.cyl != 0 || id.head != 0 || id.secshift != fdtp->secsize)
sys/dev/fdc/fdc.c
1363
id.head = fd->ft->heads - 1;
sys/dev/fdc/fdc.c
1365
if (id.cyl != 2 || id.head != fdtp->heads - 1 ||
sys/dev/fdc/fdc.c
1559
if (rid->cyl > 85 || rid->head > 1)
sys/dev/fdc/fdc.c
1741
wakeup(&fdc->head);
sys/dev/fdc/fdc.c
1822
bioq_init(&fdc->head);
sys/dev/fdc/fdc.c
647
bioq_disksort(&fd->fdc->head, bp);
sys/dev/fdc/fdc.c
651
wakeup(&fd->fdc->head);
sys/dev/fdc/fdc.c
764
int head;
sys/dev/fdc/fdc.c
816
fdc->bp = bioq_takefirst(&fdc->head);
sys/dev/fdc/fdc.c
818
msleep(&fdc->head, &fdc->fdc_mtx,
sys/dev/fdc/fdc.c
898
head = sec / fd->ft->sectrac;
sys/dev/fdc/fdc.c
990
head << 2 | fd->fdsu,
sys/dev/fdc/fdcvar.h
55
struct bio_queue_head head;
sys/dev/firmware/arm/scmi.c
146
struct reqs_head head;
sys/dev/firmware/arm/scmi.c
273
LIST_INIT(&rp->head);
sys/dev/firmware/arm/scmi.c
283
LIST_INSERT_HEAD(&rp->head, req, next);
sys/dev/firmware/arm/scmi.c
296
LIST_FOREACH_SAFE(req, &rp->head, next, tmp) {
sys/dev/firmware/arm/scmi.c
409
if (!LIST_EMPTY(&rp->head)) {
sys/dev/firmware/arm/scmi.c
410
req = LIST_FIRST(&rp->head);
sys/dev/firmware/arm/scmi.c
411
LIST_REMOVE_HEAD(&rp->head, next);
sys/dev/firmware/arm/scmi.c
436
LIST_INSERT_HEAD(&rp->head, req, next);
sys/dev/gve/gve.h
325
uint32_t head; /* The index at which to post the next buffer at */
sys/dev/gve/gve.h
356
uint32_t head; /* offset to write at */
sys/dev/gve/gve_adminq.c
845
uint32_t tail, head;
sys/dev/gve/gve_adminq.c
850
head = priv->adminq_prod_cnt;
sys/dev/gve/gve_adminq.c
852
gve_adminq_kick_cmd(priv, head);
sys/dev/gve/gve_adminq.c
853
if (!gve_adminq_wait_for_cmd(priv, head)) {
sys/dev/gve/gve_adminq.c
861
for (i = tail; i < head; i++) {
sys/dev/gve/gve_adminq.c
980
uint32_t tail, head;
sys/dev/gve/gve_adminq.c
984
head = priv->adminq_prod_cnt;
sys/dev/gve/gve_adminq.c
986
if (tail != head)
sys/dev/gve/gve_rx_dqo.c
221
rx->dqo.head = 0;
sys/dev/gve/gve_rx_dqo.c
280
rx->dqo.head = (rx->dqo.head + 1) & rx->dqo.mask;
sys/dev/gve/gve_rx_dqo.c
283
if ((rx->dqo.head & (GVE_RX_BUF_THRESH_DQO - 1)) == 0) {
sys/dev/gve/gve_rx_dqo.c
287
rx->dqo.head);
sys/dev/gve/gve_rx_dqo.c
299
desc = &rx->dqo.desc_ring[rx->dqo.head];
sys/dev/gve/gve_rx_dqo.c
365
struct gve_rx_desc_dqo *desc = &rx->dqo.desc_ring[rx->dqo.head];
sys/dev/gve/gve_rx_dqo.c
460
num_pending_bufs = (rx->dqo.head - rx->dqo.tail) & rx->dqo.mask;
sys/dev/gve/gve_rx_dqo.c
671
num_pending_bufs = (rx->dqo.head - rx->dqo.tail) & rx->dqo.mask;
sys/dev/gve/gve_rx_dqo.c
898
num_pending_bufs = (rx->dqo.head - rx->dqo.tail) & rx->dqo.mask;
sys/dev/gve/gve_tx.c
241
fifo->head = 0;
sys/dev/gve/gve_tx.c
46
fifo->head = 0;
sys/dev/gve/gve_tx.c
556
return (fifo->head + bytes < fifo->size) ? 0 : fifo->size - fifo->head;
sys/dev/gve/gve_tx.c
597
iov[0].iov_offset = fifo->head;
sys/dev/gve/gve_tx.c
599
fifo->head += bytes;
sys/dev/gve/gve_tx.c
601
if (fifo->head > fifo->size) {
sys/dev/gve/gve_tx.c
607
overflow = fifo->head - fifo->size;
sys/dev/gve/gve_tx.c
612
fifo->head = overflow;
sys/dev/gve/gve_tx.c
616
aligned_head = roundup2(fifo->head, CACHE_LINE_SIZE);
sys/dev/gve/gve_tx.c
617
padding = aligned_head - fifo->head;
sys/dev/gve/gve_tx.c
620
fifo->head = aligned_head;
sys/dev/gve/gve_tx.c
622
if (fifo->head == fifo->size)
sys/dev/gve/gve_tx.c
623
fifo->head = 0;
sys/dev/hid/hkbd.c
468
uint32_t head;
sys/dev/hid/hkbd.c
479
head = sc->sc_inputhead;
sys/dev/hid/hkbd.c
480
if (head == atomic_load_acq_32(&sc->sc_inputtail)) {
sys/dev/hid/hkbd.c
483
c = sc->sc_input[head];
sys/dev/hid/hkbd.c
484
head = (head + 1) % HKBD_IN_BUF_SIZE;
sys/dev/hid/hkbd.c
485
atomic_store_rel_32(&sc->sc_inputhead, head);
sys/dev/hpt27xx/hpt27xx_os_bsd.c
162
list->head = 0;
sys/dev/hpt27xx/hpt27xx_os_bsd.c
173
HPT_ASSERT(list->head);
sys/dev/hpt27xx/hpt27xx_os_bsd.c
174
result = list->head;
sys/dev/hpt27xx/hpt27xx_os_bsd.c
175
list->head = *(void **)result;
sys/dev/hpt27xx/hpt27xx_os_bsd.c
186
*(void **)p = list->head;
sys/dev/hpt27xx/hpt27xx_os_bsd.c
187
list->head = p;
sys/dev/hpt27xx/hpt27xx_os_bsd.c
202
list->head = 0;
sys/dev/hpt27xx/hpt27xx_os_bsd.c
223
*(void **)p = list->head;
sys/dev/hpt27xx/hpt27xx_os_bsd.c
225
list->head = p;
sys/dev/hpt27xx/hpt27xx_osm_bsd.c
164
*p = f->head;
sys/dev/hpt27xx/hpt27xx_osm_bsd.c
165
f->head = p;
sys/dev/hpt27xx/hpt27xx_osm_bsd.c
185
*p = f->head;
sys/dev/hpt27xx/hpt27xx_osm_bsd.c
187
f->head = p;
sys/dev/hpt27xx/ldm.h
127
struct tq_item *head, *tail;
sys/dev/hpt27xx/ldm.h
130
#define TQ_EMPTY(tq) ((tq)->head==0)
sys/dev/hpt27xx/ldm.h
74
void * head;
sys/dev/hpt27xx/list.h
101
static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head)
sys/dev/hpt27xx/list.h
104
__list_splice(list, head);
sys/dev/hpt27xx/list.h
107
static HPT_INLINE void list_splice_init(struct list_head *list, struct list_head *head)
sys/dev/hpt27xx/list.h
110
__list_splice(list, head);
sys/dev/hpt27xx/list.h
118
#define list_for_each(pos, head) \
sys/dev/hpt27xx/list.h
119
for (pos = (head)->next; pos != (head); pos = pos->next)
sys/dev/hpt27xx/list.h
121
#define list_for_each_safe(pos, n, head) \
sys/dev/hpt27xx/list.h
122
for (pos = (head)->next, n = pos->next; pos != (head); \
sys/dev/hpt27xx/list.h
54
static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head)
sys/dev/hpt27xx/list.h
56
__list_add(_new, head, head->next);
sys/dev/hpt27xx/list.h
59
static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head)
sys/dev/hpt27xx/list.h
61
__list_add(_new, head->prev, head);
sys/dev/hpt27xx/list.h
81
static HPT_INLINE int list_empty(struct list_head *head)
sys/dev/hpt27xx/list.h
83
HPT_ASSERT(!(head->next==head && head->prev!=head));
sys/dev/hpt27xx/list.h
84
return head->next == head;
sys/dev/hpt27xx/list.h
88
struct list_head *head)
sys/dev/hpt27xx/list.h
92
struct list_head *at = head->next;
sys/dev/hpt27xx/list.h
94
first->prev = head;
sys/dev/hpt27xx/list.h
95
head->next = first;
sys/dev/hptiop/hptiop.c
250
u_int32_t head = inbound_head + 1;
sys/dev/hptiop/hptiop.c
252
if (head == MVIOP_QUEUE_LEN)
sys/dev/hptiop/hptiop.c
253
head = 0;
sys/dev/hptiop/hptiop.c
258
BUS_SPACE_WRT4_MV2(inbound_head, head);
sys/dev/hptnr/hptnr_os_bsd.c
148
list->head = 0;
sys/dev/hptnr/hptnr_os_bsd.c
159
HPT_ASSERT(list->head);
sys/dev/hptnr/hptnr_os_bsd.c
160
result = list->head;
sys/dev/hptnr/hptnr_os_bsd.c
161
list->head = *(void **)result;
sys/dev/hptnr/hptnr_os_bsd.c
172
*(void **)p = list->head;
sys/dev/hptnr/hptnr_os_bsd.c
173
list->head = p;
sys/dev/hptnr/hptnr_os_bsd.c
188
list->head = 0;
sys/dev/hptnr/hptnr_os_bsd.c
209
*(void **)p = list->head;
sys/dev/hptnr/hptnr_os_bsd.c
211
list->head = p;
sys/dev/hptnr/hptnr_osm_bsd.c
168
*p = f->head;
sys/dev/hptnr/hptnr_osm_bsd.c
169
f->head = p;
sys/dev/hptnr/hptnr_osm_bsd.c
189
*p = f->head;
sys/dev/hptnr/hptnr_osm_bsd.c
191
f->head = p;
sys/dev/hptnr/ldm.h
127
struct tq_item *head, *tail;
sys/dev/hptnr/ldm.h
130
#define TQ_EMPTY(tq) ((tq)->head==0)
sys/dev/hptnr/ldm.h
74
void * head;
sys/dev/hptnr/list.h
100
static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head)
sys/dev/hptnr/list.h
103
__list_splice(list, head);
sys/dev/hptnr/list.h
106
static HPT_INLINE void list_splice_init(struct list_head *list, struct list_head *head)
sys/dev/hptnr/list.h
109
__list_splice(list, head);
sys/dev/hptnr/list.h
117
#define list_for_each(pos, head) \
sys/dev/hptnr/list.h
118
for (pos = (head)->next; pos != (head); pos = pos->next)
sys/dev/hptnr/list.h
120
#define list_for_each_safe(pos, n, head) \
sys/dev/hptnr/list.h
121
for (pos = (head)->next, n = pos->next; pos != (head); \
sys/dev/hptnr/list.h
53
static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head)
sys/dev/hptnr/list.h
55
__list_add(_new, head, head->next);
sys/dev/hptnr/list.h
58
static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head)
sys/dev/hptnr/list.h
60
__list_add(_new, head->prev, head);
sys/dev/hptnr/list.h
80
static HPT_INLINE int list_empty(struct list_head *head)
sys/dev/hptnr/list.h
82
HPT_ASSERT(!(head->next==head && head->prev!=head));
sys/dev/hptnr/list.h
83
return head->next == head;
sys/dev/hptnr/list.h
87
struct list_head *head)
sys/dev/hptnr/list.h
91
struct list_head *at = head->next;
sys/dev/hptnr/list.h
93
first->prev = head;
sys/dev/hptnr/list.h
94
head->next = first;
sys/dev/hptrr/hptrr_os_bsd.c
134
list->head = 0;
sys/dev/hptrr/hptrr_os_bsd.c
145
HPT_ASSERT(list->head);
sys/dev/hptrr/hptrr_os_bsd.c
146
result = list->head;
sys/dev/hptrr/hptrr_os_bsd.c
147
list->head = *(void **)result;
sys/dev/hptrr/hptrr_os_bsd.c
158
*(void **)p = list->head;
sys/dev/hptrr/hptrr_os_bsd.c
159
list->head = p;
sys/dev/hptrr/hptrr_os_bsd.c
174
list->head = 0;
sys/dev/hptrr/hptrr_os_bsd.c
195
*(void **)p = list->head;
sys/dev/hptrr/hptrr_os_bsd.c
197
list->head = p;
sys/dev/hptrr/hptrr_osm_bsd.c
170
*p = f->head;
sys/dev/hptrr/hptrr_osm_bsd.c
171
f->head = p;
sys/dev/hptrr/hptrr_osm_bsd.c
191
*p = f->head;
sys/dev/hptrr/hptrr_osm_bsd.c
193
f->head = p;
sys/dev/hptrr/ldm.h
126
struct tq_item *head, *tail;
sys/dev/hptrr/ldm.h
129
#define TQ_EMPTY(tq) ((tq)->head==0)
sys/dev/hptrr/ldm.h
73
void * head;
sys/dev/hptrr/list.h
103
static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head)
sys/dev/hptrr/list.h
106
__list_splice(list, head);
sys/dev/hptrr/list.h
109
static HPT_INLINE void list_splice_init(struct list_head *list, struct list_head *head)
sys/dev/hptrr/list.h
112
__list_splice(list, head);
sys/dev/hptrr/list.h
120
#define list_for_each(pos, head) \
sys/dev/hptrr/list.h
121
for (pos = (head)->next; pos != (head); pos = pos->next)
sys/dev/hptrr/list.h
123
#define list_for_each_safe(pos, n, head) \
sys/dev/hptrr/list.h
124
for (pos = (head)->next, n = pos->next; pos != (head); \
sys/dev/hptrr/list.h
56
static HPT_INLINE void list_add(struct list_head *_new, struct list_head *head)
sys/dev/hptrr/list.h
58
__list_add(_new, head, head->next);
sys/dev/hptrr/list.h
61
static HPT_INLINE void list_add_tail(struct list_head *_new, struct list_head *head)
sys/dev/hptrr/list.h
63
__list_add(_new, head->prev, head);
sys/dev/hptrr/list.h
83
static HPT_INLINE int list_empty(struct list_head *head)
sys/dev/hptrr/list.h
85
HPT_ASSERT(!(head->next==head && head->prev!=head));
sys/dev/hptrr/list.h
86
return head->next == head;
sys/dev/hptrr/list.h
90
struct list_head *head)
sys/dev/hptrr/list.h
94
struct list_head *at = head->next;
sys/dev/hptrr/list.h
96
first->prev = head;
sys/dev/hptrr/list.h
97
head->next = first;
sys/dev/iavf/iavf_adminq.c
289
wr32(hw, hw->aq.asq.head, 0);
sys/dev/iavf/iavf_adminq.c
318
wr32(hw, hw->aq.arq.head, 0);
sys/dev/iavf/iavf_adminq.c
478
wr32(hw, hw->aq.asq.head, 0);
sys/dev/iavf/iavf_adminq.c
48
hw->aq.asq.head = IAVF_VF_ATQH1;
sys/dev/iavf/iavf_adminq.c
512
wr32(hw, hw->aq.arq.head, 0);
sys/dev/iavf/iavf_adminq.c
53
hw->aq.arq.head = IAVF_VF_ARQH1;
sys/dev/iavf/iavf_adminq.c
618
while (rd32(hw, hw->aq.asq.head) != ntc) {
sys/dev/iavf/iavf_adminq.c
620
"ntc %d head %d.\n", ntc, rd32(hw, hw->aq.asq.head));
sys/dev/iavf/iavf_adminq.c
655
return rd32(hw, hw->aq.asq.head) == hw->aq.asq.next_to_use;
sys/dev/iavf/iavf_adminq.c
695
val = rd32(hw, hw->aq.asq.head);
sys/dev/iavf/iavf_adminq.c
922
ntu = rd32(hw, hw->aq.arq.head) & IAVF_VF_ARQH1_ARQH_MASK;
sys/dev/iavf/iavf_adminq.h
62
u32 head;
sys/dev/iavf/iavf_txrx_iflib.c
453
void *head = &txr->tx_base[scctx->isc_ntxd[0]];
sys/dev/iavf/iavf_txrx_iflib.c
455
return LE32_TO_CPU(*(volatile __le32 *)head);
sys/dev/iavf/iavf_txrx_iflib.c
480
int head, credits;
sys/dev/iavf/iavf_txrx_iflib.c
483
head = iavf_get_tx_head(que);
sys/dev/iavf/iavf_txrx_iflib.c
485
credits = head - txr->tx_cidx_processed;
sys/dev/iavf/iavf_txrx_iflib.c
489
txr->tx_cidx_processed = head;
sys/dev/ice/ice_common.c
1435
ICE_CTX_STORE(ice_rlan_ctx, head, 13, 0),
sys/dev/ice/ice_controlq.c
1005
return rd32(hw, cq->sq.head) == cq->sq.next_to_use;
sys/dev/ice/ice_controlq.c
1064
val = rd32(hw, cq->sq.head);
sys/dev/ice/ice_controlq.c
1269
ntu = (u16)(rd32(hw, cq->rq.head) & cq->rq.head_mask);
sys/dev/ice/ice_controlq.c
1324
ntu = (u16)(rd32(hw, cq->rq.head) & cq->rq.head_mask);
sys/dev/ice/ice_controlq.c
271
wr32(hw, ring->head, 0);
sys/dev/ice/ice_controlq.c
36
(qinfo)->sq.head = prefix##_ATQH; \
sys/dev/ice/ice_controlq.c
45
(qinfo)->rq.head = prefix##_ARQH; \
sys/dev/ice/ice_controlq.c
482
wr32(hw, cq->sq.head, 0);
sys/dev/ice/ice_controlq.c
556
wr32(hw, cq->rq.head, 0);
sys/dev/ice/ice_controlq.c
882
u32 head;
sys/dev/ice/ice_controlq.c
886
head = rd32(hw, sq->head);
sys/dev/ice/ice_controlq.c
887
if (head >= sq->count) {
sys/dev/ice/ice_controlq.c
890
head);
sys/dev/ice/ice_controlq.c
894
while (head != ntc) {
sys/dev/ice/ice_controlq.c
897
ntc, head);
sys/dev/ice/ice_controlq.c
904
head = rd32(hw, sq->head);
sys/dev/ice/ice_controlq.c
905
if (head >= sq->count) {
sys/dev/ice/ice_controlq.c
908
head);
sys/dev/ice/ice_controlq.h
101
u32 head;
sys/dev/ice/ice_lan_tx_rx.h
819
u16 head;
sys/dev/ice/ice_osdep.h
229
#define LIST_ADD(entry, head) LIST_INSERT_HEAD(head, entry, entries)
sys/dev/ice/ice_osdep.h
234
#define LIST_FIRST_ENTRY(head, type, member) \
sys/dev/ice/ice_osdep.h
235
_osdep_LIST_ENTRY(LIST_FIRST(head), type, member)
sys/dev/ice/ice_osdep.h
264
ice_get_list_tail(struct ice_list_head *head)
sys/dev/ice/ice_osdep.h
266
struct ice_list_node *node = LIST_FIRST(head);
sys/dev/ice/ice_osdep.h
278
#define LIST_ADD_TAIL(entry, head) do { \
sys/dev/ice/ice_osdep.h
279
struct ice_list_node *node = ice_get_list_tail(head); \
sys/dev/ice/ice_osdep.h
282
LIST_ADD(entry, head); \
sys/dev/ice/ice_osdep.h
288
#define LIST_LAST_ENTRY(head, type, member) \
sys/dev/ice/ice_osdep.h
289
LIST_ENTRY_SAFE(ice_get_list_tail(head), type, member)
sys/dev/ice/ice_osdep.h
291
#define LIST_FIRST_ENTRY_SAFE(head, type, member) \
sys/dev/ice/ice_osdep.h
292
LIST_ENTRY_SAFE(LIST_FIRST(head), type, member)
sys/dev/ice/ice_osdep.h
297
#define LIST_FOR_EACH_ENTRY(pos, head, unused, member) \
sys/dev/ice/ice_osdep.h
298
for (pos = LIST_FIRST_ENTRY_SAFE(head, __typeof(*pos), member); \
sys/dev/ice/ice_osdep.h
302
#define LIST_FOR_EACH_ENTRY_SAFE(pos, n, head, unused, member) \
sys/dev/ice/ice_osdep.h
303
for (pos = LIST_FIRST_ENTRY_SAFE(head, __typeof(*pos), member); \
sys/dev/ice/ice_switch.c
4239
struct LIST_HEAD_TYPE *head = &sw->recp_list[i].filt_rules;
sys/dev/ice/ice_switch.c
4241
status = ice_replay_fltr(hw, i, head);
sys/dev/ice/ice_switch.c
4333
struct LIST_HEAD_TYPE *head;
sys/dev/ice/ice_switch.c
4335
head = &sw->recp_list[i].filt_replay_rules;
sys/dev/ice/ice_switch.c
4338
head);
sys/dev/ice/ice_type.h
1016
u32 head;
sys/dev/ice/ice_vf_mbx.c
238
if (num_iterations == snap_buf->head ||
sys/dev/ice/ice_vf_mbx.c
381
snap_buf->head = ICE_RQ_DATA_MASK(cq->rq.next_to_clean +
sys/dev/ioat/ioat.c
1093
ioat->acq_head = ioat->head;
sys/dev/ioat/ioat.c
1118
ioat->chan_idx, ioat->head);
sys/dev/ioat/ioat.c
1121
ioat->chan_idx, ioat->head);
sys/dev/ioat/ioat.c
1123
if (ioat->acq_head != ioat->head) {
sys/dev/ioat/ioat.c
1125
(uint16_t)ioat->head);
sys/dev/ioat/ioat.c
1161
desc = ioat_get_ring_entry(ioat, ioat->head);
sys/dev/ioat/ioat.c
1162
hw_desc = &ioat_get_descriptor(ioat, ioat->head)->generic;
sys/dev/ioat/ioat.c
1505
return ((ioat->head - ioat->tail) & ((1 << ioat->ring_size_order) - 1));
sys/dev/ioat/ioat.c
1659
ioat->head++;
sys/dev/ioat/ioat.c
1661
ioat->chan_idx, ioat->head, ioat->tail);
sys/dev/ioat/ioat.c
1784
ioat->tail = ioat->head = 0;
sys/dev/ioat/ioat.c
1959
SYSCTL_ADD_UINT(ctx, state, OID_AUTO, "head", CTLFLAG_RD, &ioat->head,
sys/dev/ioat/ioat.c
2090
db_printf(" head: %u\n", sc->head);
sys/dev/ioat/ioat.c
2107
db_printf(" ring[%u] (head - 1):\n", (sc->head - 1) %
sys/dev/ioat/ioat.c
2109
db_printf(" id: %u\n", ioat_get_ring_entry(sc, sc->head - 1)->id);
sys/dev/ioat/ioat.c
2111
RING_PHYS_ADDR(sc, sc->head - 1));
sys/dev/ioat/ioat.c
2113
ioat_get_descriptor(sc, sc->head - 1)->generic.next);
sys/dev/ioat/ioat.c
2115
db_printf(" ring[%u] (head):\n", (sc->head) %
sys/dev/ioat/ioat.c
2117
db_printf(" id: %u\n", ioat_get_ring_entry(sc, sc->head)->id);
sys/dev/ioat/ioat.c
2119
RING_PHYS_ADDR(sc, sc->head));
sys/dev/ioat/ioat.c
2121
ioat_get_descriptor(sc, sc->head)->generic.next);
sys/dev/ioat/ioat.c
488
desc = ioat_get_ring_entry(ioat, ioat->head);
sys/dev/ioat/ioat.c
489
hw_desc = &ioat_get_descriptor(ioat, ioat->head)->dma;
sys/dev/ioat/ioat.c
666
ioat->tail = ioat->head = 0;
sys/dev/ioat/ioat.c
867
ioat->chan_idx, ioat->head, ioat->tail, ioat_get_active(ioat));
sys/dev/ioat/ioat.c
931
ioat->chan_idx, ioat->head, ioat->tail, ioat_get_active(ioat));
sys/dev/ioat/ioat_internal.h
500
uint32_t head;
sys/dev/irdma/irdma_ctrl.c
3296
"CQP SQ head 0x%x tail 0x%x size 0x%x\n", cqp->sq_ring.head,
sys/dev/irdma/irdma_ctrl.c
3317
cqp->sq_ring.head, cqp->sq_ring.tail,
sys/dev/irdma/irdma_ctrl.c
62
irdma_get_qp_from_list(struct list_head *head,
sys/dev/irdma/irdma_ctrl.c
68
if (list_empty(head))
sys/dev/irdma/irdma_ctrl.c
72
entry = (head)->next;
sys/dev/irdma/irdma_ctrl.c
76
if (entry == head)
sys/dev/irdma/irdma_defs.h
1424
((_ring).head + (_i)) % (_ring).size \
sys/dev/irdma/irdma_defs.h
1445
(_ring).head = 0; \
sys/dev/irdma/irdma_defs.h
1450
#define IRDMA_RING_CURRENT_HEAD(_ring) ((_ring).head)
sys/dev/irdma/irdma_protos.h
88
struct irdma_sc_qp *irdma_get_qp_from_list(struct list_head *head,
sys/dev/irdma/irdma_puda.c
280
peek_head = (cq_uk->cq_ring.head + 1) % cq_uk->cq_ring.size;
sys/dev/irdma/irdma_uk.c
108
if (!qp->sq_ring.head)
sys/dev/irdma/irdma_uk.c
1137
irdma_pr_err("%p %d %d\n", cqe, cq->cq_ring.head, wqe_idx);
sys/dev/irdma/irdma_uk.c
1235
peek_head = (cq->cq_ring.head + 1) % cq->cq_ring.size;
sys/dev/irdma/irdma_uk.c
1364
if (wqe_idx < qp->conn_wqes && qp->sq_ring.head == qp->sq_ring.tail) {
sys/dev/irdma/irdma_uk.c
170
if (sw_sq_head != qp->initial_ring.head) {
sys/dev/irdma/irdma_uk.c
175
if (sw_sq_head > qp->initial_ring.head) {
sys/dev/irdma/irdma_uk.c
1756
cq_head = cq->cq_ring.head;
sys/dev/irdma/irdma_uk.c
176
if (hw_sq_tail >= qp->initial_ring.head &&
sys/dev/irdma/irdma_uk.c
180
if (hw_sq_tail >= qp->initial_ring.head ||
sys/dev/irdma/irdma_uk.c
187
qp->initial_ring.head = qp->sq_ring.head;
sys/dev/irdma/irdma_uk.c
200
qp->initial_ring.head = qp->sq_ring.head;
sys/dev/irdma/irdma_uk.c
240
u32 head, tail;
sys/dev/irdma/irdma_uk.c
242
head = IRDMA_RING_CURRENT_HEAD(qp->initial_ring);
sys/dev/irdma/irdma_uk.c
245
if (head == tail || head == (tail + 1))
sys/dev/irdma/irdma_user.h
284
volatile u32 head;
sys/dev/iscsi/icl_soft_proxy.c
207
struct socket *head, *so;
sys/dev/iscsi/icl_soft_proxy.c
212
head = ils->ils_socket;
sys/dev/iscsi/icl_soft_proxy.c
217
SOLISTEN_LOCK(head);
sys/dev/iscsi/icl_soft_proxy.c
218
error = solisten_dequeue(head, &so, 0);
sys/dev/ismt/ismt.c
161
uint8_t head;
sys/dev/ismt/ismt.c
235
desc = &sc->desc[sc->head++];
sys/dev/ismt/ismt.c
236
if (sc->head == ISMT_DESC_ENTRIES)
sys/dev/ismt/ismt.c
237
sc->head = 0;
sys/dev/ismt/ismt.c
260
fmhp = sc->head << 16;
sys/dev/iwn/if_iwn.c
3029
caddr_t head;
sys/dev/iwn/if_iwn.c
3055
head = (caddr_t)(mpdu + 1);
sys/dev/iwn/if_iwn.c
3058
head = (caddr_t)(stat + 1) + stat->cfg_phy_len;
sys/dev/iwn/if_iwn.c
3062
flags = le32toh(*(uint32_t *)(head + len));
sys/dev/iwn/if_iwn.c
3123
m->m_data = head;
sys/dev/ixgbe/if_bypass.c
553
u32 cmd, base, head;
sys/dev/ixgbe/if_bypass.c
589
head = (status & BYPASS_CTL2_HEAD_M) >> BYPASS_CTL2_HEAD_SHIFT;
sys/dev/ixgbe/if_bypass.c
592
log_off = base + (head * 5);
sys/dev/ixgbe/if_bypass.c
628
head = head ? head - 1 : BYPASS_MAX_LOGS;
sys/dev/ixgbe/if_bypass.c
629
log_off = base + (head * 5);
sys/dev/ixgbe/ixgbe_type_e610.h
1913
u16 head;
sys/dev/ixl/i40e_adminq.c
1094
ntu = rd32(hw, hw->aq.arq.head) & I40E_PF_ARQH_ARQH_MASK;
sys/dev/ixl/i40e_adminq.c
1096
ntu = rd32(hw, hw->aq.arq.head) & I40E_VF_ARQH1_ARQH_MASK;
sys/dev/ixl/i40e_adminq.c
304
wr32(hw, hw->aq.asq.head, 0);
sys/dev/ixl/i40e_adminq.c
337
wr32(hw, hw->aq.arq.head, 0);
sys/dev/ixl/i40e_adminq.c
501
wr32(hw, hw->aq.asq.head, 0);
sys/dev/ixl/i40e_adminq.c
51
hw->aq.asq.head = I40E_VF_ATQH1;
sys/dev/ixl/i40e_adminq.c
535
wr32(hw, hw->aq.arq.head, 0);
sys/dev/ixl/i40e_adminq.c
56
hw->aq.arq.head = I40E_VF_ARQH1;
sys/dev/ixl/i40e_adminq.c
62
hw->aq.asq.head = I40E_PF_ATQH;
sys/dev/ixl/i40e_adminq.c
67
hw->aq.arq.head = I40E_PF_ARQH;
sys/dev/ixl/i40e_adminq.c
789
while (rd32(hw, hw->aq.asq.head) != ntc) {
sys/dev/ixl/i40e_adminq.c
791
"ntc %d head %d.\n", ntc, rd32(hw, hw->aq.asq.head));
sys/dev/ixl/i40e_adminq.c
826
return rd32(hw, hw->aq.asq.head) == hw->aq.asq.next_to_use;
sys/dev/ixl/i40e_adminq.c
866
val = rd32(hw, hw->aq.asq.head);
sys/dev/ixl/i40e_adminq.h
64
u32 head;
sys/dev/ixl/i40e_lan_hmc.c
708
{I40E_HMC_STORE(i40e_hmc_obj_txq, head), 13, 0 },
sys/dev/ixl/i40e_lan_hmc.c
734
{ I40E_HMC_STORE(i40e_hmc_obj_rxq, head), 13, 0 },
sys/dev/ixl/i40e_lan_hmc.h
50
u16 head;
sys/dev/ixl/i40e_lan_hmc.h
83
u16 head;
sys/dev/ixl/ixl_txrx.c
456
void *head = &txr->tx_base[scctx->isc_ntxd[0]];
sys/dev/ixl/ixl_txrx.c
458
return LE32_TO_CPU(*(volatile __le32 *)head);
sys/dev/ixl/ixl_txrx.c
468
int head, credits;
sys/dev/ixl/ixl_txrx.c
471
head = ixl_get_tx_head(que);
sys/dev/ixl/ixl_txrx.c
473
credits = head - txr->tx_cidx_processed;
sys/dev/ixl/ixl_txrx.c
477
txr->tx_cidx_processed = head;
sys/dev/liquidio/base/lio_device.c
524
STAILQ_INIT(&oct->dispatch.dlist[i].head);
sys/dev/liquidio/base/lio_device.c
546
dispatch = &oct->dispatch.dlist[i].head;
sys/dev/liquidio/base/lio_device.c
549
STAILQ_REMOVE_HEAD(&oct->dispatch.dlist[i].head,
sys/dev/liquidio/base/lio_device.c
593
STAILQ_FOREACH(dispatch, &octeon_dev->dispatch.dlist[idx].head,
sys/dev/liquidio/base/lio_device.c
677
STAILQ_INSERT_HEAD(&oct->dispatch.dlist[idx].head,
sys/dev/liquidio/base/lio_device.c
725
dispatch_head = &oct->dispatch.dlist[idx].head;
sys/dev/liquidio/base/lio_device.c
744
&oct->dispatch.dlist[idx].head,
sys/dev/liquidio/base/lio_device.c
748
STAILQ_REMOVE(&oct->dispatch.dlist[idx].head,
sys/dev/liquidio/base/lio_device.h
135
struct lio_stailq_head head;
sys/dev/liquidio/base/lio_droq.c
89
&octeon_dev->dispatch.dlist[idx].head, entries) {
sys/dev/liquidio/base/lio_iq.h
271
struct lio_stailq_head head;
sys/dev/liquidio/base/lio_request_manager.c
439
head, &sc->node, entries);
sys/dev/liquidio/base/lio_request_manager.c
719
STAILQ_INIT(&oct->sc_buf_pool.head);
sys/dev/liquidio/base/lio_request_manager.c
734
STAILQ_INSERT_TAIL(&oct->sc_buf_pool.head, &sc->node, entries);
sys/dev/liquidio/base/lio_request_manager.c
748
STAILQ_FOREACH_SAFE(tmp, &oct->sc_buf_pool.head, entries, tmp2) {
sys/dev/liquidio/base/lio_request_manager.c
749
sc = LIO_STAILQ_FIRST_ENTRY(&oct->sc_buf_pool.head,
sys/dev/liquidio/base/lio_request_manager.c
752
STAILQ_REMOVE_HEAD(&oct->sc_buf_pool.head, entries);
sys/dev/liquidio/base/lio_request_manager.c
757
STAILQ_INIT(&oct->sc_buf_pool.head);
sys/dev/liquidio/base/lio_request_manager.c
781
if (STAILQ_EMPTY(&oct->sc_buf_pool.head)) {
sys/dev/liquidio/base/lio_request_manager.c
785
tmp = STAILQ_LAST(&oct->sc_buf_pool.head, lio_stailq_node, entries);
sys/dev/liquidio/base/lio_request_manager.c
787
STAILQ_REMOVE(&oct->sc_buf_pool.head, tmp, lio_stailq_node, entries);
sys/dev/liquidio/base/lio_request_manager.c
838
STAILQ_INSERT_TAIL(&oct->sc_buf_pool.head, &sc->node, entries);
sys/dev/liquidio/base/lio_response_manager.c
107
if (STAILQ_EMPTY(&ordered_sc_list->head)) {
sys/dev/liquidio/base/lio_response_manager.c
116
sc = LIO_STAILQ_FIRST_ENTRY(&ordered_sc_list->head,
sys/dev/liquidio/base/lio_response_manager.c
162
[LIO_ORDERED_SC_LIST].head,
sys/dev/liquidio/base/lio_response_manager.c
51
STAILQ_INIT(&oct->response_list[i].head);
sys/dev/liquidio/base/lio_response_manager.h
60
struct lio_stailq_head head;
sys/dev/mana/gdma.h
338
uint32_t head;
sys/dev/mana/gdma_main.c
1014
queue->head = 0;
sys/dev/mana/gdma_main.c
1059
queue->head = 0;
sys/dev/mana/gdma_main.c
1218
uint32_t used_space = (wq->head - wq->tail) * GDMA_WQE_BU_SIZE;
sys/dev/mana/gdma_main.c
1360
wqe_ptr = mana_gd_get_wqe_ptr(wq, wq->head);
sys/dev/mana/gdma_main.c
1368
wq->head += wqe_size / GDMA_WQE_BU_SIZE;
sys/dev/mana/gdma_main.c
1401
cqe = &cq_cqe[cq->head % num_cqe];
sys/dev/mana/gdma_main.c
1404
old_bits = (cq->head / num_cqe - 1) & GDMA_CQE_OWNER_MASK;
sys/dev/mana/gdma_main.c
1409
new_bits = (cq->head / num_cqe) & GDMA_CQE_OWNER_MASK;
sys/dev/mana/gdma_main.c
1440
cq->head -= cqe_idx;
sys/dev/mana/gdma_main.c
1447
cq->head++;
sys/dev/mana/gdma_main.c
474
queue->id, queue->head * GDMA_WQE_BU_SIZE, 0);
sys/dev/mana/gdma_main.c
484
uint32_t head = cq->head % (num_cqe << GDMA_CQE_OWNER_BITS);
sys/dev/mana/gdma_main.c
487
head, arm_bit);
sys/dev/mana/gdma_main.c
493
uint32_t head = eq->head % (eq->queue_size / GDMA_EQE_SIZE);
sys/dev/mana/gdma_main.c
503
eqe = &eq_eqe_ptr[head];
sys/dev/mana/gdma_main.c
562
uint32_t head, num_eqe;
sys/dev/mana/gdma_main.c
576
eqe = &eq_eqe_ptr[eq->head % num_eqe];
sys/dev/mana/gdma_main.c
580
old_bits = (eq->head / num_eqe - 1) & GDMA_EQE_OWNER_MASK;
sys/dev/mana/gdma_main.c
586
new_bits = (eq->head / num_eqe) & GDMA_EQE_OWNER_MASK;
sys/dev/mana/gdma_main.c
596
eq->id, i, eq->head,
sys/dev/mana/gdma_main.c
616
eq->head++;
sys/dev/mana/gdma_main.c
622
head = eq->head % (num_eqe << GDMA_EQE_OWNER_BITS);
sys/dev/mana/gdma_main.c
625
head, SET_ARM_BIT);
sys/dev/mana/gdma_main.c
814
queue->head |= INITIALIZED_OWNER_BIT(log2_num_entries);
sys/dev/mana/gdma_main.c
840
queue->head |= INITIALIZED_OWNER_BIT(log2_num_entries);
sys/dev/mana/gdma_main.c
876
queue->head = 0;
sys/dev/mana/mana_en.c
1410
used_space_old = wq->head - wq->tail;
sys/dev/mana/mana_en.c
1411
used_space_new = wq->head - (wq->tail + num_units);
sys/dev/mlx4/mlx4_ib/mlx4_ib.h
176
unsigned head;
sys/dev/mlx4/mlx4_ib/mlx4_ib.h
341
int head;
sys/dev/mlx4/mlx4_ib/mlx4_ib_alias_GUID.c
502
struct list_head *head =
sys/dev/mlx4/mlx4_ib/mlx4_ib_alias_GUID.c
543
list_add_tail(&callback_context->list, head);
sys/dev/mlx4/mlx4_ib/mlx4_ib_cq.c
608
cur = wq->head - wq->tail;
sys/dev/mlx4/mlx4_ib/mlx4_ib_main.c
2962
if (mqp->sq.tail != mqp->sq.head) {
sys/dev/mlx4/mlx4_ib/mlx4_ib_main.c
2980
if (mqp->rq.tail != mqp->rq.head) {
sys/dev/mlx4/mlx4_ib/mlx4_ib_qp.c
2060
qp->rq.head = 0;
sys/dev/mlx4/mlx4_ib/mlx4_ib_qp.c
2062
qp->sq.head = 0;
sys/dev/mlx4/mlx4_ib/mlx4_ib_qp.c
2693
cur = wq->head - wq->tail;
sys/dev/mlx4/mlx4_ib/mlx4_ib_qp.c
2699
cur = wq->head - wq->tail;
sys/dev/mlx4/mlx4_ib/mlx4_ib_qp.c
3002
qp->sq.wrid[(qp->sq.head + nreq) & (qp->sq.wqe_cnt - 1)] = wr->wr_id;
sys/dev/mlx4/mlx4_ib/mlx4_ib_qp.c
3238
qp->sq.head += nreq;
sys/dev/mlx4/mlx4_ib/mlx4_ib_qp.c
3289
ind = qp->rq.head & (qp->rq.wqe_cnt - 1);
sys/dev/mlx4/mlx4_ib/mlx4_ib_qp.c
3337
qp->rq.head += nreq;
sys/dev/mlx4/mlx4_ib/mlx4_ib_qp.c
3345
*qp->db.db = cpu_to_be32(qp->rq.head & 0xffff);
sys/dev/mlx4/mlx4_ib/mlx4_ib_srq.c
144
srq->head = 0;
sys/dev/mlx4/mlx4_ib/mlx4_ib_srq.c
333
if (unlikely(srq->head == srq->tail)) {
sys/dev/mlx4/mlx4_ib/mlx4_ib_srq.c
339
srq->wrid[srq->head] = wr->wr_id;
sys/dev/mlx4/mlx4_ib/mlx4_ib_srq.c
341
next = get_wqe(srq, srq->head);
sys/dev/mlx4/mlx4_ib/mlx4_ib_srq.c
342
srq->head = be16_to_cpu(next->next_wqe_index);
sys/dev/mlx5/driver.h
259
struct list_head head;
sys/dev/mlx5/fs.h
364
struct list_head head;
sys/dev/mlx5/mlx5_core/mlx5_cmd.c
1197
list_add_tail(&msg->list, &msg->cache->head);
sys/dev/mlx5/mlx5_core/mlx5_cmd.c
1276
if (!list_empty(&ent->head)) {
sys/dev/mlx5/mlx5_core/mlx5_cmd.c
1277
msg = list_entry(ent->head.next, struct mlx5_cmd_msg,
sys/dev/mlx5/mlx5_core/mlx5_cmd.c
1444
list_for_each_entry_safe(msg, n, &cmd->cache.large.head, list) {
sys/dev/mlx5/mlx5_core/mlx5_cmd.c
1449
list_for_each_entry_safe(msg, n, &cmd->cache.med.head, list) {
sys/dev/mlx5/mlx5_core/mlx5_cmd.c
1463
INIT_LIST_HEAD(&cmd->cache.large.head);
sys/dev/mlx5/mlx5_core/mlx5_cmd.c
1465
INIT_LIST_HEAD(&cmd->cache.med.head);
sys/dev/mlx5/mlx5_core/mlx5_cmd.c
1474
list_add_tail(&msg->list, &cmd->cache.large.head);
sys/dev/mlx5/mlx5_core/mlx5_cmd.c
1484
list_add_tail(&msg->list, &cmd->cache.med.head);
sys/dev/mlx5/mlx5_core/mlx5_fs_core.c
1744
static void free_match_list(struct match_list *head, bool ft_locked)
sys/dev/mlx5/mlx5_core/mlx5_fs_core.c
1748
list_for_each_entry_safe(iter, match_tmp, &head->list,
sys/dev/mlx5/mlx5_core/mlx5_fs_core.c
847
#define list_for_each_advance_continue(pos, head, reverse) \
sys/dev/mlx5/mlx5_core/mlx5_fs_core.c
849
&pos->list != (head); \
sys/dev/mlx5/mlx5_core/mlx5_uar.c
206
struct list_head *head;
sys/dev/mlx5/mlx5_core/mlx5_uar.c
214
head = &bfregs->wc_head.list;
sys/dev/mlx5/mlx5_core/mlx5_uar.c
217
head = &bfregs->reg_head.list;
sys/dev/mlx5/mlx5_core/mlx5_uar.c
221
if (list_empty(head)) {
sys/dev/mlx5/mlx5_core/mlx5_uar.c
227
list_add(&up->list, head);
sys/dev/mlx5/mlx5_core/mlx5_uar.c
229
up = list_entry(head->next, struct mlx5_uars_page, list);
sys/dev/mlx5/mlx5_core/mlx5_uar.c
295
struct list_head *head;
sys/dev/mlx5/mlx5_core/mlx5_uar.c
299
head = &bfregs->wc_head.list;
sys/dev/mlx5/mlx5_core/mlx5_uar.c
302
head = &bfregs->reg_head.list;
sys/dev/mlx5/mlx5_core/mlx5_uar.c
319
list_add_tail(&up->list, head);
sys/dev/mlx5/mlx5_core/wq.h
168
wq->head = head_next;
sys/dev/mlx5/mlx5_core/wq.h
74
u16 head;
sys/dev/mlx5/mlx5_en/en.h
1013
TAILQ_HEAD(, mlx5e_vxlan_db_el) head;
sys/dev/mlx5/mlx5_en/mlx5_en_flow_table.c
1713
TAILQ_FOREACH(el, &priv->vxlan.head, link) {
sys/dev/mlx5/mlx5_en/mlx5_en_flow_table.c
1795
TAILQ_INSERT_TAIL(&priv->vxlan.head, el, link);
sys/dev/mlx5/mlx5_en/mlx5_en_flow_table.c
1861
TAILQ_FOREACH(el, &priv->vxlan.head, link) {
sys/dev/mlx5/mlx5_en/mlx5_en_flow_table.c
1894
TAILQ_REMOVE(&priv->vxlan.head, el, link);
sys/dev/mlx5/mlx5_en/mlx5_en_flow_table.c
1904
TAILQ_FOREACH(el, &priv->vxlan.head, link) {
sys/dev/mlx5/mlx5_en/mlx5_en_flow_table.c
2035
TAILQ_INIT(&priv->vxlan.head);
sys/dev/mlx5/mlx5_en/mlx5_en_rx.c
113
struct mlx5e_rx_wqe *wqe = mlx5_wq_ll_get_wqe(&rq->wq, rq->wq.head);
sys/dev/mlx5/mlx5_en/mlx5_en_rx.c
115
if (unlikely(mlx5e_alloc_rx_wqe(rq, wqe, rq->wq.head))) {
sys/dev/mlx5/mlx5_ib/mlx5_ib.h
238
unsigned head;
sys/dev/mlx5/mlx5_ib/mlx5_ib.h
504
int head;
sys/dev/mlx5/mlx5_ib/mlx5_ib.h
589
struct list_head head;
sys/dev/mlx5/mlx5_ib/mlx5_ib_cq.c
384
u16 tail, u16 head)
sys/dev/mlx5/mlx5_ib/mlx5_ib_cq.c
391
if (idx == head)
sys/dev/mlx5/mlx5_ib/mlx5_ib_cq.c
447
cur = wq->head - wq->tail;
sys/dev/mlx5/mlx5_ib/mlx5_ib_cq.c
476
cur = wq->head - wq->tail;
sys/dev/mlx5/mlx5_ib/mlx5_ib_main.c
2614
if (mqp->sq.tail != mqp->sq.head) {
sys/dev/mlx5/mlx5_ib/mlx5_ib_main.c
2631
if (mqp->rq.tail != mqp->rq.head) {
sys/dev/mlx5/mlx5_ib/mlx5_ib_mr.c
140
list_add_tail(&mr->list, &ent->head);
sys/dev/mlx5/mlx5_ib/mlx5_ib_mr.c
224
if (list_empty(&ent->head)) {
sys/dev/mlx5/mlx5_ib/mlx5_ib_mr.c
228
mr = list_first_entry(&ent->head, struct mlx5_ib_mr, list);
sys/dev/mlx5/mlx5_ib/mlx5_ib_mr.c
341
if (!list_empty(&ent->head)) {
sys/dev/mlx5/mlx5_ib/mlx5_ib_mr.c
342
mr = list_first_entry(&ent->head, struct mlx5_ib_mr,
sys/dev/mlx5/mlx5_ib/mlx5_ib_mr.c
376
list_add_tail(&mr->list, &ent->head);
sys/dev/mlx5/mlx5_ib/mlx5_ib_mr.c
396
if (list_empty(&ent->head)) {
sys/dev/mlx5/mlx5_ib/mlx5_ib_mr.c
400
mr = list_first_entry(&ent->head, struct mlx5_ib_mr, list);
sys/dev/mlx5/mlx5_ib/mlx5_ib_mr.c
437
INIT_LIST_HEAD(&cache->ent[i].head);
sys/dev/mlx5/mlx5_ib/mlx5_ib_mr.c
441
INIT_LIST_HEAD(&ent->head);
sys/dev/mlx5/mlx5_ib/mlx5_ib_qp.c
2942
qp->rq.head = 0;
sys/dev/mlx5/mlx5_ib/mlx5_ib_qp.c
2944
qp->sq.head = 0;
sys/dev/mlx5/mlx5_ib/mlx5_ib_qp.c
3039
cur = wq->head - wq->tail;
sys/dev/mlx5/mlx5_ib/mlx5_ib_qp.c
3045
cur = wq->head - wq->tail;
sys/dev/mlx5/mlx5_ib/mlx5_ib_qp.c
3890
qp->sq.wqe_head[idx] = qp->sq.head + nreq;
sys/dev/mlx5/mlx5_ib/mlx5_ib_qp.c
4180
qp->sq.head += nreq;
sys/dev/mlx5/mlx5_ib/mlx5_ib_qp.c
4237
ind = qp->rq.head & (qp->rq.wqe_cnt - 1);
sys/dev/mlx5/mlx5_ib/mlx5_ib_qp.c
4277
qp->rq.head += nreq;
sys/dev/mlx5/mlx5_ib/mlx5_ib_qp.c
4284
*qp->db.db = cpu_to_be32(qp->rq.head & 0xffff);
sys/dev/mlx5/mlx5_ib/mlx5_ib_srq.c
175
srq->head = 0;
sys/dev/mlx5/mlx5_ib/mlx5_ib_srq.c
457
if (unlikely(srq->head == srq->tail)) {
sys/dev/mlx5/mlx5_ib/mlx5_ib_srq.c
463
srq->wrid[srq->head] = wr->wr_id;
sys/dev/mlx5/mlx5_ib/mlx5_ib_srq.c
465
next = get_wqe(srq, srq->head);
sys/dev/mlx5/mlx5_ib/mlx5_ib_srq.c
466
srq->head = be16_to_cpu(next->next_wqe_index);
sys/dev/mthca/mthca_provider.h
253
unsigned head;
sys/dev/mthca/mthca_qp.c
1557
cur = wq->head - wq->tail;
sys/dev/mthca/mthca_qp.c
1563
cur = wq->head - wq->tail;
sys/dev/mthca/mthca_qp.c
1642
qp->sq.head, qp->sq.tail,
sys/dev/mthca/mthca_qp.c
1805
qp->sq.head += nreq;
sys/dev/mthca/mthca_qp.c
1843
qp->rq.head, qp->rq.tail,
sys/dev/mthca/mthca_qp.c
1896
qp->rq.head += MTHCA_TAVOR_MAX_WQES_PER_RECV_DB;
sys/dev/mthca/mthca_qp.c
1910
qp->rq.head += nreq;
sys/dev/mthca/mthca_qp.c
1951
ind = qp->sq.head & (qp->sq.max - 1);
sys/dev/mthca/mthca_qp.c
1958
((qp->sq.head & 0xffff) << 8) | f0 | op0;
sys/dev/mthca/mthca_qp.c
1960
qp->sq.head += MTHCA_ARBEL_MAX_WQES_PER_SEND_DB;
sys/dev/mthca/mthca_qp.c
1967
*qp->sq.db = cpu_to_be32(qp->sq.head & 0xffff);
sys/dev/mthca/mthca_qp.c
1983
qp->sq.head, qp->sq.tail,
sys/dev/mthca/mthca_qp.c
2131
dbhi = (nreq << 24) | ((qp->sq.head & 0xffff) << 8) | f0 | op0;
sys/dev/mthca/mthca_qp.c
2133
qp->sq.head += nreq;
sys/dev/mthca/mthca_qp.c
2140
*qp->sq.db = cpu_to_be32(qp->sq.head & 0xffff);
sys/dev/mthca/mthca_qp.c
2178
ind = qp->rq.head & (qp->rq.max - 1);
sys/dev/mthca/mthca_qp.c
2184
qp->rq.head, qp->rq.tail,
sys/dev/mthca/mthca_qp.c
2219
qp->rq.head += nreq;
sys/dev/mthca/mthca_qp.c
2226
*qp->rq.db = cpu_to_be32(qp->rq.head & 0xffff);
sys/dev/mthca/mthca_qp.c
234
wq->head = 0;
sys/dev/netmap/if_ptnet.c
1129
kring->rhead = kring->ring->head = atok->head;
sys/dev/netmap/if_ptnet.c
1136
ktoa->hwcur, atok->head, atok->cur,
sys/dev/netmap/if_ptnet.c
1140
kring->ring->head, kring->ring->cur, kring->nr_hwtail,
sys/dev/netmap/if_ptnet.c
1338
unsigned int head, unsigned int sync_flags)
sys/dev/netmap/if_ptnet.c
1347
ring->head = ring->cur = head;
sys/dev/netmap/if_ptnet.c
1350
kring->rcur = kring->rhead = head;
sys/dev/netmap/if_ptnet.c
1383
unsigned int head;
sys/dev/netmap/if_ptnet.c
1411
head = ring->head;
sys/dev/netmap/if_ptnet.c
1415
if (PTNET_TX_NOSPACE(head, kring, minspace)) {
sys/dev/netmap/if_ptnet.c
1421
if (PTNET_TX_NOSPACE(head, kring, minspace)) {
sys/dev/netmap/if_ptnet.c
1435
if (likely(PTNET_TX_NOSPACE(head, kring,
sys/dev/netmap/if_ptnet.c
1453
slot = ring->slot + head;
sys/dev/netmap/if_ptnet.c
1514
head = nm_next(head, lim);
sys/dev/netmap/if_ptnet.c
1515
KASSERT(head != ring->tail,
sys/dev/netmap/if_ptnet.c
1517
slot = ring->slot + head;
sys/dev/netmap/if_ptnet.c
1526
head = nm_next(head, lim);
sys/dev/netmap/if_ptnet.c
1544
ptnet_ring_update(pq, kring, head, NAF_FORCE_RECLAIM);
sys/dev/netmap/if_ptnet.c
1550
ptnet_ring_update(pq, kring, head, NAF_FORCE_RECLAIM);
sys/dev/netmap/if_ptnet.c
1614
ptnet_rx_discard(struct netmap_kring *kring, unsigned int head)
sys/dev/netmap/if_ptnet.c
1617
struct netmap_slot *slot = ring->slot + head;
sys/dev/netmap/if_ptnet.c
1620
head = nm_next(head, kring->nkr_num_slots - 1);
sys/dev/netmap/if_ptnet.c
1621
if (!(slot->flags & NS_MOREFRAG) || head == ring->tail) {
sys/dev/netmap/if_ptnet.c
1624
slot = ring->slot + head;
sys/dev/netmap/if_ptnet.c
1627
return head;
sys/dev/netmap/if_ptnet.c
1682
uint32_t head;
sys/dev/netmap/if_ptnet.c
1692
head = ring->head;
sys/dev/netmap/if_ptnet.c
1694
uint32_t prev_head = head;
sys/dev/netmap/if_ptnet.c
1702
if (head == ring->tail) {
sys/dev/netmap/if_ptnet.c
1708
if (head == ring->tail) {
sys/dev/netmap/if_ptnet.c
1722
if (likely(head == ring->tail)) {
sys/dev/netmap/if_ptnet.c
1731
slot = ring->slot + head;
sys/dev/netmap/if_ptnet.c
1742
head = ptnet_rx_discard(kring, head);
sys/dev/netmap/if_ptnet.c
1776
head, ring->tail, slot->len,
sys/dev/netmap/if_ptnet.c
1788
__func__, head, prev_head);
sys/dev/netmap/if_ptnet.c
1789
head = prev_head;
sys/dev/netmap/if_ptnet.c
1801
head = nm_next(head, lim);
sys/dev/netmap/if_ptnet.c
1807
if (unlikely(head == ring->tail)) {
sys/dev/netmap/if_ptnet.c
1817
slot = ring->slot + head;
sys/dev/netmap/if_ptnet.c
1858
ptnet_ring_update(pq, kring, head, NAF_FORCE_READ);
sys/dev/netmap/if_ptnet.c
1874
head = ring->head;
sys/dev/netmap/if_ptnet.c
1885
ptnet_ring_update(pq, kring, head, NAF_FORCE_READ);
sys/dev/netmap/if_ptnet.c
1893
head, ring->tail));
sys/dev/netmap/if_ptnet.c
217
unsigned int head);
sys/dev/netmap/if_re_netmap.h
133
kring->nr_hwcur = head;
sys/dev/netmap/if_re_netmap.h
179
u_int const head = kring->rhead;
sys/dev/netmap/if_re_netmap.h
186
if (head > lim)
sys/dev/netmap/if_re_netmap.h
235
if (nm_i != head) {
sys/dev/netmap/if_re_netmap.h
237
while (nm_i != head) {
sys/dev/netmap/if_re_netmap.h
266
kring->nr_hwcur = head;
sys/dev/netmap/if_re_netmap.h
78
u_int const head = kring->rhead;
sys/dev/netmap/if_re_netmap.h
92
if (nm_i != head) { /* we have new packets to send */
sys/dev/netmap/if_re_netmap.h
96
for (n = 0; nm_i != head; n++) {
sys/dev/netmap/if_vtnet_netmap.h
252
u_int const head = kring->rhead;
sys/dev/netmap/if_vtnet_netmap.h
323
if (nm_i != head) {
sys/dev/netmap/if_vtnet_netmap.h
327
released = head - nm_i;
sys/dev/netmap/if_vtnet_netmap.h
336
kring->nr_hwcur = head;
sys/dev/netmap/if_vtnet_netmap.h
66
u_int const head = kring->rhead;
sys/dev/netmap/if_vtnet_netmap.h
80
if (nm_i != head) { /* we have new packets to send */
sys/dev/netmap/if_vtnet_netmap.h
83
for (; nm_i != head; nm_i = nm_next(nm_i, lim)) {
sys/dev/netmap/netmap.c
1199
struct mbuf *head = NULL, *prev = NULL;
sys/dev/netmap/netmap.c
1211
if (head == NULL)
sys/dev/netmap/netmap.c
1212
head = prev;
sys/dev/netmap/netmap.c
1214
if (head)
sys/dev/netmap/netmap.c
1215
nm_os_send_up(dst, NULL, head);
sys/dev/netmap/netmap.c
1233
u_int const head = kring->rhead;
sys/dev/netmap/netmap.c
1237
for (n = kring->nr_hwcur; n != head; n = nm_next(n, lim)) {
sys/dev/netmap/netmap.c
1298
u_int const head = kring->rhead;
sys/dev/netmap/netmap.c
1309
for (; rxcur != head && !nm_ring_empty(rdst);
sys/dev/netmap/netmap.c
1312
u_int dst_head = rdst->head;
sys/dev/netmap/netmap.c
1331
rdst->head = rdst->cur = nm_next(dst_head, dst_lim);
sys/dev/netmap/netmap.c
1350
u_int const head = kring->rhead;
sys/dev/netmap/netmap.c
1359
kring->nr_hwcur = head;
sys/dev/netmap/netmap.c
1360
kring->nr_hwtail = head + lim;
sys/dev/netmap/netmap.c
1385
u_int const head = kring->rhead;
sys/dev/netmap/netmap.c
1422
if (nm_i != head) { /* something was released */
sys/dev/netmap/netmap.c
1430
kring->nr_hwcur = head;
sys/dev/netmap/netmap.c
1689
head, cur, ring->tail, \
sys/dev/netmap/netmap.c
1712
u_int head = NM_ACCESS_ONCE(ring->head);
sys/dev/netmap/netmap.c
1719
ring->head, ring->cur, ring->tail);
sys/dev/netmap/netmap.c
1735
NM_FAIL_ON(head < kring->rhead || head > kring->rtail);
sys/dev/netmap/netmap.c
1737
NM_FAIL_ON(cur < head || cur > kring->rtail);
sys/dev/netmap/netmap.c
1740
NM_FAIL_ON(head > kring->rtail && head < kring->rhead);
sys/dev/netmap/netmap.c
1743
if (head <= kring->rtail) {
sys/dev/netmap/netmap.c
1745
NM_FAIL_ON(cur < head || cur > kring->rtail);
sys/dev/netmap/netmap.c
1748
NM_FAIL_ON(cur > kring->rtail && cur < head);
sys/dev/netmap/netmap.c
1756
kring->rhead = head;
sys/dev/netmap/netmap.c
1758
return head;
sys/dev/netmap/netmap.c
1777
uint32_t head, cur;
sys/dev/netmap/netmap.c
1782
ring->head, ring->cur, ring->tail);
sys/dev/netmap/netmap.c
1791
head = kring->rhead = NM_ACCESS_ONCE(ring->head);
sys/dev/netmap/netmap.c
1798
NM_FAIL_ON(head < kring->nr_hwcur || head > kring->nr_hwtail);
sys/dev/netmap/netmap.c
1800
NM_FAIL_ON(cur < head || cur > kring->nr_hwtail);
sys/dev/netmap/netmap.c
1803
NM_FAIL_ON(head < kring->nr_hwcur && head > kring->nr_hwtail);
sys/dev/netmap/netmap.c
1805
if (head <= kring->nr_hwtail) {
sys/dev/netmap/netmap.c
1807
NM_FAIL_ON(cur < head || cur > kring->nr_hwtail);
sys/dev/netmap/netmap.c
1810
NM_FAIL_ON(cur < head && cur > kring->nr_hwtail);
sys/dev/netmap/netmap.c
1819
return head;
sys/dev/netmap/netmap.c
1845
kring->rhead = ring->head;
sys/dev/netmap/netmap.c
1851
if (ring->head > lim)
sys/dev/netmap/netmap.c
1873
ring->head = kring->rhead = kring->nr_hwcur;
sys/dev/netmap/netmap.c
2213
CSB_WRITE(csb_atok, head, kring->rhead);
sys/dev/netmap/netmap.c
3746
|| kring->rhead != kring->ring->head) {
sys/dev/netmap/netmap.c
3794
if (!send_down && !want_tx && ring->head == kring->nr_hwcur)
sys/dev/netmap/netmap_bdg.c
1101
u_int head = kring->rhead;
sys/dev/netmap/netmap_bdg.c
1104
if (head > lim) {
sys/dev/netmap/netmap_bdg.c
1115
if (nm_i != head) {
sys/dev/netmap/netmap_bdg.c
1117
for (n = 0; likely(nm_i != head); n++) {
sys/dev/netmap/netmap_bdg.c
1128
kring->nr_hwcur = head;
sys/dev/netmap/netmap_generic.c
701
u_int const head = kring->rhead;
sys/dev/netmap/netmap_generic.c
712
if (nm_i != head) { /* we have new packets to send */
sys/dev/netmap/netmap_generic.c
725
event = ring_middle(nm_i, head, lim);
sys/dev/netmap/netmap_generic.c
727
"head=%u,hwtail=%u)", nm_i, event, head,
sys/dev/netmap/netmap_generic.c
733
a.head = a.tail = NULL;
sys/dev/netmap/netmap_generic.c
735
while (nm_i != head) {
sys/dev/netmap/netmap_generic.c
822
if (a.head != NULL) {
sys/dev/netmap/netmap_generic.c
932
u_int const head = kring->rhead;
sys/dev/netmap/netmap_generic.c
943
if (head > lim)
sys/dev/netmap/netmap_generic.c
953
if (nm_i != head) {
sys/dev/netmap/netmap_generic.c
955
for (n = 0; nm_i != head; n++) {
sys/dev/netmap/netmap_generic.c
961
kring->nr_hwcur = head;
sys/dev/netmap/netmap_kern.h
2165
void *head, *tail; /* tailq, if the OS-specific routine needs to build one */
sys/dev/netmap/netmap_kloop.c
1024
kring->name, atok->head, atok->cur, ktoa->hwtail,
sys/dev/netmap/netmap_kloop.c
103
CSB_READ(ptr, head, shadow_ring->head);
sys/dev/netmap/netmap_kloop.c
1092
kring->name, atok->head, atok->cur, ktoa->hwtail,
sys/dev/netmap/netmap_kloop.c
186
batch = shadow_ring.head - kring->nr_hwcur;
sys/dev/netmap/netmap_kloop.c
198
nm_prdis(1, "batch: %d head: %d head_lim: %d", batch, shadow_ring.head,
sys/dev/netmap/netmap_kloop.c
200
shadow_ring.head = head_lim;
sys/dev/netmap/netmap_kloop.c
264
if (shadow_ring.head == kring->rhead) {
sys/dev/netmap/netmap_kloop.c
278
if (shadow_ring.head != kring->rhead) {
sys/dev/netmap/netmap_kloop.c
404
if (sync_kloop_norxslots(kring, shadow_ring.head)) {
sys/dev/netmap/netmap_kloop.c
418
if (!sync_kloop_norxslots(kring, shadow_ring.head)) {
sys/dev/netmap/netmap_mbq.c
100
ret = q->head;
sys/dev/netmap/netmap_mbq.c
101
q->head = ret->m_nextpkt;
sys/dev/netmap/netmap_mbq.c
102
if (q->head == NULL) {
sys/dev/netmap/netmap_mbq.c
50
q->head = q->tail = NULL;
sys/dev/netmap/netmap_mbq.c
75
q->head = q->tail = m;
sys/dev/netmap/netmap_mbq.c
99
if (q->head) {
sys/dev/netmap/netmap_mbq.h
53
struct mbuf *head;
sys/dev/netmap/netmap_mbq.h
71
return q->head;
sys/dev/netmap/netmap_mem2.c
1149
netmap_extra_alloc(struct netmap_adapter *na, uint32_t *head, uint32_t n)
sys/dev/netmap/netmap_mem2.c
1156
*head = 0; /* default, 'null' index ie empty list */
sys/dev/netmap/netmap_mem2.c
1158
uint32_t cur = *head; /* save current head */
sys/dev/netmap/netmap_mem2.c
1159
uint32_t *p = netmap_buf_malloc(nmd, &pos, head);
sys/dev/netmap/netmap_mem2.c
1162
*head = cur; /* restore */
sys/dev/netmap/netmap_mem2.c
1165
nm_prdis(5, "allocate buffer %d -> %d", *head, cur);
sys/dev/netmap/netmap_mem2.c
1175
netmap_extra_free(struct netmap_adapter *na, uint32_t head)
sys/dev/netmap/netmap_mem2.c
1183
for (i = 0; head >=2 && head < p->objtotal; i++) {
sys/dev/netmap/netmap_mem2.c
1184
cur = head;
sys/dev/netmap/netmap_mem2.c
1185
buf = lut[head].vaddr;
sys/dev/netmap/netmap_mem2.c
1186
head = *buf;
sys/dev/netmap/netmap_mem2.c
1191
if (head != 0)
sys/dev/netmap/netmap_mem2.c
1192
nm_prerr("breaking with head %d", head);
sys/dev/netmap/netmap_mem2.c
2030
ring->head = kring->rhead;
sys/dev/netmap/netmap_mem2.c
2036
ring->head, ring->cur, ring->tail);
sys/dev/netmap/netmap_vale.c
1108
u_int const head = kring->rhead;
sys/dev/netmap/netmap_vale.c
1111
done = head; // used all
sys/dev/netmap/netmap_vale.c
1115
done = head;
sys/dev/netmap/netmap_vale.c
1121
done = nm_vale_preflush(kring, head);
sys/dev/netmap/netmap_vale.c
1123
if (done != head)
sys/dev/netmap/netmap_vale.c
1124
nm_prerr("early break at %d/ %d, tail %d", done, head, kring->nr_hwtail);
sys/dev/ntb/ntb_transport.c
1672
unsigned int head = qp->tx_index;
sys/dev/ntb/ntb_transport.c
1675
return (tail >= head ? tail - head : qp->tx_max_entry + tail - head);
sys/dev/nvmf/nvmf_tcp.c
1484
TAILQ_INIT(&qp->rx_buffers.head);
sys/dev/nvmf/nvmf_tcp.c
1485
TAILQ_INIT(&qp->tx_buffers.head);
sys/dev/nvmf/nvmf_tcp.c
1577
TAILQ_FOREACH_SAFE(cb, &qp->rx_buffers.head, link, ncb) {
sys/dev/nvmf/nvmf_tcp.c
1591
TAILQ_FOREACH_SAFE(cb, &qp->tx_buffers.head, link, ncb) {
sys/dev/nvmf/nvmf_tcp.c
1738
TAILQ_INSERT_TAIL(&qp->rx_buffers.head, cb, link);
sys/dev/nvmf/nvmf_tcp.c
223
TAILQ_INSERT_HEAD(&list->head, cb, link);
sys/dev/nvmf/nvmf_tcp.c
233
TAILQ_FOREACH(cb, &list->head, link) {
sys/dev/nvmf/nvmf_tcp.c
245
TAILQ_REMOVE(&list->head, cb, link);
sys/dev/nvmf/nvmf_tcp.c
513
TAILQ_FOREACH(cb, &qp->rx_buffers.head, link) {
sys/dev/nvmf/nvmf_tcp.c
520
TAILQ_REMOVE(&qp->rx_buffers.head, cb, link);
sys/dev/nvmf/nvmf_tcp.c
60
TAILQ_HEAD(, nvmf_tcp_command_buffer) head;
sys/dev/oce/oce_if.h
750
struct mbuf *head;
sys/dev/ocs_fc/ocs_list.h
109
#define ocs_list_init(head, type, link) _ocs_list_init(head, offsetof(type, link))
sys/dev/otus/if_otus.c
1765
struct ar_rx_head *head;
sys/dev/otus/if_otus.c
1779
while (len >= sizeof (*head)) {
sys/dev/otus/if_otus.c
1780
head = (struct ar_rx_head *)buf;
sys/dev/otus/if_otus.c
1781
if (__predict_false(head->tag != htole16(AR_RX_HEAD_TAG))) {
sys/dev/otus/if_otus.c
1783
"tag not valid 0x%x\n", le16toh(head->tag));
sys/dev/otus/if_otus.c
1786
hlen = le16toh(head->len);
sys/dev/otus/if_otus.c
1789
if (__predict_false(sizeof (*head) + hlen > len)) {
sys/dev/otus/if_otus.c
1798
hlen = (sizeof (*head) + hlen + 3) & ~3;
sys/dev/otus/if_otus.c
2236
struct ar_tx_head *head;
sys/dev/otus/if_otus.c
2259
xferlen = sizeof (*head) + m->m_pkthdr.len;
sys/dev/otus/if_otus.c
2349
head = (struct ar_tx_head *)data->buf;
sys/dev/otus/if_otus.c
2350
head->len = htole16(m->m_pkthdr.len + IEEE80211_CRC_LEN);
sys/dev/otus/if_otus.c
2351
head->macctl = htole16(macctl);
sys/dev/otus/if_otus.c
2352
head->phyctl = htole32(phyctl);
sys/dev/otus/if_otus.c
2354
m_copydata(m, 0, m->m_pkthdr.len, (caddr_t)&head[1]);
sys/dev/otus/if_otus.c
2363
__func__, m, data, le16toh(head->len), macctl, phyctl,
sys/dev/qat/include/common/adf_cfg.h
48
void adf_cfg_depot_del_all(struct list_head *head);
sys/dev/qat/include/common/adf_cfg.h
82
void adf_cfg_keyval_del_all(struct list_head *head);
sys/dev/qat/include/common/adf_transport_internal.h
20
uint16_t head;
sys/dev/qat/qat_common/adf_cfg.c
137
struct list_head *head = &sec->param_head;
sys/dev/qat/qat_common/adf_cfg.c
139
list_for_each_prev_safe(list_ptr, tmp, head)
sys/dev/qat/qat_common/adf_cfg.c
161
struct list_head *head = &cfg_depot_list[accel_dev->accel_id].sec_list;
sys/dev/qat/qat_common/adf_cfg.c
165
list_for_each_prev_safe(list, tmp, head)
sys/dev/qat/qat_common/adf_cfg.c
187
adf_cfg_section_del_all(head);
sys/dev/qat/qat_common/adf_cfg.c
227
adf_cfg_keyval_del_all(struct list_head *head)
sys/dev/qat/qat_common/adf_cfg.c
231
list_for_each_prev_safe(list_ptr, tmp, head)
sys/dev/qat/qat_common/adf_cfg.c
241
adf_cfg_section_del_all(struct list_head *head)
sys/dev/qat/qat_common/adf_cfg.c
246
list_for_each_prev_safe(list, tmp, head)
sys/dev/qat/qat_common/adf_cfg.c
416
struct list_head *head = &accel_dev->cfg->sec_list;
sys/dev/qat/qat_common/adf_cfg.c
420
list_for_each_prev_safe(list, tmp, head)
sys/dev/qat/qat_common/adf_cfg.c
80
static void adf_cfg_section_del_all(struct list_head *head);
sys/dev/qat/qat_common/adf_cfg.c
94
adf_cfg_depot_del_all(struct list_head *head)
sys/dev/qat/qat_common/adf_cfg.c
96
adf_cfg_section_del_all(head);
sys/dev/qat/qat_common/adf_cfg_section.c
791
struct list_head *head;
sys/dev/qat/qat_common/adf_cfg_section.c
800
head = &sec->param_head;
sys/dev/qat/qat_common/adf_cfg_section.c
801
list_for_each_prev_safe(list_ptr, tmp, head)
sys/dev/qat/qat_common/adf_freebsd_dev_processes.c
394
struct state_head *head = NULL;
sys/dev/qat/qat_common/adf_freebsd_dev_processes.c
404
head = &proc_events->proc_events->state_head;
sys/dev/qat/qat_common/adf_freebsd_dev_processes.c
412
STAILQ_INSERT_TAIL(head, state, entries_state);
sys/dev/qat/qat_common/adf_freebsd_transport_debug.c
147
int head, tail, empty;
sys/dev/qat/qat_common/adf_freebsd_transport_debug.c
152
head = csr_ops->read_csr_ring_head(csr,
sys/dev/qat/qat_common/adf_freebsd_transport_debug.c
163
head,
sys/dev/qat/qat_common/adf_freebsd_transport_debug.c
34
int head, tail, empty;
sys/dev/qat/qat_common/adf_freebsd_transport_debug.c
36
head = csr_ops->read_csr_ring_head(csr,
sys/dev/qat/qat_common/adf_freebsd_transport_debug.c
54
head,
sys/dev/qat/qat_common/adf_fw_counters.c
19
static void adf_fw_counters_section_del_all(struct list_head *head);
sys/dev/qat/qat_common/adf_fw_counters.c
270
adf_fw_counters_keyval_del_all(struct list_head *head)
sys/dev/qat/qat_common/adf_fw_counters.c
274
list_for_each_prev_safe(list_ptr, tmp, head)
sys/dev/qat/qat_common/adf_fw_counters.c
284
adf_fw_counters_section_del_all(struct list_head *head)
sys/dev/qat/qat_common/adf_fw_counters.c
289
list_for_each_prev_safe(list, tmp, head)
sys/dev/qat/qat_common/adf_transport.c
140
u32 *msg = (u32 *)((uintptr_t)ring->base_addr + ring->head);
sys/dev/qat/qat_common/adf_transport.c
149
ring->head =
sys/dev/qat/qat_common/adf_transport.c
150
adf_modulo(ring->head +
sys/dev/qat/qat_common/adf_transport.c
154
msg = (u32 *)((uintptr_t)ring->base_addr + ring->head);
sys/dev/qat/qat_common/adf_transport.c
160
ring->head);
sys/dev/qat/qat_common/adf_transport.c
435
ring->head = 0;
sys/dev/qat_c2xxx/qat_ae.c
1899
struct mof_uof_hdr *muh, struct mof_uof_chunk_hdr *head,
sys/dev/qat_c2xxx/qat_ae.c
1907
struct mof_uof_chunk_hdr *much = &head[i];
sys/dev/qlnx/qlnxe/bcm_osal.h
156
osal_list_entry_t *head, *tail;
sys/dev/qlnx/qlnxe/bcm_osal.h
236
(list)->head = NULL; \
sys/dev/qlnx/qlnxe/bcm_osal.h
252
((new_list)->tail)->next = ((list)->head); \
sys/dev/qlnx/qlnxe/bcm_osal.h
253
((list)->head)->prev = ((new_list)->tail); \
sys/dev/qlnx/qlnxe/bcm_osal.h
254
(list)->head = (new_list)->head; \
sys/dev/qlnx/qlnxe/bcm_osal.h
262
(entry)->next = (list)->head; \
sys/dev/qlnx/qlnxe/bcm_osal.h
266
(list)->head->prev = (entry); \
sys/dev/qlnx/qlnxe/bcm_osal.h
268
(list)->head = (entry); \
sys/dev/qlnx/qlnxe/bcm_osal.h
279
(list)->head = (entry); \
sys/dev/qlnx/qlnxe/bcm_osal.h
286
(type *)((list)->head)
sys/dev/qlnx/qlnxe/bcm_osal.h
290
if ((list)->head == (entry)) { \
sys/dev/qlnx/qlnxe/bcm_osal.h
291
if ((list)->head) { \
sys/dev/qlnx/qlnxe/bcm_osal.h
292
(list)->head = (list)->head->next; \
sys/dev/qlnx/qlnxe/bcm_osal.h
293
if ((list)->head) { \
sys/dev/qlnx/qlnxe/bcm_osal.h
294
(list)->head->prev = (osal_list_entry_t *)0; \
sys/dev/qlnx/qlnxe/bcm_osal.h
306
(list)->head = (osal_list_entry_t *)0; \
sys/dev/qlnx/qlnxe/ecore_spq.c
858
osal_list_t *head,
sys/dev/qlnx/qlnxe/ecore_spq.c
869
!OSAL_LIST_IS_EMPTY(head)) {
sys/dev/qlnx/qlnxe/ecore_spq.c
871
OSAL_LIST_FIRST_ENTRY(head, struct ecore_spq_entry, list);
sys/dev/qlnx/qlnxe/ecore_spq.c
876
OSAL_LIST_REMOVE_ENTRY(&p_ent->list, head);
sys/dev/qlnx/qlnxr/qlnxr_def.h
459
u16 head, tail;
sys/dev/rtwn/usb/rtwn_usb_attach.c
243
rtwn_datahead *head, struct ieee80211vap *vap)
sys/dev/rtwn/usb/rtwn_usb_attach.c
251
STAILQ_FOREACH_SAFE(dp, head, next, tmp) {
sys/dev/rtwn/usb/rtwn_usb_attach.c
265
STAILQ_REMOVE(head, dp, rtwn_data, next);
sys/dev/smartpqi/smartpqi_structures.h
213
uint32_t head;
sys/dev/smartpqi/smartpqi_structures.h
235
volatile union head_list head OS_ATTRIBUTE_ALIGNED(8);
sys/dev/smartpqi/smartpqi_tag.c
166
stack->head.data = 0;
sys/dev/smartpqi/smartpqi_tag.c
167
DBG_INFO("Stack head address :%p\n",&stack->head);
sys/dev/smartpqi/smartpqi_tag.c
233
cur_head = stack->head;
sys/dev/smartpqi/smartpqi_tag.c
240
}while(!os_atomic64_cas(&stack->head.data,cur_head.data,new_head.data));
sys/dev/smartpqi/smartpqi_tag.c
256
cur_head = stack->head;
sys/dev/smartpqi/smartpqi_tag.c
263
}while(!os_atomic64_cas(&stack->head.data,cur_head.data,new_head.data));
sys/dev/smartpqi/smartpqi_tag.c
69
elem = taglist->elem_array[taglist->head];
sys/dev/smartpqi/smartpqi_tag.c
71
taglist->head = (taglist->head + 1) % taglist->max_elem;
sys/dev/smartpqi/smartpqi_tag.c
94
taglist->head = 0;
sys/dev/sound/midi/midiq.h
40
#define MIDIQ_INIT(head, buf, size) do { \
sys/dev/sound/midi/midiq.h
41
(head).h=(head).t=0; \
sys/dev/sound/midi/midiq.h
42
(head).s=size; \
sys/dev/sound/midi/midiq.h
43
(head).b=buf; \
sys/dev/sound/midi/midiq.h
46
#define MIDIQ_EMPTY(head) ((head).h == (head).t )
sys/dev/sound/midi/midiq.h
48
#define MIDIQ_LENBASE(head) ((head).h - (head).t < 0 ? \
sys/dev/sound/midi/midiq.h
49
(head).h - (head).t + (head).s : \
sys/dev/sound/midi/midiq.h
50
(head).h - (head).t)
sys/dev/sound/midi/midiq.h
52
#define MIDIQ_FULL(head) ((head).h == -1)
sys/dev/sound/midi/midiq.h
53
#define MIDIQ_AVAIL(head) (MIDIQ_FULL(head) ? 0 : (head).s - MIDIQ_LENBASE(head))
sys/dev/sound/midi/midiq.h
54
#define MIDIQ_LEN(head) ((head).s - MIDIQ_AVAIL(head))
sys/dev/sound/midi/midiq.h
58
#define MIDIQ_ENQ(head, buf, size) do { \
sys/dev/sound/midi/midiq.h
59
MIDIQ_MOVE(&(head).b[(head).h], (buf), sizeof(*(head).b) * min((size), (head).s - (head).h)); \
sys/dev/sound/midi/midiq.h
60
if( (head).s - (head).h < (size) ) { \
sys/dev/sound/midi/midiq.h
61
MIDIQ_MOVE((head).b, (buf) + (head).s - (head).h, sizeof(*(head).b) * ((size) - (head).s + (head).h) ); \
sys/dev/sound/midi/midiq.h
63
(head).h+=(size); \
sys/dev/sound/midi/midiq.h
64
(head).h%=(head).s; \
sys/dev/sound/midi/midiq.h
65
if(MIDIQ_EMPTY(head)) (head).h=-1; \
sys/dev/sound/midi/midiq.h
68
#define MIDIQ_DEQ_I(head, buf, size, move, update) do { \
sys/dev/sound/midi/midiq.h
69
if(MIDIQ_FULL(head)) (head).h=(head).t; \
sys/dev/sound/midi/midiq.h
70
if (move) MIDIQ_MOVE((buf), &(head).b[(head).t], sizeof(*(head).b) * min((size), (head).s - (head).t)); \
sys/dev/sound/midi/midiq.h
71
if( (head).s - (head).t < (size) ) { \
sys/dev/sound/midi/midiq.h
72
if (move) MIDIQ_MOVE((buf) + (head).s - (head).t, (head).b, sizeof(*(head).b) * ((size) - (head).s + (head).t) ); \
sys/dev/sound/midi/midiq.h
75
(head).t+=(size); \
sys/dev/sound/midi/midiq.h
76
(head).t%=(head).s; \
sys/dev/sound/midi/midiq.h
78
if (MIDIQ_EMPTY(head)) (head).h=-1; \
sys/dev/sound/midi/midiq.h
82
#define MIDIQ_SIZE(head) ((head).s)
sys/dev/sound/midi/midiq.h
83
#define MIDIQ_CLEAR(head) ((head).h = (head).t = 0)
sys/dev/sound/midi/midiq.h
84
#define MIDIQ_BUF(head) ((head).b)
sys/dev/sound/midi/midiq.h
85
#define MIDIQ_DEQ(head, buf, size) MIDIQ_DEQ_I(head, buf, size, 1, 1)
sys/dev/sound/pcm/channel.h
150
SLIST_HEAD(, pcm_channel) head;
sys/dev/sound/pcm/channel.h
153
SLIST_HEAD(, pcm_channel) head;
sys/dev/sound/pcm/channel.h
180
#define CHN_HEAD(x, y) &(x)->y.head
sys/dev/sound/pcm/sound.h
193
SLIST_HEAD(, pcm_channel) head;
sys/dev/sound/pcm/sound.h
195
SLIST_HEAD(, pcm_channel) head;
sys/dev/sound/pcm/sound.h
198
SLIST_HEAD(, pcm_channel) head;
sys/dev/sound/pcm/sound.h
201
SLIST_HEAD(, pcm_channel) head;
sys/dev/sym/sym_fw2.h
1007
offsetof (struct sym_ccb, phys.head.savep),
sys/dev/sym/sym_fw2.h
1012
offsetof (struct sym_ccb, phys.head.status),
sys/dev/sym/sym_fw2.h
1023
offsetof(struct sym_lcb, head.itl_task_sa),
sys/dev/sym/sym_fw2.h
1028
offsetof(struct sym_ccb, phys.head.go.restart),
sys/dev/sym/sym_fw2.h
318
offsetof (struct sym_ccb, phys.head.savep),
sys/dev/sym/sym_fw2.h
323
offsetof (struct sym_ccb, phys.head.status),
sys/dev/sym/sym_fw2.h
632
offsetof (struct sym_ccb, phys.head.lastp),
sys/dev/sym/sym_fw2.h
657
offsetof (struct sym_ccb, phys.head.status),
sys/dev/sym/sym_fw2.h
667
offsetof (struct sym_ccb, phys.head.status),
sys/dev/sym/sym_fw2.h
743
offsetof (struct sym_ccb, phys.head.savep),
sys/dev/sym/sym_fw2.h
752
offsetof (struct sym_ccb, phys.head.savep),
sys/dev/sym/sym_fw2.h
780
offsetof (struct sym_ccb, phys.head.status),
sys/dev/sym/sym_fw2.h
797
offsetof (struct sym_ccb, phys.head.savep),
sys/dev/sym/sym_fw2.h
882
offsetof(struct sym_tcb, head.wval),
sys/dev/sym/sym_fw2.h
884
offsetof(struct sym_tcb, head.sval),
sys/dev/sym/sym_fw2.h
891
offsetof(struct sym_tcb, head.uval),
sys/dev/sym/sym_fw2.h
914
offsetof(struct sym_tcb, head.luntbl_sa),
sys/dev/sym/sym_fw2.h
930
offsetof(struct sym_tcb, head.lun0_sa),
sys/dev/sym/sym_fw2.h
935
offsetof(struct sym_lcb, head.resel_sa),
sys/dev/sym/sym_fw2.h
958
offsetof(struct sym_lcb, head.itlq_tbl_sa),
sys/dev/sym/sym_fw2.h
991
offsetof(struct sym_ccb, phys.head.go.restart),
sys/dev/sym/sym_hipd.c
1086
/*0*/ struct sym_tcbh head;
sys/dev/sym/sym_hipd.c
1143
offsetof(struct sym_tcb, head.sval)) &3) == 0);
sys/dev/sym/sym_hipd.c
1145
offsetof(struct sym_tcb, head.wval)) &3) == 0);
sys/dev/sym/sym_hipd.c
1185
/*0*/ struct sym_lcbh head;
sys/dev/sym/sym_hipd.c
1277
#define actualquirks phys.head.status[0]
sys/dev/sym/sym_hipd.c
1278
#define host_status phys.head.status[1]
sys/dev/sym/sym_hipd.c
1279
#define ssss_status phys.head.status[2]
sys/dev/sym/sym_hipd.c
1280
#define host_flags phys.head.status[3]
sys/dev/sym/sym_hipd.c
1340
/*0*/ struct sym_ccbh head;
sys/dev/sym/sym_hipd.c
166
static __inline int sym_que_empty(struct sym_quehead *head)
sys/dev/sym/sym_hipd.c
168
return head->flink == head;
sys/dev/sym/sym_hipd.c
172
struct sym_quehead *head)
sys/dev/sym/sym_hipd.c
178
struct sym_quehead *at = head->flink;
sys/dev/sym/sym_hipd.c
180
first->blink = head;
sys/dev/sym/sym_hipd.c
181
head->flink = first;
sys/dev/sym/sym_hipd.c
195
#define sym_insque_head(new, head) __sym_que_add(new, head, (head)->flink)
sys/dev/sym/sym_hipd.c
197
static __inline struct sym_quehead *sym_remque_head(struct sym_quehead *head)
sys/dev/sym/sym_hipd.c
199
struct sym_quehead *elem = head->flink;
sys/dev/sym/sym_hipd.c
201
if (elem != head)
sys/dev/sym/sym_hipd.c
202
__sym_que_del(head, elem->flink);
sys/dev/sym/sym_hipd.c
208
#define sym_insque_tail(new, head) __sym_que_add(new, (head)->blink, head)
sys/dev/sym/sym_hipd.c
213
#define FOR_EACH_QUEUED_ELEMENT(head, qp) \
sys/dev/sym/sym_hipd.c
214
for (qp = (head)->flink; qp != (head); qp = qp->flink)
sys/dev/sym/sym_hipd.c
3268
tp->head.sval = 0;
sys/dev/sym/sym_hipd.c
3269
tp->head.wval = np->rv_scntl3;
sys/dev/sym/sym_hipd.c
3270
tp->head.uval = 0;
sys/dev/sym/sym_hipd.c
3547
sval = tp->head.sval;
sys/dev/sym/sym_hipd.c
3548
wval = tp->head.wval;
sys/dev/sym/sym_hipd.c
3549
uval = tp->head.uval;
sys/dev/sym/sym_hipd.c
3602
if (tp->head.sval == sval &&
sys/dev/sym/sym_hipd.c
3603
tp->head.wval == wval &&
sys/dev/sym/sym_hipd.c
3604
tp->head.uval == uval)
sys/dev/sym/sym_hipd.c
3606
tp->head.sval = sval;
sys/dev/sym/sym_hipd.c
3607
tp->head.wval = wval;
sys/dev/sym/sym_hipd.c
3608
tp->head.uval = uval;
sys/dev/sym/sym_hipd.c
3620
OUTB (nc_sxfer, tp->head.sval);
sys/dev/sym/sym_hipd.c
3621
OUTB (nc_scntl3, tp->head.wval);
sys/dev/sym/sym_hipd.c
3624
OUTB (nc_scntl4, tp->head.uval);
sys/dev/sym/sym_hipd.c
3634
cp->phys.select.sel_scntl3 = tp->head.wval;
sys/dev/sym/sym_hipd.c
3635
cp->phys.select.sel_sxfer = tp->head.sval;
sys/dev/sym/sym_hipd.c
3637
cp->phys.select.sel_scntl4 = tp->head.uval;
sys/dev/sym/sym_hipd.c
4770
cp->phys.head.savep = cpu_to_scr(startp);
sys/dev/sym/sym_hipd.c
4771
cp->phys.head.goalp = cpu_to_scr(startp + 16);
sys/dev/sym/sym_hipd.c
4772
cp->phys.head.lastp = cpu_to_scr(startp);
sys/dev/sym/sym_hipd.c
4782
cp->phys.head.go.start = cpu_to_scr(SCRIPTA_BA (np, select));
sys/dev/sym/sym_hipd.c
4955
np->abrt_sel.sel_scntl3 = tp->head.wval;
sys/dev/sym/sym_hipd.c
4956
np->abrt_sel.sel_sxfer = tp->head.sval;
sys/dev/sym/sym_hipd.c
5163
tp->head.sval = 0;
sys/dev/sym/sym_hipd.c
5164
tp->head.wval = np->rv_scntl3;
sys/dev/sym/sym_hipd.c
5165
tp->head.uval = 0;
sys/dev/sym/sym_hipd.c
5282
tmp = scr_to_cpu(cp->phys.head.goalp);
sys/dev/sym/sym_hipd.c
5388
dp_ret = cpu_to_scr(cp->phys.head.goalp);
sys/dev/sym/sym_hipd.c
5482
if (cp->phys.head.lastp == cp->phys.head.goalp)
sys/dev/sym/sym_hipd.c
5489
if (cp->startp == cp->phys.head.lastp ||
sys/dev/sym/sym_hipd.c
5490
sym_evaluate_dp(np, cp, scr_to_cpu(cp->phys.head.lastp),
sys/dev/sym/sym_hipd.c
6314
lp->head.resel_sa =
sys/dev/sym/sym_hipd.c
6334
lp->head.itl_task_sa = cpu_to_scr(cp->ccb_ba);
sys/dev/sym/sym_hipd.c
6335
lp->head.resel_sa =
sys/dev/sym/sym_hipd.c
6402
lp->head.itl_task_sa = cpu_to_scr(np->bad_itl_ba);
sys/dev/sym/sym_hipd.c
6409
lp->head.resel_sa =
sys/dev/sym/sym_hipd.c
6514
cp->phys.head.go.start = cpu_to_scr(SCRIPTA_BA (np, idle));
sys/dev/sym/sym_hipd.c
6515
cp->phys.head.go.restart = cpu_to_scr(SCRIPTB_BA (np, bad_i_t_l));
sys/dev/sym/sym_hipd.c
6584
tp->head.luntbl_sa = cpu_to_scr(vtobus(tp->luntbl));
sys/dev/sym/sym_hipd.c
6610
tp->head.lun0_sa = cpu_to_scr(vtobus(lp));
sys/dev/sym/sym_hipd.c
6616
lp->head.itl_task_sa = cpu_to_scr(np->bad_itl_ba);
sys/dev/sym/sym_hipd.c
6621
lp->head.resel_sa = cpu_to_scr(SCRIPTB_BA (np, resel_bad_lun));
sys/dev/sym/sym_hipd.c
6677
lp->head.itlq_tbl_sa = cpu_to_scr(vtobus(lp->itlq_tbl));
sys/dev/sym/sym_hipd.c
7265
if (cp->phys.head.lastp != cp->phys.head.goalp)
sys/dev/sym/sym_hipd.c
7553
cp->phys.head.go.start = cpu_to_scr(SCRIPTA_BA (np, select));
sys/dev/sym/sym_hipd.c
7554
cp->phys.head.go.restart = cpu_to_scr(SCRIPTA_BA (np, resel_dsa));
sys/dev/sym/sym_hipd.c
7560
cp->phys.select.sel_scntl3 = tp->head.wval;
sys/dev/sym/sym_hipd.c
7561
cp->phys.select.sel_sxfer = tp->head.sval;
sys/dev/sym/sym_hipd.c
7562
cp->phys.select.sel_scntl4 = tp->head.uval;
sys/dev/sym/sym_hipd.c
7692
cp->phys.head.lastp = cpu_to_scr(lastp);
sys/dev/sym/sym_hipd.c
7693
cp->phys.head.goalp = cpu_to_scr(goalp);
sys/dev/sym/sym_hipd.c
7694
cp->phys.head.savep = cpu_to_scr(lastp);
sys/dev/sym/sym_hipd.c
7695
cp->startp = cp->phys.head.savep;
sys/dev/sym/sym_hipd.c
8110
tp->head.sval = 0;
sys/dev/sym/sym_hipd.c
8111
tp->head.wval = np->rv_scntl3;
sys/dev/sym/sym_hipd.c
8112
tp->head.uval = 0;
sys/dev/sym/sym_hipd.c
8704
np->target[i].head.luntbl_sa =
sys/dev/sym/sym_hipd.c
8706
np->target[i].head.lun0_sa =
sys/dev/syscons/sctermvar.h
138
sc_term_up(scr_stat *scp, int n, int head)
sys/dev/syscons/sctermvar.h
142
n = imin(n, scp->ypos - head);
sys/dev/syscons/sctermvar.h
178
sc_term_up_scroll(scr_stat *scp, int n, int ch, int attr, int head, int tail)
sys/dev/syscons/sctermvar.h
184
if (n <= scp->ypos - head) {
sys/dev/syscons/sctermvar.h
187
sc_term_ins_line(scp, head, n - (scp->ypos - head),
sys/dev/syscons/sctermvar.h
189
sc_move_cursor(scp, scp->xpos, head);
sys/dev/syscons/sctermvar.h
194
sc_term_down_scroll(scr_stat *scp, int n, int ch, int attr, int head, int tail)
sys/dev/syscons/sctermvar.h
203
sc_term_del_line(scp, head, n - (tail - scp->ypos) + 1,
sys/dev/syscons/sctermvar.h
44
static __inline void sc_term_up(scr_stat *scp, int n, int head);
sys/dev/syscons/sctermvar.h
49
int attr, int head, int tail);
sys/dev/syscons/sctermvar.h
51
int attr, int head, int tail);
sys/dev/syscons/syscons.c
1990
u_int head;
sys/dev/syscons/syscons.c
2003
head = atomic_fetchadd_int(&sc_cnputc_loghead, 1);
sys/dev/syscons/syscons.c
2004
sc_cnputc_log[head % sizeof(sc_cnputc_log)] = c;
sys/dev/tws/tws.c
640
sc->aen_q.head=0;
sys/dev/tws/tws.c
652
sc->trace_q.head=0;
sys/dev/tws/tws.h
174
volatile int16_t head;
sys/dev/tws/tws_services.c
106
if ( head == tail ) {
sys/dev/tws/tws_services.c
108
sc->trace_q.head = (head+1) % sc->trace_q.depth;
sys/dev/tws/tws_services.c
89
volatile u_int16_t head, tail;
sys/dev/tws/tws_services.c
92
head = sc->trace_q.head;
sys/dev/tws/tws_user.c
226
if ( sc->aen_q.head == sc->aen_q.tail ) {
sys/dev/tws/tws_user.c
246
index = sc->aen_q.head;
sys/dev/tws/tws_user.c
254
index = sc->aen_q.head;
sys/dev/tws/tws_user.c
268
index = sc->aen_q.head;
sys/dev/tws/tws_user.c
375
volatile u_int16_t head, tail;
sys/dev/tws/tws_user.c
379
head = cq->head;
sys/dev/tws/tws_user.c
386
if ( head == tail ) { /* q is full */
sys/dev/tws/tws_user.c
389
cq->head = (head+1) % cq->depth;
sys/dev/usb/controller/atmegadci.c
618
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/avr32dci.c
606
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/dwc_otg.c
2490
TAILQ_HEAD(, usb_xfer) head;
sys/dev/usb/controller/dwc_otg.c
2504
TAILQ_INIT(&head);
sys/dev/usb/controller/dwc_otg.c
2510
TAILQ_FOREACH_SAFE(xfer, &sc->sc_bus.intr_q.head, wait_entry, xfer_next) {
sys/dev/usb/controller/dwc_otg.c
2537
TAILQ_REMOVE(&sc->sc_bus.intr_q.head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2538
TAILQ_INSERT_TAIL(&head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2541
TAILQ_FOREACH_SAFE(xfer, &sc->sc_bus.intr_q.head, wait_entry, xfer_next) {
sys/dev/usb/controller/dwc_otg.c
2558
TAILQ_REMOVE(&sc->sc_bus.intr_q.head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2559
TAILQ_INSERT_TAIL(&head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2562
TAILQ_FOREACH_SAFE(xfer, &sc->sc_bus.intr_q.head, wait_entry, xfer_next) {
sys/dev/usb/controller/dwc_otg.c
2585
TAILQ_REMOVE(&sc->sc_bus.intr_q.head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2586
TAILQ_INSERT_TAIL(&head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2589
TAILQ_FOREACH_SAFE(xfer, &sc->sc_bus.intr_q.head, wait_entry, xfer_next) {
sys/dev/usb/controller/dwc_otg.c
2604
TAILQ_REMOVE(&sc->sc_bus.intr_q.head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2605
TAILQ_INSERT_TAIL(&head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2609
TAILQ_FOREACH_SAFE(xfer, &sc->sc_bus.intr_q.head, wait_entry, xfer_next) {
sys/dev/usb/controller/dwc_otg.c
2624
TAILQ_REMOVE(&sc->sc_bus.intr_q.head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2625
TAILQ_INSERT_TAIL(&head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2630
TAILQ_CONCAT(&sc->sc_bus.intr_q.head, &head, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2633
TAILQ_FOREACH_SAFE(xfer, &sc->sc_bus.intr_q.head, wait_entry, xfer_next) {
sys/dev/usb/controller/dwc_otg.c
2637
TAILQ_REMOVE(&sc->sc_bus.intr_q.head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2638
TAILQ_INSERT_TAIL(&head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2640
TAILQ_CONCAT(&head, &sc->sc_bus.intr_q.head, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2641
TAILQ_CONCAT(&sc->sc_bus.intr_q.head, &head, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2644
TAILQ_FOREACH_SAFE(xfer, &sc->sc_bus.intr_q.head, wait_entry, xfer_next) {
sys/dev/usb/controller/dwc_otg.c
2648
TAILQ_REMOVE(&sc->sc_bus.intr_q.head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2649
TAILQ_INSERT_TAIL(&head, xfer, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2651
TAILQ_CONCAT(&sc->sc_bus.intr_q.head, &head, wait_entry);
sys/dev/usb/controller/dwc_otg.c
2790
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry)
sys/dev/usb/controller/dwc_otg.c
2810
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/ehci.c
1409
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/ehci.c
3711
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/ehci.c
3743
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/musb_otg.c
2174
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/ohci.c
1086
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/ohci.c
2563
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/ohci.c
2599
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/uhci.c
1392
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/uhci.c
3022
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/uhci.c
3062
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/usb_controller.c
959
TAILQ_INIT(&bus->intr_q.head);
sys/dev/usb/controller/uss820dci.c
712
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry)
sys/dev/usb/controller/uss820dci.c
721
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/xhci.c
3138
xfer = TAILQ_FIRST(&ep->endpoint_q[stream_id].head);
sys/dev/usb/controller/xhci.c
4005
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/controller/xhci.c
4065
TAILQ_FOREACH(xfer, &sc->sc_bus.intr_q.head, wait_entry) {
sys/dev/usb/usb_debug.c
180
TAILQ_FOREACH(xfer, &ep->endpoint_q[x].head, wait_entry)
sys/dev/usb/usb_device.c
518
TAILQ_INIT(&ep->endpoint_q[x].head);
sys/dev/usb/usb_hub.c
2100
TAILQ_FOREACH(xfer, &bus->intr_q.head, wait_entry) {
sys/dev/usb/usb_hub.c
2139
TAILQ_FOREACH(pipe_xfer, &xfer->endpoint->endpoint_q[0].head,
sys/dev/usb/usb_transfer.c
1089
TAILQ_INIT(&info->done_q.head);
sys/dev/usb/usb_transfer.c
1092
TAILQ_INIT(&info->dma_q.head);
sys/dev/usb/usb_transfer.c
2554
TAILQ_REMOVE(&pq->head, xfer, wait_entry);
sys/dev/usb/usb_transfer.c
2576
TAILQ_INSERT_TAIL(&pq->head, xfer, wait_entry);
sys/dev/usb/usb_transfer.c
3127
TAILQ_FIRST(&ep->endpoint_q[xfer->stream_id].head) != NULL) {
sys/dev/usb/usb_transfer.c
3177
xfer = TAILQ_FIRST(&pq->head);
sys/dev/usb/usb_transfer.c
3179
TAILQ_REMOVE(&pq->head, xfer,
sys/dev/usb/usbdi.h
126
TAILQ_HEAD(, usb_xfer) head;
sys/dev/usb/wlan/if_upgtvar.h
153
uint16_t head;
sys/dev/vkbd/vkbd.c
103
int head; /* index of the first code */
sys/dev/vkbd/vkbd.c
1248
state->ks_inq.head = state->ks_inq.tail = state->ks_inq.cc = 0;
sys/dev/vkbd/vkbd.c
276
state->ks_inq.head = state->ks_inq.tail = state->ks_inq.cc = 0;
sys/dev/vkbd/vkbd.c
384
if (q->head == q->tail) {
sys/dev/vkbd/vkbd.c
386
avail = nitems(q->q) - q->head;
sys/dev/vkbd/vkbd.c
389
} else if (q->head < q->tail)
sys/dev/vkbd/vkbd.c
392
avail = q->head - q->tail;
sys/dev/vkbd/vkbd.c
529
c = q->q[q->head ++];
sys/dev/vkbd/vkbd.c
530
if (q->head == nitems(q->q))
sys/dev/vkbd/vkbd.c
531
q->head = 0;
sys/dev/vkbd/vkbd.c
631
state->ks_inq.head = state->ks_inq.tail = state->ks_inq.cc = 0;
sys/dev/vmm/vmm_dev.c
1037
SLIST_INSERT_HEAD(&head, sc, link);
sys/dev/vmm/vmm_dev.c
1229
if (!SLIST_EMPTY(&head)) {
sys/dev/vmm/vmm_dev.c
185
SLIST_FOREACH(sc, &head, link) {
sys/dev/vmm/vmm_dev.c
890
SLIST_REMOVE(&head, sc, vmmdev_softc, link);
sys/dev/vmm/vmm_dev.c
94
static SLIST_HEAD(, vmmdev_softc) head;
sys/dev/vmware/vmci/vmci_defs.h
657
uint64_t head;
sys/dev/vmware/vmci/vmci_defs.h
661
head = vmci_queue_header_consumer_head(consume_q_header);
sys/dev/vmware/vmci/vmci_defs.h
663
if (tail >= produce_q_size || head >= produce_q_size)
sys/dev/vmware/vmci/vmci_defs.h
671
if (tail >= head)
sys/dev/vmware/vmci/vmci_defs.h
672
free_space = produce_q_size - (tail - head) - 1;
sys/dev/vmware/vmci/vmci_defs.h
674
free_space = head - tail - 1;
sys/dev/vmware/vmci/vmci_qpair.c
579
uint64_t head;
sys/dev/vmware/vmci/vmci_qpair.c
591
head = vmci_queue_header_consumer_head(produce_q->q_header);
sys/dev/vmware/vmci/vmci_qpair.c
592
if (LIKELY(head + read < consume_q_size))
sys/dev/vmware/vmci/vmci_qpair.c
593
result = memcpy_from_queue(buf, 0, consume_q, head, read,
sys/dev/vmware/vmci/vmci_qpair.c
598
const size_t tmp = (size_t)(consume_q_size - head);
sys/dev/vmware/vmci/vmci_qpair.c
600
result = memcpy_from_queue(buf, 0, consume_q, head, tmp,
sys/dev/vmware/vmci/vmci_queue_pair.c
154
vmci_list_init(&qp_list->head);
sys/dev/vmware/vmci/vmci_queue_pair.c
181
vmci_list_init(&qp_list->head);
sys/dev/vmware/vmci/vmci_queue_pair.c
210
vmci_list_scan(next, &qp_list->head, list_item) {
sys/dev/vmware/vmci/vmci_queue_pair.c
240
vmci_list_insert(&qp_list->head, entry, list_item);
sys/dev/vmware/vmci/vmci_queue_pair.c
289
return (vmci_list_first(&qp_list->head));
sys/dev/vmware/vmci/vmci_queue_pair.c
39
vmci_list(queue_pair_entry) head;
sys/dev/vnic/nicvf_queues.c
1075
sq->head = sq->tail = 0;
sys/dev/vnic/nicvf_queues.c
1244
rbdr->head =
sys/dev/vnic/nicvf_queues.c
1679
sq->head += desc_cnt;
sys/dev/vnic/nicvf_queues.c
1680
sq->head &= (sq->dmem.q_len - 1);
sys/dev/vnic/nicvf_queues.c
1716
uint64_t head;
sys/dev/vnic/nicvf_queues.c
1721
head = nicvf_queue_reg_read(nic, NIC_QSET_SQ_0_7_HEAD, qidx) >> 4;
sys/dev/vnic/nicvf_queues.c
1722
while (sq->head != head) {
sys/dev/vnic/nicvf_queues.c
1723
hdr = (struct sq_hdr_subdesc *)GET_SQ_DESC(sq, sq->head);
sys/dev/vnic/nicvf_queues.c
1728
snd_buff = &sq->snd_buff[sq->head];
sys/dev/vnic/nicvf_queues.c
1732
sq->snd_buff[sq->head].mbuf = NULL;
sys/dev/vnic/nicvf_queues.c
436
int head, tail, idx;
sys/dev/vnic/nicvf_queues.c
474
head = rbdr->head;
sys/dev/vnic/nicvf_queues.c
476
while (head != tail) {
sys/dev/vnic/nicvf_queues.c
477
desc = GET_RBDR_DESC(rbdr, head);
sys/dev/vnic/nicvf_queues.c
484
head++;
sys/dev/vnic/nicvf_queues.c
485
head &= (rbdr->dmem.q_len - 1);
sys/dev/vnic/nicvf_queues.c
513
rbdr->head = 0;
sys/dev/vnic/nicvf_queues.h
251
uint32_t head;
sys/dev/vnic/nicvf_queues.h
316
uint32_t head;
sys/dev/wpi/if_wpi.c
1912
struct wpi_rx_head *head;
sys/dev/wpi/if_wpi.c
1930
head = (struct wpi_rx_head *)((caddr_t)(stat + 1) + stat->len);
sys/dev/wpi/if_wpi.c
1931
len = le16toh(head->len);
sys/dev/wpi/if_wpi.c
1932
tail = (struct wpi_rx_tail *)((caddr_t)(head + 1) + len);
sys/dev/wpi/if_wpi.c
1938
head->plcp, head->chan, (uintmax_t)le64toh(tail->tstamp));
sys/dev/wpi/if_wpi.c
1990
m->m_data = (caddr_t)(head + 1);
sys/dev/wpi/if_wpi.c
2018
if (head->flags & htole16(WPI_STAT_FLAG_SHPREAMBLE))
sys/dev/wpi/if_wpi.c
2023
tap->wr_antenna = (le16toh(head->flags) >> 4) & 0xf;
sys/dev/wpi/if_wpi.c
2024
tap->wr_rate = plcp2rate(head->plcp);
sys/dev/xen/grant_table/grant_table.c
211
grant_ref_t head;
sys/dev/xen/grant_table/grant_table.c
214
head = GNTTAB_LIST_END;
sys/dev/xen/grant_table/grant_table.c
219
gnttab_entry(*refs) = head;
sys/dev/xen/grant_table/grant_table.c
220
head = *refs;
sys/dev/xen/grant_table/grant_table.c
237
gnttab_free_head = head;
sys/dev/xen/grant_table/grant_table.c
320
gnttab_free_grant_references(grant_ref_t head)
sys/dev/xen/grant_table/grant_table.c
325
if (head == GNTTAB_LIST_END)
sys/dev/xen/grant_table/grant_table.c
328
ref = head;
sys/dev/xen/grant_table/grant_table.c
335
gnttab_free_head = head;
sys/dev/xen/grant_table/grant_table.c
342
gnttab_alloc_grant_references(uint16_t count, grant_ref_t *head)
sys/dev/xen/grant_table/grant_table.c
350
*head = ref;
sys/dev/xen/grant_table/grant_table.c
69
grant_ref_t head;
sys/dev/xen/grant_table/grant_table.c
77
ref = head = gnttab_free_head;
sys/dev/xen/grant_table/grant_table.c
80
head = gnttab_entry(head);
sys/dev/xen/grant_table/grant_table.c
81
gnttab_free_head = gnttab_entry(head);
sys/dev/xen/grant_table/grant_table.c
82
gnttab_entry(head) = GNTTAB_LIST_END;
sys/fs/cuse/cuse.c
1125
while ((pccmd = TAILQ_FIRST(&pcs->head)) == NULL) {
sys/fs/cuse/cuse.c
1137
TAILQ_REMOVE(&pcs->head, pccmd, entry);
sys/fs/cuse/cuse.c
141
TAILQ_HEAD(, cuse_client_command) head;
sys/fs/cuse/cuse.c
560
TAILQ_REMOVE(&pcc->server->head, pccmd, entry);
sys/fs/cuse/cuse.c
595
TAILQ_INSERT_TAIL(&pcs->head, pccmd, entry);
sys/fs/cuse/cuse.c
614
TAILQ_INSERT_TAIL(&pcs->head, pccmd, entry);
sys/fs/cuse/cuse.c
797
TAILQ_INIT(&pcs->head);
sys/fs/nfs/nfs.h
779
#define LIST_PREPEND(head, phead, lelm, field) do { \
sys/fs/nfs/nfs.h
780
if ((head)->lh_first != NULL) { \
sys/fs/nfs/nfs.h
781
(lelm)->field.le_next = (head)->lh_first; \
sys/fs/nfs/nfs.h
785
(head)->lh_first = (phead)->lh_first; \
sys/fs/nfs/nfs.h
786
(head)->lh_first->field.le_prev = &(head)->lh_first; \
sys/fs/nfs/nfs_commonsubs.c
4881
SLIST_HEAD(, list) head;
sys/fs/nfs/nfs_commonsubs.c
4927
SLIST_INIT(&head);
sys/fs/nfs/nfs_commonsubs.c
4973
SLIST_INSERT_HEAD(&head, lsp, next);
sys/fs/nfs/nfs_commonsubs.c
4994
SLIST_FOREACH_SAFE(lsp, &head, next, nlsp) {
sys/fs/tmpfs/tmpfs_subr.c
1498
struct tmpfs_dir *head;
sys/fs/tmpfs/tmpfs_subr.c
1505
head = &dnode->tn_dir.tn_dirhead;
sys/fs/tmpfs/tmpfs_subr.c
1520
RB_REMOVE(tmpfs_dir, head, xde);
sys/fs/tmpfs/tmpfs_subr.c
1528
RB_REMOVE(tmpfs_dir, head, de);
sys/geom/geom_flashmap.c
129
struct g_flashmap_head head;
sys/geom/geom_flashmap.c
148
STAILQ_INIT(&head);
sys/geom/geom_flashmap.c
163
if (g_flashmap_load(dev, pp, slicer, &head) == 0)
sys/geom/geom_flashmap.c
167
cp->provider->sectorsize, &head);
sys/geom/geom_flashmap.c
172
STAILQ_FOREACH_SAFE(slice, &head, sl_link, slice_temp)
sys/geom/geom_flashmap.c
184
struct g_flashmap_head *head)
sys/geom/geom_flashmap.c
201
STAILQ_INSERT_TAIL(head, slice, sl_link);
sys/geom/geom_flashmap.c
66
flash_slicer_t slicer, struct g_flashmap_head *head);
sys/geom/journal/g_journal.c
1003
GJ_DEBUG(3, "INSERT(%p): 8 (nbp=%p pbp=%p)", *head, nbp, pbp);
sys/geom/journal/g_journal.c
1006
GJQ_FOREACH(*head, cbp) {
sys/geom/journal/g_journal.c
1012
GJ_DEBUG(3, "INSERT(%p): DONE %d", *head, n);
sys/geom/journal/g_journal.c
1024
g_journal_optimize(struct bio *head)
sys/geom/journal/g_journal.c
1031
GJQ_FOREACH(head, cbp) {
sys/geom/journal/g_journal.c
1483
g_journal_read_find(struct bio *head, int sorted, struct bio *pbp, off_t ostart,
sys/geom/journal/g_journal.c
1489
GJQ_FOREACH(head, bp) {
sys/geom/journal/g_journal.c
1506
GJ_DEBUG(3, "READ(%p): (%jd, %jd) (bp=%p)", head, cstart, cend,
sys/geom/journal/g_journal.c
1537
struct bio *bp, *nbp, *head;
sys/geom/journal/g_journal.c
1545
head = NULL;
sys/geom/journal/g_journal.c
1549
head = sc->sc_current_queue;
sys/geom/journal/g_journal.c
1555
head = sc->sc_active.jj_queue;
sys/geom/journal/g_journal.c
1562
head = sc->sc_inactive.jj_queue;
sys/geom/journal/g_journal.c
1566
head = sc->sc_copy_queue;
sys/geom/journal/g_journal.c
1572
bp = g_journal_read_find(head, sorted, pbp, ostart, oend);
sys/geom/journal/g_journal.c
795
#define g_journal_insert_bio(head, bp, flags) \
sys/geom/journal/g_journal.c
796
g_journal_insert((head), (bp)->bio_offset, \
sys/geom/journal/g_journal.c
807
g_journal_insert(struct bio **head, off_t nstart, off_t nend, off_t joffset,
sys/geom/journal/g_journal.c
815
GJ_DEBUG(3, "INSERT(%p): (%jd, %jd, %jd)", *head, nstart, nend,
sys/geom/journal/g_journal.c
819
GJQ_FOREACH(*head, cbp) {
sys/geom/journal/g_journal.c
834
GJ_DEBUG(3, "INSERT(%p): 1", *head);
sys/geom/journal/g_journal.c
849
*head = nbp;
sys/geom/journal/g_journal.c
854
GJ_DEBUG(3, "INSERT(%p): 2 (nbp=%p pbp=%p)", *head, nbp,
sys/geom/journal/g_journal.c
896
GJ_DEBUG(3, "INSERT(%p): 3 (cbp=%p)", *head, cbp);
sys/geom/journal/g_journal.c
923
GJ_DEBUG(3, "INSERT(%p): 4 (cbp=%p)", *head, cbp);
sys/geom/journal/g_journal.c
954
GJ_DEBUG(3, "INSERT(%p): 5 (cbp=%p)", *head, cbp);
sys/geom/journal/g_journal.c
971
*head = nbp;
sys/geom/journal/g_journal.c
989
GJ_DEBUG(3, "INSERT(%p): 6 (cbp=%p)", *head, cbp);
sys/geom/journal/g_journal.c
998
*head = nbp;
sys/geom/journal/g_journal.h
155
#define GJQ_INSERT_HEAD(head, bp) do { \
sys/geom/journal/g_journal.h
156
(bp)->bio_next = (head); \
sys/geom/journal/g_journal.h
157
(head) = (bp); \
sys/geom/journal/g_journal.h
159
#define GJQ_INSERT_AFTER(head, bp, pbp) do { \
sys/geom/journal/g_journal.h
161
GJQ_INSERT_HEAD(head, bp); \
sys/geom/journal/g_journal.h
167
#define GJQ_LAST(head, bp) do { \
sys/geom/journal/g_journal.h
170
if ((head) == NULL) { \
sys/geom/journal/g_journal.h
171
(bp) = (head); \
sys/geom/journal/g_journal.h
174
for (_bp = (head); _bp->bio_next != NULL; _bp = _bp->bio_next) \
sys/geom/journal/g_journal.h
178
#define GJQ_FIRST(head) (head)
sys/geom/journal/g_journal.h
179
#define GJQ_REMOVE(head, bp) do { \
sys/geom/journal/g_journal.h
182
if ((head) == (bp)) { \
sys/geom/journal/g_journal.h
183
(head) = (bp)->bio_next; \
sys/geom/journal/g_journal.h
187
for (_bp = (head); _bp->bio_next != NULL; _bp = _bp->bio_next) {\
sys/geom/journal/g_journal.h
196
#define GJQ_FOREACH(head, bp) \
sys/geom/journal/g_journal.h
197
for ((bp) = (head); (bp) != NULL; (bp) = (bp)->bio_next)
sys/i386/i386/pmap.c
905
pmap_ptelist_alloc(vm_offset_t *head)
sys/i386/i386/pmap.c
910
va = *head;
sys/i386/i386/pmap.c
914
*head = *pte;
sys/i386/i386/pmap.c
915
if (*head & PG_V)
sys/i386/i386/pmap.c
922
pmap_ptelist_free(vm_offset_t *head, vm_offset_t va)
sys/i386/i386/pmap.c
929
*pte = *head; /* virtual! PG_V is 0 though */
sys/i386/i386/pmap.c
930
*head = va;
sys/i386/i386/pmap.c
934
pmap_ptelist_init(vm_offset_t *head, void *base, int npages)
sys/i386/i386/pmap.c
939
*head = 0;
sys/i386/i386/pmap.c
942
pmap_ptelist_free(head, va);
sys/i386/linux/linux_proto.h
1088
char head_l_[PADL_(struct linux_robust_list_head *)]; struct linux_robust_list_head * head; char head_r_[PADR_(struct linux_robust_list_head *)];
sys/i386/linux/linux_proto.h
1093
char head_l_[PADL_(struct linux_robust_list_head **)]; struct linux_robust_list_head ** head; char head_r_[PADR_(struct linux_robust_list_head **)];
sys/i386/linux/linux_systrace_args.c
2251
uarg[a++] = (intptr_t)p->head; /* struct linux_robust_list_head * */
sys/i386/linux/linux_systrace_args.c
2260
uarg[a++] = (intptr_t)p->head; /* struct linux_robust_list_head ** */
sys/kern/kern_conf.c
1309
LIST_HEAD(,cdev) head;
sys/kern/kern_conf.c
1317
LIST_INIT(&(*cdp)->head);
sys/kern/kern_conf.c
1353
LIST_FOREACH(dev, &cd->head, si_clone) {
sys/kern/kern_conf.c
1384
LIST_FOREACH(dev, &cd->head, si_clone) {
sys/kern/kern_conf.c
1396
LIST_INSERT_HEAD(&cd->head, dev, si_clone);
sys/kern/kern_conf.c
1418
while (!LIST_EMPTY(&cd->head)) {
sys/kern/kern_conf.c
1419
dev = LIST_FIRST(&cd->head);
sys/kern/kern_cpuset.c
244
cpuset_rel_defer(struct setlist *head, struct cpuset *set)
sys/kern/kern_cpuset.c
257
LIST_INSERT_HEAD(head, set, cs_link);
sys/kern/kern_exec.c
1498
SLIST_HEAD(, exec_args_kva) head;
sys/kern/kern_exec.c
1509
SLIST_INIT(&head);
sys/kern/kern_exec.c
1511
SLIST_SWAP(&head, &exec_args_kva_freelist, exec_args_kva);
sys/kern/kern_exec.c
1513
while ((argkva = SLIST_FIRST(&head)) != NULL) {
sys/kern/kern_exec.c
1514
SLIST_REMOVE_HEAD(&head, next);
sys/kern/kern_rangelock.c
109
v = atomic_load_ptr(&lock->head);
sys/kern/kern_rangelock.c
118
sleepq_lock(&lock->head);
sys/kern/kern_rangelock.c
133
sleepq_lock(&lock->head);
sys/kern/kern_rangelock.c
134
if (atomic_fcmpset_rel_ptr(&lock->head, &v,
sys/kern/kern_rangelock.c
137
sleepq_release(&lock->head);
sys/kern/kern_rangelock.c
142
if (atomic_fcmpset_acq_ptr(&lock->head, &v,
sys/kern/kern_rangelock.c
162
sleepq_lock(&lock->head);
sys/kern/kern_rangelock.c
163
if (atomic_fcmpset_rel_ptr(&lock->head, &v,
sys/kern/kern_rangelock.c
166
sleepq_release(&lock->head);
sys/kern/kern_rangelock.c
170
if (atomic_fcmpset_acq_ptr(&lock->head, &v,
sys/kern/kern_rangelock.c
193
v = atomic_load_ptr(&lock->head);
sys/kern/kern_rangelock.c
210
if (atomic_fcmpset_rel_ptr(&lock->head,
sys/kern/kern_rangelock.c
214
sleepq_lock(&lock->head);
sys/kern/kern_rangelock.c
215
if (atomic_fcmpset_rel_ptr(&lock->head,
sys/kern/kern_rangelock.c
218
&lock->head,
sys/kern/kern_rangelock.c
220
sleepq_release(&lock->head);
sys/kern/kern_rangelock.c
223
sleepq_release(&lock->head);
sys/kern/kern_rangelock.c
227
if (atomic_fcmpset_rel_ptr(&lock->head, &v,
sys/kern/kern_rangelock.c
237
sleepq_lock(&lock->head);
sys/kern/kern_rangelock.c
238
atomic_store_ptr(&lock->head, 0);
sys/kern/kern_rangelock.c
239
sleepq_broadcast(&lock->head,
sys/kern/kern_rangelock.c
241
sleepq_release(&lock->head);
sys/kern/kern_rangelock.c
244
if (atomic_fcmpset_ptr(&lock->head, &v,
sys/kern/kern_rangelock.c
262
v = atomic_load_ptr(&lock->head);
sys/kern/kern_rangelock.c
333
atomic_store_ptr(&lock->head, rangelock_cheat ? RL_CHEAT_CHEATING : 0);
sys/kern/kern_rangelock.c
342
DEBUG_POISON_POINTER(*(void **)&lock->head);
sys/kern/kern_rangelock.c
486
prev = (struct rl_q_entry **)&lock->head;
sys/kern/kern_rangelock.c
621
prev = (struct rl_q_entry **)&lock->head;
sys/kern/kern_rangelock.c
658
prev = (struct rl_q_entry **)&lock->head;
sys/kern/kern_rangelock.c
781
v = atomic_load_ptr(&lock->head);
sys/kern/kern_rangelock.c
785
sleepq_lock(&lock->head);
sys/kern/kern_rangelock.c
788
sleepq_release(&lock->head);
sys/kern/kern_rangelock.c
796
if (atomic_fcmpset_ptr(&lock->head, &v, x) != 0) {
sys/kern/kern_rangelock.c
805
if (atomic_fcmpset_ptr(&lock->head, &v, x) != 0) {
sys/kern/kern_rangelock.c
806
sleepq_release(&lock->head);
sys/kern/kern_rangelock.c
836
v = lock->head;
sys/kern/kern_rangelock.c
841
for (e = (struct rl_q_entry *)(lock->head);;) {
sys/kern/kern_rangelock.c
92
v = atomic_load_ptr(&lock->head);
sys/kern/kern_rangelock.c
95
sleepq_add(&lock->head, NULL, "ranged1", 0, 0);
sys/kern/kern_rangelock.c
96
sleepq_wait(&lock->head, PRI_USER);
sys/kern/kern_rangelock.c
97
sleepq_lock(&lock->head);
sys/kern/kern_rangelock.c
99
sleepq_release(&lock->head);
sys/kern/kern_umtx.c
362
TAILQ_INIT(&uq->uq_spare_queue->head);
sys/kern/kern_umtx.c
502
TAILQ_INSERT_TAIL(&uh->head, uq, uq_link);
sys/kern/kern_umtx.c
519
TAILQ_REMOVE(&uh->head, uq, uq_link);
sys/kern/kern_umtx.c
522
if (TAILQ_EMPTY(&uh->head)) {
sys/kern/kern_umtx.c
567
*first = TAILQ_FIRST(&uh->head);
sys/kern/kern_umtx.c
588
TAILQ_FOREACH_SAFE(uq, &uh->head, uq_link, uq_temp) {
sys/kern/kern_umtx.c
614
while ((uq = TAILQ_FIRST(&uh->head)) != NULL) {
sys/kern/kern_umtx.c
657
TAILQ_FOREACH_SAFE(uq, &uh->head, uq_link, uq_temp) {
sys/kern/subr_disk.c
152
bioq_init(struct bio_queue_head *head)
sys/kern/subr_disk.c
155
TAILQ_INIT(&head->queue);
sys/kern/subr_disk.c
156
head->last_offset = 0;
sys/kern/subr_disk.c
157
head->insert_point = NULL;
sys/kern/subr_disk.c
158
head->total = 0;
sys/kern/subr_disk.c
159
head->batched = 0;
sys/kern/subr_disk.c
163
bioq_remove(struct bio_queue_head *head, struct bio *bp)
sys/kern/subr_disk.c
166
if (head->insert_point == NULL) {
sys/kern/subr_disk.c
167
if (bp == TAILQ_FIRST(&head->queue))
sys/kern/subr_disk.c
168
head->last_offset = bp->bio_offset + bp->bio_length;
sys/kern/subr_disk.c
169
} else if (bp == head->insert_point)
sys/kern/subr_disk.c
170
head->insert_point = NULL;
sys/kern/subr_disk.c
172
TAILQ_REMOVE(&head->queue, bp, bio_queue);
sys/kern/subr_disk.c
173
if (TAILQ_EMPTY(&head->queue))
sys/kern/subr_disk.c
174
head->batched = 0;
sys/kern/subr_disk.c
175
head->total--;
sys/kern/subr_disk.c
179
bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error)
sys/kern/subr_disk.c
183
while ((bp = bioq_takefirst(head)) != NULL)
sys/kern/subr_disk.c
188
bioq_insert_head(struct bio_queue_head *head, struct bio *bp)
sys/kern/subr_disk.c
191
if (head->insert_point == NULL)
sys/kern/subr_disk.c
192
head->last_offset = bp->bio_offset;
sys/kern/subr_disk.c
193
TAILQ_INSERT_HEAD(&head->queue, bp, bio_queue);
sys/kern/subr_disk.c
194
head->total++;
sys/kern/subr_disk.c
195
head->batched = 0;
sys/kern/subr_disk.c
199
bioq_insert_tail(struct bio_queue_head *head, struct bio *bp)
sys/kern/subr_disk.c
202
TAILQ_INSERT_TAIL(&head->queue, bp, bio_queue);
sys/kern/subr_disk.c
203
head->total++;
sys/kern/subr_disk.c
204
head->batched = 0;
sys/kern/subr_disk.c
205
head->insert_point = bp;
sys/kern/subr_disk.c
206
head->last_offset = bp->bio_offset;
sys/kern/subr_disk.c
210
bioq_first(struct bio_queue_head *head)
sys/kern/subr_disk.c
213
return (TAILQ_FIRST(&head->queue));
sys/kern/subr_disk.c
217
bioq_takefirst(struct bio_queue_head *head)
sys/kern/subr_disk.c
221
bp = TAILQ_FIRST(&head->queue);
sys/kern/subr_disk.c
223
bioq_remove(head, bp);
sys/kern/subr_disk.c
233
bioq_bio_key(struct bio_queue_head *head, struct bio *bp)
sys/kern/subr_disk.c
236
return ((uoff_t)(bp->bio_offset - head->last_offset));
sys/kern/subr_disk.c
247
bioq_disksort(struct bio_queue_head *head, struct bio *bp)
sys/kern/subr_disk.c
259
bioq_insert_tail(head, bp);
sys/kern/subr_disk.c
270
bioq_insert_tail(head, bp);
sys/kern/subr_disk.c
274
if (bioq_batchsize > 0 && head->batched > bioq_batchsize) {
sys/kern/subr_disk.c
275
bioq_insert_tail(head, bp);
sys/kern/subr_disk.c
280
key = bioq_bio_key(head, bp);
sys/kern/subr_disk.c
281
cur = TAILQ_FIRST(&head->queue);
sys/kern/subr_disk.c
283
if (head->insert_point) {
sys/kern/subr_disk.c
284
prev = head->insert_point;
sys/kern/subr_disk.c
285
cur = TAILQ_NEXT(head->insert_point, bio_queue);
sys/kern/subr_disk.c
288
while (cur != NULL && key >= bioq_bio_key(head, cur)) {
sys/kern/subr_disk.c
294
TAILQ_INSERT_HEAD(&head->queue, bp, bio_queue);
sys/kern/subr_disk.c
296
TAILQ_INSERT_AFTER(&head->queue, prev, bp, bio_queue);
sys/kern/subr_disk.c
297
head->total++;
sys/kern/subr_disk.c
298
head->batched++;
sys/kern/subr_epoch.c
806
ck_stack_entry_t *cursor, *head, *next;
sys/kern/subr_epoch.c
835
head = ck_stack_batch_pop_npsc(&cb_stack);
sys/kern/subr_epoch.c
836
for (cursor = head; cursor != NULL; cursor = next) {
sys/kern/subr_lock.c
522
struct lphead *head;
sys/kern/subr_lock.c
532
head = &type->lpt_hash[hash];
sys/kern/subr_lock.c
533
SLIST_FOREACH(lp, head, link) {
sys/kern/subr_lock.c
558
struct lpohead *head;
sys/kern/subr_lock.c
560
head = &curthread->td_lprof[spin];
sys/kern/subr_lock.c
561
LIST_FOREACH(l, head, lpo_link)
sys/kern/subr_lock.c
576
LIST_INSERT_HEAD(head, l, lpo_link);
sys/kern/subr_lock.c
661
struct lpohead *head;
sys/kern/subr_lock.c
672
head = &curthread->td_lprof[spin];
sys/kern/subr_lock.c
673
if (LIST_FIRST(head) == NULL)
sys/kern/subr_lock.c
685
LIST_FOREACH(l, head, lpo_link)
sys/kern/subr_sglist.c
766
sglist_split(struct sglist *original, struct sglist **head, size_t length,
sys/kern/subr_sglist.c
799
if (*head == NULL) {
sys/kern/subr_sglist.c
803
*head = sg;
sys/kern/subr_sglist.c
805
sg = *head;
sys/kern/subr_sleepqueue.c
929
struct threadqueue *head;
sys/kern/subr_sleepqueue.c
944
head = &sq->sq_blocked[queue];
sys/kern/subr_sleepqueue.c
952
besttd = TAILQ_LAST_FAST(head, thread, td_slpq);
sys/kern/subr_sleepqueue.c
954
td = TAILQ_PREV_FAST(besttd, head, thread, td_slpq);
sys/kern/subr_sleepqueue.c
966
besttd = td = TAILQ_FIRST(head);
sys/kern/subr_unit.c
1011
TAILQ_INSERT_AFTER(&uh->head, up, upp, list);
sys/kern/subr_unit.c
1094
TAILQ_FOREACH(up, &uh->head, list) {
sys/kern/subr_unit.c
263
up = TAILQ_FIRST(&uh->head);
sys/kern/subr_unit.c
286
up = iter->upos = TAILQ_FIRST(&uh->head);
sys/kern/subr_unit.c
364
TAILQ_FOREACH(up, &uh->head, list) {
sys/kern/subr_unit.c
470
TAILQ_INIT(&uh->head);
sys/kern/subr_unit.c
516
TAILQ_FOREACH_SAFE(up, &uh->head, list, uq) {
sys/kern/subr_unit.c
551
TAILQ_FOREACH(uf, &uh->head, list) {
sys/kern/subr_unit.c
585
TAILQ_REMOVE(&uh->head, us, list);
sys/kern/subr_unit.c
624
TAILQ_REMOVE(&uh->head, uf, list);
sys/kern/subr_unit.c
629
TAILQ_REMOVE(&uh->head, uf, list);
sys/kern/subr_unit.c
639
TAILQ_REMOVE(&uh->head, uf, list);
sys/kern/subr_unit.c
674
TAILQ_REMOVE(&uh->head, up, list);
sys/kern/subr_unit.c
684
TAILQ_REMOVE(&uh->head, upp, list);
sys/kern/subr_unit.c
690
TAILQ_REMOVE(&uh->head, upp, list);
sys/kern/subr_unit.c
696
upp = TAILQ_FIRST(&uh->head);
sys/kern/subr_unit.c
699
TAILQ_REMOVE(&uh->head, upp, list);
sys/kern/subr_unit.c
706
upp = TAILQ_LAST(&uh->head, unrhd);
sys/kern/subr_unit.c
709
TAILQ_REMOVE(&uh->head, upp, list);
sys/kern/subr_unit.c
736
up = TAILQ_FIRST(&uh->head);
sys/kern/subr_unit.c
799
up = TAILQ_FIRST(&uh->head);
sys/kern/subr_unit.c
815
TAILQ_INSERT_TAIL(&uh->head, up, list);
sys/kern/subr_unit.c
819
TAILQ_INSERT_TAIL(&uh->head, up, list);
sys/kern/subr_unit.c
826
TAILQ_FOREACH(up, &uh->head, list) {
sys/kern/subr_unit.c
838
TAILQ_INSERT_TAIL(&uh->head, up, list);
sys/kern/subr_unit.c
843
TAILQ_INSERT_TAIL(&uh->head, up, list);
sys/kern/subr_unit.c
866
TAILQ_INSERT_AFTER(&uh->head, up, upn, list);
sys/kern/subr_unit.c
931
upp = TAILQ_FIRST(&uh->head);
sys/kern/subr_unit.c
950
TAILQ_INSERT_HEAD(&uh->head, up, list);
sys/kern/subr_unit.c
957
TAILQ_FOREACH(up, &uh->head, list) {
sys/kern/uipc_mbuf.c
1122
mc_split(struct mchain *head, struct mchain *tail, u_int len0, int wait)
sys/kern/uipc_mbuf.c
1127
MPASS(!(mc_first(head)->m_flags & M_PKTHDR));
sys/kern/uipc_mbuf.c
1132
STAILQ_FOREACH(m, &head->mc_q, m_stailq) {
sys/kern/uipc_mbuf.c
1159
tail->mc_q.stqh_last = head->mc_q.stqh_last;
sys/kern/uipc_mbuf.c
1160
tail->mc_len = head->mc_len - len0;
sys/kern/uipc_mbuf.c
1161
tail->mc_mlen = head->mc_mlen - mlen;
sys/kern/uipc_mbuf.c
1172
head->mc_q.stqh_last = &STAILQ_NEXT(m, m_stailq);
sys/kern/uipc_mbuf.c
1174
head->mc_len = len0;
sys/kern/uipc_mbuf.c
1175
head->mc_mlen = mlen;
sys/kern/uipc_socket.c
1073
solisten_clone(struct socket *head)
sys/kern/uipc_socket.c
1088
SOLISTEN_LOCK(head);
sys/kern/uipc_socket.c
1089
over = (head->sol_qlen > 3 * head->sol_qlimit / 2);
sys/kern/uipc_socket.c
1095
head->sol_overcount++;
sys/kern/uipc_socket.c
1097
!!ratecheck(&head->sol_lastover, &overinterval);
sys/kern/uipc_socket.c
1105
overcount = head->sol_overcount;
sys/kern/uipc_socket.c
1106
head->sol_overcount = 0;
sys/kern/uipc_socket.c
1107
qlen = head->sol_qlen;
sys/kern/uipc_socket.c
1109
SOLISTEN_UNLOCK(head);
sys/kern/uipc_socket.c
1118
switch (head->so_proto->pr_domain->dom_family) {
sys/kern/uipc_socket.c
1125
if (head->so_proto->pr_domain->dom_family ==
sys/kern/uipc_socket.c
1127
(sotoinpcb(head)->inp_inc.inc_flags &
sys/kern/uipc_socket.c
1130
&sotoinpcb(head)->inp_inc.inc6_laddr);
sys/kern/uipc_socket.c
1137
sotoinpcb(head)->inp_inc.inc_laddr,
sys/kern/uipc_socket.c
1143
ntohs(sotoinpcb(head)->inp_inc.inc_lport),
sys/kern/uipc_socket.c
1144
head->so_proto->pr_protocol);
sys/kern/uipc_socket.c
1149
if (sotounpcb(head)->unp_addr != NULL)
sys/kern/uipc_socket.c
1151
sotounpcb(head)->unp_addr->sun_len -
sys/kern/uipc_socket.c
1158
sotounpcb(head)->unp_addr->sun_path,
sys/kern/uipc_socket.c
1173
head->so_proto->pr_domain->dom_name ?:
sys/kern/uipc_socket.c
1185
if (head->so_cred == 0) {
sys/kern/uipc_socket.c
1190
"occurrences)\n", head->so_pcb,
sys/kern/uipc_socket.c
1199
head->so_pcb, sbuf_data(&descrsb), qlen,
sys/kern/uipc_socket.c
1200
overcount, head->so_cred->cr_uid,
sys/kern/uipc_socket.c
1201
head->so_cred->cr_rgid,
sys/kern/uipc_socket.c
1202
head->so_cred->cr_prison ?
sys/kern/uipc_socket.c
1203
head->so_cred->cr_prison->pr_name :
sys/kern/uipc_socket.c
1213
SOLISTEN_UNLOCK(head);
sys/kern/uipc_socket.c
1214
VNET_ASSERT(head->so_vnet != NULL, ("%s: so %p vnet is NULL",
sys/kern/uipc_socket.c
1215
__func__, head));
sys/kern/uipc_socket.c
1216
so = soalloc(head->so_vnet);
sys/kern/uipc_socket.c
1220
__func__, head->so_pcb);
sys/kern/uipc_socket.c
1223
so->so_listen = head;
sys/kern/uipc_socket.c
1224
so->so_type = head->so_type;
sys/kern/uipc_socket.c
1240
so->so_options = head->so_options & (SO_ACCEPTFILTER | SO_KEEPALIVE |
sys/kern/uipc_socket.c
1242
so->so_linger = head->so_linger;
sys/kern/uipc_socket.c
1243
so->so_state = head->so_state;
sys/kern/uipc_socket.c
1244
so->so_fibnum = head->so_fibnum;
sys/kern/uipc_socket.c
1245
so->so_proto = head->so_proto;
sys/kern/uipc_socket.c
1246
so->so_cred = crhold(head->so_cred);
sys/kern/uipc_socket.c
1249
if (hhook_run_socket(so, head, HHOOK_SOCKET_NEWCONN)) {
sys/kern/uipc_socket.c
1257
mac_socket_newconn(head, so);
sys/kern/uipc_socket.c
1263
so->so_rcv.sb_lowat = head->sol_sbrcv_lowat;
sys/kern/uipc_socket.c
1264
so->so_snd.sb_lowat = head->sol_sbsnd_lowat;
sys/kern/uipc_socket.c
1265
so->so_rcv.sb_timeo = head->sol_sbrcv_timeo;
sys/kern/uipc_socket.c
1266
so->so_snd.sb_timeo = head->sol_sbsnd_timeo;
sys/kern/uipc_socket.c
1267
so->so_rcv.sb_flags = head->sol_sbrcv_flags & SB_AUTOSIZE;
sys/kern/uipc_socket.c
1268
so->so_snd.sb_flags = head->sol_sbsnd_flags &
sys/kern/uipc_socket.c
1276
sonewconn(struct socket *head, int connstatus)
sys/kern/uipc_socket.c
1280
if ((so = solisten_clone(head)) == NULL)
sys/kern/uipc_socket.c
1283
if (soattach(so, 0, NULL, head) != 0) {
sys/kern/uipc_socket.c
1286
__func__, head->so_pcb);
sys/kern/uipc_socket.c
1304
struct socket *head = so->so_listen;
sys/kern/uipc_socket.c
1309
SOLISTEN_LOCK(head);
sys/kern/uipc_socket.c
1310
if (head->sol_accept_filter != NULL)
sys/kern/uipc_socket.c
1313
soref(head); /* A socket on (in)complete queue refs head. */
sys/kern/uipc_socket.c
1315
TAILQ_INSERT_TAIL(&head->sol_comp, so, so_list);
sys/kern/uipc_socket.c
1317
head->sol_qlen++;
sys/kern/uipc_socket.c
1318
solisten_wakeup(head); /* unlocks */
sys/kern/uipc_socket.c
1328
while (head->sol_incqlen > head->sol_qlimit) {
sys/kern/uipc_socket.c
1331
sp = TAILQ_FIRST(&head->sol_incomp);
sys/kern/uipc_socket.c
1332
TAILQ_REMOVE(&head->sol_incomp, sp, so_list);
sys/kern/uipc_socket.c
1333
head->sol_incqlen--;
sys/kern/uipc_socket.c
1338
sorele_locked(head); /* does SOLISTEN_UNLOCK, head stays */
sys/kern/uipc_socket.c
1340
SOLISTEN_LOCK(head);
sys/kern/uipc_socket.c
1342
TAILQ_INSERT_TAIL(&head->sol_incomp, so, so_list);
sys/kern/uipc_socket.c
1344
head->sol_incqlen++;
sys/kern/uipc_socket.c
1345
SOLISTEN_UNLOCK(head);
sys/kern/uipc_socket.c
1358
sopeeloff(struct socket *head, struct protosw *so_proto)
sys/kern/uipc_socket.c
1362
VNET_ASSERT(head->so_vnet != NULL, ("%s:%d so_vnet is NULL, head=%p",
sys/kern/uipc_socket.c
1363
__func__, __LINE__, head));
sys/kern/uipc_socket.c
1364
KASSERT(head->so_type == SOCK_SEQPACKET,
sys/kern/uipc_socket.c
1365
("%s: unexpecte so_type: %d", __func__, head->so_type));
sys/kern/uipc_socket.c
1366
so = soalloc(head->so_vnet);
sys/kern/uipc_socket.c
1370
__func__, head->so_pcb);
sys/kern/uipc_socket.c
1374
so->so_options = head->so_options;
sys/kern/uipc_socket.c
1375
so->so_linger = head->so_linger;
sys/kern/uipc_socket.c
1376
so->so_state = (head->so_state & SS_NBIO) | SS_ISCONNECTED;
sys/kern/uipc_socket.c
1377
so->so_fibnum = head->so_fibnum;
sys/kern/uipc_socket.c
1379
so->so_cred = crhold(head->so_cred);
sys/kern/uipc_socket.c
1381
mac_socket_newconn(head, so);
sys/kern/uipc_socket.c
1387
if (soattach(so, 0, NULL, head)) {
sys/kern/uipc_socket.c
1390
__func__, head->so_pcb);
sys/kern/uipc_socket.c
1393
so->so_rcv.sb_lowat = head->so_rcv.sb_lowat;
sys/kern/uipc_socket.c
1394
so->so_snd.sb_lowat = head->so_snd.sb_lowat;
sys/kern/uipc_socket.c
1395
so->so_rcv.sb_timeo = head->so_rcv.sb_timeo;
sys/kern/uipc_socket.c
1396
so->so_snd.sb_timeo = head->so_snd.sb_timeo;
sys/kern/uipc_socket.c
1397
so->so_rcv.sb_flags |= head->so_rcv.sb_flags & SB_AUTOSIZE;
sys/kern/uipc_socket.c
1398
so->so_snd.sb_flags |= head->so_snd.sb_flags & SB_AUTOSIZE;
sys/kern/uipc_socket.c
1618
solisten_dequeue(struct socket *head, struct socket **ret, int flags)
sys/kern/uipc_socket.c
1623
SOLISTEN_LOCK_ASSERT(head);
sys/kern/uipc_socket.c
1625
while (!(head->so_state & SS_NBIO) && TAILQ_EMPTY(&head->sol_comp) &&
sys/kern/uipc_socket.c
1626
head->so_error == 0) {
sys/kern/uipc_socket.c
1627
error = msleep(&head->sol_comp, SOCK_MTX(head), PSOCK | PCATCH,
sys/kern/uipc_socket.c
1630
SOLISTEN_UNLOCK(head);
sys/kern/uipc_socket.c
1634
if (head->so_error) {
sys/kern/uipc_socket.c
1635
error = head->so_error;
sys/kern/uipc_socket.c
1636
head->so_error = 0;
sys/kern/uipc_socket.c
1637
} else if ((head->so_state & SS_NBIO) && TAILQ_EMPTY(&head->sol_comp))
sys/kern/uipc_socket.c
1642
SOLISTEN_UNLOCK(head);
sys/kern/uipc_socket.c
1645
so = TAILQ_FIRST(&head->sol_comp);
sys/kern/uipc_socket.c
1649
head->sol_qlen--;
sys/kern/uipc_socket.c
1652
TAILQ_REMOVE(&head->sol_comp, so, so_list);
sys/kern/uipc_socket.c
1654
so->so_state |= (head->so_state & SS_NBIO);
sys/kern/uipc_socket.c
1658
sorele_locked(head);
sys/kern/uipc_socket.c
370
STAILQ_HEAD(, so_splice) head;
sys/kern/uipc_socket.c
394
while (STAILQ_EMPTY(&wq->head)) {
sys/kern/uipc_socket.c
400
STAILQ_CONCAT(&local_head, &wq->head);
sys/kern/uipc_socket.c
401
STAILQ_INIT(&wq->head);
sys/kern/uipc_socket.c
420
STAILQ_INSERT_TAIL(&wq->head, sp, next);
sys/kern/uipc_socket.c
4762
struct socket *head = so->so_listen;
sys/kern/uipc_socket.c
4765
KASSERT(head, ("%s: so %p on incomp of NULL", __func__, so));
sys/kern/uipc_socket.c
4773
if (__predict_false(SOLISTEN_TRYLOCK(head) == 0)) {
sys/kern/uipc_socket.c
4774
soref(head);
sys/kern/uipc_socket.c
4776
SOLISTEN_LOCK(head);
sys/kern/uipc_socket.c
4778
if (__predict_false(head != so->so_listen)) {
sys/kern/uipc_socket.c
4785
sorele_locked(head);
sys/kern/uipc_socket.c
4788
last = refcount_release(&head->so_count);
sys/kern/uipc_socket.c
4790
__func__, head));
sys/kern/uipc_socket.c
4794
TAILQ_REMOVE(&head->sol_incomp, so, so_list);
sys/kern/uipc_socket.c
4795
head->sol_incqlen--;
sys/kern/uipc_socket.c
4796
TAILQ_INSERT_TAIL(&head->sol_comp, so, so_list);
sys/kern/uipc_socket.c
4797
head->sol_qlen++;
sys/kern/uipc_socket.c
4800
solisten_wakeup(head); /* unlocks */
sys/kern/uipc_socket.c
4804
head->sol_accept_filter->accf_callback,
sys/kern/uipc_socket.c
4805
head->sol_accept_filter_arg);
sys/kern/uipc_socket.c
4807
ret = head->sol_accept_filter->accf_callback(so,
sys/kern/uipc_socket.c
4808
head->sol_accept_filter_arg, M_NOWAIT);
sys/kern/uipc_socket.c
4816
SOLISTEN_UNLOCK(head);
sys/kern/uipc_socket.c
500
STAILQ_INIT(&splice_wq[i].head);
sys/kern/uipc_socket.c
954
soattach(struct socket *so, int proto, struct thread *td, struct socket *head)
sys/kern/uipc_socket.c
967
if (head == NULL || (error = soreserve(so,
sys/kern/uipc_socket.c
968
SOLISTENING(head) ? head->sol_sbsnd_hiwat : head->so_snd.sb_hiwat,
sys/kern/uipc_socket.c
969
SOLISTENING(head) ? head->sol_sbrcv_hiwat : head->so_rcv.sb_hiwat))
sys/kern/uipc_syscalls.c
336
struct socket *head, *so;
sys/kern/uipc_syscalls.c
348
head = headfp->f_data;
sys/kern/uipc_syscalls.c
349
if (!SOLISTENING(head)) {
sys/kern/uipc_syscalls.c
354
error = mac_socket_check_accept(td->td_ucred, head);
sys/kern/uipc_syscalls.c
363
SOCK_LOCK(head);
sys/kern/uipc_syscalls.c
364
if (!SOLISTENING(head)) {
sys/kern/uipc_syscalls.c
365
SOCK_UNLOCK(head);
sys/kern/uipc_syscalls.c
370
error = solisten_dequeue(head, &so, flags);
sys/kern/uipc_syscalls.c
378
KNOTE_UNLOCKED(&head->so_rdsel.si_note, 0);
sys/kern/uipc_syscalls.c
381
pgid = fgetown(&head->so_sigio);
sys/kern/uipc_usrreq.c
3278
struct unp_head *head;
sys/kern/uipc_usrreq.c
3285
head = &unp_shead;
sys/kern/uipc_usrreq.c
3289
head = &unp_dhead;
sys/kern/uipc_usrreq.c
3293
head = &unp_sphead;
sys/kern/uipc_usrreq.c
3336
for (unp = LIST_FIRST(head), i = 0; unp && i < n;
sys/kern/uipc_usrreq.c
4107
struct unp_head **head;
sys/kern/uipc_usrreq.c
4121
for (head = heads; *head != NULL; head++)
sys/kern/uipc_usrreq.c
4122
LIST_FOREACH(unp, *head, unp_link) {
sys/kern/vfs_inotify.c
196
inotify_enqueue(struct inotify_softc *sc, struct inotify_record *rec, bool head)
sys/kern/vfs_inotify.c
200
if (head)
sys/net/altq/altq_rmclass.c
546
struct rm_class *p, *head, *previous;
sys/net/altq/altq_rmclass.c
568
head = cl->parent_->children_;
sys/net/altq/altq_rmclass.c
569
p = previous = head;
sys/net/altq/altq_rmclass.c
570
if (head->next_ == NULL) {
sys/net/altq/altq_rmclass.c
571
ASSERT(head == cl);
sys/net/altq/altq_rmclass.c
576
if (cl == head)
sys/net/altq/altq_var.h
141
#define TAILQ_LAST(head, headname) \
sys/net/altq/altq_var.h
142
(*(((struct headname *)((head)->tqh_last))->tqh_last))
sys/net/altq/altq_var.h
145
#define TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
sys/net/altq/altq_var.h
148
#define TAILQ_FOREACH(var, head, field) \
sys/net/altq/altq_var.h
149
for (var = TAILQ_FIRST(head); var; var = TAILQ_NEXT(var, field))
sys/net/if_llatbl.c
307
llentries_unlink(struct lltable *llt, struct llentries *head)
sys/net/if_llatbl.c
311
CK_LIST_FOREACH_SAFE(lle, head, lle_chain, next)
sys/net/if_llatbl.c
82
static void llentries_unlink(struct lltable *llt, struct llentries *head);
sys/net/iflib.c
1014
if (nm_i != head) { /* we have new packets to send */
sys/net/iflib.c
1026
while (nm_i != head) {
sys/net/iflib.c
472
#define IDXDIFF(head, tail, wrap) \
sys/net/iflib.c
473
((head) >= (tail) ? (head) - (tail) : (wrap) - (tail) + (head))
sys/net/iflib.c
975
u_int const head = kring->rhead;
sys/net/netmap.h
296
uint32_t head; /* (u) first user slot */
sys/net/netmap.h
359
return (ring->head == ring->tail);
sys/net/netmap.h
794
uint32_t head; /* AW+ KR+ the head of the appl netmap_ring */
sys/net/netmap.h
867
uint32_t head)
sys/net/netmap.h
896
atok->head = head;
sys/net/netmap_user.h
1076
ring->head = ring->cur = nm_ring_next(ring, i);
sys/net/netmap_user.h
1142
ring->head = ring->cur = nm_ring_next(ring, i);
sys/net/netmap_user.h
1173
ring->head = ring->cur;
sys/net/netmap_user.h
155
return nm_ring_next(r, r->tail) != r->head;
sys/net/netmap_user.h
163
int ret = ring->tail - ring->head;
sys/net/netmap_user.h
947
D("TX%d %p h %d c %d t %d", i, r, r->head, r->cur, r->tail);
sys/net/netmap_user.h
951
D("RX%d %p h %d c %d t %d", i, r, r->head, r->cur, r->tail);
sys/net/pfil.c
181
pfil_mem_in(struct pfil_head *head, void *mem, u_int len, struct ifnet *ifp,
sys/net/pfil.c
185
return (pfil_mem_common(&head->head_in, mem, len, PFIL_IN, ifp, m));
sys/net/pfil.c
189
pfil_mem_out(struct pfil_head *head, void *mem, u_int len, struct ifnet *ifp,
sys/net/pfil.c
193
return (pfil_mem_common(&head->head_out, mem, len, PFIL_OUT, ifp, m));
sys/net/pfil.c
226
pfil_mbuf_in(struct pfil_head *head, struct mbuf **m, struct ifnet *ifp,
sys/net/pfil.c
230
return (pfil_mbuf_common(&head->head_in, m, ifp, PFIL_IN, inp));
sys/net/pfil.c
234
pfil_mbuf_out(struct pfil_head *head, struct mbuf **m, struct ifnet *ifp,
sys/net/pfil.c
238
return (pfil_mbuf_common(&head->head_out, m, ifp, PFIL_OUT, inp));
sys/net/pfil.c
242
pfil_mbuf_fwd(struct pfil_head *head, struct mbuf **m, struct ifnet *ifp,
sys/net/pfil.c
246
return (pfil_mbuf_common(&head->head_out, m, ifp, PFIL_OUT | PFIL_FWD, inp));
sys/net/pfil.c
256
struct pfil_head *head, *list;
sys/net/pfil.c
260
head = malloc(sizeof(struct pfil_head), M_PFIL, M_WAITOK);
sys/net/pfil.c
262
head->head_nhooksin = head->head_nhooksout = 0;
sys/net/pfil.c
263
head->head_flags = pa->pa_flags;
sys/net/pfil.c
264
head->head_type = pa->pa_type;
sys/net/pfil.c
265
head->head_name = pa->pa_headname;
sys/net/pfil.c
266
CK_STAILQ_INIT(&head->head_in);
sys/net/pfil.c
267
CK_STAILQ_INIT(&head->head_out);
sys/net/pfil.c
275
LIST_INSERT_HEAD(&V_pfil_head_list, head, head_list);
sys/net/pfil.c
278
return (head);
sys/net/pfil.c
336
pfil_unlink(struct pfil_link_args *pa, pfil_head_t head, pfil_hook_t hook)
sys/net/pfil.c
343
in = pfil_link_remove(&head->head_in, hook);
sys/net/pfil.c
345
head->head_nhooksin--;
sys/net/pfil.c
351
out = pfil_link_remove(&head->head_out, hook);
sys/net/pfil.c
353
head->head_nhooksout--;
sys/net/pfil.c
375
struct pfil_head *head;
sys/net/pfil.c
392
head = pa->pa_head;
sys/net/pfil.c
394
LIST_FOREACH(head, &V_pfil_head_list, head_list)
sys/net/pfil.c
395
if (strcmp(pa->pa_headname, head->head_name) == 0)
sys/net/pfil.c
404
if (head == NULL || hook == NULL) {
sys/net/pfil.c
410
return (pfil_unlink(pa, head, hook));
sys/net/pfil.c
412
if (head->head_type != hook->hook_type ||
sys/net/pfil.c
413
((hook->hook_flags & pa->pa_flags) & ~head->head_flags)) {
sys/net/pfil.c
419
CK_STAILQ_FOREACH(link, &head->head_in, link_chain)
sys/net/pfil.c
425
CK_STAILQ_FOREACH(link, &head->head_out, link_chain)
sys/net/pfil.c
438
CK_STAILQ_INSERT_TAIL(&head->head_in, in, link_chain);
sys/net/pfil.c
440
CK_STAILQ_INSERT_HEAD(&head->head_in, in, link_chain);
sys/net/pfil.c
442
head->head_nhooksin++;
sys/net/pfil.c
451
CK_STAILQ_INSERT_HEAD(&head->head_out, out, link_chain);
sys/net/pfil.c
453
CK_STAILQ_INSERT_TAIL(&head->head_out, out, link_chain);
sys/net/pfil.c
455
head->head_nhooksout++;
sys/net/pfil.c
483
struct pfil_head *head;
sys/net/pfil.c
487
LIST_FOREACH(head, &V_pfil_head_list, head_list) {
sys/net/pfil.c
489
in = pfil_link_remove(&head->head_in, hook);
sys/net/pfil.c
491
head->head_nhooksin--;
sys/net/pfil.c
495
out = pfil_link_remove(&head->head_out, hook);
sys/net/pfil.c
497
head->head_nhooksout--;
sys/net/pfil.c
587
struct pfil_head *head;
sys/net/pfil.c
597
LIST_FOREACH(head, &V_pfil_head_list, head_list) {
sys/net/pfil.c
599
nhooks += head->head_nhooksin + head->head_nhooksout;
sys/net/pfil.c
614
LIST_FOREACH(head, &V_pfil_head_list, head_list) {
sys/net/pfil.c
616
hk + head->head_nhooksin + head->head_nhooksout > nhooks) {
sys/net/pfil.c
622
strlcpy(iohead[hd].pio_name, head->head_name,
sys/net/pfil.c
624
iohead[hd].pio_nhooksin = head->head_nhooksin;
sys/net/pfil.c
625
iohead[hd].pio_nhooksout = head->head_nhooksout;
sys/net/pfil.c
626
iohead[hd].pio_type = head->head_type;
sys/net/pfil.c
627
CK_STAILQ_FOREACH(link, &head->head_in, link_chain) {
sys/net/pfil.c
636
CK_STAILQ_FOREACH(link, &head->head_out, link_chain) {
sys/net/radix.c
1122
rn_detachhead_internal(struct radix_head *head)
sys/net/radix.c
1125
KASSERT((head != NULL),
sys/net/radix.c
1129
R_Free(head);
sys/net/radix.c
1135
rn_inithead(void **head, int off)
sys/net/radix.c
1140
rnh = *head;
sys/net/radix.c
1143
if (*head != NULL)
sys/net/radix.c
1158
rn_inithead_internal(&rmh->head, rmh->mask_nodes, 0);
sys/net/radix.c
1159
*head = rnh;
sys/net/radix.c
1186
rn_detachhead(void **head)
sys/net/radix.c
1190
KASSERT((head != NULL && *head != NULL),
sys/net/radix.c
1193
rnh = (struct radix_node_head *)(*head);
sys/net/radix.c
1195
rn_walktree(&rnh->rh.rnh_masks->head, rn_freeentry, rnh->rh.rnh_masks);
sys/net/radix.c
1196
rn_detachhead_internal(&rnh->rh.rnh_masks->head);
sys/net/radix.c
1199
*head = NULL;
sys/net/radix.c
142
rn_search(const void *v_arg, struct radix_node *head)
sys/net/radix.c
147
for (x = head, v = v_arg; x->rn_bit >= 0;) {
sys/net/radix.c
161
rn_search_m(const void *v_arg, struct radix_node *head, void *m_arg)
sys/net/radix.c
166
for (x = head; x->rn_bit >= 0;) {
sys/net/radix.c
209
rn_lookup(const void *v_arg, const void *m_arg, struct radix_head *head)
sys/net/radix.c
218
x = rn_addmask(m_arg, head->rnh_masks, 1,
sys/net/radix.c
219
head->rnh_treetop->rn_offset);
sys/net/radix.c
224
x = rn_match(v_arg, head);
sys/net/radix.c
235
if ((x = rn_match(v_arg, head)) == NULL)
sys/net/radix.c
271
rn_match(const void *v_arg, struct radix_head *head)
sys/net/radix.c
274
struct radix_node *t = head->rnh_treetop, *x;
sys/net/radix.c
434
rn_insert(void *v_arg, struct radix_head *head, int *dupentry,
sys/net/radix.c
438
struct radix_node *top = head->rnh_treetop;
sys/net/radix.c
529
x = rn_search(addmask_key, maskhead->head.rnh_treetop);
sys/net/radix.c
539
x = rn_insert(cp, &maskhead->head, &maskduplicated, x);
sys/net/radix.c
607
rn_addroute(void *v_arg, const void *n_arg, struct radix_head *head,
sys/net/radix.c
612
struct radix_node *saved_tt, *top = head->rnh_treetop;
sys/net/radix.c
626
x = rn_addmask(n_arg, head->rnh_masks, 0, top->rn_offset);
sys/net/radix.c
636
saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
sys/net/radix.c
764
rn_delete(const void *v_arg, const void *netmask_arg, struct radix_head *head)
sys/net/radix.c
775
x = head->rnh_treetop;
sys/net/radix.c
788
x = rn_addmask(netmask, head->rnh_masks, 1, head_off);
sys/net/radix.h
114
typedef int rn_walktree_t(struct radix_head *head, walktree_f_t *f,
sys/net/radix.h
116
typedef int rn_walktree_from_t(struct radix_head *head,
sys/net/radix.h
118
typedef void rn_close_t(struct radix_node *rn, struct radix_head *head);
sys/net/radix.h
144
struct radix_head head;
sys/net/radix.h
181
struct radix_head *head);
sys/net/route.c
107
rn_inithead_internal(&rh->head, rh->rnh_nodes, offset);
sys/net/route.c
108
rn_inithead_internal(&rh->rmhead.head, rh->rmhead.mask_nodes, 0);
sys/net/route.c
109
rh->head.rnh_masks = &rh->rmhead;
sys/net/route.c
165
rn_walktree(&rh->rmhead.head, rt_freeentry, &rh->rmhead.head);
sys/net/route/nhop_utils.h
39
_cht_get_resize_size(const struct _cht_head *head)
sys/net/route/nhop_utils.h
43
if ((head->items_count * 2 > head->hash_size) && (head->hash_size < 65536))
sys/net/route/nhop_utils.h
44
new_size = head->hash_size * 2;
sys/net/route/nhop_utils.h
45
else if ((head->items_count * 4 < head->hash_size) && head->hash_size > 16)
sys/net/route/nhop_utils.h
46
new_size = head->hash_size / 2;
sys/net/route/nhop_utils.h
52
_cht_need_resize(const struct _cht_head *head)
sys/net/route/nhop_utils.h
55
return (_cht_get_resize_size(head) > 0);
sys/net/route/route_ctl.c
1056
info->rti_info[RTAX_NETMASK], &rnh->head);
sys/net/route/route_ctl.c
1197
rn = rnh->rnh_addaddr(rt_key(rt), rt_mask_const(rt), &rnh->head, rt->rt_nodes);
sys/net/route/route_ctl.c
1232
rn = rnh->rnh_deladdr(rt_key_const(rt), rt_mask_const(rt), &rnh->head);
sys/net/route/route_ctl.c
1390
struct rtentry *head;
sys/net/route/route_ctl.c
1420
rt->rt_chain = di->head;
sys/net/route/route_ctl.c
1421
di->head = rt;
sys/net/route/route_ctl.c
1465
rnh->rnh_walktree(&rnh->head, rt_checkdelroute, &di);
sys/net/route/route_ctl.c
1471
while (di.head != NULL) {
sys/net/route/route_ctl.c
1472
rt = di.head;
sys/net/route/route_ctl.c
1473
di.head = rt->rt_chain;
sys/net/route/route_ctl.c
1505
rn = rnh->rnh_deladdr(rt_key(rt), rt_mask(rt), &rnh->head);
sys/net/route/route_ctl.c
1520
rnh->rnh_walktree(&rnh->head, rt_delete_unconditional, rnh);
sys/net/route/route_ctl.c
344
rt = (struct rtentry *)rnh->rnh_lookup(dst, netmask, &rnh->head);
sys/net/route/route_ddb.c
199
error = rnh->rnh_walktree(&rnh->head, rt_dumpentry_ddb, NULL);
sys/net/route/route_ddb.c
252
rn = rh->rnh_matchaddr(&u, &rh->head);
sys/net/route/route_helpers.c
159
rnh->rnh_walktree_from(&rnh->head, prefix, mask, (walktree_f_t *)wa_f, arg);
sys/net/route/route_helpers.c
80
rnh->rnh_walktree(&rnh->head, (walktree_f_t *)wa_f, arg);
sys/net/route/route_var.h
50
struct radix_head head;
sys/net/rtsock.c
806
info->rti_info[RTAX_DST], &rnh->head);
sys/net/rtsock.c
810
info->rti_info[RTAX_NETMASK], &rnh->head);
sys/net/rtsock.c
850
(struct sockaddr *)&laddr, &rnh->head);
sys/net80211/ieee80211_ageq.c
164
struct mbuf *head, **phead;
sys/net80211/ieee80211_ageq.c
167
phead = &head;
sys/net80211/ieee80211_ageq.c
184
return head;
sys/net80211/ieee80211_ageq.c
197
struct mbuf *head, **phead;
sys/net80211/ieee80211_ageq.c
202
phead = &head;
sys/net80211/ieee80211_ageq.c
233
if (head == ohead && aq->aq_head != NULL) /* correct age */
sys/net80211/ieee80211_ageq.c
234
M_AGE_SET(aq->aq_head, M_AGE_GET(head));
sys/net80211/ieee80211_ageq.c
238
return head;
sys/net80211/ieee80211_power.c
140
if ((m = qhead->head) != NULL) {
sys/net80211/ieee80211_power.c
141
if ((qhead->head = m->m_nextpkt) == NULL)
sys/net80211/ieee80211_power.c
190
while ((m = qhead->head) != NULL) {
sys/net80211/ieee80211_power.c
191
qhead->head = m->m_nextpkt;
sys/net80211/ieee80211_power.c
242
while ((m = qhead->head) != NULL &&
sys/net80211/ieee80211_power.c
246
if ((qhead->head = m->m_nextpkt) == NULL)
sys/net80211/ieee80211_power.c
370
qhead->head = m;
sys/net80211/ieee80211_power.c
378
mh = psq->psq_head[0].head;
sys/net80211/ieee80211_power.c
382
mh = psq->psq_head[1].head;
sys/net80211/ieee80211_power.c
391
age -= M_AGE_GET(qhead->head);
sys/net80211/ieee80211_power.c
431
if (qhead->head != NULL) {
sys/net80211/ieee80211_power.c
435
parent_q = qhead->head;
sys/net80211/ieee80211_power.c
436
qhead->head = qhead->tail = NULL;
sys/net80211/ieee80211_power.c
441
if (qhead->head != NULL) {
sys/net80211/ieee80211_power.c
444
ifp_q = qhead->head;
sys/net80211/ieee80211_power.c
445
qhead->head = qhead->tail = NULL;
sys/net80211/ieee80211_power.h
56
struct mbuf *head;
sys/net80211/ieee80211_superg.c
612
ff_flush(struct mbuf *head, struct mbuf *last)
sys/net80211/ieee80211_superg.c
618
for (m = head; m != last; m = next) {
sys/net80211/ieee80211_superg.c
640
struct mbuf *m, *head;
sys/net80211/ieee80211_superg.c
649
KASSERT(sq->head != NULL, ("stageq empty"));
sys/net80211/ieee80211_superg.c
651
head = sq->head;
sys/net80211/ieee80211_superg.c
652
while ((m = sq->head) != NULL && M_AGE_GET(m) < quanta) {
sys/net80211/ieee80211_superg.c
660
sq->head = m->m_nextpkt;
sys/net80211/ieee80211_superg.c
670
ff_flush(head, m);
sys/net80211/ieee80211_superg.c
683
age -= M_AGE_GET(sq->head);
sys/net80211/ieee80211_superg.c
685
sq->head = m;
sys/net80211/ieee80211_superg.c
705
for (m = sq->head; m != NULL; m = m->m_nextpkt) {
sys/net80211/ieee80211_superg.c
708
sq->head = m->m_nextpkt;
sys/net80211/ieee80211_superg.c
950
struct mbuf *m, *next_m, *head;
sys/net80211/ieee80211_superg.c
954
head = NULL;
sys/net80211/ieee80211_superg.c
968
m->m_nextpkt = head;
sys/net80211/ieee80211_superg.c
969
head = m;
sys/net80211/ieee80211_superg.c
978
m = head;
sys/net80211/ieee80211_superg.h
61
struct mbuf *head; /* frames linked w/ m_nextpkt */
sys/netgraph/bluetooth/include/ng_bluetooth.h
103
(q)->head = (i); \
sys/netgraph/bluetooth/include/ng_bluetooth.h
113
(i) = (q)->head; \
sys/netgraph/bluetooth/include/ng_bluetooth.h
115
(q)->head = (q)->head->m_nextpkt; \
sys/netgraph/bluetooth/include/ng_bluetooth.h
116
if ((q)->head == NULL) \
sys/netgraph/bluetooth/include/ng_bluetooth.h
126
(i)->m_nextpkt = (q)->head; \
sys/netgraph/bluetooth/include/ng_bluetooth.h
130
(q)->head = (i); \
sys/netgraph/bluetooth/include/ng_bluetooth.h
67
struct mbuf *head; /* first item in the queue */
sys/netgraph/bluetooth/include/ng_bluetooth.h
78
(q)->head = NULL; \
sys/netgraph/bluetooth/include/ng_bluetooth.h
90
#define NG_BT_MBUFQ_FIRST(q) (q)->head
sys/netgraph/netflow/netflow.c
1108
TAILQ_FOREACH_SAFE(fle, &hsh->head, fle_hash, fle1) {
sys/netgraph/netflow/netflow.c
1125
TAILQ_REMOVE(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
1146
TAILQ_FOREACH_SAFE(fle, &hsh->head, fle_hash, fle1) {
sys/netgraph/netflow/netflow.c
1164
TAILQ_REMOVE(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
390
TAILQ_INSERT_TAIL(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
464
TAILQ_INSERT_TAIL(&hsh6->head, (struct flow_entry *)fle6, fle_hash);
sys/netgraph/netflow/netflow.c
500
TAILQ_INIT(&hsh->head);
sys/netgraph/netflow/netflow.c
511
TAILQ_INIT(&hsh->head);
sys/netgraph/netflow/netflow.c
586
TAILQ_FOREACH_SAFE(fle, &hsh->head, fle_hash, fle1) {
sys/netgraph/netflow/netflow.c
587
TAILQ_REMOVE(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
593
TAILQ_FOREACH_SAFE(fle, &hsh->head, fle_hash, fle1) {
sys/netgraph/netflow/netflow.c
594
TAILQ_REMOVE(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
726
TAILQ_FOREACH_REVERSE_SAFE(fle, &hsh->head, fhead, fle_hash, fle1) {
sys/netgraph/netflow/netflow.c
730
TAILQ_REMOVE(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
752
TAILQ_REMOVE(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
762
if (fle != TAILQ_LAST(&hsh->head, fhead)) {
sys/netgraph/netflow/netflow.c
763
TAILQ_REMOVE(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
764
TAILQ_INSERT_TAIL(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
845
TAILQ_FOREACH_REVERSE_SAFE(fle, &hsh->head, fhead, fle_hash, fle1) {
sys/netgraph/netflow/netflow.c
852
TAILQ_REMOVE(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
875
TAILQ_REMOVE(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
885
if (fle != TAILQ_LAST(&hsh->head, fhead)) {
sys/netgraph/netflow/netflow.c
886
TAILQ_REMOVE(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
887
TAILQ_INSERT_TAIL(&hsh->head, fle, fle_hash);
sys/netgraph/netflow/netflow.c
961
TAILQ_FOREACH(fle, &hsh->head, fle_hash) {
sys/netgraph/netflow/ng_netflow.h
491
TAILQ_HEAD(fhead, flow_entry) head;
sys/netgraph/ng_ksocket.c
1256
struct socket *const head = priv->so;
sys/netgraph/ng_ksocket.c
1266
SOLISTEN_LOCK(head);
sys/netgraph/ng_ksocket.c
1267
error = solisten_dequeue(head, &so, SOCK_NONBLOCK);
sys/netgraph/ng_pppoe.c
285
LIST_HEAD(hhead, sess_con) head;
sys/netgraph/ng_pppoe.c
553
LIST_FOREACH(tsp, &privp->sesshash[hash].head, sessions) {
sys/netgraph/ng_pppoe.c
559
LIST_INSERT_HEAD(&privp->sesshash[hash].head, sp, sessions);
sys/netgraph/ng_pppoe.c
578
LIST_INSERT_HEAD(&privp->sesshash[hash].head, sp, sessions);
sys/netgraph/ng_pppoe.c
603
LIST_FOREACH(sp, &privp->sesshash[hash].head, sessions) {
sys/netgraph/ng_pppoe.c
689
LIST_INIT(&privp->sesshash[i].head);
sys/netinet/in_fib.c
153
rn = rh->rnh_matchaddr((void *)&sin4, &rh->head);
sys/netinet/in_fib.c
230
rn = rh->rnh_matchaddr((void *)&sin4, &rh->head);
sys/netinet/in_fib.c
300
rn = rh->rnh_matchaddr((void *)&sin4, &rh->head);
sys/netinet/in_fib_algo.c
693
rn = rn_match((void *)&sin4, &rh->head);
sys/netinet/in_pcb.c
1999
struct inpcbhead *head;
sys/netinet/in_pcb.c
2004
head = &pcbinfo->ipi_hash_wild[INP_PCBHASH_WILD(lport,
sys/netinet/in_pcb.c
2006
CK_LIST_FOREACH(inp, head, inp_hash_wild) {
sys/netinet/in_pcb.c
2200
struct inpcbhead *head;
sys/netinet/in_pcb.c
2205
head = &pcbinfo->ipi_hash_exact[INP_PCBHASH(&faddr, lport, fport,
sys/netinet/in_pcb.c
2207
CK_LIST_FOREACH(inp, head, inp_hash_exact) {
sys/netinet/in_pcb.c
2246
struct inpcbhead *head;
sys/netinet/in_pcb.c
2252
head = &pcbinfo->ipi_hash_wild[INP_PCBHASH_WILD(lport,
sys/netinet/in_pcb.c
2254
CK_LIST_FOREACH(inp, head, inp_hash_wild) {
sys/netinet/in_pcb.c
2283
struct inpcbhead *head;
sys/netinet/in_pcb.c
2298
head = &pcbinfo->ipi_hash_wild[INP_PCBHASH_WILD(lport,
sys/netinet/in_pcb.c
2304
CK_LIST_FOREACH(inp, head, inp_hash_wild) {
sys/netinet/in_pcb.c
2750
struct inpcbhead *head;
sys/netinet/in_pcb.c
2788
head = &pcbinfo->ipi_hash_exact[hash];
sys/netinet/in_pcb.c
2789
CK_LIST_INSERT_HEAD(head, inp, inp_hash_exact);
sys/netinet/in_pcb.c
2791
head = &pcbinfo->ipi_hash_wild[hash];
sys/netinet/in_pcb.c
2792
CK_LIST_INSERT_HEAD(head, inp, inp_hash_wild);
sys/netinet/in_var.h
235
ip_mfilter_init(struct ip_mfilter_head *head)
sys/netinet/in_var.h
238
STAILQ_INIT(head);
sys/netinet/in_var.h
242
ip_mfilter_first(const struct ip_mfilter_head *head)
sys/netinet/in_var.h
245
return (STAILQ_FIRST(head));
sys/netinet/in_var.h
249
ip_mfilter_insert(struct ip_mfilter_head *head, struct in_mfilter *imf)
sys/netinet/in_var.h
252
STAILQ_INSERT_TAIL(head, imf, imf_entry);
sys/netinet/in_var.h
256
ip_mfilter_remove(struct ip_mfilter_head *head, struct in_mfilter *imf)
sys/netinet/in_var.h
259
STAILQ_REMOVE(head, imf, in_mfilter, imf_entry);
sys/netinet/in_var.h
262
#define IP_MFILTER_FOREACH(imf, head) \
sys/netinet/in_var.h
263
STAILQ_FOREACH(imf, head, imf_entry)
sys/netinet/in_var.h
266
ip_mfilter_count(struct ip_mfilter_head *head)
sys/netinet/in_var.h
271
STAILQ_FOREACH(imf, head, imf_entry)
sys/netinet/ip_encap.c
152
struct srcaddrtab_head *head;
sys/netinet/ip_encap.c
161
head = &ipv4_srcaddrtab;
sys/netinet/ip_encap.c
166
head = &ipv6_srcaddrtab;
sys/netinet/ip_encap.c
175
CK_LIST_FOREACH(p, head, chain) {
sys/netinet/ip_encap.c
183
encap_register_srcaddr(struct srcaddrtab_head *head, encap_srcaddr_t func,
sys/netinet/ip_encap.c
197
CK_LIST_FOREACH(tmp, head, chain) {
sys/netinet/ip_encap.c
202
CK_LIST_INSERT_HEAD(head, p, chain);
sys/netinet/ip_encap.c
213
encap_unregister_srcaddr(struct srcaddrtab_head *head,
sys/netinet/ip_encap.c
219
CK_LIST_FOREACH(p, head, chain) {
sys/netinet/ip_encap.c
233
encap_attach(struct encaptab_head *head, const struct encap_config *cfg,
sys/netinet/ip_encap.c
257
CK_LIST_FOREACH(tmp, head, chain) {
sys/netinet/ip_encap.c
262
CK_LIST_INSERT_HEAD(head, ep, chain);
sys/netinet/ip_encap.c
270
encap_detach(struct encaptab_head *head, const struct encaptab *cookie)
sys/netinet/ip_encap.c
275
CK_LIST_FOREACH(ep, head, chain) {
sys/netinet/ip_encap.c
289
encap_input(struct encaptab_head *head, struct mbuf *m, int off, int proto)
sys/netinet/ip_encap.c
300
CK_LIST_FOREACH(ep, head, chain) {
sys/netinet/ip_fw.h
1025
ipfw_obj_tlv head; /* TLV header */
sys/netinet/ip_fw.h
1059
ipfw_obj_tlv head;
sys/netinet/ip_fw.h
1066
ipfw_obj_tlv head; /* TLV header */
sys/netinet/ip_fw.h
1075
ipfw_obj_tlv head; /* TLV header */
sys/netinet/ip_fw.h
940
ipfw_obj_tlv head;
sys/netinet/ip_fw.h
946
ipfw_obj_tlv head; /* TLV header */
sys/netinet/ip_gre.c
126
struct gre_list *head;
sys/netinet/ip_gre.c
140
head = &gs->list;
sys/netinet/ip_gre.c
142
head = &GRE_HASH(src, dst);
sys/netinet/ip_gre.c
144
CK_LIST_FOREACH(tmp, head, chain) {
sys/netinet/ip_reass.c
206
struct ipqhead *head;
sys/netinet/ip_reass.c
290
head = &V_ipq[hash].head;
sys/netinet/ip_reass.c
297
TAILQ_FOREACH(fp, head, ipq_list)
sys/netinet/ip_reass.c
324
TAILQ_INSERT_HEAD(head, fp, ipq_list);
sys/netinet/ip_reass.c
339
if (fp == TAILQ_LAST(head, ipqhead))
sys/netinet/ip_reass.c
520
TAILQ_REMOVE(head, fp, ipq_list);
sys/netinet/ip_reass.c
597
fp = TAILQ_LAST(&bucket->head, ipqhead);
sys/netinet/ip_reass.c
604
fp = TAILQ_LAST(&bucket->head, ipqhead);
sys/netinet/ip_reass.c
617
if ((fp = TAILQ_LAST(&bucket->head, ipqhead)) != NULL) {
sys/netinet/ip_reass.c
638
resched = !TAILQ_EMPTY(&V_ipq[i].head);
sys/netinet/ip_reass.c
639
while(!TAILQ_EMPTY(&V_ipq[i].head)) {
sys/netinet/ip_reass.c
640
struct ipq *fp = TAILQ_FIRST(&V_ipq[i].head);
sys/netinet/ip_reass.c
693
TAILQ_INIT(&V_ipq[i].head);
sys/netinet/ip_reass.c
72
TAILQ_HEAD(ipqhead, ipq) head;
sys/netinet/ip_reass.c
751
TAILQ_FOREACH_SAFE(fp, &V_ipq[i].head, ipq_list, temp) {
sys/netinet/ip_reass.c
800
(fp = TAILQ_LAST(&V_ipq[i].head, ipqhead)) != NULL)
sys/netinet/ip_reass.c
816
fp = TAILQ_LAST(&V_ipq[i].head, ipqhead);
sys/netinet/ip_reass.c
901
fp = TAILQ_LAST(&V_ipq[bucket].head, ipqhead);
sys/netinet/ip_reass.c
912
TAILQ_REMOVE(&V_ipq[bucket].head, fp, ipq_list);
sys/netinet/ip_reass.c
940
TAILQ_REMOVE(&bucket->head, fp, ipq_list);
sys/netinet/libalias/alias_db.c
2020
struct server *head;
sys/netinet/libalias/alias_db.c
2025
head = lnk->server;
sys/netinet/libalias/alias_db.c
2026
if (head == NULL) {
sys/netinet/libalias/alias_db.c
2033
for (s = head; s->next != head; s = s->next)
sys/netinet/libalias/alias_db.c
2036
server->next = head;
sys/netinet/libalias/alias_db.c
507
struct server *head, *curr, *next;
sys/netinet/libalias/alias_db.c
509
head = curr = lnk->server;
sys/netinet/libalias/alias_db.c
513
} while ((curr = next) != head);
sys/netinet/sctp_input.c
1729
struct sctpasochead *head;
sys/netinet/sctp_input.c
1884
head = &SCTP_BASE_INFO(sctp_asochash)[SCTP_PCBHASH_ASOC(stcb->asoc.my_vtag,
sys/netinet/sctp_input.c
1890
LIST_INSERT_HEAD(head, stcb, sctp_asocs);
sys/netinet/sctp_input.c
680
struct sctpasochead *head;
sys/netinet/sctp_input.c
697
head = &SCTP_BASE_INFO(sctp_asochash)[SCTP_PCBHASH_ASOC(stcb->asoc.my_vtag, SCTP_BASE_INFO(hashasocmark))];
sys/netinet/sctp_input.c
702
LIST_INSERT_HEAD(head, stcb, sctp_asocs);
sys/netinet/sctp_input.c
717
head = &SCTP_BASE_INFO(sctp_asochash)[SCTP_PCBHASH_ASOC(stcb->asoc.my_vtag, SCTP_BASE_INFO(hashasocmark))];
sys/netinet/sctp_input.c
722
LIST_INSERT_HEAD(head, stcb, sctp_asocs);
sys/netinet/sctp_pcb.c
1147
struct sctpasochead *head;
sys/netinet/sctp_pcb.c
1311
head = &inp->sctp_tcbhash[SCTP_PCBHASH_ALLADDR(rport,
sys/netinet/sctp_pcb.c
1313
LIST_FOREACH(stcb, head, sctp_tcbhash) {
sys/netinet/sctp_pcb.c
1430
struct sctpasochead *head;
sys/netinet/sctp_pcb.c
1439
head = &inp->sctp_asocidhash[SCTP_PCBHASH_ASOC(id, inp->hashasocidmark)];
sys/netinet/sctp_pcb.c
1440
if (head == NULL) {
sys/netinet/sctp_pcb.c
1445
LIST_FOREACH(stcb, head, sctp_tcbasocidhash) {
sys/netinet/sctp_pcb.c
1482
sctp_endpoint_probe(struct sockaddr *nam, struct sctppcbhead *head,
sys/netinet/sctp_pcb.c
1518
if (head == NULL)
sys/netinet/sctp_pcb.c
1521
LIST_FOREACH(inp, head, sctp_hash) {
sys/netinet/sctp_pcb.c
1605
LIST_FOREACH(inp, head, sctp_hash) {
sys/netinet/sctp_pcb.c
1677
struct sctppcbhead *head;
sys/netinet/sctp_pcb.c
1681
head = &SCTP_BASE_INFO(sctp_ephash)[SCTP_PCBHASH_ALLADDR(lport,
sys/netinet/sctp_pcb.c
1683
LIST_FOREACH(t_inp, head, sctp_hash) {
sys/netinet/sctp_pcb.c
1726
struct sctppcbhead *head;
sys/netinet/sctp_pcb.c
1740
head = &SCTP_BASE_INFO(sctp_ephash)[SCTP_PCBHASH_ALLADDR(inp->sctp_lport,
sys/netinet/sctp_pcb.c
1743
LIST_FOREACH_SAFE(tinp, head, sctp_hash, ninp) {
sys/netinet/sctp_pcb.c
1758
head = &SCTP_BASE_INFO(sctp_tcpephash)[SCTP_PCBHASH_ALLADDR(tinp->sctp_lport, SCTP_BASE_INFO(hashtcpmark))];
sys/netinet/sctp_pcb.c
1760
LIST_INSERT_HEAD(head, tinp, sctp_hash);
sys/netinet/sctp_pcb.c
1767
head = &SCTP_BASE_INFO(sctp_ephash)[SCTP_PCBHASH_ALLADDR(inp->sctp_lport, SCTP_BASE_INFO(hashmark))];
sys/netinet/sctp_pcb.c
1768
LIST_INSERT_HEAD(head, inp, sctp_hash);
sys/netinet/sctp_pcb.c
1781
struct sctppcbhead *head;
sys/netinet/sctp_pcb.c
1816
head = &SCTP_BASE_INFO(sctp_ephash)[SCTP_PCBHASH_ALLADDR(lport,
sys/netinet/sctp_pcb.c
1818
inp = sctp_endpoint_probe(nam, head, lport, vrf_id);
sys/netinet/sctp_pcb.c
1832
head = &SCTP_BASE_INFO(sctp_tcpephash)[i];
sys/netinet/sctp_pcb.c
1833
inp = sctp_endpoint_probe(nam, head, lport, vrf_id);
sys/netinet/sctp_pcb.c
2006
struct sctpasochead *head;
sys/netinet/sctp_pcb.c
2011
head = &SCTP_BASE_INFO(sctp_asochash)[SCTP_PCBHASH_ASOC(vtag,
sys/netinet/sctp_pcb.c
2013
LIST_FOREACH(stcb, head, sctp_asocs) {
sys/netinet/sctp_pcb.c
2501
struct sctppcbhead *head;
sys/netinet/sctp_pcb.c
2553
head = &SCTP_BASE_INFO(sctp_tcpephash)[SCTP_PCBHASH_ALLADDR((lport | rport), SCTP_BASE_INFO(hashtcpmark))];
sys/netinet/sctp_pcb.c
2555
LIST_INSERT_HEAD(head, new_inp, sctp_hash);
sys/netinet/sctp_pcb.c
2714
struct sctppcbhead *head;
sys/netinet/sctp_pcb.c
3090
head = &SCTP_BASE_INFO(sctp_tcpephash)[SCTP_PCBHASH_ALLADDR(lport, SCTP_BASE_INFO(hashtcpmark))];
sys/netinet/sctp_pcb.c
3093
head = &SCTP_BASE_INFO(sctp_ephash)[SCTP_PCBHASH_ALLADDR(lport, SCTP_BASE_INFO(hashmark))];
sys/netinet/sctp_pcb.c
3096
LIST_INSERT_HEAD(head, inp, sctp_hash);
sys/netinet/sctp_pcb.c
3098
(void *)head, ntohs(lport), port_reuse_active);
sys/netinet/sctp_pcb.c
4023
struct sctpasochead *head;
sys/netinet/sctp_pcb.c
4044
head = &inp->sctp_asocidhash[SCTP_PCBHASH_ASOC(id, inp->hashasocidmark)];
sys/netinet/sctp_pcb.c
4045
LIST_INSERT_HEAD(head, stcb, sctp_tcbasocidhash);
sys/netinet/sctp_pcb.c
4066
struct sctpasochead *head;
sys/netinet/sctp_pcb.c
4226
head = &SCTP_BASE_INFO(sctp_asochash)[SCTP_PCBHASH_ASOC(stcb->asoc.my_vtag, SCTP_BASE_INFO(hashasocmark))];
sys/netinet/sctp_pcb.c
4228
LIST_INSERT_HEAD(head, stcb, sctp_asocs);
sys/netinet/sctp_pcb.c
4265
head = &inp->sctp_tcbhash[SCTP_PCBHASH_ALLADDR(stcb->rport,
sys/netinet/sctp_pcb.c
4267
LIST_INSERT_HEAD(head, stcb, sctp_tcbhash);
sys/netinet/sctp_pcb.c
6605
struct sctpasochead *head;
sys/netinet/sctp_pcb.c
6610
head = &SCTP_BASE_INFO(sctp_asochash)[SCTP_PCBHASH_ASOC(tag, SCTP_BASE_INFO(hashasocmark))];
sys/netinet/sctp_pcb.c
6611
LIST_FOREACH(stcb, head, sctp_asocs) {
sys/netinet/sctp_peeloff.c
48
sctp_can_peel_off(struct socket *head, sctp_assoc_t assoc_id)
sys/netinet/sctp_peeloff.c
54
if (head == NULL) {
sys/netinet/sctp_peeloff.c
58
inp = (struct sctp_inpcb *)head->so_pcb;
sys/netinet/sctp_peeloff.c
86
sctp_do_peeloff(struct socket *head, struct socket *so, sctp_assoc_t assoc_id)
sys/netinet/sctp_peeloff.c
92
inp = (struct sctp_inpcb *)head->so_pcb;
sys/netinet/sctp_syscalls.c
149
struct socket *head, *so;
sys/netinet/sctp_syscalls.c
161
head = headfp->f_data;
sys/netinet/sctp_syscalls.c
162
if (head->so_proto->pr_protocol != IPPROTO_SCTP) {
sys/netinet/sctp_syscalls.c
166
error = sctp_can_peel_off(head, (sctp_assoc_t)uap->name);
sys/netinet/sctp_syscalls.c
180
CURVNET_SET(head->so_vnet);
sys/netinet/sctp_syscalls.c
181
switch (head->so_proto->pr_domain->dom_family) {
sys/netinet/sctp_syscalls.c
184
so = sopeeloff(head, &sctp_stream_protosw);
sys/netinet/sctp_syscalls.c
189
so = sopeeloff(head, &sctp6_stream_protosw);
sys/netinet/sctp_syscalls.c
201
error = sctp_do_peeloff(head, so, (sctp_assoc_t)uap->name);
sys/netinet/sctp_syscalls.c
204
if (head->so_sigio != NULL)
sys/netinet/sctp_syscalls.c
205
fsetown(fgetown(&head->so_sigio), &so->so_sigio);
sys/netinet/tcp_hostcache.c
756
struct hc_head *head;
sys/netinet/tcp_hostcache.c
761
head = &V_tcp_hostcache.hashbase[i];
sys/netinet/tcp_hostcache.c
763
THC_LOCK(head);
sys/netinet/tcp_hostcache.c
764
CK_SLIST_FOREACH_SAFE(hc_entry, &head->hch_bucket, hc_q,
sys/netinet/tcp_hostcache.c
766
KASSERT(head->hch_length > 0 && head->hch_length <=
sys/netinet/tcp_hostcache.c
769
head->hch_length));
sys/netinet/tcp_hostcache.c
780
CK_SLIST_FIRST(&head->hch_bucket),
sys/netinet/tcp_hostcache.c
783
CK_SLIST_REMOVE_HEAD(&head->hch_bucket,
sys/netinet/tcp_hostcache.c
787
head->hch_length--;
sys/netinet/tcp_hostcache.c
795
THC_UNLOCK(head);
sys/netinet/tcp_hpts.c
1062
if (TAILQ_EMPTY(&hpts->p_hptss[t].head) == 0) {
sys/netinet/tcp_hpts.c
1162
TAILQ_FOREACH(tp, &hpts->p_hptss[hpts->p_nxt_slot].head,
sys/netinet/tcp_hpts.c
1179
TAILQ_CONCAT(&hpts->p_hptss[hpts->p_runningslot].head,
sys/netinet/tcp_hpts.c
1180
&hpts->p_hptss[hpts->p_nxt_slot].head, t_hpts);
sys/netinet/tcp_hpts.c
1200
TAILQ_HEAD(, tcpcb) head = TAILQ_HEAD_INITIALIZER(head);
sys/netinet/tcp_hpts.c
1213
TAILQ_SWAP(&head, &hptsh->head, tcpcb, t_hpts);
sys/netinet/tcp_hpts.c
1220
TAILQ_FOREACH_SAFE(tp, &head, t_hpts, ntp) {
sys/netinet/tcp_hpts.c
1921
TAILQ_INIT(&hpts->p_hptss[j].head);
sys/netinet/tcp_hpts.c
526
TAILQ_INSERT_TAIL(&hptsh->head, tp, t_hpts);
sys/netinet/tcp_hpts.c
592
TAILQ_REMOVE(&hptsh->head, tp, t_hpts);
sys/netinet/tcp_hpts.c
606
TAILQ_FOREACH(tmp, &hptsh->head, t_hpts)
sys/netinet/tcp_hpts_internal.h
128
TAILQ_HEAD(, tcpcb) head;
sys/netinet/tcp_log_buf.c
1170
tcp_log_free_entries(struct tcp_log_stailq *head, int *count)
sys/netinet/tcp_log_buf.c
1175
while ((log_entry = STAILQ_FIRST(head)) != NULL) {
sys/netinet/tcp_log_buf.c
1176
STAILQ_REMOVE_HEAD(head, tlm_queue);
sys/netinet/tcp_stacks/tailq_hash.h
63
#define TQHASH_FOREACH(var, head) \
sys/netinet/tcp_stacks/tailq_hash.h
64
for ((var) = tqhash_min((head)); \
sys/netinet/tcp_stacks/tailq_hash.h
66
(var) = tqhash_next((head), (var)))
sys/netinet/tcp_stacks/tailq_hash.h
68
#define TQHASH_FOREACH_FROM(var, head, fvar) \
sys/netinet/tcp_stacks/tailq_hash.h
69
for ((var) = ((fvar) ? (fvar) : tqhash_min((head))); \
sys/netinet/tcp_stacks/tailq_hash.h
71
(var) = tqhash_next((head), (var)))
sys/netinet/tcp_stacks/tailq_hash.h
73
#define TQHASH_FOREACH_REVERSE_FROM(var, head) \
sys/netinet/tcp_stacks/tailq_hash.h
74
for ((var) = ((var) ? (var) : tqhash_max((head))); \
sys/netinet/tcp_stacks/tailq_hash.h
76
(var) = tqhash_prev((head), (var)))
sys/netinet6/frag6.c
351
struct ip6qhead *head;
sys/netinet6/frag6.c
372
head = IP6QB_HEAD(bucket);
sys/netinet6/frag6.c
374
TAILQ_FOREACH(q6, head, ip6q_tq) {
sys/netinet6/frag6.c
425
struct ip6qhead *head;
sys/netinet6/frag6.c
566
head = IP6QB_HEAD(bucket);
sys/netinet6/frag6.c
568
TAILQ_FOREACH(q6, head, ip6q_tq)
sys/netinet6/frag6.c
620
TAILQ_INSERT_HEAD(head, q6, ip6q_tq);
sys/netinet6/frag6.c
935
struct ip6qhead *head;
sys/netinet6/frag6.c
949
head = IP6QB_HEAD(bucket);
sys/netinet6/frag6.c
950
TAILQ_FOREACH_SAFE(q6, head, ip6q_tq, q6tmp)
sys/netinet6/frag6.c
969
(q6 = TAILQ_LAST(head, ip6qhead)) != NULL) {
sys/netinet6/in6_fib.c
162
rn = rh->rnh_matchaddr((void *)&sin6, &rh->head);
sys/netinet6/in6_fib.c
244
rn = rh->rnh_matchaddr((void *)&sin6, &rh->head);
sys/netinet6/in6_fib.c
315
rn = rh->rnh_matchaddr((void *)&sin6, &rh->head);
sys/netinet6/in6_fib_algo.c
265
rn = rn_match((void *)&sin6, &rh->head);
sys/netinet6/in6_pcb.c
1018
struct inpcbhead *head;
sys/netinet6/in6_pcb.c
1024
head = &pcbinfo->ipi_hash_wild[INP_PCBHASH_WILD(lport,
sys/netinet6/in6_pcb.c
1026
CK_LIST_FOREACH(inp, head, inp_hash_wild) {
sys/netinet6/in6_pcb.c
1056
struct inpcbhead *head;
sys/netinet6/in6_pcb.c
1068
head = &pcbinfo->ipi_hash_wild[INP_PCBHASH_WILD(lport,
sys/netinet6/in6_pcb.c
1071
CK_LIST_FOREACH(inp, head, inp_hash_wild) {
sys/netinet6/in6_pcb.c
714
struct inpcbhead *head;
sys/netinet6/in6_pcb.c
719
head = &pcbinfo->ipi_hash_wild[INP_PCBHASH_WILD(lport,
sys/netinet6/in6_pcb.c
721
CK_LIST_FOREACH(inp, head, inp_hash_wild) {
sys/netinet6/in6_pcb.c
969
struct inpcbhead *head;
sys/netinet6/in6_pcb.c
977
head = &pcbinfo->ipi_hash_exact[INP6_PCBHASH(faddr, lport, fport,
sys/netinet6/in6_pcb.c
979
CK_LIST_FOREACH(inp, head, inp_hash_exact) {
sys/netinet6/in6_var.h
642
ip6_mfilter_init(struct ip6_mfilter_head *head)
sys/netinet6/in6_var.h
645
STAILQ_INIT(head);
sys/netinet6/in6_var.h
649
ip6_mfilter_first(const struct ip6_mfilter_head *head)
sys/netinet6/in6_var.h
652
return (STAILQ_FIRST(head));
sys/netinet6/in6_var.h
656
ip6_mfilter_insert(struct ip6_mfilter_head *head, struct in6_mfilter *imf)
sys/netinet6/in6_var.h
659
STAILQ_INSERT_TAIL(head, imf, im6f_entry);
sys/netinet6/in6_var.h
663
ip6_mfilter_remove(struct ip6_mfilter_head *head, struct in6_mfilter *imf)
sys/netinet6/in6_var.h
666
STAILQ_REMOVE(head, imf, in6_mfilter, im6f_entry);
sys/netinet6/in6_var.h
669
#define IP6_MFILTER_FOREACH(imf, head) \
sys/netinet6/in6_var.h
670
STAILQ_FOREACH(imf, head, im6f_entry)
sys/netinet6/in6_var.h
673
ip6_mfilter_count(struct ip6_mfilter_head *head)
sys/netinet6/in6_var.h
678
STAILQ_FOREACH(imf, head, im6f_entry)
sys/netinet6/ip6_gre.c
117
struct gre_list *head;
sys/netinet6/ip6_gre.c
131
head = &gs->list;
sys/netinet6/ip6_gre.c
133
head = &GRE_HASH(src, dst);
sys/netinet6/ip6_gre.c
135
CK_LIST_FOREACH(tmp, head, chain) {
sys/netlink/route/rt.c
651
rt = (const struct rtentry *)rnh->rnh_matchaddr(dst, &rnh->head);
sys/netpfil/ipfilter/netinet/fil.c
3479
ipf_group_add(ipf_main_softc_t *softc, char *group, void *head, u_32_t flags,
sys/netpfil/ipfilter/netinet/fil.c
3496
if (fg->fg_head == NULL && head != NULL)
sys/netpfil/ipfilter/netinet/fil.c
3497
fg->fg_head = head;
sys/netpfil/ipfilter/netinet/fil.c
3508
fg->fg_head = head;
sys/netpfil/ipfilter/netinet/fil.c
8965
ipf_apply_timeout(ipftq_t *head, u_int seconds)
sys/netpfil/ipfilter/netinet/fil.c
8971
MUTEX_ENTER(&head->ifq_lock);
sys/netpfil/ipfilter/netinet/fil.c
8972
oldtimeout = head->ifq_ttl;
sys/netpfil/ipfilter/netinet/fil.c
8976
head->ifq_ttl = newtimeout;
sys/netpfil/ipfilter/netinet/fil.c
8978
for (tqe = head->ifq_head; tqe != NULL; tqe = tqe->tqe_next) {
sys/netpfil/ipfilter/netinet/fil.c
8981
MUTEX_EXIT(&head->ifq_lock);
sys/netpfil/ipfilter/netinet/fil.c
9813
ipf_rb_ht_init(host_track_t *head)
sys/netpfil/ipfilter/netinet/fil.c
9815
RBI_INIT(ipf_rb, &head->ht_root);
sys/netpfil/ipfilter/netinet/fil.c
9843
ipf_rb_ht_flush(host_track_t *head)
sys/netpfil/ipfilter/netinet/fil.c
9845
RBI_WALK(ipf_rb, &head->ht_root, ipf_rb_ht_freenode, NULL);
sys/netpfil/ipfilter/netinet/ipf_rb.h
113
rotate_left(head, node); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
118
rotate_right(head, gparent); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
130
rotate_right(head, node); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
135
rotate_left(head, parent->_f.parent); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
140
head->top._f.right->_f.colour = C_BLACK; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
141
head->count++; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
145
deleteblack(struct _n##_rb_head *head, _t *parent, _t *node) \
sys/netpfil/ipfilter/netinet/ipf_rb.h
150
node != &head->top) { \
sys/netpfil/ipfilter/netinet/ipf_rb.h
156
rotate_left(head, parent); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
174
rotate_right(head, tmp); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
181
rotate_left(head, parent); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
182
node = head->top._f.right; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
189
rotate_right(head, parent); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
207
rotate_left(head, tmp); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
214
rotate_right(head, parent); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
215
node = head->top._f.right; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
225
_n##_rb_delete(struct _n##_rb_head *head, _t *node) \
sys/netpfil/ipfilter/netinet/ipf_rb.h
249
head->top._f.right = child; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
260
head->top._f.right = child; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
280
head->top._f.right = child; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
284
deleteblack(head, parent, node); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
285
head->count--; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
290
_n##_rb_init(struct _n##_rb_head *head) \
sys/netpfil/ipfilter/netinet/ipf_rb.h
292
memset(head, 0, sizeof(*head)); \
sys/netpfil/ipfilter/netinet/ipf_rb.h
294
head->top._f.left = &_n##_rb_zero; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
295
head->top._f.right = &_n##_rb_zero; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
296
head->top._f.parent = &head->top; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
303
_n##_rb_walktree(struct _n##_rb_head *head, _n##_rb_walker_t func, void *arg)\
sys/netpfil/ipfilter/netinet/ipf_rb.h
307
_t *node = head->top._f.right; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
336
_n##_rb_search(struct _n##_rb_head *head, void *key) \
sys/netpfil/ipfilter/netinet/ipf_rb.h
340
node = head->top._f.right; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
38
rotate_left(struct _n##_rb_head *head, _t *node) \
sys/netpfil/ipfilter/netinet/ipf_rb.h
49
head->top._f.right = tmp1; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
60
rotate_right(struct _n##_rb_head *head, _t *node) \
sys/netpfil/ipfilter/netinet/ipf_rb.h
71
head->top._f.right = tmp1; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
82
_n##_rb_insert(struct _n##_rb_head *head, _t *node) \
sys/netpfil/ipfilter/netinet/ipf_rb.h
86
parent = &head->top; \
sys/netpfil/ipfilter/netinet/ipf_rb.h
89
p = &head->top._f.right; \
sys/netpfil/ipfilter/netinet/radix_ipf.c
1010
ipf_rdx_head_t *head = arg;
sys/netpfil/ipfilter/netinet/radix_ipf.c
1015
rv = ipf_rx_delete(head, &stp->dst, &stp->mask);
sys/netpfil/ipfilter/netinet/radix_ipf.c
1390
checktree(ipf_rdx_head_t *head)
sys/netpfil/ipfilter/netinet/radix_ipf.c
1411
dumptree(head);
sys/netpfil/ipfilter/netinet/radix_ipf.c
1412
ipf_rx_walktree(head, nodeprinter, NULL);
sys/netpfil/ipfilter/netinet/radix_ipf.c
177
ipf_rx_match(ipf_rdx_head_t *head, addrfamily_t *addr)
sys/netpfil/ipfilter/netinet/radix_ipf.c
192
node = ipf_rx_find_addr(head->root, (u_32_t *)addr);
sys/netpfil/ipfilter/netinet/radix_ipf.c
246
ipf_rx_lookup(ipf_rdx_head_t *head, addrfamily_t *addr, addrfamily_t *mask)
sys/netpfil/ipfilter/netinet/radix_ipf.c
253
found = ipf_rx_find_addr(head->root, (u_32_t *)addr);
sys/netpfil/ipfilter/netinet/radix_ipf.c
321
ipf_rx_insert(ipf_rdx_head_t *head, ipf_rdx_node_t nodes[2], int *dup)
sys/netpfil/ipfilter/netinet/radix_ipf.c
342
node = ipf_rx_find_addr(head->root, addr);
sys/netpfil/ipfilter/netinet/radix_ipf.c
376
cur = head->root;
sys/netpfil/ipfilter/netinet/radix_ipf.c
498
ipf_rx_addroute(ipf_rdx_head_t *head, addrfamily_t *addr, addrfamily_t *mask,
sys/netpfil/ipfilter/netinet/radix_ipf.c
507
x = ipf_rx_insert(head, nodes, &dup);
sys/netpfil/ipfilter/netinet/radix_ipf.c
569
ipf_rx_delete(ipf_rdx_head_t *head, addrfamily_t *addr, addrfamily_t *mask)
sys/netpfil/ipfilter/netinet/radix_ipf.c
580
found = ipf_rx_find_addr(head->root, (u_32_t *)addr);
sys/netpfil/ipfilter/netinet/radix_ipf.c
748
ipf_rx_walktree(ipf_rdx_head_t *head, radix_walk_func_t walker, void *arg)
sys/netpfil/ipfilter/netinet/radix_ipf.c
751
ipf_rdx_node_t *node = head->root;
sys/netpfil/ipfilter/netinet/radix_ipf.c
846
ipf_rx_freehead(ipf_rdx_head_t *head)
sys/netpfil/ipfilter/netinet/radix_ipf.c
848
KFREE(head);
sys/netpfil/ipfw/dn_aqm_codel.c
195
next: m = q->mq.head;
sys/netpfil/ipfw/dn_aqm_codel.c
198
q->mq.head = m->m_nextpkt;
sys/netpfil/ipfw/dn_aqm_pie.c
331
next: m = q->mq.head;
sys/netpfil/ipfw/dn_aqm_pie.c
334
q->mq.head = m->m_nextpkt;
sys/netpfil/ipfw/dn_sched.h
174
m = q->mq.head;
sys/netpfil/ipfw/dn_sched.h
182
q->mq.head = m->m_nextpkt;
sys/netpfil/ipfw/dn_sched_fifo.c
97
dn_free_pkts(q->mq.head);
sys/netpfil/ipfw/dn_sched_fq_codel.c
157
struct mbuf *m = q->mq.head;
sys/netpfil/ipfw/dn_sched_fq_codel.c
161
q->mq.head = m->m_nextpkt;
sys/netpfil/ipfw/dn_sched_fq_codel.h
141
next: m = q->mq.head;
sys/netpfil/ipfw/dn_sched_fq_codel.h
144
q->mq.head = m->m_nextpkt;
sys/netpfil/ipfw/dn_sched_fq_pie.c
341
next: m = q->mq.head;
sys/netpfil/ipfw/dn_sched_fq_pie.c
344
q->mq.head = m->m_nextpkt;
sys/netpfil/ipfw/dn_sched_fq_pie.c
767
struct mbuf *m = q->mq.head;
sys/netpfil/ipfw/dn_sched_fq_pie.c
771
q->mq.head = m->m_nextpkt;
sys/netpfil/ipfw/dn_sched_prio.c
132
if (q->mq.head == NULL) {
sys/netpfil/ipfw/dn_sched_prio.c
170
if (q->mq.head == NULL)
sys/netpfil/ipfw/dn_sched_prio.c
185
oldq->mq.tail->m_nextpkt = q->mq.head;
sys/netpfil/ipfw/dn_sched_prio.c
191
q->mq.tail = q->mq.head = NULL;
sys/netpfil/ipfw/dn_sched_qfq.c
529
if (cl->_q.mq.head == NULL) {
sys/netpfil/ipfw/dn_sched_qfq.c
535
len = cl->_q.mq.head->m_pkthdr.len;
sys/netpfil/ipfw/dn_sched_qfq.c
665
if (m != _q->mq.head) {
sys/netpfil/ipfw/dn_sched_qfq.c
669
if (m != _q->mq.head)
sys/netpfil/ipfw/dn_sched_rr.c
101
if (si->head == NULL)
sys/netpfil/ipfw/dn_sched_rr.c
103
si->head->status = 0;
sys/netpfil/ipfw/dn_sched_rr.c
105
if (si->head == si->tail) {
sys/netpfil/ipfw/dn_sched_rr.c
106
si->head = si->tail = NULL;
sys/netpfil/ipfw/dn_sched_rr.c
110
si->head = si->head->qnext;
sys/netpfil/ipfw/dn_sched_rr.c
111
si->tail->qnext = si->head;
sys/netpfil/ipfw/dn_sched_rr.c
124
if (q == si->head) {
sys/netpfil/ipfw/dn_sched_rr.c
129
for (prev = si->head; prev; prev = prev->qnext) {
sys/netpfil/ipfw/dn_sched_rr.c
143
if (si->head == NULL)
sys/netpfil/ipfw/dn_sched_rr.c
146
si->head = si->head->qnext;
sys/netpfil/ipfw/dn_sched_rr.c
156
if (m != q->mq.head) {
sys/netpfil/ipfw/dn_sched_rr.c
159
if (m != q->mq.head)
sys/netpfil/ipfw/dn_sched_rr.c
184
while ( (rrq = si->head) ) {
sys/netpfil/ipfw/dn_sched_rr.c
185
struct mbuf *m = rrq->q.mq.head;
sys/netpfil/ipfw/dn_sched_rr.c
228
si->head = si->tail = NULL;
sys/netpfil/ipfw/dn_sched_rr.c
273
if (_q->mq.head != NULL) {
sys/netpfil/ipfw/dn_sched_rr.c
78
struct rr_queue *head, *tail; /* Pointer to current queue */
sys/netpfil/ipfw/dn_sched_rr.c
89
if (si->head == NULL)
sys/netpfil/ipfw/dn_sched_rr.c
90
si->head = q;
sys/netpfil/ipfw/dn_sched_rr.c
94
q->qnext = si->head; /* make it circular */
sys/netpfil/ipfw/dn_sched_wf2q.c
143
if (m != q->mq.head) {
sys/netpfil/ipfw/dn_sched_wf2q.c
146
if (m != q->mq.head) /* queue was already busy */
sys/netpfil/ipfw/dn_sched_wf2q.c
251
if (q->mq.head == 0) { /* not backlogged any more. */
sys/netpfil/ipfw/dn_sched_wf2q.c
255
uint64_t len = q->mq.head->m_pkthdr.len;
sys/netpfil/ipfw/dn_sched_wf2q.c
314
if (_q->mq.head != NULL) {
sys/netpfil/ipfw/dn_sched_wf2q.c
315
wf2qp_enqueue(_q->_si, _q, _q->mq.head);
sys/netpfil/ipfw/ip_dn_io.c
287
if (q->head == NULL)
sys/netpfil/ipfw/ip_dn_io.c
288
q->head = m;
sys/netpfil/ipfw/ip_dn_io.c
571
while ((m = dline->mq.head) != NULL) {
sys/netpfil/ipfw/ip_dn_io.c
575
dline->mq.head = m->m_nextpkt;
sys/netpfil/ipfw/ip_dn_io.c
623
int delay_line_idle = (si->dline.mq.head == NULL);
sys/netpfil/ipfw/ip_dn_io.c
629
q->head = NULL;
sys/netpfil/ipfw/ip_dn_io.c
673
return q->head;
sys/netpfil/ipfw/ip_dn_io.c
760
if (q.head != NULL)
sys/netpfil/ipfw/ip_dn_io.c
761
dummynet_send(q.head);
sys/netpfil/ipfw/ip_dn_private.h
482
if (q->head == NULL)
sys/netpfil/ipfw/ip_dn_private.h
483
q->head = m;
sys/netpfil/ipfw/ip_dn_private.h
81
struct mbuf *head, *tail;
sys/netpfil/ipfw/ip_dummynet.c
2366
if ((si->kflags & DN_ACTIVE) || si->dline.mq.head != NULL)
sys/netpfil/ipfw/ip_dummynet.c
410
if (q->mq.head)
sys/netpfil/ipfw/ip_dummynet.c
411
dn_free_pkts(q->mq.head);
sys/netpfil/ipfw/ip_dummynet.c
580
dn_free_pkts(dl->mq.head); /* drain delay line */
sys/netpfil/ipfw/ip_fw_compat.c
103
ipfw_obj_tlv head; /* TLV header */
sys/netpfil/ipfw/ip_fw_compat.c
112
ipfw_obj_tlv head; /* TLV header */
sys/netpfil/ipfw/ip_fw_compat.c
133
ipfw_obj_tlv head; /* TLV header */
sys/netpfil/ipfw/ip_fw_compat.c
243
if (ctlv->head.type == IPFW_TLV_TBLNAME_LIST) {
sys/netpfil/ipfw/ip_fw_compat.c
245
clen = ctlv->head.length;
sys/netpfil/ipfw/ip_fw_compat.c
250
count = (ctlv->head.length - sizeof(*ctlv)) / sizeof(*ntlv);
sys/netpfil/ipfw/ip_fw_compat.c
261
if (ntlv->head.length != sizeof(ipfw_obj_ntlv_v0))
sys/netpfil/ipfw/ip_fw_compat.c
277
read += ctlv->head.length;
sys/netpfil/ipfw/ip_fw_compat.c
278
ctlv = (ipfw_obj_ctlv *)((caddr_t)ctlv + ctlv->head.length);
sys/netpfil/ipfw/ip_fw_compat.c
285
if (ctlv->head.type == IPFW_TLV_RULE_LIST) {
sys/netpfil/ipfw/ip_fw_compat.c
286
clen = ctlv->head.length;
sys/netpfil/ipfw/ip_fw_compat.c
343
read += ctlv->head.length;
sys/netpfil/ipfw/ip_fw_compat.c
344
ctlv = (ipfw_obj_ctlv *)((caddr_t)ctlv + ctlv->head.length);
sys/netpfil/ipfw/ip_fw_compat.c
505
if (rt->head.length != sizeof(*rt))
sys/netpfil/ipfw/ip_fw_compat.c
514
crt->head = rt->head;
sys/netpfil/ipfw/ip_fw_compat.c
515
crt->head.length = sizeof(*crt);
sys/netpfil/ipfw/ip_fw_compat.c
98
ipfw_obj_tlv head;
sys/netpfil/ipfw/ip_fw_dynamic.c
2712
#define DYN_RELINK_STATES(s, hval, i, head, ohead) do { \
sys/netpfil/ipfw/ip_fw_dynamic.c
2715
CK_SLIST_INSERT_HEAD(&head[DYN_BUCKET(s->hval, new)], \
sys/netpfil/ipfw/ip_fw_dynamic.c
3109
ctlv->head.type = IPFW_TLV_DYNSTATE_LIST;
sys/netpfil/ipfw/ip_fw_dynamic.c
3120
dst->head.length = sizeof(ipfw_obj_dyntlv); \
sys/netpfil/ipfw/ip_fw_dynamic.c
3121
dst->head.type = IPFW_TLV_DYN_ENT; \
sys/netpfil/ipfw/ip_fw_dynamic.c
3136
last->head.flags = IPFW_DF_LAST; /* XXX: unused */
sys/netpfil/ipfw/ip_fw_nat.c
158
del_redir_spool_cfg(struct cfg_nat *n, struct redir_chain *head)
sys/netpfil/ipfw/ip_fw_nat.c
164
LIST_FOREACH_SAFE(r, head, _next, tmp_r) {
sys/netpfil/ipfw/ip_fw_nat.c
586
if (oh->ntlv.head.length != sizeof(oh->ntlv))
sys/netpfil/ipfw/ip_fw_nat.c
629
if (oh->ntlv.head.length != sizeof(oh->ntlv))
sys/netpfil/ipfw/ip_fw_nat.c
695
if (oh->ntlv.head.length != sizeof(oh->ntlv))
sys/netpfil/ipfw/ip_fw_nat.c
836
if (oh->ntlv.head.length != sizeof(oh->ntlv))
sys/netpfil/ipfw/ip_fw_sockopt.c
1014
if (rt->head.length != sizeof(*rt))
sys/netpfil/ipfw/ip_fw_sockopt.c
1209
if (rh->range.head.length != sizeof(ipfw_range_tlv))
sys/netpfil/ipfw/ip_fw_sockopt.c
1714
ntlv->head.type = no->etlv;
sys/netpfil/ipfw/ip_fw_sockopt.c
1715
ntlv->head.length = sizeof(*ntlv);
sys/netpfil/ipfw/ip_fw_sockopt.c
1773
ctlv->head.type = IPFW_TLV_TBLNAME_LIST;
sys/netpfil/ipfw/ip_fw_sockopt.c
1774
ctlv->head.length = da->tcount * sizeof(ipfw_obj_ntlv) +
sys/netpfil/ipfw/ip_fw_sockopt.c
1806
ctlv->head.type = IPFW_TLV_RULE_LIST;
sys/netpfil/ipfw/ip_fw_sockopt.c
1807
ctlv->head.length = da->rsize + sizeof(*ctlv);
sys/netpfil/ipfw/ip_fw_sockopt.c
2283
ti.tlen = ci->ctlv->head.length - sizeof(ipfw_obj_ctlv);
sys/netpfil/ipfw/ip_fw_sockopt.c
2358
if (ctlv->head.type == IPFW_TLV_TBLNAME_LIST) {
sys/netpfil/ipfw/ip_fw_sockopt.c
2360
clen = ctlv->head.length;
sys/netpfil/ipfw/ip_fw_sockopt.c
2365
count = (ctlv->head.length - sizeof(*ctlv)) / sizeof(*ntlv);
sys/netpfil/ipfw/ip_fw_sockopt.c
2376
if (ntlv->head.length != sizeof(ipfw_obj_ntlv))
sys/netpfil/ipfw/ip_fw_sockopt.c
2392
read += ctlv->head.length;
sys/netpfil/ipfw/ip_fw_sockopt.c
2393
ctlv = (ipfw_obj_ctlv *)((caddr_t)ctlv + ctlv->head.length);
sys/netpfil/ipfw/ip_fw_sockopt.c
2400
if (ctlv->head.type == IPFW_TLV_RULE_LIST) {
sys/netpfil/ipfw/ip_fw_sockopt.c
2401
clen = ctlv->head.length;
sys/netpfil/ipfw/ip_fw_sockopt.c
2459
read += ctlv->head.length;
sys/netpfil/ipfw/ip_fw_sockopt.c
2460
ctlv = (ipfw_obj_ctlv *)((caddr_t)ctlv + ctlv->head.length);
sys/netpfil/ipfw/ip_fw_sockopt.c
3495
l = ntlv->head.length;
sys/netpfil/ipfw/ip_fw_sockopt.c
3508
if (ntlv->head.type != 0 &&
sys/netpfil/ipfw/ip_fw_sockopt.c
3509
ntlv->head.type != (uint16_t)etlv)
sys/netpfil/ipfw/ip_fw_sockopt.c
549
ipfw_reap_add(struct ip_fw_chain *chain, struct ip_fw **head,
sys/netpfil/ipfw/ip_fw_sockopt.c
558
rule->next = *head;
sys/netpfil/ipfw/ip_fw_sockopt.c
559
*head = rule;
sys/netpfil/ipfw/ip_fw_sockopt.c
568
ipfw_reap_rules(struct ip_fw *head)
sys/netpfil/ipfw/ip_fw_sockopt.c
572
while ((rule = head) != NULL) {
sys/netpfil/ipfw/ip_fw_sockopt.c
573
head = head->next;
sys/netpfil/ipfw/ip_fw_table.c
1626
ti->tlen = ntlv->head.length;
sys/netpfil/ipfw/ip_fw_table.c
1667
ntlv->head.type = IPFW_TLV_TBL_NAME;
sys/netpfil/ipfw/ip_fw_table.c
1668
ntlv->head.length = sizeof(*ntlv);
sys/netpfil/ipfw/ip_fw_table.c
1915
tent->head.length = sizeof(ipfw_obj_tentry);
sys/netpfil/ipfw/ip_fw_table.c
735
if (oh->ntlv.head.length != sizeof(oh->ntlv))
sys/netpfil/ipfw/ip_fw_table.c
741
if (ctlv->head.length + read != sd->valsize)
sys/netpfil/ipfw/ip_fw_table.c
763
if (ptent->head.length != sizeof(*ptent))
sys/netpfil/ipfw/ip_fw_table.c
788
if (ptent->head.flags & IPFW_TF_UPDATE)
sys/netpfil/ipfw/ip_fw_table.c
857
if (oh->ntlv.head.length != sizeof(oh->ntlv))
sys/netpfil/ipfw/ip_fw_table_algo.c
1064
struct chashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
1071
head = (struct chashbhead *)ti->state;
sys/netpfil/ipfw/ip_fw_table_algo.c
1078
SLIST_FOREACH(ent, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1089
head = (struct chashbhead *)ti->xstate;
sys/netpfil/ipfw/ip_fw_table_algo.c
1093
SLIST_FOREACH(ent, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1109
struct chashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
1116
head = (struct chashbhead *)ti->state;
sys/netpfil/ipfw/ip_fw_table_algo.c
1123
SLIST_FOREACH(ent, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1135
head = (struct chashbhead *)ti->xstate;
sys/netpfil/ipfw/ip_fw_table_algo.c
1141
SLIST_FOREACH(ent, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1158
struct chashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
1165
head = (struct chashbhead *)ti->state;
sys/netpfil/ipfw/ip_fw_table_algo.c
1172
SLIST_FOREACH(ent, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1183
head = (struct chashbhead *)ti->xstate;
sys/netpfil/ipfw/ip_fw_table_algo.c
1188
SLIST_FOREACH(ent, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1466
struct chashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
1485
head = cfg->head4;
sys/netpfil/ipfw/ip_fw_table_algo.c
1488
SLIST_FOREACH(tmp, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1503
head = cfg->head6;
sys/netpfil/ipfw/ip_fw_table_algo.c
1506
SLIST_FOREACH(tmp, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1563
struct chashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
1582
head = cfg->head4;
sys/netpfil/ipfw/ip_fw_table_algo.c
1586
SLIST_FOREACH(tmp, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1595
head = cfg->head6;
sys/netpfil/ipfw/ip_fw_table_algo.c
1598
SLIST_FOREACH(tmp, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1619
SLIST_INSERT_HEAD(&head[hash], ent, next);
sys/netpfil/ipfw/ip_fw_table_algo.c
1649
struct chashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
1661
head = cfg->head4;
sys/netpfil/ipfw/ip_fw_table_algo.c
1664
SLIST_FOREACH_SAFE(tmp, &head[hash], next, tmp_next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1668
SLIST_REMOVE(&head[hash], tmp, chashentry, next);
sys/netpfil/ipfw/ip_fw_table_algo.c
1678
head = cfg->head6;
sys/netpfil/ipfw/ip_fw_table_algo.c
1680
SLIST_FOREACH_SAFE(tmp, &head[hash], next, tmp_next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
1684
SLIST_REMOVE(&head[hash], tmp, chashentry, next);
sys/netpfil/ipfw/ip_fw_table_algo.c
1748
struct chashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
1757
head = malloc(sizeof(struct chashbhead) * mi->size,
sys/netpfil/ipfw/ip_fw_table_algo.c
1760
SLIST_INIT(&head[i]);
sys/netpfil/ipfw/ip_fw_table_algo.c
1761
mi->main_ptr = head;
sys/netpfil/ipfw/ip_fw_table_algo.c
1765
head = malloc(sizeof(struct chashbhead) * mi->size6,
sys/netpfil/ipfw/ip_fw_table_algo.c
1768
SLIST_INIT(&head[i]);
sys/netpfil/ipfw/ip_fw_table_algo.c
1769
mi->main_ptr6 = head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3090
struct fhashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3196
struct fhashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3203
head = (struct fhashbhead *)ti->state;
sys/netpfil/ipfw/ip_fw_table_algo.c
3219
SLIST_FOREACH(ent, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
3244
SLIST_FOREACH(ent, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
3271
cfg->head = malloc(sizeof(struct fhashbhead) * cfg->size, M_IPFW,
sys/netpfil/ipfw/ip_fw_table_algo.c
3274
SLIST_INIT(&cfg->head[i]);
sys/netpfil/ipfw/ip_fw_table_algo.c
3304
ti->state = cfg->head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3322
SLIST_FOREACH_SAFE(ent, &cfg->head[i], next, ent_next)
sys/netpfil/ipfw/ip_fw_table_algo.c
3325
free(cfg->head, M_IPFW);
sys/netpfil/ipfw/ip_fw_table_algo.c
3428
struct fhashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3449
head = cfg->head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3458
SLIST_FOREACH(tmp, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
3479
SLIST_FOREACH_SAFE(ent, &cfg->head[i], next, ent_next)
sys/netpfil/ipfw/ip_fw_table_algo.c
3518
struct fhashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3533
head = cfg->head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3542
SLIST_FOREACH(tmp, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
3564
SLIST_INSERT_HEAD(&head[hash], ent, next);
sys/netpfil/ipfw/ip_fw_table_algo.c
3591
struct fhashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3601
head = cfg->head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3610
SLIST_FOREACH(tmp, &head[hash], next) {
sys/netpfil/ipfw/ip_fw_table_algo.c
3614
SLIST_REMOVE(&head[hash], tmp, fhashentry, next);
sys/netpfil/ipfw/ip_fw_table_algo.c
3664
struct fhashbhead *head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3671
head = malloc(sizeof(struct fhashbhead) * mi->size, M_IPFW,
sys/netpfil/ipfw/ip_fw_table_algo.c
3674
SLIST_INIT(&head[i]);
sys/netpfil/ipfw/ip_fw_table_algo.c
3676
mi->main_ptr = head;
sys/netpfil/ipfw/ip_fw_table_algo.c
3724
cfg->head = new_head;
sys/netpfil/ipfw/ip_fw_table_algo.c
4028
struct radix_node_head *head;
sys/netpfil/ipfw/nat64/nat64clat_control.c
445
ctlv->head.type = IPFW_TLV_COUNTERS;
sys/netpfil/ipfw/nat64/nat64clat_control.c
446
ctlv->head.length = sz - sizeof(ipfw_obj_header);
sys/netpfil/ipfw/nat64/nat64lsn_control.c
512
ctlv->head.type = IPFW_TLV_COUNTERS;
sys/netpfil/ipfw/nat64/nat64lsn_control.c
513
ctlv->head.length = sz - sizeof(ipfw_obj_header);
sys/netpfil/ipfw/nat64/nat64lsn_control.c
708
if (od->head.type != IPFW_TLV_OBJDATA ||
sys/netpfil/ipfw/nat64/nat64lsn_control.c
709
od->head.length != sz - sizeof(ipfw_obj_header))
sys/netpfil/ipfw/nat64/nat64lsn_control.c
744
od->head.type = IPFW_TLV_OBJDATA;
sys/netpfil/ipfw/nat64/nat64lsn_control.c
745
od->head.length = sz - sizeof(ipfw_obj_header);
sys/netpfil/ipfw/nat64/nat64lsn_control.c
767
od->head.length +=
sys/netpfil/ipfw/nat64/nat64lsn_control.c
794
od->head.length += sizeof(ipfw_nat64lsn_stg_v1);
sys/netpfil/ipfw/nat64/nat64stl_control.c
450
ctlv->head.type = IPFW_TLV_COUNTERS;
sys/netpfil/ipfw/nat64/nat64stl_control.c
451
ctlv->head.length = sz - sizeof(ipfw_obj_header);
sys/netpfil/ipfw/nptv6/nptv6.c
865
ctlv->head.type = IPFW_TLV_COUNTERS;
sys/netpfil/ipfw/nptv6/nptv6.c
866
ctlv->head.length = sz - sizeof(ipfw_obj_header);
sys/netpfil/ipfw/test/dn_test.h
170
if (q->head == NULL)
sys/netpfil/ipfw/test/dn_test.h
171
q->head = m;
sys/netpfil/ipfw/test/main.c
145
if (mq->head == NULL)
sys/netpfil/ipfw/test/main.c
146
mq->head = m;
sys/netpfil/ipfw/test/main.c
159
if ((m = mq->head)) {
sys/netpfil/ipfw/test/main.c
160
m = mq->head;
sys/netpfil/ipfw/test/main.c
161
mq->head = m->m_nextpkt;
sys/netpfil/ipfw/test/main.c
50
struct mbuf *head, *tail; /* a simple tailq */
sys/netpfil/ipfw/test/mylist.h
26
list_add_tail(struct list_head *o, struct list_head *head)
sys/netpfil/ipfw/test/mylist.h
28
__list_add(o, head->prev, head);
sys/netpfil/ipfw/test/test_dn_sched.c
39
if (q->mq.head)
sys/netpfil/ipfw/test/test_dn_sched.c
40
dn_free_pkts(q->mq.head);
sys/netpfil/pf/pf.c
1404
pf_free_src_nodes(struct pf_ksrc_node_list *head)
sys/netpfil/pf/pf.c
1409
LIST_FOREACH_SAFE(sn, head, entry, tmp) {
sys/netpfil/pf/pf.c
3537
while (head[i] != cur) { \
sys/netpfil/pf/pf.c
3538
head[i]->skip[i] = cur; \
sys/netpfil/pf/pf.c
3539
head[i] = TAILQ_NEXT(head[i], entries); \
sys/netpfil/pf/pf.c
3546
struct pf_krule *cur, *prev, *head[PF_SKIP_COUNT];
sys/netpfil/pf/pf.c
3552
head[i] = cur;
sys/netpfil/pf/pf_ioctl.c
903
while (head[i] != cur) { \
sys/netpfil/pf/pf_ioctl.c
904
head[i]->skip[i].ptr = cur; \
sys/netpfil/pf/pf_ioctl.c
905
head[i] = TAILQ_NEXT(head[i], entries); \
sys/netpfil/pf/pf_ioctl.c
912
struct pf_keth_rule *cur, *prev, *head[PFE_SKIP_COUNT];
sys/netpfil/pf/pf_ioctl.c
918
head[i] = cur;
sys/netpfil/pf/pf_table.c
1000
head = &kt->pfrkt_ip4->rh;
sys/netpfil/pf/pf_table.c
1003
head = &kt->pfrkt_ip6->rh;
sys/netpfil/pf/pf_table.c
1011
rn = rn_addroute(&ke->pfrke_sa, &mask, head, ke->pfrke_node);
sys/netpfil/pf/pf_table.c
1013
rn = rn_addroute(&ke->pfrke_sa, NULL, head, ke->pfrke_node);
sys/netpfil/pf/pf_table.c
1023
struct radix_head *head = NULL;
sys/netpfil/pf/pf_table.c
1027
head = &kt->pfrkt_ip4->rh;
sys/netpfil/pf/pf_table.c
1030
head = &kt->pfrkt_ip6->rh;
sys/netpfil/pf/pf_table.c
1038
rn = rn_delete(&ke->pfrke_sa, &mask, head);
sys/netpfil/pf/pf_table.c
1040
rn = rn_delete(&ke->pfrke_sa, NULL, head);
sys/netpfil/pf/pf_table.c
753
struct radix_head *head = NULL;
sys/netpfil/pf/pf_table.c
762
head = &kt->pfrkt_ip4->rh;
sys/netpfil/pf/pf_table.c
766
head = &kt->pfrkt_ip6->rh;
sys/netpfil/pf/pf_table.c
773
ke = (struct pfr_kentry *)rn_lookup(&sa, &mask, head);
sys/netpfil/pf/pf_table.c
777
ke = (struct pfr_kentry *)rn_match(&sa, head);
sys/netpfil/pf/pf_table.c
993
struct radix_head *head = NULL;
sys/ofed/drivers/infiniband/ulp/ipoib/ipoib_ib.c
450
struct ib_ah *address, u32 qpn, struct ipoib_tx_buf *tx_req, void *head,
sys/ofed/drivers/infiniband/ulp/ipoib/ipoib_ib.c
468
if (head) {
sys/ofed/drivers/infiniband/ulp/ipoib/ipoib_ib.c
470
priv->tx_wr.header = head;
sys/ofed/drivers/infiniband/ulp/sdp/sdp.h
144
#define ring_head(ring) (atomic_read(&(ring).head))
sys/ofed/drivers/infiniband/ulp/sdp/sdp.h
275
atomic_t head;
sys/ofed/drivers/infiniband/ulp/sdp/sdp.h
288
atomic_t head;
sys/ofed/drivers/infiniband/ulp/sdp/sdp_rx.c
156
atomic_inc(&ssk->rx_ring.head);
sys/ofed/drivers/infiniband/ulp/sdp/sdp_rx.c
714
atomic_set(&ssk->rx_ring.head, 1);
sys/ofed/drivers/infiniband/ulp/sdp/sdp_tx.c
159
atomic_inc(&ssk->tx_ring.head);
sys/ofed/drivers/infiniband/ulp/sdp/sdp_tx.c
435
atomic_set(&ssk->tx_ring.head, 1);
sys/ofed/include/rdma/rdmavt_cq.h
69
u32 head; /* index of next entry to fill */
sys/ofed/include/rdma/rdmavt_qp.h
194
u32 head; /* new work requests posted to the head */
sys/rpc/svc_vc.c
1154
svc_vc_rendezvous_soupcall(struct socket *head, void *arg, int waitflag)
sys/rpc/svc_vc.c
1158
if (!TAILQ_EMPTY(&head->sol_comp))
sys/rpc/svc_vc.c
158
static int svc_vc_accept(struct socket *head, struct socket **sop);
sys/rpc/svc_vc.c
368
svc_vc_accept(struct socket *head, struct socket **sop)
sys/rpc/svc_vc.c
374
KASSERT(SOLISTENING(head),
sys/rpc/svc_vc.c
375
("%s: socket %p is not listening", __func__, head));
sys/rpc/svc_vc.c
378
error = mac_socket_check_accept(curthread->td_ucred, head);
sys/rpc/svc_vc.c
389
SOLISTEN_LOCK(head);
sys/rpc/svc_vc.c
390
nbio = head->so_state & SS_NBIO;
sys/rpc/svc_vc.c
391
head->so_state |= SS_NBIO;
sys/rpc/svc_vc.c
392
error = solisten_dequeue(head, &so, nbio ? SOCK_NONBLOCK : 0);
sys/rpc/svc_vc.c
394
SOLISTEN_LOCK(head);
sys/rpc/svc_vc.c
395
head->so_state &= ~SS_NBIO;
sys/rpc/svc_vc.c
396
SOLISTEN_UNLOCK(head);
sys/rpc/svc_vc.c
404
KNOTE_UNLOCKED(&head->so_rdsel.si_note, 0);
sys/security/audit/audit_bsm_db.c
123
CK_LIST_FOREACH(evc, &evcl->head, entry) {
sys/security/audit/audit_bsm_db.c
155
CK_LIST_FOREACH(evc, &evcl->head, entry) {
sys/security/audit/audit_bsm_db.c
166
CK_LIST_INSERT_HEAD(&evcl->head, evc, entry);
sys/security/audit/audit_bsm_db.c
177
CK_LIST_INIT(&evclass_hash[i].head);
sys/security/audit/audit_bsm_db.c
72
CK_LIST_HEAD(, evclass_elem) head;
sys/security/mac_do/mac_do.c
1289
(STAILQ_EMPTY(&rules->head) ? JAIL_SYS_DISABLE : JAIL_SYS_NEW) :
sys/security/mac_do/mac_do.c
169
struct rulehead head;
sys/security/mac_do/mac_do.c
1977
STAILQ_FOREACH(rule, &rules->head, r_entries)
sys/security/mac_do/mac_do.c
318
struct rulehead *const head = &rules->head;
sys/security/mac_do/mac_do.c
321
STAILQ_FOREACH_SAFE(rule, head, r_entries, rule_next) {
sys/security/mac_do/mac_do.c
336
STAILQ_INIT(&rules->head);
sys/security/mac_do/mac_do.c
968
STAILQ_INSERT_TAIL(&rules->head, new, r_entries);
sys/security/mac_ipacl/mac_ipacl.c
131
destroy_rules(struct rulehead *head)
sys/security/mac_ipacl/mac_ipacl.c
135
while ((rule = TAILQ_FIRST(head)) != NULL) {
sys/security/mac_ipacl/mac_ipacl.c
136
TAILQ_REMOVE(head, rule, r_entries);
sys/security/mac_ipacl/mac_ipacl.c
244
parse_rules(char *string, struct rulehead *head)
sys/security/mac_ipacl/mac_ipacl.c
261
TAILQ_INSERT_TAIL(head, new, r_entries);
sys/security/mac_ipacl/mac_ipacl.c
265
destroy_rules(head);
sys/security/mac_ipacl/mac_ipacl.c
273
struct rulehead head, save_head;
sys/security/mac_ipacl/mac_ipacl.c
293
TAILQ_INIT(&head);
sys/security/mac_ipacl/mac_ipacl.c
294
error = parse_rules(copy_string, &head);
sys/security/mac_ipacl/mac_ipacl.c
302
TAILQ_CONCAT(&rule_head, &head, r_entries);
sys/security/mac_portacl/mac_portacl.c
137
toast_rules(struct rulehead *head)
sys/security/mac_portacl/mac_portacl.c
141
while ((rule = TAILQ_FIRST(head)) != NULL) {
sys/security/mac_portacl/mac_portacl.c
142
TAILQ_REMOVE(head, rule, r_entries);
sys/security/mac_portacl/mac_portacl.c
237
parse_rules(char *string, struct rulehead *head)
sys/security/mac_portacl/mac_portacl.c
250
TAILQ_INSERT_TAIL(head, new, r_entries);
sys/security/mac_portacl/mac_portacl.c
254
toast_rules(head);
sys/security/mac_portacl/mac_portacl.c
331
struct rulehead head, save_head;
sys/security/mac_portacl/mac_portacl.c
351
TAILQ_INIT(&head);
sys/security/mac_portacl/mac_portacl.c
352
error = parse_rules(copy_string, &head);
sys/security/mac_portacl/mac_portacl.c
360
TAILQ_CONCAT(&rule_head, &head, r_entries);
sys/security/mac_veriexec/veriexec_metadata.c
104
get_veriexec_file(struct veriexec_devhead *head, dev_t fsid, long fileid,
sys/security/mac_veriexec/veriexec_metadata.c
118
(head == &veriexec_file_dev_head)));
sys/security/mac_veriexec/veriexec_metadata.c
124
for (lp = LIST_FIRST(head); lp != NULL; lp = LIST_NEXT(lp, entries))
sys/security/mac_veriexec/veriexec_metadata.c
187
mac_veriexec_print_db_head(struct sbuf *sbp, struct veriexec_devhead *head)
sys/security/mac_veriexec/veriexec_metadata.c
191
for (lp = LIST_FIRST(head); lp != NULL; lp = LIST_NEXT(lp, entries)) {
sys/security/mac_veriexec/veriexec_metadata.c
254
free_veriexec_dev(dev_t fsid, struct veriexec_devhead *head)
sys/security/mac_veriexec/veriexec_metadata.c
260
for (lp = LIST_FIRST(head); lp != NULL;
sys/security/mac_veriexec/veriexec_metadata.c
305
find_veriexec_dev(dev_t fsid, struct veriexec_devhead *head)
sys/security/mac_veriexec/veriexec_metadata.c
312
for (lp = LIST_FIRST(head); lp != NULL;
sys/security/mac_veriexec/veriexec_metadata.c
346
LIST_INSERT_HEAD(head, lp, entries);
sys/security/mac_veriexec/veriexec_metadata.c
641
struct veriexec_devhead *head;
sys/security/mac_veriexec/veriexec_metadata.c
651
head = &veriexec_file_dev_head;
sys/security/mac_veriexec/veriexec_metadata.c
653
head = &veriexec_dev_head;
sys/security/mac_veriexec/veriexec_metadata.c
654
lp = find_veriexec_dev(fsid, head);
sys/sys/_unrhdr.h
39
TAILQ_HEAD(unrhd,unr) head;
sys/sys/arb.h
100
((((intptr_t)(idx) <= ARB_NULLIDX) || ((idx) >= ARB_MAXNODES(head))) ? \
sys/sys/arb.h
101
NULL : ((const ARB_ELMTYPE(head))(ARB_NODES(head) + (idx))))
sys/sys/arb.h
102
#define ARB_NODE(head, idx) \
sys/sys/arb.h
103
(__DECONST(ARB_ELMTYPE(head), ARB_CNODE(head, idx)))
sys/sys/arb.h
104
#define ARB_ROOT(head) ARB_NODE(head, ARB_ROOTIDX(head))
sys/sys/arb.h
105
#define ARB_LEFT(head, elm, field) ARB_NODE(head, ARB_LEFTIDX(elm, field))
sys/sys/arb.h
106
#define ARB_RIGHT(head, elm, field) ARB_NODE(head, ARB_RIGHTIDX(elm, field))
sys/sys/arb.h
107
#define ARB_PARENT(head, elm, field) ARB_NODE(head, ARB_PARENTIDX(elm, field))
sys/sys/arb.h
108
#define ARB_FREEIDX(head) (head)->arb_free_idx
sys/sys/arb.h
109
#define ARB_ROOTIDX(head) (head)->arb_root_idx
sys/sys/arb.h
110
#define ARB_MINIDX(head) (head)->arb_min_idx
sys/sys/arb.h
111
#define ARB_MAXIDX(head) (head)->arb_max_idx
sys/sys/arb.h
112
#define ARB_SELFIDX(head, elm) \
sys/sys/arb.h
114
((const uint8_t *)ARB_NODES(head))) / sizeof(*(elm)))) : \
sys/sys/arb.h
120
#define ARB_PREVFREE(head, elm, field) \
sys/sys/arb.h
121
ARB_NODE(head, ARB_PREVFREEIDX(elm, field))
sys/sys/arb.h
123
#define ARB_NEXTFREE(head, elm, field) \
sys/sys/arb.h
124
ARB_NODE(head, ARB_NEXTFREEIDX(elm, field))
sys/sys/arb.h
128
#define ARB_SET(head, elm, parent, field) do { \
sys/sys/arb.h
130
parent ? ARB_SELFIDX(head, parent) : ARB_NULLIDX; \
sys/sys/arb.h
144
#define ARB_ROTATE_LEFT(head, elm, tmp, field) do { \
sys/sys/arb.h
146
(tmp) = ARB_RIGHT(head, elm, field); \
sys/sys/arb.h
150
ARB_PARENTIDX(ARB_LEFT(head, tmp, field), field) = \
sys/sys/arb.h
151
ARB_SELFIDX(head, elm); \
sys/sys/arb.h
156
if (ARB_SELFIDX(head, elm) == \
sys/sys/arb.h
157
ARB_LEFTIDX(ARB_PARENT(head, elm, field), field)) \
sys/sys/arb.h
158
ARB_LEFTIDX(ARB_PARENT(head, elm, field), \
sys/sys/arb.h
161
ARB_RIGHTIDX(ARB_PARENT(head, elm, field), \
sys/sys/arb.h
164
ARB_ROOTIDX(head) = _tmpidx; \
sys/sys/arb.h
165
ARB_LEFTIDX(tmp, field) = ARB_SELFIDX(head, elm); \
sys/sys/arb.h
169
ARB_AUGMENT(ARB_PARENT(head, tmp, field)); \
sys/sys/arb.h
172
#define ARB_ROTATE_RIGHT(head, elm, tmp, field) do { \
sys/sys/arb.h
174
(tmp) = ARB_LEFT(head, elm, field); \
sys/sys/arb.h
178
ARB_PARENTIDX(ARB_RIGHT(head, tmp, field), field) = \
sys/sys/arb.h
179
ARB_SELFIDX(head, elm); \
sys/sys/arb.h
184
if (ARB_SELFIDX(head, elm) == \
sys/sys/arb.h
185
ARB_LEFTIDX(ARB_PARENT(head, elm, field), field)) \
sys/sys/arb.h
186
ARB_LEFTIDX(ARB_PARENT(head, elm, field), \
sys/sys/arb.h
189
ARB_RIGHTIDX(ARB_PARENT(head, elm, field), \
sys/sys/arb.h
192
ARB_ROOTIDX(head) = _tmpidx; \
sys/sys/arb.h
193
ARB_RIGHTIDX(tmp, field) = ARB_SELFIDX(head, elm); \
sys/sys/arb.h
197
ARB_AUGMENT(ARB_PARENT(head, tmp, field)); \
sys/sys/arb.h
200
#define ARB_RETURNFREE(head, elm, field) \
sys/sys/arb.h
203
ARB_NEXTFREEIDX(elm, field) = ARB_FREEIDX(head); \
sys/sys/arb.h
204
ARB_FREEIDX(head) = ARB_SELFIDX(head, elm); \
sys/sys/arb.h
208
#define ARB_GETFREEAT(head, field, fidx) \
sys/sys/arb.h
210
__typeof(ARB_NODE(head, 0)) _elm, _prevelm; \
sys/sys/arb.h
212
if (ARB_FREEIDX(head) == ARB_NULLIDX && !ARB_FULL(head)) { \
sys/sys/arb.h
214
ARB_ARRFOREACH_REVERSE(_elm, field, head) { \
sys/sys/arb.h
216
ARB_RETURNFREE(head, _elm, field); \
sys/sys/arb.h
219
_elm = _prevelm = ARB_NODE(head, ARB_FREEIDX(head)); \
sys/sys/arb.h
221
_elm = ARB_NODE(head, ARB_NEXTFREEIDX(_elm, field)); \
sys/sys/arb.h
224
ARB_FREEIDX(head) = \
sys/sys/arb.h
232
#define ARB_GETFREE(head, field) ARB_GETFREEAT(head, field, 0)
sys/sys/arb.h
274
attr const struct type *name##_ARB_CNEXT(const struct name *head,\
sys/sys/arb.h
313
name##_ARB_INSERT_COLOR(struct name *head, struct type *elm) \
sys/sys/arb.h
316
while ((parent = ARB_PARENT(head, elm, field)) != NULL && \
sys/sys/arb.h
318
gparent = ARB_PARENT(head, parent, field); \
sys/sys/arb.h
319
if (parent == ARB_LEFT(head, gparent, field)) { \
sys/sys/arb.h
320
tmp = ARB_RIGHT(head, gparent, field); \
sys/sys/arb.h
327
if (ARB_RIGHT(head, parent, field) == elm) { \
sys/sys/arb.h
328
ARB_ROTATE_LEFT(head, parent, tmp, field); \
sys/sys/arb.h
334
ARB_ROTATE_RIGHT(head, gparent, tmp, field); \
sys/sys/arb.h
336
tmp = ARB_LEFT(head, gparent, field); \
sys/sys/arb.h
343
if (ARB_LEFT(head, parent, field) == elm) { \
sys/sys/arb.h
344
ARB_ROTATE_RIGHT(head, parent, tmp, field); \
sys/sys/arb.h
350
ARB_ROTATE_LEFT(head, gparent, tmp, field); \
sys/sys/arb.h
353
ARB_COLOR(ARB_ROOT(head), field) = ARB_BLACK; \
sys/sys/arb.h
358
name##_ARB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \
sys/sys/arb.h
362
elm != ARB_ROOT(head)) { \
sys/sys/arb.h
363
if (ARB_LEFT(head, parent, field) == elm) { \
sys/sys/arb.h
364
tmp = ARB_RIGHT(head, parent, field); \
sys/sys/arb.h
367
ARB_ROTATE_LEFT(head, parent, tmp, field); \
sys/sys/arb.h
368
tmp = ARB_RIGHT(head, parent, field); \
sys/sys/arb.h
370
if ((ARB_LEFT(head, tmp, field) == NULL || \
sys/sys/arb.h
371
ARB_COLOR(ARB_LEFT(head, tmp, field), field) == ARB_BLACK) && \
sys/sys/arb.h
372
(ARB_RIGHT(head, tmp, field) == NULL || \
sys/sys/arb.h
373
ARB_COLOR(ARB_RIGHT(head, tmp, field), field) == ARB_BLACK)) { \
sys/sys/arb.h
376
parent = ARB_PARENT(head, elm, field); \
sys/sys/arb.h
378
if (ARB_RIGHT(head, tmp, field) == NULL || \
sys/sys/arb.h
379
ARB_COLOR(ARB_RIGHT(head, tmp, field), field) == ARB_BLACK) { \
sys/sys/arb.h
381
if ((oleft = ARB_LEFT(head, tmp, field)) \
sys/sys/arb.h
385
ARB_ROTATE_RIGHT(head, tmp, oleft, field); \
sys/sys/arb.h
386
tmp = ARB_RIGHT(head, parent, field); \
sys/sys/arb.h
390
if (ARB_RIGHT(head, tmp, field)) \
sys/sys/arb.h
391
ARB_COLOR(ARB_RIGHT(head, tmp, field), field) = ARB_BLACK; \
sys/sys/arb.h
392
ARB_ROTATE_LEFT(head, parent, tmp, field); \
sys/sys/arb.h
393
elm = ARB_ROOT(head); \
sys/sys/arb.h
397
tmp = ARB_LEFT(head, parent, field); \
sys/sys/arb.h
400
ARB_ROTATE_RIGHT(head, parent, tmp, field); \
sys/sys/arb.h
401
tmp = ARB_LEFT(head, parent, field); \
sys/sys/arb.h
403
if ((ARB_LEFT(head, tmp, field) == NULL || \
sys/sys/arb.h
404
ARB_COLOR(ARB_LEFT(head, tmp, field), field) == ARB_BLACK) && \
sys/sys/arb.h
405
(ARB_RIGHT(head, tmp, field) == NULL || \
sys/sys/arb.h
406
ARB_COLOR(ARB_RIGHT(head, tmp, field), field) == ARB_BLACK)) { \
sys/sys/arb.h
409
parent = ARB_PARENT(head, elm, field); \
sys/sys/arb.h
411
if (ARB_LEFT(head, tmp, field) == NULL || \
sys/sys/arb.h
412
ARB_COLOR(ARB_LEFT(head, tmp, field), field) == ARB_BLACK) { \
sys/sys/arb.h
414
if ((oright = ARB_RIGHT(head, tmp, field)) \
sys/sys/arb.h
418
ARB_ROTATE_LEFT(head, tmp, oright, field); \
sys/sys/arb.h
419
tmp = ARB_LEFT(head, parent, field); \
sys/sys/arb.h
423
if (ARB_LEFT(head, tmp, field)) \
sys/sys/arb.h
424
ARB_COLOR(ARB_LEFT(head, tmp, field), field) = ARB_BLACK; \
sys/sys/arb.h
425
ARB_ROTATE_RIGHT(head, parent, tmp, field); \
sys/sys/arb.h
426
elm = ARB_ROOT(head); \
sys/sys/arb.h
437
name##_ARB_REMOVE(struct name *head, struct type *elm) \
sys/sys/arb.h
441
if (ARB_LEFT(head, elm, field) == NULL) \
sys/sys/arb.h
442
child = ARB_RIGHT(head, elm, field); \
sys/sys/arb.h
443
else if (ARB_RIGHT(head, elm, field) == NULL) \
sys/sys/arb.h
444
child = ARB_LEFT(head, elm, field); \
sys/sys/arb.h
447
elm = ARB_RIGHT(head, elm, field); \
sys/sys/arb.h
448
while ((left = ARB_LEFT(head, elm, field)) != NULL) \
sys/sys/arb.h
450
child = ARB_RIGHT(head, elm, field); \
sys/sys/arb.h
451
parent = ARB_PARENT(head, elm, field); \
sys/sys/arb.h
455
ARB_SELFIDX(head, parent); \
sys/sys/arb.h
457
if (ARB_LEFT(head, parent, field) == elm) \
sys/sys/arb.h
459
ARB_SELFIDX(head, child); \
sys/sys/arb.h
462
ARB_SELFIDX(head, child); \
sys/sys/arb.h
465
ARB_ROOTIDX(head) = ARB_SELFIDX(head, child); \
sys/sys/arb.h
466
if (ARB_PARENT(head, elm, field) == old) \
sys/sys/arb.h
469
if (ARB_PARENT(head, old, field)) { \
sys/sys/arb.h
470
if (ARB_LEFT(head, ARB_PARENT(head, old, field), \
sys/sys/arb.h
472
ARB_LEFTIDX(ARB_PARENT(head, old, field), \
sys/sys/arb.h
473
field) = ARB_SELFIDX(head, elm); \
sys/sys/arb.h
475
ARB_RIGHTIDX(ARB_PARENT(head, old, field),\
sys/sys/arb.h
476
field) = ARB_SELFIDX(head, elm); \
sys/sys/arb.h
477
ARB_AUGMENT(ARB_PARENT(head, old, field)); \
sys/sys/arb.h
479
ARB_ROOTIDX(head) = ARB_SELFIDX(head, elm); \
sys/sys/arb.h
480
ARB_PARENTIDX(ARB_LEFT(head, old, field), field) = \
sys/sys/arb.h
481
ARB_SELFIDX(head, elm); \
sys/sys/arb.h
482
if (ARB_RIGHT(head, old, field)) \
sys/sys/arb.h
483
ARB_PARENTIDX(ARB_RIGHT(head, old, field), \
sys/sys/arb.h
484
field) = ARB_SELFIDX(head, elm); \
sys/sys/arb.h
489
} while ((left = ARB_PARENT(head, left, field)) \
sys/sys/arb.h
494
parent = ARB_PARENT(head, elm, field); \
sys/sys/arb.h
497
ARB_PARENTIDX(child, field) = ARB_SELFIDX(head, parent);\
sys/sys/arb.h
499
if (ARB_LEFT(head, parent, field) == elm) \
sys/sys/arb.h
501
ARB_SELFIDX(head, child); \
sys/sys/arb.h
504
ARB_SELFIDX(head, child); \
sys/sys/arb.h
507
ARB_ROOTIDX(head) = ARB_SELFIDX(head, child); \
sys/sys/arb.h
510
name##_ARB_REMOVE_COLOR(head, parent, child); \
sys/sys/arb.h
511
ARB_CURNODES(head) -= 1; \
sys/sys/arb.h
512
if (ARB_MINIDX(head) == ARB_SELFIDX(head, old)) \
sys/sys/arb.h
513
ARB_MINIDX(head) = ARB_PARENTIDX(old, field); \
sys/sys/arb.h
514
if (ARB_MAXIDX(head) == ARB_SELFIDX(head, old)) \
sys/sys/arb.h
515
ARB_MAXIDX(head) = ARB_PARENTIDX(old, field); \
sys/sys/arb.h
516
ARB_RETURNFREE(head, old, field); \
sys/sys/arb.h
523
name##_ARB_INSERT(struct name *head, struct type *elm) \
sys/sys/arb.h
528
tmp = ARB_ROOT(head); \
sys/sys/arb.h
533
tmp = ARB_LEFT(head, tmp, field); \
sys/sys/arb.h
535
tmp = ARB_RIGHT(head, tmp, field); \
sys/sys/arb.h
539
ARB_SET(head, elm, parent, field); \
sys/sys/arb.h
543
ARB_SELFIDX(head, elm); \
sys/sys/arb.h
546
ARB_SELFIDX(head, elm); \
sys/sys/arb.h
549
ARB_ROOTIDX(head) = ARB_SELFIDX(head, elm); \
sys/sys/arb.h
550
name##_ARB_INSERT_COLOR(head, elm); \
sys/sys/arb.h
551
ARB_CURNODES(head) += 1; \
sys/sys/arb.h
552
if (ARB_MINIDX(head) == ARB_NULLIDX || \
sys/sys/arb.h
553
(ARB_PARENTIDX(elm, field) == ARB_MINIDX(head) && \
sys/sys/arb.h
554
ARB_LEFTIDX(parent, field) == ARB_SELFIDX(head, elm))) \
sys/sys/arb.h
555
ARB_MINIDX(head) = ARB_SELFIDX(head, elm); \
sys/sys/arb.h
556
if (ARB_MAXIDX(head) == ARB_NULLIDX || \
sys/sys/arb.h
557
(ARB_PARENTIDX(elm, field) == ARB_MAXIDX(head) && \
sys/sys/arb.h
558
ARB_RIGHTIDX(parent, field) == ARB_SELFIDX(head, elm))) \
sys/sys/arb.h
559
ARB_MAXIDX(head) = ARB_SELFIDX(head, elm); \
sys/sys/arb.h
566
name##_ARB_CFIND(const struct name *head, const struct type *elm) \
sys/sys/arb.h
568
const struct type *tmp = ARB_ROOT(head); \
sys/sys/arb.h
573
tmp = ARB_LEFT(head, tmp, field); \
sys/sys/arb.h
575
tmp = ARB_RIGHT(head, tmp, field); \
sys/sys/arb.h
584
name##_ARB_FIND(const struct name *head, const struct type *elm) \
sys/sys/arb.h
585
{ return (__DECONST(struct type *, name##_ARB_CFIND(head, elm))); }
sys/sys/arb.h
59
#define ARB_ALLOCSIZE(head, maxn, x) \
sys/sys/arb.h
590
name##_ARB_CNFIND(const struct name *head, const struct type *elm) \
sys/sys/arb.h
592
const struct type *tmp = ARB_ROOT(head); \
sys/sys/arb.h
599
tmp = ARB_LEFT(head, tmp, field); \
sys/sys/arb.h
60
(sizeof(*head) + (maxn) * sizeof(*x))
sys/sys/arb.h
602
tmp = ARB_RIGHT(head, tmp, field); \
sys/sys/arb.h
611
name##_ARB_NFIND(const struct name *head, const struct type *elm) \
sys/sys/arb.h
612
{ return (__DECONST(struct type *, name##_ARB_CNFIND(head, elm))); }
sys/sys/arb.h
617
name##_ARB_CNEXT(const struct name *head, const struct type *elm) \
sys/sys/arb.h
619
if (ARB_RIGHT(head, elm, field)) { \
sys/sys/arb.h
620
elm = ARB_RIGHT(head, elm, field); \
sys/sys/arb.h
621
while (ARB_LEFT(head, elm, field)) \
sys/sys/arb.h
622
elm = ARB_LEFT(head, elm, field); \
sys/sys/arb.h
624
if (ARB_PARENT(head, elm, field) && \
sys/sys/arb.h
625
(elm == ARB_LEFT(head, ARB_PARENT(head, elm, field),\
sys/sys/arb.h
627
elm = ARB_PARENT(head, elm, field); \
sys/sys/arb.h
629
while (ARB_PARENT(head, elm, field) && \
sys/sys/arb.h
630
(elm == ARB_RIGHT(head, ARB_PARENT(head, \
sys/sys/arb.h
632
elm = ARB_PARENT(head, elm, field); \
sys/sys/arb.h
633
elm = ARB_PARENT(head, elm, field); \
sys/sys/arb.h
641
name##_ARB_NEXT(const struct name *head, const struct type *elm) \
sys/sys/arb.h
642
{ return (__DECONST(struct type *, name##_ARB_CNEXT(head, elm))); }
sys/sys/arb.h
647
name##_ARB_CPREV(const struct name *head, const struct type *elm) \
sys/sys/arb.h
649
if (ARB_LEFT(head, elm, field)) { \
sys/sys/arb.h
650
elm = ARB_LEFT(head, elm, field); \
sys/sys/arb.h
651
while (ARB_RIGHT(head, elm, field)) \
sys/sys/arb.h
652
elm = ARB_RIGHT(head, elm, field); \
sys/sys/arb.h
654
if (ARB_PARENT(head, elm, field) && \
sys/sys/arb.h
655
(elm == ARB_RIGHT(head, ARB_PARENT(head, elm, \
sys/sys/arb.h
657
elm = ARB_PARENT(head, elm, field); \
sys/sys/arb.h
659
while (ARB_PARENT(head, elm, field) && \
sys/sys/arb.h
66
#define ARB_INIT(x, field, head, maxn) \
sys/sys/arb.h
660
(elm == ARB_LEFT(head, ARB_PARENT(head, elm,\
sys/sys/arb.h
662
elm = ARB_PARENT(head, elm, field); \
sys/sys/arb.h
663
elm = ARB_PARENT(head, elm, field); \
sys/sys/arb.h
67
(head)->arb_curnodes = 0; \
sys/sys/arb.h
671
name##_ARB_PREV(const struct name *head, const struct type *elm) \
sys/sys/arb.h
672
{ return (__DECONST(struct type *, name##_ARB_CPREV(head, elm))); }
sys/sys/arb.h
676
name##_ARB_CMINMAX(const struct name *head, int val) \
sys/sys/arb.h
678
const struct type *tmp = ARB_EMPTY(head) ? NULL : ARB_ROOT(head);\
sys/sys/arb.h
68
(head)->arb_maxnodes = (maxn); \
sys/sys/arb.h
683
tmp = ARB_LEFT(head, tmp, field); \
sys/sys/arb.h
685
tmp = ARB_RIGHT(head, tmp, field); \
sys/sys/arb.h
69
(head)->arb_root_idx = (head)->arb_free_idx = \
sys/sys/arb.h
692
name##_ARB_MINMAX(const struct name *head, int val) \
sys/sys/arb.h
693
{ return (__DECONST(struct type *, name##_ARB_CMINMAX(head, val))); }
sys/sys/arb.h
697
name##_ARB_REINSERT(struct name *head, struct type *elm) \
sys/sys/arb.h
70
(head)->arb_min_idx = (head)->arb_max_idx = ARB_NULLIDX; \
sys/sys/arb.h
700
if (((cmpelm = ARB_PREV(name, head, elm)) != NULL && \
sys/sys/arb.h
702
((cmpelm = ARB_NEXT(name, head, elm)) != NULL && \
sys/sys/arb.h
705
ARB_REMOVE(name, head, elm); \
sys/sys/arb.h
707
elm = ARB_GETFREE(head, field); \
sys/sys/arb.h
708
return (ARB_INSERT(name, head, elm)); \
sys/sys/arb.h
72
ARB_ARRFOREACH_REVWCOND(x, field, head, \
sys/sys/arb.h
73
ARB_RETURNFREE(head, x, field))
sys/sys/arb.h
733
#define ARB_FOREACH(x, name, head) \
sys/sys/arb.h
734
for ((x) = ARB_MIN(name, head); \
sys/sys/arb.h
736
(x) = name##_ARB_NEXT(head, x))
sys/sys/arb.h
743
#define ARB_FOREACH_SAFE(x, name, head, y) \
sys/sys/arb.h
744
for ((x) = ARB_MIN(name, head); \
sys/sys/arb.h
748
#define ARB_FOREACH_REVERSE(x, name, head) \
sys/sys/arb.h
749
for ((x) = ARB_MAX(name, head); \
sys/sys/arb.h
758
#define ARB_FOREACH_REVERSE_SAFE(x, name, head, y) \
sys/sys/arb.h
759
for ((x) = ARB_MAX(name, head); \
sys/sys/arb.h
763
#define ARB_ARRFOREACH(x, field, head) \
sys/sys/arb.h
764
for ((x) = ARB_NODES(head); \
sys/sys/arb.h
765
ARB_SELFIDX(head, x) < ARB_MAXNODES(head); \
sys/sys/arb.h
768
#define ARB_ARRFOREACH_REVWCOND(x, field, head, extracond) \
sys/sys/arb.h
769
for ((x) = ARB_NODES(head) + (ARB_MAXNODES(head) - 1); \
sys/sys/arb.h
770
(x) >= ARB_NODES(head) && (extracond); \
sys/sys/arb.h
773
#define ARB_ARRFOREACH_REVERSE(x, field, head) \
sys/sys/arb.h
774
ARB_ARRFOREACH_REVWCOND(x, field, head, 1)
sys/sys/arb.h
776
#define ARB_RESET_TREE(head, name, maxn) \
sys/sys/arb.h
777
*(head) = ARB_INITIALIZER(name, maxn)
sys/sys/arb.h
93
#define ARB_ELMTYPE(head) __typeof(&(head)->arb_nodes[0])
sys/sys/arb.h
94
#define ARB_NODES(head) (head)->arb_nodes
sys/sys/arb.h
95
#define ARB_MAXNODES(head) (head)->arb_maxnodes
sys/sys/arb.h
96
#define ARB_CURNODES(head) (head)->arb_curnodes
sys/sys/arb.h
97
#define ARB_EMPTY(head) ((head)->arb_curnodes == 0)
sys/sys/arb.h
98
#define ARB_FULL(head) ((head)->arb_curnodes >= (head)->arb_maxnodes)
sys/sys/arb.h
99
#define ARB_CNODE(head, idx) \
sys/sys/bio.h
176
struct bio *bioq_first(struct bio_queue_head *head);
sys/sys/bio.h
177
struct bio *bioq_takefirst(struct bio_queue_head *head);
sys/sys/bio.h
178
void bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error);
sys/sys/bio.h
179
void bioq_init(struct bio_queue_head *head);
sys/sys/bio.h
180
void bioq_insert_head(struct bio_queue_head *head, struct bio *bp);
sys/sys/bio.h
181
void bioq_insert_tail(struct bio_queue_head *head, struct bio *bp);
sys/sys/bio.h
182
void bioq_remove(struct bio_queue_head *head, struct bio *bp);
sys/sys/fdcio.h
112
u_char head; /* H - 0...1 */
sys/sys/fdcio.h
44
int cyl, head;
sys/sys/mbuf.h
1793
mc_concat(struct mchain *head, struct mchain *tail)
sys/sys/mbuf.h
1795
STAILQ_CONCAT(&head->mc_q, &tail->mc_q);
sys/sys/mbuf.h
1796
head->mc_len += tail->mc_len;
sys/sys/mbuf.h
1797
head->mc_mlen += tail->mc_mlen;
sys/sys/queue.h
1000
#define TAILQ_LAST(head, headname) \
sys/sys/queue.h
1001
(*(((struct headname *)((head)->tqh_last))->tqh_last))
sys/sys/queue.h
1010
#define TAILQ_LAST_FAST(head, type, field) \
sys/sys/queue.h
1011
(TAILQ_EMPTY(head) ? NULL : __containerof((head)->tqh_last, QUEUE_TYPEOF(type), field.tqe_next))
sys/sys/queue.h
1018
#define TAILQ_PREV_FAST(elm, head, type, field) \
sys/sys/queue.h
1019
((elm)->field.tqe_prev == &(head)->tqh_first ? NULL : \
sys/sys/queue.h
1022
#define TAILQ_REMOVE_HEAD(head, field) \
sys/sys/queue.h
1023
TAILQ_REMOVE(head, TAILQ_FIRST(head), field)
sys/sys/queue.h
1025
#define TAILQ_REMOVE(head, elm, field) do { \
sys/sys/queue.h
1034
(head)->tqh_last = (elm)->field.tqe_prev; \
sys/sys/queue.h
1035
QMD_TRACE_HEAD(head); \
sys/sys/queue.h
1043
#define TAILQ_REPLACE(head, elm, elm2, field) do { \
sys/sys/queue.h
1049
if (TAILQ_NEXT((elm2), field) != TAILQ_END(head)) \
sys/sys/queue.h
1053
(head)->tqh_last = &(elm2)->field.tqe_next; \
sys/sys/queue.h
1061
#define TAILQ_SPLIT_AFTER(head, elm, rest, field) do { \
sys/sys/queue.h
1062
TAILQ_ASSERT_NONEMPTY((head)); \
sys/sys/queue.h
1063
QMD_TAILQ_CHECK_TAIL((head), field); \
sys/sys/queue.h
1069
(rest)->tqh_last = (head)->tqh_last; \
sys/sys/queue.h
1074
(head)->tqh_last = &TAILQ_NEXT((elm), field); \
sys/sys/queue.h
1095
#define TAILQ_END(head) NULL
sys/sys/queue.h
135
#define QMD_TRACE_HEAD(head) do { \
sys/sys/queue.h
136
(head)->trace.prevline = (head)->trace.lastline; \
sys/sys/queue.h
137
(head)->trace.prevfile = (head)->trace.lastfile; \
sys/sys/queue.h
138
(head)->trace.lastline = __LINE__; \
sys/sys/queue.h
139
(head)->trace.lastfile = __FILE__; \
sys/sys/queue.h
151
#define QMD_TRACE_HEAD(head)
sys/sys/queue.h
245
#define SLIST_HEAD_INITIALIZER(head) \
sys/sys/queue.h
267
#define SLIST_ASSERT_EMPTY(head) \
sys/sys/queue.h
268
QMD_ASSERT(SLIST_EMPTY((head)), \
sys/sys/queue.h
269
"slist %p is not empty", (head))
sys/sys/queue.h
271
#define SLIST_ASSERT_NONEMPTY(head) \
sys/sys/queue.h
272
QMD_ASSERT(!SLIST_EMPTY((head)), \
sys/sys/queue.h
273
"slist %p is empty", (head))
sys/sys/queue.h
288
#define SLIST_EMPTY(head) ((head)->slh_first == NULL)
sys/sys/queue.h
290
#define SLIST_EMPTY_ATOMIC(head) \
sys/sys/queue.h
291
(atomic_load_ptr(&(head)->slh_first) == NULL)
sys/sys/queue.h
293
#define SLIST_FIRST(head) ((head)->slh_first)
sys/sys/queue.h
295
#define SLIST_FOREACH(var, head, field) \
sys/sys/queue.h
296
for ((var) = SLIST_FIRST((head)); \
sys/sys/queue.h
300
#define SLIST_FOREACH_FROM(var, head, field) \
sys/sys/queue.h
301
for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
sys/sys/queue.h
305
#define SLIST_FOREACH_SAFE(var, head, field, tvar) \
sys/sys/queue.h
306
for ((var) = SLIST_FIRST((head)); \
sys/sys/queue.h
310
#define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \
sys/sys/queue.h
311
for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
sys/sys/queue.h
315
#define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
sys/sys/queue.h
316
for ((varp) = &SLIST_FIRST((head)); \
sys/sys/queue.h
320
#define SLIST_INIT(head) do { \
sys/sys/queue.h
321
SLIST_FIRST((head)) = NULL; \
sys/sys/queue.h
329
#define SLIST_INSERT_HEAD(head, elm, field) do { \
sys/sys/queue.h
330
SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
sys/sys/queue.h
331
SLIST_FIRST((head)) = (elm); \
sys/sys/queue.h
336
#define SLIST_REMOVE(head, elm, type, field) do { \
sys/sys/queue.h
337
if (SLIST_FIRST((head)) == (elm)) { \
sys/sys/queue.h
338
SLIST_REMOVE_HEAD((head), field); \
sys/sys/queue.h
341
QUEUE_TYPEOF(type) *_Curelm = SLIST_FIRST(head); \
sys/sys/queue.h
355
#define SLIST_REMOVE_HEAD(head, field) do { \
sys/sys/queue.h
356
QMD_SAVELINK(_Oldnext, SLIST_FIRST(head)->field.sle_next); \
sys/sys/queue.h
357
SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
sys/sys/queue.h
367
#define SLIST_SPLIT_AFTER(head, elm, rest, field) do { \
sys/sys/queue.h
368
SLIST_ASSERT_NONEMPTY((head)); \
sys/sys/queue.h
379
#define SLIST_END(head) NULL
sys/sys/queue.h
397
#define STAILQ_HEAD_INITIALIZER(head) \
sys/sys/queue.h
398
{ NULL, &(head).stqh_first }
sys/sys/queue.h
420
#define QMD_STAILQ_CHECK_EMPTY(head) \
sys/sys/queue.h
421
QMD_ASSERT((head)->stqh_last == &(head)->stqh_first, \
sys/sys/queue.h
424
(head), (head)->stqh_last)
sys/sys/queue.h
431
#define QMD_STAILQ_CHECK_TAIL(head) \
sys/sys/queue.h
432
QMD_ASSERT(*(head)->stqh_last == NULL, \
sys/sys/queue.h
434
"%p, not NULL", (head), *(head)->stqh_last)
sys/sys/queue.h
436
#define STAILQ_ASSERT_EMPTY(head) \
sys/sys/queue.h
437
QMD_ASSERT(STAILQ_EMPTY((head)), \
sys/sys/queue.h
438
"stailq %p is not empty", (head))
sys/sys/queue.h
440
#define STAILQ_ASSERT_NONEMPTY(head) \
sys/sys/queue.h
441
QMD_ASSERT(!STAILQ_EMPTY((head)), \
sys/sys/queue.h
442
"stailq %p is empty", (head))
sys/sys/queue.h
452
#define STAILQ_EMPTY(head) ({ \
sys/sys/queue.h
453
if (STAILQ_FIRST(head) == NULL) \
sys/sys/queue.h
454
QMD_STAILQ_CHECK_EMPTY(head); \
sys/sys/queue.h
455
STAILQ_FIRST(head) == NULL; \
sys/sys/queue.h
458
#define STAILQ_EMPTY_ATOMIC(head) \
sys/sys/queue.h
459
(atomic_load_ptr(&(head)->stqh_first) == NULL)
sys/sys/queue.h
461
#define STAILQ_FIRST(head) ((head)->stqh_first)
sys/sys/queue.h
463
#define STAILQ_FOREACH(var, head, field) \
sys/sys/queue.h
464
for((var) = STAILQ_FIRST((head)); \
sys/sys/queue.h
468
#define STAILQ_FOREACH_FROM(var, head, field) \
sys/sys/queue.h
469
for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
sys/sys/queue.h
473
#define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
sys/sys/queue.h
474
for ((var) = STAILQ_FIRST((head)); \
sys/sys/queue.h
478
#define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \
sys/sys/queue.h
479
for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
sys/sys/queue.h
483
#define STAILQ_INIT(head) do { \
sys/sys/queue.h
484
STAILQ_FIRST((head)) = NULL; \
sys/sys/queue.h
485
(head)->stqh_last = &STAILQ_FIRST((head)); \
sys/sys/queue.h
488
#define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
sys/sys/queue.h
490
(head)->stqh_last = &STAILQ_NEXT((elm), field); \
sys/sys/queue.h
494
#define STAILQ_INSERT_HEAD(head, elm, field) do { \
sys/sys/queue.h
495
if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
sys/sys/queue.h
496
(head)->stqh_last = &STAILQ_NEXT((elm), field); \
sys/sys/queue.h
497
STAILQ_FIRST((head)) = (elm); \
sys/sys/queue.h
500
#define STAILQ_INSERT_TAIL(head, elm, field) do { \
sys/sys/queue.h
501
QMD_STAILQ_CHECK_TAIL(head); \
sys/sys/queue.h
502
__typeof__((head)->stqh_last) prevlast = (head)->stqh_last; \
sys/sys/queue.h
504
(head)->stqh_last = &STAILQ_NEXT((elm), field); \
sys/sys/queue.h
508
#define STAILQ_LAST(head, type, field) \
sys/sys/queue.h
509
(STAILQ_EMPTY((head)) ? NULL : \
sys/sys/queue.h
510
__containerof((head)->stqh_last, \
sys/sys/queue.h
515
#define STAILQ_REMOVE(head, elm, type, field) do { \
sys/sys/queue.h
517
if (STAILQ_FIRST((head)) == (elm)) { \
sys/sys/queue.h
518
STAILQ_REMOVE_HEAD((head), field); \
sys/sys/queue.h
521
QUEUE_TYPEOF(type) *_Curelm = STAILQ_FIRST(head); \
sys/sys/queue.h
524
STAILQ_REMOVE_AFTER(head, _Curelm, field); \
sys/sys/queue.h
529
#define STAILQ_REMOVE_AFTER(head, elm, field) do { \
sys/sys/queue.h
532
(head)->stqh_last = &STAILQ_NEXT((elm), field); \
sys/sys/queue.h
535
#define STAILQ_REMOVE_HEAD(head, field) do { \
sys/sys/queue.h
536
if ((STAILQ_FIRST((head)) = \
sys/sys/queue.h
537
STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
sys/sys/queue.h
538
(head)->stqh_last = &STAILQ_FIRST((head)); \
sys/sys/queue.h
541
#define STAILQ_SPLIT_AFTER(head, elm, rest, field) do { \
sys/sys/queue.h
542
STAILQ_ASSERT_NONEMPTY((head)); \
sys/sys/queue.h
543
QMD_STAILQ_CHECK_TAIL((head)); \
sys/sys/queue.h
549
(rest)->stqh_last = (head)->stqh_last; \
sys/sys/queue.h
551
(head)->stqh_last = &STAILQ_NEXT((elm), field); \
sys/sys/queue.h
568
#define STAILQ_REVERSE(head, type, field) do { \
sys/sys/queue.h
569
if (STAILQ_EMPTY(head)) \
sys/sys/queue.h
572
for (_Var = STAILQ_FIRST(head), _Varp = NULL; \
sys/sys/queue.h
579
(head)->stqh_last = &STAILQ_NEXT(STAILQ_FIRST(head), field); \
sys/sys/queue.h
580
(head)->stqh_first = _Varp; \
sys/sys/queue.h
583
#define STAILQ_END(head) NULL
sys/sys/queue.h
600
#define LIST_HEAD_INITIALIZER(head) \
sys/sys/queue.h
625
#define QMD_LIST_CHECK_HEAD(head, field) \
sys/sys/queue.h
626
QMD_ASSERT(LIST_FIRST((head)) == NULL || \
sys/sys/queue.h
627
LIST_FIRST((head))->field.le_prev == \
sys/sys/queue.h
628
&LIST_FIRST((head)), \
sys/sys/queue.h
630
(head))
sys/sys/queue.h
653
#define LIST_ASSERT_EMPTY(head) \
sys/sys/queue.h
654
QMD_ASSERT(LIST_EMPTY((head)), \
sys/sys/queue.h
655
"list %p is not empty", (head))
sys/sys/queue.h
657
#define LIST_ASSERT_NONEMPTY(head) \
sys/sys/queue.h
658
QMD_ASSERT(!LIST_EMPTY((head)), \
sys/sys/queue.h
659
"list %p is empty", (head))
sys/sys/queue.h
678
#define LIST_EMPTY(head) ((head)->lh_first == NULL)
sys/sys/queue.h
680
#define LIST_EMPTY_ATOMIC(head) \
sys/sys/queue.h
681
(atomic_load_ptr(&(head)->lh_first) == NULL)
sys/sys/queue.h
683
#define LIST_FIRST(head) ((head)->lh_first)
sys/sys/queue.h
685
#define LIST_FOREACH(var, head, field) \
sys/sys/queue.h
686
for ((var) = LIST_FIRST((head)); \
sys/sys/queue.h
690
#define LIST_FOREACH_FROM(var, head, field) \
sys/sys/queue.h
691
for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
sys/sys/queue.h
695
#define LIST_FOREACH_SAFE(var, head, field, tvar) \
sys/sys/queue.h
696
for ((var) = LIST_FIRST((head)); \
sys/sys/queue.h
700
#define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \
sys/sys/queue.h
701
for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
sys/sys/queue.h
705
#define LIST_INIT(head) do { \
sys/sys/queue.h
706
LIST_FIRST((head)) = NULL; \
sys/sys/queue.h
726
#define LIST_INSERT_HEAD(head, elm, field) do { \
sys/sys/queue.h
727
QMD_LIST_CHECK_HEAD((head), field); \
sys/sys/queue.h
728
if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
sys/sys/queue.h
729
LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
sys/sys/queue.h
730
LIST_FIRST((head)) = (elm); \
sys/sys/queue.h
731
(elm)->field.le_prev = &LIST_FIRST((head)); \
sys/sys/queue.h
736
#define LIST_PREV(elm, head, type, field) \
sys/sys/queue.h
737
((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
sys/sys/queue.h
741
#define LIST_REMOVE_HEAD(head, field) \
sys/sys/queue.h
742
LIST_REMOVE(LIST_FIRST(head), field)
sys/sys/queue.h
772
#define LIST_SPLIT_AFTER(head, elm, rest, field) do { \
sys/sys/queue.h
773
LIST_ASSERT_NONEMPTY((head)); \
sys/sys/queue.h
795
#define LIST_END(head) NULL
sys/sys/queue.h
815
#define TAILQ_HEAD_INITIALIZER(head) \
sys/sys/queue.h
816
{ NULL, &(head).tqh_first, TRACEBUF_INITIALIZER }
sys/sys/queue.h
842
#define QMD_TAILQ_CHECK_HEAD(head, field) \
sys/sys/queue.h
843
QMD_ASSERT(TAILQ_EMPTY(head) || \
sys/sys/queue.h
844
TAILQ_FIRST((head))->field.tqe_prev == \
sys/sys/queue.h
845
&TAILQ_FIRST((head)), \
sys/sys/queue.h
847
(head))
sys/sys/queue.h
854
#define QMD_TAILQ_CHECK_TAIL(head, field) \
sys/sys/queue.h
855
QMD_ASSERT(*(head)->tqh_last == NULL, \
sys/sys/queue.h
857
(head))
sys/sys/queue.h
880
#define TAILQ_ASSERT_EMPTY(head) \
sys/sys/queue.h
881
QMD_ASSERT(TAILQ_EMPTY((head)), \
sys/sys/queue.h
882
"tailq %p is not empty", (head))
sys/sys/queue.h
884
#define TAILQ_ASSERT_NONEMPTY(head) \
sys/sys/queue.h
885
QMD_ASSERT(!TAILQ_EMPTY((head)), \
sys/sys/queue.h
886
"tailq %p is empty", (head))
sys/sys/queue.h
899
#define TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
sys/sys/queue.h
901
#define TAILQ_EMPTY_ATOMIC(head) \
sys/sys/queue.h
902
(atomic_load_ptr(&(head)->tqh_first) == NULL)
sys/sys/queue.h
904
#define TAILQ_FIRST(head) ((head)->tqh_first)
sys/sys/queue.h
906
#define TAILQ_FOREACH(var, head, field) \
sys/sys/queue.h
907
for ((var) = TAILQ_FIRST((head)); \
sys/sys/queue.h
911
#define TAILQ_FOREACH_FROM(var, head, field) \
sys/sys/queue.h
912
for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
sys/sys/queue.h
916
#define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
sys/sys/queue.h
917
for ((var) = TAILQ_FIRST((head)); \
sys/sys/queue.h
921
#define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \
sys/sys/queue.h
922
for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
sys/sys/queue.h
926
#define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
sys/sys/queue.h
927
for ((var) = TAILQ_LAST((head), headname); \
sys/sys/queue.h
931
#define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \
sys/sys/queue.h
932
for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
sys/sys/queue.h
936
#define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
sys/sys/queue.h
937
for ((var) = TAILQ_LAST((head), headname); \
sys/sys/queue.h
941
#define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar)\
sys/sys/queue.h
942
for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
sys/sys/queue.h
946
#define TAILQ_INIT(head) do { \
sys/sys/queue.h
947
TAILQ_FIRST((head)) = NULL; \
sys/sys/queue.h
948
(head)->tqh_last = &TAILQ_FIRST((head)); \
sys/sys/queue.h
949
QMD_TRACE_HEAD(head); \
sys/sys/queue.h
952
#define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
sys/sys/queue.h
958
(head)->tqh_last = &TAILQ_NEXT((elm), field); \
sys/sys/queue.h
959
QMD_TRACE_HEAD(head); \
sys/sys/queue.h
977
#define TAILQ_INSERT_HEAD(head, elm, field) do { \
sys/sys/queue.h
978
QMD_TAILQ_CHECK_HEAD(head, field); \
sys/sys/queue.h
979
if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
sys/sys/queue.h
980
TAILQ_FIRST((head))->field.tqe_prev = \
sys/sys/queue.h
983
(head)->tqh_last = &TAILQ_NEXT((elm), field); \
sys/sys/queue.h
984
TAILQ_FIRST((head)) = (elm); \
sys/sys/queue.h
985
(elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
sys/sys/queue.h
986
QMD_TRACE_HEAD(head); \
sys/sys/queue.h
990
#define TAILQ_INSERT_TAIL(head, elm, field) do { \
sys/sys/queue.h
991
QMD_TAILQ_CHECK_TAIL(head, field); \
sys/sys/queue.h
993
(elm)->field.tqe_prev = (head)->tqh_last; \
sys/sys/queue.h
994
*(head)->tqh_last = (elm); \
sys/sys/queue.h
995
(head)->tqh_last = &TAILQ_NEXT((elm), field); \
sys/sys/queue.h
996
QMD_TRACE_HEAD(head); \
sys/sys/queue_mergesort.h
185
#define SLIST_MERGESORT(head, thunk, cmp, TYPE, NAME) \
sys/sys/queue_mergesort.h
186
SYSQUEUE_MERGESORT((head), (thunk), (cmp), TYPE, NAME, SLIST_HEAD, \
sys/sys/queue_mergesort.h
193
#define LIST_MERGESORT(head, thunk, cmp, TYPE, NAME) \
sys/sys/queue_mergesort.h
194
SYSQUEUE_MERGESORT((head), (thunk), (cmp), TYPE, NAME, LIST_HEAD, \
sys/sys/queue_mergesort.h
201
#define STAILQ_MERGESORT(head, thunk, cmp, TYPE, NAME) \
sys/sys/queue_mergesort.h
202
SYSQUEUE_MERGESORT((head), (thunk), (cmp), TYPE, NAME, STAILQ_HEAD, \
sys/sys/queue_mergesort.h
209
#define TAILQ_MERGESORT(head, thunk, cmp, TYPE, NAME) \
sys/sys/queue_mergesort.h
210
SYSQUEUE_MERGESORT((head), (thunk), (cmp), TYPE, NAME, TAILQ_HEAD, \
sys/sys/queue_mergesort.h
45
#define SLIST_INSERT_AFTER_4(head, slistelm, elm, field) \
sys/sys/queue_mergesort.h
47
#define LIST_INSERT_AFTER_4(head, slistelm, elm, field) \
sys/sys/rangelock.h
51
uintptr_t head;
sys/sys/sglist.h
113
int sglist_split(struct sglist *original, struct sglist **head,
sys/sys/socketvar.h
526
sonewconn(struct socket *head, int connstatus);
sys/sys/tree.h
100
SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
sys/sys/tree.h
1000
struct type *tmp = RB_ROOT(head); \
sys/sys/tree.h
101
(head)->sph_root = tmp; \
sys/sys/tree.h
1014
name##_RB_REINSERT(struct name *head, struct type *elm) \
sys/sys/tree.h
1017
if (((cmpelm = RB_PREV(name, head, elm)) != NULL && \
sys/sys/tree.h
1019
((cmpelm = RB_NEXT(name, head, elm)) != NULL && \
sys/sys/tree.h
1022
RB_REMOVE(name, head, elm); \
sys/sys/tree.h
1023
return (RB_INSERT(name, head, elm)); \
sys/sys/tree.h
104
#define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
sys/sys/tree.h
1043
#define RB_FOREACH(x, name, head) \
sys/sys/tree.h
1044
for ((x) = RB_MIN(name, head); \
sys/sys/tree.h
105
SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
sys/sys/tree.h
1053
#define RB_FOREACH_SAFE(x, name, head, y) \
sys/sys/tree.h
1054
for ((x) = RB_MIN(name, head); \
sys/sys/tree.h
1058
#define RB_FOREACH_REVERSE(x, name, head) \
sys/sys/tree.h
1059
for ((x) = RB_MAX(name, head); \
sys/sys/tree.h
106
SPLAY_LEFT(tmp, field) = (head)->sph_root; \
sys/sys/tree.h
1068
#define RB_FOREACH_REVERSE_SAFE(x, name, head, y) \
sys/sys/tree.h
1069
for ((x) = RB_MAX(name, head); \
sys/sys/tree.h
107
(head)->sph_root = tmp; \
sys/sys/tree.h
110
#define SPLAY_LINKLEFT(head, tmp, field) do { \
sys/sys/tree.h
111
SPLAY_LEFT(tmp, field) = (head)->sph_root; \
sys/sys/tree.h
112
tmp = (head)->sph_root; \
sys/sys/tree.h
113
(head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
sys/sys/tree.h
116
#define SPLAY_LINKRIGHT(head, tmp, field) do { \
sys/sys/tree.h
117
SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
sys/sys/tree.h
118
tmp = (head)->sph_root; \
sys/sys/tree.h
119
(head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
sys/sys/tree.h
122
#define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
sys/sys/tree.h
123
SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
sys/sys/tree.h
124
SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
sys/sys/tree.h
125
SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
sys/sys/tree.h
126
SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
sys/sys/tree.h
139
name##_SPLAY_FIND(struct name *head, struct type *elm) \
sys/sys/tree.h
141
if (SPLAY_EMPTY(head)) \
sys/sys/tree.h
143
name##_SPLAY(head, elm); \
sys/sys/tree.h
144
if ((cmp)(elm, (head)->sph_root) == 0) \
sys/sys/tree.h
145
return (head->sph_root); \
sys/sys/tree.h
150
name##_SPLAY_NEXT(struct name *head, struct type *elm) \
sys/sys/tree.h
152
name##_SPLAY(head, elm); \
sys/sys/tree.h
164
name##_SPLAY_MIN_MAX(struct name *head, int val) \
sys/sys/tree.h
166
name##_SPLAY_MINMAX(head, val); \
sys/sys/tree.h
167
return (SPLAY_ROOT(head)); \
sys/sys/tree.h
175
name##_SPLAY_INSERT(struct name *head, struct type *elm) \
sys/sys/tree.h
177
if (SPLAY_EMPTY(head)) { \
sys/sys/tree.h
181
name##_SPLAY(head, elm); \
sys/sys/tree.h
182
__comp = (cmp)(elm, (head)->sph_root); \
sys/sys/tree.h
184
SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
sys/sys/tree.h
185
SPLAY_RIGHT(elm, field) = (head)->sph_root; \
sys/sys/tree.h
186
SPLAY_LEFT((head)->sph_root, field) = NULL; \
sys/sys/tree.h
188
SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
sys/sys/tree.h
189
SPLAY_LEFT(elm, field) = (head)->sph_root; \
sys/sys/tree.h
190
SPLAY_RIGHT((head)->sph_root, field) = NULL; \
sys/sys/tree.h
192
return ((head)->sph_root); \
sys/sys/tree.h
194
(head)->sph_root = (elm); \
sys/sys/tree.h
199
name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
sys/sys/tree.h
202
if (SPLAY_EMPTY(head)) \
sys/sys/tree.h
204
name##_SPLAY(head, elm); \
sys/sys/tree.h
205
if ((cmp)(elm, (head)->sph_root) == 0) { \
sys/sys/tree.h
206
if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
sys/sys/tree.h
207
(head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
sys/sys/tree.h
209
__tmp = SPLAY_RIGHT((head)->sph_root, field); \
sys/sys/tree.h
210
(head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
sys/sys/tree.h
211
name##_SPLAY(head, elm); \
sys/sys/tree.h
212
SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
sys/sys/tree.h
220
name##_SPLAY(struct name *head, struct type *elm) \
sys/sys/tree.h
228
while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) { \
sys/sys/tree.h
230
__tmp = SPLAY_LEFT((head)->sph_root, field); \
sys/sys/tree.h
234
SPLAY_ROTATE_RIGHT(head, __tmp, field); \
sys/sys/tree.h
235
if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
sys/sys/tree.h
238
SPLAY_LINKLEFT(head, __right, field); \
sys/sys/tree.h
240
__tmp = SPLAY_RIGHT((head)->sph_root, field); \
sys/sys/tree.h
244
SPLAY_ROTATE_LEFT(head, __tmp, field); \
sys/sys/tree.h
245
if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
sys/sys/tree.h
248
SPLAY_LINKRIGHT(head, __left, field); \
sys/sys/tree.h
251
SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
sys/sys/tree.h
257
void name##_SPLAY_MINMAX(struct name *head, int __comp) \
sys/sys/tree.h
266
__tmp = SPLAY_LEFT((head)->sph_root, field); \
sys/sys/tree.h
270
SPLAY_ROTATE_RIGHT(head, __tmp, field); \
sys/sys/tree.h
271
if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
sys/sys/tree.h
274
SPLAY_LINKLEFT(head, __right, field); \
sys/sys/tree.h
276
__tmp = SPLAY_RIGHT((head)->sph_root, field); \
sys/sys/tree.h
280
SPLAY_ROTATE_LEFT(head, __tmp, field); \
sys/sys/tree.h
281
if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
sys/sys/tree.h
284
SPLAY_LINKRIGHT(head, __left, field); \
sys/sys/tree.h
287
SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
sys/sys/tree.h
302
#define SPLAY_FOREACH(x, name, head) \
sys/sys/tree.h
303
for ((x) = SPLAY_MIN(name, head); \
sys/sys/tree.h
305
(x) = SPLAY_NEXT(name, head, x))
sys/sys/tree.h
348
#define RB_ROOT(head) (head)->rbh_root
sys/sys/tree.h
349
#define RB_EMPTY(head) (RB_ROOT(head) == NULL)
sys/sys/tree.h
383
#define RB_SWAP_CHILD(head, par, out, in, field) do { \
sys/sys/tree.h
385
RB_ROOT(head) = (in); \
sys/sys/tree.h
529
name##_RB_INSERT_COLOR(struct name *head, \
sys/sys/tree.h
620
RB_SWAP_CHILD(head, gpar, parent, child, field); \
sys/sys/tree.h
646
name##_RB_REMOVE_COLOR(struct name *head, \
sys/sys/tree.h
755
RB_SWAP_CHILD(head, gpar, parent, elm, field); \
sys/sys/tree.h
777
name##_RB_REMOVE(struct name *head, struct type *out) \
sys/sys/tree.h
803
RB_SWAP_CHILD(head, opar, out, in, field); \
sys/sys/tree.h
807
opar = name##_RB_REMOVE_COLOR(head, parent, child); \
sys/sys/tree.h
831
name##_RB_INSERT_FINISH(struct name *head, struct type *parent, \
sys/sys/tree.h
839
tmp = name##_RB_INSERT_COLOR(head, parent, elm); \
sys/sys/tree.h
854
name##_RB_INSERT(struct name *head, struct type *elm) \
sys/sys/tree.h
857
struct type **tmpp = &RB_ROOT(head); \
sys/sys/tree.h
870
return (name##_RB_INSERT_FINISH(head, parent, tmpp, elm)); \
sys/sys/tree.h
876
name##_RB_FIND(struct name *head, struct type *elm) \
sys/sys/tree.h
878
struct type *tmp = RB_ROOT(head); \
sys/sys/tree.h
895
name##_RB_NFIND(struct name *head, struct type *elm) \
sys/sys/tree.h
897
struct type *tmp = RB_ROOT(head); \
sys/sys/tree.h
94
#define SPLAY_ROOT(head) (head)->sph_root
sys/sys/tree.h
943
name##_RB_INSERT_NEXT(struct name *head, \
sys/sys/tree.h
95
#define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
sys/sys/tree.h
956
return (name##_RB_INSERT_FINISH(head, elm, tmpp, next)); \
sys/sys/tree.h
98
#define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
sys/sys/tree.h
980
name##_RB_INSERT_PREV(struct name *head, \
sys/sys/tree.h
99
SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
sys/sys/tree.h
993
return (name##_RB_INSERT_FINISH(head, elm, tmpp, prev)); \
sys/sys/tree.h
998
name##_RB_MINMAX(struct name *head, int val) \
sys/sys/umtxvar.h
157
struct umtxq_head head;
sys/ufs/ffs/ffs_softdep.c
1004
LIST_INSERT_HEAD(head, item, wk_list);
sys/ufs/ffs/ffs_softdep.c
961
#define WORKLIST_INSERT(head, item) do { \
sys/ufs/ffs/ffs_softdep.c
963
LIST_INSERT_HEAD(head, item, wk_list); \
sys/ufs/ffs/ffs_softdep.c
977
#define WORKLIST_INSERT(head, item) \
sys/ufs/ffs/ffs_softdep.c
978
worklist_insert(head, item, 1, __func__, __LINE__)
sys/ufs/ffs/ffs_softdep.c
979
#define WORKLIST_INSERT_UNLOCKED(head, item)\
sys/ufs/ffs/ffs_softdep.c
980
worklist_insert(head, item, 0, __func__, __LINE__)
sys/ufs/ffs/ffs_softdep.c
987
worklist_insert(struct workhead *head,
sys/x86/iommu/amd_cmd.c
118
uint64_t head;
sys/x86/iommu/amd_cmd.c
128
head = amdiommu_read8(unit, AMDIOMMU_CMDBUF_HEAD);
sys/x86/iommu/amd_cmd.c
129
head &= AMDIOMMU_CMDPTR_MASK;
sys/x86/iommu/amd_cmd.c
130
unit->x86c.inv_queue_avail = head - unit->x86c.inv_queue_tail -
sys/x86/iommu/amd_cmd.c
132
if (head <= unit->x86c.inv_queue_tail)
sys/x86/iommu/intel_qi.c
101
uint32_t head;
sys/x86/iommu/intel_qi.c
111
head = dmar_read4(unit, DMAR_IQH_REG);
sys/x86/iommu/intel_qi.c
112
head &= DMAR_IQH_MASK;
sys/x86/iommu/intel_qi.c
113
unit->x86c.inv_queue_avail = head - unit->x86c.inv_queue_tail -
sys/x86/iommu/intel_qi.c
115
if (head <= unit->x86c.inv_queue_tail)
sys/x86/iommu/iommu_utils.c
475
struct iommu_map_entry *entry, *head;
sys/x86/iommu/iommu_utils.c
478
for (head = x86c->tlb_flush_head;; head = entry) {
sys/x86/iommu/iommu_utils.c
480
atomic_load_acq_ptr((uintptr_t *)&head->tlb_flush_next);
sys/x86/iommu/iommu_utils.c
485
iommu_gas_free_entry(head);
sys/xen/gnttab.h
100
void gnttab_free_grant_references(grant_ref_t head);
tests/sys/netmap/ctrl-api-test.c
2021
ckroff(head, 20);
tools/tools/drm/radeon/mkregtable/mkregtable.c
169
static inline void list_move(struct list_head *list, struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
172
list_add(list, head);
tools/tools/drm/radeon/mkregtable/mkregtable.c
181
struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
184
list_add_tail(list, head);
tools/tools/drm/radeon/mkregtable/mkregtable.c
193
const struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
195
return list->next == head;
tools/tools/drm/radeon/mkregtable/mkregtable.c
202
static inline int list_empty(const struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
204
return head->next == head;
tools/tools/drm/radeon/mkregtable/mkregtable.c
220
static inline int list_empty_careful(const struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
222
struct list_head *next = head->next;
tools/tools/drm/radeon/mkregtable/mkregtable.c
223
return (next == head) && (next == head->prev);
tools/tools/drm/radeon/mkregtable/mkregtable.c
230
static inline int list_is_singular(const struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
232
return !list_empty(head) && (head->next == head->prev);
tools/tools/drm/radeon/mkregtable/mkregtable.c
236
struct list_head *head,
tools/tools/drm/radeon/mkregtable/mkregtable.c
240
list->next = head->next;
tools/tools/drm/radeon/mkregtable/mkregtable.c
244
head->next = new_first;
tools/tools/drm/radeon/mkregtable/mkregtable.c
245
new_first->prev = head;
tools/tools/drm/radeon/mkregtable/mkregtable.c
263
struct list_head *head,
tools/tools/drm/radeon/mkregtable/mkregtable.c
266
if (list_empty(head))
tools/tools/drm/radeon/mkregtable/mkregtable.c
268
if (list_is_singular(head) && (head->next != entry && head != entry))
tools/tools/drm/radeon/mkregtable/mkregtable.c
270
if (entry == head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
273
__list_cut_position(list, head, entry);
tools/tools/drm/radeon/mkregtable/mkregtable.c
295
struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
298
__list_splice(list, head, head->next);
tools/tools/drm/radeon/mkregtable/mkregtable.c
307
struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
310
__list_splice(list, head->prev, head);
tools/tools/drm/radeon/mkregtable/mkregtable.c
321
struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
324
__list_splice(list, head, head->next);
tools/tools/drm/radeon/mkregtable/mkregtable.c
338
struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
341
__list_splice(list, head->prev, head);
tools/tools/drm/radeon/mkregtable/mkregtable.c
371
#define list_for_each(pos, head) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
372
for (pos = (head)->next; prefetch(pos->next), pos != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
385
#define __list_for_each(pos, head) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
386
for (pos = (head)->next; pos != (head); pos = pos->next)
tools/tools/drm/radeon/mkregtable/mkregtable.c
393
#define list_for_each_prev(pos, head) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
394
for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
403
#define list_for_each_safe(pos, n, head) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
404
for (pos = (head)->next, n = pos->next; pos != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
413
#define list_for_each_prev_safe(pos, n, head) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
414
for (pos = (head)->prev, n = pos->prev; \
tools/tools/drm/radeon/mkregtable/mkregtable.c
415
prefetch(pos->prev), pos != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
424
#define list_for_each_entry(pos, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
425
for (pos = list_entry((head)->next, typeof(*pos), member); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
426
&pos->member != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
435
#define list_for_each_entry_reverse(pos, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
436
for (pos = list_entry((head)->prev, typeof(*pos), member); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
437
prefetch(pos->member.prev), &pos->member != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
448
#define list_prepare_entry(pos, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
449
((pos) ? : list_entry(head, typeof(*pos), member))
tools/tools/drm/radeon/mkregtable/mkregtable.c
460
#define list_for_each_entry_continue(pos, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
462
prefetch(pos->member.next), &pos->member != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
474
#define list_for_each_entry_continue_reverse(pos, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
476
prefetch(pos->member.prev), &pos->member != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
487
#define list_for_each_entry_from(pos, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
488
for (; prefetch(pos->member.next), &pos->member != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
498
#define list_for_each_entry_safe(pos, n, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
499
for (pos = list_entry((head)->next, typeof(*pos), member), \
tools/tools/drm/radeon/mkregtable/mkregtable.c
501
&pos->member != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
514
#define list_for_each_entry_safe_continue(pos, n, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
517
&pos->member != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
530
#define list_for_each_entry_safe_from(pos, n, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
532
&pos->member != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
545
#define list_for_each_entry_safe_reverse(pos, n, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
546
for (pos = list_entry((head)->prev, typeof(*pos), member), \
tools/tools/drm/radeon/mkregtable/mkregtable.c
548
&pos->member != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
84
static inline void list_add(struct list_head *new, struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
86
__list_add(new, head, head->next);
tools/tools/drm/radeon/mkregtable/mkregtable.c
97
static inline void list_add_tail(struct list_head *new, struct list_head *head)
tools/tools/drm/radeon/mkregtable/mkregtable.c
99
__list_add(new, head->prev, head);
tools/tools/netmap/bridge.c
126
rxring->head = rxring->cur = j;
tools/tools/netmap/bridge.c
127
txring->head = txring->cur = k;
tools/tools/netmap/bridge.c
356
NETMAP_RXRING(pa->nifp, pa->cur_rx_ring)->head,
tools/tools/netmap/bridge.c
361
NETMAP_RXRING(pb->nifp, pb->cur_rx_ring)->head,
tools/tools/netmap/bridge.c
369
rx->head, rx->cur, rx->tail);
tools/tools/netmap/bridge.c
374
rx->head, rx->cur, rx->tail);
tools/tools/netmap/bridge.c
78
j = rxring->head; /* RX */
tools/tools/netmap/bridge.c
79
k = txring->head; /* TX */
tools/tools/netmap/lb.c
1010
int next_head = rxring->head;
tools/tools/netmap/lb.c
1039
rxring->head = rxring->cur = next_head;
tools/tools/netmap/lb.c
112
uint32_t head;
tools/tools/netmap/lb.c
149
struct netmap_slot s = q->slots[q->head];
tools/tools/netmap/lb.c
155
q->head++;
tools/tools/netmap/lb.c
156
if (q->head >= q->size)
tools/tools/netmap/lb.c
157
q->head = 0;
tools/tools/netmap/lb.c
537
ring->head = mf->shadow_head;
tools/tools/netmap/lb.c
540
curmf, ts->flags, mf->shadow_head, ring->head, ring->tail);
tools/tools/netmap/lb.c
555
for (scan = ring->head; scan != mf->shadow_head;
tools/tools/netmap/lb.c
561
mf->shadow_head = ring->head;
tools/tools/netmap/lb.c
834
mf->shadow_head = p->ring->head;
tools/tools/netmap/lb.c
907
ring->cur = pending ? ring->tail : ring->head;
tools/tools/netmap/lb.c
998
ring->head = mf->shadow_head;
tools/tools/netmap/pkt-gen.c
1263
u_int n, sent, head = ring->head;
tools/tools/netmap/pkt-gen.c
1266
struct netmap_slot *slot = &ring->slot[head];
tools/tools/netmap/pkt-gen.c
1272
struct netmap_slot *slot = &ring->slot[head];
tools/tools/netmap/pkt-gen.c
1276
head = nm_ring_next(ring, head);
tools/tools/netmap/pkt-gen.c
1278
head = ring->head;
tools/tools/netmap/pkt-gen.c
1286
slot = &ring->slot[head];
tools/tools/netmap/pkt-gen.c
1305
dump_payload(fp, frag_size, ring, head);
tools/tools/netmap/pkt-gen.c
1308
head = nm_ring_next(ring, head);
tools/tools/netmap/pkt-gen.c
1309
slot = &ring->slot[head];
tools/tools/netmap/pkt-gen.c
1328
dump_payload(p, tosend, ring, head);
tools/tools/netmap/pkt-gen.c
1329
head = nm_ring_next(ring, head);
tools/tools/netmap/pkt-gen.c
1333
ring->head = ring->cur = head;
tools/tools/netmap/pkt-gen.c
1438
slot = &ring->slot[ring->head];
tools/tools/netmap/pkt-gen.c
1454
ring->head = ring->cur = nm_ring_next(ring, ring->head);
tools/tools/netmap/pkt-gen.c
1492
slot = &ring->slot[ring->head];
tools/tools/netmap/pkt-gen.c
1517
ring->head = ring->cur = nm_ring_next(ring, ring->head);
tools/tools/netmap/pkt-gen.c
1617
txhead = txring->head;
tools/tools/netmap/pkt-gen.c
1624
uint32_t head = rxring->head;
tools/tools/netmap/pkt-gen.c
1625
struct netmap_slot *slot = &rxring->slot[head];
tools/tools/netmap/pkt-gen.c
1629
rxring->head = rxring->cur = nm_ring_next(rxring, head);
tools/tools/netmap/pkt-gen.c
1659
txring->head = txring->cur = txhead;
tools/tools/netmap/pkt-gen.c
1848
txring->tail, txring->head,
tools/tools/netmap/pkt-gen.c
1858
txring->tail, txring->head, i);
tools/tools/netmap/pkt-gen.c
1894
u_int head, rx, n;
tools/tools/netmap/pkt-gen.c
1901
head = ring->head;
tools/tools/netmap/pkt-gen.c
1906
struct netmap_slot *slot = &ring->slot[head];
tools/tools/netmap/pkt-gen.c
1911
dump_payload(p, slot->len, ring, head);
tools/tools/netmap/pkt-gen.c
1915
head = nm_ring_next(ring, head);
tools/tools/netmap/pkt-gen.c
1917
ring->head = ring->cur = head;
tools/tools/netmap/pkt-gen.c
2009
m = rxring->head + rxring->num_slots - rxring->tail;
tools/tools/netmap/pkt-gen.c
2091
unsigned int head;
tools/tools/netmap/pkt-gen.c
2147
for (fcnt = frags, head = ring->head;
tools/tools/netmap/pkt-gen.c
2149
struct netmap_slot *slot = &ring->slot[head];
tools/tools/netmap/pkt-gen.c
2171
dump_payload(p, size, ring, head);
tools/tools/netmap/pkt-gen.c
2189
head = nm_ring_next(ring, head);
tools/tools/netmap/pkt-gen.c
2195
ring->cur = ring->head = head;
tools/tools/netmap/pkt-gen.c
2205
ring->tail, ring->head,
tools/tools/netmap/pkt-gen.c
2212
ring->tail, ring->head, targ->nmd->first_tx_ring);
tools/tools/netmap/pkt-gen.c
2231
multi_slot_to_string(struct netmap_ring *ring, unsigned int head,
tools/tools/netmap/pkt-gen.c
2238
struct netmap_slot *slot = &ring->slot[head];
tools/tools/netmap/pkt-gen.c
2247
head = nm_ring_next(ring, head);
tools/tools/netmap/pkt-gen.c
2295
unsigned int head;
tools/tools/netmap/pkt-gen.c
2346
for (head = ring->head, i = 0; i < limit; i++) {
tools/tools/netmap/pkt-gen.c
2347
struct netmap_slot *slot = &ring->slot[head];
tools/tools/netmap/pkt-gen.c
2353
dump_payload(p, slot->len, ring, head);
tools/tools/netmap/pkt-gen.c
2364
multi_slot_to_string(ring, head-frags+1,
tools/tools/netmap/pkt-gen.c
2411
head = nm_ring_next(ring, head);
tools/tools/netmap/pkt-gen.c
2415
ring->cur = ring->head = head;
tools/tools/switch_tls/switch_tls.c
226
struct xinpgen *head, *xinp;
tools/tools/switch_tls/switch_tls.c
233
head = getxpcblist("net.inet.tcp.pcblist");
tools/tools/switch_tls/switch_tls.c
238
for (xinp = XINP_NEXT(head); xinp->xig_len > sizeof *xinp;
tools/tools/switch_tls/switch_tls.c
249
if (xip->inp_gencnt > head->xig_gen)
tools/tools/switch_tls/switch_tls.c
264
free(head);
usr.bin/ctags/ctags.c
153
if (head) {
usr.bin/ctags/ctags.c
155
put_entries(head);
usr.bin/ctags/ctags.c
207
put_entries(head);
usr.bin/ctags/ctags.c
52
NODE *head; /* head of the sorted binary tree */
usr.bin/ctags/ctags.h
68
extern NODE *head; /* head of the sorted binary tree */
usr.bin/ctags/tree.c
58
put_entries(head);
usr.bin/ctags/tree.c
59
free_tree(head);
usr.bin/ctags/tree.c
61
if (!(head = np = (NODE *)malloc(sizeof(NODE))))
usr.bin/ctags/tree.c
82
if (!head)
usr.bin/ctags/tree.c
83
head = np;
usr.bin/ctags/tree.c
85
add_node(np, head);
usr.bin/dtc/fdt.cc
1733
dtb::header head;
usr.bin/dtc/fdt.cc
1766
head.size_dt_strings = strings_writer.size();
usr.bin/dtc/fdt.cc
1777
head.totalsize = sizeof(head) + strings_writer.size() +
usr.bin/dtc/fdt.cc
1779
while (head.totalsize < minimum_blob_size)
usr.bin/dtc/fdt.cc
1781
head.totalsize++;
usr.bin/dtc/fdt.cc
1784
head.off_dt_struct = sizeof(head) + reservation_writer.size();;
usr.bin/dtc/fdt.cc
1785
head.off_dt_strings = head.off_dt_struct + struct_writer.size();
usr.bin/dtc/fdt.cc
1786
head.off_mem_rsvmap = sizeof(head);
usr.bin/dtc/fdt.cc
1787
head.boot_cpuid_phys = boot_cpu;
usr.bin/dtc/fdt.cc
1788
head.size_dt_struct = struct_writer.size();
usr.bin/dtc/fdt.cc
1789
head.write(head_writer);
usr.bin/fortune/fortune/fortune.c
443
add_file(int percent, const char *file, const char *dir, FILEDESC **head,
usr.bin/fortune/fortune/fortune.c
511
head, tail, parent);
usr.bin/fortune/fortune/fortune.c
561
if (*head == NULL)
usr.bin/fortune/fortune/fortune.c
562
*head = *tail = fp;
usr.bin/fortune/fortune/fortune.c
569
(*head)->prev = fp;
usr.bin/fortune/fortune/fortune.c
570
fp->next = *head;
usr.bin/fortune/fortune/fortune.c
571
*head = fp;
usr.bin/fstat/fstat.c
217
struct filestat_list *head;
usr.bin/fstat/fstat.c
224
head = procstat_getfiles(procstat, kp, mflg);
usr.bin/fstat/fstat.c
225
if (head == NULL)
usr.bin/fstat/fstat.c
227
STAILQ_FOREACH(fst, head, next)
usr.bin/fstat/fstat.c
229
procstat_freefiles(procstat, head);
usr.bin/fstat/fuser.c
278
struct filestat_list *head;
usr.bin/fstat/fuser.c
283
head = procstat_getfiles(procstat, kp, flags & MFLAG);
usr.bin/fstat/fuser.c
284
if (head == NULL)
usr.bin/fstat/fuser.c
286
STAILQ_FOREACH(fst, head, next) {
usr.bin/fstat/fuser.c
338
procstat_freefiles(procstat, head);
usr.bin/head/head.c
142
head(fp, linecnt);
usr.bin/head/head.c
148
head(stdin, linecnt);
usr.bin/head/head.c
57
static void head(FILE *, intmax_t);
usr.bin/localedef/collate.c
1095
#define RB_COUNT(x, name, head, cnt) do { \
usr.bin/localedef/collate.c
1097
RB_FOREACH(x, name, (head)) { \
usr.bin/localedef/collate.c
1102
#define RB_NUMNODES(type, name, head, cnt) do { \
usr.bin/localedef/collate.c
1105
RB_FOREACH(t, name, head) { \
usr.bin/mail/cmd3.c
201
struct header head;
usr.bin/mail/cmd3.c
234
head.h_to = np;
usr.bin/mail/cmd3.c
235
if ((head.h_subject = hfield("subject", mp)) == NULL)
usr.bin/mail/cmd3.c
236
head.h_subject = hfield("subj", mp);
usr.bin/mail/cmd3.c
237
head.h_subject = reedit(head.h_subject);
usr.bin/mail/cmd3.c
244
head.h_cc = np;
usr.bin/mail/cmd3.c
246
head.h_cc = NULL;
usr.bin/mail/cmd3.c
247
head.h_bcc = NULL;
usr.bin/mail/cmd3.c
248
head.h_smopts = NULL;
usr.bin/mail/cmd3.c
249
head.h_replyto = value("REPLYTO");
usr.bin/mail/cmd3.c
250
head.h_inreplyto = skin(hfield("message-id", mp));
usr.bin/mail/cmd3.c
251
mail1(&head, 1);
usr.bin/mail/cmd3.c
587
struct header head;
usr.bin/mail/cmd3.c
592
head.h_to = NULL;
usr.bin/mail/cmd3.c
599
head.h_to = cat(head.h_to, extract(cp, GTO));
usr.bin/mail/cmd3.c
602
if (head.h_to == NULL)
usr.bin/mail/cmd3.c
605
if ((head.h_subject = hfield("subject", mp)) == NULL)
usr.bin/mail/cmd3.c
606
head.h_subject = hfield("subj", mp);
usr.bin/mail/cmd3.c
607
head.h_subject = reedit(head.h_subject);
usr.bin/mail/cmd3.c
608
head.h_cc = NULL;
usr.bin/mail/cmd3.c
609
head.h_bcc = NULL;
usr.bin/mail/cmd3.c
610
head.h_smopts = NULL;
usr.bin/mail/cmd3.c
611
head.h_replyto = value("REPLYTO");
usr.bin/mail/cmd3.c
612
head.h_inreplyto = mid;
usr.bin/mail/cmd3.c
613
mail1(&head, 1);
usr.bin/mail/send.c
244
struct header head;
usr.bin/mail/send.c
246
head.h_to = to;
usr.bin/mail/send.c
247
head.h_subject = subject;
usr.bin/mail/send.c
248
head.h_cc = cc;
usr.bin/mail/send.c
249
head.h_bcc = bcc;
usr.bin/mail/send.c
250
head.h_smopts = smopts;
usr.bin/mail/send.c
251
head.h_replyto = replyto;
usr.bin/mail/send.c
252
head.h_inreplyto = NULL;
usr.bin/mail/send.c
253
mail1(&head, 0);
usr.bin/mail/send.c
265
struct header head;
usr.bin/mail/send.c
267
head.h_to = extract(str, GTO);
usr.bin/mail/send.c
268
head.h_subject = NULL;
usr.bin/mail/send.c
269
head.h_cc = NULL;
usr.bin/mail/send.c
270
head.h_bcc = NULL;
usr.bin/mail/send.c
271
head.h_smopts = NULL;
usr.bin/mail/send.c
272
head.h_replyto = value("REPLYTO");
usr.bin/mail/send.c
273
head.h_inreplyto = NULL;
usr.bin/mail/send.c
274
mail1(&head, 0);
usr.bin/netstat/unix.c
145
KREAD(head_off, &head, sizeof(head));
usr.bin/netstat/unix.c
146
LIST_FOREACH(unp, &head, unp_link) {
usr.bin/netstat/unix.c
97
struct unp_head head;
usr.bin/paste/paste.c
132
static STAILQ_HEAD(head, _list) lh;
usr.bin/procstat/procstat_files.c
298
struct filestat_list *head;
usr.bin/procstat/procstat_files.c
314
head = procstat_getfiles(procstat, kipp, 0);
usr.bin/procstat/procstat_files.c
315
if (head != NULL &&
usr.bin/procstat/procstat_files.c
317
STAILQ_FOREACH(fst, head, next) {
usr.bin/procstat/procstat_files.c
338
if (head == NULL)
usr.bin/procstat/procstat_files.c
343
STAILQ_FOREACH(fst, head, next) {
usr.bin/procstat/procstat_files.c
605
procstat_freefiles(procstat, head);
usr.bin/procstat/procstat_pwdx.c
52
struct filestat_list *head;
usr.bin/procstat/procstat_pwdx.c
55
head = procstat_getfiles(procstat, kipp, 0);
usr.bin/procstat/procstat_pwdx.c
56
if (head == NULL)
usr.bin/procstat/procstat_pwdx.c
58
STAILQ_FOREACH(fst, head, next) {
usr.bin/procstat/procstat_pwdx.c
66
procstat_freefiles(procstat, head);
usr.bin/rpcinfo/rpcinfo.c
463
struct pmaplist *head = NULL;
usr.bin/rpcinfo/rpcinfo.c
501
NULL, (xdrproc_t) xdr_pmaplist_ptr, (char *)&head,
usr.bin/rpcinfo/rpcinfo.c
522
if (head == NULL) {
usr.bin/rpcinfo/rpcinfo.c
526
for (; head != NULL; head = head->pml_next) {
usr.bin/rpcinfo/rpcinfo.c
528
head->pml_map.pm_prog,
usr.bin/rpcinfo/rpcinfo.c
529
head->pml_map.pm_vers);
usr.bin/rpcinfo/rpcinfo.c
530
if (head->pml_map.pm_prot == IPPROTO_UDP)
usr.bin/rpcinfo/rpcinfo.c
532
else if (head->pml_map.pm_prot == IPPROTO_TCP)
usr.bin/rpcinfo/rpcinfo.c
534
else if (head->pml_map.pm_prot == IPPROTO_ST)
usr.bin/rpcinfo/rpcinfo.c
537
printf("%6ld", head->pml_map.pm_prot);
usr.bin/rpcinfo/rpcinfo.c
538
printf("%7ld", head->pml_map.pm_port);
usr.bin/rpcinfo/rpcinfo.c
539
rpc = getrpcbynumber(head->pml_map.pm_prog);
usr.bin/rpcinfo/rpcinfo.c
673
rpcblist_ptr head = NULL;
usr.bin/rpcinfo/rpcinfo.c
715
NULL, (xdrproc_t) xdr_rpcblist_ptr, (char *) &head,
usr.bin/rpcinfo/rpcinfo.c
728
(xdrproc_t) xdr_rpcblist_ptr, (char *) &head,
usr.bin/rpcinfo/rpcinfo.c
749
for (head = NULL; pmaphead != NULL;
usr.bin/rpcinfo/rpcinfo.c
754
if (head == NULL)
usr.bin/rpcinfo/rpcinfo.c
755
head = list;
usr.bin/rpcinfo/rpcinfo.c
791
if (head == NULL) {
usr.bin/rpcinfo/rpcinfo.c
796
for (; head != NULL; head = head->rpcb_next) {
usr.bin/rpcinfo/rpcinfo.c
798
head->rpcb_map.r_prog, head->rpcb_map.r_vers);
usr.bin/rpcinfo/rpcinfo.c
799
printf("%-9s ", head->rpcb_map.r_netid);
usr.bin/rpcinfo/rpcinfo.c
800
printf("%-22s", head->rpcb_map.r_addr);
usr.bin/rpcinfo/rpcinfo.c
801
rpc = getrpcbynumber(head->rpcb_map.r_prog);
usr.bin/rpcinfo/rpcinfo.c
806
printf(" %s\n", head->rpcb_map.r_owner);
usr.bin/rpcinfo/rpcinfo.c
809
for (; head != NULL; head = head->rpcb_next) {
usr.bin/rpcinfo/rpcinfo.c
811
if (head->rpcb_map.r_prog == rs->prog)
usr.bin/rpcinfo/rpcinfo.c
826
rs->prog = head->rpcb_map.r_prog;
usr.bin/rpcinfo/rpcinfo.c
827
rs->owner = head->rpcb_map.r_owner;
usr.bin/rpcinfo/rpcinfo.c
831
if (add_version(rs, head->rpcb_map.r_vers) == FALSE)
usr.bin/rpcinfo/rpcinfo.c
833
if (add_netid(rs, head->rpcb_map.r_netid) == FALSE)
usr.bin/rpcinfo/rpcinfo.c
875
rpcb_entry_list_ptr head = NULL;
usr.bin/rpcinfo/rpcinfo.c
936
(char *) &head, minutetimeout) != RPC_SUCCESS) {
usr.bin/rpcinfo/rpcinfo.c
940
if (head == NULL) {
usr.bin/rpcinfo/rpcinfo.c
945
for (; head != NULL; head = head->rpcb_entry_next) {
usr.bin/rpcinfo/rpcinfo.c
949
re = &head->rpcb_entry_map;
usr.bin/tail/reverse.c
193
TAILQ_HEAD(bfhead, bfelem) head;
usr.bin/tail/reverse.c
195
TAILQ_INIT(&head);
usr.bin/tail/reverse.c
206
first = TAILQ_FIRST(&head);
usr.bin/tail/reverse.c
207
if (TAILQ_EMPTY(&head))
usr.bin/tail/reverse.c
210
TAILQ_REMOVE(&head, first, entries);
usr.bin/tail/reverse.c
213
TAILQ_INSERT_TAIL(&head, tl, entries);
usr.bin/tail/reverse.c
242
tl = TAILQ_LAST(&head, bfhead);
usr.bin/tail/reverse.c
243
first = TAILQ_FIRST(&head);
usr.bin/tail/reverse.c
264
TAILQ_FOREACH_FROM_SAFE(tr, &head,
usr.bin/tail/reverse.c
268
TAILQ_REMOVE(&head, tr,
usr.bin/tail/reverse.c
278
TAILQ_REMOVE(&head, first, entries);
usr.bin/tee/tee.c
110
STAILQ_FOREACH(p, &head, entries) {
usr.bin/tee/tee.c
153
STAILQ_INSERT_HEAD(&head, p, entries);
usr.bin/tee/tee.c
54
static STAILQ_HEAD(, entry) head = STAILQ_HEAD_INITIALIZER(head);
usr.sbin/bhyve/gdb.c
1973
uint8_t *head, *hash, *p, sum;
usr.sbin/bhyve/gdb.c
1980
head = io_buffer_head(&cur_comm);
usr.sbin/bhyve/gdb.c
1981
switch (*head) {
usr.sbin/bhyve/gdb.c
2023
hash = memchr(head, '#', avail);
usr.sbin/bhyve/gdb.c
2026
plen = (hash - head + 1) + 2;
usr.sbin/bhyve/gdb.c
2029
debug("<- %.*s\n", (int)plen, head);
usr.sbin/bhyve/gdb.c
2032
for (sum = 0, p = head + 1; p < hash; p++)
usr.sbin/bhyve/gdb.c
2043
handle_command(head + 1, hash - (head + 1));
usr.sbin/bhyve/gdb.c
2051
debug("-> %02x\n", *head);
usr.sbin/bhyve/net_backend_netmap.c
180
uint32_t head;
usr.sbin/bhyve/net_backend_netmap.c
185
head = ring->head;
usr.sbin/bhyve/net_backend_netmap.c
186
if (head == ring->tail) {
usr.sbin/bhyve/net_backend_netmap.c
190
nm_buf = NETMAP_BUF(ring, ring->slot[head].buf_idx);
usr.sbin/bhyve/net_backend_netmap.c
220
ring->slot[head].len = nm_buf_len;
usr.sbin/bhyve/net_backend_netmap.c
221
ring->slot[head].flags = NS_MOREFRAG;
usr.sbin/bhyve/net_backend_netmap.c
222
head = nm_ring_next(ring, head);
usr.sbin/bhyve/net_backend_netmap.c
223
if (head == ring->tail) {
usr.sbin/bhyve/net_backend_netmap.c
232
nm_buf = NETMAP_BUF(ring, ring->slot[head].buf_idx);
usr.sbin/bhyve/net_backend_netmap.c
239
ring->slot[head].len = nm_buf_len;
usr.sbin/bhyve/net_backend_netmap.c
240
ring->slot[head].flags = 0;
usr.sbin/bhyve/net_backend_netmap.c
241
head = nm_ring_next(ring, head);
usr.sbin/bhyve/net_backend_netmap.c
244
ring->head = ring->cur = head;
usr.sbin/bhyve/net_backend_netmap.c
256
uint32_t head = ring->head;
usr.sbin/bhyve/net_backend_netmap.c
259
while (head != ring->tail) {
usr.sbin/bhyve/net_backend_netmap.c
260
struct netmap_slot *slot = ring->slot + head;
usr.sbin/bhyve/net_backend_netmap.c
265
head = nm_ring_next(ring, head);
usr.sbin/bhyve/net_backend_netmap.c
280
uint32_t head;
usr.sbin/bhyve/net_backend_netmap.c
285
head = ring->head;
usr.sbin/bhyve/net_backend_netmap.c
293
if (head == ring->tail) {
usr.sbin/bhyve/net_backend_netmap.c
297
slot = ring->slot + head;
usr.sbin/bhyve/net_backend_netmap.c
328
head = nm_ring_next(ring, head);
usr.sbin/bhyve/net_backend_netmap.c
333
ring->head = ring->cur = head;
usr.sbin/bhyve/pci_e82545.c
1063
e82545_transmit_done(struct e82545_softc *sc, uint16_t head, uint16_t tail,
usr.sbin/bhyve/pci_e82545.c
1068
for ( ; head != tail; head = (head + 1) % dsize) {
usr.sbin/bhyve/pci_e82545.c
1069
dsc = &sc->esc_txdesc[head];
usr.sbin/bhyve/pci_e82545.c
1078
e82545_transmit(struct e82545_softc *sc, uint16_t head, uint16_t tail,
usr.sbin/bhyve/pci_e82545.c
1099
ohead = head;
usr.sbin/bhyve/pci_e82545.c
1105
for (desc = 0; ; desc++, head = (head + 1) % dsize) {
usr.sbin/bhyve/pci_e82545.c
1106
if (head == tail) {
usr.sbin/bhyve/pci_e82545.c
1107
*rhead = head;
usr.sbin/bhyve/pci_e82545.c
1110
dsc = &sc->esc_txdesc[head];
usr.sbin/bhyve/pci_e82545.c
1118
head, dsc->td.buffer_addr,
usr.sbin/bhyve/pci_e82545.c
1125
head, dsc->td.upper.data, dsc->td.lower.data);
usr.sbin/bhyve/pci_e82545.c
1134
head, dsc->td.upper.data, dsc->td.lower.data);
usr.sbin/bhyve/pci_e82545.c
1144
head, dsc->td.upper.data, dsc->td.lower.data);
usr.sbin/bhyve/pci_e82545.c
1456
head = (head + 1) % dsize;
usr.sbin/bhyve/pci_e82545.c
1457
e82545_transmit_done(sc, ohead, head, dsize, tdwb);
usr.sbin/bhyve/pci_e82545.c
1459
*rhead = head;
usr.sbin/bhyve/pci_e82545.c
1467
uint16_t head, rhead, tail, size;
usr.sbin/bhyve/pci_e82545.c
1474
head = sc->esc_TDH % size;
usr.sbin/bhyve/pci_e82545.c
1480
rhead = head;
usr.sbin/bhyve/pci_e82545.c
1483
sent = e82545_transmit(sc, head, tail, size, &rhead, &tdwb);
usr.sbin/bhyve/pci_e82545.c
1486
head = rhead;
usr.sbin/bhyve/pci_e82545.c
1490
sc->esc_TDH = head;
usr.sbin/bhyve/pci_e82545.c
840
uint16_t *tp, tag, head;
usr.sbin/bhyve/pci_e82545.c
856
head = sc->esc_RDH;
usr.sbin/bhyve/pci_e82545.c
857
left = (size + sc->esc_RDT - head) % size;
usr.sbin/bhyve/pci_e82545.c
873
rxd = &sc->esc_rxdesc[(head + i) % size];
usr.sbin/bhyve/pci_e82545.c
896
len, n, head);
usr.sbin/bhyve/pci_e82545.c
915
rxd = &sc->esc_rxdesc[(head + i) % size];
usr.sbin/bhyve/pci_e82545.c
922
rxd = &sc->esc_rxdesc[(head + i) % size];
usr.sbin/bhyve/pci_e82545.c
939
head = (head + n) % size;
usr.sbin/bhyve/pci_e82545.c
949
sc->esc_RDH = head;
usr.sbin/bhyve/pci_e82545.c
951
left = (size + sc->esc_RDT - head) % size;
usr.sbin/bhyve/pci_nvme.c
1032
sc->submit_queues[i].head = 0;
usr.sbin/bhyve/pci_nvme.c
1041
sc->compl_queues[i].head = 0;
usr.sbin/bhyve/pci_nvme.c
1193
cqe->sqhd = sq->head;
usr.sbin/bhyve/pci_nvme.c
1260
nsq->head = nsq->tail = 0;
usr.sbin/bhyve/pci_nvme.c
1382
ncq->head = ncq->tail = 0;
usr.sbin/bhyve/pci_nvme.c
167
uint16_t head; /* guest progress */
usr.sbin/bhyve/pci_nvme.c
176
uint16_t head; /* nvme progress */
usr.sbin/bhyve/pci_nvme.c
2036
sqhead = sq->head;
usr.sbin/bhyve/pci_nvme.c
2127
sq->head = sqhead;
usr.sbin/bhyve/pci_nvme.c
2129
if (cq->head != cq->tail)
usr.sbin/bhyve/pci_nvme.c
2279
if (cq->head != cq->tail) {
usr.sbin/bhyve/pci_nvme.c
2722
sqhead = sq->head;
usr.sbin/bhyve/pci_nvme.c
2793
sq->head = sqhead;
usr.sbin/bhyve/pci_nvme.c
2813
if (sq->head == sq->tail)
usr.sbin/bhyve/pci_nvme.c
2815
else if (sq->head > sq->tail)
usr.sbin/bhyve/pci_nvme.c
2816
capacity = sq->size - (sq->head - sq->tail) - 1;
usr.sbin/bhyve/pci_nvme.c
2818
capacity = sq->tail - sq->head - 1;
usr.sbin/bhyve/pci_nvme.c
2823
__func__, sq->size, sq->head, sq->tail, capacity, value);
usr.sbin/bhyve/pci_nvme.c
2890
atomic_store_short(&sc->compl_queues[idx].head,
usr.sbin/bhyve/pci_xhci.c
1599
for (i = xfer->head; xfer->ndata > 0; ) {
usr.sbin/bhyve/pci_xhci.c
1612
xfer->head = i;
usr.sbin/bhyve/pci_xhci.c
1727
if (USB_DATA_GET_ERRCODE(&xfer->data[xfer->head]) ==
usr.sbin/bhyve/pci_xhci.c
3077
SNAPSHOT_VAR_OR_LEAVE(xfer->head, meta, ret, done);
usr.sbin/bhyve/usb_emul.h
114
int head;
usr.sbin/bhyve/usb_emul.h
143
(x)->head = (x)->tail = 0; \
usr.sbin/bhyve/usb_mouse.c
343
idx = xfer->head;
usr.sbin/bhyve/usb_mouse.c
712
idx = xfer->head;
usr.sbin/bhyve/usb_mouse.c
743
USB_DATA_SET_ERRCODE(&xfer->data[xfer->head], USB_NAK);
usr.sbin/cron/cron/cron.c
139
database.head = NULL;
usr.sbin/cron/cron/cron.c
193
for (u = db->head; u != NULL; u = u->next) {
usr.sbin/cron/cron/cron.c
243
for (u = db->head; u != NULL; u = u->next) {
usr.sbin/cron/cron/cron.c
258
for (u = db->head; u != NULL; u = u->next) {
usr.sbin/cron/cron/cron.c
273
for (u = db->head; u != NULL; u = u->next) {
usr.sbin/cron/cron/cron.c
300
for (u = db->head; u != NULL; u = u->next) {
usr.sbin/cron/cron/cron.c
457
for (u = db->head; u != NULL; u = u->next) {
usr.sbin/cron/cron/cron.c
544
for (u = db->head; u != NULL; u = u->next) {
usr.sbin/cron/cron/cron.c
559
for (u = database.head; u != NULL; u = u->next) {
usr.sbin/cron/cron/database.c
113
new_db.head = new_db.tail = NULL;
usr.sbin/cron/cron/database.c
186
for (u = old_db->head; u != NULL; u = nu) {
usr.sbin/cron/cron/database.c
202
if (db->head == NULL)
usr.sbin/cron/cron/database.c
203
db->head = u;
usr.sbin/cron/cron/database.c
215
db->head = u->next;
usr.sbin/cron/cron/database.c
230
for (u = db->head; u != NULL; u = u->next)
usr.sbin/cron/cron/structs.h
74
user *head, *tail; /* links */
usr.sbin/fdformat/fdformat.c
48
format_track(int fd, int cyl, int secs, int head, int rate,
usr.sbin/fdformat/fdformat.c
64
f.head = head;
usr.sbin/fdformat/fdformat.c
74
f.fd_formb_headno(i) = head;
usr.sbin/fdread/fdread.c
316
info.head = fdt.heads > 1? trackno % fdt.heads: 0;
usr.sbin/fdread/fdread.c
319
info.cyl, info.head, info.sec, info.secshift);
usr.sbin/fdwrite/fdwrite.c
24
format_track(int fd, int cyl, int secs, int head, int rate,
usr.sbin/fdwrite/fdwrite.c
39
f.head = head;
usr.sbin/fdwrite/fdwrite.c
49
f.fd_formb_headno(i) = head;
usr.sbin/fstyp/hammer2.c
178
char *p, *head;
usr.sbin/fstyp/hammer2.c
184
head = p;
usr.sbin/fstyp/hammer2.c
190
p = strrchr(head, '/');
usr.sbin/fstyp/hammer2.c
194
free(head);
usr.sbin/fstyp/hammer2.c
198
free(head);
usr.sbin/fstyp/hammer2.c
202
return head;
usr.sbin/fstyp/hammer2_disk.h
575
dmsg_hdr_t head;
usr.sbin/fstyp/hammer_disk.h
616
struct hammer_fifo_head head;
usr.sbin/fstyp/hammer_disk.h
662
struct hammer_fifo_head head;
usr.sbin/fstyp/hammer_disk.h
680
struct hammer_fifo_head head;
usr.sbin/kbdmap/kbdmap.c
100
SLIST_FOREACH(km, &head, entries)
usr.sbin/kbdmap/kbdmap.c
114
SLIST_FOREACH(km, &head, entries) {
usr.sbin/kbdmap/kbdmap.c
116
SLIST_REMOVE(&head, km, keymap, entries);
usr.sbin/kbdmap/kbdmap.c
132
SLIST_FOREACH(km, &head, entries) {
usr.sbin/kbdmap/kbdmap.c
148
SLIST_INSERT_HEAD(&head, km_new, entries);
usr.sbin/kbdmap/kbdmap.c
73
static SLIST_HEAD(slisthead, keymap) head = SLIST_HEAD_INITIALIZER(head);
usr.sbin/kbdmap/kbdmap.c
745
SLIST_FOREACH(km, &head, entries)
usr.sbin/kbdmap/kbdmap.c
838
SLIST_INIT(&head);
usr.sbin/kbdmap/kbdmap.c
84
SLIST_FOREACH(km, &head, entries)
usr.sbin/makefs/cd9660.c
1289
struct cd9660_children_head *head = &root->cn_children;
usr.sbin/makefs/cd9660.c
1292
TAILQ_FOREACH(cn, head, cn_next_child) {
usr.sbin/makefs/cd9660.c
941
struct cd9660_children_head *head = &parent->cn_children;
usr.sbin/makefs/cd9660.c
952
TAILQ_FOREACH(cn, head, cn_next_child) {
usr.sbin/makefs/cd9660.c
971
TAILQ_INSERT_TAIL(head, cn_new, cn_next_child);
usr.sbin/makefs/cd9660.h
188
TAILQ_HEAD(susp_linked_list, ISO_SUSP_ATTRIBUTES) head;
usr.sbin/makefs/cd9660/cd9660_debug.c
63
TAILQ_FOREACH(t, &node->head, rr_ll) {
usr.sbin/makefs/cd9660/cd9660_debug.c
74
TAILQ_FOREACH(t, &n->head, rr_ll) {
usr.sbin/makefs/cd9660/cd9660_eltorito.c
373
*valid_entry, *default_entry, *temp, *head, **headp, *next;
usr.sbin/makefs/cd9660/cd9660_eltorito.c
460
head = NULL;
usr.sbin/makefs/cd9660/cd9660_eltorito.c
489
head =
usr.sbin/makefs/cd9660/cd9660_eltorito.c
491
if (head == NULL) {
usr.sbin/makefs/cd9660/cd9660_eltorito.c
496
LIST_INSERT_AFTER(default_entry, head, ll_struct);
usr.sbin/makefs/cd9660/cd9660_eltorito.c
497
*headp = head;
usr.sbin/makefs/cd9660/cd9660_eltorito.c
499
head = *headp;
usr.sbin/makefs/cd9660/cd9660_eltorito.c
501
head->entry_data.SH.num_section_entries[0]++;
usr.sbin/makefs/cd9660/cd9660_eltorito.c
510
while ((next = LIST_NEXT(head, ll_struct)) != NULL &&
usr.sbin/makefs/cd9660/cd9660_eltorito.c
512
head = next;
usr.sbin/makefs/cd9660/cd9660_eltorito.c
514
LIST_INSERT_AFTER(head, temp, ll_struct);
usr.sbin/makefs/cd9660/cd9660_eltorito.c
518
head = NULL;
usr.sbin/makefs/cd9660/cd9660_eltorito.c
521
head = next;
usr.sbin/makefs/cd9660/cd9660_eltorito.c
523
if (head != NULL)
usr.sbin/makefs/cd9660/cd9660_eltorito.c
524
head->entry_data.SH.header_indicator[0] = ET_SECTION_HEADER_LAST;
usr.sbin/makefs/cd9660/cd9660_write.c
481
TAILQ_FOREACH(myattr, &writenode->head, rr_ll) {
usr.sbin/makefs/cd9660/iso9660_rrip.c
165
TAILQ_FOREACH(t, &node->head, rr_ll) {
usr.sbin/makefs/cd9660/iso9660_rrip.c
191
TAILQ_FOREACH(t, &node->head, rr_ll) {
usr.sbin/makefs/cd9660/iso9660_rrip.c
235
TAILQ_FOREACH(temp, &node->head, rr_ll) {
usr.sbin/makefs/cd9660/iso9660_rrip.c
264
TAILQ_INSERT_AFTER(&node->head, pre_ce, CE, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
266
TAILQ_INSERT_HEAD(&node->head, CE, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
282
TAILQ_INSERT_AFTER(&node->head, last, ST, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
284
TAILQ_INSERT_HEAD(&node->head, ST, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
335
TAILQ_INSERT_HEAD(&node->head, temp, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
358
TAILQ_INSERT_TAIL(&node->head, attr, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
364
TAILQ_INSERT_TAIL(&node->head, attr, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
382
TAILQ_INSERT_TAIL(&node->head, attr, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
411
TAILQ_INSERT_TAIL(&node->head, current, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
417
TAILQ_INSERT_TAIL(&node->head, current, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
427
TAILQ_INSERT_TAIL(&node->head, current, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
433
TAILQ_INSERT_TAIL(&node->head, current, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
440
TAILQ_INSERT_TAIL(&node->head, current, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
458
TAILQ_INSERT_TAIL(&node->head, current, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
466
TAILQ_INSERT_TAIL(&node->head, current, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
600
TAILQ_INSERT_TAIL(&node->head, current, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
639
TAILQ_INSERT_TAIL(&node->head, current, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
67
TAILQ_INIT(&(node->head));
usr.sbin/makefs/cd9660/iso9660_rrip.c
69
TAILQ_INIT(&(node->dot_record->head));
usr.sbin/makefs/cd9660/iso9660_rrip.c
71
TAILQ_INIT(&(node->dot_dot_record->head));
usr.sbin/makefs/cd9660/iso9660_rrip.c
832
TAILQ_INSERT_TAIL(&node->head, r, rr_ll);
usr.sbin/makefs/cd9660/iso9660_rrip.c
884
TAILQ_INSERT_TAIL(&node->head, r, rr_ll);
usr.sbin/moused/moused/util-list.h
136
#define list_first_entry(head, pointer_of_type, member) \
usr.sbin/moused/moused/util-list.h
137
container_of((head)->next, __typeof__(*pointer_of_type), member)
usr.sbin/moused/moused/util-list.h
156
#define list_first_entry_by_type(head, container_type, member) \
usr.sbin/moused/moused/util-list.h
157
container_of((head)->next, container_type, member)
usr.sbin/moused/moused/util-list.h
172
#define list_for_each(pos, head, member) \
usr.sbin/moused/moused/util-list.h
173
for (pos = list_first_entry_by_type(head, __typeof__(*pos), member); \
usr.sbin/moused/moused/util-list.h
174
&pos->member != (head); \
usr.sbin/moused/moused/util-list.h
189
#define list_for_each_safe(pos, head, member) \
usr.sbin/moused/moused/util-list.h
190
pos = list_first_entry_by_type(head, __typeof__(*pos), member); \
usr.sbin/moused/moused/util-list.h
192
&pos->member != (head); \
usr.sbin/nscd/cacheplcs.c
115
TAILQ_INSERT_TAIL(&queue_policy->head, queue_item, entries);
usr.sbin/nscd/cacheplcs.c
129
TAILQ_REMOVE(&queue_policy->head, queue_item, entries);
usr.sbin/nscd/cacheplcs.c
141
return ((struct cache_policy_item_ *)TAILQ_FIRST(&queue_policy->head));
usr.sbin/nscd/cacheplcs.c
152
return ((struct cache_policy_item_ *)TAILQ_LAST(&queue_policy->head,
usr.sbin/nscd/cacheplcs.c
212
TAILQ_INIT(&retval->head);
usr.sbin/nscd/cacheplcs.c
223
while (!TAILQ_EMPTY(&queue_policy->head)) {
usr.sbin/nscd/cacheplcs.c
224
queue_item = TAILQ_FIRST(&queue_policy->head);
usr.sbin/nscd/cacheplcs.c
225
TAILQ_REMOVE(&queue_policy->head, queue_item, entries);
usr.sbin/nscd/cacheplcs.c
288
TAILQ_REMOVE(&queue_policy->head, queue_item, entries);
usr.sbin/nscd/cacheplcs.c
289
TAILQ_INSERT_TAIL(&queue_policy->head, queue_item, entries);
usr.sbin/nscd/cacheplcs.h
109
TAILQ_HEAD(cache_queue_policy_head_, cache_queue_policy_item_) head;
usr.sbin/pciconf/pciconf.c
376
tree_add_device(struct pci_tree_list *head, struct pci_conf *p,
usr.sbin/pciconf/pciconf.c
386
TAILQ_INSERT_TAIL(head, e, link);
usr.sbin/pciconf/pciconf.c
434
build_tree(struct pci_tree_list *head, struct pci_conf *conf, size_t count)
usr.sbin/pciconf/pciconf.c
439
TAILQ_INIT(head);
usr.sbin/pciconf/pciconf.c
454
tree_add_device(head, conf + i, conf, count, added);
usr.sbin/pciconf/pciconf.c
462
free_tree(struct pci_tree_list *head)
usr.sbin/pciconf/pciconf.c
466
TAILQ_FOREACH_SAFE(e, head, link, n) {
usr.sbin/pciconf/pciconf.c
468
TAILQ_REMOVE(head, e, link);
usr.sbin/pciconf/pciconf.c
526
struct pci_tree_list head;
usr.sbin/pciconf/pciconf.c
557
if (!build_tree(&head, conf, count)) {
usr.sbin/pciconf/pciconf.c
564
TAILQ_FOREACH(e, &head, link) {
usr.sbin/pciconf/pciconf.c
584
free_tree(&head);
usr.sbin/pmccontrol/pmccontrol.c
361
STAILQ_INIT(&head);
usr.sbin/pmccontrol/pmccontrol.c
419
STAILQ_INSERT_TAIL(&head, p, op_next);
usr.sbin/pmccontrol/pmccontrol.c
475
if (STAILQ_EMPTY(&head))
usr.sbin/pmccontrol/pmccontrol.c
478
error = pmcc_do_enable_disable(&head);
usr.sbin/pmccontrol/pmccontrol.c
68
static STAILQ_HEAD(pmcc_op_list, pmcc_op) head = STAILQ_HEAD_INITIALIZER(head);
usr.sbin/ppp/cbcp.c
198
struct cbcp_header *head;
usr.sbin/ppp/cbcp.c
201
bp = m_get(sizeof *head + data->length, MB_CBCPOUT);
usr.sbin/ppp/cbcp.c
202
head = (struct cbcp_header *)MBUF_CTOP(bp);
usr.sbin/ppp/cbcp.c
203
head->code = code;
usr.sbin/ppp/cbcp.c
204
head->id = cbcp->fsm.id;
usr.sbin/ppp/cbcp.c
205
head->length = htons(sizeof *head + data->length);
usr.sbin/ppp/cbcp.c
206
memcpy(MBUF_CTOP(bp) + sizeof *head, data, data->length);
usr.sbin/ppp/cbcp.c
625
struct cbcp_header *head;
usr.sbin/ppp/cbcp.c
642
head = (struct cbcp_header *)MBUF_CTOP(bp);
usr.sbin/ppp/cbcp.c
643
if (ntohs(head->length) != len) {
usr.sbin/ppp/cbcp.c
645
" - ignored\n", head->code, ntohs(head->length), len);
usr.sbin/ppp/cbcp.c
657
switch (head->code) {
usr.sbin/ppp/cbcp.c
660
p->dl->name, head->id, cbcpstate(cbcp->fsm.state));
usr.sbin/ppp/cbcp.c
666
cbcp->fsm.id = head->id;
usr.sbin/ppp/cbcp.c
676
p->dl->name, head->id, cbcpstate(cbcp->fsm.state));
usr.sbin/ppp/cbcp.c
678
if (cbcp->fsm.id != head->id) {
usr.sbin/ppp/cbcp.c
680
cbcp->fsm.id, head->id);
usr.sbin/ppp/cbcp.c
681
cbcp->fsm.id = head->id;
usr.sbin/ppp/cbcp.c
713
p->dl->name, head->id, cbcpstate(cbcp->fsm.state));
usr.sbin/ppp/cbcp.c
715
if (cbcp->fsm.id != head->id) {
usr.sbin/ppp/cbcp.c
717
cbcp->fsm.id, head->id);
usr.sbin/ppp/cbcp.c
718
cbcp->fsm.id = head->id;
usr.sbin/ppp/cbcp.c
737
head->code, len);
usr.sbin/ppp/mbuf.c
245
struct mbuf *head;
usr.sbin/ppp/mbuf.c
262
head = m_get(len + extra, bp ? bp->m_type : MB_UNKNOWN);
usr.sbin/ppp/mbuf.c
263
head->m_offset = extra;
usr.sbin/ppp/mbuf.c
264
head->m_len -= extra;
usr.sbin/ppp/mbuf.c
266
memcpy(MBUF_CTOP(head), ptr, len);
usr.sbin/ppp/mbuf.c
267
head->m_next = bp;
usr.sbin/ppp/mbuf.c
269
return head;
usr.sbin/setfmac/setfmac.c
280
STAILQ_INSERT_TAIL(&specs->head, spec, link);
usr.sbin/setfmac/setfmac.c
298
STAILQ_INSERT_TAIL(&specs->head, spec, link);
usr.sbin/setfmac/setfmac.c
389
return (STAILQ_EMPTY(&specs->head));
usr.sbin/setfmac/setfmac.c
409
STAILQ_FOREACH(ls, &specs->head, link) {
usr.sbin/setfmac/setfmac.c
454
STAILQ_FOREACH(ls, &specs->head, link) {
usr.sbin/setfmac/setfmac.c
466
STAILQ_FOREACH(ls, &specs->head, link) {
usr.sbin/setfmac/setfmac.c
498
STAILQ_INIT(&specs->head);
usr.sbin/setfmac/setfmac.c
67
STAILQ_HEAD(label_specs_head, label_spec) head;
usr.sbin/tcpdrop/tcpdrop.c
231
struct xinpgen *head, *xinp;
usr.sbin/tcpdrop/tcpdrop.c
238
head = getxpcblist("net.inet.tcp.pcblist");
usr.sbin/tcpdrop/tcpdrop.c
243
for (xinp = XINP_NEXT(head); xinp->xig_len > sizeof *xinp;
usr.sbin/tcpdrop/tcpdrop.c
254
if (xip->inp_gencnt > head->xig_gen)
usr.sbin/tcpdrop/tcpdrop.c
281
free(head);
usr.sbin/tcpsso/tcpsso.c
103
head = getxpcblist("net.inet.tcp.pcblist");
usr.sbin/tcpsso/tcpsso.c
108
for (xinp = XINP_NEXT(head); xinp->xig_len > sizeof *xinp;
usr.sbin/tcpsso/tcpsso.c
114
if (xip->inp_gencnt > head->xig_gen)
usr.sbin/tcpsso/tcpsso.c
139
free(head);
usr.sbin/tcpsso/tcpsso.c
96
struct xinpgen *head, *xinp;
usr.sbin/uhsoctl/uhsoctl.c
1366
TAILQ_INIT(&timers.head);
usr.sbin/uhsoctl/uhsoctl.c
177
TAILQ_HEAD(, timer_entry) head;
usr.sbin/uhsoctl/uhsoctl.c
202
te = TAILQ_FIRST(&tmrs->head);
usr.sbin/uhsoctl/uhsoctl.c
209
TAILQ_REMOVE(&tmrs->head, te, next);
usr.sbin/uhsoctl/uhsoctl.c
232
te2 = TAILQ_FIRST(&tmrs->head);
usr.sbin/uhsoctl/uhsoctl.c
234
if (TAILQ_EMPTY(&tmrs->head)) {
usr.sbin/uhsoctl/uhsoctl.c
235
TAILQ_INSERT_HEAD(&tmrs->head, te, next);
usr.sbin/uhsoctl/uhsoctl.c
238
TAILQ_INSERT_HEAD(&tmrs->head, te, next);
usr.sbin/uhsoctl/uhsoctl.c
247
TAILQ_INSERT_AFTER(&tmrs->head, te2, te, next);
usr.sbin/virtual_oss/virtual_oss/httpd.c
839
TAILQ_INSERT_TAIL(&pvp->head, pvc, entry);
usr.sbin/virtual_oss/virtual_oss/int.h
122
vclient_head_t head;
usr.sbin/virtual_oss/virtual_oss/main.c
1889
TAILQ_INIT(&ptr->head);
usr.sbin/virtual_oss/virtual_oss/main.c
494
TAILQ_INSERT_TAIL(&pvc->profile->head, pvc, entry);
usr.sbin/virtual_oss/virtual_oss/main.c
532
TAILQ_REMOVE(&pvc->profile->head, pvc, entry);
usr.sbin/virtual_oss/virtual_oss/virtual_oss.c
453
if (TAILQ_FIRST(&pvp->head) == NULL)
usr.sbin/virtual_oss/virtual_oss/virtual_oss.c
461
TAILQ_FOREACH(pvc, &pvp->head, entry) {
usr.sbin/virtual_oss/virtual_oss/virtual_oss.c
527
TAILQ_FOREACH(pvc, &pvp->head, entry) {
usr.sbin/virtual_oss/virtual_oss/virtual_oss.c
584
TAILQ_FOREACH(pvc, &pvp->head, entry) {
usr.sbin/virtual_oss/virtual_oss/virtual_oss.c
781
if (TAILQ_FIRST(&pvp->head) == NULL)
usr.sbin/virtual_oss/virtual_oss/virtual_oss.c
789
TAILQ_FOREACH(pvc, &pvp->head, entry) {