Home
last modified time | relevance | path

Searched refs:tail (Results 1 – 25 of 621) sorted by relevance

12345678910>>...25

/openbsd/src/lib/libcurses/
Dfifo_defs.h47 #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 = -1; \
[all …]
/openbsd/src/usr.bin/find/
Doperator.c72 PLAN *tail; /* pointer to tail of subplan */ in yankexpr() local
87 for (tail = subplan = NULL;;) { in yankexpr()
106 tail = subplan = next; in yankexpr()
108 tail->next = next; in yankexpr()
109 tail = next; in yankexpr()
111 tail->next = NULL; in yankexpr()
125 PLAN *tail; /* pointer to tail of result plan */ in paren_squish() local
128 result = tail = NULL; in paren_squish()
144 tail = result = expr; in paren_squish()
146 tail->next = expr; in paren_squish()
[all …]
Dfind.c59 PLAN *plan, *tail, *new; in find_formplan() local
77 for (plan = tail = NULL; *argv;) { in find_formplan()
81 tail = plan = new; in find_formplan()
83 tail->next = new; in find_formplan()
84 tail = new; in find_formplan()
97 tail = plan = new; in find_formplan()
103 tail->next = new; in find_formplan()
104 tail = new; in find_formplan()
106 tail->next = new; in find_formplan()
107 tail = new; in find_formplan()
/openbsd/src/gnu/usr.bin/gcc/gcc/
Dsched-ebb.c213 schedule_ebb (head, tail) in schedule_ebb() argument
214 rtx head, tail; in schedule_ebb()
219 if (no_real_insns_p (head, tail))
226 sched_analyze (&tmp_deps, head, tail);
230 compute_forward_dependences (head, tail);
233 n_insns = set_priorities (head, tail);
236 current_sched_info->next_tail = NEXT_INSN (tail);
240 save_line_notes (0, head, tail);
241 rm_line_notes (head, tail);
266 rm_other_notes (head, tail);
[all …]
/openbsd/src/gnu/usr.bin/perl/t/mro/
Dpackage_aliases.t157 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 …]
Dpackage_aliases_utf8.t183 for my $tail ('인ንʵ', '인ንʵ::', '인ንʵ:::', '인ንʵ::::') {
199 my $tail = shift;
200 @Ｌфť::ISA = "ɵűʇㄦ::$tail";
201 @R익hȚ::ISA = "cฬnए::$tail";
202 bless [], "ɵűʇㄦ::$tail"; # autovivify the stash
206 print "ok 1", "\n" if Ｌфť->isa("cฬnए::$tail");
207 print "ok 2", "\n" if R익hȚ->isa("ɵűʇㄦ::$tail");
208 print "ok 3", "\n" if R익hȚ->isa("cฬnए::$tail");
209 print "ok 4", "\n" if Ｌфť->isa("ɵűʇㄦ::$tail");
215 { args => [$tail] },
[all …]
/openbsd/src/gnu/gcc/gcc/
Dtree-iterator.c70 struct tree_statement_list_node *head, *tail, *cur; in tsi_link_before() local
78 tail = STATEMENT_LIST_TAIL (t); in tsi_link_before()
85 if (!head || !tail) in tsi_link_before()
87 gcc_assert (head == tail); in tsi_link_before()
97 tail = head; in tsi_link_before()
112 tail->next = cur; in tsi_link_before()
113 cur->prev = tail; in tsi_link_before()
122 STATEMENT_LIST_TAIL (i->container) = tail; in tsi_link_before()
134 i->ptr = tail; in tsi_link_before()
146 struct tree_statement_list_node *head, *tail, *cur; in tsi_link_after() local
[all …]
Dsched-ebb.c354 add_deps_for_risky_insns (rtx head, rtx tail) in add_deps_for_risky_insns() argument
359 rtx next_tail = NEXT_INSN (tail); in add_deps_for_risky_insns()
437 schedule_ebb (rtx head, rtx tail) in schedule_ebb() argument
443 last_bb = BLOCK_FOR_INSN (tail); in schedule_ebb()
445 if (no_real_insns_p (head, tail)) in schedule_ebb()
446 return BLOCK_FOR_INSN (tail); in schedule_ebb()
448 gcc_assert (INSN_P (head) && INSN_P (tail)); in schedule_ebb()
456 sched_analyze (&tmp_deps, head, tail); in schedule_ebb()
460 compute_forward_dependences (head, tail); in schedule_ebb()
462 add_deps_for_risky_insns (head, tail); in schedule_ebb()
[all …]
/openbsd/src/gnu/usr.bin/perl/cpan/Scalar-List-Utils/t/
Dhead-tail.t6 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 -3;
[all …]
/openbsd/src/sys/dev/pci/drm/i915/gt/
Dintel_ring.h26 void intel_ring_reset(struct intel_ring *ring, u32 tail);
91 assert_ring_tail_valid(const struct intel_ring *ring, unsigned int tail) in assert_ring_tail_valid() argument
95 GEM_BUG_ON(!intel_ring_offset_valid(ring, tail)); in assert_ring_tail_valid()
112 GEM_BUG_ON(cacheline(tail) == cacheline(head) && tail < head); in assert_ring_tail_valid()
117 intel_ring_set_tail(struct intel_ring *ring, unsigned int tail) in intel_ring_set_tail() argument
125 assert_ring_tail_valid(ring, tail); in intel_ring_set_tail()
126 ring->tail = tail; in intel_ring_set_tail()
127 return tail; in intel_ring_set_tail()
131 __intel_ring_space(unsigned int head, unsigned int tail, unsigned int size) in __intel_ring_space() argument
139 return (head - tail - CACHELINE_BYTES) & (size - 1); in __intel_ring_space()
/openbsd/src/usr.bin/dig/lib/isc/include/isc/
Dlist.h23 #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 = (elt)->link.prev; \
[all …]
/openbsd/src/gnu/usr.bin/gcc/gcc/cp/
Dtypeck2.c514 digest_init (type, init, tail) in digest_init() argument
515 tree type, init, *tail; in digest_init()
526 if (tail)
528 old_tail_contents = *tail;
529 *tail = TREE_CHAIN (*tail);
672 else if (tail != 0)
674 *tail = old_tail_contents;
675 return process_init_constructor (type, 0, tail);
682 if (tail)
713 register tree tail; local
[all …]
/openbsd/src/gnu/usr.bin/binutils-2.17/gprof/
Dcg_dfn.c93 Sym *tail; in find_cycle() local
152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
157 print_name (tail); in find_cycle()
181 tail->cg.cyc.next = child; in find_cycle()
188 for (tail = child; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
190 tail->cg.cyc.next->cg.cyc.head = head; in find_cycle()
192 print_name (tail->cg.cyc.next); in find_cycle()
/openbsd/src/games/atc/
Dlist.c66 l->head = l->tail = p; in append()
88 l->tail->next = p; in append()
90 p->prev = l->tail; in append()
91 l->tail = p; in append()
102 if (l->head == p && l->tail == p) in delete()
103 l->head = l->tail = NULL; in delete()
107 } else if (l->tail == p) { in delete()
108 l->tail = p->prev; in delete()
109 l->tail->next = NULL; in delete()
/openbsd/src/gnu/usr.bin/binutils/gprof/
Dcg_dfn.c96 Sym *tail; local
155 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next)
160 print_name (tail);
184 tail->cg.cyc.next = child;
191 for (tail = child; tail->cg.cyc.next; tail = tail->cg.cyc.next)
193 tail->cg.cyc.next->cg.cyc.head = head;
195 print_name (tail->cg.cyc.next);
/openbsd/src/sys/dev/pci/drm/
Dlinux_list_sort.c124 struct list_head head, *tail = &head; in list_sort_merge() local
133 tail = tail->next = *first; in list_sort_merge()
140 tail->next = (a != NULL? a : b); in list_sort_merge()
173 struct list_head *tail = (a == NULL? b : a); in list_sort_merge_into() local
174 while (tail != NULL) { in list_sort_merge_into()
175 prev->next = tail; in list_sort_merge_into()
176 tail->prev = prev; in list_sort_merge_into()
178 tail = tail->next; in list_sort_merge_into()
/openbsd/src/sys/dev/pci/drm/include/drm/
Dspsc_queue.h43 atomic_long_t tail; member
51 atomic_long_set(&queue->tail, (long)&queue->head); in spsc_queue_init()
67 struct spsc_node **tail; in spsc_queue_push() local
73 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next); in spsc_queue_push()
74 WRITE_ONCE(*tail, node); in spsc_queue_push()
85 return tail == &queue->head; in spsc_queue_push()
107 if (atomic_long_cmpxchg(&queue->tail, in spsc_queue_pop()
/openbsd/src/regress/usr.bin/mandoc/mdoc/break/
Dtail.out_markdown5 **break-tail** - tail arguments on or after broken blocks
12 tail
15 tail
19 tail
21 tail
26 tail
31 tail
Dtail.out_ascii4 bbrreeaakk--ttaaiill - tail arguments on or after broken blocks
7 Broken by a partial explicit block: <ao [bo ac> bc] tail <ao [bo ac> bc]
8 (po pc) tail
10 Broken by a partial implicit block: <aq [bo eol>] tail <aq [bo eol>] (po
11 pc) tail
15 it <ao ac> tail
18 it <ao ac> (po pc) tail
Dtail.out_lint1 mandoc: tail.in:12:2: WARNING: blocks badly nested: Ao breaks Bo
2 mandoc: tail.in:16:2: WARNING: blocks badly nested: Ao breaks Bo
3 mandoc: tail.in:21:2: WARNING: blocks badly nested: Aq breaks Bo
4 mandoc: tail.in:23:2: WARNING: blocks badly nested: Aq breaks Bo
5 mandoc: tail.in:47:2: WARNING: blocks badly nested: Bro breaks Po
/openbsd/src/lib/libssl/
Dssl_ciph.c537 CIPHER_ORDER **tail) in ll_append_tail() argument
539 if (curr == *tail) in ll_append_tail()
547 (*tail)->next = curr; in ll_append_tail()
548 curr->prev= *tail; in ll_append_tail()
550 *tail = curr; in ll_append_tail()
555 CIPHER_ORDER **tail) in ll_append_head() argument
559 if (curr == *tail) in ll_append_head()
560 *tail = curr->prev; in ll_append_head()
711 CIPHER_ORDER *head, *tail, *curr, *next, *last; in ssl_cipher_apply_rule() local
719 tail = *tail_p; in ssl_cipher_apply_rule()
[all …]
/openbsd/src/gnu/gcc/libmudflap/testsuite/libmudflap.c/
Dheap-scalestress.c25 struct list *tail = NULL; in main() local
46 if (NULL != tail) in main()
47 tail->next = p; in main()
50 tail = p; in main()
55 if (NULL == tail) in main()
56 tail = p; in main()
/openbsd/src/gnu/usr.bin/binutils/gdb/gdbserver/
Dinferiors.c46 if (list->tail != NULL) in add_inferior_to_list()
47 list->tail->next = new_inferior; in add_inferior_to_list()
50 list->tail = new_inferior; in add_inferior_to_list()
71 if (list->head != list->tail) in change_inferior_id()
86 if (list->tail == entry) in remove_inferior()
87 list->tail = list->head; in remove_inferior()
100 if (list->tail == entry) in remove_inferior()
101 list->tail = *cur; in remove_inferior()
143 all_threads.head = all_threads.tail = NULL; in clear_inferiors()
/openbsd/src/gnu/llvm/compiler-rt/lib/tsan/rtl/
Dtsan_symbolize.cpp58 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()
/openbsd/src/gnu/usr.bin/binutils/gdb/
Dframe-base.c69 struct frame_base_table_entry **tail; member
78 table->tail = &table->head; in frame_base_init()
88 (*table->tail) = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct frame_base_table_entry); in frame_base_append_sniffer()
89 (*table->tail)->sniffer = sniffer; in frame_base_append_sniffer()
90 table->tail = &(*table->tail)->next; in frame_base_append_sniffer()

12345678910>>...25