Searched refs:next (Results 226 - 250 of 2732) sorted by relevance

1234567891011>>

/freebsd-current/usr.sbin/rpc.statd/
H A Dstatd.h66 struct MonList_s *next; /* Next in list or NULL */ member in struct:MonList_s
/freebsd-current/usr.bin/tr/
H A Dextern.h49 wint_t next(STR *);
/freebsd-current/lib/libc/stdio/
H A Dfwalk.c56 for (g = &__sglue; g != NULL; g = g->next)
/freebsd-current/contrib/libarchive/libarchive/
H A Darchive_entry_link_resolver.c70 struct links_entry *next; member in struct:links_entry
282 for (le = res->buckets[bucket]; le != NULL; le = le->next) {
297 le->previous->next = le->next;
298 if (le->next != NULL)
299 le->next->previous = le->previous;
301 res->buckets[bucket] = le->next;
325 /* Look for next non-empty bucket in the links cache. */
327 for (le = res->buckets[bucket]; le != NULL; le = le->next) {
335 if (le->next !
[all...]
/freebsd-current/contrib/xz/src/liblzma/lzma/
H A Dlzma_decoder.h20 extern lzma_ret lzma_lzma_decoder_init(lzma_next_coder *next,
/freebsd-current/contrib/xz/src/liblzma/common/
H A Dfilter_common.h41 lzma_next_coder *next, const lzma_allocator *allocator,
H A Dblock_decoder.c25 lzma_next_coder next; member in struct:__anon37
86 const lzma_ret ret = coder->next.code(coder->next.coder,
208 lzma_next_end(&coder->next, allocator);
215 lzma_block_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
218 lzma_next_coder_init(&lzma_block_decoder_init, next, allocator);
227 // Allocate *next->coder if needed.
228 lzma_block_coder *coder = next->coder;
234 next->coder = coder;
235 next
[all...]
/freebsd-current/usr.sbin/makefs/
H A Dwalk.c96 while (cur->next != NULL)
97 cur = cur->next;
135 cur = join->next;
143 cur = cur->next;
165 cur->next = first;
172 prev->next = cur;
209 for (cur = first->next; cur != NULL; cur = cur->next)
255 fsnode *cur, *next; local
270 for (cur = node->first; cur->next; cu
364 fsnode *next; local
[all...]
/freebsd-current/contrib/byacc/test/
H A Dinherit1.y11 struct namelist { symbol *s; struct namelist *next; };
59 $$->next = $1;
63 $$->next = NULL;
/freebsd-current/crypto/heimdal/lib/roken/
H A Dparse_units.c74 char *next; local
83 val = strtol(p, &next, 0);
84 if (p == next) {
90 p = next;
278 const struct units *next; local
280 for (next = u + 1; next->name && next->mult == u->mult; ++next)
283 if (next
[all...]
/freebsd-current/usr.sbin/bluetooth/btpand/
H A Dchannel.c72 LIST_INSERT_HEAD(&channel_list, chan, next);
134 STAILQ_REMOVE_HEAD(&chan->pktlist, next);
157 LIST_REMOVE(chan, next);
191 STAILQ_REMOVE_HEAD(&chan->pktlist, next);
246 LIST_FOREACH(chan, &channel_list, next) {
262 LIST_FOREACH(chan, &channel_list, next) {
286 STAILQ_INSERT_TAIL(&chan->pktlist, ph, next);
316 channel_t *chan, *next; local
322 next = LIST_FIRST(&channel_list);
323 while ((chan = next) !
[all...]
/freebsd-current/sbin/rcorder/
H A Dhash.c148 nexth = h->next;
191 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next)
237 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) {
254 e->next = *hp;
291 (p = *hp) != NULL; hp = &p->next) {
293 *hp = p->next;
341 * The return value is a pointer to the next HashEntry
347 * next entry.
363 * to start at the next one in the chain.
367 e = e->next;
401 register Hash_Entry *e, *next = NULL, **hp, **xp; local
[all...]
/freebsd-current/lib/libc/stdlib/
H A Drand.c133 static u_long next = 1; variable
139 return (do_rand(&next));
147 next = seed;
/freebsd-current/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_reverse.h15 #include <__iterator/next.h>
39 auto __end = ranges::next(__first, __last);
48 auto __end = ranges::next(__first, __last);
/freebsd-current/sys/dev/usb/controller/
H A Dgeneric_ehci_fdt.c65 TAILQ_ENTRY(clk_list) next;
70 TAILQ_ENTRY(hwrst_list) next;
75 TAILQ_ENTRY(phy_list) next;
131 TAILQ_INSERT_TAIL(&sc->clk_list, clkp, next);
144 TAILQ_INSERT_TAIL(&sc->rst_list, rstp, next);
162 TAILQ_INSERT_TAIL(&sc->phy_list, phyp, next);
192 TAILQ_FOREACH_SAFE(clk, &sc->clk_list, next, clk_tmp) {
201 TAILQ_REMOVE(&sc->clk_list, clk, next);
206 TAILQ_FOREACH_SAFE(rst, &sc->rst_list, next, rst_tmp) {
209 TAILQ_REMOVE(&sc->rst_list, rst, next);
[all...]
/freebsd-current/contrib/bmake/
H A Dhash.c125 for (he = t->buckets[h & t->bucketsMask]; he != NULL; he = he->next) {
168 HashEntry *next = he->next; local
170 he = next;
228 HashEntry *next = he->next; local
229 he->next = newBuckets[he->hash & newMask];
231 he = next;
270 he->next = t->buckets[h & t->bucketsMask];
293 for (; (p = *ref) != NULL; ref = &p->next) {
[all...]
/freebsd-current/lib/libthr/thread/
H A Dthr_printf.c76 next: c = *fmt++;
82 goto next;
91 goto next;
/freebsd-current/contrib/libedit/
H A Dkeymacro.c81 struct keymacro_node_t *next; /* ptr to next char of this key */ member in struct:keymacro_node_t
288 if (ptr->next) {
289 /* key not complete so get next char */
292 return node_trav(el, ptr->next, ch, val);
302 /* try next sibling */
305 /* no next sibling -- mismatch */
333 if (ptr->next != NULL) {
334 node__put(el, ptr->next);
336 ptr->next
[all...]
/freebsd-current/contrib/wpa/wpa_supplicant/
H A Dctrl_iface_named_pipe.c63 struct wpa_ctrl_dst *next, *prev; member in struct:wpa_ctrl_dst
116 struct wpa_ctrl_dst *dst, *next; local
121 next = dst->next;
127 dst = next;
209 dst->next = priv->ctrl_dst;
210 if (dst->next)
211 dst->next->prev = dst;
243 dst->prev->next = dst->next;
482 struct wpa_ctrl_dst *dst, *next; local
545 struct wpa_global_dst *next, *prev; member in struct:wpa_global_dst
561 struct wpa_global_dst *dst, *next; local
[all...]
/freebsd-current/contrib/tcsh/
H A Ded.xmap.c106 struct Xmapnode *next; /* ptr to next char of this Xkey */ member in struct:Xmapnode
177 if (ptr->next) {
178 /* Xkey not complete so get next char */
184 return (TraverseMap(ptr->next, ch, val));
196 /* try next sibling */
200 /* no next sibling -- mismatch */
257 if (ptr->next != NULL) {
258 PutFreeNode(ptr->next); /* lose longer Xkeys with this prefix */
259 ptr->next
[all...]
/freebsd-current/crypto/heimdal/lib/hx509/
H A Derror.c43 hx509_error next; member in struct:hx509_error_data
52 hx509_error m2 = msg->next;
113 msg->next = context->error;
178 for (msg = context->error; msg; msg = msg->next)
180 msg->next != NULL ? "; " : "");
/freebsd-current/crypto/openssl/crypto/evp/
H A Dbio_ok.c174 BIO *next; local
180 next = BIO_next(b);
182 if ((ctx == NULL) || (next == NULL) || (BIO_get_init(b) == 0))
203 * copy start of the next block into proper place
222 i = BIO_read(next, &(ctx->buf[ctx->buf_len]), n);
260 BIO *next; local
266 next = BIO_next(b);
269 if ((ctx == NULL) || (next == NULL) || (BIO_get_init(b) == 0))
279 i = BIO_write(next, &(ctx->buf[ctx->buf_off]), n);
328 BIO *next; local
408 BIO *next; local
[all...]
/freebsd-current/lib/libsysdecode/tests/
H A Dsysdecode_test.c47 const char *next, *tok; local
57 for (tok = buf; (next = strsep(&buf, ",")), tok != NULL; tok = next) {
69 for (tok = buf; (next = strsep(&buf, ",")), tok != NULL;
70 tok = next) {
/freebsd-current/sbin/ipf/ipsend/
H A D44arp.c62 char *lim, *buf, *next; local
102 for (next = buf; next < lim; next += rtm->rtm_msglen)
104 rtm = (struct rt_msghdr *)next;
/freebsd-current/sys/netinet/libalias/
H A Dalias_mod.c134 SLIST_FOREACH(b, &dll_chain, next) {
138 SLIST_INSERT_HEAD(&dll_chain, p, next);
150 SLIST_FOREACH_SAFE(b, &dll_chain, next, b_tmp)
152 SLIST_REMOVE(&dll_chain, b, dll, next);
167 SLIST_REMOVE_HEAD(&dll_chain, next);

Completed in 325 milliseconds

1234567891011>>