From: Chris Lattner Date: Mon, 25 Jun 2007 21:50:09 +0000 (+0000) Subject: fix Transforms/Inline/2007-06-25-WeakInline.ll by not inlining functions X-Git-Url: http://plrg.eecs.uci.edu/git/?a=commitdiff_plain;h=ba6801e6e72a9f4de1e116ea81b370456eb7ecd3;p=oota-llvm.git fix Transforms/Inline/2007-06-25-WeakInline.ll by not inlining functions with weak linkage. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37723 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/lib/Transforms/IPO/InlineSimple.cpp b/lib/Transforms/IPO/InlineSimple.cpp index 83cfe901a09..2157dcd2fec 100644 --- a/lib/Transforms/IPO/InlineSimple.cpp +++ b/lib/Transforms/IPO/InlineSimple.cpp @@ -195,10 +195,14 @@ int SimpleInliner::getInlineCost(CallSite CS) { const Function *Caller = TheCall->getParent()->getParent(); // Don't inline a directly recursive call. - if (Caller == Callee) return 2000000000; - - // Don't inline functions marked noinline - if (NeverInline.count(Callee)) return 2000000000; + if (Caller == Callee || + // Don't inline functions which can be redefined at link-time to mean + // something else. link-once linkage is ok though. + Callee->hasWeakLinkage() || + + // Don't inline functions marked noinline. + NeverInline.count(Callee)) + return 2000000000; // InlineCost - This value measures how good of an inline candidate this call // site is to inline. A lower inline cost make is more likely for the call to