Lines Matching refs:e
47 struct quantile_entry *e = q->entries + i; in quantiles_update() local
49 if (unlikely(!e->step)) { in quantiles_update()
50 e->m = v; in quantiles_update()
51 e->step = max_t(unsigned, v / 2, 1024); in quantiles_update()
52 } else if (e->m > v) { in quantiles_update()
53 e->m = e->m >= e->step in quantiles_update()
54 ? e->m - e->step in quantiles_update()
56 } else if (e->m < v) { in quantiles_update()
57 e->m = e->m + e->step > e->m in quantiles_update()
58 ? e->m + e->step in quantiles_update()
62 if ((e->m > v ? e->m - v : v - e->m) < e->step) in quantiles_update()
63 e->step = max_t(unsigned, e->step / 2, 1); in quantiles_update()
65 if (v >= e->m) in quantiles_update()
68 i = eytzinger0_child(i, v > e->m); in quantiles_update()