search for: weiren

Hi weiren, Thanks for your suggestion! Yes, I am trying to do this "nested flattening". It seems that I need a post-dominator tree-based algorithm to flatten the nested loops from the innermost to the outermost, level by level. Is there any feature already existed in LLVM tools? Or similar? On...

Thanks Weiren! My goal is to transform the code automatically by doing some code analysis, instead of rewriting it manually. To do this source level auto transformation, do you have any suggestions on what tool to use? Thanks again!! On Mon, Jan 15, 2018 at 04:25 陳韋任 via llvm-dev <llvm-dev at lists...

Hi all, The slides we used on "CGO MCLinker and LLVM Tutorial" are now available on the MCLinker website: http://code.google.com/p/mclinker/wiki/2013CGOTutorial Enjoy! - The CGO Tutorial on MCLinker and LLVM 2013 committee

2018-01-15 9:36 GMT+08:00 Linchuan Chen via llvm-dev < llvm-dev at lists.llvm.org>: > Dear all, > I'm working on a simple code transformation problem that can be > described as below: > > for a C++ loop: > > *for (int i = 0; i < N; ++i) {* > * a = M[i] + b;* > * }* > > I want to transform it to: > > *int A[4]; *

Hi everyone, I hope to implement a feature to transform an IR with "while" or "for" loops to a new IR with no loop. Instead, I just want to use if-else statements in the new IR to implement the original semantics. I can easily write a transform pass to handle the 1-level loop case, but for nested loops it seems a little harder. Can you show me some hints? Thank you very

> 2.i want to write such a test:translate a *.ll(i.e:hello.ll) file to a > *.c file(i.e:hello.c) with llc,then verify if the .c file contian a > certain string(i.e:"abc:). so: It seems you want to test LLVM C backend, go looking for llvm-3.0.src/test/CodeGen/CBackend/* (C backend had been removed from LLVM 3.1). HTH, chenwj -- Wei-Ren Chen (陳韋任) Computer Systems Lab, Institute

Dear all, I'm working on a simple code transformation problem that can be described as below: for a C++ loop: *for (int i = 0; i < N; ++i) {* * a = M[i] + b;* * }* I want to transform it to: *int A[4]; * * for (int i = 0; i < N; ++i) {* * A[0] = M[i] + b;* * A[1] = M[i] + b;* * A[2] = M[i] + b;* * A[3] = M[i] + b;* *

hi,chen: thaks for your explaining,after reading it i have a few problems more. 1.in the sentenses of "X32: subl $-128, %eax" and "; X64: subl $-128," ,i do not know what means that in detail,these sentences were writen follow which language rules? 2.i want to write such a test:translate a *.ll(i.e:hello.ll) file to a *.c file(i.e:hello.c) with llc,then verify if the .c