class <Queue/CBQ> CBQueue : public Queue

Inheritance:

Public Fields

Queue/CBQ instvar compat_qlim_

Public Methods

virtual void addallot(int, double)

CBQueue()

virtual int command(int argc, const char*const* argv)

Packet* deque()

void enque(Packet*)

CBQClass* level(int n)

LinkDelay* link()

Packet* pending_pkt()

void recv(Packet*, Handler*)

void reset()

void sched()

Queue/CBQ instproc set args

int toplevel()

void toplevel_arrival(CBQClass*, double)

Protected Classes

enum eligible_type_

typedef int (CBQueue::*eligible_type_)(CBQClass*, double); eligible_type_ eligible_; // eligible function

Protected Fields

CBQClass* active_[MAXPRIO]

classes at prio of index

eligible_type_ eligible_

Event intr_

CBQClass* last_lender_

CBQClass* levels_[MAXLEVEL+1]

LL of classes per level

LinkDelay* link_

managed link

int maxlevel_

highest level seen

int maxpkt_

largest pkt (used by WRR)

int maxprio_

highest prio seen

Packet* pending_pkt_

queued packet

int toplevel_

for top-level LS

Protected Methods

int algorithm(const char *)

int eligible_ancestors(CBQClass*, double)

int eligible_formal(CBQClass*, double)

int eligible_toplevel(CBQClass* cl, double)

CBQClass* find_lender(CBQClass*, double)

virtual int insert_class(CBQClass*)

int send_permitted(CBQClass*, double)

void toplevel_departure(CBQClass*, double)

Protected

enum eligible_type_

typedef int (CBQueue::*eligible_type_)(CBQClass*, double); eligible_type_ eligible_; // eligible function

---

Inherited from Queue:

Public Methods

QueueElem <T> * dequeue()

virtual void destroy()

void detach(QueueElem<T>* e)

void enqueue(QueueElem<T> *e)

QueueElem <T> * getHead()

int is_empty()

int size()

Protected Fields

QueueElem <T> * head_

int size_

---

Documentation

CBQueue()

void reset()

void enque(Packet*)

void recv(Packet*, Handler*)

LinkDelay* link()

CBQClass* level(int n)

Packet* deque()

virtual int command(int argc, const char*const* argv)

virtual void addallot(int, double)

Packet* pending_pkt()

void sched()

int toplevel()

void toplevel_arrival(CBQClass*, double)

Event intr_

int algorithm(const char *)

virtual int insert_class(CBQClass*)

int send_permitted(CBQClass*, double)

CBQClass* find_lender(CBQClass*, double)

void toplevel_departure(CBQClass*, double)

CBQClass* last_lender_

Packet* pending_pkt_

queued packet

LinkDelay* link_

managed link

CBQClass* active_[MAXPRIO]

classes at prio of index

CBQClass* levels_[MAXLEVEL+1]

LL of classes per level

int maxprio_

highest prio seen

int maxpkt_

largest pkt (used by WRR)

int maxlevel_

highest level seen

int toplevel_

for top-level LS

enum eligible_type_

typedef int (CBQueue::*eligible_type_)(CBQClass*, double); eligible_type_ eligible_; // eligible function

eligible_type_ eligible_

int eligible_formal(CBQClass*, double)

int eligible_ancestors(CBQClass*, double)

int eligible_toplevel(CBQClass* cl, double)

Queue/CBQ instproc set args

Queue/CBQ instvar compat_qlim_

---

Direct child classes:

WRR_CBQueue

alphabetic index hierarchy of classes

---

this page has been generated automatically by doc++

Adapted for the NS documentation page

(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de