RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-26 22:42:46 +02:00
Code Issues Projects Releases Wiki Activity
63,286 Commits 4 Branches 5 Tags 704 MiB
9b12559c4f
Commit Graph

3306 Commits

Author SHA1 Message Date
Chris Lattner
d8288040c3 fix PR7429, a crash turning a load from a string into a float. 
llvm-svn: 108113
 2010-07-12 00:22:51 +00:00
Gabor Greif
0a544667f8 remove useless cast and fix typos in comment 
llvm-svn: 107989
 2010-07-09 16:42:04 +00:00
Gabor Greif
a2c75f904d cache result of operator* 
llvm-svn: 107988
 2010-07-09 16:39:02 +00:00
Gabor Greif
e249fc8808 cache result of operator* 
llvm-svn: 107982
 2010-07-09 16:22:36 +00:00
Gabor Greif
1277447002 cache result of operator* 
llvm-svn: 107978
 2010-07-09 15:53:42 +00:00
Gabor Greif
9096841571 cache result of operator* 
llvm-svn: 107977
 2010-07-09 15:52:36 +00:00
Gabor Greif
6184b1a2fa cache result of operator* 
llvm-svn: 107976
 2010-07-09 15:40:10 +00:00
Gabor Greif
6c80602356 cache result of operator* 
llvm-svn: 107967
 2010-07-09 14:28:41 +00:00
Gabor Greif
7bc80c7586 do not repeatedly dereference use_iterator 
llvm-svn: 107963
 2010-07-09 13:17:13 +00:00
Stuart Hastings
a3999081cf Reverting r107918 and r107919. Radar 8063111. 
llvm-svn: 107930
 2010-07-08 23:25:39 +00:00
Stuart Hastings
b70d4e06e3 Fix decl/def debug info for template functions. Radar 8063111. 
llvm-svn: 107919
 2010-07-08 22:28:59 +00:00
Dan Gohman
dbfdd07710 Minore code simplification. 
llvm-svn: 107777
 2010-07-07 14:30:04 +00:00
Dan Gohman
2a08e2ce81 Remove interprocedural-basic-aa and associated code. The AliasAnalysis 
interface needs implementations to be consistent, so any code which
wants to support different semantics must use a different interface.
It's not currently worthwhile to add a new interface for this new
concept.

Document that AliasAnalysis doesn't support cross-function queries.

llvm-svn: 107776
 2010-07-07 14:27:09 +00:00
Gabor Greif
600c671ab6 conditionalize by CallInst::ArgOffset 
llvm-svn: 107767
 2010-07-07 10:34:03 +00:00
Dan Gohman
0cea029f14 Add some more TODO comments. 
llvm-svn: 107657
 2010-07-06 15:23:00 +00:00
Dan Gohman
fa0252225f Add a comment. 
llvm-svn: 107656
 2010-07-06 15:21:57 +00:00
Dan Gohman
f9365363db Remove context sensitivity concerns from interprocedural-basic-aa, and 
make it more aggressive in cases where both pointers are known to live
in the same function.

llvm-svn: 107420
 2010-07-01 20:08:40 +00:00
Dan Gohman
547c92af20 In ScalarEvolution::forgetValue, eliminate any SCEVUnknown 
entries associated with the value being erased in the
folding set map.  These entries used to be harmless, because
a SCEVUnknown doesn't store any information about its Value*,
so having a new Value allocated at the old Value's address
wasn't a problem. But now that ScalarEvolution is storing more
information about values, this is no longer safe.

llvm-svn: 107316
 2010-06-30 20:21:12 +00:00
Dan Gohman
683a9e2498 Revert the part of r107257 which introduced new logic for using 
nsw and nuw flags from IR Instructions. On further consideration,
this isn't valid.

llvm-svn: 107298
 2010-06-30 17:27:11 +00:00
Dan Gohman
b7fc09a156 Improve ScalarEvolution's nsw and nuw preservation. 
llvm-svn: 107257
 2010-06-30 07:16:37 +00:00
Dan Gohman
7446416058 When computing a new ConservativeResult, intersect it with 
the old one instead of replacing it, to be more precise.

llvm-svn: 107256
 2010-06-30 06:58:35 +00:00
