Displaying 4 results from an estimated 4 matches for "operand_a".
2011 Apr 07
2
[LLVMdev] GSoC 2011: Superoptimization for LLVM IR
...erpret instruction semantics in a
different way, so as to find another (and hopefully simpler) instructions to
do the same job, the role of the SAT prover is no longer necessary, since
the search space is constrained to expressions which are semantically
equivalent.
Example:
Transformation: (ADD Operand_A, Contant 0) <- equivalent to-> Operand_A
Using this transformation, the search algorithm now can simplify "add A with
0" to "A" or, what may look initially not so useful, transform any operand A
into an add with A plus 0. Later, this is important to prove we can use an
a...
2011 Apr 08
0
[LLVMdev] GSoC 2011: Superoptimization for LLVM IR
...in a different
> way, so as to find another (and hopefully simpler) instructions to do the same
> job, the role of the SAT prover is no longer necessary, since the search space
> is constrained to expressions which are semantically equivalent.
>
> Example:
> Transformation: (ADD Operand_A, Contant 0) <- equivalent to-> Operand_A
>
> Using this transformation, the search algorithm now can simplify "add A with 0"
> to "A" or, what may look initially not so useful, transform any operand A into
> an add with A plus 0. Later, this is important to pro...
2011 Apr 08
0
[LLVMdev] GSoC 2011: Superoptimization for LLVM IR
...in a
> different way, so as to find another (and hopefully simpler) instructions to
> do the same job, the role of the SAT prover is no longer necessary, since
> the search space is constrained to expressions which are semantically
> equivalent.
> Example:
> Transformation: (ADD Operand_A, Contant 0) <- equivalent to-> Operand_A
> Using this transformation, the search algorithm now can simplify "add A with
> 0" to "A" or, what may look initially not so useful, transform any operand A
> into an add with A plus 0. Later, this is important to prove w...
2011 Apr 06
7
[LLVMdev] GSoC 2011: Superoptimization for LLVM IR
Hello,
I want to present my project for GSoC 2011 for LLVM below. It would be very
nice to hear suggestions and your opinion, thanks!
Superoptimization for LLVM IR
Objective
This project focuses on implementing superoptimization algorithms targeted
at
the LLVM IR. The project uses arbitrary LLVM bitcode as a training set to
discover new peephole optimizations that can be later integrated into