search for: concrete_dsp

Displaying 3 results from an estimated 3 matches for "concrete_dsp".

2007 Jun 16
2
[LLVMdev] Runtime optimization of C++ code with virtual functions
Let's say we have the following scheme using C++ and virtual functions: class DSP { public: DSP() {} virtual ~DSP() {} virtual int Compute(int count, float** in, float** out) = 0; }; class CONCRETE_DSP : public DSP { public: CONCRETE_DSP():fValue() {} virtual ~CONCRETE_DSP() {} virtual int Compute(int count, float** in, float** out) { DoSomeProcess(); } }; class SEQ_DDSP : public DSP { private: DSP* fArg1; DSP* fArg2; public: SEQ_DDSP(DSP* a1, DSP* a2):fArg1(a1...
2007 Jun 19
0
[LLVMdev] Runtime optimization of C++ code with virtual functions
...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()); > > graph->Optimize(); > > graph->Compute(512, in, out); possibly a lot of time. > > Is there any possible method using LLVM that would help in this case? LLVM won't help in this case. However, I'd strongly recommen...
2007 Jun 20
1
[LLVMdev] Runtime optimization of C++ code with virtual functions
...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()); >> >> graph->Optimize(); >> >> graph->Compute(512, in, out); possibly a lot of time. >> >> Is there any possible method using LLVM that would help in this case? > > LLVM won't help in this case...