Dan Gohman
2112bbf184 Rework scev-aa's basic computation so that it doesn't depend 
on ScalarEvolution successfully folding and preserving
range information for both A-B and B-A. Now, if it gets
either one, it's sufficient.

llvm-svn: 107249
 2010-06-30 06:12:16 +00:00
Dan Gohman
01304ebfad Simplify. 
llvm-svn: 107248
 2010-06-30 06:09:46 +00:00
Dan Gohman
32534063c7 Fix ScalarEvolution's tripcount computation for chains of loops 
where each loop's induction variable's start value is the exit
value of a preceding loop.

llvm-svn: 107224
 2010-06-29 23:43:06 +00:00
Dan Gohman
1c9ce3e66d Fix whitespace style. 
llvm-svn: 107175
 2010-06-29 18:12:34 +00:00
Duncan Sands
b367b1e428 Remove a pointless variable. 
llvm-svn: 107128
 2010-06-29 11:39:45 +00:00
Benjamin Kramer
acb45b427b Use a more obvious way to avoid compiling functions which are only used when XDEBUG is enabled. 
llvm-svn: 107125
 2010-06-29 10:03:11 +00:00
Chandler Carruth
e9bf8c4ee8 Jump through some silly hoops to make GCC accept that a function may not always 
be called.

llvm-svn: 107124
 2010-06-29 06:46:00 +00:00
Dan Gohman
f5dfb360be Just as its not safe to blindly transfer the nsw bit from an add 
instruction to an add scev, it's not safe to blindly transfer the
inbounds flag from a gep instruction to an nsw on the scev for the
gep.

llvm-svn: 107117
 2010-06-29 01:41:41 +00:00
Dan Gohman
37bf33ccff Add an Intraprocedural form of BasicAliasAnalysis, which aims to 
properly handles instructions and arguments defined in different
functions, or across recursive function iterations.

llvm-svn: 107109
 2010-06-29 00:50:39 +00:00
Dan Gohman
bd121d9b9f Fix Value::stripPointerCasts and BasicAA to avoid trouble on 
code in unreachable blocks, which have have use-def cycles.
This fixes PR7514.

llvm-svn: 107071
 2010-06-28 21:16:52 +00:00
Dan Gohman
d454f5c234 Generalize AAEval so that it can be used both per-function and 
interprocedurally. Note that as of this writing, existing alias
analysis passes are not prepared to be used interprocedurally.

llvm-svn: 107013
 2010-06-28 16:01:37 +00:00
Devang Patel
fdca552823 Use named MDNode, llvm.dbg.sp, to collect subprogram info. This will be used to emit local variable's debug info of deleted functions. 
llvm-svn: 106989
 2010-06-28 05:53:08 +00:00
Devang Patel
858a0f3664 Do not forget last element, function, while creating Subprogram definition MDNode from subprogram declare MDNode. 
llvm-svn: 106985
 2010-06-27 21:04:31 +00:00
Dan Gohman
01de3704f9 Eliminate a redundant FoldingSet lookup. 
llvm-svn: 106872
 2010-06-25 18:47:08 +00:00
Dan Gohman
bfbfa95b51 Don't try to preserve pointer types in SCEVConstants; the old code 
was over-complicated.

llvm-svn: 106760
 2010-06-24 16:47:03 +00:00
Dan Gohman
35a5a7285a Make the trunc code consistent with the zext and sext code in its 
handling of pointer types.

llvm-svn: 106757
 2010-06-24 16:33:38 +00:00
Gabor Greif
b86c04f740 use ArgOperand accessors 
llvm-svn: 106697
 2010-06-23 23:38:07 +00:00
Gabor Greif
bfb7386690 use the new isFreeCall API and ArgOperand accessors 
llvm-svn: 106692
 2010-06-23 22:48:06 +00:00
Gabor Greif
4615fc1c93 minor enhancement to llvm::isFreeCall API: return CallInst; no functional change 
llvm-svn: 106686
 2010-06-23 21:51:12 +00:00
Gabor Greif
0b348ae475 use ArgOperand getters 
llvm-svn: 106685
 2010-06-23 21:41:47 +00:00
Dan Gohman
f44783ab4e Replace ScalarEvolution's private copy of getLoopPredecessor 
with LoopInfo's public copy.

llvm-svn: 106603
 2010-06-22 23:43:28 +00:00
