Lines Matching defs:tl
263 static void rs_tl_rm_old_stats(struct iwl_traffic_load *tl, u32 curr_time)
268 while (tl->queue_count &&
269 (tl->time_stamp < oldest_time)) {
270 tl->total -= tl->packet_count[tl->head];
271 tl->packet_count[tl->head] = 0;
272 tl->time_stamp += TID_QUEUE_CELL_SPACING;
273 tl->queue_count--;
274 tl->head++;
275 if (tl->head >= TID_QUEUE_MAX_SIZE)
276 tl->head = 0;
290 struct iwl_traffic_load *tl = NULL;
302 tl = &lq_data->load[tid];
307 if (!(tl->queue_count)) {
308 tl->total = 1;
309 tl->time_stamp = curr_time;
310 tl->queue_count = 1;
311 tl->head = 0;
312 tl->packet_count[0] = 1;
316 time_diff = TIME_WRAP_AROUND(tl->time_stamp, curr_time);
322 rs_tl_rm_old_stats(tl, curr_time);
324 index = (tl->head + index) % TID_QUEUE_MAX_SIZE;
325 tl->packet_count[index] = tl->packet_count[index] + 1;
326 tl->total = tl->total + 1;
328 if ((index + 1) > tl->queue_count)
329 tl->queue_count = index + 1;
372 struct iwl_traffic_load *tl = NULL;
377 tl = &(lq_data->load[tid]);
381 if (!(tl->queue_count))
384 time_diff = TIME_WRAP_AROUND(tl->time_stamp, curr_time);
390 rs_tl_rm_old_stats(tl, curr_time);
392 return tl->total;