weight
int weight = 0;
for (i = 0;i < p;++i) weight += r[i]&1;
return int16_nonzero_mask(weight-w);
val = weight[5 - cp->c.a - cp->c.b];
val += weight[5 - cp->c.a - cp->c.b];
val = weight[n];
static const int weight[5] = { 0, 1, 7, 22, 100 };
#define FOOD(name,prob,delay,weight,nutrition) { name, NULL, NULL, 1, 1,\
FOOD_SYM, prob, delay, weight, 0, 0, nutrition }
int weight(struct obj *);
if (iw + weight(obj) > 0)
obj->owt = weight(obj);
otmp->owt = weight(otmp); /* -= obj->owt ? */
obj->owt = weight(obj);
otmp->owt = weight(otmp);
obj->owt = weight(obj); /* defined after setting otyp+quan */
obj->owt = weight(obj);
u_int priority, weight, port;
weight = ns_get16(rdata); rdata += NS_INT16SZ;
len = SPRINTF((t, "%u %u %u ", priority, weight, port));
fs->fs_nr, fs->weight, fs->parent_nr);
pipe.fs.weight = strtoul(av[0], &end, 0);
if (pipe.fs.weight >100)
double step, idle, weight, w_q;
weight = 1 - w_q;
weight *= weight;
pipe.fs.lookup_weight = (int)(weight * (1 << SCALE_RED));
pipe.fs.weight = strtoul(av[0], &end, 0);
if (pipe.fs.weight >100)
double s, idle, weight, w_q;
weight = 1 - w_q;
weight *= weight;
pipe.fs.lookup_weight = (int)(weight * (1 << SCALE_RED));
fs->fs_nr, fs->weight, fs->parent_nr);
int weight;
unsigned int weight;
__u32 weight;
red_alloc(int weight, int inv_pmax, int th_min, int th_max, int flags, int pkttime)
if (weight == 0)
rp->red_weight = weight;
if (weight == 0) {
wtab_alloc(int weight)
if (w->w_weight == weight) {
w->w_weight = weight;
w->w_tab[0] = ((weight - 1) << FP_SHIFT) / weight;
rio_alloc(int weight, struct redparams *params, int flags, int pkttime)
if (weight != 0)
rp->rio_weight = weight;
pipe->sum += fs->weight; /* Add weight of new queue */
q->F = q->S + (len << MY_M) / (uint64_t)fs->weight;
x->weight = ioc_fs->weight;
if (x->weight == 0)
x->weight = 1;
else if (x->weight > 100)
x->weight = 100;
p->sum -= fs->weight * fs->backlogged;
ioc_fs->weight = fs->weight;
q->F += (len << MY_M) / (uint64_t)fs->weight;
pipe->sum -= q->fs->weight;
int weight; /* WFQ queue weight */
int weight; /* WFQ queue weight */
pipe->sum += fs->weight; /* Add weight of new queue */
q->F = q->S + (len << MY_M) / (uint64_t)fs->weight;
x->weight = ioc_fs->weight;
if (x->weight == 0)
x->weight = 1;
else if (x->weight > 100)
x->weight = 100;
p->sum -= fs->weight * fs->backlogged;
ioc_fs->weight = fs->weight;
q->F += (len << MY_M) / (uint64_t)fs->weight;
pipe->sum -= q->fs->weight;
int weight; /* WFQ queue weight */
int weight; /* WFQ queue weight */
int weight;
weight = b->se_fails - a->se_fails;
if (abs(weight) > 1)
return weight;
mbsadjpos(const char **instr, size_t inlen, size_t outlen, int weight, int flag,
char *outp, outstr[outlen * weight + 1];
outlen *= weight;
RB_ENTRY(weight) entry;
static RB_HEAD(weights, weight) weights[COLL_WEIGHTS_MAX];
RB_PROTOTYPE_STATIC(weights, weight, entry, weight_compare);
RB_GENERATE(weights, weight, entry, weight_compare);
wthreshp((p)->weight, _length)) /* XXX */ \
p->weight = cc_weight;
if ((p->weight += p->time - time0) < 0)
p->weight = cc_weight;
else if ((p->weight += cc_weight) > limit)
p->weight = limit;
if (p->weight >= wthreshold) {
p->weight += time0 - p->time;
if (!p->flag && p->weight >= wthreshold) {
if ((p->weight += p->time - time0) < 0)
p->weight = cc_weight;
else if ((p->weight += cc_weight) > limit)
p->weight = limit;
|| p->weight >= wthreshold
|| wthreshp(p->weight, length)
short weight;
else if (p->weight >= wthreshold)
#define wthreshp(weight, length) ((short) (weight) >= cc_wthresholds[length])
#define wthreshp(weight, length) (0)