Dan Gohman
74d5144414 Use pre-increment instead of post-increment when the result is not used. 
llvm-svn: 106542
 2010-06-22 15:08:57 +00:00
Dan Gohman
a3bc6b13f7 Allow "exhaustive" trip count evaluation on phi nodes with all 
constant operands.

llvm-svn: 106537
 2010-06-22 13:15:46 +00:00
Devang Patel
f50b6147ad Use single interface, using twine, to get named metadata. 
getNamedMetadata().

llvm-svn: 106518
 2010-06-22 01:19:38 +00:00
Devang Patel
dee41b010a Do not rely on Twine temporaries to survive. 
llvm-svn: 106515
 2010-06-22 01:01:58 +00:00
Dan Gohman
6a3c46ad49 Use A.append(...) instead of A.insert(A.end(), ...) when A is a 
SmallVector, and other SmallVector simplifications.

llvm-svn: 106452
 2010-06-21 19:47:52 +00:00
Devang Patel
3dbb143c29 Do not directly use function names to construct new name for named metadata. 
"llvm.dbg.lv.~A" is not a valid name.

llvm-svn: 106438
 2010-06-21 18:36:58 +00:00
Dan Gohman
90c5f8753d Restore a call to rememberInstruction which was accidentally dropped 
in refactoring.

llvm-svn: 106398
 2010-06-19 22:50:35 +00:00
Dan Gohman
cec5b682b6 Fix ScalarEvolution's "exhaustive" trip count evaluation code to avoid 
assuming that loops are in canonical form, as ScalarEvolution doesn't
depend on LoopSimplify itself. Also, with indirectbr not all loops can
be simplified. This fixes PR7416.

llvm-svn: 106389
 2010-06-19 14:17:24 +00:00
Dan Gohman
fb091c213b Factor out duplicated code for reusing and inserting casts into 
a helper function.

llvm-svn: 106388
 2010-06-19 13:25:23 +00:00
Dan Gohman
b5ec637e57 Revert r106304 (105548 and friends), which are the SCEVComplexityCompare 
optimizations. There is still some nondeterminism remaining.

llvm-svn: 106306
 2010-06-18 19:54:20 +00:00
Dan Gohman
527b570925 Reapply 105540, 105542, and 105548, and revert r105732. 
llvm-svn: 106304
 2010-06-18 19:26:04 +00:00
Dan Gohman
75f6f94c48 Reapply 105546. 
llvm-svn: 106302
 2010-06-18 19:12:32 +00:00
Dan Gohman
ab895769a7 Reapply 105544. 
llvm-svn: 106301
 2010-06-18 19:09:27 +00:00
Dan Gohman
e20e668c7e Remove getIntegerSCEV; it's redundant with getConstant, and getConstant 
is more consistent with the ConstantInt API.

llvm-svn: 106281
 2010-06-18 14:33:50 +00:00
Dan Gohman
0b5b93b20d Eliminate unnecessary uses of getZExtValue(). 
llvm-svn: 106279
 2010-06-18 14:22:04 +00:00
Dan Gohman
eab6b51039 Fix a typo in a comment. 
llvm-svn: 106260
 2010-06-18 00:53:08 +00:00
Dan Gohman
1d9d93381a Simplify this code. 
llvm-svn: 106254
 2010-06-17 23:34:09 +00:00
Jim Grosbach
67b46d6303 A few more places where SCEVExpander bits need to skip over debug intrinsics 
when iterating through instructions. Yet more work for rdar://7797940

llvm-svn: 106149
 2010-06-16 21:13:38 +00:00
Devang Patel
108d77796f Check function pointer first, before comparing function names. 
llvm-svn: 106088
 2010-06-16 06:42:02 +00:00
Devang Patel
3282324020 Use separate named MDNode to hold each function's local variable info. 
This speeds up local variable handling in DwarfDebug.

llvm-svn: 106075
 2010-06-16 00:53:55 +00:00
Stuart Hastings
f9ef9ff3d6 Support for nested functions/classes in debug output. (Again.) Radar 7424645. 
llvm-svn: 105828
 2010-06-11 20:08:44 +00:00
Stuart Hastings
7b15c202c7 Delete duplicate function. 
llvm-svn: 105827
 2010-06-11 20:05:01 +00:00
