Displaying 2 results from an estimated 2 matches for "lwvneuqnp0frnckezqk03jwjcubjgskzh".
2019 Aug 08
2
回复: [RFC] Improve iteration of estimating divisions
...st
> llvm-dev at lists.llvm.org
> https://nam02.safelinks.protection.outlook.com/?url=https%3A%2F%2Flists.llvm.org%2Fcgi-bin%2Fmailman%2Flistinfo%2Fllvm-dev&data=02%7C01%7C%7Cdbff2450e5bb4b63e5f108d71aa94e7f%7C84df9e7fe9f640afb435aaaaaaaaaaaa%7C1%7C0%7C637007186791161795&sdata=LWVNeuqNP0FRnckeZQk03JwJcuBJgsKZh%2Fb%2BddLrhhU%3D&reserved=0
--
Hal Finkel
Lead, Compiler Technology and Programming Languages
Leadership Computing Facility
Argonne National Laboratory
2019 Aug 06
3
[RFC] Improve iteration of estimating divisions
Hi there, I notice that our current implementation of fast division transformation (turn `a / b` into `a * (1/b)`) is worse in precision compared with GCC. Like this case in ppc64le:
float fdiv(unsigned int a, unsigned int b) {
return (float)a / (float)b;
}
Result of Clang -Ofast is 41A00001 (in Hex), while GCC produces 41A00000 which is the same as no