| /freebsd-13.1/sys/contrib/ck/include/ |
| H A D | ck_hp_fifo.h | 90 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 D | ck_fifo.h | 263 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-13.1/contrib/ncurses/ncurses/ |
| H A D | fifo_defs.h | 53 if (head == tail) \ 54 head = -1, tail = 0; \ 60 if (head == tail) \ 61 tail = -1; \ 65 ? tail = 0 \ 66 : tail++; \ 67 if (tail == head) \ 68 tail = -1; \ 71 (tail <= 0) \ 72 ? tail = FIFO_SIZE-1 \ [all …]
|
| /freebsd-13.1/usr.bin/find/ |
| H A D | operator.c | 116 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 D | find.c | 78 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-13.1/stand/efi/libefi/ |
| H A D | devpath.c | 83 char *tail; in efi_make_tail() local 85 tail = NULL; in efi_make_tail() 90 return (tail); in efi_make_tail() 123 free(tail); in efi_vendor_path() 135 free(tail); in efi_vendor_path() 179 free(tail); in efi_hw_dev_path() 244 free(tail); in efi_acpi_dev_path() 253 char *tail; in efi_messaging_dev_path() local 334 free(tail); in efi_messaging_dev_path() 345 char *tail; in efi_media_dev_path() local [all …]
|
| /freebsd-13.1/contrib/jemalloc/include/jemalloc/internal/ |
| H A D | hash.h | 107 case 3: k1 ^= tail[2] << 16; JEMALLOC_FALLTHROUGH in hash_x86_32() 108 case 2: k1 ^= tail[1] << 8; JEMALLOC_FALLTHROUGH in hash_x86_32() 181 case 14: k4 ^= tail[13] << 8; JEMALLOC_FALLTHROUGH in hash_x86_128() 182 case 13: k4 ^= tail[12] << 0; in hash_x86_128() 187 case 10: k3 ^= tail[ 9] << 8; JEMALLOC_FALLTHROUGH in hash_x86_128() 188 case 9: k3 ^= tail[ 8] << 0; in hash_x86_128() 193 case 6: k2 ^= tail[ 5] << 8; JEMALLOC_FALLTHROUGH in hash_x86_128() 194 case 5: k2 ^= tail[ 4] << 0; in hash_x86_128() 200 case 1: k1 ^= tail[ 0] << 0; in hash_x86_128() 270 case 9: k2 ^= ((uint64_t)(tail[ 8])) << 0; in hash_x64_128() [all …]
|
| /freebsd-13.1/usr.bin/tail/tests/ |
| H A D | tail_test.sh | 36 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 161 tail -r infile > outfile 162 tail -r < infile > outpipe 206 tail -r infile > outfile 207 tail -r < infile > outpipe [all …]
|
| /freebsd-13.1/contrib/bmake/unit-tests/ |
| H A D | varmod-tail.exp | 1 tail (basename) of 'a/b/c' is 'c' 2 tail (basename) of 'def' is 'def' 3 tail (basename) of 'a.b.c' is 'a.b.c' 4 tail (basename) of 'a.b/c' is 'c' 5 tail (basename) of 'a' is 'a' 6 tail (basename) of 'a.a' is 'a.a' 7 tail (basename) of '.gitignore' is '.gitignore' 8 tail (basename) of 'a' is 'a' 9 tail (basename) of 'a.a' is 'a.a' 10 tail (basename) of 'trailing/' is ''
|
| /freebsd-13.1/sys/dev/syscons/ |
| H A D | sctermvar.h | 66 if (tail <= 0) in sc_term_ins_line() 67 tail = scp->ysize; in sc_term_ins_line() 70 if (n > tail - y) in sc_term_ins_line() 71 n = tail - y; in sc_term_ins_line() 80 if (tail <= 0) in sc_term_del_line() 81 tail = scp->ysize; in sc_term_del_line() 84 if (n > tail - y) in sc_term_del_line() 85 n = tail - y; in sc_term_del_line() 153 if (tail <= 0) in sc_term_down() 182 if (tail <= 0) in sc_term_up_scroll() [all …]
|
| /freebsd-13.1/sys/compat/linuxkpi/common/include/linux/ |
| H A D | bitmap.h | 44 const unsigned int tail = size & (BITS_PER_LONG - 1); in bitmap_fill() local 48 if (tail) in bitmap_fill() 49 addr[BIT_WORD(size)] = BITMAP_LAST_WORD_MASK(tail); in bitmap_fill() 56 const unsigned int tail = size & (BITS_PER_LONG - 1); in bitmap_full() local 64 if (tail) { in bitmap_full() 77 const unsigned int tail = size & (BITS_PER_LONG - 1); in bitmap_empty() local 85 if (tail) { in bitmap_empty() 217 if (tail) { in bitmap_weight() 238 if (tail) { in bitmap_equal() 252 const unsigned tail = size & (BITS_PER_LONG - 1); in bitmap_subset() local [all …]
|
| /freebsd-13.1/contrib/ntp/lib/isc/include/isc/ |
| H A D | list.h | 46 #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 D | queue.h | 47 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-13.1/lib/libc/include/isc/ |
| H A D | list.h | 31 #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-13.1/sys/netpfil/ipfw/ |
| H A D | dn_sched_rr.c | 79 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() 148 si->tail = si->tail->qnext; in next_pointer() 229 si->head = si->tail = NULL; in rr_new_sched()
|
| /freebsd-13.1/sys/dev/tws/ |
| H A D | tws_user.c | 228 if ( sc->aen_q.head == sc->aen_q.tail ) { in tws_retrive_aen() 262 }while ( index != sc->aen_q.tail ); in tws_retrive_aen() 263 if ( index == sc->aen_q.tail ) { in tws_retrive_aen() 276 }while ( index != sc->aen_q.tail ); in tws_retrive_aen() 277 if ( index == sc->aen_q.tail ) { in tws_retrive_aen() 377 volatile u_int16_t head, tail; in tws_circular_aenq_insert() local 382 tail = cq->tail; in tws_circular_aenq_insert() 383 retr = q[tail].retrieved; in tws_circular_aenq_insert() 386 tail = (tail+1) % cq->depth; in tws_circular_aenq_insert() 388 if ( head == tail ) { /* q is full */ in tws_circular_aenq_insert() [all …]
|
| H A D | tws_services.c | 91 volatile u_int16_t head, tail; in tws_trace() local 95 tail = sc->trace_q.tail; in tws_trace() 99 strncpy(rec[tail].fname, file, TWS_TRACE_FNAME_LEN); in tws_trace() 100 strncpy(rec[tail].func, fun, TWS_TRACE_FUNC_LEN); in tws_trace() 101 rec[tail].linenum = linenum; in tws_trace() 102 strncpy(rec[tail].desc, desc, TWS_TRACE_DESC_LEN); in tws_trace() 103 rec[tail].val1 = val1; in tws_trace() 104 rec[tail].val2 = val2; in tws_trace() 106 tail = (tail+1) % sc->trace_q.depth; in tws_trace() 108 if ( head == tail ) { in tws_trace() [all …]
|
| /freebsd-13.1/contrib/llvm-project/compiler-rt/lib/tsan/rtl/ |
| H A D | tsan_symbolize.cpp | 58 SymbolizedStack *tail; member 65 if (ssb->tail) { in AddFrame() 66 ssb->tail->next = SymbolizedStack::New(ssb->addr); in AddFrame() 67 ssb->tail = ssb->tail->next; in AddFrame() 69 ssb->head = ssb->tail = SymbolizedStack::New(ssb->addr); in AddFrame() 71 AddressInfo *info = &ssb->tail->info; in AddFrame()
|
| /freebsd-13.1/sys/netgraph/bluetooth/include/ |
| H A D | ng_bluetooth.h | 69 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-13.1/sys/dev/netmap/ |
| H A D | netmap_mbq.c | 51 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-13.1/lib/libc/riscv/gen/ |
| H A D | sigsetjmp.S | 42 tail _C_LABEL(setjmp) 44 tail _C_LABEL(_setjmp) 54 tail _C_LABEL(longjmp) 56 tail _C_LABEL(_longjmp)
|
| /freebsd-13.1/contrib/com_err/ |
| H A D | compile_et.h | 58 struct error_code *next, **tail; member 67 (L)->tail = &(V)->next; \ 70 *(L)->tail = (V); \ 71 (L)->tail = &(V)->next; \
|
| /freebsd-13.1/crypto/heimdal/lib/com_err/ |
| H A D | compile_et.h | 61 struct error_code *next, **tail; member 70 (L)->tail = &(V)->next; \ 73 *(L)->tail = (V); \ 74 (L)->tail = &(V)->next; \
|
| /freebsd-13.1/sys/contrib/ena-com/ |
| H A D | ena_eth_com.h | 105 u16 tail, next_to_comp, cnt; in ena_com_free_q_entries() local 108 tail = io_sq->tail; in ena_com_free_q_entries() 109 cnt = tail - next_to_comp; in ena_com_free_q_entries() 184 u16 tail = io_sq->tail; in ena_com_write_sq_doorbell() local 188 io_sq->qid, tail); in ena_com_write_sq_doorbell() 190 ENA_REG_WRITE32(io_sq->bus, tail, io_sq->db_addr); in ena_com_write_sq_doorbell()
|
| /freebsd-13.1/crypto/openssl/ssl/ |
| H A D | ssl_ciph.c | 610 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 …]
|