/freebsd-11-stable/contrib/ncurses/ncurses/ |
H A D | fifo_defs.h | 44 #define tail sp->_fifotail macro 52 if (head == tail) \ 53 head = -1, tail = 0; \ 59 if (head == tail) \ 60 tail = -1; \ 63 (tail >= FIFO_SIZE-1) \ 64 ? tail = 0 \ 65 : tail++; \ 66 if (tail == head) \ 67 tail [all...] |
/freebsd-11-stable/sys/contrib/ck/include/ |
H A D | ck_hp_fifo.h | 55 struct ck_hp_fifo_entry *tail; member in struct:ck_hp_fifo 63 fifo->head = fifo->tail = stub; 73 fifo->head = fifo->tail = NULL; 83 struct ck_hp_fifo_entry *tail, *next; local 90 tail = ck_pr_load_ptr(&fifo->tail); 91 ck_hp_set_fence(record, 0, tail); 92 if (tail != ck_pr_load_ptr(&fifo->tail)) 95 next = ck_pr_load_ptr(&tail 114 struct ck_hp_fifo_entry *tail, *next; local 142 struct ck_hp_fifo_entry *head, *tail, *next; local 176 struct ck_hp_fifo_entry *head, *tail, *next; local [all...] |
H A D | ck_fifo.h | 50 struct ck_fifo_spsc_entry *tail; member in struct:ck_fifo_spsc 110 fifo->head = fifo->tail = fifo->head_snapshot = fifo->garbage = stub; 119 fifo->head = fifo->tail = NULL; 134 ck_pr_store_ptr(&fifo->tail->next, entry); 135 fifo->tail = entry; 220 struct ck_fifo_mpmc_pointer tail; member in struct:ck_fifo_mpmc 230 fifo->head.pointer = fifo->tail.pointer = stub; 231 fifo->head.generation = fifo->tail.generation = NULL; 240 fifo->head.pointer = fifo->tail.pointer = NULL; 249 struct ck_fifo_mpmc_pointer tail, nex local 306 struct ck_fifo_mpmc_pointer tail, next, update; local 359 struct ck_fifo_mpmc_pointer head, tail, next, update; local 414 struct ck_fifo_mpmc_pointer head, tail, next, update; local [all...] |
/freebsd-11-stable/usr.bin/find/ |
H A D | operator.c | 80 PLAN *tail; /* pointer to tail of subplan */ local 94 for (tail = subplan = NULL;;) { 112 tail = subplan = next; 114 tail->next = next; 115 tail = next; 117 tail->next = NULL; 131 PLAN *tail; /* pointer to tail of result plan */ local 134 result = tail 169 PLAN *tail; /* pointer to tail of result plan */ local 231 PLAN *tail; /* pointer to tail of result plan */ local [all...] |
H A D | find.c | 79 PLAN *plan, *tail, *new; local 97 for (plan = tail = NULL; *argv;) { 101 tail = plan = new; 103 tail->next = new; 104 tail = new; 120 tail = plan = new; 128 tail->next = new; 129 tail = new; 132 tail->next = new; 133 tail [all...] |
/freebsd-11-stable/contrib/com_err/ |
H A D | compile_et.h | 58 struct error_code *next, **tail; member in struct:error_code 67 (L)->tail = &(V)->next; \ 70 *(L)->tail = (V); \ 71 (L)->tail = &(V)->next; \
|
/freebsd-11-stable/crypto/heimdal/lib/com_err/ |
H A D | compile_et.h | 61 struct error_code *next, **tail; member in struct:error_code 70 (L)->tail = &(V)->next; \ 73 *(L)->tail = (V); \ 74 (L)->tail = &(V)->next; \
|
/freebsd-11-stable/tools/tools/track/ |
H A D | track.sh | 31 tail -10000 -F "$@" |
|
/freebsd-11-stable/tests/sys/pjdfstest/tests/ |
H A D | conf | 6 mountpoint=$(df . | tail -1 | awk '{print $6}')
|
/freebsd-11-stable/usr.bin/tail/ |
H A D | Makefile | 1 # $FreeBSD: stable/11/usr.bin/tail/Makefile 314427 2017-02-28 22:49:41Z asomers $ 6 PROG= tail 7 SRCS= forward.c misc.c read.c reverse.c tail.c
|
/freebsd-11-stable/usr.bin/tail/tests/ |
H A D | tail_test.sh | 25 # $FreeBSD: stable/11/usr.bin/tail/tests/tail_test.sh 332600 2018-04-16 16:20:39Z asomers $ 35 tail -r infile > outfile 36 tail -r < infile > outpipe 58 tail -r infile > outfile 59 tail -r < infile > outpipe 80 tail -rn2 infile > outfile 81 tail -rn2 < infile > outpipe 101 printf '\n1\n2\n3\n' | tail -r > outfile 102 printf '\n1\n2\n3\n' | tail -r > outpipe 123 tail [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | tree-iterator.c | 70 struct tree_statement_list_node *head, *tail, *cur; local 78 tail = STATEMENT_LIST_TAIL (t); 85 if (!head || !tail) 87 gcc_assert (head == tail); 97 tail = head; 112 tail->next = cur; 113 cur->prev = tail; 122 STATEMENT_LIST_TAIL (i->container) = tail; 134 i->ptr = tail; 146 struct tree_statement_list_node *head, *tail, *cu local [all...] |
H A D | sched-ebb.c | 357 add_deps_for_risky_insns (rtx head, rtx tail) 362 rtx next_tail = NEXT_INSN (tail); 440 schedule_ebb (rtx head, rtx tail) 446 last_bb = BLOCK_FOR_INSN (tail); 448 if (no_real_insns_p (head, tail)) 449 return BLOCK_FOR_INSN (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); 354 add_deps_for_risky_insns(rtx head, rtx tail) argument 437 schedule_ebb(rtx head, rtx tail) argument 545 rtx tail; local [all...] |
/freebsd-11-stable/contrib/jemalloc/include/jemalloc/internal/ |
H A D | hash.h | 133 /* tail */ 135 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); local 140 case 3: k1 ^= tail[2] << 16; 141 case 2: k1 ^= tail[1] << 8; 142 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15); 205 /* tail */ 207 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); local 214 case 15: k4 ^= tail[14] << 16; 215 case 14: k4 ^= tail[13] << 8; 216 case 13: k4 ^= tail[1 293 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local [all...] |
/freebsd-11-stable/contrib/ncurses/ncurses/base/ |
H A D | lib_ungetch.c | 54 T(("head = %d, tail = %d, peek = %d", head, tail, peek)); 67 if (sp != 0 && tail >= 0) { 71 peek = tail; /* no raw keys */
|
/freebsd-11-stable/contrib/ntp/lib/isc/include/isc/ |
H A D | queue.h | 21 * There are built-in mutex locks for the head and tail of the queue, 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; \
|
H A D | list.h | 31 #define ISC_LIST(type) struct { type *head, *tail; } 33 do { (list).head = NULL; (list).tail = NULL; } while (0) 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 [all...] |
/freebsd-11-stable/contrib/ncurses/man/ |
H A D | MKterminfo.sh | 34 # This script takes terminfo.head and terminfo.tail and splices in between 54 tail=$3 58 .\" It is generated from terminfo.head, Caps, and terminfo.tail. 108 cat $tail
|
/freebsd-11-stable/sys/compat/linuxkpi/common/include/linux/ |
H A D | bitmap.h | 43 const unsigned int tail = size & (BITS_PER_LONG - 1); local 47 if (tail) 48 addr[BIT_WORD(size)] = BITMAP_LAST_WORD_MASK(tail); 55 const unsigned int tail = size & (BITS_PER_LONG - 1); local 63 if (tail) { 64 const unsigned long mask = BITMAP_LAST_WORD_MASK(tail); 76 const unsigned int tail = size & (BITS_PER_LONG - 1); local 84 if (tail) { 85 const unsigned long mask = BITMAP_LAST_WORD_MASK(tail); 209 const unsigned int tail local 229 const unsigned int tail = size & (BITS_PER_LONG - 1); local 251 const unsigned tail = size & (BITS_PER_LONG - 1); local [all...] |
/freebsd-11-stable/contrib/openpam/misc/ |
H A D | coverity.sh.in | 33 if tail -1 "${covlog}" | grep -q "completed successfully" ; then 36 tail "${covlog}"
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_symbolize.cpp | 58 SymbolizedStack *tail; member in struct:__tsan::SymbolizedStackBuilder 65 if (ssb->tail) { 66 ssb->tail->next = SymbolizedStack::New(ssb->addr); 67 ssb->tail = ssb->tail->next; 69 ssb->head = ssb->tail = SymbolizedStack::New(ssb->addr); 71 AddressInfo *info = &ssb->tail->info;
|
/freebsd-11-stable/lib/libc/include/isc/ |
H A D | list.h | 29 #define LIST(type) struct { type *head, *tail; } 31 do { (list).head = NULL; (list).tail = NULL; } while (0) 45 #define TAIL(list) ((list).tail) 54 (list).tail = (elt); \ 63 if ((list).tail != NULL) \ 64 (list).tail->link.next = (elt); \ 67 (elt)->link.prev = (list).tail; \ 69 (list).tail = (elt); \ 78 INSIST((list).tail == (elt)); \ 79 (list).tail [all...] |
/freebsd-11-stable/contrib/gdb/gdb/gdbserver/ |
H A D | inferiors.c | 46 if (list->tail != NULL) 47 list->tail->next = new_inferior; 50 list->tail = new_inferior; 71 if (list->head != list->tail) 86 if (list->tail == entry) 87 list->tail = list->head; 100 if (list->tail == entry) 101 list->tail = *cur; 143 all_threads.head = all_threads.tail = NULL;
|
/freebsd-11-stable/sys/dev/netmap/ |
H A D | netmap_mbq.c | 49 q->head = q->tail = NULL; 70 if (q->tail) { 71 q->tail->m_nextpkt = m; 72 q->tail = m; 74 q->head = q->tail = m; 102 q->tail = NULL;
|
/freebsd-11-stable/contrib/libucl/doc/ |
H A D | Makefile.am | 6 tail -n +$$(grep -n '# Synopsis' api.md | cut -d':' -f1) api.md | \
|