/freebsd-9.3-release/contrib/ncurses/ncurses/ |
H A D | fifo_defs.h | 44 #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-9.3-release/usr.bin/tail/ |
H A D | Makefile | 4 PROG= tail 5 SRCS= forward.c misc.c read.c reverse.c tail.c
|
/freebsd-9.3-release/crypto/heimdal/tests/kdc/ |
H A D | wait-kdc.sh | 49 if tail -30 ${log} | grep "${name} started" > /dev/null; then 52 if tail -30 ${log} | grep "No sockets" ; then 56 if tail -30 ${log} | grep "bind" | grep "Operation not permitted" ; then
|
/freebsd-9.3-release/usr.bin/find/ |
H A D | operator.c | 80 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 D | find.c | 79 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-9.3-release/contrib/com_err/ |
H A D | compile_et.h | 63 struct error_code *next, **tail; member in struct:error_code 72 (L)->tail = &(V)->next; \ 75 *(L)->tail = (V); \ 76 (L)->tail = &(V)->next; \
|
/freebsd-9.3-release/crypto/heimdal/lib/com_err/ |
H A D | compile_et.h | 63 struct error_code *next, **tail; member in struct:error_code 72 (L)->tail = &(V)->next; \ 75 *(L)->tail = (V); \ 76 (L)->tail = &(V)->next; \
|
/freebsd-9.3-release/sys/dev/cxgb/sys/ |
H A D | mbufq.h | 37 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-9.3-release/sys/dev/xen/netfront/ |
H A D | mbufq.h | 37 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-9.3-release/tools/tools/track/ |
H A D | track.sh | 31 tail -10000 -F "$@" |
|
/freebsd-9.3-release/crypto/heimdal/lib/sl/ |
H A D | make_cmds.h | 60 struct command_list **tail; member in struct:command_list 66 struct string_list **tail; member in struct:string_list
|
/freebsd-9.3-release/contrib/bind9/lib/lwres/include/lwres/ |
H A D | list.h | 25 #define LWRES_LIST(type) struct { type *head, *tail; } 27 do { (list).head = NULL; (list).tail = NULL; } while (0) 39 #define LWRES_LIST_TAIL(list) ((list).tail) 47 (list).tail = (elt); \ 55 if ((list).tail != NULL) \ 56 (list).tail->link.next = (elt); \ 59 (elt)->link.prev = (list).tail; \ 61 (list).tail = (elt); \ 69 (list).tail = (elt)->link.prev; \ 110 (list1).tail [all...] |
/freebsd-9.3-release/contrib/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...] |
H A D | sched-ebb.c | 357 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-9.3-release/contrib/bind9/lib/isc/include/isc/ |
H A D | list.h | 31 #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...] |
H A D | queue.h | 21 * There are built-in mutex locks for the head and tail of the queue, 50 type *head, *tail; \ 58 (queue).tail = (queue).head = NULL; \ 88 * pop wins - return(NULL), push adds new as both head/tail 89 * push wins - updates head/tail, becomes 1 entry case. 91 * pop wins - return(pop) sets head/tail NULL, becomes 0 entry case 92 * push wins - updates {head,tail}->link.next, pop updates head 93 * with new ->link.next and doesn't update tail 105 if ((queue).tail == NULL && !headlocked) { \ 111 (elt)->link.prev = (queue).tail; \ [all...] |
/freebsd-9.3-release/contrib/ncurses/ncurses/base/ |
H A D | lib_ungetch.c | 53 T(("head = %d, tail = %d, peek = %d", head, tail, peek)); 64 if (tail != -1) { 68 peek = tail; /* no raw keys */
|
/freebsd-9.3-release/contrib/ntp/lib/isc/include/isc/ |
H A D | queue.h | 21 * 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 D | list.h | 31 #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-9.3-release/contrib/ncurses/man/ |
H A D | MKterminfo.sh | 34 # 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-9.3-release/lib/libc/include/isc/ |
H A D | list.h | 29 #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-9.3-release/contrib/gdb/gdb/gdbserver/ |
H A D | inferiors.c | 46 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-9.3-release/sys/dev/netmap/ |
H A D | netmap_mbq.c | 46 q->head = q->tail = NULL; 67 if (q->tail) { 68 q->tail->m_nextpkt = m; 69 q->tail = m; 71 q->head = q->tail = m; 99 q->tail = NULL;
|
/freebsd-9.3-release/sys/netgraph/bluetooth/include/ |
H A D | ng_bluetooth.h | 67 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-9.3-release/sys/pc98/cbus/ |
H A D | sctermvar.h | 37 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...] |