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

12

/freebsd-13-stable/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-13-stable/sys/crypto/ccp/
H A Dccp_lsb.c49 qp = &sc->queues[queue];
68 * total and 5 queues. PSP will reserve some of both. Firmware limits some
69 * queues' access to some LSBs; we hope it is fairly sane and just use a dumb
70 * greedy algorithm to assign LSBs to queues.
77 for (q = 0; q < nitems(sc->queues); q++) {
81 sc->queues[q].private_lsb = -1;
87 sc->queues[q].private_lsb = i;
H A Dccp.c142 for (i = 0; i < nitems(sc->queues); i++) {
143 qp = &sc->queues[i];
162 for (i = 0; i < nitems(sc->queues); i++) {
163 qp = &sc->queues[i];
465 for (q = 0; q < nitems(sc->queues); q++)
468 if (q == nitems(sc->queues)) {
547 qp = &sc->queues[s->queue];
783 if (qindex >= nitems(sc->queues)) {
787 db_show_ccp_qp(&sc->queues[qindex]);
H A Dccp.h146 * (PSP-only) by default. PSP grants access to some queues to host via
171 struct ccp_queue queues[MAX_HW_QUEUES]; member in struct:ccp_softc
H A Dccp_hardware.c166 * queues.
222 qp = &sc->queues[queue];
225 * Don't bother allocating a ring for queues the host isn't allowed to
233 /* Ignore queues that do not have any LSB access. */
324 qp = &sc->queues[queue];
327 * Don't bother allocating a ring for queues the host isn't allowed to
611 * its queues. Scan each valid queue on interrupt for flags indicating
614 for (i = 0; i < nitems(sc->queues); i++) {
635 ccp_intr_run_completions(&sc->queues[i], ints);
643 for (i = 0; i < nitems(sc->queues);
[all...]
/freebsd-13-stable/sys/dev/ntb/if_ntb/
H A Dif_ntb.c83 &g_if_ntb_num_queues, 0, "Number of queues per interface");
101 struct ntb_net_queue *queues; member in struct:ntb_net_ctx
151 sc->queues = malloc(sc->num_queues * sizeof(struct ntb_net_queue),
155 q = &sc->queues[i];
193 ntb_transport_link_up(sc->queues[i].qp);
205 ntb_transport_link_down(sc->queues[i].qp);
210 q = &sc->queues[i];
217 free(sc->queues, M_DEVBUF);
230 if_setbaudrate(ifp, ntb_transport_link_speed(sc->queues[0].qp));
231 if_link_state_change(ifp, ntb_transport_link_query(sc->queues[
[all...]
/freebsd-13-stable/sys/dev/netmap/
H A Dif_ptnet.c136 struct buf_ring *bufring; /* for TX queues */
168 struct ptnet_queue *queues; member in struct:ptnet_softc
368 sc->queues = malloc(sizeof(struct ptnet_queue) * sc->num_rings,
370 if (sc->queues == NULL) {
374 sc->rxqueues = sc->queues + num_tx_rings;
377 struct ptnet_queue *pq = sc->queues + i;
534 if (sc->queues) {
537 struct ptnet_queue *pq = sc->queues + i;
564 if (sc->queues) {
566 struct ptnet_queue *pq = sc->queues
[all...]
/freebsd-13-stable/sbin/pfctl/
H A Dpf_ruleset.c136 TAILQ_INIT(&ruleset->rules[i].queues[0]);
137 TAILQ_INIT(&ruleset->rules[i].queues[1]);
138 ruleset->rules[i].active.ptr = &ruleset->rules[i].queues[0];
139 ruleset->rules[i].inactive.ptr = &ruleset->rules[i].queues[1];
H A Dparse.y212 } *queues = NULL;
247 struct node_qassign queues;
1531 yyerror("no child queues specified");
2405 if ($9.queues.qname != NULL) {
2406 if (strlcpy(r.qname, $9.queues.qname,
2412 free($9.queues.qname);
2414 if ($9.queues.pqname != NULL) {
2415 if (strlcpy(r.pqname, $9.queues.pqname,
2421 free($9.queues.pqname);
2547 if (filter_opts.queues
[all...]
/freebsd-13-stable/sys/dev/ixgbe/
H A Dif_fdir.c137 que = &adapter->queues[txr->me];
/freebsd-13-stable/sys/netpfil/pf/
H A Dpf_ruleset.c140 TAILQ_INIT(&ruleset->rules[i].queues[0]);
141 TAILQ_INIT(&ruleset->rules[i].queues[1]);
142 ruleset->rules[i].active.ptr = &ruleset->rules[i].queues[0];
143 ruleset->rules[i].inactive.ptr = &ruleset->rules[i].queues[1];
H A Dpf.h616 struct pf_rulequeue queues[2]; member in struct:pf_ruleset::__anon15462
/freebsd-13-stable/sys/dev/ice/
H A Dif_ice_iflib.c434 * before the Tx and Rx queues are allocated.
711 * logic which must wait until after the Tx and Rx queues have been
936 * @ntxqs: the number of Tx queues per set (should always be 1)
939 * Called by iflib to allocate Tx queues for the device. Allocates driver
956 /* Do not bother allocating queues if we're in recovery mode */
980 /* Assign queues from PF space to the main VSI */
983 device_printf(sc->dev, "Unable to assign PF queues: %s\n",
999 /* get the virtual and physical address of the hardware queues */
1028 * @nrxqs: number of Rx queues per set (should always be 1)
1031 * Called by iflib to allocate Rx queues fo
1304 int bar, queues, vectors, requested; local
[all...]
/freebsd-13-stable/sys/dev/neta/
H A Dif_mvnetavar.h78 #define MVNETA_IS_QUEUE_SET(queues, q) \
79 ((((queues) >> (q)) & 0x1))
94 * the ethernet device has 8 rx/tx DMA queues. each of queue has its own
/freebsd-13-stable/sys/dev/mpr/
H A Dmpr_pci.c362 q = &sc->queues[i];
409 if (sc->queues == NULL)
413 q = &sc->queues[i];
H A Dmpr.c389 * Size the queues. Since the reply queues always need one free
456 * Figure out the number of MSIx-based queues. If the firmware or
458 * the queues to be useful then don't enable multi-queue.
470 mpr_dprint(sc, MPR_INIT, "Sized queues to q=%d reqs=%d replies=%d\n",
681 "Failed to alloc queues with error %d\n", error);
686 /* Always initialize the queues */
709 * IOC treats the queues as full if both are set to the same value.
827 free(sc->queues, M_MPR);
828 sc->queues
1354 uint8_t *queues; local
[all...]
/freebsd-13-stable/sys/dev/mps/
H A Dmps_pci.c308 q = &sc->queues[i];
356 if (sc->queues == NULL)
360 q = &sc->queues[i];
H A Dmps.c388 * Size the queues. Since the reply queues always need one free
437 * Figure out the number of MSIx-based queues. If the firmware or
439 * the queues to be useful then don't enable multi-queue.
451 mps_dprint(sc, MPS_INIT, "Sized queues to q=%d reqs=%d replies=%d\n",
655 "Failed to alloc queues with error %d\n", error);
660 /* Always initialize the queues */
683 * IOC treats the queues as full if both are set to the same value.
799 free(sc->queues, M_MPT2);
800 sc->queues
1283 uint8_t *queues; local
[all...]
/freebsd-13-stable/usr.sbin/bhyve/
H A Dvirtio.c68 struct vqueue_info *queues)
78 vs->vs_queues = queues;
80 queues[i].vq_vs = vs;
81 queues[i].vq_num = i;
86 * Reset device (device-wide). This erases all queues, i.e.,
87 * all the queues become invalid (though we don't wipe out the
66 vi_softc_linkup(struct virtio_softc *vs, struct virtio_consts *vc, void *dev_softc, struct pci_devinst *pi, struct vqueue_info *queues) argument
H A Dvirtio.h45 * A virtual device has zero or more "virtual queues" (virtqueue).
166 * The number of queues is determinable via the PCI config space
174 * queue. (The number of possible queues depends on the virtual
258 #define VTCFG_ISR_QUEUES 0x01 /* re-scan queues */
295 * queues and some size (possibly 0) of configuration-space
354 int vc_nvq; /* number of virtual queues */
482 struct vqueue_info *queues);
/freebsd-13-stable/lib/libpfctl/
H A Dlibpfctl.h149 struct pfctl_rulequeue queues[2]; member in struct:pfctl_ruleset::__anon7691
/freebsd-13-stable/sys/dev/qlnx/qlnxe/
H A Decore_l2.c65 u32 queues; member in struct:ecore_l2_info
87 p_l2_info->queues = RESC_NUM(p_hwfn, ECORE_L2_QUEUE);
94 p_l2_info->queues = (u32)OSAL_MAX_T(u8, rx, tx);
99 p_l2_info->queues);
104 for (i = 0; i < p_l2_info->queues; i++) {
141 for (i = 0; i < p_hwfn->p_l2_info->queues; i++) {
151 if (i == p_hwfn->p_l2_info->queues)
174 if (queue_id > p_l2_info->queues) {
177 queue_id, p_l2_info->queues);
215 * For legacy vf-queues, th
[all...]
/freebsd-13-stable/sys/contrib/openzfs/module/zfs/
H A Ddmu_send.c80 * This tunable controls the length of the queues that zfs send worker threads
81 * use to communicate. If the send_main_thread is blocking on these queues,
88 * These tunables control the fill fraction of the queues by zfs send. The fill
91 * down. If the queues empty before the signalled thread can catch up, then
1388 * queues stored in the second one. The ranges are sorted in descending
1404 * For example, if the three ranges at the front of the queues were [2,4),
1507 * they're pulled off the queues. That will give us a stream that is
1517 bqueue_t *queues[NUM_THREADS]; local
1526 queues[REDACT_IDX] = NULL;
1530 queues[REDACT_ID
[all...]
/freebsd-13-stable/sys/net/
H A Diflib.c4859 /* Get memory for the station queues */
4869 * Now that we know how many queues there are, get the core offset.
5119 /* Get memory for the station queues */
5630 KASSERT(ntxqs > 0, ("number of queues per qset must be at least 1"));
5631 KASSERT(nrxqs > 0, ("number of queues per qset must be at least 1"));
5727 /* XXX this needs to be changed if #rx queues != #tx queues */
5934 * It is expected that the caller takes care of freeing queues if this
6061 /* TX queues get cores which share at least an L2 cache with the corresponding RX queue */
6066 /* RX queues ge
6446 int msgs, queuemsgs, queues, rx_queues, tx_queues, vectors; local
[all...]

Completed in 163 milliseconds

12