110 Commits

Author	SHA1	Message	Date
Chris Lattner	7a36d97518	Move the available queue to being inside the ListSchedule method, since it ... bounds its lifetime. llvm-svn: 26550	2006-03-05 20:21:55 +00:00
Evan Cheng	5e9a695026	A bit more tweaking ... llvm-svn: 26500	2006-03-03 06:23:43 +00:00
Jeff Cohen	55c1173a6c	Fix VC++ compilation errors. ... llvm-svn: 26498	2006-03-03 03:25:07 +00:00
Evan Cheng	4e3904f637	- Fixed some priority calculation bugs that were causing bug 478. Among them: ... a predecessor appearing more than once in the operand list was counted as multiple predecessor; priority1 should be updated during scheduling; CycleBound was updated after the node is inserted into priority queue; one of the tie breaking condition was flipped. - Take into consideration of two address opcodes. If a predecessor is a def&use operand, it should have a higher priority. - Scheduler should also favor floaters, i.e. nodes that do not have real predecessors such as MOV32ri. - The scheduling fixes / tweaks fixed bug 478: .text .align 4 .globl _f _f: movl 4(%esp), %eax movl 8(%esp), %ecx movl %eax, %edx imull %ecx, %edx imull %eax, %eax imull %ecx, %ecx addl %eax, %ecx leal (%ecx,%edx,2), %eax ret It is also a slight performance win (1% - 3%) for most tests. llvm-svn: 26470	2006-03-02 21:38:29 +00:00
Chris Lattner	0bd74558ae	make -debug output less newliney ... llvm-svn: 25895	2006-02-02 00:38:08 +00:00
Evan Cheng	c4c339c3d0	Clean up some code; improve efficiency; and fixed a potential bug involving ... chain successors. llvm-svn: 25630	2006-01-26 00:30:29 +00:00
Reid Spencer	5edde66863	Don't break the optimized build (by incorrect placement of #endif) ... llvm-svn: 25613	2006-01-25 21:49:13 +00:00
Jeff Cohen	fb20616aa6	Fix VC++ compilation error. ... llvm-svn: 25604	2006-01-25 17:17:49 +00:00
Evan Cheng	ab49556cf4	Bottom up register usage reducing list scheduler. ... llvm-svn: 25601	2006-01-25 09:14:32 +00:00
Evan Cheng	31272347d4	Skeleton of the list schedule. ... llvm-svn: 25544	2006-01-23 08:26:10 +00:00