hfsc_class
cl = kzalloc_obj(struct hfsc_class);
hfsc_destroy_class(struct Qdisc *sch, struct hfsc_class *cl)
struct hfsc_class *cl = (struct hfsc_class *)arg;
static struct hfsc_class *
struct hfsc_class *head, *cl;
cl = (struct hfsc_class *)res.class;
struct hfsc_class *cl = (struct hfsc_class *)arg;
struct hfsc_class *cl = (struct hfsc_class *)arg;
struct hfsc_class *cl = (struct hfsc_class *)arg;
struct hfsc_class *cl_parent; /* parent class */
struct hfsc_class *p = (struct hfsc_class *)parent;
struct hfsc_class *cl = hfsc_find_class(classid, sch);
struct hfsc_class *cl = (struct hfsc_class *)arg;
struct hfsc_class *cl = (struct hfsc_class *)arg;
hfsc_dump_curves(struct sk_buff *skb, struct hfsc_class *cl)
struct hfsc_class *cl = (struct hfsc_class *)arg;
struct hfsc_class *cl = (struct hfsc_class *)arg;
struct hfsc_class *cl;
struct hfsc_class *cl;
hfsc_reset_class(struct hfsc_class *cl)
struct hfsc_class *cl;
struct hfsc_class *cl;
struct hfsc_class *cl;
struct hfsc_class *cl;
struct hfsc_class root; /* root class */
static bool cl_in_el_or_vttree(struct hfsc_class *cl)
eltree_insert(struct hfsc_class *cl)
struct hfsc_class *cl1;
cl1 = rb_entry(parent, struct hfsc_class, el_node);
eltree_remove(struct hfsc_class *cl)
eltree_update(struct hfsc_class *cl)
static inline struct hfsc_class *
struct hfsc_class *p, *cl = NULL;
p = rb_entry(n, struct hfsc_class, el_node);
static inline struct hfsc_class *
return rb_entry(n, struct hfsc_class, el_node);
vttree_insert(struct hfsc_class *cl)
struct hfsc_class *cl1;
cl1 = rb_entry(parent, struct hfsc_class, vt_node);
vttree_remove(struct hfsc_class *cl)
vttree_update(struct hfsc_class *cl)
static inline struct hfsc_class *
vttree_firstfit(struct hfsc_class *cl, u64 cur_time)
struct hfsc_class *p;
p = rb_entry(n, struct hfsc_class, vt_node);
static struct hfsc_class *
vttree_get_minvt(struct hfsc_class *cl, u64 cur_time)
cftree_insert(struct hfsc_class *cl)
struct hfsc_class *cl1;
cl1 = rb_entry(parent, struct hfsc_class, cf_node);
cftree_remove(struct hfsc_class *cl)
cftree_update(struct hfsc_class *cl)
init_ed(struct hfsc_class *cl, unsigned int next_len)
update_ed(struct hfsc_class *cl, unsigned int next_len)
update_d(struct hfsc_class *cl, unsigned int next_len)
update_cfmin(struct hfsc_class *cl)
struct hfsc_class *p;
p = rb_entry(n, struct hfsc_class, cf_node);
init_vf(struct hfsc_class *cl, unsigned int len)
struct hfsc_class *max_cl;
max_cl = rb_entry(n, struct hfsc_class, vt_node);
update_vf(struct hfsc_class *cl, unsigned int len, u64 cur_time)
hfsc_adjust_levels(struct hfsc_class *cl)
struct hfsc_class *p;
static inline struct hfsc_class *
return container_of(clc, struct hfsc_class, cl_common);
hfsc_change_rsc(struct hfsc_class *cl, struct tc_service_curve *rsc,
hfsc_change_fsc(struct hfsc_class *cl, struct tc_service_curve *fsc)
hfsc_change_usc(struct hfsc_class *cl, struct tc_service_curve *usc,
hfsc_upgrade_rt(struct hfsc_class *cl)
struct hfsc_class *cl = (struct hfsc_class *)*arg;
struct hfsc_class *parent = NULL;