rm_class_t
rm_class_t *cl, *borrowed;
rm_class_t *borrows;
_rmc_addq(rm_class_t *cl, struct mbuf *m)
_rmc_dropq(rm_class_t *cl)
_rmc_getq(rm_class_t *cl)
_rmc_pollq(rm_class_t *cl)
void (*action)(rm_class_t *, rm_class_t *), int maxq,
rm_class_t *t = cl, *p;
rmc_depth_recompute(rm_class_t *cl)
rm_class_t *p, *t;
rm_class_t *t;
rm_class_t *p, *bp;
rm_class_t *p;
rm_class_t *p = cl;
static void rmc_depth_recompute(rm_class_t *);
rm_class_t *top;
static int _rmc_addq(rm_class_t *, struct mbuf *);
static void _rmc_dropq(rm_class_t *);
static struct mbuf *_rmc_getq(rm_class_t *);
static struct mbuf *_rmc_pollq(rm_class_t *);
rm_class_t *children_; /* Children of this class */
rm_class_t *next_; /* Next pointer, used if child */
rm_class_t *peer_; /* Peer class */
rm_class_t *borrow_; /* Borrow class */
rm_class_t *parent_; /* Parent class */
rm_class_t *active_[RM_MAXPRIO]; /* Active cl's in each pri */
rm_class_t *default_; /* Default Pkt class, BE */
rm_class_t *root_; /* Root Link class. */
rm_class_t *ctl_; /* Control Traffic class. */
rm_class_t *borrowed_[RM_MAXQUEUED]; /* Class borrowed last */
rm_class_t *class_[RM_MAXQUEUED]; /* class sending */
rm_class_t *pollcache_; /* cached rm_class by poll operation */
rm_class_t *rmc_newclass(int, struct rm_ifdat *, u_int,