search for: r156842

Displaying 4 results from an estimated 4 matches for "r156842".

2012 Aug 13
0
[LLVMdev] Load serialisation during selection DAG building
...use there are places in some of the backend lowering code that assume it exists in its current form), and just update the scheduler to be more intelligent about how it forms the dependency graph. This has since been developed for the new MI scheduling framework by Sergei Larin, and was committed in r156842 (last message in the discussion thread was http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20120507/142659.html) I would recommend trying something like Sergei's solution first, and fall back to trying to play with the critical chain only if that can't or won't work. -Hal...
2012 Aug 13
3
[LLVMdev] Load serialisation during selection DAG building
I've got a question about how SelectionDAGBuilder treats loads. The LLVM Language Reference Manual explicitly states that the order of volatile operations may be changed relative to non-volatile operations. However, when the SelectionDAGBuilder in LLVM 3.1 encounters a volatile load, it flushes all pending loads and then chains the volatile load onto them meaning that the volatile load must
2012 Aug 14
2
[LLVMdev] Load serialisation during selection DAG building
...in some of the backend > lowering code that assume it exists in its current form), and just > update the scheduler to be more intelligent about how it forms the > dependency graph. This has since been developed for the new MI > scheduling framework by Sergei Larin, and was committed in r156842 > (last message in the discussion thread was > http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20120507/142659.html) > > I would recommend trying something like Sergei's solution first, and > fall back to trying to play with the critical chain only if that can't...
2012 Aug 14
0
[LLVMdev] Load serialisation during selection DAG building
...backend >> lowering code that assume it exists in its current form), and just >> update the scheduler to be more intelligent about how it forms the >> dependency graph. This has since been developed for the new MI >> scheduling framework by Sergei Larin, and was committed in r156842 >> (last message in the discussion thread was >> http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20120507/142659.html) >> >> I would recommend trying something like Sergei's solution first, and >> fall back to trying to play with the critical chain onl...