Searched refs:tail (Results 1 - 25 of 407) sorted by relevance

1234567891011>>

/freebsd-head/contrib/ncurses/ncurses/
H A Dfifo_defs.h44 #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-head/sys/contrib/ck/include/
H A Dck_hp_fifo.h55 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 Dck_fifo.h50 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-head/usr.bin/find/
H A Doperator.c81 PLAN *tail; /* pointer to tail of subplan */ local
95 for (tail = subplan = NULL;;) {
113 tail = subplan = next;
115 tail->next = next;
116 tail = next;
118 tail->next = NULL;
132 PLAN *tail; /* pointer to tail of result plan */ local
135 result = tail
170 PLAN *tail; /* pointer to tail of result plan */ local
232 PLAN *tail; /* pointer to tail of result plan */ local
[all...]
H A Dfind.c78 PLAN *plan, *tail, *new; local
96 for (plan = tail = NULL; *argv;) {
100 tail = plan = new;
102 tail->next = new;
103 tail = new;
119 tail = plan = new;
127 tail->next = new;
128 tail = new;
131 tail->next = new;
132 tail
[all...]
/freebsd-head/contrib/com_err/
H A Dcompile_et.h58 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-head/crypto/heimdal/lib/com_err/
H A Dcompile_et.h61 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-head/tools/tools/track/
H A Dtrack.sh31 tail -10000 -F "$@" |
/freebsd-head/tests/sys/pjdfstest/tests/
H A Dconf6 mountpoint=$(df . | tail -1 | awk '{print $6}')
/freebsd-head/contrib/jemalloc/include/jemalloc/internal/
H A Dhash.h100 /* tail */
102 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); local
107 case 3: k1 ^= tail[2] << 16;
108 case 2: k1 ^= tail[1] << 8;
109 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
171 /* tail */
173 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); local
180 case 15: k4 ^= tail[14] << 16;
181 case 14: k4 ^= tail[13] << 8;
182 case 13: k4 ^= tail[1
258 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local
[all...]
/freebsd-head/usr.bin/tail/
H A DMakefile6 PROG= tail
7 SRCS= forward.c misc.c read.c reverse.c tail.c
/freebsd-head/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
82 tail -rn2 < infile > outpipe
102 printf '\n1\n2\n3\n' | tail -r > outfile
103 printf '\n1\n2\n3\n' | tail -r > outpipe
124 tail -rc28 infile > outfile
125 tail
[all...]
/freebsd-head/sys/contrib/zstd/contrib/experimental_dict_builders/randomDictBuilder/
H A Drandom.c104 size_t tail = dictBufferCapacity; local
106 while (tail > 0) {
112 segmentSize = MIN(segment.end - segment.begin + 1, tail);
114 tail -= segmentSize;
115 memcpy(dict + tail, samples + segment.begin, segmentSize);
118 (U32)(((dictBufferCapacity - tail) * 100) / dictBufferCapacity));
121 return tail;
152 const size_t tail = RANDOM_buildDictionary(totalSamplesSize, samples, local
155 dict, dictBufferCapacity, dict + tail, dictBufferCapacity - tail,
[all...]
/freebsd-head/contrib/gcc/
H A Dtree-iterator.c70 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 Dsched-ebb.c357 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-head/contrib/ncurses/ncurses/base/
H A Dlib_ungetch.c54 T(("head = %d, tail = %d, peek = %d", head, tail, peek));
67 if (sp != 0 && tail >= 0) {
71 peek = tail; /* no raw keys */
/freebsd-head/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; \
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 Dlist.h31 #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-head/contrib/ncurses/man/
H A DMKterminfo.sh34 # 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-head/contrib/openpam/misc/
H A Dcoverity.sh.in33 if tail -1 "${covlog}" | grep -q "completed successfully" ; then
36 tail "${covlog}"
/freebsd-head/contrib/compiler-rt/lib/tsan/rtl/
H A Dtsan_symbolize.cc58 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-head/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
[all...]
/freebsd-head/sys/compat/linuxkpi/common/include/linux/
H A Dbitmap.h43 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
[all...]
/freebsd-head/contrib/gdb/gdb/gdbserver/
H A Dinferiors.c46 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-head/sys/dev/netmap/
H A Dnetmap_mbq.c51 q->head = q->tail = NULL;
72 if (q->tail) {
73 q->tail->m_nextpkt = m;
74 q->tail = m;
76 q->head = q->tail = m;
104 q->tail = NULL;

Completed in 260 milliseconds

1234567891011>>