Searched refs:next (Results 1 - 25 of 3058) sorted by last modified time

1234567891011>>

/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_write_set_format_7zip.c146 struct file *next; member in struct:file
209 * We use 'next' (a member of struct file) to chain.
914 for (;file != NULL; file = file->next) {
915 if (file->next == NULL ||
916 file->next->size == 0)
937 for (;file != NULL; file = file->next) {
994 for (;file != NULL; file = file->next) {
1091 for (;file != NULL; file = file->next) {
1209 for (;file != NULL; file = file->next) {
1238 for (;file != NULL; file = file->next) {
[all...]
H A Darchive_write_disk_posix.c173 struct fixup_entry *next; member in struct:fixup_entry
978 /* Calculate next block boundary after offset. */
2463 struct fixup_entry *next, *p; local
2552 next = p->next;
2559 p = next;
2619 if (p->next == NULL)
2624 a = p->next->next;
2627 a = a->next;
[all...]
H A Darchive_write.c79 char *next; member in struct:archive_none
205 * Allocate and return the next filter structure.
361 state->next = state->buffer;
412 memcpy(state->next, buff, to_copy);
413 state->next += to_copy;
434 state->next = state->buffer;
451 memcpy(state->next, buff, remaining);
452 state->next += remaining;
490 if (state->next != state->buffer) {
498 /* Round to next multipl
649 struct archive_write_filter *next local
[all...]
H A Darchive_read_support_format_zip.c80 struct zip_entry *next; member in struct:zip_entry
262 * streams inside ZIP files. It has 2 purposes: one is to fetch the next
272 /* Fetch next byte. */
284 /* Return the next compressed byte. */
690 * byte holds the next 7 bits, etc.
1437 /* Return bytes up until that point. On the next call,
2877 * be able to skip() it and try the next entry. */
2959 next_zip_entry = zip_entry->next;
3078 * + next 16-bit field has 6 options so contributes
3143 /* Search ahead for the next loca
[all...]
H A Darchive_read_support_format_tar.c114 struct sparse_block *next; member in struct:sparse_block
559 for (sb = tar->sparse_list; sb != NULL; sb = sb->next) {
602 tar->sparse_list = p->next;
662 for (p = tar->sparse_list; p != NULL; p = p->next) {
746 * loop to get the next.
753 * crude way to search for the next valid header!
975 /* Recursively read next header */
1120 /* Just skip this and read the next header. */
1439 * TODO: Look beyond the body here to peek at the next header.
1487 /* Parse the next heade
[all...]
H A Darchive_read_support_format_mtree.c86 struct mtree_option *next; member in struct:mtree_option
93 struct mtree_entry *next; member in struct:mtree_entry
237 struct mtree_option *next; local
239 for (; head != NULL; head = next) {
240 next = head->next;
306 q = p->next;
789 /* Test next line. */
832 opt->next = *global;
843 for (iter = *global; iter != NULL; last = iter, iter = iter->next) {
864 const char *next, *eq; local
893 const char *next; local
928 const char *next, *eq, *name, *end; local
[all...]
H A Darchive_read_support_format_cpio.c166 struct links_entry *next; member in struct:links_entry
439 * and parse it as a Solaris-style ACL, then read the next
514 * Skip forward to the next cpio newc header by searching for the
664 * Skip forward to the next cpio odc header by searching for the
778 /* Find the start of the next header. */
890 "End of file trying to read next cpio header");
935 "End of file trying to read next cpio header");
974 struct links_entry *lp = cpio->links_head->next;
1063 for (le = cpio->links_head; le; le = le->next) {
1069 le->previous->next
[all...]
H A Darchive_read_support_format_cab.c446 int next; local
447 if ((next = find_cab_magic(p)) == 0)
449 p += next;
515 int next; local
516 if ((next = find_cab_magic(p)) == 0) {
521 p += next;
933 * file contents from next cfdata. */
1573 * Set dictionary data for decompressing of next CFDATA, which
1718 * Make sure a read pointer advances to next CFDATA.
3207 /* Calculate next bi
[all...]
H A Darchive_read_disk_posix.c149 struct tree_entry *next; member in struct:tree_entry
287 * tree_next() returns Zero if there is no next entry, non-zero if
2109 te->next = t->stack;
2352 t->stack = te->next;
2362 * Get the next item in the tree traversal.
2370 /* If there's an open dir, get the next entry from there. */
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/
H A DSemaTemplateInstantiateDecl.cpp405 if (Expr *E = *std::next(Attr.scores_begin(), I))
409 *std::next(Attr.ctxSelectorSets_begin(), I));
411 *std::next(Attr.ctxSelectors_begin(), I));
/freebsd-11-stable/sbin/dhclient/
H A Ddhclient.c262 for (l = ifi->client->active; l != NULL; l = l->next)
430 /* The next bit is potentially very time-consuming, so write out
644 struct client_lease *lp, *next, *picked; local
657 for (lp = ip->client->offered_leases; lp; lp = next) {
658 next = lp->next;
676 picked->next = NULL;
934 ap; ap = ap->next) {
970 ap; ap = ap->next) {
1013 lease; lease = lease->next) {
[all...]
/freebsd-11-stable/libexec/ftpd/
H A Dftpd.c161 struct ftphost *next; member in struct:ftphost
575 * for peer's ACK before issuing our next reply.
706 hrp->next = NULL;
778 for (hrp = firsthost; hrp != NULL; hrp = hrp->next) {
864 hrp->next = NULL;
865 lhrp->next = hrp;
919 hrp = hrp->next;
951 * the next call to this function. Its difference from getpwnam()
/freebsd-11-stable/sys/contrib/ipfilter/netinet/
H A Dip_state.c1365 /* the call will fail and a flush is scheduled for the next timeout call. */
2254 * Microsoft Windows will send the next packet to the right of the
2278 * Picking up a connection in the middle, the "next"
4087 * the next piece of code makes it possible to get
4849 ipstate_t *is, *next, zero; local
4881 next = softs->ipf_state_list;
4883 next = is->is_next;
4890 if (next != NULL) {
4891 MUTEX_ENTER(&next->is_lock);
4892 next
[all...]
H A Dip_frag.c499 * Compute the offset of the expected start of the next packet.
1224 ipfr_t *frag, *next, zero; local
1242 next = *top;
1244 next = frag->ipfr_next;
1246 if (next != NULL) {
1247 ATOMIC_INC(next->ipfr_ref);
1248 token->ipt_data = next;
1251 next = &zero;
1254 if (next->ipfr_next == NULL)
1259 error = COPYOUT(next, it
[all...]
/freebsd-11-stable/sys/compat/linux/
H A Dlinux_futex.c1305 if (fetch_robust_entry(&entry, PTRIN(&head->list.next), &pi)) {
1324 rc = fetch_robust_entry(&next_entry, PTRIN(&entry->next), &next_pi);
/freebsd-11-stable/sys/netgraph/bluetooth/hci/
H A Dng_hci_evnt.c267 LIST_FOREACH(con, &unit->con_list, next) {
471 LIST_FOREACH(con, &unit->con_list, next)
675 LIST_FOREACH(con, &unit->con_list, next)
835 LIST_FOREACH(con, &unit->con_list, next)
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMISelLowering.cpp1992 VA = RVLocs[++i]; // skip ahead to next loc
2006 VA = RVLocs[++i]; // skip ahead to next loc
2010 VA = RVLocs[++i]; // skip ahead to next loc
2202 VA = ArgLocs[++i]; // skip ahead to next loc
2488 /// on the stack. Remember the next parameter register to allocate,
2626 // next instruction. The behaviour of branch instructions in this
2836 VA = RVLocs[++i]; // skip ahead to next loc
2842 VA = RVLocs[++i]; // skip ahead to next loc
2857 VA = RVLocs[++i]; // skip ahead to next loc
4064 VA = ArgLocs[++i]; // skip ahead to next lo
[all...]
/freebsd-11-stable/sys/conf/
H A Dkern.mk13 # The following flags are next up for working on:
/freebsd-11-stable/tests/sys/netgraph/
H A Dutil.c61 SLIST_ENTRY(data_handler) next;
144 SLIST_INSERT_HEAD(&data_head, p, next);
184 SLIST_FOREACH(hnd, &data_head, next)
/freebsd-11-stable/contrib/sqlite3/
H A Dsqlite3.c2107 ** be advantageous to block on the next WAL lock if the lock is not immediately
2125 ** atomically at the next [SQLITE_FCNTL_COMMIT_ATOMIC_WRITE]. Systems
2426 ** next. Applications that use these interfaces must be prepared for any
2428 ** from one release to the next. Applications must not attempt to access
2702 ** allocators round up memory allocations at least to the next multiple
3152 ** rounded down to the next smaller multiple of 8. ^(The lookaside memory
5597 ** or until the next call to
5607 ** one release of SQLite to the next.
5732 ** sqlite3_step() is called again to retrieve the next row of data.
6447 ** occurs is undefined and may change from one release of SQLite to the next
14003 HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:HashElem
24751 u32 next; /* Index in mem3.aPool[] of next free chunk */ member in struct:Mem3Block::__anon30::__anon32
24811 u32 next = mem3.aPool[i].u.list.next; local
25422 int next; /* Index of next free chunk */ member in struct:Mem5Link
25503 int next, prev; local
66889 u32 next, size; local
69667 Pgno next = 0; local
169622 Fts3HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:Fts3HashElem
[all...]
H A Dshell.c1169 ** the next directory entry that should be returned by the readdir() or
1273 next:
1282 if( is_filtered(data) ) goto next;
1309 next:
1315 if( is_filtered(data) ) goto next;
1350 next:
1359 if( is_filtered(data) ) goto next;
1469 unsigned ixMask; /* Insert next input into u.x[nLoaded^ixMask]. */
2783 ** Advance an fsdir_cursor to its next row of output.
3302 ** Advance a completion_cursor to its next ro
[all...]
/freebsd-11-stable/testcode/
H A Dfake_event.c212 for(p = runtime->pending_list; p; p = p->next) {
284 p = p->next;
300 *prev = p->next;
305 prev = &p->next;
306 p = p->next;
318 reppkt = reppkt->next;
339 reppkt = reppkt->next;
389 if(entry && entry->reply_list->next &&
391 /* go to next packet next tim
[all...]
/freebsd-11-stable/contrib/unbound/validator/
H A Dautotrust.c402 np = p->next;
453 ta->next = (*tp)->autr->keys;
553 /** iterator for DSes from keylist. return true if a next element exists */
564 *list = (*list)->next;
567 *list = (*list)->next;
572 /** iterator for DNSKEYs from keylist. return true if a next element exists */
585 *list = (*list)->next;
588 *list = (*list)->next;
818 char* next = strchr(line, ' '); local
819 if(!next)
2031 time_t next = (time_t)wait_probe_time(env->anchors); local
2392 todo_probe(struct module_env* env, time_t* next) argument
[all...]
/freebsd-11-stable/contrib/unbound/util/
H A Dnetevent.h200 For tcp_accept the first entry, for tcp_handlers the next one. */
855 /** next stream in list per session */
856 struct http2_stream* next; member in struct:http2_stream
880 /** buffer to store response into. Can't use shared buffer as a next
H A Dnetevent.c147 /** next in signal list */
148 struct internal_signal* next; member in struct:internal_signal
1088 /** Make tcp handler free for next assignment */
2143 /** Make http handler free for next assignment */
2321 /** a chunk header is complete, process it, return 0=fail, 1=continue next
2342 /* continue with header of the next chunk */
2429 * from next chunk header and next chunk) */
2556 struct http2_stream* h2_stream, *next; local
2560 next
[all...]

Completed in 811 milliseconds

1234567891011>>