Evan Cheng
28c151ae52 Revert 105540, 105542, 105544, 105546, and 105548 to unbreak bootstrapping. 
llvm-svn: 105740
 2010-06-09 18:59:43 +00:00
Kenneth Uildriks
2c6b68924d Pulled CodeMetrics out of InlineCost.h and made it a bit more general, so it can be reused from PartialSpecializationCost 
llvm-svn: 105725
 2010-06-09 15:11:37 +00:00
Dan Gohman
490f4d7020 The FoldingSet hash data includes pointer values, so it isn't 
determinstic. Instead, give SCEV objects an arbitrary sequence
number.

llvm-svn: 105548
 2010-06-07 19:36:14 +00:00
Dan Gohman
ee75f6f4dd Optimize this code somewhat by taking advantage of the fact 
that the operands are sorted.

llvm-svn: 105546
 2010-06-07 19:20:57 +00:00
Dan Gohman
e4676a62de Micro-optimize this, to speed up this hotspot in debug builds a little. 
llvm-svn: 105544
 2010-06-07 19:16:37 +00:00
Dan Gohman
044a968609 Micro-optimize this. 
llvm-svn: 105542
 2010-06-07 19:12:54 +00:00
Dan Gohman
65954b2eb4 Optimize ScalarEvolution's SCEVComplexityCompare predicate: don't go 
scrounging through SCEVUnknown contents and SCEVNAryExpr operands;
instead just do a simple deterministic comparison of the precomputed
hash data.

Also, since this is more precise, it eliminates the need for the slow
N^2 duplicate detection code.

llvm-svn: 105540
 2010-06-07 19:06:13 +00:00
Bill Wendling
a96eaed21d Create new accessors to get arguments for call/invoke instructions. It breaks 
encapsulation to force the users of these classes to know about the internal
data structure of the Operands structure. It also can lead to errors, like in
the MSIL writer.

llvm-svn: 105539
 2010-06-07 19:05:06 +00:00
Stuart Hastings
37ed2a9663 Revert 105492 & 105493 due to a testcase regression. Radar 7424645. 
llvm-svn: 105511
 2010-06-05 00:39:29 +00:00
Dan Gohman
1865db1b89 LSR needs to remember inserted instructions even in postinc mode, because 
there could be multiple subexpressions within a single expansion which
require insert point adjustment. This fixes PR7306.

llvm-svn: 105510
 2010-06-05 00:33:07 +00:00
Stuart Hastings
eb78f8db98 Support for nested functions/classes in debug output. Radar 7424645. 
llvm-svn: 105492
 2010-06-04 22:36:03 +00:00
Dan Gohman
332b06bd4f Fix normalization and de-normalization of non-affine SCEVs. 
llvm-svn: 105480
 2010-06-04 19:16:34 +00:00
Dan Gohman
56a2a0fb80 Fix the noalias checking so that it doesn't worry about 
an argument aliasing itself. Thanks Duncan!

llvm-svn: 105288
 2010-06-01 20:51:40 +00:00
Dan Gohman
13a88a7def Fix AliasDebugger to be aware of operand values too. 
llvm-svn: 105012
 2010-05-28 22:31:51 +00:00
Dan Gohman
fe69bf7b4c Add lint checks for function attributes. 
llvm-svn: 105009
 2010-05-28 21:43:57 +00:00
Dan Gohman
a20b0d02e6 Fix lint's memcpy and memmove checks, and its basic block traversal. 
llvm-svn: 104970
 2010-05-28 17:44:00 +00:00
Dan Gohman
9a50a9215c Detect self-referential values. 
llvm-svn: 104957
 2010-05-28 16:45:33 +00:00
Stuart Hastings
369d3391d8 Revert 104841, 104842, 104876 due to buildbot failures. Radar 7424645. 
llvm-svn: 104953
 2010-05-28 16:41:07 +00:00
Dan Gohman
8570c1a249 Eli pointed out that va_arg instruction result values don't 
reference the stack.

llvm-svn: 104951
 2010-05-28 16:34:49 +00:00
Dan Gohman
7981165281 Teach lint how to look through simple store+load pairs and other 
effective no-op constructs, to make it more effective on
unoptimized IR.

llvm-svn: 104950
 2010-05-28 16:21:24 +00:00
