[PATCH] Use FIFO in InitDAGTopologicalSorting

[Sean Silva]

Does this fix an existing bug? Do you have a test case?

-- Sean Silva


On Wed, Aug 14, 2013 at 1:09 AM, Tijl Coosemans <tijl at freebsd.org> wrote:

> Hi,
>
> The attached patch changes WorkList in InitDAGTopologicalSorting() into a
> FIFO queue. Items on the list have to be processed in order such that
> earlier items get higher index numbers than later items because they may
> be successors of the later items.
> _______________________________________________
> llvm-commits mailing list
> llvm-commits at cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20130814/ac355ab5/attachment.html>