HomeSort by: relevance | last modified time | path
    Searched defs:prev (Results 1 - 25 of 1392) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/common/lib/libc/atomic/
atomic_c11_compare_exchange_cas_16.c 56 const uint16_t prev = atomic_cas_16(mem, old, desired); local
57 if (prev == old)
59 *ep = prev;
atomic_c11_compare_exchange_cas_32.c 56 const uint32_t prev = atomic_cas_32(mem, old, desired); local
57 if (prev == old)
59 *ep = prev;
atomic_c11_compare_exchange_cas_8.c 56 const uint8_t prev = atomic_cas_8(mem, old, desired); local
57 if (prev == old)
59 *ep = prev;
  /src/lib/libc/arch/ia64/gen/
fpsetround.c 36 fp_rnd prev; local
39 prev = (fp_rnd)((fpsr >> 10) & 3);
42 return (prev);
  /src/external/bsd/openldap/dist/libraries/libldap/
addentry.c 40 LDAPMessage *tmp, *prev = NULL; local
46 prev = tmp;
51 if ( prev == NULL ) {
56 prev->lm_chain = tmp->lm_chain;
57 if ( prev->lm_chain == NULL )
58 (*list)->lm_chain_tail = prev;
  /src/external/cddl/osnet/lib/libzpool/
atomic.c 10 uint64_t prev = *ptr; local
11 if (prev == old)
13 return prev;
  /src/external/gpl3/gcc/dist/libgcc/config/xtensa/
lib2funcs.S 103 prev = sp of frame N+1 define
106 to prev. At this point, cur will be the same as a2
116 addi a5, sp, -16 /* a5 = prev - save area */
124 mov a5, a6 /* advance prev */
130 /* At this point, prev (a5) points to the save area with the saved
  /src/external/gpl3/gcc.old/dist/libgcc/config/xtensa/
lib2funcs.S 97 prev = sp of frame N+1 define
100 to prev. At this point, cur will be the same as a2
110 addi a5, sp, -16 /* a5 = prev - save area */
118 mov a5, a6 /* advance prev */
124 /* At this point, prev (a5) points to the save area with the saved
  /src/external/mpl/bind/dist/lib/dns/rdata/generic/
talink_58.h 25 dns_name_t prev; member in struct:dns_rdata_talink
  /src/external/mpl/dhcp/bind/dist/lib/dns/rdata/generic/
talink_58.h 26 dns_name_t prev; member in struct:dns_rdata_talink
  /src/sys/ufs/chfs/
chfs_vnode_cache.c 81 struct chfs_vnode_cache** prev; local
89 prev = &chmp->chm_vnocache_hash[new->vno % VNODECACHE_SIZE];
91 while ((*prev) && (*prev)->vno < new->vno) {
92 prev = &((*prev)->next);
94 new->next = *prev;
95 *prev = new;
103 struct chfs_vnode_cache** prev; local
107 prev = &chmp->chm_vnocache_hash[old->vno % VNODECACHE_SIZE]
    [all...]
  /src/crypto/external/apache2/openssl/dist/test/
context_internal_test.c 19 OSSL_LIB_CTX *prev; local
28 if (!TEST_ptr(prev = OSSL_LIB_CTX_set0_default(local))
29 || !TEST_ptr_eq(global, prev))
41 if (!TEST_ptr(prev = OSSL_LIB_CTX_set0_default(global))
42 || !TEST_ptr_eq(local, prev))
  /src/crypto/external/bsd/openssl.old/dist/test/
pkey_meth_test.c 22 int prev = -1; local
30 if (pkey_id < prev)
32 prev = pkey_id;
54 int prev = -1; local
62 if (pkey_id < prev)
64 prev = pkey_id;
  /src/external/bsd/unbound/dist/services/
outbound_list.h 64 /** prev in list */
65 struct outbound_entry* prev; member in struct:outbound_entry
  /src/external/bsd/wpa/dist/wpa_supplicant/
bssid_ignore.c 119 struct wpa_bssid_ignore *e, *prev = NULL; local
127 if (prev == NULL) {
130 prev->next = e->next;
137 prev = e;
171 struct wpa_bssid_ignore *e, *prev; local
176 prev = e;
179 " from ignore list (clear)", MAC2STR(prev->bssid));
180 os_free(prev);
192 struct wpa_bssid_ignore *e, *prev = NULL; local
205 if (prev) {
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
stl_iterator_base_funcs.h 244 prev(_BidirectionalIterator __x, typename function
  /src/external/gpl3/gcc/dist/libstdc++-v3/libsupc++/
eh_catch.cc 45 __cxa_exception *prev = globals->caughtExceptions; variable
55 if (prev != 0)
76 if (header != prev)
78 header->nextException = prev;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
stl_iterator_base_funcs.h 242 prev(_BidirectionalIterator __x, typename function
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/libsupc++/
eh_catch.cc 45 __cxa_exception *prev = globals->caughtExceptions; variable
55 if (prev != 0)
76 if (header != prev)
78 header->nextException = prev;
  /src/external/gpl3/gdb/dist/gdbsupport/
intrusive_list.h 37 T *prev = INTRUSIVE_LIST_UNLINKED_VALUE; member in class:intrusive_list_node
152 m_elem = node->prev;
160 m_elem = node->prev;
184 m_elem = node->prev;
192 m_elem = node->prev;
316 gdb_assert (elem_node->prev == INTRUSIVE_LIST_UNLINKED_VALUE);
329 gdb_assert (elem_node->prev == INTRUSIVE_LIST_UNLINKED_VALUE);
354 pointer prev_elem = pos_node->prev;
358 gdb_assert (elem_node->prev == INTRUSIVE_LIST_UNLINKED_VALUE);
360 elem_node->prev = prev_elem
    [all...]
  /src/external/gpl3/gdb/dist/gnulib/import/
fd-hook.c 101 struct fd_hook *prev = link->private_prev; local
103 if (next != NULL && prev != NULL)
106 prev->private_next = next;
107 next->private_prev = prev;
  /src/external/gpl3/gdb.old/dist/gnulib/import/
fd-hook.c 101 struct fd_hook *prev = link->private_prev; local
103 if (next != NULL && prev != NULL)
106 prev->private_next = next;
107 next->private_prev = prev;
  /src/bin/ksh/
alloc.c 37 struct link *prev; member in struct:link
73 l->prev = NULL;
75 ap->freelist->prev = l;
92 lprev = l->prev;
103 lnext->prev = l2;
119 if (l->prev)
120 l->prev->next = l->next;
124 l->next->prev = l->prev;
  /src/games/boggle/mkdict/
mkdict.c 67 int current, len, prev, qcount; local
70 prev = 0;
72 buf[prev][0] = '\0';
107 q = buf[prev];
114 prev = !prev;
  /src/sys/arch/atari/atari/
stalloc.c 153 struct mem_node *mn, *next, *prev; local
162 prev = TAILQ_PREV(mn, stlist, link);
178 if (prev != NULL && prev->type == MNODE_FREE) {
180 * if prev is: a valid node and a free node. ==> merge
191 prev->size += mn->size + sizeof(*mn);
197 while (next != NULL && prev != NULL) {
203 if (prev->type == MNODE_FREE) {
204 TAILQ_INSERT_AFTER(&free_list, prev, mn,
209 prev = TAILQ_PREV(prev, stlist, link)
    [all...]

Completed in 94 milliseconds

1 2 3 4 5 6 7 8 91011>>