Previously they would be swapped a byte at a time when sizeof(int)
!= sizeof(long).  Idea from FreeBSD.

when the recursion depth reaches 2*lg(n + 1).  This avoids quicksort's
quadratic behavior for pathological input without appreciably
changing the average run time.

side of the array being partitioned to save on stack space.  Greater
savings can be gained by choosing recursion for the smaller side
of the partition and eliminating recursion for the larger side.
This also results in a small but measurable performance gain.
OK otto@ schwarze@

This is a remnant from the original 4.4BSD code that had 'a' as
void * in the function args.  No binary change.  OK bluhm@

C standard are all weak.
Apply __{BEGIN,END}_HIDDEN_DECLS to gdtoa{,imp}.h, hiding the
arch-specific __strtorx, __ULtox_D2A, __strtorQ, __ULtoQ_D2A symbols.

behavior for certain inputs.  From NetBSD.  OK tedu@

after the diff was written, I made it similar to the freebsd fix of
the same code; pr6287 ok millert@ guenther@

Kill old files that are no longer compiled.
okay theo

ok otto deraadt

rescinded 22 July 1999.  Proofed by myself and Theo.

Make sure everything uses {SYS,}LIBC_SCCS properly

Change inline to __inline