| /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/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/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...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_atomic_clang.h | 80 Type prev; local
81 prev = __sync_val_compare_and_swap(&a->val_dont_use, cmpv, xchg);
82 if (prev == cmpv) return true;
83 *cmp = prev;
|
| sanitizer_atomic_clang_mips.h | 76 Type prev; local
80 prev = *(const_cast<Type volatile *>(&ptr->val_dont_use));
81 if (prev == cmpv) {
|
| sanitizer_atomic_msvc.h | 186 u8 prev = (u8)_InterlockedCompareExchange8( local
189 u8 prev; local
195 mov prev, al local
198 if (prev == cmpv)
200 *cmp = prev;
209 uptr prev = (uptr)_InterlockedCompareExchangePointer( local
211 if (prev == cmpv)
213 *cmp = prev;
222 u16 prev = (u16)_InterlockedCompareExchange16( local
224 if (prev == cmpv
235 u32 prev = (u32)_InterlockedCompareExchange( local
248 u64 prev = (u64)_InterlockedCompareExchange64( local
[all...] |
| /src/sys/external/bsd/drm/dist/bsd-core/ |
| drm_auth.c | 101 drm_magic_entry_t *prev = NULL; local
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
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
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/games/boggle/mkindex/ |
| mkindex.c | 57 int clen, rlen, prev, i; local
61 prev = '\0';
64 if (*buf != prev) {
68 * So we write out entries for every letter from prev
71 if (prev != '\0')
72 printf("%c %6ld %6ld\n", prev, start, off - 1);
73 for (i = (prev ? prev + 1 : 'a'); i < *buf; i++)
75 prev = *buf;
80 printf("%c %6ld %6ld\n", prev, start, off - 1)
[all...] |
| /src/games/primes/ |
| primes.c | 217 uint64_t prev = 0; local
254 printf(" (%" PRIu64 ")", factor - prev);
258 prev = factor;
325 if (dflag && (prev || (start <= *pr_limit))) {
326 printf(" (%" PRIu64 ")", start - prev);
329 prev = start;
|
| /src/sys/arch/arm/ti/ |
| am3_platform.c | 117 uint32_t cur, prev; local
123 prev = bus_space_read_4(bst, bsh, 0x3c);
126 if (cur >= prev)
127 ticks -= (cur - prev);
129 ticks -= (UINT32_MAX - cur + prev);
130 prev = cur;
|
| /src/sys/external/bsd/drm2/dist/drm/ |
| drm_lock.c | 67 unsigned int old, new, prev; local
80 prev = cmpxchg(lock, old, new);
81 } while (prev != old);
116 unsigned int old, new, prev; local
123 prev = cmpxchg(lock, old, new);
124 } while (prev != old);
131 unsigned int old, new, prev; local
146 prev = cmpxchg(lock, old, new);
147 } while (prev != old);
317 unsigned int old, prev; local
[all...] |
| /src/tests/usr.bin/indent/ |
| opt_bc.c | 141 const struct paren_level *prev = state.prev_ps.paren.item, variable in typeref:struct:paren_level
149 const struct paren_level *prev = state.prev_ps.paren.item, *curr = ps.paren.item; variable in typeref:struct:paren_level
|
| /src/usr.bin/make/ |
| lst.h | 91 ListNode *prev; /* previous node in list, or NULL */ member in struct:ListNode
|
| /src/usr.bin/tail/ |
| reverse.c | 151 struct bf *prev; member in struct:bf
201 tl->prev = mark->prev;
202 mark->prev->next = tl;
203 mark->prev = tl;
206 mark->next = mark->prev = mark;
222 tl = tl->prev;
257 if ((tl = tl->prev) == mark)
|
| /src/usr.sbin/mrouted/ |
| callout.c | 93 struct timeout_q *ptr, *node, *prev; local
113 prev = ptr = Q;
131 prev->next = node;
140 prev = ptr;
144 prev->next = node;
156 struct timeout_q *ptr, *prev; local
165 prev = ptr = Q;
181 prev->next = ptr->next;
193 prev = ptr;
|
| /src/distrib/utils/more/ |
| linenum.c | 80 struct linenum *prev; /* Line to previous in the list */ member in struct:linenum
82 off_t gap; /* Gap between prev and next */
129 anchor.next = anchor.prev = &anchor;
150 p->gap = p->next->pos - p->prev->pos;
178 prevp = p->prev;
203 new->prev = prevp;
207 nextp->prev = new;
237 spare->next->prev = spare->prev;
238 spare->prev->next = spare->next
[all...] |
| /src/lib/librefuse/ |
| refuse_signals.c | 285 struct refuse_obj_elem* prev; local
299 for (prev = NULL, elem = fuse_head;
301 prev = elem, elem = elem->next) {
304 if (prev)
305 prev->next = elem->next;
|
