contrib/gcc/unwind-dw2-fde.c

384    surrounding linear sequence (but not necessarily higher than the values
385    at the end of the linear sequence!).
391   struct fde_vector *linear;
403   if ((accu->linear = malloc (size)))
405       accu->linear->count = 0;
417   if (accu->linear)
418     accu->linear->array[accu->linear->count++] = this_fde;
421 /* Split LINEAR into a linear sequence with low values and an erratic
422    sequence with high values, put the linear one (of longest possible
425    Because the longest linear sequence we are trying to locate within the
431    what is the linear sequence.  This overlay is safe from aliasing.  */
435 	   struct fde_vector *linear, struct fde_vector *erratic)
438   size_t count = linear->count;
452 	   probe != &marker && fde_compare (ob, linear->array[i], *probe) < 0;
455 	  chain_end = (const fde **) erratic->array[probe - linear->array];
456 	  erratic->array[probe - linear->array] = NULL;
459       chain_end = &linear->array[i];
462   /* Each entry in LINEAR which is part of the linear sequence we have
467       linear->array[j++] = linear->array[i];
469       erratic->array[k++] = linear->array[i];
470   linear->count = j;
569   gcc_assert (!accu->linear || accu->linear->count == count);
580       fde_split (ob, fde_compare, accu->linear, accu->erratic);
581       gcc_assert (accu->linear->count + accu->erratic->count == count);
583       fde_merge (ob, fde_compare, accu->linear, accu->erratic);
589 	 so heap sort in the linear one.  */
590       frame_heapsort (ob, fde_compare, accu->linear);
762   accu.linear->orig_data = ob->u.single;
763   ob->u.sort = accu.linear;
768 /* A linear search through a set of FDEs for the given PC.  This is
956       /* Long slow labourious linear search, cos we've no memory.  */