49 void qdist_add(struct qdist *dist, double x, long count)  in qdist_add()  argument
61         entry->count += count;  in qdist_add()
72     entry->count = count;  in qdist_add()
114         if (dist->entries[0].count) {  in qdist_pr_internal()
123     min = dist->entries[0].count;  in qdist_pr_internal()
128         if (e->count < min) {  in qdist_pr_internal()
129             min = e->count;  in qdist_pr_internal()
131         if (e->count > max) {  in qdist_pr_internal()
132             max = e->count;  in qdist_pr_internal()
141         if (e->count) {  in qdist_pr_internal()
143             index = (e->count - min) / (max - min) * (QDIST_NR_BLOCK_CODES - 1);  in qdist_pr_internal()
218             qdist_add(to, x, o->count);  in qdist_bin__internal()
355     unsigned long count = 0;  in qdist_sample_count()  local
361         count += e->count;  in qdist_sample_count()
363     return count;  in qdist_sample_count()
367                                  size_t n, unsigned long count)  in qdist_pairwise_avg()  argument
377             ret += e->x * e->count / count;  in qdist_pairwise_avg()
383         return qdist_pairwise_avg(dist, index, n2, count) +  in qdist_pairwise_avg()
384                qdist_pairwise_avg(dist, index + n2, n - n2, count);  in qdist_pairwise_avg()
390     unsigned long count;  in qdist_avg()  local
392     count = qdist_sample_count(dist);  in qdist_avg()
393     if (!count) {  in qdist_avg()
396     return qdist_pairwise_avg(dist, 0, dist->n, count);  in qdist_avg()