394   struct fde_vector *linear;  member
406   if ((accu->linear = malloc (size)))  in start_fde_sort()
408       accu->linear->count = 0;  in start_fde_sort()
420   if (accu->linear)  in fde_insert()
421     accu->linear->array[accu->linear->count++] = this_fde;  in fde_insert()
438 	   struct fde_vector *linear, struct fde_vector *erratic)  in fde_split()  argument
441   size_t count = linear->count;  in fde_split()
455 	   probe != &marker && fde_compare (ob, linear->array[i], *probe) < 0;  in fde_split()
458 	  chain_end = (const fde *const*) erratic->array[probe - linear->array];  in fde_split()
459 	  erratic->array[probe - linear->array] = NULL;  in fde_split()
462       chain_end = &linear->array[i];  in fde_split()
470       linear->array[j++] = linear->array[i];  in fde_split()
472       erratic->array[k++] = linear->array[i];  in fde_split()
473   linear->count = j;  in fde_split()
572   gcc_assert (!accu->linear || accu->linear->count == count);  in end_fde_sort()
583       fde_split (ob, fde_compare, accu->linear, accu->erratic);  in end_fde_sort()
584       gcc_assert (accu->linear->count + accu->erratic->count == count);  in end_fde_sort()
586       fde_merge (ob, fde_compare, accu->linear, accu->erratic);  in end_fde_sort()
593       frame_heapsort (ob, fde_compare, accu->linear);  in end_fde_sort()
784   accu.linear->orig_data = ob->u.single;  in init_object()
785   ob->u.sort = accu.linear;  in init_object()