Searched refs:packets (Results 1 - 23 of 23) sorted by relevance

/darwin-on-arm/xnu/bsd/net/classq/
H A Dclassq.h101 u_int64_t packets; member in struct:pktcntr
115 u_int32_t qlen; /* Queue length (in number of packets) */
117 u_int32_t qlim; /* Queue limit (in number of packets*) */
124 #define qlimit(q) (q)->qlim /* Max packets to be queued */
139 (_cntr)->packets += (_pkt); \
144 (_cntr)->packets = 0; \
149 #define CLASSQF_ECN4 0x01 /* use packet marking for IPv4 packets */
150 #define CLASSQF_ECN6 0x02 /* use packet marking for IPv6 packets */
H A Dclassq_blue.c322 u_int32_t *packets, u_int32_t *bytes)
335 if (packets != NULL)
336 *packets = cnt;
321 blue_purgeq(struct blue *bp, class_queue_t *q, u_int32_t flow, u_int32_t *packets, u_int32_t *bytes) argument
H A Dclassq_red.c142 * N packets for q_avg to reach 63% of L.
143 * when q_weight is 0.002, N is about 500 packets.
144 * for a slow link like dial-up, 500 packets takes more than 1 minute!
145 * when q_weight is 0.008, N is about 127 packets.
146 * when q_weight is 0.016, N is about 63 packets.
147 * bursts of 50 packets are allowed for 0.002, bursts of 25 packets
335 * if we were idle, we pretend that n packets arrived during
495 red_purgeq(struct red *rp, class_queue_t *q, u_int32_t flow, u_int32_t *packets, argument
509 if (packets !
[all...]
H A Dclassq_rio.c495 rio_purgeq(struct rio *rp, class_queue_t *q, u_int32_t flow, u_int32_t *packets, argument
509 if (packets != NULL)
510 *packets = cnt;
H A Dif_classq.h45 CLASSQRQ_PURGE = 1, /* purge all packets */
48 CLASSQRQ_THROTTLE = 4, /* throttle packets */
55 u_int32_t packets; /* (out) purged packets */ member in struct:cqrq_purge_sc
71 * dequeue packets from the output queue. Modern cards are able to buffer
72 * a large amount of packets and dequeue too many packets at a time. This
73 * bursty dequeue behavior makes it impossible to schedule packets by
136 * associated with the packets. The service class index of the
296 (_packets) = _req.packets; \
[all...]
H A Dclassq_sfb.c1065 * and thus bin information for these packets is not known, we do
1066 * not change accounting information while dequeuing these packets.
1091 sfb_purgeq(struct sfb *sp, class_queue_t *q, u_int32_t flow, u_int32_t *packets, argument
1105 if (packets != NULL)
1106 *packets = cnt;
/darwin-on-arm/xnu/bsd/net/altq/
H A Dif_altq.h65 ALTRQ_PURGE = CLASSQRQ_PURGE, /* purge all packets */
68 ALTRQ_THROTTLE = CLASSQRQ_THROTTLE, /* throttle packets */
142 (_packets) = _req.packets; \
/darwin-on-arm/xnu/bsd/net/
H A Dntstat.h325 void nstat_route_tx(struct rtentry *rte, u_int32_t packets, u_int32_t bytes, u_int32_t flags);
326 void nstat_route_rx(struct rtentry *rte, u_int32_t packets, u_int32_t bytes, u_int32_t flags);
H A Dif_mib.c138 ifmd.ifmd_snd_drops = ifp->if_snd.ifcq_dropcnt.packets;
H A Dpf_ioctl.c230 * and used in pf_af_hook() for performance optimization, such that packets
1434 pf_state_counter_to_pfsync(s->packets[0], sp->packets[0]);
1435 pf_state_counter_to_pfsync(s->packets[1], sp->packets[1]);
1487 s->packets[0] = s->packets[1] = 0;
1959 rule->packets[0] = rule->packets[1] = 0;
3047 rule->evaluations = rule->packets[
[all...]
H A Dntstat.c616 u_int32_t packets,
631 OSAddAtomic64((SInt64)packets, (SInt64*)&stats->nstat_txpackets);
643 u_int32_t packets,
654 OSAddAtomic64((SInt64)packets, (SInt64*)&stats->nstat_rxpackets);
614 nstat_route_tx( struct rtentry *rte, u_int32_t packets, u_int32_t bytes, u_int32_t flags) argument
641 nstat_route_rx( struct rtentry *rte, u_int32_t packets, u_int32_t bytes, u_int32_t flags) argument
H A Dpf.c5267 r->packets[dirndx]++;
5281 r->packets[dirndx]++;
5499 gs->packets[0] = gs->packets[1] = 0;
6057 /* Ease sequencing restrictions on no data packets */
6195 pd->p_len, ackskew, (*state)->packets[0],
6196 (*state)->packets[1],
6253 (*state)->packets[0], (*state)->packets[1],
6271 /* Any packets whic
[all...]
H A Dpfvar.h694 u_int64_t packets[2]; member in struct:pf_rule
885 u_int64_t packets[2]; member in struct:pf_src_node
907 #define PFSS_DATA_TS 0x0040 /* timestamp on data packets */
908 #define PFSS_DATA_NOTS 0x0080 /* no timestamp on data packets */
1046 u_int64_t packets[2]; member in struct:pf_state
1113 u_int32_t packets[2][2]; member in struct:pfsync_state
1719 #define PFFRAG_FRAG_HIWAT 1000 /* Number of fragmented packets */
H A Dpf_norm.c1577 r->packets[dir == PF_OUT]++;
1581 /* Check for illegal packets */
1854 r->packets[dir == PF_OUT]++;
1858 /* Check for illegal packets */
2148 r->packets[dir == PF_OUT]++;
2497 * gives us a set of rules for rejecting packets on
2498 * long fat pipes (packets that were somehow delayed
2504 * inserting packets into a connection.
2539 * network conditions that re-order packets and
2636 * stacks, we will only require timestamps on data packets
[all...]
H A Ddlil.c468 "ilog2 of EWMA decay rate of avg inbound packets");
492 IF_RXPOLL_INTERVAL_PKTS, "input poll interval (packets)");
509 "max packets per poll call");
574 u_int32_t plowat; /* packets low watermark */
575 u_int32_t phiwat; /* packets high watermark */
939 * low and high watermarks for outstanding inbound packets/bytes.
1467 * a) handles all inbound packets for lo0
1468 * b) handles all inbound packets for interfaces with no dedicated
1523 * safeguards if we deal with long chains of packets.
1589 /* Free up pending packets */
[all...]
H A Dif.c1340 u_int32_t *packets, u_int32_t *bytes, int ifq_locked)
1366 if (packets != NULL)
1367 *packets = cnt + a_cnt;
1339 if_qflush_sc(struct ifnet *ifp, mbuf_svc_class_t sc, u_int32_t flow, u_int32_t *packets, u_int32_t *bytes, int ifq_locked) argument
H A Drtsock.c1693 ifp->if_snd.ifcq_dropcnt.packets;
/darwin-on-arm/xnu/bsd/net/pktsched/
H A Dpktsched_priq.c215 /* discard all the queued packets on the interface */
232 * packets managed by ifcq_disc and altq_disc instances, which
255 pr->flow, &pr->packets, &pr->bytes);
259 pr->packets = 0;
265 pr->packets += cnt;
775 u_int32_t *packets, u_int32_t *bytes)
831 if (packets != NULL)
832 *packets = cnt;
774 priq_purgeq(struct priq_if *pif, struct priq_class *cl, u_int32_t flow, u_int32_t *packets, u_int32_t *bytes) argument
H A Dpktsched_tcq.c187 /* discard all the queued packets on the interface */
204 * packets managed by ifcq_disc and altq_disc instances, which
227 pr->flow, &pr->packets, &pr->bytes);
231 pr->packets = 0;
237 pr->packets += cnt;
736 u_int32_t *packets, u_int32_t *bytes)
787 if (packets != NULL)
788 *packets = cnt;
735 tcq_purgeq(struct tcq_if *tif, struct tcq_class *cl, u_int32_t flow, u_int32_t *packets, u_int32_t *bytes) argument
H A Dpktsched_qfq.c314 /* discard all the queued packets on the interface */
331 * packets managed by ifcq_disc and altq_disc instances, which
354 pr->flow, &pr->packets, &pr->bytes);
358 pr->packets = 0;
364 pr->packets += cnt;
1409 u_int32_t *packets, u_int32_t *bytes)
1468 if (packets != NULL)
1469 *packets = cnt;
1408 qfq_purgeq(struct qfq_if *qif, struct qfq_class *cl, u_int32_t flow, u_int32_t *packets, u_int32_t *bytes) argument
H A Dpktsched_fairq.c275 /* discard all the queued packets on the interface */
292 * packets managed by ifcq_disc and altq_disc instances, which
1085 u_int32_t *packets, u_int32_t *bytes)
1145 if (packets != NULL)
1146 *packets = _cnt;
1084 fairq_purgeq(struct fairq_if *fif, struct fairq_class *cl, u_int32_t flow, u_int32_t *packets, u_int32_t *bytes) argument
H A Dpktsched_rmclass.c194 * maxq max allowable queue size for class (in packets).
201 * parameter determines how large an initial burst of packets
619 * Free packets in the packet queue.
722 * is the maximum number of packets that the resource management
1483 * if a class with packets to send if over its bandwidth limit & can't
1502 rmc_drop(struct rm_class *cl, u_int32_t flow, u_int32_t *packets, argument
1544 if (packets != NULL)
1545 *packets = pkt;
1607 * Since packets are phased randomly with respect to the
H A Dpktsched_hfsc.c305 /* discard all the queued packets on the interface */
321 * packets managed by ifcq_disc and altq_disc instances, which
1018 u_int32_t *packets, u_int32_t *bytes)
1079 if (packets != NULL)
1080 *packets = cnt;
1017 hfsc_purgeq(struct hfsc_if *hif, struct hfsc_class *cl, u_int32_t flow, u_int32_t *packets, u_int32_t *bytes) argument

Completed in 203 milliseconds