Displaying 3 results from an estimated 3 matches for "kulagin".
Did you mean:
k5login
2018 Mar 28
2
Instruction selection algorithm
...le and
node. Then the best tiles are selected by dynamic programming.
Could you please explain me how llvm instruction selection relates to
the NOLTIS algorithm
in the paper?
Does it make sense to use dynamic programming for instruction
selection based on MatcherTable?
--
With best regards,
Ivan Kulagin.
2018 Apr 06
0
Instruction selection algorithm
...tics like number of instructions which a pattern will
cover, latency (not the one which Targets scheduling defines) while
emitting the candidate patterns for a give dag node.
Current implications may not be implication of algorithm in toto though.
Thanks,
Jatin
On Wednesday, March 28, 2018, Ivan Kulagin via llvm-dev <
llvm-dev at lists.llvm.org> wrote:
> Is the algorithm described in the article "Near-Optimal Instruction
> Selection on DAGs
> (https://llvm.org/pubs/2008-CGO-DagISel.html)" really used in llvm
> instruction selection?
> I've studied implementation...
2018 Apr 07
0
Instruction selection algorithm
...regular selection algorithm, at least for real machines. Additionally, I kind of suspect that there is far more to gain from better transformations during instruction lowering (e.g. in Combine1/Legalize/Combine2) than from better ordering in Select().
—escha
> On Mar 28, 2018, at 3:31 AM, Ivan Kulagin via llvm-dev <llvm-dev at lists.llvm.org> wrote:
>
> Is the algorithm described in the article "Near-Optimal Instruction
> Selection on DAGs
> (https://llvm.org/pubs/2008-CGO-DagISel.html)" really used in llvm
> instruction selection?
> I've studied implementa...