- Feb 12, 2008
-
-
Bill Wendling authored
of the examples to reflect the current .TD files. llvm-svn: 46995
-
Chris Lattner authored
llvm-svn: 46993
-
Chris Lattner authored
llvm-svn: 46991
-
Chris Lattner authored
llvm-svn: 46985
-
Steve Naroff authored
Allow the parser to detect invalid DeclSpec's. This fixes http://llvm.org/bugs/show_bug.cgi?id=1987. This commit only "guards" the call to ParseDeclarationSpecifiers() in ParseDeclarationOrFunctionDefinition(). We could consider guarding all calls, however this is a bit radical (since it effectively stops parsing the declaration once we have a bad declspec). Will discuss with Chris tomorrow. llvm-svn: 46984
-
Tanya Lattner authored
llvm-svn: 46981
-
Steve Naroff authored
Fix unsafe static cast... llvm-svn: 46980
-
Nate Begeman authored
llvm-svn: 46979
-
Dan Gohman authored
for APInt::getBitsSet. And fix an off-by-one bug in "wrapping" mode. llvm-svn: 46978
-
Steve Naroff authored
Several cleanups surrounding Parser::ParseAsmStatement() and Parser::FuzzyParseMicrosoftAsmStatement(). llvm-svn: 46977
-
Ted Kremenek authored
factories. Fixed a horrible bug in lval:DeclVar::classof(RValue* V); we weren't checking V was an LValue, allowing nonlval::ConcereteInts to match isa<lval::DeclVar>. llvm-svn: 46976
-
Ted Kremenek authored
BumpPtrAllocator argument to their constructors. This BumpPtrAllocator will be used to allocate trees. If no BumpPtrAllocator is provided, one is created (as before). llvm-svn: 46975
-
- Feb 11, 2008
-
-
Steve Naroff authored
Move policy on unnamed fields (a Microsoft extension) from Parser::ParseStructDeclaration() to the driver. llvm-svn: 46974
-
Steve Naroff authored
Move Microsoft __declspec hack from the parser to the preprocessor. Since we have no plans to actually implement this construct, it is cleaner to limit the change to the preprocessor. llvm-svn: 46973
-
Steve Naroff authored
Fix http://llvm.org/bugs/show_bug.cgi?id=2013. llvm-svn: 46972
-
Steve Naroff authored
After yesterday's discussion (http://lists.cs.uiuc.edu/pipermail/cfe-dev/2008-February/001044.html), decided not to change the semantics of Type::isIncompleteType(). This commit simply changes a couple comments to reflect this decision. llvm-svn: 46970
-
Scott Michel authored
llvm-svn: 46968
-
Duncan Sands authored
in preparation for apint support. These changes are intended to have no functional effect. llvm-svn: 46967
-
Ted Kremenek authored
bindings for block-level expressions. Moved pretty-printing logic (DOT) for ValueStates to ValueState.cpp. llvm-svn: 46965
-
Dan Gohman authored
llvm-svn: 46964
-
Dan Gohman authored
llvm-svn: 46963
-
Dan Gohman authored
llvm-svn: 46962
-
Dan Gohman authored
llvm-svn: 46961
-
Dan Gohman authored
argument by reference, rather than by value. llvm-svn: 46960
-
Wojciech Matyjewicz authored
to the RHS. This simple change allows to compute loop iteration count for loops with condition similar to the one in the testcase (which seems to be quite common). llvm-svn: 46959
-
Ted Kremenek authored
Added member template "Add" to FoldingSetNodeID that allows "adding" arbitrary objects to a profile via dispatch to FoldingSetTrait<T>::Profile(). Removed FoldingSetNodeID::AddAPFloat and FoldingSetNodeID::APInt, as their functionality is now replaced using the above mentioned member template. llvm-svn: 46957
-
Duncan Sands authored
getNumRegisters. This is needed for calling functions with apint parameters or return values. llvm-svn: 46956
-
Wojciech Matyjewicz authored
arbitrary iteration. The patch: 1) changes SCEVSDivExpr into SCEVUDivExpr, 2) replaces PartialFact() function with BinomialCoefficient(); the computations (essentially, the division) in BinomialCoefficient() are performed with the apprioprate bitwidth necessary to avoid overflow; unsigned division is used instead of the signed one. Computations in BinomialCoefficient() require support from the code generator for APInts. Currently, we use a hack rounding up the neccessary bitwidth to the nearest power of 2. The hack is easy to turn off in future. One remaining issue: we assume the divisor of the binomial coefficient formula can be computed accurately using 16 bits. It means we can handle AddRecs of length up to 9. In future, we should use APInts to evaluate the divisor. Thanks to Nicholas for cooperation! llvm-svn: 46955
-
Duncan Sands authored
llvm-svn: 46954
-
Evan Cheng authored
Determine whether a spill kills the register it's spilling before insertion rather than trying to undo the kill marker afterwards. llvm-svn: 46953
-
Chris Lattner authored
llvm-svn: 46952
-
Chris Lattner authored
llvm-svn: 46951
-
Anders Carlsson authored
Get rid of bogus warnings when the second argument in va_start is either an implicit cast expr or a paren expr. llvm-svn: 46950
-
Nate Begeman authored
Add some notes to the README. llvm-svn: 46949
-
Nate Begeman authored
llvm-svn: 46948
-
Steve Naroff authored
Add a comment/FIXME to an earlier change. llvm-svn: 46947
-
Steve Naroff authored
Tweak test... llvm-svn: 46946
-
Chris Lattner authored
llvm-svn: 46945
-
Eli Friedman authored
edge cases. llvm-svn: 46944
-
Eli Friedman authored
codegen. llvm-svn: 46943
-