similar to: [LLVMdev] how can I compile gnu find utilities

Currently, the Kbuild core manipulates header search paths in a crazy way [1]. To fix this mess, I want all Makefiles to add explicit $(srctree)/ to the search paths in the srctree. Some Makefiles are already written in that way, but not all. The goal of this work is to make the notation consistent, and finally get rid of the gross hacks. Having whitespaces after -I does not matter since commit

Hello, For my backend, I define and use a CC register similiarly to the EFLAGS register in X86 (I call it CCFLAGS). But if I make all arithmetic/logic instructions affect it ('let Defs = [CCFLAGS] in...' in InstrInfo.td) I run into // The only case we should have a dead physreg here without a killing or // instruction where we know it's dead is if it is live-in to the function

Currently, the Kbuild core manipulates header search paths in a crazy way [1]. To fix this mess, I want all Makefiles to add explicit $(srctree)/ to the search paths in the srctree. Some Makefiles are already written in that way, but not all. The goal of this work is to make the notation consistent, and finally get rid of the gross hacks. Having whitespaces after -I does not matter since commit

A physical register cannot be live across the block. So it must have a use in the block or it must be marked dead. From your dump, it looks like the CCFLAGS defs are not being marked dead. It's unclear where things went wrong, but you can step through LiveVariables to debug this. Evan On Jan 9, 2009, at 2:50 AM, Christian Sayer wrote: > Hello, > > For my backend, I define and

Hello, My partner and I am making a small app needs to access a C++ library from the LLVM 2.5 JIT. We've made sure that there are no classes and have put 'extern "c"' in front of the functions we need to access. In order to make this work, we seem to need to have a bitcode version of libstdc++ so we can avoid writing our own implementations of std::string and std::vector.

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！ --------------

On Tue, 2016-12-06 at 17:41 +0200, Michael S. Tsirkin wrote: > It seems that there should be a better way to do it, > but this works too. In some cases there might be: > --- a/drivers/s390/virtio/Makefile > +++ b/drivers/s390/virtio/Makefile > @@ -6,6 +6,8 @@ > ?# it under the terms of the GNU General Public License (version 2 > only) > ?# as published by the Free

On Tue, 2016-12-06 at 17:41 +0200, Michael S. Tsirkin wrote: > It seems that there should be a better way to do it, > but this works too. In some cases there might be: > --- a/drivers/s390/virtio/Makefile > +++ b/drivers/s390/virtio/Makefile > @@ -6,6 +6,8 @@ > ?# it under the terms of the GNU General Public License (version 2 > only) > ?# as published by the Free

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 =

On Mon, Aug 31, 2009 at 12:17 PM, Samuel Crow<samuraileumas at yahoo.com> wrote: > Hello, > > My partner and I am making a small app needs to access a C++ library from the LLVM 2.5 JIT.  We've made sure that there are no classes and have put 'extern "c"' in front of the functions we need to access.  In order to make this work, we seem to need to have a bitcode

Evan, >A physical register cannot be live across the block. So it >must have a use in the block or it must be marked dead. From >your dump, it looks like the CCFLAGS defs are not being marked >dead. It's unclear where things went wrong, but you can step >through LiveVariables to debug this. Thanks for your response. I did quite some stepping through the llc passes, and it

All, I have been trying to get CAPI4Linux working on my machine and being frank am failing miserably! I am looking for any help available, I am real newbie (so please be gentle) and choose to run Mandrake 9.2 as it appears quite friendly (or so I thought!). I have been following the guidance found at http://www.voip-info.org/wiki-Asterisk+How+to+connect+with+CAPI for the AVM card (actually I

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 a novice, I also seek for suggestions about how to become

I recall having a similar problem while coding my own special-purpose "opt". My guess: try 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: > 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 !=

I run latest sparse from git on virtio drivers (turns out the version I had was rather outdated). This patchset fixes a couple of bugs this uncovered, and adds some annotations to make it sparse-clean. In particular, endian-ness is often tricky, so this patchset enabled endian-ness checks for sparse builds. Michael S. Tsirkin (10): virtio_console: drop unused config fields drm/virtio: fix

I run latest sparse from git on virtio drivers (turns out the version I had was rather outdated). This patchset fixes a couple of bugs this uncovered, and adds some annotations to make it sparse-clean. In particular, endian-ness is often tricky, so this patchset enabled endian-ness checks for sparse builds. Michael S. Tsirkin (10): virtio_console: drop unused config fields drm/virtio: fix

To compile an auto-tooled project to bitcode, I used to use plugin-opt=save-temps switch as explained in: http://gbalats.github.io/2015/12/10/compiling-autotooled-projects-to-LLVM-bitcode.html. This switch works with LLVM 3.8.0. However, it seems to have no effect with LLVM 5.0.0. I can see intermediate bitcode files on disk, but not the final one. Is the option removed altogether? Has the switch