Dan Gohman
0d7d3faf8e Move FindAvailableLoadedValue isSafeToLoadUnconditionally out of 
lib/Transforms/Utils and into lib/Analysis so that Analysis passes
can use them.

llvm-svn: 104949
 2010-05-28 16:19:17 +00:00
Dan Gohman
5ba21692e6 ConstantFoldConstantExpression can theoretically return null. 
llvm-svn: 104948
 2010-05-28 16:12:08 +00:00
Dan Gohman
a6c568fa77 Add a lint check for returning the address of stack memory. 
llvm-svn: 104936
 2010-05-28 04:33:42 +00:00
Stuart Hastings
60d799e343 Support for nested functions/classes in debug output. Radar 7424645. 
llvm-svn: 104841
 2010-05-27 16:16:54 +00:00
Jakob Stoklund Olesen
2803135445 Avoid counting InlineAsm as a call - it prevents loop unrolling. 
PR7026
Patch by Pekka Jääskeläinen!

llvm-svn: 104780
 2010-05-26 22:40:28 +00:00
Dan Gohman
0b5922b032 Fix Lint printing warnings multiple times. Remove the ErrorStr 
option from lintModule, which was an artifact from being
based on Verifier code.

llvm-svn: 104765
 2010-05-26 22:28:53 +00:00
Dan Gohman
2c70e05105 Reinstate checking of stackrestore, with checking for both Read 
and Write, and add a comment explaining this.

llvm-svn: 104756
 2010-05-26 22:21:25 +00:00
Dan Gohman
5ec2a338ac Stackrestore is not a load. 
llvm-svn: 104752
 2010-05-26 22:00:10 +00:00
Dan Gohman
35b59125b0 Remove a TODO which isn't practical. 
llvm-svn: 104748
 2010-05-26 21:50:41 +00:00
Dan Gohman
6b78ee79c1 Implement checking of the tail keyword. 
llvm-svn: 104744
 2010-05-26 21:46:36 +00:00
Devang Patel
3d4cd812aa Rename variable. add comment. 
llvm-svn: 104274
 2010-05-20 20:35:24 +00:00
Devang Patel
2b99c27e47 Add support to preserve type info for the variables that are removed by the optimizer. 
llvm-svn: 103798
 2010-05-14 21:01:35 +00:00
Nick Lewycky
b5bf752087 Clear CachedFunctionInfo upon Pass::releaseMemory. Because ValueMap will abort 
on RAUW of functions, this is a correctness issue instead of a mere memory
usage problem.


No testcase until the new MergeFunctions can land.

llvm-svn: 103653
 2010-05-12 21:48:15 +00:00
Dan Gohman
b993c131bd Fix whitespace in debug output to be consistent. 
llvm-svn: 103422
 2010-05-10 20:07:44 +00:00
Devang Patel
14f07a8625 Remove DIGlobal. 
llvm-svn: 103325
 2010-05-07 23:19:07 +00:00
Devang Patel
62b4a23a3b Add DINameSpace::Verify(). 
llvm-svn: 103318
 2010-05-07 23:04:32 +00:00
Devang Patel
3c2f4664fc Verify variable directly. 
llvm-svn: 103305
 2010-05-07 22:04:20 +00:00
Devang Patel
0743ea736f Verify compile unit also. 
llvm-svn: 103300
 2010-05-07 21:42:24 +00:00
Devang Patel
0638b539bb Wrap const MDNode * inside DIDescriptor. 
llvm-svn: 103295
 2010-05-07 20:54:48 +00:00
Devang Patel
5b2d1c23a7 Use overloaded operators instead of DIDescriptor::getNode() 
llvm-svn: 103276
 2010-05-07 18:19:32 +00:00
Devang Patel
02bb578ffd Avoid DIDescriptor::getNode(). Use overloaded operators instead. 
llvm-svn: 103272
 2010-05-07 18:11:54 +00:00
Dan Gohman
073b9dc2df Add some words to this output to indicate what the numbers mean. 
llvm-svn: 103264
 2010-05-07 16:39:27 +00:00
Dan Gohman
38fe30a595 Add a simple module-level debug info printer. It just sets up a 
DebugInfoFinder and iterates over all the contents calling print.

llvm-svn: 103262
 2010-05-07 16:22:32 +00:00
Dan Gohman
2ec28eb3fe Fix the new print functions to call print instead of dump. 
llvm-svn: 103261
 2010-05-07 16:17:22 +00:00
