/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libobjc/objc/ |
H A D | objc-list.h | 36 struct objc_list *tail; member in struct:objc_list 39 /* Return a cons cell produced from (head . tail) */ 42 list_cons(void* head, struct objc_list* tail) argument 48 cell->tail = tail; 61 list = list->tail; 74 if(list->tail) 75 list = list->tail; 87 if ((*list)->tail) 89 struct objc_list* tail local [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libobjc/objc/ |
H A D | objc-list.h | 37 struct objc_list *tail; member in struct:objc_list 40 /* Return a cons cell produced from (head . tail) */ 43 list_cons(void* head, struct objc_list* tail) argument 49 cell->tail = tail; 62 list = list->tail; 75 if(list->tail) 76 list = list->tail; 88 if ((*list)->tail) 90 struct objc_list* tail local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.target/mips/ |
H A D | call-1.c | 5 /* { dg-final { scan-assembler "\\.reloc\t1f,R_MIPS_JALR,tail\n1:\tjr\t" } } */ 20 int tail (); 24 return tail ();
|
/netbsd-6-1-5-RELEASE/usr.bin/tail/ |
H A D | Makefile | 4 PROG= tail 5 SRCS= forward.c misc.c read.c reverse.c tail.c
|
/netbsd-6-1-5-RELEASE/dist/dhcp/includes/omapip/ |
H A D | buffer.h | 37 the tail never catches up to the head, there's room in the buffer for 40 - If the tail and the head are equal, the buffer is empty. 42 - If the tail is less than the head, the contents of the buffer 44 the bytes between the beginning of the buffer and the tail, not 45 including the byte addressed by the tail. 47 - If the tail is greater than the head, then the buffer contains 49 ending with the byte before the byte addressed by the tail. 51 There will always be at least one byte of waste, because the tail can't 58 u_int16_t head, tail; /* Buffers are organized in a ring. */ member in struct:_omapi_buffer 64 ((x) -> tail > ( [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/tests/kdc/ |
H A D | wait-kdc.sh | 47 if tail -30 ${log} | grep "${waitfor}" > /dev/null; then 50 if tail -30 ${log} | grep "No sockets" ; then 54 if tail -30 ${log} | grep "bind" | grep "Operation not permitted" ; then
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/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;
|
/netbsd-6-1-5-RELEASE/usr.bin/find/ |
H A D | 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 172 PLAN *tail; /* pointer to tail of result plan */ local 230 PLAN *tail; /* pointer to tail of result plan */ local [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/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; \
|
/netbsd-6-1-5-RELEASE/games/atc/ |
H A D | list.c | 68 l->head = l->tail = p; 90 l->tail->next = p; 92 p->prev = l->tail; 93 l->tail = p; 104 if (l->head == p && l->tail == p) 105 l->head = l->tail = NULL; 109 } else if (l->tail == p) { 110 l->tail = p->prev; 111 l->tail->next = NULL;
|
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/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 | 44 struct search_list_elem *tail; 43 struct search_list_elem *tail; member in struct:__anon3324
|
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...] |
/netbsd-6-1-5-RELEASE/external/ibm-public/postfix/dist/src/trivial-rewrite/ |
H A D | rewrite.c | 126 if (tree->head == tree->tail 127 && tree->tail->type == TOK822_QSTRING 128 && VSTRING_LEN(tree->tail->vstr) == 0) 134 if (tree->head == tree->tail 135 && tree->tail->type == '@') { 136 tok822_free_tree(tok822_sub_keep_before(tree, tree->tail)); 146 && colon != tree->tail) 152 if ((domain = tok822_rfind_type(tree->tail, '@')) == 0) { 171 && (domain = tok822_rfind_type(tree->tail, '%')) != 0) { 195 && (domain = tok822_rfind_type(tree->tail, ' [all...] |
/netbsd-6-1-5-RELEASE/lib/libc/locale/ |
H A D | generic_lc_all.c | 57 char head[_LOCALENAME_LEN_MAX * (_LC_LAST - 1)], *tail; local 67 tail = strchr(tokens[1], '/'); 68 if (tail == NULL) { 72 *tail++ = '\0'; 74 tokens[i] = (const char *)tail; 75 tail = strchr(tokens[i], '/'); 76 if (tail == NULL) 78 *tail++ = '\0'; 80 tokens[_LC_LAST - 1] = (const char *)tail; 81 tail [all...] |
/netbsd-6-1-5-RELEASE/external/ibm-public/postfix/dist/src/global/ |
H A D | tok822_find.c | 15 /* TOK822 *tok822_rfind_type(tail, type) 16 /* TOK822 *tail; 64 TOK822 *tok822_rfind_type(TOK822 *tail, int op) argument 68 for (tp = tail; tp != 0 && tp->type != op; tp = tp->prev)
|
/netbsd-6-1-5-RELEASE/sys/dev/pci/cxgb/ |
H A D | cxgb_mbuf.h | 37 struct mbuf *tail; member in struct:mbuf_head 45 l->head = l->tail = NULL; 65 l->tail->m_nextpkt = m; 66 l->tail = m; 76 if (m == l->tail) 77 l->tail = NULL;
|
/netbsd-6-1-5-RELEASE/dist/dhcp/includes/isc-dhcp/ |
H A D | list.h | 27 #define ISC_LIST(type) struct { type *head, *tail; } 29 do { (list).head = NULL; (list).tail = NULL; } while (0) 40 #define ISC_LIST_TAIL(list) ((list).tail) 48 (list).tail = (elt); \ 56 if ((list).tail != NULL) \ 57 (list).tail->link.next = (elt); \ 60 (elt)->link.prev = (list).tail; \ 62 (list).tail = (elt); \ 70 (list).tail = (elt)->link.prev; \ 111 (list1).tail [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/bind/dist/lib/lwres/include/lwres/ |
H A D | list.h | 27 #define LWRES_LIST(type) struct { type *head, *tail; } 29 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0) 41 #define LWRES_LIST_TAIL(list) ((list).tail) 49 (list).tail = (elt); \ 57 if ((list).tail != NULL) \ 58 (list).tail->link.next = (elt); \ 61 (elt)->link.prev = (list).tail; \ 63 (list).tail = (elt); \ 71 (list).tail = (elt)->link.prev; \ 112 (list1).tail [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | tree-iterator.c | 69 struct tree_statement_list_node *head, *tail, *cur; local 77 tail = STATEMENT_LIST_TAIL (t); 84 if (!head || !tail) 86 gcc_assert (head == tail); 96 tail = head; 111 tail->next = cur; 112 cur->prev = tail; 121 STATEMENT_LIST_TAIL (i->container) = tail; 133 i->ptr = tail; 145 struct tree_statement_list_node *head, *tail, *cu local [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
H A D | tree-iterator.c | 66 struct tree_statement_list_node *head, *tail, *cur; local 74 tail = STATEMENT_LIST_TAIL (t); 81 if (!head || !tail) 83 gcc_assert (head == tail); 93 tail = head; 108 tail->next = cur; 109 cur->prev = tail; 118 STATEMENT_LIST_TAIL (i->container) = tail; 130 i->ptr = tail; 142 struct tree_statement_list_node *head, *tail, *cu local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/gdb/ |
H A D | frame-base.c | 67 struct frame_base_table_entry **tail; member in struct:frame_base_table 77 table->tail = &table->head; 88 (*table->tail) 90 (*table->tail)->sniffer = sniffer; 91 table->tail = &(*table->tail)->next;
|
/netbsd-6-1-5-RELEASE/distrib/notes/common/ |
H A D | list-setsizes.sh | 56 set -- `gzip -l $port/binary/sets/${set}.tgz | tail -1`
|
/netbsd-6-1-5-RELEASE/external/bsd/bind/dist/lib/isc/include/isc/ |
H A D | list.h | 33 #define ISC_LIST(type) struct { type *head, *tail; } 35 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0) 48 #define ISC_LIST_TAIL(list) ((list).tail) 56 (list).tail = (elt); \ 73 if ((list).tail != NULL) \ 74 (list).tail->link.next = (elt); \ 77 (elt)->link.prev = (list).tail; \ 79 (list).tail = (elt); \ 96 ISC_INSIST((list).tail == (elt)); \ 97 (list).tail [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/template/ |
H A D | deduce2.C | 2 typedef tuple<int> tail; typedef in struct:tuple 10 static const int i = length<typename tuple<L>::tail>::i;
|