search for: jcdutton

...instruction. How do you verify that the generated CPU specific instruction is correct? Is there an automated method for this? I wish to implement automated testing on a decompiler I am writing, and thought that the test methods used in LLVM might be applicable to my decompiler. ( https://github.com/jcdutton/libbeauty ) The thoughts I have had is to use a 3rd party assembler/disassember such as libbfd and parse the results of the 3rd party one, and compare it to mine. Any help with ideas in this area would help me. Kind Regards James

Hi, I know most compilers go from AST to CFG. I am writing a decompiler, so I was wondering if anyone knew of any documents describing how best to get from CFG to AST. The decompiler project is open source. https://github.com/jcdutton/libbeauty The decompiler already contains a disassembler and a virtual machine resulting in an annotated CFG. It uses information gained from using a virtual machine to annotate the CFG. Another use of the VM will be to help analyze self modifying code. The decompiler can output C source code for...

...gt; I'm not sure that there's anything that will help you with this step for > LLVM.  The closest I can think of is Qemu, and I think that uses dynamic > binary translation (i.e., you have to run the binary program). > No problem. I have already coded (1) and (2) https://github.com/jcdutton/libbeauty It uses a tiny VM to help it do 1 and 2, so will eventually be able to also handle self modifying code. It is similar to qemu in that respect, except that it is not so concerned with real time execution of the code that qemu provides. > >> 3) The blocks or nodes are then analyzed...

...there's anything that will help you with this step > > for LLVM.  The closest I can think of is Qemu, and I think that uses > > dynamic binary translation (i.e., you have to run the binary program). > > > No problem. I have already coded (1) and (2) > https://github.com/jcdutton/libbeauty > It uses a tiny VM to help it do 1 and 2, so will eventually be able to also handle > self modifying code. > It is similar to qemu in that respect, except that it is not so concerned with real > time execution of the code that qemu provides. > > > >> 3) The blo...

Hello I am developing a backend that generates OpenCL from llvm bitcode. I start with a revived fork of the original LLVM C-Backend and have been modifying it. One thing that the backend lacked was generating proper loop structures; instead it relied on labels and goto statements. Therefore, I am trying to find a way to identify the loop structure and print it out in the backend. So far, the main

...12 12:58, James Courtier-Dutton wrote: > Hi, > > I know most compilers go from AST to CFG. > I am writing a decompiler, so I was wondering if anyone knew of any > documents describing how best to get from CFG to AST. > The decompiler project is open source. > https://github.com/jcdutton/libbeauty > > The decompiler already contains a disassembler and a virtual machine > resulting in an annotated CFG. It uses information gained from using a > virtual machine to annotate the CFG. Another use of the VM will be to > help analyze self modifying code. > > The decomp...

On 5/7/12 5:47 AM, James Courtier-Dutton wrote: > Hi, > > I am writing a decompiler. I was wondering if some of LLVM could be > used for a decompiler. > There are several stages in the decompiler process. > 1) Take binary and create a higher level representation of it. Like RTL. > 2) The output is then broken into blocks or nodes, each block ends in > a CALL, JMP, RET, or

Hi, I am writing a decompiler. I was wondering if some of LLVM could be used for a decompiler. There are several stages in the decompiler process. 1) Take binary and create a higher level representation of it. Like RTL. 2) The output is then broken into blocks or nodes, each block ends in a CALL, JMP, RET, or 2-way or multiway conditional JMP. 3) The blocks or nodes are then analyzed for