50 mpfr_sum_sort (mpfr_srcptr *const tab, unsigned long n, mpfr_srcptr *perm)  in mpfr_sum_sort()  argument
89     heap_sort (tab, n, perm);  in mpfr_sum_sort()
91     count_sort (tab, n, perm, min, exp_num);  in mpfr_sum_sort()
99             mpfr_srcptr *perm, mpfr_exp_t min, mpfr_uexp_t exp_num)  in count_sort()  argument
122       perm[target_rank] = tab[i];  in count_sort()
132 heap_sort (mpfr_srcptr *const tab, unsigned long n, mpfr_srcptr *perm)  in heap_sort()  argument
145     perm[i] = tab[i];  in heap_sort()
154           if (GET_EXP2 (perm[pere]) > GET_EXP2 (perm[i]))  in heap_sort()
156               tmp = perm[pere];  in heap_sort()
157               perm[pere] = perm[i];  in heap_sort()
158               perm[i] = tmp;  in heap_sort()
169       tmp = perm[0];  in heap_sort()
170       perm[0] = perm[dernier_traite];  in heap_sort()
171       perm[dernier_traite] = tmp;  in heap_sort()
182                   if (GET_EXP2(perm[fils_droit]) < GET_EXP2(perm[fils_gauche]))  in heap_sort()
187                   if (GET_EXP2 (perm[i]) > GET_EXP2 (perm[fils_indigne]))  in heap_sort()
189                       tmp = perm[i];  in heap_sort()
190                       perm[i] = perm[fils_indigne];  in heap_sort()
191                       perm[fils_indigne] = tmp;  in heap_sort()
199                   if (GET_EXP2 (perm[i]) > GET_EXP2 (perm[fils_gauche]))  in heap_sort()
201                       tmp = perm[i];  in heap_sort()
202                       perm[i] = perm[fils_gauche];  in heap_sort()
203                       perm[fils_gauche] = tmp;  in heap_sort()
248   mpfr_srcptr *perm, *const tab = (mpfr_srcptr *) tab_p;  in mpfr_sum()  local
268   perm = (mpfr_srcptr *) MPFR_TMP_ALLOC (n * sizeof *perm);  in mpfr_sum()
269   error_trap = mpfr_sum_sort (tab, n, perm);  in mpfr_sum()
295       error_trap = sum_once (cur_sum, perm, n, prec + k);  in mpfr_sum()