Lines Matching defs:rix0
323 u_int8_t *rix0, int *try0, u_int8_t *txrate)
433 *rix0 = rix;
448 uint8_t rix0, uint8_t *rix, uint8_t *try)
451 const struct txschedule *sched = &sn->sched[rix0];
453 KASSERT(rix0 == sched->r0, ("rix0 (%x) != sched->r0 (%x)!\n", rix0, sched->r0));
494 int rix0, int tries0,
507 if (!IS_RATE_DEFINED(sn, rix0))
509 tt = calc_usecs_unicast_packet(sc, size, rix0, short_tries,
536 if (sn->stats[size_bin][rix0].total_packets < ssc->smoothing_minpackets) {
538 int avg_tx = sn->stats[size_bin][rix0].average_tx_time;
539 int packets = sn->stats[size_bin][rix0].total_packets;
540 sn->stats[size_bin][rix0].average_tx_time = (tt+(avg_tx*packets))/(packets+1);
543 sn->stats[size_bin][rix0].average_tx_time =
544 ((sn->stats[size_bin][rix0].average_tx_time * ssc->smoothing_rate) +
550 sn->stats[size_bin][rix0].successive_failures++;
557 sn->stats[y][rix0].successive_failures++;
558 sn->stats[y][rix0].last_tx = ticks;
559 sn->stats[y][rix0].tries += tries;
560 sn->stats[y][rix0].total_packets++;
563 sn->stats[size_bin][rix0].packets_acked++;
564 sn->stats[size_bin][rix0].successive_failures = 0;
566 sn->stats[size_bin][rix0].tries += tries;
567 sn->stats[size_bin][rix0].last_tx = ticks;
568 sn->stats[size_bin][rix0].total_packets++;
570 if (rix0 == sn->current_sample_rix[size_bin]) {
577 rix0, short_tries, tries, tt,
578 sn->stats[size_bin][rix0].average_tx_time,
579 sn->stats[size_bin][rix0].perfect_tx_time);