21     dist->entries = g_new(struct qdist_entry, 1);  in qdist_init()
28     g_free(dist->entries);  in qdist_destroy()
57         entry = bsearch(&e, dist->entries, dist->n, sizeof(e), qdist_cmp);  in qdist_add()
67         dist->entries = g_renew(struct qdist_entry, dist->entries, dist->size);  in qdist_add()
70     entry = &dist->entries[dist->n - 1];  in qdist_add()
73     qsort(dist->entries, dist->n, sizeof(*entry), qdist_cmp);  in qdist_add()
114         if (dist->entries[0].count) {  in qdist_pr_internal()
123     min = dist->entries[0].count;  in qdist_pr_internal()
126         struct qdist_entry *e = &dist->entries[i];  in qdist_pr_internal()
137         struct qdist_entry *e = &dist->entries[i];  in qdist_pr_internal()
187             if (from->entries[i].x != xmin + i * step) {  in qdist_bin__internal()
192         to->entries = g_renew(struct qdist_entry, to->entries, n);  in qdist_bin__internal()
194         memcpy(to->entries, from->entries, sizeof(*to->entries) * to->n);  in qdist_bin__internal()
215         while (j < from->n && (from->entries[j].x < right || i == n - 1)) {  in qdist_bin__internal()
216             struct qdist_entry *o = &from->entries[j];  in qdist_bin__internal()
335     return dist->entries[index].x;  in qdist_x()
359         struct qdist_entry *e = &dist->entries[i];  in qdist_sample_count()
375             struct qdist_entry *e = &dist->entries[index + i];  in qdist_pairwise_avg()