===========================================================
.___ __ __
_________________ __ __ __| _/|__|/ |_
/ ___\_` __ \__ \ | | \/ __ | | \\_ __\
/ /_/ > | \// __ \| | / /_/ | | || |
\___ /|__| (____ /____/\____ | |__||__|
/_____/ \/ \/
grep rough audit - static analysis tool
v2.8 written by @Wireghoul
=================================[justanotherhacker.com]===
libmath-prime-util-perl-0.73/montmath.h-38-
libmath-prime-util-perl-0.73/montmath.h:39:/* MULREDC asm from Ben Buhrow */
libmath-prime-util-perl-0.73/montmath.h-40-static INLINE uint64_t _mulredc63(uint64_t a, uint64_t b, uint64_t n, uint64_t npi) {
##############################################
libmath-prime-util-perl-0.73/lmo.c-90-/* GCC 3.4 - 4.1 has broken 64-bit popcount.
libmath-prime-util-perl-0.73/lmo.c:91: * GCC 4.2+ can generate awful code when it doesn't have asm (GCC bug 36041).
libmath-prime-util-perl-0.73/lmo.c:92: * When the asm is present (e.g. compile with -march=native on a platform that
libmath-prime-util-perl-0.73/lmo.c-93- * has them, like Nahelem+), then it is almost as fast as the direct asm. */
##############################################
libmath-prime-util-perl-0.73/examples/verify-primegaps.pl-129- if ($use_pfgw && length($n) >= $pfgw_thresh) {
libmath-prime-util-perl-0.73/examples/verify-primegaps.pl:130: return 0 if system("$pfgw_exec -k -Cquiet -f0 -u0 -q\"$n\" >/dev/null 2>1");
libmath-prime-util-perl-0.73/examples/verify-primegaps.pl-131- }
##############################################
libmath-prime-util-perl-0.73/inc/Devel/CheckLib.pm-420- $absexefile = '"'.$absexefile.'"' if $absexefile =~ m/\s/;
libmath-prime-util-perl-0.73/inc/Devel/CheckLib.pm:421: if (system($absexefile) != 0) {
libmath-prime-util-perl-0.73/inc/Devel/CheckLib.pm-422- push @wrongresult, $lib;
##############################################
libmath-prime-util-perl-0.73/mulmod.h-25- UV d, dummy; /* d will get a*b mod c */
libmath-prime-util-perl-0.73/mulmod.h:26: asm ("mulq %3\n\t" /* mul a*b -> rdx:rax */
libmath-prime-util-perl-0.73/mulmod.h-27- "divq %4\n\t" /* (a*b)/c -> quot in rax remainder in rdx */
##############################################
libmath-prime-util-perl-0.73/mulmod.h-36- /* A version for _MSC_VER:
libmath-prime-util-perl-0.73/mulmod.h:37: * __asm { mov rax, qword ptr a
libmath-prime-util-perl-0.73/mulmod.h-38- * mul qword ptr b
##############################################
libmath-prime-util-perl-0.73/mulmod.h-45- a += b;
libmath-prime-util-perl-0.73/mulmod.h:46: asm ("add %2, %1\n\t" /* t := t + b */
libmath-prime-util-perl-0.73/mulmod.h-47- "cmovc %1, %0\n\t" /* if (carry) a := t */
##############################################
libmath-prime-util-perl-0.73/Changes-215-
libmath-prime-util-perl-0.73/Changes:216: - All new Montgomery math. Uses mulredc asm from Ben Buhrow.
libmath-prime-util-perl-0.73/Changes-217- Faster and smaller. Most primality and factoring code 10% faster.
##############################################
libmath-prime-util-perl-0.73/Changes-1182- - LMO much faster if -march=native is used for gcc on a platform with
libmath-prime-util-perl-0.73/Changes:1183: asm popcnt (e.g. Nahalem+, Barcelona+, ARM Neon, SPARC, Power7, etc.).
libmath-prime-util-perl-0.73/Changes-1184-
##############################################
libmath-prime-util-perl-0.73/Changes-1824-0.05 2012-06-11
libmath-prime-util-perl-0.73/Changes:1825: - Speed up mulmod: asm for GCC + x86_64, native 64-bit for 32-bit Perl
libmath-prime-util-perl-0.73/Changes-1826- is uint64_t is available, and range tests for others. This speeds up
##############################################
libmath-prime-util-perl-0.73/util.h-325-/* GCC 3.4 - 4.1 has broken 64-bit popcount.
libmath-prime-util-perl-0.73/util.h:326: * GCC 4.2+ can generate awful code when it doesn't have asm (GCC bug 36041).
libmath-prime-util-perl-0.73/util.h:327: * When the asm is present (e.g. compile with -march=native on a platform that
libmath-prime-util-perl-0.73/util.h-328- * has them, like Nahelem+), then it is almost as fast as manually written asm. */