search for: getcost

...<< NV("Callee", Callee) << " not inlined into " Transforms/IPO/Inliner.cpp- << NV("Caller", Caller) << " because too costly to inline (cost=" Transforms/IPO/Inliner.cpp- << NV("Cost", IC.getCost()) Transforms/IPO/Inliner.cpp- << ", threshold=" << NV("Threshold", IC.getThreshold()) << ")"); Then inside ORE we return right away if the remarks for the given pass is not enabled. This is nice and concise however there is still some o...

...r function, at these points decisions are made whether to execute default actions (as compiler would do without this framework) or to follow alternative paths. Let us consider Inliner example: Original code: if (!IC) { DEBUG(dbgs() << " NOT Inlining: cost=" << IC.getCost() << ", thres=" << (IC.getCostDelta() + IC.getCost()) << ", Call: " << *CS.getInstruction() << "\n"); return false; } Code after instrumentalization: bool doInlinging = (bool)IC; DecisionTreeProxy *dec...

...lt;< NV("Callee", Callee) << " not inlined into " > Transforms/IPO/Inliner.cpp- << NV("Caller", Caller) << " because too costly to inline (cost=" > Transforms/IPO/Inliner.cpp- << NV("Cost", IC.getCost()) > Transforms/IPO/Inliner.cpp- << ", threshold=" << NV("Threshold", IC.getThreshold()) << ")"); > > Then inside ORE we return right away if the remarks for the given pass is not enabled. > > This is nice and concise howe...

...tions (as compiler would do without this framework) > > or to > > follow alternative paths. > > > > Let us consider Inliner example: > > > > Original code: > > > > if (!IC) { > > DEBUG(dbgs() << " NOT Inlining: cost=" << IC.getCost() > > << ", thres=" << (IC.getCostDelta() + IC.getCost()) > > << ", Call: " << *CS.getInstruction() << "\n"); > > return false; > > } > > > > Code after instrumentalization: > > > > bool doIn...

...de > whether to > execute default actions (as compiler would do without this framework) > or to > follow alternative paths. > > Let us consider Inliner example: > > Original code: > > if (!IC) { > DEBUG(dbgs() << " NOT Inlining: cost=" << IC.getCost() > << ", thres=" << (IC.getCostDelta() + IC.getCost()) > << ", Call: " << *CS.getInstruction() << "\n"); > return false; > } > > Code after instrumentalization: > > bool doInlinging = (bool)IC; > DecisionTreeP...

Hi, I’m looking at RegBankSelect’s partially implemented support for deciding to split a value between multiple registers and I’m wondering if it’s actually intended to solve the problem I’m trying to use it for. RegisterBankInfo.h has this example mapping table: /// E.g., /// Let say we have a 32-bit add and a <2 x 32-bit> vadd. We /// can expand the /// <2 x 32-bit> add into

...NV("Callee", Callee) << " not inlined into " >> Transforms/IPO/Inliner.cpp- << NV("Caller", Caller) << " because too costly to inline (cost=" >> Transforms/IPO/Inliner.cpp- << NV("Cost", IC.getCost()) >> Transforms/IPO/Inliner.cpp- << ", threshold=" << NV("Threshold", IC.getThreshold()) << ")"); >> >> Then inside ORE we return right away if the remarks for the given pass is not enabled. >> >> This is n...

...ework) > > > or to > > > follow alternative paths. > > > > > > Let us consider Inliner example: > > > > > > Original code: > > > > > > if (!IC) { > > > DEBUG(dbgs() << " NOT Inlining: cost=" << IC.getCost() > > > << ", thres=" << (IC.getCostDelta() + IC.getCost()) > > > << ", Call: " << *CS.getInstruction() << "\n"); > > > return false; > > > } > > > > > > Code after instrumentalization:...

...(cost = 0.000000e+00) Selected 1 for node 2 (cost = 0.000000e+00) Selected 1 for node 1 (cost = 0.000000e+00) llc: /home/lhames/Projects/llvm/llvm-broken-pbqp/llvm/lib/CodeGen/RegAllocPBQP.cpp:701: bool<unnamed>::PBQPRegAlloc::mapPBQPToRegAlloc(const PBQP::Solution&): Assertion `solution.getCost() != std::numeric_limits<PBQP::PBQPNum>::infinity() && "Invalid (infinite cost) solution for PBQP problem."' failed. The problem is that node 5 is being allocated an infinite cost option (which implies that all its options have infinite cost). The following steps lead t...

...t; Selected 1 for node 2 (cost = 0.000000e+00) > Selected 1 for node 1 (cost = 0.000000e+00) > llc: /home/lhames/Projects/llvm/llvm-broken-pbqp/llvm/lib/CodeGen/RegAllocPBQP.cpp:701: > bool<unnamed>::PBQPRegAlloc::mapPBQPToRegAlloc(const PBQP::Solution&): > Assertion `solution.getCost() != > std::numeric_limits<PBQP::PBQPNum>::infinity() && "Invalid (infinite > cost) solution for PBQP problem."' failed. > > The problem is that node 5 is being allocated an infinite cost option > (which implies that all its options have infinite cost). T...

Hi Lang, I'm surprised about the fact that you omit R1/R2 reductions in some cases. Can you give a more detailed description of the bug (e.g. a PBQP dump)? Best regards, Sebastian Lang Hames wrote: > Hi Sachin, llvm-dev, > > I've just committed a new PBQP solver which, among other things, > should take care of this bug. > > Please let me know how it works out for you.

Hi Sachin, llvm-dev, I've just committed a new PBQP solver which, among other things, should take care of this bug. Please let me know how it works out for you. Cheers, Lang. On Tue, Dec 15, 2009 at 5:54 PM, Lang Hames <lhames at gmail.com> wrote: > Hi Sachin, > > Yes. Bernhard Scholz and I have just discussed a fix for this. I hope to > commit it in the next few days. I