/openbsd-current/lib/libcurses/ |
H A D | fifo_defs.h | 47 #define tail sp->_fifotail macro 55 if (head == tail) \ 56 head = -1, tail = 0; \ 62 if (head == tail) \ 63 tail = -1; \ 66 (tail >= FIFO_SIZE-1) \ 67 ? tail = 0 \ 68 : tail++; \ 69 if (tail == head) \ 70 tail [all...] |
/openbsd-current/usr.bin/tail/ |
H A D | Makefile | 3 PROG= tail 4 SRCS= forward.c misc.c read.c reverse.c tail.c
|
/openbsd-current/regress/usr.bin/mandoc/mdoc/break/ |
H A D | Makefile | 3 REGRESS_TARGETS = brokenbreaker twice tail two notopen 4 LINT_TARGETS = brokenbreaker twice tail two notopen 8 SKIP_TMAN = tail
|
/openbsd-current/gnu/gcc/libmudflap/testsuite/libmudflap.c/ |
H A D | heap-scalestress.c | 25 struct list *tail = NULL; local 44 { /* add at tail */ 46 if (NULL != tail) 47 tail->next = p; 50 tail = p; 55 if (NULL == tail) 56 tail = p;
|
/openbsd-current/usr.bin/find/ |
H A D | operator.c | 72 PLAN *tail; /* pointer to tail of subplan */ local 87 for (tail = subplan = NULL;;) { 106 tail = subplan = next; 108 tail->next = next; 109 tail = next; 111 tail->next = NULL; 125 PLAN *tail; /* pointer to tail of result plan */ local 128 result = tail 163 PLAN *tail; /* pointer to tail of result plan */ local 221 PLAN *tail; /* pointer to tail of result plan */ local [all...] |
/openbsd-current/sys/dev/pci/drm/include/drm/ |
H A D | spsc_queue.h | 43 atomic_long_t tail; member in struct:spsc_queue 51 atomic_long_set(&queue->tail, (long)&queue->head); 67 struct spsc_node **tail; local 73 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next); 74 WRITE_ONCE(*tail, node); 85 return tail == &queue->head; 107 if (atomic_long_cmpxchg(&queue->tail, 109 /* Updating tail failed wait for new next to appear */
|
/openbsd-current/games/atc/ |
H A D | list.c | 66 l->head = l->tail = p; 88 l->tail->next = p; 90 p->prev = l->tail; 91 l->tail = p; 102 if (l->head == p && l->tail == p) 103 l->head = l->tail = NULL; 107 } else if (l->tail == p) { 108 l->tail = p->prev; 109 l->tail->next = NULL;
|
/openbsd-current/gnu/usr.bin/binutils/gprof/ |
H A D | search_list.c | 55 if (list->tail) 56 list->tail->next = new_el; 60 list->tail = new_el;
|
H A D | search_list.h | 43 struct search_list_elem *tail; 42 struct search_list_elem *tail; member in struct:__anon4740
|
H A D | cg_dfn.c | 96 Sym *tail; local 155 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next) 157 /* void: chase down to tail of things already glommed */ 159 printf ("[find_cycle] tail "); 160 print_name (tail); 184 tail->cg.cyc.next = child; 191 for (tail [all...] |
/openbsd-current/gnu/usr.bin/binutils-2.17/gprof/ |
H A D | search_list.c | 53 if (list->tail) 54 list->tail->next = new_el; 58 list->tail = new_el;
|
H A D | search_list.h | 43 struct search_list_elem *tail; 42 struct search_list_elem *tail; member in struct:__anon5402
|
H A D | cg_dfn.c | 93 Sym *tail; local 152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next) 154 /* void: chase down to tail of things already glommed */ 156 printf ("[find_cycle] tail "); 157 print_name (tail); 181 tail->cg.cyc.next = child; 188 for (tail [all...] |
/openbsd-current/sys/dev/pci/drm/i915/gt/ |
H A D | intel_ring.h | 26 void intel_ring_reset(struct intel_ring *ring, u32 tail); 91 assert_ring_tail_valid(const struct intel_ring *ring, unsigned int tail) argument 95 GEM_BUG_ON(!intel_ring_offset_valid(ring, tail)); 112 GEM_BUG_ON(cacheline(tail) == cacheline(head) && tail < head); 117 intel_ring_set_tail(struct intel_ring *ring, unsigned int tail) 119 /* Whilst writes to the tail are strictly order, there is no 120 * serialisation between readers and the writers. The tail may be 125 assert_ring_tail_valid(ring, tail); 126 ring->tail 131 __intel_ring_space(unsigned int head, unsigned int tail, unsigned int size) argument [all...] |
/openbsd-current/regress/usr.bin/tail/ |
H A D | forward-lines.sh | 5 # test if tail grep the correct number of blocks from a file. 18 tail -n +5 ${DIR}/bar > ${OUT} 19 tail +5 ${DIR}/bar > ${OUT}1
|
H A D | reverse-lines-rprint.sh | 5 # test if tail grep the correct number of blocks from a file. 18 tail -rn 5 ${DIR}/bar > ${OUT} 19 tail -r -n -5 ${DIR}/bar > ${OUT}1 20 tail -r -5 ${DIR}/bar > ${OUT}2
|
H A D | reverse-lines.sh | 5 # test if tail grep the correct number of blocks from a file. 18 tail -n 5 ${DIR}/bar > ${OUT} 19 tail -n -5 ${DIR}/bar > ${OUT}1 20 tail -5 ${DIR}/bar > ${OUT}2
|
/openbsd-current/gnu/usr.bin/perl/cpan/Encode/bin/ |
H A D | ucmsort | 7 my ($head, $tail); 13 $tail .= $_; 34 print $tail;
|
/openbsd-current/gnu/usr.bin/perl/cpan/Scalar-List-Utils/t/ |
H A D | head-tail.t | 6 use List::Util qw(head tail); 13 ok(defined &tail, 'defined'); 63 @ary = tail 1, ( 4, 5, 6 ); 67 @ary = tail 2, ( 4, 5, 6 ); 72 @ary = tail -1, ( 4, 5, 6 ); 77 @ary = tail -2, ( 4, 5, 6 ); 81 @ary = tail 0, ( 4, 5, 6 ); 84 @ary = tail 0; 87 @ary = tail 5; 90 @ary = tail [all...] |
/openbsd-current/sys/dev/pci/drm/ |
H A D | linux_list_sort.c | 124 struct list_head head, *tail = &head; local 133 tail = tail->next = *first; 140 tail->next = (a != NULL? a : b); 173 struct list_head *tail = (a == NULL? b : a); local 174 while (tail != NULL) { 175 prev->next = tail; 176 tail->prev = prev; 178 tail = tail [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/ |
H A D | sched-ebb.c | 216 schedule_ebb (head, tail) 217 rtx head, tail; 222 if (no_real_insns_p (head, tail)) 229 sched_analyze (&tmp_deps, head, tail); 233 compute_forward_dependences (head, tail); 236 n_insns = set_priorities (head, tail); 239 current_sched_info->next_tail = NEXT_INSN (tail); 243 save_line_notes (0, head, tail); 244 rm_line_notes (head, tail); 269 rm_other_notes (head, tail); 309 rtx tail; local [all...] |
/openbsd-current/gnu/gcc/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...] |
/openbsd-current/gnu/usr.bin/perl/t/mro/ |
H A D | package_aliases.t | 157 for my $tail ('inner', 'inner::', 'inner:::', 'inner::::') { 160 my $tail = shift; 161 @left::ISA = "outer::$tail"; 162 @right::ISA = "clone::$tail"; 163 bless [], "outer::$tail"; # autovivify the stash 167 print "ok 1", "\n" if left->isa("clone::$tail"); 168 print "ok 2", "\n" if right->isa("outer::$tail"); 169 print "ok 3", "\n" if right->isa("clone::$tail"); 170 print "ok 4", "\n" if left->isa("outer::$tail"); 173 { args => [$tail] }, [all...] |
/openbsd-current/usr.bin/dig/lib/isc/include/isc/ |
H A D | list.h | 23 #define ISC_LIST(type) struct { type *head, *tail; } 25 do { (list).head = NULL; (list).tail = NULL; } while (0) 38 #define ISC_LIST_TAIL(list) ((list).tail) 46 (list).tail = (elt); \ 62 if ((list).tail != NULL) \ 63 (list).tail->link.next = (elt); \ 66 (elt)->link.prev = (list).tail; \ 68 (list).tail = (elt); \ 84 ISC_INSIST((list).tail == (elt)); \ 85 (list).tail [all...] |
/openbsd-current/lib/libcurses/base/ |
H A D | lib_ungetch.c | 57 T(("head = %d, tail = %d, peek = %d", head, tail, peek)); 70 if (sp != 0 && tail >= 0) { 74 peek = tail; /* no raw keys */
|