similar to: [LLVMdev] NP-hard problems in the LLVM optimizer?

Hi Leslie, I suggest adding these 3 papers to your reading list. Register allocation for programs in SSA-form Sebastian Hack, Daniel Grund, and Gerhard Goos http://www.rw.cdl.uni-saarland.de/~grund/papers/cc06-ra_ssa.pdf Simple and Efficient Construction of Static Single Assignment Form Matthias Braun , Sebastian Buchwald , Sebastian Hack , Roland Leißa , Christoph Mallon , and Andreas

Il giorno 18/mar/2013, alle ore 15:14, Óscar Fuentes <ofv at wanadoo.es> ha scritto: > Nicola Gigante <nicola.gigante at gmail.com> writes: > >> The error I get is the following: >> Undefined symbols for architecture x86_64: >> "typeinfo for llvm::FoldingSetImpl", referenced from: >> typeinfo for llvm::FoldingSet<Type> in Program.o

Hello I'm trying to link my project with llvm 3.2 libraries. I haven't touched the project for some months. Previously I used to link to an svn build of llvm 3.1 and everything worked fine. I've compiled llvm with ./configure --enable-libcpp --enable-cxx11 Currently I'm only using StringRef, SmallVector and FoldingSet, so I only link libLLVMSupport and libLLVMCore. Are they

Il giorno 18/mar/2013, alle ore 18:47, Óscar Fuentes ha scritto: > > You can try building LLVM with > > CXXFLAGS=-frtti configure .... > CXXFLAGS=-frtti make ... > > I'm not sure if CXXFLAGS takes precedence over the hard-coded -fno-rtti > in the makefiles, though. > > With the cmake build, you can try as above (but replacing `configure' > with

Nicola Gigante <nicola.gigante at gmail.com> writes: > The error I get is the following: > Undefined symbols for architecture x86_64: > "typeinfo for llvm::FoldingSetImpl", referenced from: > typeinfo for llvm::FoldingSet<Type> in Program.o > ld: symbol(s) not found for architecture x86_64 > > Looking at the error the question is: is llvm built

Nicola Gigante <nicola.gigante at gmail.com> writes: >> Adding an option for enabling RTTI on the cmake build is trivial. Dunno >> about the `configure' build. You can try filing a feature request on >> Bugzilla. > > Ok, I've managed to refactor some code and remove uses of dynamic_cast. > Making my project work without rtti is a good thing anyway, but

Hi, The libFirm library ( http://www.info.uni-karlsruhe.de/software/libfirm/index.php?title=Main_Page ) is GPLed some time ago. libFirm is a library that provides an intermediate representation and optimizations for compilers. Programs are represented in a graph based SSA form. Several targets are supported, especially the x86. Many optimizations are very similar to those of LLVM. But there are

I'm just starting to dive into llvm, hoping to implement a good graph coloring register allocator. I gather that this has been discussed before. What is the RegAllocGraphColoring.cpp currently in the sources? It seems to be the Fred Chow algorithm but it's not mentioned in the documentation anywhere. Does it work? -Dave

On 4/3/07, David Greene <greened at obbligato.org> wrote: > > I'm just starting to dive into llvm, hoping to implement a > good graph coloring register allocator. I gather that this > has been discussed before. > > What is the RegAllocGraphColoring.cpp currently in the > sources? It seems to be the Fred Chow algorithm but > it's not mentioned in the

Hello to all LLVM Developers. The LLVM IR is in strict SSA form (i.e. every variable is defined before it is used along every path from the entry to exit point)? According to the documentation, currently the LLVM IR is in the SSA form, but I don't see additional information about *strict* SSA form. The strict SSA form provide opportunities of optimization in register allocation, because is

Dear LLVM guys, I am getting an error with my pass implementation, and I cannot figure it out. Basically, I've implemented part of a register allocation algorithm, but I am having problems to set the passes correctly. For instance, for this program below, the following error message is produced: .c ----------------------| .bc ---------------------------------

Hello everybody, On the documentation page for the tailcallelim pass you can read: "This pass transforms functions that are prevented from being tail recursive by an associative expression to use an accumulator variable, thus compiling the typical naive factorial or fib implementation into efficient code” However, I don’t see this behavior when trying to compile this variant of the

> > What do you think about this approach? Whould it be interesting to > implement something like that for LLVM? May be you already have > considered something like that? Are there any plans to it? We have talked about whole function instruction selection but does not have immediate plan to implement it. If we were to implement it today, it would probably be done on DAGs with

I was looking at these SYMBOL NETVISION II NP-3010 VoIP TCP/IP WIRELESS PHONES - I know they have been discontinued. Am I asking for trouble to buy some of these for use on Asterisk? TIA Bart

Hello, all, I want to implement the register allocation algorithm described in the paper "Register Allocation via Coloring of Chordal Graphs, APLAS'05" in LLVM. This is a graph coloring algorithm that can find an optimal coloring of the interference graph in most of the cases. I've downloaded LLVM last week, and started studying the code. Basically, I have to implement: 1) A

Hi, I am looking for some help concerning the npudens function in the np package. I am trying to find a kernel density function of a multivariate dataset and the density evaluated at each of the 176 points. I have 2 continuous and 3 ordered discrete variables. My sample size is 176. So edata is a 176x(2+3) data frame, while tdat is a 1x(2+3) vector. bw_cx[i,] is a 1x (2+3) vector

On Fri, 23 Jun 2006, Fernando Magno Quintao Pereira wrote: > I am getting an error with my pass implementation, and I cannot figure > it out. Basically, I've implemented part of a register allocation > algorithm, but I am having problems to set the passes correctly. For > instance, for this program below, the following error message is > produced: It's hard to say

Hi all, I have a basic model as follow, but when I try to query the database, I get the following error: ''wrong number of arguments (0 for 2)'' I don''t see any problem, I am becoming crazy o_O'' Migration --------- class CreateSubtasks < ActiveRecord::Migration def self.up create_table :subtasks do |t| t.string :hostname, :type t.integer

Dear LLVM guys, I've solved my problem with the passes, and compiled my first code using the new register allocator! Debugging was quite easy, using gdb. The problem was that I was forgetting to initialize the array that records the physical registers ever used (MachineFunction::UsedPhysRegs). This is a very minor thing, but I would suggest asserting that the vector has been initialized

Hi, LLVM already uses dynamic-programming based optimal pattern matching selectors for some of the target architectures. But as far as I know, the code is first converted out of the SSA form, before the selection process takes place. The same approach is used by many other compilers. But there is an article from Erik Eckstein, where a different method is proposed. In the described approach, the