Dan Gohman 8be6bbe5bf Eliminate the ISel priority queue, which used the topological order for a ... priority function. Instead, just iterate over the AllNodes list, which is already in topological order. This eliminates a fair amount of bookkeeping, and speeds up the isel phase by about 15% on many testcases. The impact on most targets is that AddToISelQueue calls can be simply removed. In the x86 target, there are two additional notable changes. The rule-bending AND+SHIFT optimization in MatchAddress that creates new pre-isel nodes during isel is now a little more verbose, but more robust. Instead of either creating an invalid DAG or creating an invalid topological sort, as it has historically done, it can now just insert the new nodes into the node list at a position where they will be consistent with the topological ordering. Also, the address-matching code has logic that checked to see if a node was "already selected". However, when a node is selected, it has all its uses taken away via ReplaceAllUsesWith or equivalent, so it won't recieve any further visits from MatchAddress. This code is now removed. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@58748 91177308-0d34-0410-b5e6-96231b3b80d8		2008-11-05 04:14:16 +00:00
..
llvm	Eliminate the ISel priority queue, which used the topological order for a	2008-11-05 04:14:16 +00:00
llvm-c	Add C bindings for extractvalue and insertvalue. Patch by Frits van Bommel!	2008-11-03 22:55:43 +00:00