similar to: [LLVMdev] Runtime optimization of C++ code with virtual functions

On Sat, 16 Jun 2007, [ISO-8859-1] St�phane Letz wrote: > At runtime after a graph is created, one could imagine optimizing by > resolving call to "virtual Compute" and possibly get a more > efficient Compute method for the entire graph, so that we could write: > > DSP* graph = new PAR_DSP(new SEQ_DDSP(new CONCRETE_DSP(), new > CONCRETE_DSP()), new CONCRETE_DSP()); >

On Jun 19, 2007, at 1:43 AM, Chris Lattner wrote: > On Sat, 16 Jun 2007, [ISO-8859-1] Stéphane Letz wrote: >> At runtime after a graph is created, one could imagine optimizing by >> resolving call to "virtual Compute" and possibly get a more >> efficient Compute method for the entire graph, so that we could >> write: >> >> DSP* graph = new

> On Wed, 20 Jun 2007, Maurizio Vitale wrote: >>>> Is there any possible method using LLVM that would help in this >>>> case? >>> >>> LLVM won't help in this case. >> >> Is that so or it means that LLVM wouldn't have a prebuilt solution? > > It means that LLVM doesn't have any trivial builtin solution. > >>