Lines Matching defs:slots
91 * Small indexes [0 ... SFQ_MAX_FLOWS - 1] are 'pointers' to slots[] array
116 unsigned int divisor; /* number of slots in hash table */
126 sfq_index *ht; /* Hash table ('divisor' slots) */
127 struct sfq_slot *slots; /* Flows table ('maxflows' entries) */
134 /* Linked lists of slots, indexed by depth
153 return &q->slots[val].dep;
206 struct sfq_slot *slot = &q->slots[x];
221 n = q->slots[x].dep.next; \
222 p = q->slots[x].dep.prev; \
235 d = q->slots[x].qlen--;
248 d = ++q->slots[x].qlen;
304 slot = &q->slots[x];
319 slot = &q->slots[x];
366 slot = &q->slots[x];
372 slot = &q->slots[x];
487 /* No active slots */
493 slot = &q->slots[a];
510 q->tail = NULL; /* no more active slots */
548 slot = &q->slots[i];
566 slot = &q->slots[x];
578 slot = &q->slots[x];
727 sfq_free(q->slots);
768 q->slots = sfq_alloc(sizeof(q->slots[0]) * q->maxflows);
769 if (!q->ht || !q->slots) {
778 slot_queue_init(&q->slots[i]);
871 const struct sfq_slot *slot = &q->slots[idx];