Home
last modified time | relevance | path

Searched refs:tail (Results 1 – 25 of 551) sorted by relevance

12345678910>>...23

/freebsd-12.1/sys/contrib/ck/include/
H A Dck_hp_fifo.h90 tail = ck_pr_load_ptr(&fifo->tail); in ck_hp_fifo_enqueue_mpmc()
92 if (tail != ck_pr_load_ptr(&fifo->tail)) in ck_hp_fifo_enqueue_mpmc()
97 ck_pr_cas_ptr(&fifo->tail, tail, next); in ck_hp_fifo_enqueue_mpmc()
104 ck_pr_cas_ptr(&fifo->tail, tail, entry); in ck_hp_fifo_enqueue_mpmc()
120 tail = ck_pr_load_ptr(&fifo->tail); in ck_hp_fifo_tryenqueue_mpmc()
122 if (tail != ck_pr_load_ptr(&fifo->tail)) in ck_hp_fifo_tryenqueue_mpmc()
127 ck_pr_cas_ptr(&fifo->tail, tail, next); in ck_hp_fifo_tryenqueue_mpmc()
133 ck_pr_cas_ptr(&fifo->tail, tail, entry); in ck_hp_fifo_tryenqueue_mpmc()
147 tail = ck_pr_load_ptr(&fifo->tail); in ck_hp_fifo_dequeue_mpmc()
180 tail = ck_pr_load_ptr(&fifo->tail); in ck_hp_fifo_trydequeue_mpmc()
[all …]
H A Dck_fifo.h263 tail.pointer = ck_pr_load_ptr(&fifo->tail.pointer); in ck_fifo_mpmc_enqueue()
280 ck_pr_cas_ptr_2(&fifo->tail, &tail, &update); in ck_fifo_mpmc_enqueue()
297 ck_pr_cas_ptr_2(&fifo->tail, &tail, &update); in ck_fifo_mpmc_enqueue()
314 tail.generation = ck_pr_load_ptr(&fifo->tail.generation); in ck_fifo_mpmc_tryenqueue()
316 tail.pointer = ck_pr_load_ptr(&fifo->tail.pointer); in ck_fifo_mpmc_tryenqueue()
333 ck_pr_cas_ptr_2(&fifo->tail, &tail, &update); in ck_fifo_mpmc_tryenqueue()
350 ck_pr_cas_ptr_2(&fifo->tail, &tail, &update); in ck_fifo_mpmc_tryenqueue()
367 tail.pointer = ck_pr_load_ptr(&fifo->tail.pointer); in ck_fifo_mpmc_dequeue()
385 ck_pr_cas_ptr_2(&fifo->tail, &tail, &update); in ck_fifo_mpmc_dequeue()
422 tail.pointer = ck_pr_load_ptr(&fifo->tail.pointer); in ck_fifo_mpmc_trydequeue()
[all …]
/freebsd-12.1/usr.bin/find/
H A Doperator.c116 tail = next; in yankexpr()
118 tail->next = NULL; in yankexpr()
153 tail->next = expr; in paren_squish()
154 tail = expr; in paren_squish()
156 tail->next = NULL; in paren_squish()
216 tail->next = next; in not_squish()
217 tail = next; in not_squish()
219 tail->next = NULL; in not_squish()
268 tail->next = next; in or_squish()
269 tail = next; in or_squish()
[all …]
H A Dfind.c78 PLAN *plan, *tail, *new; in find_formplan() local
96 for (plan = tail = NULL; *argv;) { in find_formplan()
100 tail = plan = new; in find_formplan()
102 tail->next = new; in find_formplan()
103 tail = new; in find_formplan()
119 tail = plan = new; in find_formplan()
127 tail->next = new; in find_formplan()
128 tail = new; in find_formplan()
131 tail->next = new; in find_formplan()
132 tail = new; in find_formplan()
/freebsd-12.1/contrib/ncurses/ncurses/
H A Dfifo_defs.h52 if (head == tail) \
53 head = -1, tail = 0; \
59 if (head == tail) \
60 tail = -1; \
64 ? tail = 0 \
65 : tail++; \
66 if (tail == head) \
67 tail = -1; \
70 (tail <= 0) \
71 ? tail = FIFO_SIZE-1 \
[all …]
/freebsd-12.1/contrib/jemalloc/include/jemalloc/internal/
H A Dhash.h107 case 3: k1 ^= tail[2] << 16; in hash_x86_32()
108 case 2: k1 ^= tail[1] << 8; in hash_x86_32()
180 case 15: k4 ^= tail[14] << 16; in hash_x86_128()
181 case 14: k4 ^= tail[13] << 8; in hash_x86_128()
182 case 13: k4 ^= tail[12] << 0; in hash_x86_128()
187 case 10: k3 ^= tail[ 9] << 8; in hash_x86_128()
188 case 9: k3 ^= tail[ 8] << 0; in hash_x86_128()
193 case 6: k2 ^= tail[ 5] << 8; in hash_x86_128()
194 case 5: k2 ^= tail[ 4] << 0; in hash_x86_128()
199 case 2: k1 ^= tail[ 1] << 8; in hash_x86_128()
[all …]
/freebsd-12.1/usr.bin/tail/tests/
H A Dtail_test.sh36 tail -r infile > outfile
37 tail -r < infile > outpipe
59 tail -r infile > outfile
60 tail -r < infile > outpipe
81 tail -rn2 infile > outfile
124 tail -rc28 infile > outfile
146 tail -rc28 infile > outfile
161 tail -r infile > outfile
162 tail -r < infile > outpipe
206 tail -r infile > outfile
[all …]
/freebsd-12.1/contrib/gcc/
H A Dtree-iterator.c85 if (!head || !tail) in tsi_link_before()
87 gcc_assert (head == tail); in tsi_link_before()
97 tail = head; in tsi_link_before()
112 tail->next = cur; in tsi_link_before()
113 cur->prev = tail; in tsi_link_before()
134 i->ptr = tail; in tsi_link_before()
161 if (!head || !tail) in tsi_link_after()
173 tail = head; in tsi_link_after()
184 if (tail->next) in tsi_link_after()
185 tail->next->prev = tail; in tsi_link_after()
[all …]
H A Dsched-ebb.c437 schedule_ebb (rtx head, rtx tail) in schedule_ebb() argument
443 last_bb = BLOCK_FOR_INSN (tail); in schedule_ebb()
446 return BLOCK_FOR_INSN (tail); in schedule_ebb()
485 rm_line_notes (head, tail); in schedule_ebb()
506 rm_other_notes (head, tail); in schedule_ebb()
521 tail = current_sched_info->tail; in schedule_ebb()
545 rtx tail; in schedule_ebbs() local
585 tail = BB_END (bb); in schedule_ebbs()
601 while (head != tail) in schedule_ebbs()
605 else if (NOTE_P (tail)) in schedule_ebbs()
[all …]
/freebsd-12.1/sys/compat/linuxkpi/common/include/linux/
H A Dbitmap.h43 const unsigned int tail = size & (BITS_PER_LONG - 1); in bitmap_fill() local
47 if (tail) in bitmap_fill()
48 addr[BIT_WORD(size)] = BITMAP_LAST_WORD_MASK(tail); in bitmap_fill()
55 const unsigned int tail = size & (BITS_PER_LONG - 1); in bitmap_full() local
63 if (tail) { in bitmap_full()
76 const unsigned int tail = size & (BITS_PER_LONG - 1); in bitmap_empty() local
84 if (tail) { in bitmap_empty()
209 const unsigned int tail = size & (BITS_PER_LONG - 1); in bitmap_weight() local
216 if (tail) { in bitmap_weight()
229 const unsigned int tail = size & (BITS_PER_LONG - 1); in bitmap_equal() local
[all …]
/freebsd-12.1/contrib/ntp/lib/isc/include/isc/
H A Dlist.h46 #define ISC_LIST_TAIL(list) ((list).tail)
54 (list).tail = (elt); \
71 if ((list).tail != NULL) \
72 (list).tail->link.next = (elt); \
75 (elt)->link.prev = (list).tail; \
77 (list).tail = (elt); \
94 ISC_INSIST((list).tail == (elt)); \
95 (list).tail = (elt)->link.prev; \
166 (list1).tail = (list2).tail; \
169 (list2).tail = NULL; \
[all …]
H A Dqueue.h47 type *head, *tail; \
56 (queue).tail = (void *) &((queue).headnode); \
60 #define ISC_QUEUE_EMPTY(queue) ISC_TF((queue).head == (queue).tail)
74 (queue).tail->link.next = elt; \
75 (queue).tail = elt; \
91 (queue).tail = (queue).head; \
/freebsd-12.1/sys/contrib/ena-com/
H A Dena_eth_com.h103 u16 tail, next_to_comp, cnt; in ena_com_free_desc() local
106 tail = io_sq->tail; in ena_com_free_desc()
107 cnt = tail - next_to_comp; in ena_com_free_desc()
133 u16 tail; in ena_com_write_sq_doorbell() local
135 tail = io_sq->tail; in ena_com_write_sq_doorbell()
138 io_sq->qid, tail); in ena_com_write_sq_doorbell()
140 ENA_REG_WRITE32(io_sq->bus, tail, io_sq->db_addr); in ena_com_write_sq_doorbell()
/freebsd-12.1/lib/libc/include/isc/
H A Dlist.h31 #define LIST(type) struct { type *head, *tail; }
33 do { (list).head = NULL; (list).tail = NULL; } while (0)
47 #define TAIL(list) ((list).tail)
56 (list).tail = (elt); \
65 if ((list).tail != NULL) \
66 (list).tail->link.next = (elt); \
69 (elt)->link.prev = (list).tail; \
71 (list).tail = (elt); \
80 INSIST((list).tail == (elt)); \
81 (list).tail = (elt)->link.prev; \
/freebsd-12.1/contrib/gdb/gdb/gdbserver/
H A Dinferiors.c46 if (list->tail != NULL) in add_inferior_to_list()
47 list->tail->next = new_inferior; in add_inferior_to_list()
50 list->tail = new_inferior; in add_inferior_to_list()
71 if (list->head != list->tail) in change_inferior_id()
86 if (list->tail == entry) in remove_inferior()
87 list->tail = list->head; in remove_inferior()
100 if (list->tail == entry) in remove_inferior()
101 list->tail = *cur; in remove_inferior()
143 all_threads.head = all_threads.tail = NULL; in clear_inferiors()
/freebsd-12.1/sys/dev/tws/
H A Dtws_user.c231 if ( sc->aen_q.head == sc->aen_q.tail ) { in tws_retrive_aen()
265 }while ( index != sc->aen_q.tail ); in tws_retrive_aen()
266 if ( index == sc->aen_q.tail ) { in tws_retrive_aen()
279 }while ( index != sc->aen_q.tail ); in tws_retrive_aen()
280 if ( index == sc->aen_q.tail ) { in tws_retrive_aen()
382 volatile u_int16_t head, tail; in tws_circular_aenq_insert() local
387 tail = cq->tail; in tws_circular_aenq_insert()
388 retr = q[tail].retrieved; in tws_circular_aenq_insert()
391 tail = (tail+1) % cq->depth; in tws_circular_aenq_insert()
393 if ( head == tail ) { /* q is full */ in tws_circular_aenq_insert()
[all …]
H A Dtws_services.c94 volatile u_int16_t head, tail; in tws_trace() local
98 tail = sc->trace_q.tail; in tws_trace()
102 strncpy(rec[tail].fname, file, TWS_TRACE_FNAME_LEN); in tws_trace()
103 strncpy(rec[tail].func, fun, TWS_TRACE_FUNC_LEN); in tws_trace()
104 rec[tail].linenum = linenum; in tws_trace()
105 strncpy(rec[tail].desc, desc, TWS_TRACE_DESC_LEN); in tws_trace()
106 rec[tail].val1 = val1; in tws_trace()
107 rec[tail].val2 = val2; in tws_trace()
109 tail = (tail+1) % sc->trace_q.depth; in tws_trace()
111 if ( head == tail ) { in tws_trace()
[all …]
/freebsd-12.1/sys/netpfil/ipfw/
H A Ddn_sched_rr.c79 struct rr_queue *head, *tail; /* Pointer to current queue */ member
93 si->tail->qnext = q; in rr_append()
94 si->tail = q; /* advance the tail pointer */ in rr_append()
106 if (si->head == si->tail) { in rr_remove_head()
107 si->head = si->tail = NULL; in rr_remove_head()
112 si->tail->qnext = si->head; in rr_remove_head()
134 if (q == si->tail) in remove_queue_q()
135 si->tail = prev; in remove_queue_q()
149 si->tail = si->tail->qnext; in next_pointer()
230 si->head = si->tail = NULL; in rr_new_sched()
/freebsd-12.1/sys/dev/drm/
H A Dmga_dma.c89 primary->tail = 0; in mga_do_dma_reset()
111 u32 head, tail; in mga_do_dma_flush() local
130 tail = primary->tail + dev_priv->primary->offset; in mga_do_dma_flush()
148 if (head <= tail) { in mga_do_dma_flush()
167 u32 head, tail; in mga_do_dma_wrap_start() local
179 tail = primary->tail + dev_priv->primary->offset; in mga_do_dma_wrap_start()
181 primary->tail = 0; in mga_do_dma_wrap_start()
337 drm_mga_freelist_t *tail = dev_priv->tail; in mga_freelist_get() local
345 tail->age.head ? in mga_freelist_get()
347 tail->age.wrap); in mga_freelist_get()
[all …]
/freebsd-12.1/sys/netgraph/bluetooth/include/
H A Dng_bluetooth.h69 struct mbuf *tail; /* last item in the queue */ member
80 (q)->tail = NULL; \
103 if ((q)->tail == NULL) \
106 (q)->tail->m_nextpkt = (i); \
108 (q)->tail = (i); \
118 (q)->tail = NULL; \
128 if ((q)->tail == NULL) \
129 (q)->tail = (i); \
/freebsd-12.1/contrib/compiler-rt/lib/tsan/rtl/
H A Dtsan_symbolize.cc59 SymbolizedStack *tail; member
66 if (ssb->tail) { in AddFrame()
67 ssb->tail->next = SymbolizedStack::New(ssb->addr); in AddFrame()
68 ssb->tail = ssb->tail->next; in AddFrame()
70 ssb->head = ssb->tail = SymbolizedStack::New(ssb->addr); in AddFrame()
72 AddressInfo *info = &ssb->tail->info; in AddFrame()
/freebsd-12.1/sys/dev/netmap/
H A Dnetmap_mbq.c51 q->head = q->tail = NULL; in __mbq_init()
72 if (q->tail) { in __mbq_enqueue()
73 q->tail->m_nextpkt = m; in __mbq_enqueue()
74 q->tail = m; in __mbq_enqueue()
76 q->head = q->tail = m; in __mbq_enqueue()
104 q->tail = NULL; in __mbq_dequeue()
/freebsd-12.1/sys/dev/evdev/
H A Dcdev.c746 size_t count, head, tail, ready; in evdev_client_push() local
750 tail = client->ec_buffer_tail; in evdev_client_push()
755 if ((tail + 1) % count == head) { in evdev_client_push()
798 tail = client->ec_buffer_tail; in evdev_client_dumpqueue()
804 head, ready, tail, size); in evdev_client_dumpqueue()
812 if (i < head || i > tail) in evdev_client_dumpqueue()
820 else if (i == tail) in evdev_client_dumpqueue()
833 size_t head, tail, count, i; in evdev_client_filter_queue() local
839 tail = client->ec_buffer_tail; in evdev_client_filter_queue()
866 tail = (tail + 1) % count; in evdev_client_filter_queue()
[all …]
/freebsd-12.1/usr.sbin/timed/timed/
H A Dreadmsg.c79 static struct tsplist *tail = &msgslist; in readmsg() local
95 if (ptr == tail) { in readmsg()
123 if (ptr == tail) in readmsg()
124 tail = prev; in readmsg()
324 tail = head; in readmsg()
326 tail->p = (struct tsplist *) in readmsg()
328 tail = tail->p; in readmsg()
329 tail->p = NULL; in readmsg()
330 tail->info = msgin; in readmsg()
331 tail->addr = from; in readmsg()
[all …]
/freebsd-12.1/crypto/openssl/ssl/
H A Dssl_ciph.c610 if (curr == *tail) in ll_append_tail()
618 (*tail)->next = curr; in ll_append_tail()
619 curr->prev = *tail; in ll_append_tail()
621 *tail = curr; in ll_append_tail()
629 if (curr == *tail) in ll_append_head()
630 *tail = curr->prev; in ll_append_head()
796 tail = *tail_p; in ssl_cipher_apply_rule()
799 next = tail; in ssl_cipher_apply_rule()
803 last = tail; in ssl_cipher_apply_rule()
893 if (tail == curr) in ssl_cipher_apply_rule()
[all …]

12345678910>>...23