Lines Matching +full:1 +full:c
41 int cur_fs; /* used in generation, between 0 and max_y - 1 */
76 int state; /* 0 = going up (enqueue), 1: going down (dequeue) */
84 * 2^{i-1}+1 .. 2^i entries.
86 #define BACKLOG 30 /* this many backlogged classes, we only need BACKLOG+1 */
98 #define FI2Q(c, i) ((struct dn_queue *)((c)->q + (c)->q_len * (i))) argument
99 #define Q2FI(c, q) (((char *)(q) - (c)->q)/(c)->q_len) argument
105 static void controller(struct cfg_s *c);
112 drop(struct cfg_s *c, struct mbuf *m) in drop() argument
117 c->drop++; in drop()
118 q = FI2Q(c, m->flow_id); in drop()
124 c->llmask &= ~(1<<(i+1)); in drop()
125 c->llmask |= (1<<(i)); in drop()
127 list_add_tail(h, &c->ll[i]); in drop()
129 m->m_nextpkt = c->freelist; in drop()
130 c->freelist = m; in drop()
168 gnet_stats_enq(struct cfg_s *c, struct mbuf *mb) in gnet_stats_enq() argument
170 struct dn_sch_inst *si = c->si; in gnet_stats_enq()
171 struct dn_queue *_q = FI2Q(c, mb->flow_id); in gnet_stats_enq()
173 if (_q->ni.length == 1) { in gnet_stats_enq()
180 gnet_stats_deq(struct cfg_s *c, struct mbuf *mb) in gnet_stats_deq() argument
182 struct dn_sch_inst *si = c->si; in gnet_stats_deq()
183 struct dn_queue *_q = FI2Q(c, mb->flow_id); in gnet_stats_deq()
192 double weight = (double)_q->fs->fs.par[0] / c->wsum; in gnet_stats_deq()
195 if (c->q_wfi[mb->flow_id] < wfi) in gnet_stats_deq()
196 c->q_wfi[mb->flow_id] = wfi; in gnet_stats_deq()
201 mainloop(struct cfg_s *c) in mainloop() argument
206 for (i=0; i < c->loops; i++) { in mainloop()
208 controller(c); in mainloop()
210 i, c->_enqueue, c->tosend, c->can_dequeue); in mainloop()
211 if ( (m = c->tosend) ) { in mainloop()
213 struct dn_queue *q = FI2Q(c, m->flow_id); in mainloop()
214 c->_enqueue++; in mainloop()
215 ret = c->enq(c->si, q, m); in mainloop()
217 drop(c, m); in mainloop()
225 c->pending++; in mainloop()
226 gnet_stats_enq(c, m); in mainloop()
228 } else if (c->can_dequeue) { in mainloop()
230 c->dequeue++; in mainloop()
231 m = c->deq(c->si); in mainloop()
233 c->pending--; in mainloop()
234 drop(c, m); in mainloop()
235 c->drop--; /* compensate */ in mainloop()
236 gnet_stats_deq(c, m); in mainloop()
238 D("--- ouch, cannot operate on iteration %d, pending %d", i, c->pending); in mainloop()
243 DX(1, "mainloop ends %d", i); in mainloop()
248 dump(struct cfg_s *c) in dump() argument
252 for (i=0; i < c->flows; i++) { in dump()
253 //struct dn_queue *q = FI2Q(c, i); in dump()
254 ND(1, "queue %4d tot %10llu", i, in dump()
257 DX(1, "done %d loops\n", c->loops); in dump()
275 l = -1; in getnum()
317 parse_flowsets(struct cfg_s *c, const char *fs) in parse_flowsets() argument
325 DX(3, "--- pass %d flows %d flowsets %d", pass, c->flows, c->flowsets); in parse_flowsets()
327 if (c->fs_config) in parse_flowsets()
329 c->fs_config, fs); in parse_flowsets()
330 c->fs_config = fs; in parse_flowsets()
332 s = c->fs_config ? strdup(c->fs_config) : NULL; in parse_flowsets()
346 w = 1; in parse_flowsets()
347 w_h = p ? getnum(p+1, &p, "weight_max") : w; in parse_flowsets()
348 w_steps = p ? getnum(p+1, &p, "w_steps") : (w_h == w ?1:2); in parse_flowsets()
352 len_h = p ? getnum(p+1, &p, "len_max") : len; in parse_flowsets()
353 l_steps = p ? getnum(p+1, &p, "l_steps") : (len_h == len ? 1 : 2); in parse_flowsets()
356 flows = 1; in parse_flowsets()
366 wi = w + ((w_h - w)* i)/(w_steps == 1 ? 1 : (w_steps-1)); in parse_flowsets()
368 struct dn_fs *fs = &c->fs[n_fs].fs; // tentative in parse_flowsets()
371 li = len + ((len_h - len)* j)/(l_steps == 1 ? 1 : (l_steps-1)); in parse_flowsets()
377 if (c->fs == NULL || c->flowsets <= n_fs) { in parse_flowsets()
383 fs->par[1] = li; in parse_flowsets()
395 c->flows = n_flows; in parse_flowsets()
396 c->flowsets = n_fs; in parse_flowsets()
397 c->wsum = wsum; in parse_flowsets()
402 DX(1,"%d flows on %d flowsets", c->flows, c->flowsets); in parse_flowsets()
404 c->max_y = prev ? prev->base_y + prev->y : 0; in parse_flowsets()
405 DX(1,"%d flows on %d flowsets max_y %d", c->flows, c->flowsets, c->max_y); in parse_flowsets()
407 for (i=0; i < c->flowsets; i++) { in parse_flowsets()
408 struct dn_fs *fs = &c->fs[i].fs; in parse_flowsets()
409 DX(1, "fs %3d w %5d l %4d flow %5d .. %5d y %6d .. %6d", in parse_flowsets()
410 i, fs->par[0], fs->par[1], in parse_flowsets()
414 struct dn_queue *q = FI2Q(c, j); in parse_flowsets()
415 q->fs = &c->fs[i]; in parse_flowsets()
433 init(struct cfg_s *c) in init() argument
436 int ac = c->ac; in init()
437 char * const *av = c->av; in init()
439 c->si_len = sizeof(struct dn_sch_inst); in init()
440 c->q_len = sizeof(struct dn_queue); in init()
444 c->th_min = -1; /* 1 packet per flow */ in init()
445 c->th_max = -20;/* 20 packets per flow */ in init()
446 c->lmin = c->lmax = 1280; /* packet len */ in init()
447 c->flows = 1; in init()
448 c->flowsets = 1; in init()
449 c->name = "null"; in init()
451 while (ac > 1) { in init()
453 c->loops = getnum(av[1], NULL, av[0]); in init()
455 debug = atoi(av[1]); in init()
457 if (!strcmp(av[1], "rr")) in init()
459 else if (!strcmp(av[1], "wf2qp")) in init()
461 else if (!strcmp(av[1], "fifo")) in init()
463 else if (!strcmp(av[1], "qfq")) in init()
466 else if (!strcmp(av[1], "qfq+") || in init()
467 !strcmp(av[1], "qfqp") ) in init()
471 else if (!strcmp(av[1], "kps")) in init()
476 c->name = mod ? mod->name : "NULL"; in init()
477 DX(3, "using scheduler %s", c->name); in init()
479 c->lmin = getnum(av[1], NULL, av[0]); in init()
480 c->lmax = c->lmin; in init()
481 DX(3, "setting max to %d", c->th_max); in init()
484 c->maxburst = getnum(av[1], NULL, av[0]); in init()
485 DX(3, "setting max to %d", c->th_max); in init()
488 c->th_max = getnum(av[1], NULL, av[0]); in init()
489 DX(3, "setting max to %d", c->th_max); in init()
491 c->th_min = getnum(av[1], NULL, av[0]); in init()
492 DX(3, "setting min to %d", c->th_min); in init()
494 c->flows = getnum(av[1], NULL, av[0]); in init()
495 DX(3, "setting flows to %d", c->flows); in init()
497 parse_flowsets(c, av[1]); /* first pass */ in init()
498 DX(3, "setting flowsets to %d", c->flowsets); in init()
505 if (c->maxburst <= 0) in init()
506 c->maxburst = 1; in init()
508 if (c->loops <= 0) in init()
509 c->loops = 1; in init()
510 if (c->flows <= 0) in init()
511 c->flows = 1; in init()
512 if (c->flowsets <= 0) in init()
513 c->flowsets = 1; in init()
514 if (c->lmin <= 0) in init()
515 c->lmin = 1; in init()
516 if (c->lmax <= 0) in init()
517 c->lmax = 1; in init()
519 if (c->th_min < 0) in init()
520 c->th_min = c->flows * -c->th_min; in init()
521 if (c->th_max < 0) in init()
522 c->th_max = c->flows * -c->th_max; in init()
523 if (c->th_max <= c->th_min) in init()
524 c->th_max = c->th_min + 1; in init()
532 c->enq = p->enqueue; in init()
533 c->deq = p->dequeue; in init()
534 c->si_len += p->si_datalen; in init()
535 c->q_len += p->q_datalen; in init()
536 c->schk_len += p->schk_datalen; in init()
538 /* make sure c->si has room for a queue */ in init()
539 c->enq = default_enqueue; in init()
540 c->deq = default_dequeue; in init()
544 D("using %d flows, %d flowsets", c->flows, c->flowsets); in init()
546 c->q_len, (int)sizeof(struct dn_fsk), in init()
547 c->si_len, c->schk_len); in init()
548 c->sched = calloc(1, c->schk_len); /* one parent scheduler */ in init()
549 c->si = calloc(1, c->si_len); /* one scheduler instance */ in init()
550 c->fs = calloc(c->flowsets, sizeof(struct dn_fsk)); in init()
551 c->q = calloc(c->flows, c->q_len); /* one queue per flow */ in init()
552 c->q_wfi = calloc(c->flows, sizeof(double)); /* stats, one per flow */ in init()
553 if (!c->sched || !c->si || !c->fs || !c->q || !c->q_wfi) { in init()
555 exit(1); in init()
557 c->si->sched = c->sched; /* link scheduler instance to template */ in init()
561 p->config(c->si->sched); in init()
563 p->new_sched(c->si); in init()
566 parse_flowsets(c, NULL); /* second pass */ in init()
568 for (i = 0; i < c->flowsets; i++) { in init()
569 struct dn_fsk *fsk = &c->fs[i]; in init()
570 if (fsk->fs.par[1] == 0) in init()
571 fsk->fs.par[1] = 1000; /* default pkt len */ in init()
572 fsk->sched = c->si->sched; in init()
583 INIT_LIST_HEAD(&c->ll[i]); in init()
585 for (i = 0; i < c->flows; i++) { in init()
586 struct dn_queue *q = FI2Q(c, i); in init()
588 q->fs = &c->fs[0]; /* XXX */ in init()
589 q->_si = c->si; in init()
593 list_add_tail(&q->ni.h, &c->ll[0]); in init()
595 c->llmask = 1; /* all flows are in the first list */ in init()
602 struct cfg_s c; in main() local
607 bzero(&c, sizeof(c)); in main()
608 c.ac = ac; in main()
609 c.av = av; in main()
610 init(&c); in main()
611 gettimeofday(&c.time, NULL); in main()
612 D("th_min %d th_max %d", c.th_min, c.th_max); in main()
614 mainloop(&c); in main()
618 timersub(&end, &c.time, &c.time); in main()
620 ll = c.time.tv_sec*1000000 + c.time.tv_usec; in main()
622 ll /= c._enqueue; in main()
623 sprintf(msg, "1::%d", c.flows); in main()
624 for (i = 0; i < c.flows; i++) { in main()
625 if (c.wfi < c.q_wfi[i]) in main()
626 c.wfi = c.q_wfi[i]; in main()
630 c.name, (int)c.time.tv_sec, (int)c.time.tv_usec / 1000, ll, in main()
631 (unsigned long)c._enqueue, (unsigned long)c.dequeue, c.wfi, in main()
632 c.fs_config ? c.fs_config : msg); in main()
633 dump(&c); in main()
634 DX(1, "done ac %d av %p", ac, av); in main()
636 DX(1, "arg %d %s", i, av[i]); in main()
642 * (the packet is in c->tosend) and/or receive (flag c->can_dequeue)
645 controller(struct cfg_s *c) in controller() argument
652 if (c->state == 0 && c->pending >= (uint32_t)c->th_max) in controller()
653 c->state = 1; in controller()
654 else if (c->state == 1 && c->pending <= (uint32_t)c->th_min) in controller()
655 c->state = 0; in controller()
656 ND(1, "state %d pending %2d", c->state, c->pending); in controller()
657 c->can_dequeue = c->state; in controller()
658 c->tosend = NULL; in controller()
659 if (c->can_dequeue) in controller()
667 if (1) { in controller()
672 i = ffs(c->llmask) - 1; in controller()
675 c->can_dequeue = 1; in controller()
678 h = &c->ll[i]; in controller()
679 ND(1, "backlog %d p %p prev %p next %p", i, h, h->prev, h->next); in controller()
682 flow_id = Q2FI(c, q); in controller()
686 c->llmask &= ~(1<<i); in controller()
688 ND(1, "before %d p %p prev %p next %p", i+1, h+1, h[1].prev, h[1].next); in controller()
689 list_add_tail(&q->ni.h, h+1); in controller()
690 ND(1, " after %d p %p prev %p next %p", i+1, h+1, h[1].prev, h[1].next); in controller()
692 ND(2, "backlog %d full", i+1); in controller()
693 c->llmask |= 1<<(1+i); in controller()
698 c->cur_fs = q->fs - c->fs; in controller()
703 if (c->cur_y >= c->max_y) { /* handle wraparound */ in controller()
704 c->cur_y = 0; in controller()
705 c->cur_fs = 0; in controller()
707 fs = &c->fs[c->cur_fs].fs; in controller()
711 c->cur_y++; in controller()
712 if (c->cur_y >= fs->next_y) in controller()
713 c->cur_fs++; in controller()
718 if (c->freelist) { in controller()
719 m = c->tosend = c->freelist; in controller()
720 c->freelist = c->freelist->m_nextpkt; in controller()
722 m = c->tosend = calloc(1, sizeof(struct mbuf)); in controller()
727 //m->cfg = c; in controller()
729 m->m_pkthdr.len = fs->par[1]; // XXX maxlen in controller()
733 c->cur_y, m->flow_id, c->cur_fs, in controller()