Searched refs:queues (Results 1 - 17 of 17) sorted by relevance

/freebsd-9.3-release/contrib/sendmail/contrib/
H A Dmovemail.pl3 # Move old mail messages between queues by calling re-mqueue.pl.
50 use vars qw(@queues $subqbase @ages $remqueue $lockfile);
53 if ($#queues < 1) {
54 print "$progname: there must be at least two queues\n";
58 if ($#ages != ($#queues - 1)) {
59 print "$progname: wrong number of ages (should be one less than number of queues)\n";
78 for (my $n = $#queues - 1; $n >= 0; $n--) {
90 opendir(DIR, $queues[$n])
91 or die "Can't open $queues[$n]: $!";
93 &$remsub("$queues[
[all...]
H A Dmovemail.conf8 @queues = qw(
15 # If used, queue directories are $queues[n]/$subqbase*
/freebsd-9.3-release/sys/geom/sched/
H A Dgs_rr.c32 * A round-robin (RR) anticipatory scheduler, with per-client queues.
49 * Scheduling is made looking at the status of all queues,
122 /* Default quantum for RR between queues. */
126 * Per device descriptor, holding the Round Robin list of queues
143 int sc_nqueues; /* number of queues */
162 int queues; /* total number of queues */ member in struct:g_rr_params
205 SYSCTL_INT(_kern_geom_sched_rr, OID_AUTO, queues, CTLFLAG_RD,
206 &me.queues, 0, "Total rr queues");
[all...]
/freebsd-9.3-release/sys/contrib/pf/net/
H A Dpf_ruleset.c165 TAILQ_INIT(&ruleset->rules[i].queues[0]);
166 TAILQ_INIT(&ruleset->rules[i].queues[1]);
167 ruleset->rules[i].active.ptr = &ruleset->rules[i].queues[0];
168 ruleset->rules[i].inactive.ptr = &ruleset->rules[i].queues[1];
H A Dpfvar.h1047 struct pf_rulequeue queues[2]; member in struct:pf_ruleset::__anon56
/freebsd-9.3-release/sys/dev/e1000/
H A Dif_igb.c385 "Number of queues to configure, 0 indicates autoconfigure");
388 ** Global variable to store last used CPU when binding queues
972 que = &adapter->queues[i];
1473 struct igb_queue *que = adapter->queues;
1542 que = &adapter->queues[i];
2217 struct igb_queue *que = adapter->queues;
2227 ** Check the TX queues status
2229 ** - watchdog only if all queues show hung
2479 struct igb_queue *que = adapter->queues;
2536 struct igb_queue *que = adapter->queues;
2836 int rid, want, queues, msgs, maxqueues; local
[all...]
H A Dif_igb.h411 /* Interface queues */
412 struct igb_queue *queues; member in struct:adapter
/freebsd-9.3-release/sys/netpfil/ipfw/
H A Ddummynet.txt92 describes a flowset, i.e. a template for queues.
120 how many queues point to it), a pointer to the
122 flowset. scheduler instances also should store queues in
132 a refcount for the number of queues pointing to it;
308 'standalone' instance and one that can be used by queues,
415 deleted later because there could be some queues that are using it.
422 pipe, all scheduler, all flowset, plus all scheduler instances and all queues.
432 'ptr_sched' pointer. If a scheduler instance has queues, there are wrote in
463 queues exist using this flowset.
542 or queues, th
[all...]
/freebsd-9.3-release/sys/dev/ixgbe/
H A Dixgbe.c299 "Number of queues to configure, 0 indicates autoconfigure");
658 struct ix_queue *que = adapter->queues;
828 que = &adapter->queues[i];
1189 /* Now enable all the queues */
2046 struct ix_queue *que = adapter->queues;
2068 ** Check the TX queues status
2069 ** - watchdog only if all queues show hung
2078 /* Only truely watchdog if all queues show hung */
2275 struct ix_queue *que = adapter->queues;
2346 struct ix_queue *que = adapter->queues;
2434 int rid, want, queues, msgs; local
[all...]
H A Dixgbe.h441 struct ix_queue *queues; member in struct:adapter
H A Dixv.h358 struct ix_queue *queues; member in struct:adapter
H A Dixv.c440 struct ix_queue *que = adapter->queues;
587 que = &adapter->queues[i];
960 ixv_rearm_queues(struct adapter *adapter, u64 queues) argument
962 u32 mask = (IXGBE_EIMS_RTX_QUEUE & queues);
1588 struct ix_queue *que = adapter->queues;
1758 struct ix_queue *que = adapter->queues;
1991 if (!(adapter->queues =
2022 * Now set up the TX queues, txconf is needed to handle the
2068 * Next the RX queues...
2106 que = &adapter->queues[
[all...]
/freebsd-9.3-release/contrib/pf/pfctl/
H A Dparse.y205 } *queues = NULL;
237 struct node_qassign queues;
1471 yyerror("no child queues specified");
2212 if ($9.queues.qname != NULL) {
2213 if (strlcpy(r.qname, $9.queues.qname,
2219 free($9.queues.qname);
2221 if ($9.queues.pqname != NULL) {
2222 if (strlcpy(r.pqname, $9.queues.pqname,
2228 free($9.queues.pqname);
2342 if (filter_opts.queues
[all...]
/freebsd-9.3-release/sys/dev/mpr/
H A Dmpr.c492 * Size the queues. Since the reply queues always need one free
551 "queues with error %d\n", __func__, error);
555 panic("%s failed to alloc queues with error "
561 /* Always initialize the queues */
589 * IOC treats the queues as full if both are set to the same value.
1092 uint8_t *queues; local
1104 * These two queues are allocated together for simplicity.
1123 device_printf(sc->mpr_dev, "Cannot allocate queues DMA tag\n");
1126 if (bus_dmamem_alloc(sc->queues_dmat, (void **)&queues, BUS_DMA_NOWAI
[all...]
/freebsd-9.3-release/sys/dev/mps/
H A Dmps.c465 * Size the queues. Since the reply queues always need one free
524 "queues with error %d\n", __func__, error);
528 panic("%s failed to alloc queues with error "
534 /* Always initialize the queues */
562 * IOC treats the queues as full if both are set to the same value.
1065 uint8_t *queues; local
1077 * These two queues are allocated together for simplicity.
1096 device_printf(sc->mps_dev, "Cannot allocate queues DMA tag\n");
1099 if (bus_dmamem_alloc(sc->queues_dmat, (void **)&queues, BUS_DMA_NOWAI
[all...]
/freebsd-9.3-release/contrib/ipfilter/
H A DHISTORY456 overhaul the timeout queue management, especially that for user defined queues
666 fix timeout queue use by proxies with private queues
779 use queues to expire data rather than lists
/freebsd-9.3-release/sys/dev/isp/
H A DDriverManual.txt141 via mailbox commands, circular request and response queues in system
247 request/response queues and fibre channel scratch area, set up and tear
309 queues (as well as a Fibre Channel scratch area if this is a Fibre
313 on the Request and Reponse queues. Another callback can enable the *use*
437 issues. As an example of this, the Linux implementation simply queues

Completed in 355 milliseconds