llvm-project

Commit Graph

Author	SHA1	Message	Date
Matthias Braun	6ad3d05b68	MachineScheduler: Fully compare top/bottom candidates In bidirectional scheduling this gives more stable results than just comparing the "reason" fields of the top/bottom node because the reason field may be higher depending on what other nodes are in the queue. Differential Revision: http://reviews.llvm.org/D19401 llvm-svn: 273755	2016-06-25 00:23:00 +00:00
James Molloy	4c1b746771	[SDAG] Move TRUNCATE splitting logic into a helper, and use it more liberally. SplitVecOp_TRUNCATE has logic for recursively splitting oversize vectors that need more than one round of splitting to become legal. There are many other ISD nodes that could benefit from this logic, so factor it out and use it for FP_TO_UINT,FP_TO_SINT,SINT_TO_FP,UINT_TO_FP and FTRUNC. llvm-svn: 233681	2015-03-31 10:20:58 +00:00

Author

SHA1

Message

Date

Matthias Braun

6ad3d05b68

MachineScheduler: Fully compare top/bottom candidates

In bidirectional scheduling this gives more stable results than just
comparing the "reason" fields of the top/bottom node because the reason
field may be higher depending on what other nodes are in the queue.

Differential Revision: http://reviews.llvm.org/D19401

llvm-svn: 273755

2016-06-25 00:23:00 +00:00

James Molloy

4c1b746771

[SDAG] Move TRUNCATE splitting logic into a helper, and use

it more liberally.

SplitVecOp_TRUNCATE has logic for recursively splitting oversize vectors
that need more than one round of splitting to become legal. There are many
other ISD nodes that could benefit from this logic, so factor it out and
use it for FP_TO_UINT,FP_TO_SINT,SINT_TO_FP,UINT_TO_FP and FTRUNC.

llvm-svn: 233681

2015-03-31 10:20:58 +00:00

2 Commits