3 Commits

Author	SHA1	Message	Date
Nemanja Ivanovic	b4f028f0f3	[PowerPC] Use the two-constant NR algorithm for refining estimates ... The single-constant algorithm produces infinities on a lot of denormal values. The precision of the two-constant algorithm is actually sufficient across the range of denormals. We will switch to that algorithm for now to avoid the infinities on denormals. In the future, we will re-evaluate the algorithm to find the optimal one for PowerPC. Differential revision: https://reviews.llvm.org/D60037 llvm-svn: 360144	2019-05-07 13:48:03 +00:00
Ehsan Amiri	a538b0f023	Adding -verify-machineinstrs option to PowerPC tests ... Currently we have a number of tests that fail with -verify-machineinstrs. To detect this cases earlier we add the option to the testcases with the exception of tests that will currently fail with this option. PR 27456 keeps track of this failures. No code review, as discussed with Hal Finkel. llvm-svn: 277624	2016-08-03 18:17:35 +00:00
Hal Finkel	0f2ddcb83f	[PowerPC] PPCVSXFMAMutate should ignore trivial-copy addends ... We might end up with a trivial copy as the addend, and if so, we should ignore the corresponding FMA instruction. The trivial copy can be coalesced away later, so there's nothing to do here. We should not, however, assert. Fixes PR24544. llvm-svn: 245907	2015-08-24 23:48:28 +00:00