search for: lucef

On Sun, 2010-04-11 at 10:54 +0800, lucefe wrote: > Hi, Dear LLVMers > > I just touch llvm source code for several days, and I didn't know the > interfaces of the analysises and transformations of LLVM. For exampe, > how to backtrace CFG, and whether exits a backtracking interator to do > such work? > > For...

...ry adding the following lines before your pass is inserted into the PassManager: PassRegistry &Registry = *PassRegistry::getPassRegistry(); initializeIPA(Registry); You might require other library initializations. Have a look at the "opt" source code. On 02/12/13 10:36, lucefe wrote: > Dear everyone, > I want to traverse call graph, but I have some trouble . > In my pass MyPass which need to traverse call graph, I firstly added > the CallGraph analysis to the pass requirements by > *AU.addRequired<CallGraph>();* > My pass MyPass then will be add...

lucefe wrote: > I did a simple test just now, but I alse failed. > > I delete several ordered instructions from end to begin, > but after deleting the first instruction(the last instruction of F), > the program crashed. > My test code is below (F is a function only containing several...

Hi, Dear LLVMers I just touch llvm source code for several days, and I didn't know the interfaces of the analysises and transformations of LLVM. For exampe, how to backtrace CFG, and whether exits a backtracking interator to do such work? For a novice, I also seek for suggestions about how to become familiar with LLVM interfaces as soon as possible. Now I have a plan to write a pass based on

I did a simple test just now, but I alse failed. I delete several ordered instructions from end to begin, but after deleting the first instruction(the last instruction of F), the program crashed. My test code is below (F is a function only containing several sequential instructions): for (inst_iterator inst == --inst_end(F); inst != inst_begin(F); --inst) { Instruction * i = &*inst;

Dear everyone, I want to traverse call graph, but I have some trouble . In my pass MyPass which need to traverse call graph, I firstly added the CallGraph analysis to the pass requirements by *AU.addRequired<CallGraph>();* My pass MyPass then will be added to a pass manager by *manager.add(new MyPass());* and then I want to traverse the call graph such as: CallGraph CG =

lucefe wrote: > Hi, > > when I delete some instruction, I got some error prompt message. Deleting instructions can be a little tricky. The problem is that you can't delete an instruction until there are no other instructions that are using it. There are two things that you can do: 1) O...

How to get a constant of some type? For exmple, get a constant 10 of Int32Ty. Perhaps it's a stupid question. Thank you very much in advance. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20100514/1da48d4e/attachment.html>

Hi, I want to compile gnu utility 'find' to get an executed *.bc file, so I use the following commands: ./configure CC=/path/to/llvm-gcc LD=/path/to/llvm-ld make make install However, at the end I did not get any *.bc file, and the generated file 'find' is said to "Invalid bitcode signature". where is the error, and what should I do? Thank you all. noviceup

Hi, Who can recommand me some books about static analysis including systems verification, shape analysis and logic, termination analysis, security and safety, abstract interpretation and algorithms, abstract domain and data structures, pointer analysis, shape analysis, and data flow analysis. I want to read some basic books about the topic, Thank you! With Best Regards to you！ --------------

Hi, when I delete some instruction, I got some error prompt message. - %i.0.reg2mem.0 = phi i32 [ 0, %bb5 ], [ %indvar.next, %bb12 ] ; <i32> [#uses=2] - %s.0.reg2mem.0 = phi i32 [ 0, %bb5 ], [ %tmp16, %bb12 ] ; <i32> [#uses=1] - %tmp14 = tail call i32 @foobar(i32 %i.0.reg2mem.0) nounwind ; <i32> [#uses=1] - %tmp16 = add i32 %tmp14, %s.0.reg2mem.0 ; <i32>

Hi, I am using klee-gcc to compile 'findutils', but I don't know why the variables are all replaced with temp variables(such as %10) and instructions are reordered for optimizations, how can I generate the bytecode and reserve the program variables. I used the next commands without any optimization options: 1. $ ../configure --disable-nls CFLAGS="-g" 2. $