Dan Gohman
612fbfa641 Convert the DebugInfo classes dump() methods into print(raw_ostream &) 
methods, and add dump functions implemented in terms of the print.

llvm-svn: 103254
 2010-05-07 15:30:29 +00:00
Dan Gohman
5c61a913b2 Use the SCEVAddRecExpr::getPostIncExpr utility function instead 
of doing the same thing manually.

llvm-svn: 102997
 2010-05-04 01:12:27 +00:00
Dan Gohman
4e1dbacdf8 Fix a copy+pasto. 
llvm-svn: 102996
 2010-05-04 01:11:15 +00:00
Devang Patel
edbef722d6 Do not ignore debug loc attached with llvm.dbg.declare while collecting debug info used by a module. 
llvm-svn: 102995
 2010-05-04 01:05:02 +00:00
Dan Gohman
2f27d59870 Use getConstant instead of getIntegerSCEV. The two are basically the 
same, now that getConstant has overloads consistent with ConstantInt::get.

llvm-svn: 102965
 2010-05-03 22:09:21 +00:00
Dan Gohman
66c6519877 Silence warnings about -1 being converted to an unsigned value. 
Also, pass true for isSigned even when creating constants for unsigned
comparisons, because the point is to create an all-ones constant,
rather than UINT64_MAX, even for integers wider than 64 bits.

llvm-svn: 102946
 2010-05-03 20:23:47 +00:00
Dan Gohman
51faf74c7d Use isTrueWhenEqual and isFalseWhenEqual instead of assuming that 
SimplifyICmpOperands will simplify such cases to EQ or NE. This makes
the correcntess of the code independent on SimplifyICmpOperands doing
certain simplifications.

llvm-svn: 102927
 2010-05-03 18:00:24 +00:00
Dan Gohman
b4fdc7ea81 In ScalarEvolution::print, don't bother printing out the SCEVs for 
comparison instructions, since they aren't interesting, despite having
integer result types.

llvm-svn: 102925
 2010-05-03 17:03:23 +00:00
Dan Gohman
043875bc90 In SimplifyICmpOperands, avoid needlessly swapping the operands in the 
case where both are addrecs in unrelated loops.

llvm-svn: 102924
 2010-05-03 17:00:11 +00:00
Dan Gohman
02c26ed601 Factor out the new <= and >= analysis code into SimplifyICmpOperands. 
llvm-svn: 102922
 2010-05-03 16:35:17 +00:00
David Chisnall
52a91e993b Added a variant of InlineCostAnalyzer::getInlineCost() that takes the called function as an explicit argument, for use when inlining function pointers. 
llvm-svn: 102841
 2010-05-01 15:47:41 +00:00
Chris Lattner
61a8beaae0 fix PR5009 by making CGSCCPM realize that a call was devirtualized 
if an indirect call site was removed and a direct one was added, not
just if an indirect call site was modified to be direct.

llvm-svn: 102830
 2010-05-01 06:38:43 +00:00
Chris Lattner
9ee72a47c2 Implement rdar://6295824 and PR6724 with two tiny changes 
that can have a big effect :).  The first is to enable the
iterative SCC passmanager juice that kicks in when the
scc passmgr detects that a function pass has devirtualized
a call.  In this case, it will rerun all the passes it 
manages on the SCC, up to the iteration count limit (4). This
is useful because a function pass may devirualize a call, and
we want the inliner to inline it, or pruneeh to infer stuff
about it, etc.

The second patch is to add *all* call sites to the 
DevirtualizedCalls list the inliner uses.  This list is
about to get renamed, but the jist of this is that the 
inliner now reconsiders *all* inlined call sites as candidates
for further inlining.  The intuition is this that in cases 
like this:

f() { g(1); }     g(int x) { h(x); }

We analyze this bottom up, and may decide that it isn't 
profitable to inline H into G.  Next step, we decide that it is
profitable to inline G into F, and do so, which means that F 
now calls H.  Even though the call from G -> H may not have been
profitable to inline, the call from F -> H may be (in this case
because a constant allows folding etc).

In my spot checks, this doesn't have a big impact on code.  For
example, the LLC output for 252.eon grew from 0.02% (from
317252 to 317308) and 176.gcc actually shrunk by .3% (from 1525612
to 1520964 bytes).  252.eon never iterated in the SCC Passmgr,
176.gcc iterated at most 1 time.

