67 		if (mi->r[i].rix == rix)  in rix_to_ndx()
69 	WARN_ON(mi->r[i].rix != rix);  in rix_to_ndx()
99 		struct minstrel_rate *mr = &mi->r[i];  in minstrel_update_stats()
139 		struct minstrel_rate *mr = &mi->r[i];  in minstrel_update_stats()
152 		struct minstrel_rate *mr = &mi->r[i];  in minstrel_update_stats()
185 		mi->r[ndx].attempts += ar[i].count;  in minstrel_tx_status()
188 			mi->r[ndx].success += success;  in minstrel_tx_status()
290 		msr = &mi->r[sample_ndx];  in minstrel_get_rate()
293 			mi->r[ndx].perfect_tx_time);  in minstrel_get_rate()
320 	if (!mrr && sample && (mi->r[ndx].probability > 17100))  in minstrel_get_rate()
323 	ar[0].idx = mi->r[ndx].rix;  in minstrel_get_rate()
324 	ar[0].count = minstrel_get_retry_count(&mi->r[ndx], info);  in minstrel_get_rate()
346 		ar[i].idx = mi->r[mrr_ndx[i - 1]].rix;  in minstrel_get_rate()
347 		ar[i].count = mi->r[mrr_ndx[i - 1]].adjusted_retry_count;  in minstrel_get_rate()
409 		struct minstrel_rate *mr = &mi->r[n];  in minstrel_rate_init()
454 		struct minstrel_rate *mr = &mi->r[i];  in minstrel_rate_init()
484 	mi->r = kzalloc(sizeof(struct minstrel_rate) * max_rates, gfp);  in minstrel_alloc_sta()
485 	if (!mi->r)  in minstrel_alloc_sta()
496 	kfree(mi->r);  in minstrel_alloc_sta()
508 	kfree(mi->r);  in minstrel_free_sta()