| /src/lib/libform/ |
| gdbinit | 8 if ($lstruct->prev != 0x0)
9 if ($lstruct->prev->next != $lstruct)
14 if ($lstruct->next->prev != $lstruct)
|
| /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...] |
| /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);
|
| /src/games/boggle/mkindex/ |
| mkindex.c | 57 int clen, rlen, prev, i; local in function:main
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/warp/ |
| object.c | 35 obj->next->prev = &free_root;
40 obj->prev = where->prev;
41 where->prev = obj;
42 obj->prev->next = obj;
61 curobj->prev->next = curobj->next;
62 curobj->next->prev = curobj->prev;
73 curobj->prev = &free_root;
74 free_root.next->prev = curobj
[all...] |
| /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;
|
| /src/sys/external/bsd/drm/dist/bsd-core/ |
| 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/games/atc/ |
| list.c | 72 p->next = p->prev = NULL;
84 p->prev = r;
87 q->prev = p;
90 p->prev = NULL;
91 q->prev = p;
97 p->prev = l->tail;
113 l->head->prev = NULL;
115 l->tail = p->prev;
118 p->prev->next = p->next;
119 p->next->prev = p->prev
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvif/ |
| list.h | 113 struct list_head *next, *prev; member in struct:list_head
132 list->next = list->prev = list;
137 struct list_head *prev, struct list_head *next)
139 next->prev = entry;
141 entry->prev = prev;
142 prev->next = entry;
184 __list_add(entry, head->prev, head);
188 __list_del(struct list_head *prev, struct list_head *next)
190 next->prev = prev
[all...] |
| /src/lib/libc/include/isc/ |
| list.h | 28 #define LINK(type) struct { type *prev, *next; }
31 (elt)->link.prev = (type *)(-1); \
36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
47 (list).head->link.prev = (elt); \
50 (elt)->link.prev = NULL; \
62 (elt)->link.prev = (list).tail; \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
74 (list).tail = (elt)->link.prev; \
76 if ((elt)->link.prev != NULL)
[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...] |
| linux_dma_fence_chain.c | 44 * dma_fence_chain_init(chain, prev, fence, seqno)
46 * Initialize a fence chain node. If prev was already a chain,
50 dma_fence_chain_init(struct dma_fence_chain *chain, struct dma_fence *prev,
53 struct dma_fence_chain *prev_chain = to_dma_fence_chain(prev);
57 chain->dfc_prev = prev; /* consume caller's reference */
62 !__dma_fence_is_later(seqno, prev->seqno, prev->ops)) {
65 seqno = MAX(prev->seqno, seqno);
68 context = prev->context;
69 chain->prev_seqno = prev->seqno
160 struct dma_fence *prev; local in function:dma_fence_chain_release
228 struct dma_fence *prev; local in function:get_prev
248 struct dma_fence *prev, *splice; local in function:dma_fence_chain_walk
[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/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/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;
|
| /src/sys/external/bsd/common/include/linux/ |
| list.h | 56 #define LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) }
63 head->prev = head;
76 return head->prev;
88 return node->prev;
103 if (head->next != head->prev)
111 return head == entry->prev;
121 __list_add_between(struct list_head *prev, struct list_head *node,
124 prev->next = node;
125 node->prev = prev;
[all...] |
| /src/sys/altq/ |
| altq_classq.h | 128 struct mbuf *m, *m0, *prev; local in function:_getq_tail
133 prev = m0;
136 prev->m_nextpkt = m->m_nextpkt;
137 if (prev == m)
140 qtail(q) = prev;
158 struct mbuf *prev = NULL; local in function:_getq_random
162 prev = m;
165 prev->m_nextpkt = m->m_nextpkt;
167 qtail(q) = prev;
177 struct mbuf *m0, *prev; local in function:_removeq
[all...] |
| /src/usr.sbin/mrouted/ |
| callout.c | 93 struct timeout_q *ptr, *node, *prev; local in function:timer_setTimer
113 prev = ptr = Q;
131 prev->next = node;
140 prev = ptr;
144 prev->next = node;
156 struct timeout_q *ptr, *prev; local in function:timer_clearTimer
165 prev = ptr = Q;
181 prev->next = ptr->next;
193 prev = ptr;
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/core/ |
| nouveau_nvkm_core_mm.c | 58 struct nvkm_mm_node *prev = node(this, prev); local in function:nvkm_mm_free
61 if (prev && prev->type == NVKM_MM_TYPE_NONE) {
62 prev->length += this->length;
64 kfree(this); this = prev;
77 list_for_each_entry(prev, &mm->free, fl_entry) {
78 if (this->offset < prev->offset)
82 list_add_tail(&this->fl_entry, &prev->fl_entry);
119 struct nvkm_mm_node *prev, *this, *next local in function:nvkm_mm_head
194 struct nvkm_mm_node *prev, *this, *next; local in function:nvkm_mm_tail
247 struct nvkm_mm_node *node, *prev; local in function:nvkm_mm_init
[all...] |
| /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/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_mutex.h | 117 u32 prev = atomic_fetch_sub(&state_, kWriteLock, memory_order_release); local in function:__sanitizer::RWMutex::Unlock
118 DCHECK_NE(prev & kWriteLock, 0);
119 (void)prev;
123 u32 prev = atomic_fetch_add(&state_, kReadLock, memory_order_acquire); local in function:__sanitizer::RWMutex::ReadLock
124 if ((prev & kWriteLock) == 0)
130 u32 prev = atomic_fetch_sub(&state_, kReadLock, memory_order_release); local in function:__sanitizer::RWMutex::ReadUnlock
131 DCHECK_EQ(prev & kWriteLock, 0);
132 DCHECK_GT(prev & ~kWriteLock, 0);
133 (void)prev;
169 u32 prev = atomic_load(&state_, memory_order_acquire) local in function:__sanitizer::RWMutex::ReadLockSlow
[all...] |
| 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/usr.bin/gzip/ |
| zmore | 59 prev="$1"
63 echo -n "$prev (END) - Next: $1 "
|
