/freebsd-11-stable/cddl/lib/drti/ |
H A D | Makefile | 17 -I${OPENSOLARIS_USR_DISTDIR}/head \
|
/freebsd-11-stable/cddl/usr.sbin/dtrace/ |
H A D | Makefile | 15 -I${OPENSOLARIS_USR_DISTDIR}/head \
|
/freebsd-11-stable/cddl/usr.bin/ctfdump/ |
H A D | Makefile | 13 -I${OPENSOLARIS_USR_DISTDIR}/head \
|
/freebsd-11-stable/cddl/usr.sbin/lockstat/ |
H A D | Makefile | 13 -I${OPENSOLARIS_USR_DISTDIR}/head \
|
/freebsd-11-stable/cddl/usr.sbin/plockstat/ |
H A D | Makefile | 13 -I${OPENSOLARIS_USR_DISTDIR}/head \
|
/freebsd-11-stable/sys/dev/liquidio/base/ |
H A D | lio_response_manager.h | 61 struct lio_stailq_head head; member in struct:lio_response_list
|
H A D | lio_response_manager.c | 52 STAILQ_INIT(&oct->response_list[i].head); 112 if (STAILQ_EMPTY(&ordered_sc_list->head)) { 121 sc = LIO_STAILQ_FIRST_ENTRY(&ordered_sc_list->head, 167 [LIO_ORDERED_SC_LIST].head,
|
/freebsd-11-stable/usr.bin/tee/ |
H A D | tee.c | 63 static LIST *head; variable 122 for (p = head; p; p = p->next) { 170 p->next = head; 171 head = p;
|
/freebsd-11-stable/usr.sbin/ppp/ |
H A D | cbcp.c | 200 struct cbcp_header *head; local 203 bp = m_get(sizeof *head + data->length, MB_CBCPOUT); 204 head = (struct cbcp_header *)MBUF_CTOP(bp); 205 head->code = code; 206 head->id = cbcp->fsm.id; 207 head->length = htons(sizeof *head + data->length); 208 memcpy(MBUF_CTOP(bp) + sizeof *head, data, data->length); 627 struct cbcp_header *head; local 644 head [all...] |
/freebsd-11-stable/sys/netinet/ |
H A D | ip_reass.c | 72 TAILQ_HEAD(ipqhead, ipq) head; 183 struct ipqhead *head; local 252 head = &V_ipq[hash].head; 259 TAILQ_FOREACH(fp, head, ipq_list) 286 TAILQ_INSERT_HEAD(head, fp, ipq_list); 476 TAILQ_REMOVE(head, fp, ipq_list); 544 TAILQ_INIT(&V_ipq[i].head); 574 TAILQ_FOREACH_SAFE(fp, &V_ipq[i].head, ipq_list, tmp) 590 while(!TAILQ_EMPTY(&V_ipq[i].head)) [all...] |
/freebsd-11-stable/usr.bin/procstat/tests/ |
H A D | procstat_test.sh | 63 atf_check -o match:"$header_re" head -n 1 procstat.out 83 atf_check -o match:"$header_re" head -n 1 procstat.out 105 atf_check -o match:"$header_re" head -n 1 procstat.out 125 atf_check -o match:"$header_re" head -n 1 procstat.out
|
/freebsd-11-stable/contrib/ntp/lib/isc/ |
H A D | print.c | 88 const char *head; local 119 head = ""; 238 head = "-"; 242 head = "+"; 244 head = " "; 246 head = ""; 333 head = "0x"; 355 head = "0X"; 378 zeropad - strlen(head); 383 count += strlen(head) [all...] |
/freebsd-11-stable/contrib/elftoolchain/ar/benchmark/ |
H A D | acp.sh | 25 $1, $3, $5, ($1>0?L/$1:0)}' /tmp/acp | sort | head -n 1 31 for ar in $AR; do echo -n "$ar: "; $ar -V | head -n 1;
|
/freebsd-11-stable/sys/netpfil/ipfw/ |
H A D | dn_sched.h | 81 * should internally check for (m != q->mq.head) 163 * Extract the head of a queue, update stats. Must be the very last 169 struct mbuf *m = q->mq.head; 177 q->mq.head = m->m_nextpkt;
|
/freebsd-11-stable/sys/dev/drm2/radeon/ |
H A D | radeon_encoders.c | 57 list_for_each_entry(clone_encoder, &dev->mode_config.encoder_list, head) { 77 list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) { 168 list_for_each_entry(connector, &dev->mode_config.connector_list, head) { 170 list_for_each_entry(encoder, &dev->mode_config.encoder_list, head) { 192 list_for_each_entry(connector, &dev->mode_config.connector_list, head) { 211 list_for_each_entry(connector, &dev->mode_config.connector_list, head) { 227 list_for_each_entry(connector, &dev->mode_config.connector_list, head) { 245 list_for_each_entry(other_encoder, &dev->mode_config.encoder_list, head) {
|
/freebsd-11-stable/usr.sbin/timed/timed/ |
H A D | readmsg.c | 76 static struct tsplist *head = &msgslist; local 88 if (head->p != NULL) { 90 for (ptr = head->p; ptr != NULL; ptr = ptr->p) { 106 ptr = head->p; 107 prev = head; 318 while ((ptr=head->p) != NULL) { 319 head->p = ptr->p; 322 tail = head;
|
/freebsd-11-stable/sys/compat/linuxkpi/common/src/ |
H A D | linux_slab.c | 67 linux_kmem_cache_free_rcu_callback(struct rcu_head *head) argument 70 container_of(head, struct linux_kmem_rcu, rcu_head);
|
/freebsd-11-stable/usr.sbin/bhyve/ |
H A D | usb_emul.h | 111 int head; member in struct:usb_data_xfer 140 (x)->head = (x)->tail = 0; \
|
/freebsd-11-stable/usr.bin/locate/locate/ |
H A D | mklocatedb.sh | 80 locate -d $filelist / | $bigram | $sort -nr | head -128 |
|
/freebsd-11-stable/contrib/serf/buckets/ |
H A D | aggregate_buckets.c | 251 serf_bucket_t *head = ctx->list->bucket; local 253 status = serf_bucket_read_iovec(head, requested, vecs_size, vecs, 367 serf_bucket_t *head; local 380 head = ctx->list->bucket; 382 status = serf_bucket_readline(head, acceptable, found, 390 /* head bucket is empty, move to to-be-cleaned-up list. */ 422 serf_bucket_t *head; local 441 head = ctx->list->bucket; 443 status = serf_bucket_peek(head, data, len);
|
/freebsd-11-stable/contrib/ncurses/form/ |
H A D | frm_def.c | 71 | FIELD *head ) 73 | Description : Insert new_field into sorted fieldlist with head "head" 74 | and return new head of sorted fieldlist. Sorting 77 | Return Values : New head of sorted fieldlist 80 Insert_Field_By_Position(FIELD *newfield, FIELD *head) 86 if (!head) 92 newhead = current = head; 98 if (current == head) 99 { /* We cycled through. Reset head t 79 Insert_Field_By_Position(FIELD *newfield, FIELD *head) argument [all...] |
/freebsd-11-stable/contrib/ncurses/include/ |
H A D | Makefile.in | 73 curses.head \ 95 curses.head \ 98 cat curses.head >$@
|
/freebsd-11-stable/contrib/ntp/sntp/libevent/ |
H A D | event-internal.h | 373 #define TAILQ_FIRST(head) ((head)->tqh_first) 376 #define TAILQ_END(head) NULL 383 #define TAILQ_FOREACH(var, head, field) \ 384 for ((var) = TAILQ_FIRST(head); \ 385 (var) != TAILQ_END(head); \
|
/freebsd-11-stable/sys/dev/beri/virtio/ |
H A D | virtio.c | 129 int head, next; local 137 head = be16toh(vq->vq_avail->ring[idx & (vq->vq_qsize - 1)]); 138 next = head; 174 uint16_t head, uidx, mask; local 179 head = be16toh(vq->vq_avail->ring[vq->vq_last_avail++ & mask]); 183 vue->id = htobe32(head);
|
/freebsd-11-stable/sys/net/altq/ |
H A D | altq_var.h | 152 #define TAILQ_LAST(head, headname) \ 153 (*(((struct headname *)((head)->tqh_last))->tqh_last)) 156 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) 159 #define TAILQ_FOREACH(var, head, field) \ 160 for (var = TAILQ_FIRST(head); var; var = TAILQ_NEXT(var, field))
|