llvm-svn: 102823
 2010-05-01 01:15:56 +00:00
Chris Lattner
3eb6a9f076 Dan recently disabled recursive inlining within a function, but we 
were still inlining self-recursive functions into other functions.

Inlining a recursive function into itself has the potential to
reduce recursion depth by a factor of 2, inlining a recursive
function into something else reduces recursion depth by exactly 
1.  Since inlining a recursive function into something else is a
weird form of loop peeling, turn this off.

The deleted testcase was added by Dale in r62107, since then
we're leaning towards not inlining recursive stuff ever.  In any
case, if we like inlining recursive stuff, it should be done 
within the recursive function itself to get the algorithm 
recursion depth win.

llvm-svn: 102798
 2010-04-30 22:37:22 +00:00
Devang Patel
52c2d4d378 Attach AT_APPLE_optimized attribute to optimized function's debug info. 
llvm-svn: 102743
 2010-04-30 19:38:23 +00:00
Dan Gohman
116829ede7 Set isSigned to true when creating an all-ones integer constant, even 
for unsigned purposes, so >64-bit integer values get a full all-ones
value.

llvm-svn: 102739
 2010-04-30 19:22:39 +00:00
Dan Gohman
3c454a3df0 Silence compiler warnings. 
llvm-svn: 102734
 2010-04-30 19:21:13 +00:00
Dan Gohman
6944fae2f6 Add lint checks for invalid uses of memory. 
llvm-svn: 102733
 2010-04-30 19:05:00 +00:00
Devang Patel
bdfc01f418 Refactor. 
llvm-svn: 102661
 2010-04-29 20:40:36 +00:00
Dan Gohman
40561dd0ba When checking whether the special handling for an addrec increment which 
doesn't dominate the header is needed, don't check whether the increment
expression has computable loop evolution. While the operands of an
addrec are required to be loop-invariant, they're not required to 
dominate any part of the loop. This fixes PR6914.

llvm-svn: 102389
 2010-04-26 21:46:36 +00:00
Dan Gohman
231fe284cd ScalarEvolution support for <= and >= loops. 
Also, generalize ScalarEvolutions's min and max recognition to handle
some new forms of min and max that this change makes more common.

llvm-svn: 102234
 2010-04-24 03:09:42 +00:00
Dan Gohman
bae847c4c6 Use SimplifyICmpOperands in isKnownPredicate too. 
llvm-svn: 102233
 2010-04-24 01:38:36 +00:00
Dan Gohman
815586b78c Update isImpliedCond to use the new SimplifyICmpOperands utility. 
llvm-svn: 102232
 2010-04-24 01:34:53 +00:00
Dan Gohman
0fbfae5efe Add a new utility function SimplifyICmpOperands. Much of this code is 
refactored out of ScalarEvolution::isImpliedCond, which will be updated
to use this new utility routine soon.

llvm-svn: 102229
 2010-04-24 01:28:42 +00:00
Chris Lattner
a69f36cccb fix callgraph dump to not print 0x0x1234 for nodes. 
Add the instruction pointer value for debuggability.  
We now get dump output that looks like this:

Call graph node for function: 'f1'<<0x1017086b0>>  #uses=1
  CS<0x1017046f8> calls external node

Call graph node for function: '_ZNSt6vectorIdSaIdEEC1EmRKdRKS0_'<<0x1017086f0>>  #uses=1
  CS<0x0> calls external node

Call graph node for function: 'f4'<<0x1017087a0>>  #uses=1
  CS<0x101708c88> calls function 'f3'

llvm-svn: 102194
 2010-04-23 18:23:40 +00:00
Dan Gohman
38949c2f1f Fix LSR to tolerate cases where ScalarEvolution initially 
misses an opportunity to fold add operands, but folds them
after LSR has separated them out. This fixes rdar://7886751.

llvm-svn: 102157
 2010-04-23 01:55:05 +00:00
Dan Gohman
4196c77b3b When it doesn't matter whether zero or sign extension is used, 
use ScalarEvolutions "any" extend function.

llvm-svn: 102156
 2010-04-23 01:51:29 +00:00
