Re: sort and -lm

[Bruno Haible]

Paul Eggert wrote:
> The win for GNU sort, once I get around to fixing totalorder's -lm 
> dependency

Why would that be a problem? The average run time of a 'sort' invocation
is long enough that an additional link dependency to libm shouldn't matter.

'sort' already links against libcrypto:
$ nm sort | grep ' U ' | grep -v @GLIBC
                 U MD5_Final@OPENSSL_3.0.0
                 U MD5_Init@OPENSSL_3.0.0
                 U MD5_Update@OPENSSL_3.0.0

If you really want to minimize the startup time, you could load the libcrypto,
needed for the option '--random', using dlopen() ? I wouldn't advocate it as
a solution on all platforms, since libltdl surely has its own set of
portability problems. But guarded by a '#ifdef __GLIBC__', why not?

Bruno