Displaying 4 results from an estimated 4 matches for "visittokenfactor".
2008 Apr 28
1
[LLVMdev] FoldingSetNodeID operations inefficiency
Hi Chris,
Your were totally right with your suggestion.
I have implemented the code that :
a) does not merge multiple TokenFactor nodes in the DAGCombiner::visitTokenFactor(), if the resulting TF node would contain more than 64 operands.
b) produces a bunch of TokenFactor nodes with at most 64 operands,
instead of one huge TokenFactor in the SelectionDAGLowering::getRoot().
If we have n pending loads, they can be combined into TFs in two ways:
1) The first 64...
2012 Jun 01
0
[LLVMdev] legalization of truncating stores in LegalizeDAG.cpp
Hi Akira,
On 01/06/12 02:27, Hatanaka, Akira wrote:
> In LegalizeDAG.cpp, truncating stores are custom-lowered in line 1314-1317:
>
> 1314 case TargetLowering::Custom:
> 1315 ReplaceNode(SDValue(Node, 0),
> 1316 TLI.LowerOperation(SDValue(Node, 0), DAG));
> 1317 break;
>
> Is there a reason it doesn't check whether the
2012 Jun 01
2
[LLVMdev] legalization of truncating stores in LegalizeDAG.cpp
In LegalizeDAG.cpp, truncating stores are custom-lowered in line 1314-1317:
1314 case TargetLowering::Custom:
1315 ReplaceNode(SDValue(Node, 0),
1316 TLI.LowerOperation(SDValue(Node, 0), DAG));
1317 break;
Is there a reason it doesn't check whether the SDValue returned from
TargetLowering::LowerOperation is null before it replaces the
2008 Apr 30
1
[LLVMdev] FoldingSetNodeID operations inefficiency
...t; On Apr 28, 2008, at 6:21 AM, Roman Levenstein wrote:
>
> > Hi Chris,
> >
> > Your were totally right with your suggestion.
> >
> > I have implemented the code that :
> >
> > a) does not merge multiple TokenFactor nodes in the
> > DAGCombiner::visitTokenFactor(), if the resulting TF node would
> > contain more than 64 operands.
> >
> > b) produces a bunch of TokenFactor nodes with at most 64 operands,
> > instead of one huge TokenFactor in the
> > SelectionDAGLowering::getRoot().
> >
> > If we have n pendin...