/macosx-10.9.5/bzip2-29/bzip2/ |
H A D | format.pl | 43 my ($prev, $curr, $str); 44 $prev = ''; $curr = ''; 47 print OUTFILE $prev; 48 $prev = $curr; 52 if ( $prev =~ /<programlisting>$|<screen>$/ ) { 53 chomp $prev; 54 $curr = join( '', $prev, "<![CDATA[", $curr ); 55 $prev = ''; 59 chomp $prev; 60 $curr = join( '', $prev, "]]>", [all...] |
/macosx-10.9.5/Libc-997.90.3/stdlib/FreeBSD/ |
H A D | remque.c | 19 struct que_elem *prev, *next, *elem; local 23 prev = elem->prev; 26 if (prev != NULL) 27 prev->next = next; 29 next->prev = prev;
|
H A D | insque.c | 23 struct que_elem *prev, *next, *elem; local 26 prev = (struct que_elem *)pred; 28 if (prev == NULL) { 29 elem->prev = elem->next = NULL; 33 next = prev->next; 36 if (next->prev != prev) { 38 " next(%p)->prev(%p) != prev(%p)\n", 39 next, next->prev, pre [all...] |
/macosx-10.9.5/emacs-92/emacs/oldXMenu/ |
H A D | insque.c | 34 emacs_insque (elem, prev) 35 struct qelem *elem, *prev; 37 struct qelem *next = prev->q_forw; 38 prev->q_forw = elem; 42 elem->q_back = prev; 51 struct qelem *prev = elem->q_back; local 53 next->q_back = prev; 54 if (prev) 55 prev->q_forw = next;
|
/macosx-10.9.5/bind9-45.100/bind9/lib/isc/sparc64/include/isc/ |
H A D | atomic.h | 70 isc_int32_t prev, swapped; local 72 for (prev = *(volatile isc_int32_t *)p; ; prev = swapped) { 73 swapped = prev + val; 77 : "r"(p), "n"(ASI_P), "r"(prev)); 78 if (swapped == prev) 82 return (prev); 90 isc_int32_t prev, swapped; local 92 for (prev = *(volatile isc_int32_t *)p; ; prev [all...] |
/macosx-10.9.5/ntp-88/lib/isc/sparc64/include/isc/ |
H A D | atomic.h | 70 isc_int32_t prev, swapped; local 72 for (prev = *(volatile isc_int32_t *)p; ; prev = swapped) { 73 swapped = prev + val; 77 : "r"(p), "n"(ASI_P), "r"(prev)); 78 if (swapped == prev) 82 return (prev); 90 isc_int32_t prev, swapped; local 92 for (prev = *(volatile isc_int32_t *)p; ; prev [all...] |
/macosx-10.9.5/apache-786.1/httpd/srclib/apr/atomic/unix/ |
H A D | ppc.c | 44 apr_uint32_t prev, temp; local 48 " add %1,%0,%4\n" /* add val and prev */ 52 : "=&r" (prev), "=&r" (temp), "=m" (*mem) 56 return prev; 76 apr_uint32_t prev; local 85 : "=&b" (prev), "=m" (*mem) 89 return prev; 94 apr_uint32_t prev; local 102 : "=&b" (prev), "=m" (*mem) 106 return prev; 112 apr_uint32_t prev; local 131 apr_uint32_t prev; local 147 void *prev; local 180 void *prev; local [all...] |
H A D | ia32.c | 60 unsigned char prev; local 63 : "=m" (*mem), "=qm" (prev) 67 return prev; 73 apr_uint32_t prev; local 76 : "=a" (prev) 79 return prev; 84 apr_uint32_t prev = val; local 87 : "=r" (prev), "+m" (*mem) 88 : "0" (prev)); 89 return prev; 94 void *prev; local 112 void *prev; local [all...] |
H A D | s390.c | 38 apr_uint32_t prev = *mem, temp; local 45 : "+d" (prev), "+d" (temp), "=Q" (*mem) 49 return prev; 64 apr_uint32_t prev = *mem, temp; local 71 : "+d" (prev), "+d" (temp), "=Q" (*mem) 101 apr_uint32_t prev = *mem; local 106 : "+d" (prev), "=Q" (*mem) 110 return prev; 115 void *prev = (void *) cmp; local 118 : "+d" (prev), " 134 void *prev = (void *) *mem; local [all...] |
/macosx-10.9.5/apr-30/apr/apr/atomic/unix/ |
H A D | ppc.c | 44 apr_uint32_t prev, temp; local 48 " add %1,%0,%4\n" /* add val and prev */ 52 : "=&r" (prev), "=&r" (temp), "=m" (*mem) 56 return prev; 76 apr_uint32_t prev; local 85 : "=&b" (prev), "=m" (*mem) 89 return prev; 94 apr_uint32_t prev; local 102 : "=&b" (prev), "=m" (*mem) 106 return prev; 112 apr_uint32_t prev; local 131 apr_uint32_t prev; local 147 void *prev; local 180 void *prev; local [all...] |
H A D | ia32.c | 60 unsigned char prev; local 63 : "=m" (*mem), "=qm" (prev) 67 return prev; 73 apr_uint32_t prev; local 76 : "=a" (prev) 79 return prev; 84 apr_uint32_t prev = val; local 87 : "=r" (prev), "+m" (*mem) 88 : "0" (prev)); 89 return prev; 94 void *prev; local 112 void *prev; local [all...] |
H A D | s390.c | 38 apr_uint32_t prev = *mem, temp; local 45 : "+d" (prev), "+d" (temp), "=Q" (*mem) 49 return prev; 64 apr_uint32_t prev = *mem, temp; local 71 : "+d" (prev), "+d" (temp), "=Q" (*mem) 101 apr_uint32_t prev = *mem; local 106 : "+d" (prev), "=Q" (*mem) 110 return prev; 115 void *prev = (void *) cmp; local 118 : "+d" (prev), " 134 void *prev = (void *) *mem; local [all...] |
/macosx-10.9.5/xnu-2422.115.4/osfmk/kern/ |
H A D | queue.c | 76 elt->prev = que; 77 elt->next->prev = elt; 90 elt->prev = que->prev; 91 elt->prev->next = elt; 92 que->prev = elt; 108 elt->next->prev = que; 122 if (que->prev == que) 125 elt = que->prev; 126 elt->prev [all...] |
H A D | queue.h | 98 struct queue_entry *prev; /* previous element */ member in struct:queue_entry 158 (elt)->prev = (queue_entry_t) 0; \ 170 elt->prev = que; 171 elt->next->prev = elt; 181 elt->prev = que->prev; 182 elt->prev->next = elt; 183 que->prev = elt; 194 elt->next->prev = que; 208 if (que->prev ! [all...] |
/macosx-10.9.5/ruby-104/ruby/test/rexml/ |
H A D | test_xpath_msw.rb | 25 prev = XPath.first(context, "preceding-sibling::f") 26 assert_equal "5", prev.attributes["id"] 28 prev = XPath.first(context, "preceding-sibling::f[1]") 29 assert_equal "5", prev.attributes["id"] 31 prev = XPath.first(context, "preceding-sibling::f[2]") 32 assert_equal "4", prev.attributes["id"] 34 prev = XPath.first(context, "preceding-sibling::f[3]") 35 assert_equal "3", prev.attributes["id"]
|
/macosx-10.9.5/bind9-45.100/bind9/lib/isc/ia64/include/isc/ |
H A D | atomic.h | 39 isc_int32_t prev, swapped; local 41 for (prev = *(volatile isc_int32_t *)p; ; prev = swapped) { 42 swapped = prev + val; 47 : "r" (prev), "r" (swapped), "m" (*p) 49 if (swapped == prev) 53 return (prev);
|
/macosx-10.9.5/ntp-88/lib/isc/ia64/include/isc/ |
H A D | atomic.h | 39 isc_int32_t prev, swapped; local 41 for (prev = *(volatile isc_int32_t *)p; ; prev = swapped) { 42 swapped = prev + val; 47 : "r" (prev), "r" (swapped), "m" (*p) 49 if (swapped == prev) 53 return (prev);
|
/macosx-10.9.5/sudo-72/src/ |
H A D | list.c | 35 struct list_proto *prev; member in struct:list_proto 61 h->last = h->last->prev; 82 if (l->prev == NULL) { 88 h->last = l->prev; /* l->prev points to the last member of l */ 89 l->prev = NULL; /* zero last ptr now that we have a head */ 98 * circular properties of the prev pointer to simplify the logic. 107 void *tail = l2->prev; 109 l1->prev->next = l2; 110 l2->prev [all...] |
/macosx-10.9.5/postfix-252/postfix/src/global/ |
H A D | tok822_tree.c | 132 t2->prev = t1; 140 next->prev = t2; 148 TOK822 *prev = t1->prev; local 150 if (prev) 151 prev->next = t2; 152 t2->prev = prev; 159 t1->prev = t2; 167 TOK822 *prev local 193 TOK822 *prev = tp->prev; local [all...] |
/macosx-10.9.5/BerkeleyDB-21/db/docs_src/images/ |
H A D | Makefile | 3 COPY= api.gif next.gif prev.gif ps.gif ref.gif
|
/macosx-10.9.5/bind9-45.100/bind9/lib/lwres/include/lwres/ |
H A D | list.h | 29 #define LWRES_LINK(type) struct { type *prev, *next; } 32 (elt)->link.prev = (void *)(-1); \ 36 ((void *)((elt)->link.prev) != (void *)(-1)) 45 (list).head->link.prev = (elt); \ 48 (elt)->link.prev = NULL; \ 59 (elt)->link.prev = (list).tail; \ 67 (elt)->link.next->link.prev = (elt)->link.prev; \ 69 (list).tail = (elt)->link.prev; \ 70 if ((elt)->link.prev ! [all...] |
/macosx-10.9.5/bind9-45.100/bind9/lib/isc/x86_32/include/isc/ |
H A D | atomic.h | 32 isc_int32_t prev = val; local 39 :"=q"(prev) 40 :"m"(*p), "0"(prev) 43 return (prev); 49 isc_int64_t prev = val; local 56 :"=q"(prev) 57 :"m"(*p), "0"(prev) 60 return (prev);
|
/macosx-10.9.5/ntp-88/lib/isc/x86_32/include/isc/ |
H A D | atomic.h | 32 isc_int32_t prev = val; local 39 :"=q"(prev) 40 :"m"(*p), "0"(prev) 43 return (prev); 49 isc_int64_t prev = val; local 56 :"=q"(prev) 57 :"m"(*p), "0"(prev) 60 return (prev);
|
/macosx-10.9.5/bash-92/bash-3.2/ |
H A D | list.c | 67 register GENERIC_LIST *next, *prev; local 69 for (prev = (GENERIC_LIST *)NULL; list; ) 72 list->next = prev; 73 prev = list; 76 return (prev); 122 register GENERIC_LIST *prev, *temp; local 124 for (prev = (GENERIC_LIST *)NULL, temp = *list; temp; prev = temp, temp = temp->next) 128 if (prev) 129 prev [all...] |
/macosx-10.9.5/curl-78.94.1/curl/lib/ |
H A D | llist.c | 79 list->head->prev = NULL; 86 ne->prev = e; 88 list->head->prev = ne; 92 e->next->prev = ne; 122 e->next->prev = NULL; 125 e->prev->next = e->next; 127 list->tail = e->prev; 129 e->next->prev = e->prev; 135 e->prev [all...] |