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

1234567891011>>

/freebsd-10.0-release/contrib/ncurses/ncurses/
H A Dfifo_defs.h44 #define tail sp->_fifotail macro
48 #define h_inc() { head == FIFO_SIZE-1 ? head = 0 : head++; if (head == tail) head = -1, tail = 0;}
49 #define h_dec() { head == 0 ? head = FIFO_SIZE-1 : head--; if (head == tail) tail = -1;}
50 #define t_inc() { tail == FIFO_SIZE-1 ? tail = 0 : tail++; if (tail == head) tail
[all...]
/freebsd-10.0-release/usr.bin/tail/
H A DMakefile4 PROG= tail
5 SRCS= forward.c misc.c read.c reverse.c tail.c
/freebsd-10.0-release/usr.bin/find/
H A Doperator.c80 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 Dfind.c79 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-10.0-release/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-10.0-release/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-10.0-release/sys/dev/cxgb/sys/
H A Dmbufq.h37 struct mbuf *tail; member in struct:mbuf_head
46 l->head = l->tail = NULL;
81 l->tail->m_nextpkt = m;
82 l->tail = m;
93 if (m == l->tail)
94 l->head = l->tail = NULL;
114 if (a->tail)
115 a->tail->m_nextpkt = b->head;
116 if (b->tail)
117 a->tail
[all...]
/freebsd-10.0-release/sys/dev/xen/netfront/
H A Dmbufq.h37 struct mbuf *tail; member in struct:mbuf_head
46 l->head = l->tail = NULL;
81 l->tail->m_nextpkt = m;
82 l->tail = m;
93 if (m == l->tail)
94 l->head = l->tail = NULL;
114 if (a->tail)
115 a->tail->m_nextpkt = b->head;
116 if (b->tail)
117 a->tail
[all...]
/freebsd-10.0-release/tools/tools/track/
H A Dtrack.sh31 tail -10000 -F "$@" |
/freebsd-10.0-release/contrib/jemalloc/include/jemalloc/internal/
H A Dhash.h111 /* tail */
113 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); local
118 case 3: k1 ^= tail[2] << 16;
119 case 2: k1 ^= tail[1] << 8;
120 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
183 /* tail */
185 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); local
192 case 15: k4 ^= tail[14] << 16;
193 case 14: k4 ^= tail[13] << 8;
194 case 13: k4 ^= tail[1
271 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local
[all...]
/freebsd-10.0-release/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-10.0-release/contrib/ncurses/ncurses/base/
H A Dlib_ungetch.c53 T(("head = %d, tail = %d, peek = %d", head, tail, peek));
64 if (tail != -1) {
68 peek = tail; /* no raw keys */
/freebsd-10.0-release/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-10.0-release/lib/libc/include/isc/
H A Dlist.h29 #define LIST(type) struct { type *head, *tail; }
31 do { (list).head = NULL; (list).tail = NULL; } while (0)
44 #define TAIL(list) ((list).tail)
53 (list).tail = (elt); \
62 if ((list).tail != NULL) \
63 (list).tail->link.next = (elt); \
66 (elt)->link.prev = (list).tail; \
68 (list).tail = (elt); \
77 INSIST((list).tail == (elt)); \
78 (list).tail
[all...]
/freebsd-10.0-release/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-10.0-release/contrib/ntp/include/isc/
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 (list).tail = (elt)->link.prev; \
160 (list1).tail
[all...]
/freebsd-10.0-release/sys/netgraph/bluetooth/include/
H A Dng_bluetooth.h67 struct mbuf *tail; /* last item in the queue */ member in struct:ng_bt_mbufq
78 (q)->tail = NULL; \
101 if ((q)->tail == NULL) \
104 (q)->tail->m_nextpkt = (i); \
106 (q)->tail = (i); \
116 (q)->tail = NULL; \
126 if ((q)->tail == NULL) \
127 (q)->tail = (i); \
/freebsd-10.0-release/sys/pc98/cbus/
H A Dsctermvar.h37 int attr, int tail);
39 int attr, int tail);
47 static __inline void sc_term_down(scr_stat *scp, int n, int tail);
51 int attr, int head, int tail);
53 int attr, int head, int tail);
64 sc_term_ins_line(scr_stat *scp, int y, int n, int ch, int attr, int tail) argument
66 if (tail <= 0)
67 tail = scp->ysize;
70 if (n > tail - y)
71 n = tail
78 sc_term_del_line(scr_stat *scp, int y, int n, int ch, int attr, int tail) argument
151 sc_term_down(scr_stat *scp, int n, int tail) argument
180 sc_term_up_scroll(scr_stat *scp, int n, int ch, int attr, int head, int tail) argument
196 sc_term_down_scroll(scr_stat *scp, int n, int ch, int attr, int head, int tail) argument
[all...]
/freebsd-10.0-release/sys/netpfil/ipfw/
H A Ddn_sched_rr.c71 struct rr_queue *head, *tail; /* Pointer to current queue */ member in struct:rr_si
81 /* append to the tail */
85 si->tail->qnext = q;
86 si->tail = q; /* advance the tail pointer */
98 if (si->head == si->tail) {
99 si->head = si->tail = NULL;
104 si->tail->qnext = si->head;
126 if (q == si->tail)
127 si->tail
[all...]
/freebsd-10.0-release/sys/dev/tws/
H A Dtws_services.c92 volatile u_int16_t head, tail; local
96 tail = sc->trace_q.tail;
98 getnanotime(&rec[tail].ts);
100 strncpy(rec[tail].fname, file, TWS_TRACE_FNAME_LEN);
101 strncpy(rec[tail].func, fun, TWS_TRACE_FUNC_LEN);
102 rec[tail].linenum = linenum;
103 strncpy(rec[tail].desc, desc, TWS_TRACE_DESC_LEN);
104 rec[tail].val1 = val1;
105 rec[tail]
[all...]
/freebsd-10.0-release/sys/dev/drm/
H A Ddrm_auth.c87 if (dev->magiclist[hash].tail) {
88 dev->magiclist[hash].tail->next = entry;
89 dev->magiclist[hash].tail = entry;
92 dev->magiclist[hash].tail = entry;
118 if (dev->magiclist[hash].tail == pt) {
119 dev->magiclist[hash].tail = prev;
/freebsd-10.0-release/sys/dev/drm2/
H A Ddrm_auth.c87 if (dev->magiclist[hash].tail) {
88 dev->magiclist[hash].tail->next = entry;
89 dev->magiclist[hash].tail = entry;
92 dev->magiclist[hash].tail = entry;
118 if (dev->magiclist[hash].tail == pt) {
119 dev->magiclist[hash].tail = prev;
/freebsd-10.0-release/usr.bin/gzip/
H A Dgzexe43 if /usr/bin/tail +$lines "$0" |
72 if ! tail +$lines "$tmp" | gzip -vdc > "$1"; then
93 sh | mktemp | rm | echo | tail | gzip | chmod)
/freebsd-10.0-release/sys/ofed/include/linux/
H A Dbitops.h234 int tail; local
239 tail = size & (BITS_PER_LONG - 1);
240 if (tail)
241 addr[size / BITS_PER_LONG] = BIT_MASK(tail);
248 int tail; local
256 tail = size & (BITS_PER_LONG - 1);
257 if (tail) {
258 mask = BIT_MASK(tail);
269 int tail; local
277 tail
[all...]

Completed in 274 milliseconds

1234567891011>>