summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/dsa/dsa_ameth.c
diff options
context:
space:
mode:
authorjsing <>2023-01-11 04:26:24 +0000
committerjsing <>2023-01-11 04:26:24 +0000
commit8dd331f8906d93b3666014c96fd7a1b2d8b05067 (patch)
treead039edfe3e30f38850a91522a3c75065f8943ff /src/lib/libcrypto/dsa/dsa_ameth.c
parent025571eb653f49b9f6e6a57c71a96584022bee66 (diff)
downloadopenbsd-8dd331f8906d93b3666014c96fd7a1b2d8b05067.tar.gz
openbsd-8dd331f8906d93b3666014c96fd7a1b2d8b05067.tar.bz2
openbsd-8dd331f8906d93b3666014c96fd7a1b2d8b05067.zip
Replace BN_lshift1()/BN_rshift1() with calls to BN_lshift()/BN_rshift().
Currently, BN_lshift1() and BN_rshift1() are separate implementations that are intended to be faster since the shift is known (and only one bit crosses a word boundary). However, with the rewrite of BN_lshift() and BN_rshift(), they are either slower or only minimally faster (depending on architecture). Avoid duplication and turn BN_lshift1()/BN_rshift1() into functions that call inlined versions of BN_lshift()/BN_rshift(), making BN_lshift() and BN_rshift() call the same inlined implementation. This results in a single implementation and BN_lshift1()/BN_rshift1() that out perform the previous versions (in part due to compiler optimisation). Now that none of the original code exists, replace the license and copyright for this file. ok tb@
Diffstat (limited to 'src/lib/libcrypto/dsa/dsa_ameth.c')
0 files changed, 0 insertions, 0 deletions