Chris Lattner
66e308198d add a DEBUG call so that -debug lists when CGSCCPM iterates. 
Fix RefreshCallGraph to use CGN->replaceCallEdge instead of hand
rolling its own loop.  replaceCallEdge properly maintains the
reference counts of the nodes, fixing a crash exposed by the
iterative callgraph stuff.

llvm-svn: 102120
 2010-04-22 20:42:33 +00:00
Dan Gohman
31d6b29bae Don't attempt to analyze values which are obviously undef. This fixes some 
assertion failures in extreme cases.

llvm-svn: 102042
 2010-04-22 01:35:11 +00:00
Dan Gohman
1af81d31e9 Tidy a comment. 
llvm-svn: 102041
 2010-04-22 01:30:05 +00:00
Dan Gohman
4ca879bebb Make ScalarEvolution::getConstant support pointer types, for consistency 
with ScalarEvolution's overall approach to pointer types.

llvm-svn: 102003
 2010-04-21 16:04:04 +00:00
Chris Lattner
c840cfe5c9 Implement (but don't enable) PR6724 and rdar://6295824. In short, 
we have RefreshCallGraph detect when a function pass devirtualizes
a call, and have CGSCCPassMgr iterate (up to a count) when this 
happens.  This allows (in the example) GVN to devirtualize the 
call in foo, then the inliner to inline it away.

This is not currently enabled because I haven't done any analysis
on the (potentially substantial) code size or performance impact of
doing this, and guess what, it exposes callgraph updating bugs in
various passes.  This is progress though, and you can play with it
by passing -max-cg-scc-iterations=5 to opt.

llvm-svn: 101973
 2010-04-21 00:47:40 +00:00
Dan Gohman
4d1724c3e8 Revert r101471. For tight recursive functions which have multiple 
recursive callsites, inlining can reduce the number of calls by
exponential factors, as it does in
MultiSource/Benchmarks/Olden/treeadd. More involved heuristics
will be needed.

llvm-svn: 101969
 2010-04-21 00:43:30 +00:00
Benjamin Kramer
b61f85894f PR6880: Don't dereference CallsExternalNode if it's NULL. 
llvm-svn: 101897
 2010-04-20 12:16:50 +00:00
Chris Lattner
b6b95141ec move some select simplifications out out instcombine into 
inst simplify.  No functionality change.

llvm-svn: 101873
 2010-04-20 05:32:14 +00:00
Chris Lattner
2f4001f3a8 make CallGraphNode dtor abort if a node is deleted when there are still 
references to it.

llvm-svn: 101847
 2010-04-20 00:47:34 +00:00
Dan Gohman
e52396cb52 Remove the Expr member from IVUsers. Instead of remembering the expression, 
just ask ScalarEvolution for it on demand. This helps IVUsers be more robust
in the case of expressions changing underneath it. This fixes PR6862.

llvm-svn: 101819
 2010-04-19 21:48:58 +00:00
Chris Lattner
a5eb6419eb fix PR6858: a dangling pointer use bug which was caused 
by switching CachedFunctionInfo from a std::map to a 
ValueMap (which is implemented in terms of a DenseMap).

DenseMap has different iterator invalidation semantics
than std::map.

This should hopefully fix the dragonegg builder.

llvm-svn: 101658
 2010-04-17 17:57:56 +00:00
Chris Lattner
d506ae2617 a bunch of cleanups and tweaks, no functionality changes. 
llvm-svn: 101657
 2010-04-17 17:55:00 +00:00
Chris Lattner
bef627e798 reenable r101565, removing a problematic assertion. 
CGSCC can delete nodes in regions of the callgraph that
have already been visited.  If new CG nodes are allocated
to the same pointer, we shouldn't abort, just handle it
correctly by assigning a new number.  This should restore
stability by removing invalidated pointers that *will* be
reused from the densemap in the iterator.

llvm-svn: 101628
 2010-04-17 07:17:19 +00:00
Chris Lattner
36a76e4185 disable r101565: an assert is getting triggered. More lurking badness no doubt. 
llvm-svn: 101583
 2010-04-17 00:05:36 +00:00
Eric Christopher
e78496e5f1 Revert 101465, it broke internal OpenGL testing. 
Probably the best way to know that all getOperand() calls have been handled
is to replace that API instead of updating.

llvm-svn: 101579
 2010-04-16 23:37:20 +00:00