| /src/external/lgpl2/userspace-rcu/dist/src/ |
| wfcqueue.c | 24 struct cds_wfcq_tail *tail)
26 _cds_wfcq_init(head, tail);
30 struct cds_wfcq_tail *tail)
32 _cds_wfcq_destroy(head, tail);
36 struct cds_wfcq_tail *tail)
38 ___cds_wfcq_init(head, tail);
42 const struct cds_wfcq_tail *tail)
45 return _cds_wfcq_empty(head, tail);
49 struct cds_wfcq_tail *tail,
52 return _cds_wfcq_enqueue(head, tail, node)
[all...] |
| /src/external/gpl3/gcc.old/dist/libobjc/objc-private/ |
| objc-list.h | 32 struct objc_list *tail; member in struct:objc_list
35 /* Return a cons cell produced from (head . tail). */
37 list_cons (void* head, struct objc_list* tail)
43 cell->tail = tail;
52 if ((*list)->tail)
55 struct objc_list* tail = (*list)->tail; local
58 *(*list) = *tail;
61 objc_free (tail);
[all...] |
| /src/external/gpl3/gcc/dist/libobjc/objc-private/ |
| objc-list.h | 32 struct objc_list *tail; member in struct:objc_list
35 /* Return a cons cell produced from (head . tail). */
37 list_cons (void* head, struct objc_list* tail)
43 cell->tail = tail;
52 if ((*list)->tail)
55 struct objc_list* tail = (*list)->tail; local
58 *(*list) = *tail;
61 objc_free (tail);
[all...] |
| /src/usr.bin/tail/ |
| Makefile | 4 PROG= tail
5 SRCS= forward.c misc.c read.c reverse.c tail.c
7 LINKS= ${BINDIR}/tail ${BINDIR}/tac
9 MAN= tail.1 tac.1
|
| /src/usr.bin/make/unit-tests/ |
| varmod-tail.exp | 0 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 '
[all...] |
| /src/lib/libc/arch/riscv/gen/ |
| __sigsetjmp14.S | 12 tail PLT(_C_LABEL(_setjmp))
13 1: tail PLT(_C_LABEL(__setjmp14))
19 tail PLT(_C_LABEL(_longjmp))
20 1: tail PLT(_C_LABEL(__longjmp14))
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| mpsc_queue.h | 30 atomic_p_t tail; \
56 atomic_store_p(&queue->tail, NULL, ATOMIC_RELAXED); \
66 void* cur_tail = atomic_load_p(&queue->tail, ATOMIC_RELAXED); \
78 } while (!atomic_compare_exchange_weak_p(&queue->tail, \
92 a_type *tail = atomic_load_p(&queue->tail, ATOMIC_RELAXED); \
93 if (tail == NULL) { \
100 tail = atomic_exchange_p(&queue->tail, NULL, ATOMIC_ACQUIRE); \
105 assert(tail != NULL);
[all...] |
| /src/external/mpl/dhcp/dist/includes/omapip/ |
| buffer.h | 33 the tail never catches up to the head, there's room in the buffer for
36 - If the tail and the head are equal, the buffer is empty.
38 - If the tail is less than the head, the contents of the buffer
40 the bytes between the beginning of the buffer and the tail, not
41 including the byte addressed by the tail.
43 - If the tail is greater than the head, then the buffer contains
45 ending with the byte before the byte addressed by the tail.
47 There will always be at least one byte of waste, because the tail can't
54 u_int16_t head, tail; /* Buffers are organized in a ring. */ member in struct:_omapi_buffer
60 ((x) -> tail > (x) -> head
[all...] |
| /src/usr.bin/find/ |
| operator.c | 82 PLAN *tail; /* pointer to tail of subplan */ local
96 for (tail = subplan = NULL;;) {
115 tail = subplan = next;
117 tail->next = next;
118 tail = next;
120 tail->next = NULL;
134 PLAN *tail; /* pointer to tail of result plan */ local
137 result = tail = NULL
172 PLAN *tail; \/* pointer to tail of result plan *\/ local
230 PLAN *tail; \/* pointer to tail of result plan *\/ local
[all...] |
| /src/lib/libc/locale/ |
| newlocale.c | 47 char head[_LOCALENAME_LEN_MAX * (_LC_LAST - 1)], *tail; local
65 tail = __UNCONST(strchr(tokens[0], '/'));
66 if (tail == NULL) {
75 *tail++ = '\0';
83 *tail++ = '\0';
84 tokens[i] = (const char *)tail;
85 tail = __UNCONST(strchr(tokens[i], '/'));
86 if (tail == NULL) {
91 *tail++ = '\0';
92 tokens[howmany] = tail;
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/i915/gt/ |
| intel_ring.h | 28 void intel_ring_reset(struct intel_ring *ring, u32 tail);
91 assert_ring_tail_valid(const struct intel_ring *ring, unsigned int tail)
93 GEM_BUG_ON(!intel_ring_offset_valid(ring, tail));
100 * "If the Ring Buffer Head Pointer and the Tail Pointer are on the
101 * same cacheline, the Head Pointer must not be greater than the Tail
110 GEM_BUG_ON(cacheline(tail) == cacheline(ring->head) &&
111 tail < ring->head);
116 intel_ring_set_tail(struct intel_ring *ring, unsigned int tail)
118 /* Whilst writes to the tail are strictly order, there is no
119 * serialisation between readers and the writers. The tail may b
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/include/urcu/static/ |
| wfcqueue.h | 90 struct cds_wfcq_tail *tail)
94 /* Set queue head and tail */
96 tail->p = &head->node;
106 struct cds_wfcq_tail *tail __attribute__((unused)))
117 struct cds_wfcq_tail *tail)
119 /* Set queue head and tail */
121 tail->p = &head->node;
130 * possibly empty, but we confirm this by checking if the tail pointer
131 * points to the head node because the tail pointer is the linearisation
137 const struct cds_wfcq_tail *tail)
526 struct cds_wfcq_node *head, *tail; local
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/include/urcu/ |
| wfcqueue.h | 49 * Do not put head and tail on the same cache-line if concurrent
265 struct cds_wfcq_tail *tail);
272 struct cds_wfcq_tail *tail);
279 struct cds_wfcq_tail *tail);
287 const struct cds_wfcq_tail *tail);
293 struct cds_wfcq_tail *tail);
299 struct cds_wfcq_tail *tail);
311 struct cds_wfcq_tail *tail,
325 struct cds_wfcq_tail *tail);
335 struct cds_wfcq_tail *tail,
[all...] |
| /src/sys/external/bsd/drm2/dist/include/drm/ |
| spsc_queue.h | 45 atomic_long_t tail; member in struct:spsc_queue
53 atomic_long_set(&queue->tail, (long)&queue->head);
69 struct spsc_node **tail; local
75 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next);
76 WRITE_ONCE(*tail, node);
87 return tail == &queue->head;
109 if (atomic_long_cmpxchg(&queue->tail,
111 /* Updating tail failed wait for new next to appear */
|
| /src/games/atc/ |
| list.c | 73 l->head = l->tail = p;
95 l->tail->next = p;
97 p->prev = l->tail;
98 l->tail = p;
109 if (l->head == p && l->tail == p)
110 l->head = l->tail = NULL;
114 } else if (l->tail == p) {
115 l->tail = p->prev;
116 l->tail->next = NULL;
|
| /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/ |
| hash.h | 100 /* 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; /*FALLTHROUGH*/
181 case 14: k4 ^= tail[13] << 8; /*FALLTHROUGH*/
182 case 13: k4 ^= tail[12] << 0
261 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local
[all...] |
| /src/external/bsd/jemalloc.old/include/jemalloc/internal/ |
| hash.h | 100 /* 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; /*FALLTHROUGH*/
181 case 14: k4 ^= tail[13] << 8; /*FALLTHROUGH*/
182 case 13: k4 ^= tail[12] << 0
261 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local
[all...] |
| /src/external/gpl3/binutils/dist/gprof/ |
| search_list.c | 52 if (list->tail)
53 list->tail->next = new_el;
57 list->tail = new_el;
|
| /src/external/gpl3/binutils.old/dist/gprof/ |
| search_list.c | 52 if (list->tail)
53 list->tail->next = new_el;
57 list->tail = new_el;
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.reverse/ |
| insn-reverse.c | 68 char *tail; local
69 test_nr = strtol (argv[1], &tail, 10);
70 if (*tail != '\0')
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.reverse/ |
| insn-reverse.c | 68 char *tail; local
69 test_nr = strtol (argv[1], &tail, 10);
70 if (*tail != '\0')
|
| /src/sys/external/bsd/drm2/include/linux/ |
| kfifo.h | 138 const size_t tail = meta->kfm_tail; local
141 return (head <= tail ? tail - head : nbytes + tail - head);
156 const size_t tail = meta->kfm_tail; local
158 if (head <= tail) {
159 if (size <= tail - head) {
167 } else if (size <= nbytes + tail - head) {
191 const size_t tail = meta->kfm_tail; local
193 if (head <= tail) {
229 const size_t tail = meta->kfm_tail; local
[all...] |
| /src/sys/arch/cats/conf/ |
| Makefile.cats.inc | 23 ${ARM}/conf/kern.ldscript.tail \
29 cat ${ARM}/conf/kern.ldscript.tail ) > $@
|
| /src/sys/arch/shark/conf/ |
| Makefile.shark.inc | 17 ${ARM}/conf/kern.ldscript.tail \
23 cat ${ARM}/conf/kern.ldscript.tail ) > ldscript
|
| /src/tests/kernel/arch/riscv/ |
| contextspfunc.S | 44 tail _C_LABEL(contextdone) /* tail call contextdone */
|
