Lines Matching defs:index
59 QFQ_MAX_INDEX is the maximum index allowed for a group. We need
60 one bit per index.
67 ^.__grp->index = 0
72 The max group index corresponds to Lmax/w_min, where
99 * group with the smallest index that can support the L_i / r_i configured
102 * grp->index is the index of the group; and grp->slot_shift
148 /* group we belong to. In principle we would need the index,
172 unsigned int index; /* Group index. */
229 * Calculate a flow index, given its weight and maximum packet length.
230 * index = log_2(maxlen/weight) but we need to apply the scaling.
237 int index = 0;
243 index = __fls(size_map) + 1; /* basically a log_2 */
244 index -= !(slot_size - (1ULL << (index + min_slot_shift - 1)));
246 if (index < 0)
247 index = 0;
250 (unsigned long) ONE_FP/inv_w, maxlen, index);
252 return index;
736 /* return the pointer to the group with lowest index in the bitmap */
740 int index = __ffs(bitmap);
741 return &q->groups[index];
758 unsigned long mask = mask_from(q->bitmaps[ER], grp->index);
784 static void qfq_unblock_groups(struct qfq_sched *q, int index, u64 old_F)
786 unsigned long mask = mask_from(q->bitmaps[ER], index + 1);
795 mask = (1UL << index) - 1;
830 * The index of the slot in which the input aggregate agg is to be
837 * QFQ+ fully satisfies this bound to the slot index if the parameters
843 * the timestamps of agg are low enough that the slot index is never
849 * upper bound to the slot index guaranteed by QFQ+ grows to
856 * index is never higher than QFQ_MAX_SLOTS-2. This backward-shift may
862 * the slot index, and 2 < QFQ_MAX_SLOTS-2. Hence the aggregates whose
866 * The other event that may cause the slot index to be higher than 2
876 * may cause the above bound to the slot index to be violated for some
880 * quite complex, the above-discussed capping of the slot index is
888 unsigned int i; /* slot index in the bucket list */
934 grp->index, grp->full_slots);
950 * we move the index down (modulo QFQ_MAX_SLOTS) so we don't need to
1055 mask = mask_from(q->bitmaps[ER], agg->grp->index);
1197 __clear_bit(grp->index, &q->bitmaps[ER]);
1207 __clear_bit(grp->index, &q->bitmaps[ER]);
1209 __set_bit(grp->index, &q->bitmaps[s]);
1212 qfq_unblock_groups(q, grp->index, old_F);
1314 __clear_bit(grp->index, &q->bitmaps[IR]);
1315 __clear_bit(grp->index, &q->bitmaps[IB]);
1323 __set_bit(grp->index, &q->bitmaps[s]);
1391 __clear_bit(grp->index, &q->bitmaps[IR]);
1392 __clear_bit(grp->index, &q->bitmaps[EB]);
1393 __clear_bit(grp->index, &q->bitmaps[IB]);
1395 if (test_bit(grp->index, &q->bitmaps[ER]) &&
1396 !(q->bitmaps[ER] & ~((1UL << grp->index) - 1))) {
1397 mask = q->bitmaps[ER] & ((1UL << grp->index) - 1);
1405 __clear_bit(grp->index, &q->bitmaps[ER]);
1410 __clear_bit(grp->index, &q->bitmaps[ER]);
1411 __clear_bit(grp->index, &q->bitmaps[IR]);
1412 __clear_bit(grp->index, &q->bitmaps[EB]);
1413 __clear_bit(grp->index, &q->bitmaps[IB]);
1417 __set_bit(grp->index, &q->bitmaps[s]);
1458 grp->index = i;