Lines Matching refs:tries
915 rc[0].tries = sched->t0;
916 rc[1].tries = sched->t1;
919 rc[2].tries = rc[3].tries = 0;
921 rc[2].tries = sched->t2;
922 rc[3].tries = sched->t3;
955 * particular attempt. So, check if tries > tries0 and if so
967 int short_tries, int tries, int status,
989 if (tries > tries0) {
1003 * Ignore short tries count as contributing to failure.
1009 0 /* short_tries */, MIN(tries0, tries) - 1, is_ht40);
1029 sn->stats[size_bin][rix0].tries += tries;
1064 "%s: size %d %s %s rate %d %s tries (%d/%d) tt %d "
1072 short_tries, tries, tt,
1084 badrate(struct ath_softc *sc, int series, int hwrate, int tries, int status)
1088 "bad series%d hwrate 0x%x, tries %u ts_status 0x%x\n",
1089 series, hwrate, tries, status);
1208 dot11rate_label(rt, rc[0].rix), rc[0].tries,
1210 dot11rate_label(rt, rc[1].rix), rc[1].tries,
1212 dot11rate_label(rt, rc[2].rix), rc[2].tries,
1214 dot11rate_label(rt, rc[3].rix), rc[3].tries,
1218 if (rc[i].tries && !IS_RATE_DEFINED(sn, rc[i].rix))
1219 badrate(sc, 0, rc[i].ratecode, rc[i].tries,
1224 * This used to not penalise other tries because loss
1228 if (rc[0].tries) {
1230 rc[0].rix, rc[0].tries,
1234 long_tries -= rc[0].tries;
1237 if (rc[1].tries && finalTSIdx > 0) {
1239 rc[1].rix, rc[1].tries,
1243 long_tries -= rc[1].tries;
1246 if (rc[2].tries && finalTSIdx > 1) {
1248 rc[2].rix, rc[2].tries,
1252 long_tries -= rc[2].tries;
1255 if (rc[3].tries && finalTSIdx > 2) {
1257 rc[3].rix, rc[3].tries,
1387 sn->stats[y][rix].tries = 0;
1553 (uintmax_t) sn->stats[y][rix].tries,