- 05 1月, 2015 1 次提交
-
-
由 Andy Polyakov 提交于
This facilitates "universal" builds, ones that target multiple architectures, e.g. ARMv5 through ARMv7. See commentary in Configure for details. Reviewed-by: NArd Biesheuvel <ard.biesheuvel@linaro.org> Reviewed-by: NMatt Caswell <matt@openssl.org>
-
- 31 12月, 2014 1 次提交
-
-
由 Tim Hudson 提交于
indent will not alter them when reformatting comments Reviewed-by: NRich Salz <rsalz@openssl.org> Reviewed-by: NMatt Caswell <matt@openssl.org>
-
- 29 11月, 2014 1 次提交
-
-
由 Rich Salz 提交于
Reviewed-by: NTim Hudson <tjh@openssl.org>
-
- 02 10月, 2014 1 次提交
-
-
由 Rich Salz 提交于
Reviewed-by: NAndy Polyakov <appro@openssl.org>
-
- 12 9月, 2014 1 次提交
-
-
由 Andy Polyakov 提交于
Reviewed-by: NRich Salz <rsalz@openssl.org>
-
- 21 8月, 2014 1 次提交
-
-
由 Andy Polyakov 提交于
RT: 2835 Reviewed-by: NDr. Stephen Henson <steve@openssl.org>
-
- 10 7月, 2014 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 28 6月, 2014 2 次提交
-
-
由 Andy Polyakov 提交于
-
由 Andy Polyakov 提交于
-
- 27 6月, 2014 1 次提交
-
-
由 Andy Polyakov 提交于
This ensures high performance is situations when assembler supports AVX2, but not AD*X.
-
- 24 6月, 2014 2 次提交
-
-
由 Andy Polyakov 提交于
-
由 Andy Polyakov 提交于
-
- 07 6月, 2014 1 次提交
-
-
由 Andy Polyakov 提交于
Pointer out and suggested by: Ard Biesheuvel.
-
- 04 5月, 2014 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 24 4月, 2014 1 次提交
-
-
由 Andy Polyakov 提交于
algorithm suggested in following paper: Câmara, D.; Gouvêa, C. P. L.; López, J. & Dahab, R.: Fast Software Polynomial Multiplication on ARM Processors using the NEON Engine. http://conradoplg.cryptoland.net/files/2010/12/mocrysen13.pdf
-
- 09 1月, 2014 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 10 12月, 2013 1 次提交
-
-
由 Andy Polyakov 提交于
This also eliminates code duplication between x86_64-mont and x86_64-mont and optimizes even original non-MULX code.
-
- 05 12月, 2013 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 04 12月, 2013 3 次提交
-
-
由 Andy Polyakov 提交于
PR: 3189 Submitted by: Oscar Ciurana
-
由 Andy Polyakov 提交于
-
由 Andy Polyakov 提交于
rsaz_exp.c: harmonize line terminating; asm/rsaz-*.pl: minor optimizations.
-
- 03 12月, 2013 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 28 11月, 2013 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 25 10月, 2013 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 15 10月, 2013 2 次提交
-
-
由 Andy Polyakov 提交于
-
由 Andy Polyakov 提交于
-
- 13 10月, 2013 1 次提交
-
-
由 Andy Polyakov 提交于
Latest MIPS ISA specification declared 'branch likely' instructions obsolete. To makes code future-proof replace them with equivalent.
-
- 11 10月, 2013 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 03 10月, 2013 2 次提交
-
-
由 Andy Polyakov 提交于
-
由 Andy Polyakov 提交于
-
- 10 9月, 2013 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 06 9月, 2013 1 次提交
-
-
- 03 8月, 2013 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 13 7月, 2013 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 12 7月, 2013 1 次提交
-
-
由 Ben Laurie 提交于
-
- 06 7月, 2013 2 次提交
-
-
由 Andy Polyakov 提交于
RT: 2582, 2850
-
由 Andy Polyakov 提交于
-
- 18 6月, 2013 2 次提交
-
-
由 Andy Polyakov 提交于
Improve RSA sing performance by 20-30% by: - switching from floating-point to integer conditional moves; - daisy-chaining sqr-sqr-sqr-sqr-sqr-mul sequences; - using MONTMUL even during powers table setup;
-
由 Andy Polyakov 提交于
PR: 3074
-
- 05 6月, 2013 1 次提交
-
-
由 Adam Langley 提交于
eliminating them as dead code. Both volatile and "memory" are used because of some concern that the compiler may still cache values across the asm block without it, and because this was such a painful debugging session that I wanted to ensure that it's never repeated.
-