Searched refs:head (Results 51 - 75 of 923) sorted by relevance

1234567891011>>

/freebsd-11-stable/sys/cddl/compat/opensolaris/kern/
H A Dopensolaris_zone.c61 struct zone_dataset_head *head; local
80 head = osd_jail_get(pr, zone_slot);
81 if (head != NULL) {
83 LIST_FOREACH(zd2, head, zd_next) {
94 head = malloc(sizeof(*head), M_ZONES, M_WAITOK);
95 LIST_INIT(head);
97 error = osd_jail_set(pr, zone_slot, head);
101 LIST_INSERT_HEAD(head, zd, zd_next);
113 struct zone_dataset_head *head; local
156 struct zone_dataset_head *head; local
221 struct zone_dataset_head *head; local
[all...]
/freebsd-11-stable/contrib/jemalloc/src/
H A Dtsd.c168 tsd_init_check_recursion(tsd_init_head_t *head, tsd_init_block_t *block) argument
174 malloc_mutex_lock(NULL, &head->lock);
175 ql_foreach(iter, &head->blocks, link) {
177 malloc_mutex_unlock(NULL, &head->lock);
184 ql_tail_insert(&head->blocks, block, link);
185 malloc_mutex_unlock(NULL, &head->lock);
190 tsd_init_finish(tsd_init_head_t *head, tsd_init_block_t *block) argument
193 malloc_mutex_lock(NULL, &head->lock);
194 ql_remove(&head->blocks, block, link);
195 malloc_mutex_unlock(NULL, &head
[all...]
/freebsd-11-stable/usr.bin/head/tests/
H A Dhead_test.sh25 # $FreeBSD: stable/11/usr.bin/head/tests/head_test.sh 326039 2017-11-20 22:55:02Z asomers $
29 atf_set "descr" "Test head(1)'s handling of an empty file"
33 head infile > outfile
34 head < infile > outpipe
41 atf_set "descr" "Test head(1)'s default mode"
44 #head(1) is supposed to default to 10 lines of output. Verify that it does that.
47 head infile > outfile
53 atf_set "descr" "Test head(1)'s -n option"
57 head -n 50 outfile > expectfile
63 atf_set "descr" "Test head(
[all...]
/freebsd-11-stable/sys/netpfil/ipfw/
H A Ddn_sched_rr.c77 struct rr_queue *head, *tail; /* Pointer to current queue */ member in struct:rr_si
88 if (si->head == NULL)
89 si->head = q;
93 q->qnext = si->head; /* make it circular */
96 /* Remove the head queue from circular list. */
100 if (si->head == NULL)
102 si->head->status = 0;
104 if (si->head == si->tail) {
105 si->head = si->tail = NULL;
109 si->head
[all...]
/freebsd-11-stable/contrib/ntp/lib/isc/include/isc/
H A Dqueue.h21 * There are built-in mutex locks for the head and tail of the queue,
47 type *head, *tail; \
55 (queue).head = (void *) &((queue).headnode); \
57 ISC_QLINK_INIT((queue).head, link); \
60 #define ISC_QUEUE_EMPTY(queue) ISC_TF((queue).head == (queue).tail)
83 ret = (queue).head->link.next; \
88 (queue).head->link.next = ret->link.next; \
91 (queue).tail = (queue).head; \
H A Dlist.h31 #define ISC_LIST(type) struct { type *head, *tail; }
33 do { (list).head = NULL; (list).tail = NULL; } while (0)
45 #define ISC_LIST_HEAD(list) ((list).head)
47 #define ISC_LIST_EMPTY(list) ISC_TF((list).head == NULL)
51 if ((list).head != NULL) \
52 (list).head->link.prev = (elt); \
56 (elt)->link.next = (list).head; \
57 (list).head = (elt); \
74 (list).head = (elt); \
100 ISC_INSIST((list).head
[all...]
/freebsd-11-stable/sys/dev/twa/
H A Dtw_cl_share.h269 #define TW_CL_Q_INIT(head) do { \
270 (head)->prev = (head)->next = head; \
274 /* Insert an item at the head of the queue. */
275 #define TW_CL_Q_INSERT_HEAD(head, item) do { \
276 (item)->next = (head)->next; \
277 (item)->prev = head; \
278 (head)->next->prev = item; \
279 (head)
[all...]
/freebsd-11-stable/contrib/ncurses/ncurses/tinfo/
H A Daccess.c126 char head[PATH_MAX]; local
129 _nc_STRCPY(head, path, sizeof(head));
130 leaf = _nc_basename(head);
132 leaf = head;
134 if (head == leaf)
135 _nc_STRCPY(head, ".", sizeof(head));
137 result = access(head, R_OK | W_OK | X_OK);
/freebsd-11-stable/sbin/routed/
H A Dradix.h113 struct radix_node_head *head, struct radix_node nodes[]);
116 struct radix_node_head *head, struct radix_node nodes[]);
118 (void *v, void *mask, struct radix_node_head *head);
120 (void *v, void *mask, struct radix_node_head *head);
122 (void *v, struct radix_node_head *head);
124 (void *v, void *mask, struct radix_node_head *head);
126 (void *v, struct radix_node_head *head);
128 (struct radix_node_head *head,
140 int rn_inithead(struct radix_node_head **head, int off);
/freebsd-11-stable/sys/contrib/ck/src/
H A Dck_barrier_combining.c34 struct ck_barrier_combining_group *head; member in struct:ck_barrier_combining_queue
43 if (queue->head != NULL) {
44 front = queue->head;
45 queue->head = queue->head->next;
81 if (queue->head == NULL) {
82 queue->head = queue->tail = node_value;
101 queue.head = queue.tail = NULL;
115 while (queue.head != NULL) {
/freebsd-11-stable/sys/dev/drm2/
H A Ddrm_linux_list_sort.c54 drm_list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv, argument
62 list_for_each(le, head)
66 list_for_each(le, head)
71 INIT_LIST_HEAD(head);
73 list_add_tail(ar[i], head);
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dtraits.hpp51 #include <ext/pb_ds/detail/pat_trie_/head.hpp>
124 head; typedef in struct:pb_ds::detail::trie_traits
139 head,
150 head,
161 head,
172 head,
182 head,
194 head,
285 head; typedef in struct:pb_ds::detail::trie_traits
300 head,
[all...]
/freebsd-11-stable/sys/compat/linuxkpi/common/src/
H A Dlinux_rcu.c114 struct linux_epoch_head *head; local
121 head = &linux_epoch_head[j];
123 mtx_init(&head->lock, "LRCU-HEAD", NULL, MTX_DEF);
124 TASK_INIT(&head->task, 0, linux_rcu_cleaner_func, head);
125 STAILQ_INIT(&head->cb_head);
145 struct linux_epoch_head *head; local
149 head = &linux_epoch_head[j];
151 mtx_destroy(&head->lock);
159 struct linux_epoch_head *head; local
378 struct linux_epoch_head *head; local
394 struct linux_epoch_head *head; local
[all...]
/freebsd-11-stable/contrib/ncurses/man/
H A DMKterminfo.sh34 # This script takes terminfo.head and terminfo.tail and splices in between
52 head=$1
58 .\" It is generated from terminfo.head, Caps, and terminfo.tail.
63 cat $head
/freebsd-11-stable/contrib/ntp/scripts/build/
H A DcheckChangeLog5 # HMS: Irix doesn't have 'head'...
6 cl1=`head -1 ChangeLog || sed -e 1q ChangeLog`
/freebsd-11-stable/tools/tools/scsi-defects/
H A Dscsi-defects.pl88 print "cylinder head sector\n";
91 ($cylhi, $cyllo, $head, $sec) = unpack("CnCN", $buf);
92 printf "%8u %4u %6u\n", $cylhi*65536+$cyllo, $head, $sec;
/freebsd-11-stable/contrib/gcc/
H A Dsched-ebb.c357 add_deps_for_risky_insns (rtx head, rtx tail)
365 for (insn = head; insn != next_tail; insn = NEXT_INSN (insn))
440 schedule_ebb (rtx head, rtx tail)
445 first_bb = BLOCK_FOR_INSN (head);
448 if (no_real_insns_p (head, tail))
451 gcc_assert (INSN_P (head) && INSN_P (tail));
459 sched_analyze (&tmp_deps, head, tail);
463 compute_forward_dependences (head, tail);
465 add_deps_for_risky_insns (head, tail);
468 targetm.sched.dependencies_evaluation_hook (head, tai
354 add_deps_for_risky_insns(rtx head, rtx tail) argument
437 schedule_ebb(rtx head, rtx tail) argument
579 rtx head = BB_HEAD (bb); local
[all...]
H A Dbitmap.c51 bitmap_elem_to_freelist (bitmap head, bitmap_element *elt)
53 bitmap_obstack *bit_obstack = head->obstack;
72 bitmap_element_free (bitmap head, bitmap_element *elt)
83 if (head->first == elt)
84 head->first = next;
88 if (head->current == elt)
90 head->current = next != 0 ? next : prev;
91 if (head->current)
92 head->indx = head
50 bitmap_elem_to_freelist(bitmap head, bitmap_element *elt) argument
71 bitmap_element_free(bitmap head, bitmap_element *elt) argument
101 bitmap_element_allocate(bitmap head) argument
150 bitmap_elt_clear_from(bitmap head, bitmap_element *elt) argument
190 bitmap_clear(bitmap head) argument
299 bitmap_element_link(bitmap head, bitmap_element *element) argument
356 bitmap_elt_insert_after(bitmap head, bitmap_element *elt, unsigned int indx) argument
428 bitmap_find_bit(bitmap head, unsigned int bit) argument
474 bitmap_clear_bit(bitmap head, int bit) argument
493 bitmap_set_bit(bitmap head, int bit) argument
514 bitmap_bit_p(bitmap head, int bit) argument
860 bitmap_clear_range(bitmap head, unsigned int start, unsigned int count) argument
1462 debug_bitmap_file(FILE *file, bitmap head) argument
1499 debug_bitmap(bitmap head) argument
1508 bitmap_print(FILE *file, bitmap head, const char *prefix, const char *suffix) argument
1525 bitmap_hash(bitmap head) argument
[all...]
/freebsd-11-stable/contrib/gdb/gdb/gdbserver/
H A Dinferiors.c49 list->head = new_inferior;
57 struct inferior_list_entry *cur = list->head, *next;
71 if (list->head != list->tail)
74 list->head->id = new_id;
83 if (list->head == entry)
85 list->head = entry->next;
87 list->tail = list->head;
91 cur = &list->head;
143 all_threads.head = all_threads.tail = NULL;
150 struct inferior_list_entry *inf = list->head;
[all...]
/freebsd-11-stable/lib/libc/include/isc/
H A Dlist.h29 #define LIST(type) struct { type *head, *tail; }
31 do { (list).head = NULL; (list).tail = NULL; } while (0)
44 #define HEAD(list) ((list).head)
46 #define EMPTY(list) ((list).head == NULL)
51 if ((list).head != NULL) \
52 (list).head->link.prev = (elt); \
56 (elt)->link.next = (list).head; \
57 (list).head = (elt); \
66 (list).head = (elt); \
84 INSIST((list).head
[all...]
/freebsd-11-stable/sbin/rcorder/
H A Drcorder.c106 flag head; member in struct:provnode
308 * have a head node, create one here.
315 provnode *pnode, *head; local
319 head = Hash_GetValue(entry);
321 /* create a head node if necessary. */
322 if (head == NULL) {
323 head = emalloc(sizeof(*head));
324 head->head
550 provnode *head, *pnode; local
657 provnode *head; local
709 generate_loop_for_req(strnodelist *stack_tail, provnode *head, filenode *fnode) argument
791 provnode *head; local
891 provnode *pnode, *head; local
1018 provnode *head, *pnode; local
[all...]
/freebsd-11-stable/lib/libc/iconv/
H A Dcitrus_mmap.c55 void *head; local
74 head = mmap(NULL, (size_t)st.st_size, PROT_READ, MAP_FILE|MAP_PRIVATE,
76 if (head == MAP_FAILED) {
80 _region_init(r, head, (size_t)st.st_size);
/freebsd-11-stable/sys/sys/
H A D_unrhdr.h39 TAILQ_HEAD(unrhd,unr) head; member in struct:unrhdr
H A Dbio.h146 struct bio *bioq_first(struct bio_queue_head *head);
147 struct bio *bioq_takefirst(struct bio_queue_head *head);
148 void bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error);
149 void bioq_init(struct bio_queue_head *head);
150 void bioq_insert_head(struct bio_queue_head *head, struct bio *bp);
151 void bioq_insert_tail(struct bio_queue_head *head, struct bio *bp);
152 void bioq_remove(struct bio_queue_head *head, struct bio *bp);
/freebsd-11-stable/sys/dev/drm2/ttm/
H A Dttm_execbuf_util.h40 * @head: list head for thread-private list.
49 struct list_head head; member in struct:ttm_validate_buffer

Completed in 183 milliseconds

1234567891011>>