search for: callpenalty

...le jump? 5) fudge factor prefers functions with vector instructions -- why is that? 6) There is one heuristc used in inline-cost computation seems wrong: // Calls usually take a long time, so they make the inlining gain smaller. InlineCost += CalleeFI->Metrics.NumCalls * InlineConstants::CallPenalty; Does it try to block inlining of callees with lots of calls? Note inlining such a function only increase static call counts. Thanks, David -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20101123/07e0f81b/...

...r that the function is a hotspot, and should therefore be inlined. > 6) There is one heuristc used in inline-cost computation seems wrong: > >   // Calls usually take a long time, so they make the inlining gain smaller. >   InlineCost += CalleeFI->Metrics.NumCalls * InlineConstants::CallPenalty; > Does it try to block inlining of callees with lots of calls? Note inlining > such a function only increase static call counts. I'm guessing the heuristic is that functions with lots of calls are heavy and spend a lot of time in their callees, so eliminating the overhead of one call is...

...functions with vector instructions -- why is that? > > 6) There is one heuristc used in inline-cost computation seems wrong: > > > // Calls usually take a long time, so they make the inlining gain > smaller. > InlineCost += CalleeFI->Metrics.NumCalls * InlineConstants::CallPenalty; > > Does it try to block inlining of callees with lots of calls? Note > inlining such a function only increase static call counts. > > > Thanks, > > David > > > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at c...

...01/address-of-label-and-indirect-branches.html for more details. > 6) There is one heuristc used in inline-cost computation seems wrong: > > // Calls usually take a long time, so they make the inlining gain smaller. > InlineCost += CalleeFI->Metrics.NumCalls * InlineConstants::CallPenalty; > > Does it try to block inlining of callees with lots of calls? Note inlining such a function only increase static call counts. I think that this is a heuristic that Jakob came up with, but I think it's a good one, also discussed elsewhere on the thread. When talking about inlining a...

Good evening, Kenneth. Thank you to apply (and rewrite my naive code better) and to file the issue to http://llvm.org/bugs/show_bug.cgi?id=7304 I have checked r105528 at this morning. I think the pass must be still cleaned up and rewritten. There are my two proposals for enhancement. 1) To separate Specialization(and rewriting callsites) to other module. It would be better if new module were

...ructions -- why is that? >> >> 6) There is one heuristc used in inline-cost computation seems wrong: >> >> >> // Calls usually take a long time, so they make the inlining gain >> smaller. >> InlineCost += CalleeFI->Metrics.NumCalls * InlineConstants::CallPenalty; >> >> Does it try to block inlining of callees with lots of calls? Note >> inlining such a function only increase static call counts. >> >> >> Thanks, >> >> David >> >> >> >> _______________________________________________ &gt...

...html > > for more details. > > > 6) There is one heuristc used in inline-cost computation seems wrong: > > > > // Calls usually take a long time, so they make the inlining gain > smaller. > > InlineCost += CalleeFI->Metrics.NumCalls * > InlineConstants::CallPenalty; > > > > Does it try to block inlining of callees with lots of calls? Note > inlining such a function only increase static call counts. > > I think that this is a heuristic that Jakob came up with, but I think it's > a good one, also discussed elsewhere on the thread. &g...