| /src/lib/libc/arch/ia64/gen/ |
| fpsetround.c | 36 fp_rnd prev; local in function:fpsetround
39 prev = (fp_rnd)((fpsr >> 10) & 3);
42 return (prev);
|
| fpsetround.c | 36 fp_rnd prev; local in function:fpsetround
39 prev = (fp_rnd)((fpsr >> 10) & 3);
42 return (prev);
|
| /src/common/lib/libc/atomic/ |
| atomic_c11_compare_exchange_cas_16.c | 56 const uint16_t prev = atomic_cas_16(mem, old, desired); local in function:__atomic_compare_exchange_2
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 in function:__atomic_compare_exchange_4
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 in function:__atomic_compare_exchange_1
57 if (prev == old)
59 *ep = prev;
|
| atomic_c11_compare_exchange_cas_16.c | 56 const uint16_t prev = atomic_cas_16(mem, old, desired); local in function:__atomic_compare_exchange_2
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 in function:__atomic_compare_exchange_4
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 in function:__atomic_compare_exchange_1
57 if (prev == old)
59 *ep = prev;
|
| /src/sys/ufs/chfs/ |
| chfs_vnode_cache.c | 81 struct chfs_vnode_cache** prev; local in function:chfs_vnode_cache_add
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 in function:chfs_vnode_cache_remove
107 prev = &chmp->chm_vnocache_hash[old->vno % VNODECACHE_SIZE]
[all...] |
| chfs_vnode_cache.c | 81 struct chfs_vnode_cache** prev; local in function:chfs_vnode_cache_add
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 in function:chfs_vnode_cache_remove
107 prev = &chmp->chm_vnocache_hash[old->vno % VNODECACHE_SIZE]
[all...] |
| /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;
|
| 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 in function:main
70 prev = 0;
72 buf[prev][0] = '\0';
107 q = buf[prev];
114 prev = !prev;
|
| mkdict.c | 67 int current, len, prev, qcount; local in function:main
70 prev = 0;
72 buf[prev][0] = '\0';
107 q = buf[prev];
114 prev = !prev;
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_atomic_clang.h | 80 Type prev; local in function:__sanitizer::atomic_compare_exchange_strong
81 prev = __sync_val_compare_and_swap(&a->val_dont_use, cmpv, xchg);
82 if (prev == cmpv) return true;
83 *cmp = prev;
|
| sanitizer_atomic_msvc.h | 186 u8 prev = (u8)_InterlockedCompareExchange8( local in function:__sanitizer::atomic_compare_exchange_strong
189 u8 prev; local in function:__sanitizer::atomic_compare_exchange_strong
195 mov prev, al
198 if (prev == cmpv)
200 *cmp = prev;
209 uptr prev = (uptr)_InterlockedCompareExchangePointer( local in function:__sanitizer::atomic_compare_exchange_strong
211 if (prev == cmpv)
213 *cmp = prev;
222 u16 prev = (u16)_InterlockedCompareExchange16( local in function:__sanitizer::atomic_compare_exchange_strong
224 if (prev == cmpv
235 u32 prev = (u32)_InterlockedCompareExchange( local in function:__sanitizer::atomic_compare_exchange_strong
248 u64 prev = (u64)_InterlockedCompareExchange64( local in function:__sanitizer::atomic_compare_exchange_strong
[all...] |
| sanitizer_atomic_clang.h | 80 Type prev; local in function:__sanitizer::atomic_compare_exchange_strong
81 prev = __sync_val_compare_and_swap(&a->val_dont_use, cmpv, xchg);
82 if (prev == cmpv) return true;
83 *cmp = prev;
|
| sanitizer_atomic_msvc.h | 186 u8 prev = (u8)_InterlockedCompareExchange8( local in function:__sanitizer::atomic_compare_exchange_strong
189 u8 prev; local in function:__sanitizer::atomic_compare_exchange_strong
195 mov prev, al
198 if (prev == cmpv)
200 *cmp = prev;
209 uptr prev = (uptr)_InterlockedCompareExchangePointer( local in function:__sanitizer::atomic_compare_exchange_strong
211 if (prev == cmpv)
213 *cmp = prev;
222 u16 prev = (u16)_InterlockedCompareExchange16( local in function:__sanitizer::atomic_compare_exchange_strong
224 if (prev == cmpv
235 u32 prev = (u32)_InterlockedCompareExchange( local in function:__sanitizer::atomic_compare_exchange_strong
248 u64 prev = (u64)_InterlockedCompareExchange64( local in function:__sanitizer::atomic_compare_exchange_strong
[all...] |
| /src/sys/external/bsd/drm/dist/bsd-core/ |
| drm_auth.c | 101 drm_magic_entry_t *prev = NULL; local in function:drm_remove_magic
110 for (pt = dev->magiclist[hash].head; pt; prev = pt, pt = pt->next) {
116 dev->magiclist[hash].tail = prev;
118 if (prev) {
119 prev->next = pt->next;
|
| drm_linux_list.h | 36 struct list_head *next, *prev; member in struct:list_head
45 (head)->prev = head;
55 (head)->next->prev = new;
57 (new)->prev = head;
63 (entry)->prev = (head)->prev;
65 (head)->prev->next = entry;
66 (head)->prev = entry;
71 (entry)->next->prev = (entry)->prev;
[all...] |
| drm_auth.c | 101 drm_magic_entry_t *prev = NULL; local in function:drm_remove_magic
110 for (pt = dev->magiclist[hash].head; pt; prev = pt, pt = pt->next) {
116 dev->magiclist[hash].tail = prev;
118 if (prev) {
119 prev->next = pt->next;
|
| drm_linux_list.h | 36 struct list_head *next, *prev; member in struct:list_head
45 (head)->prev = head;
55 (head)->next->prev = new;
57 (new)->prev = head;
63 (entry)->prev = (head)->prev;
65 (head)->prev->next = entry;
66 (head)->prev = entry;
71 (entry)->next->prev = (entry)->prev;
[all...] |
| /src/sys/external/bsd/drm2/linux/ |
| linux_list_sort.c | 151 * nodes in `a' first, and setting the `prev' pointers as we go.
158 struct list_head *prev = list; local in function:list_sort_merge_into
167 (*first)->prev = prev;
168 prev = prev->next = *first;
173 * Attach whichever of a and b remains, and fix up the prev
178 prev->next = tail;
179 tail->prev = prev;
[all...] |
| /src/usr.bin/systat/ |
| globalcmds.c | 82 char *name, *prev; local in function:global_help
85 name = prev = NULL;
89 if (name && prev && strcmp(name, prev) == 0) {
101 if (prev)
102 free(prev);
103 prev = name;
117 if (prev)
118 free(prev);
|
| /src/sys/arch/atari/atari/ |
| stalloc.c | 153 struct mem_node *mn, *next, *prev; local in function:free_stmem
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...] |
