Every semantic parser except GCC chokes on this code because it is doing so many screwy things. I'd rather use a set of tools that uses similar calls across all hashing methods in order to allow for future extensibility. In addition, BeeCrypt provides some ASM optimized implementations of algorithms, and knowing what pacman's current choke points are this is a good thing.
Hi Just a notice about ASM stuff* :) This is sha1sum from coreutils: krics@frugal64:~/asmutils-0.18/src$ time sha1sum ./NVIDIA-Linux-x86_64-1.0-9755-pkg2.run 28fb1ac0948a583e8c760b541e19614f3f6ba0d4 ./NVIDIA-Linux-x86_64-1.0-9755-pkg2.run real 0m0.072s user 0m0.062s sys 0m0.010s And this is ./sha1sum from asmutils-0.18 <- http://asm.sourceforge.net/asmutils.html krics@frugal64:~/asmutils-0.18/src$ time ./sha1sum ./NVIDIA-Linux-x86_64-1.0-9755-pkg2.run 28fb1ac0948a583e8c760b541e19614f3f6ba0d4 ./NVIDIA-Linux-x86_64-1.0-9755-pkg2.run real 0m0.774s user 0m0.554s sys 0m0.216s :S maybe i did something wrong at asmutils compile, but seems it is not faster :S its slower. Maybe not a big and good ""benchmark"" Not posted this because of flaming or anything else. Ps.: And as i know md5driver or sha1*.c in pacman comes from coreutils source with some modification. Correct me if i'm wrong. Regards Christian Hamar alias krix Frugalware Developer Team Hungary