Searched refs:next (Results 51 - 75 of 3058) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/apr-util/misc/
H A Dapr_rmm.c38 * the caller-usable region represented by the block. The next and
41 * address of the next and previous blocks in the list. ("address 0",
55 apr_rmm_off_t next; member in struct:rmm_block_t
76 static apr_rmm_off_t find_block_by_offset(apr_rmm_t *rmm, apr_rmm_off_t next, argument
81 while (next) {
82 struct rmm_block_t *blk = (rmm_block_t*)((char*)rmm->base + next);
84 if (find == next)
85 return next;
88 if (find < next)
91 prev = next;
99 apr_rmm_off_t next = rmm->base->firstfree; local
161 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next); local
197 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next); local
420 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next); local
[all...]
/freebsd-11-stable/sys/libkern/x86/
H A Dcrc32_sse42.c153 * bits), in even -- next square puts operator for two zero bytes in
226 const unsigned char *next, *end; local
233 next = buf;
237 while (len && ((uintptr_t)next & (align - 1)) != 0) {
238 crc0 = _mm_crc32_u8(crc0, *next);
239 next++;
255 end = next + LONG;
258 crc0 = _mm_crc32_u64(crc0, *(const uint64_t *)next);
260 *(const uint64_t *)(next + LONG));
262 *(const uint64_t *)(next
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A DVersionTuple.cpp43 char next = input[0]; local
45 if (next < '0' || next > '9')
47 value = (unsigned)(next - '0');
50 next = input[0];
51 if (next < '0' || next > '9')
54 value = value * 10 + (unsigned)(next - '0');
/freebsd-11-stable/gnu/usr.bin/rcs/lib/
H A Drcsrev.c372 store1(store, next)
374 struct hshentry *next;
383 p->first = next;
399 register struct hshentry * next; local
407 if (!(next = Head)) {
416 while ((result=cmpnumfld(revno,next->num,1)) < 0) {
417 store1(&store, next);
418 next = next->next;
532 register struct hshentry * next, * trail; local
656 register struct assoc const *next; local
[all...]
/freebsd-11-stable/crypto/heimdal/lib/hx509/
H A Denv.c68 n->next = NULL;
84 while (e->next)
85 e = e->next;
86 e->next = n;
119 n->next = NULL;
130 while (e->next)
131 e = e->next;
132 e->next = n;
161 env = env->next;
184 env = env->next;
218 hx509_env next = b->next; local
[all...]
/freebsd-11-stable/sys/dev/drm/
H A Di915_mem.c16 * next paragraph) shall be included in all copies or substantial portions
78 list[(unsigned)list[i].next].prev = list[i].prev;
79 list[(unsigned)list[i].prev].next = list[i].next;
84 list[i].next = list[nr].next;
85 list[(unsigned)list[nr].next].prev = i;
86 list[nr].next = i;
106 newblock->next = p->next;
[all...]
H A Dradeon_mem.c16 * The above copyright notice and this permission notice (including the next
56 newblock->next = p->next;
58 p->next->prev = newblock;
59 p->next = newblock;
73 newblock->next = p->next;
75 p->next->prev = newblock;
76 p->next = newblock;
119 if (p->next
[all...]
/freebsd-11-stable/contrib/xz/src/liblzma/common/
H A Dfilter_buffer_encoder.c28 lzma_next_coder next = LZMA_NEXT_CODER_INIT;
29 return_if_error(lzma_raw_encoder_init(&next, allocator, filters));
37 lzma_ret ret = next.code(next.coder, allocator, in, &in_pos, in_size,
39 lzma_next_end(&next, allocator);
H A Dfilter_buffer_decoder.c28 lzma_next_coder next = LZMA_NEXT_CODER_INIT;
29 return_if_error(lzma_raw_decoder_init(&next, allocator, filters));
37 lzma_ret ret = next.code(next.coder, allocator, in, in_pos, in_size,
69 (void)next.code(next.coder, allocator,
85 lzma_next_end(&next, allocator);
H A Dcommon.c116 lzma_next_filter_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
119 lzma_next_coder_init(filters[0].init, next, allocator);
120 next->id = filters[0].id;
122 ? LZMA_OK : filters[0].init(next, allocator, filters);
127 lzma_next_filter_update(lzma_next_coder *next, const lzma_allocator *allocator, argument
132 // reversed_filters[0].id and next->id.
133 if (reversed_filters[0].id != next->id)
139 assert(next->update != NULL);
140 return next->update(next
145 lzma_next_end(lzma_next_coder *next, const lzma_allocator *allocator) argument
[all...]
H A Dalone_encoder.c21 lzma_next_coder next; member in struct:__anon24
55 return coder->next.code(coder->next.coder,
72 lzma_next_end(&coder->next, allocator);
80 alone_encoder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
83 lzma_next_coder_init(&alone_encoder_init, next, allocator);
85 lzma_alone_coder *coder = next->coder;
92 next->coder = coder;
93 next->code = &alone_encode;
94 next
[all...]
/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dobjalloc.c61 struct objalloc_chunk *next; member in struct:objalloc_chunk
103 chunk->next = NULL;
148 chunk->next = (struct objalloc_chunk *) o->chunks;
162 chunk->next = (struct objalloc_chunk *) o->chunks;
184 struct objalloc_chunk *next; local
186 next = l->next;
188 l = next;
206 for (p = (struct objalloc_chunk *) o->chunks; p != NULL; p = p->next)
241 struct objalloc_chunk *next; local
283 struct objalloc_chunk *next; local
[all...]
/freebsd-11-stable/contrib/gdb/gdb/
H A Dbuildsym.c94 while (link->next) link = link->next;
95 link->next = free_pendings;
121 free_pendings = link->next;
128 link->next = *listhead;
162 list = list->next;
173 struct pending *next, *next1;
175 for (next = free_pendings; next; next
170 struct pending *next, *next1; local
228 struct pending *next, *next1; local
469 struct pending_block *next; local
[all...]
/freebsd-11-stable/contrib/binutils/libiberty/
H A Dobjalloc.c61 struct objalloc_chunk *next; member in struct:objalloc_chunk
103 chunk->next = NULL;
141 chunk->next = (struct objalloc_chunk *) o->chunks;
155 chunk->next = (struct objalloc_chunk *) o->chunks;
177 struct objalloc_chunk *next; local
179 next = l->next;
181 l = next;
199 for (p = (struct objalloc_chunk *) o->chunks; p != NULL; p = p->next)
234 struct objalloc_chunk *next; local
276 struct objalloc_chunk *next; local
[all...]
/freebsd-11-stable/lib/libc/include/isc/
H A Dlist.h33 #define LINK(type) struct { type *prev, *next; }
37 (elt)->link.next = (type *)(-1); \
42 (void *)((elt)->link.next) != (void *)(-1))
56 (elt)->link.next = (list).head; \
64 (list).tail->link.next = (elt); \
68 (elt)->link.next = NULL; \
75 if ((elt)->link.next != NULL) \
76 (elt)->link.next->link.prev = (elt)->link.prev; \
82 (elt)->link.prev->link.next = (elt)->link.next; \
[all...]
/freebsd-11-stable/contrib/expat/tests/
H A Dmemcheck.c43 struct allocation_entry *next; member in struct:allocation_entry
69 entry->next = NULL;
77 alloc_tail->next = entry;
88 for (entry = alloc_head; entry != NULL; entry = entry->next) {
110 entry->prev->next = entry->next;
112 alloc_head = entry->next;
113 if (entry->next != NULL)
114 entry->next->prev = entry->prev;
116 alloc_tail = entry->next;
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_wc/
H A Dtree_conflicts.c95 && skel->children->next->is_atom
96 && skel->children->next->next->is_atom
97 && skel->children->next->next->next->is_atom
98 && skel->children->next->next->next->next
[all...]
/freebsd-11-stable/libexec/talkd/
H A Dtable.c70 TABLE_ENTRY *next; member in struct:table_entry
85 TABLE_ENTRY *ptr, *next; local
92 for (ptr = table; ptr != NIL; ptr = next) {
93 next = ptr->next;
119 TABLE_ENTRY *ptr, *next; local
130 for (ptr = table; ptr != NIL; ptr = next) {
131 next = ptr->next;
172 ptr->next
[all...]
/freebsd-11-stable/sys/dev/isci/scil/
H A Dsci_base_subject.c94 this_observer = this_observer->next;
105 observer->next = this_subject->observer_list;
127 current_observer = current_observer->next;
136 previous_observer->next = observer->next;
141 this_subject->observer_list = observer->next;
145 observer->next = NULL;
/freebsd-11-stable/contrib/xz/src/liblzma/delta/
H A Ddelta_common.c21 lzma_next_end(&coder->next, allocator);
28 lzma_delta_coder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
32 lzma_delta_coder *coder = next->coder;
38 next->coder = coder;
41 next->end = &delta_coder_end;
42 coder->next = LZMA_NEXT_CODER_INIT;
57 // Initialize the next decoder in the chain, if any.
58 return lzma_next_filter_init(&coder->next, allocator, filters + 1);
/freebsd-11-stable/contrib/ntp/lib/isc/include/isc/
H A Dqueue.h37 #define ISC_QLINK(type) struct { void *next; isc_boolean_t linked; }
40 (elt)->link.next = (void *)(-1); \
72 (elt)->link.next = (void *)(-1); \
74 (queue).tail->link.next = elt; \
83 ret = (queue).head->link.next; \
88 (queue).head->link.next = ret->link.next; \
89 if (ret->link.next == (void *)(-1)) { \
95 ret->link.next = (void *)(-1); \
/freebsd-11-stable/contrib/gcc/
H A Dtree-iterator.c95 head->next = NULL;
109 head->prev->next = head;
112 tail->next = cur;
119 head->prev->next = head;
171 head->next = NULL;
183 tail->next = cur->next;
184 if (tail->next)
185 tail->next->prev = tail;
189 cur->next
221 struct tree_statement_list_node *cur, *next, *prev; local
248 struct tree_statement_list_node *cur, *next; local
[all...]
/freebsd-11-stable/sys/contrib/vchiq/interface/compat/
H A Dlist.h61 struct list_head *next; member in struct:list_head
64 #define LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) }
70 head->next = head;
76 return head->next;
88 return node->next;
100 return (head->next == head);
109 if (head->next != head->prev)
116 struct list_head *next)
118 prev->next = node;
120 node->next
115 __list_add_between(struct list_head *prev, struct list_head *node, struct list_head *next) argument
144 __list_splice_between(struct list_head *prev, const struct list_head *list, struct list_head *next) argument
[all...]
/freebsd-11-stable/tools/tools/drm/radeon/mkregtable/
H A Dmkregtable.c39 * sometimes we already know the next/prev entries and we can
45 struct list_head *next, *prev; member in struct:list_head
55 list->next = list;
63 * the prev/next entries already!
67 struct list_head *prev, struct list_head *next)
69 next->prev = new;
70 new->next = next;
72 prev->next = new;
76 struct list_head *prev, struct list_head *next);
66 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
112 __list_del(struct list_head *prev, struct list_head *next) argument
225 struct list_head *next = head->next; local
279 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
[all...]
/freebsd-11-stable/sys/dev/drm2/radeon/
H A Dradeon_mem.c16 * The above copyright notice and this permission notice (including the next
55 newblock->next = p->next;
57 p->next->prev = newblock;
58 p->next = newblock;
72 newblock->next = p->next;
74 p->next->prev = newblock;
75 p->next = newblock;
118 if (p->next
[all...]

Completed in 325 milliseconds

1234567891011>>