Searched refs:next (Results 76 - 100 of 2730) sorted by relevance

1234567891011>>

/freebsd-current/contrib/xz/src/liblzma/delta/
H A Ddelta_decoder.h18 extern lzma_ret lzma_delta_decoder_init(lzma_next_coder *next,
H A Ddelta_encoder.h18 extern lzma_ret lzma_delta_encoder_init(lzma_next_coder *next,
/freebsd-current/contrib/ofed/libmlx5/
H A Ddbrec.c42 struct mlx5_db_page *prev, *next; member in struct:mlx5_db_page
75 page->next = context->db_list;
77 if (page->next)
78 page->next->prev = page;
91 for (page = context->db_list; page; page = page->next)
124 for (page = context->db_list; page; page = page->next)
136 page->prev->next = page->next;
138 context->db_list = page->next;
139 if (page->next)
[all...]
/freebsd-current/sys/dev/qat/include/common/
H A Dadf_cfg_user.h13 struct adf_user_cfg_key_val *next; member in union:adf_user_cfg_key_val::__anon4241
26 struct adf_user_cfg_section *next; member in union:adf_user_cfg_section::__anon4243
/freebsd-current/contrib/xz/src/liblzma/simple/
H A Dsparc.c60 sparc_coder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
63 return lzma_simple_coder_init(next, allocator, filters,
70 lzma_simple_sparc_encoder_init(lzma_next_coder *next, argument
74 return sparc_coder_init(next, allocator, filters, true);
81 lzma_simple_sparc_decoder_init(lzma_next_coder *next, argument
85 return sparc_coder_init(next, allocator, filters, false);
H A Darmthumb.c53 armthumb_coder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
56 return lzma_simple_coder_init(next, allocator, filters,
63 lzma_simple_armthumb_encoder_init(lzma_next_coder *next, argument
67 return armthumb_coder_init(next, allocator, filters, true);
74 lzma_simple_armthumb_decoder_init(lzma_next_coder *next, argument
78 return armthumb_coder_init(next, allocator, filters, false);
H A Darm.c48 arm_coder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
51 return lzma_simple_coder_init(next, allocator, filters,
58 lzma_simple_arm_encoder_init(lzma_next_coder *next, argument
62 return arm_coder_init(next, allocator, filters, true);
69 lzma_simple_arm_decoder_init(lzma_next_coder *next, argument
73 return arm_coder_init(next, allocator, filters, false);
H A Dpowerpc.c53 powerpc_coder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
56 return lzma_simple_coder_init(next, allocator, filters,
63 lzma_simple_powerpc_encoder_init(lzma_next_coder *next, argument
67 return powerpc_coder_init(next, allocator, filters, true);
74 lzma_simple_powerpc_decoder_init(lzma_next_coder *next, argument
78 return powerpc_coder_init(next, allocator, filters, false);
/freebsd-current/contrib/byacc/
H A Dmkpar.c95 temp->next = actions;
136 action *temp, *prev, *next; local
139 for (next = actions; next && next->symbol < symbol; next = next->next)
140 prev = next;
142 while (next
[all...]
/freebsd-current/sys/dev/isci/scil/
H A Dsci_fast_list.h62 * circular in nature. This means that the next and prev pointers for
65 * a queue will have its next and prev pointer set to the address of
101 (element)->next = (element)->prev = NULL; \
137 * This method will get the next dListField in the SCI_FAST_LIST. This method
140 #define sci_fast_list_get_next(element) ((element)->next)
202 struct SCI_FAST_LIST_ELEMENT *next; member in struct:SCI_FAST_LIST_ELEMENT
230 element->next = anchor->list_head;
252 element->next = NULL;
256 anchor->list_tail->next = element;
283 anchor->list_head = anchor->list_head->next;
[all...]
/freebsd-current/sys/contrib/ck/include/spinlock/
H A Danderson.h53 unsigned int next; member in struct:ck_spinlock_anderson
74 lock->next = 0;
78 * appropriate wrap-around value in the case of next slot counter
96 position = ck_pr_load_uint(&lock->next) & lock->mask;
106 unsigned int position, next; local
115 position = ck_pr_load_uint(&lock->next);
119 next = lock->wrap;
121 next = position + 1;
122 } while (ck_pr_cas_uint_value(&lock->next, position,
123 next,
[all...]
/freebsd-current/sys/compat/linuxkpi/common/include/linux/
H A Dllist.h10 struct llist_node *next; member in struct:llist_node
32 struct llist_node *first, *next; local
38 next = first->next;
40 (uintptr_t)first, (uintptr_t)next) == 0);
51 new->next = first = head->first;
65 new_last->next = first = head->first;
87 ((n) = (pos)->next, pos); \
93 (n = llist_entry(pos->member.next, __typeof(*pos), member), pos); \
99 (pos) = llist_entry((pos)->member.next, __typeo
[all...]
/freebsd-current/contrib/diff/src/
H A Dcontext.c206 struct change *next = hunk;
213 while (next && next->line0 + next->deleted <= i)
214 next = next->link;
219 if (next && next->line0 <= i)
223 prefix = (next->inserted > 0 ? "!" : "-");
235 struct change *next
203 struct change *next = hunk; local
232 struct change *next = hunk; local
291 struct change *next; local
428 struct change *next = script->link; local
[all...]
/freebsd-current/contrib/less/
H A Dlinenum.c43 struct linenum_info *next; /* Link to next in the list */ member in struct:linenum_info
46 POSITION gap; /* Gap between prev and next */
51 * is the distance between the previous one and the next one in the list.
87 p->next = p+1;
88 pool[NPOOL-2].next = NULL;
96 anchor.next = anchor.prev = &anchor;
113 if (p == &anchor || p->next == &anchor)
115 p->gap = p->next->pos - p->prev->pos;
135 for (p = anchor.next;
[all...]
/freebsd-current/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_list.h41 x->next = nullptr;
45 x->next = nullptr;
46 last_->next = x;
54 x->next = nullptr;
58 x->next = first_;
66 first_ = first_->next;
76 CHECK_EQ(prev->next, x);
77 prev->next = x->next;
95 l->last_->next
[all...]
/freebsd-current/crypto/openssl/test/
H A Dx509aux.c53 goto next;
60 goto next;
69 goto next;
74 goto next;
81 goto next;
87 goto next;
92 goto next;
99 goto next;
105 goto next;
116 goto next;
[all...]
/freebsd-current/contrib/xz/src/liblzma/common/
H A Dblock_encoder.c20 lzma_next_coder next; member in struct:__anon39
64 const lzma_ret ret = coder->next.code(coder->next.coder,
145 lzma_next_end(&coder->next, allocator);
162 &coder->next, allocator, reversed_filters);
167 lzma_block_encoder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
170 lzma_next_coder_init(&lzma_block_encoder_init, next, allocator);
188 // Allocate and initialize *next->coder if needed.
189 lzma_block_coder *coder = next->coder;
195 next
[all...]
H A Dalone_decoder.c19 lzma_next_coder next; member in struct:__anon31
155 return_if_error(lzma_next_filter_init(&coder->next,
163 return coder->next.code(coder->next.coder,
180 lzma_next_end(&coder->next, allocator);
207 lzma_alone_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
210 lzma_next_coder_init(&lzma_alone_decoder_init, next, allocator);
212 lzma_alone_coder *coder = next->coder;
219 next->coder = coder;
220 next
[all...]
H A Dcommon.c118 lzma_next_filter_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
121 lzma_next_coder_init(filters[0].init, next, allocator);
122 next->id = filters[0].id;
124 ? LZMA_OK : filters[0].init(next, allocator, filters);
129 lzma_next_filter_update(lzma_next_coder *next, const lzma_allocator *allocator, argument
134 // reversed_filters[0].id and next->id.
135 if (reversed_filters[0].id != next->id)
141 assert(next->update != NULL);
142 return next->update(next
147 lzma_next_end(lzma_next_coder *next, const lzma_allocator *allocator) argument
[all...]
/freebsd-current/contrib/wpa/wpa_supplicant/
H A Dblacklist.c33 e = e->next;
77 e->next = wpa_s->blacklist;
103 wpa_s->blacklist = e->next;
105 prev->next = e->next;
113 e = e->next;
134 e = e->next;
/freebsd-current/contrib/netbsd-tests/lib/libbluetooth/
H A Dt_sdp_put.c58 test.end = test.next;
59 test.next = buf;
67 ATF_REQUIRE_EQ(test.end - test.next, sizeof(expect));
68 ATF_CHECK(memcmp(expect, test.next, sizeof(expect)) == 0);
90 value.next += 1; // skip "nil"
92 test.end = test.next;
93 test.next = buf;
100 ATF_REQUIRE_EQ(test.end - test.next, sizeof(expect));
101 ATF_CHECK(memcmp(expect, test.next, sizeof(expect)) == 0);
144 test.end = test.next;
[all...]
/freebsd-current/contrib/ntp/libntp/lib/isc/include/isc/
H A Dlist.h35 #define ISC_LINK(type) struct { type *prev, *next; }
39 (elt)->link.next = (type *)(-1); \
56 (elt)->link.next = (list).head; \
72 (list).tail->link.next = (elt); \
76 (elt)->link.next = NULL; \
91 if ((elt)->link.next != NULL) \
92 (elt)->link.next->link.prev = (elt)->link.prev; \
98 (elt)->link.prev->link.next = (elt)->link.next; \
101 (list).head = (elt)->link.next; \
[all...]
/freebsd-current/contrib/bmake/
H A Dlst.c40 LstNodeNew(ListNode *prev, ListNode *next, void *datum) argument
45 ln->next = next;
54 ListNode *ln, *next; local
56 for (ln = list->first; ln != NULL; ln = next) {
57 next = ln->next;
65 ListNode *ln, *next; local
67 for (ln = list->first; ln != NULL; ln = next) {
68 next
[all...]
/freebsd-current/contrib/tcsh/
H A Dsh.parse.c67 } while (asyntax(lexp->next, lexp) != 0);
76 p1 = p1->next;
87 for (p = p1; p != p2; p = p->next)
101 if (p->next != p2 && eq(p->next->word, STRand))
102 p = p->next;
113 return asyntax(p->next, p2);
145 if (p2 == p1->next)
147 return asyn0(p1->next, p2);
162 if (p1->word[0] && eq(p1->word, alout.next
[all...]
/freebsd-current/sys/contrib/openzfs/module/zfs/
H A Dzfs_rlock.c314 zfs_locked_range_t *next; local
340 next = prev;
342 next = avl_nearest(tree, where, AVL_AFTER);
344 if (next == NULL || off + len <= next->lr_offset) {
350 if (off < next->lr_offset) {
352 zfs_rangelock_new_proxy(tree, off, next->lr_offset - off);
362 for (prev = NULL; next; prev = next, next
406 zfs_locked_range_t *prev, *next; local
586 zfs_locked_range_t *next = NULL; local
[all...]

Completed in 364 milliseconds

1234567891011>>