Displaying 6 results from an estimated 6 matches for "getloadfrom".
2006 Dec 19
3
[LLVMdev] alias-aware scheduling
...duling so that independent memory operations may be
reordered.
Attached is a patch which implements this. I copied some routines from
DAGCombiner.cpp for using SDOperands with alias queries; it should
probably be factored out somewhere so the code can be shared. I
reorganized SelectionDAGLowering::getLoadFrom a little, to make it
simpler to use in other contexts.
Also, the patch fixes a bug where SelectionDAG::getLoad and
SelectionDAG::getStore were being called with the wrong arguments, with
a default argument helping to hide it.
I'm interested in any comments or feedback that people might have....
2006 Dec 20
1
[LLVMdev] alias-aware scheduling
...ult is pretty similar.
> > Attached is a patch which implements this. I copied some routines from
> > DAGCombiner.cpp for using SDOperands with alias queries; it should
> > probably be factored out somewhere so the code can be shared. I
> > reorganized SelectionDAGLowering::getLoadFrom a little, to make it
> > simpler to use in other contexts.
> >
> > Also, the patch fixes a bug where SelectionDAG::getLoad and
> > SelectionDAG::getStore were being called with the wrong arguments,
> > with
> > a default argument helping to hide it.
>
>...
2006 Dec 19
0
[LLVMdev] alias-aware scheduling
...atisfactory results by turning it on?
>
> Attached is a patch which implements this. I copied some routines from
> DAGCombiner.cpp for using SDOperands with alias queries; it should
> probably be factored out somewhere so the code can be shared. I
> reorganized SelectionDAGLowering::getLoadFrom a little, to make it
> simpler to use in other contexts.
>
> Also, the patch fixes a bug where SelectionDAG::getLoad and
> SelectionDAG::getStore were being called with the wrong arguments,
> with
> a default argument helping to hide it.
Can you be more specific about what the...
2008 Apr 24
0
[LLVMdev] FoldingSetNodeID operations inefficiency
Hi Chris,
This is a good idea and I started thinking in that direction already.
But what I don't quite understand the TFs, how TFs are formed and which rules they should obey to.
For example now:
> PendingLoads created by the SelectionDAGLowering::getLoadFrom and then copied into the
> TokenFactor node by SelectionDAGLowering::getRoot called from the
> SelectionDAGLowering::visitStore
So, if I now detect in the getRoot that there are more than let's say 64 nodes in the PendingLoads queue, what should I do?
- Can I take only 64 of them and f...
2008 Apr 23
1
[LLVMdev] FoldingSetNodeID operations inefficiency
...ny". In my
test-case (you can fetch it from here
http://llvm.org/bugs/attachment.cgi?id=1275), which is just one HUGE MBB
with tens of thousends of instructions, there is a TokenFactor node N
that has ... 3200 operands! (These operands are PendingLoads created by
the SelectionDAGLowering::getLoadFrom and then copied into the
TokenFactor node by SelectionDAGLowering::getRoot called from the
SelectionDAGLowering::visitStore).
During the code selection phase, the SelectionDAG::ReplaceAllUsesWith is
called many times and in many cases it tried to update this node, by
replacing some of its 3200...
2008 Apr 28
1
[LLVMdev] FoldingSetNodeID operations inefficiency
...FoldingSetNodeID operations inefficiency
Hi Chris,
This is a good idea and I started thinking in that direction already.
But what I don't quite understand the TFs, how TFs are formed and which rules they should obey to.
For example now:
> PendingLoads created by the SelectionDAGLowering::getLoadFrom and then copied into the
> TokenFactor node by SelectionDAGLowering::getRoot called from the
> SelectionDAGLowering::visitStore
So, if I now detect in the getRoot that there are more than let's say 64 nodes in the PendingLoads queue, what should I do?
- Can I take only 64 of them and f...