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

1234567891011>>

/freebsd-current/sys/netinet/tcp_stacks/
H A Dtcp_rack.h60 TAILQ_ENTRY(rack_sendmap) next; member in struct:rack_sendmap
61 TAILQ_ENTRY(rack_sendmap) r_tnext; /* Time of transmit based next */
77 uint8_t r_just_ret : 1, /* After sending, the next pkt was just returned, i.e. limited */
89 TAILQ_ENTRY(deferred_opt_list) next; member in struct:deferred_opt_list
669 TAILQ_ENTRY(tcp_rack) r_hpts; /* hptsi queue next Lock(b) */
681 /* Note for details of next two fields see rack_init_retransmit_rate() */
H A Drack.c1778 "Total number of times we used the next merge");
2874 struct rack_sendmap *next,
2886 log.u_bbr.rttProp = (uint64_t)next;
2898 if (next) {
2899 log.u_bbr.flex5 = next->r_start;
2900 log.u_bbr.flex6 = next->r_end;
4368 * this new one as next and move the end_appl up
4935 * returned in the previous block). So we go to the next, and continue
5392 /* Record the lost count for the next measurement */
5432 * the next sen
2871 rack_log_map_chg(struct tcpcb *tp, struct tcp_rack *rack, struct rack_sendmap *prev, struct rack_sendmap *rsm, struct rack_sendmap *next, int flag, uint32_t th_ack, int line) argument
10016 struct rack_sendmap *rsm, *nrsm, *prev, *next; local
[all...]
/freebsd-current/sys/dev/cxgbe/
H A Dt4_sched.c719 t->etid_tab[i - 1].next = &t->etid_tab[i];
720 t->etid_tab[t->netids - 1].next = NULL;
756 t->efree = p->next;
779 p->next = t->efree;
/freebsd-current/usr.bin/netstat/
H A Droute.c246 char *buf, *next, *lim; local
271 for (next = buf; next < lim; next += rtm->rtm_msglen) {
272 rtm = (struct rt_msghdr *)next;
H A Dnhops.c341 char *buf, *next, *lim; local
370 for (next = buf; next < lim; next += rtm->rtm_msglen) {
371 rtm = (struct rt_msghdr *)next;
/freebsd-current/sys/kern/
H A Dvfs_mount.c2793 SLIST_ENTRY(mntaarg) next;
2851 SLIST_INSERT_HEAD(&ma->list, maa, next);
2880 SLIST_INSERT_HEAD(&ma->list, maa, next);
2927 SLIST_REMOVE_HEAD(&ma->list, next);
H A Dsysv_msg.c158 short next; /* next segment in buffer */ member in struct:msgmap
160 /* 0..(MSGSEG-1) -> index of next segment */
252 msgmaps[i-1].next = i;
253 msgmaps[i].next = -1; /* implies entry is available */
388 short next; local
391 next = msgmaps[msghdr->msg_spot].next;
392 msgmaps[msghdr->msg_spot].next = free_msgmaps;
395 msghdr->msg_spot = next;
774 short next; local
1145 short next; local
[all...]
H A Dkern_linker.c227 * Perform each task, and continue on to the next task.
284 * Perform each task, and continue on to the next task.
685 module_t mod, next; local
738 for (mod = TAILQ_FIRST(&file->modules); mod; mod = next) {
739 next = module_getfnext(mod);
1764 /* we changed tailq next ptr */
1775 * have a chance. Also, we've busted the tailq next
H A Dkern_boottrace.c252 goto next;
284 next:
/freebsd-current/sys/dev/uart/
H A Duart_cpu_acpi.c243 goto next;
247 goto next;
251 goto next;
263 next:
/freebsd-current/sys/contrib/openzfs/module/zfs/
H A Dspa.c1243 char *next = cfg, *tok, *c; local
1252 /* `next` is the start of the config */
1253 if (next == NULL)
1257 while (isspace(*next))
1258 next++;
1259 if (*next == '\0')
1263 tok = next;
1264 next = strchr(tok, ' ');
1265 if (next != NULL) *next
3098 dsl_deadlist_entry_t *next = spa->spa_to_condense.next; local
3165 dsl_deadlist_entry_t *next = spa->spa_to_condense.next; local
[all...]
/freebsd-current/libexec/rtld-elf/
H A Drtld.h80 struct Struct_Needed_Entry *next; member in struct:Struct_Needed_Entry
129 * It looks at "next" and "mapbase" at least. Don't add new members
140 TAILQ_ENTRY(Struct_Obj_Entry) next; member in struct:Struct_Obj_Entry
H A Drtld.c840 TAILQ_INSERT_HEAD(&obj_list, obj_main, next);
875 TAILQ_FOREACH(obj, &obj_list, next) {
993 TAILQ_FOREACH(obj, &obj_list, next) {
1073 * into a buffer, and sets things up so that the next call to dlerror()
1410 nep->next = NULL;
1413 needed_tail = &nep->next;
1422 nep->next = NULL;
1425 needed_filtees_tail = &nep->next;
1437 nep->next = NULL;
1440 needed_aux_filtees_tail = &nep->next;
5132 Obj_Entry marker, *obj, *next; local
[all...]
/freebsd-current/contrib/bsddialog/lib/
H A Dmenubox.c282 int i, next; local
284 next = -1;
291 if (i < abs && next == -1)
292 next = i;
296 return (next != -1 ? next : abs);
507 int i, next, retval; local
592 next = getnext(m.nitems, m.pritems, -1);
593 changeitem = next != m.sel;
598 next
[all...]
H A Dformbox.c678 int next, retval, wchtype; local
776 next = previtem(form.nitems, form.pritems,
778 changeitem = form.sel != next;
790 next = nextitem(form.nitems, form.pritems,
792 changeitem = form.sel != next;
797 next = firstitem(form.nitems, form.pritems);
798 changeitem = form.sel != next;
803 next = lastitem(form.nitems, form.pritems);
804 changeitem = form.sel != next;
893 form.sel = next;
[all...]
/freebsd-current/sys/fs/tmpfs/
H A Dtmpfs_subr.c1638 struct uio *uio, off_t next)
1656 dent.d_off = next;
1699 * the offset is set to TMPFS_DIRCOOKIE_EOF, which will cause the next
1637 tmpfs_dir_getdotdotdent(struct tmpfs_mount *tm, struct tmpfs_node *node, struct uio *uio, off_t next) argument
/freebsd-current/sys/arm64/arm64/
H A Dpmap.c394 SYSCTL_INT(_vm_pmap_asid, OID_AUTO, next, CTLFLAG_RD, &asids.asid_next, 0,
402 SYSCTL_INT(_vm_pmap_vmid, OID_AUTO, next, CTLFLAG_RD, &vmids.asid_next, 0,
422 * allocated when the pmap is next activated.
628 * The next level may or may not point to a valid page or block.
1601 * of the next segment are the same then adjust the
1602 * pv_table entry for that next segment down by one so
3052 * The next chunk is a marker. However, it is
4016 * Calculate index for next page table.
4352 * Go to the next L3 entry if the current one is
5991 * If promotion succeeds, then the next cal
[all...]
/freebsd-current/sbin/ifconfig/
H A Difconfig.c154 p->next = opts;
166 for (p = opts; p != NULL; p = p->next) {
371 struct ifaddrs *right, *temp, *last, *result, *next, *tail; local
377 next = NULL;
397 next = list;
400 next = right;
403 next = list;
406 next = right;
411 result = next;
413 tail->ifa_next = next;
[all...]
/freebsd-current/contrib/bmake/unit-tests/
H A Dsuff-main-several.exp5 Parsing line 14: next-main:
6 ParseDependency(next-main:)
28 Setting main node to "next-main"
59 Parsing line 40: next-main: suff-main-several.{2,3,4}
60 ParseDependency(next-main: suff-main-several.{2,3,4})
61 # LinkSource: added child next-main - suff-main-several.{2,3,4}
62 # next-main, unmade, type OP_DEPENDS|OP_HAS_COMMANDS, flags none
70 # next-main, unmade, type OP_DEPENDS|OP_HAS_COMMANDS, flags none
82 .ALLTARGETS = .1.2 .1.3 .1.4 next-main suff-main-several.1 suff-main-several.{2,3,4}
137 `next
[all...]
/freebsd-current/contrib/bmake/mk/
H A Ddirdeps.mk849 # we pass _DEP_TARGET_SPEC to tell the next step what we want
/freebsd-current/contrib/bmake/
H A Dmain.c889 for (ln = opts.variables.first; ln != NULL; ln = ln->next) {
950 for (ln = opts.create.first; ln != NULL; ln = ln->next) {
1214 for (ln = sysMkFiles.first; ln != NULL; ln = ln->next)
1294 for (ln = makefiles->first; ln != NULL; ln = ln->next) {
1312 for (ln = makefiles.first; ln != NULL; ln = ln->next)
1993 HashEntry *he, *next; local
1999 next = HashIter_Next(&hi);
2008 he = next;
2074 for (ln = gn->commands.first; ln != NULL; ln = ln->next) {
H A Djob.c1029 for (ln = job->node->commands.first; ln != NULL; ln = ln->next) {
1034 job->tailCmds = ln->next;
1054 for (ln = job->tailCmds; ln != NULL; ln = ln->next) {
1096 for (ln = job->node->commands.first; ln != NULL; ln = ln->next) {
1208 * the next command.
/freebsd-current/sys/netinet/
H A Dip_fw.h231 O_SKIPTO, /* arg1=next rule number */
616 * Counter block may be next (if rule->cntr_len > 0),
668 struct ip_fw *next_rule; /* ptr to next [skipto] rule */
725 ipfw_dyn_rule *next; /* linked list of rules. */ member in struct:_ipfw_dyn_rule
H A Dsctputil.c916 * A list of sizes based on typical mtu's, used only if next hop size not
1213 /* here we are different, we hold the next one we expect */
1600 /* done with all assocs on this endpoint, move on to next endpoint */
2096 * ECNE is on it. It must be marked as UNSENT again so next
3710 TAILQ_INSERT_AFTER(&stcb->sctp_ep->read_queue, aborted_control, control, next);
4334 TAILQ_FOREACH_SAFE(sp, &outs->outqueue, next, nsp) {
4336 TAILQ_REMOVE(&outs->outqueue, sp, next);
4642 /* Nope, move to the next chunk */
4825 TAILQ_FOREACH_SAFE(control, &old_inp->read_queue, next, nctl) {
4829 TAILQ_REMOVE(&old_inp->read_queue, control, next);
[all...]
/freebsd-current/usr.bin/grdc/
H A Dgrdc.c38 static long old[6], next[6], new[6], mask; variable
192 new[5] = (new[5]&~mask) | (next[k]&mask);
194 new[k] = (new[k]&~mask) | (next[k]&mask);
195 next[k] = 0;
256 next[i] |= ((disp[t]>>(4-i)*3)&07)<<n;
257 mask |= (next[i]^old[i])&m;

Completed in 365 milliseconds

1234567891011>>