Refactored the use of this method into both the Sema module and Analysis module,
which were using their own static functions that did the same thing.

llvm-svn: 46129

when creating its type.

llvm-svn: 46109

llvm-svn: 46107

state.

llvm-svn: 46106

Declarator::clear(): Null out variable after it's been deleted.

This avoids a double free (which is good:-)

Bug submitted by Eli.

llvm-svn: 46105

Simplify comment.

llvm-svn: 46103

Type::isArithmeticType(): disallow incomplete enum decls.

Bug submitted by Eli.

llvm-svn: 46102

map. This will allow us to quickly prune them from maps without searching the
entire map.

llvm-svn: 46101

to sort sub-expressions before Block-level expressions.

llvm-svn: 46100

values are determined when evaluating the parent expression.

llvm-svn: 46096

constant propagation.

llvm-svn: 46095

handle the case where the number of nodes was 0.

Fixed bug in GREngineImpl where we did not proceed to the next statement
when processing a PostStmt location.

llvm-svn: 46093

llvm-svn: 46092

llvm-svn: 46091

llvm-svn: 46087

llvm-svn: 46086

that were "not a constant."

llvm-svn: 46085

call the dstor instead of using delete.

llvm-svn: 46084

a method named ImpCastExprToType in Sema.

Use this method to insert implicit casts for case statements from their 
operand type to the condition type of the switch.  This fixes a crash on
test/CodeGen/statements.c, reported by Eli Friedman.

llvm-svn: 46083

llvm-svn: 46082

llvm-svn: 46081

ctor for GREngine.

llvm-svn: 46080

llvm-svn: 46079

llvm-svn: 46078

llvm-svn: 46076

llvm-svn: 46075

Fixed some compilation errors with GREngine that showed up during
template instantiation.

llvm-svn: 46074

node caching in GREngine will guarantee that we do not insert a node twice into
a nodeset.

llvm-svn: 46071

Sema::MergeFunctionDecl()...make sure diagnostic is accurate (wrt function declarations/definitions). Patch by Carl Lewis!

llvm-svn: 46070

llvm-svn: 46051

variant type, and not just the pointer value.

llvm-svn: 46049

Cleaned up GRConstants::AddBinding to not directly reference the
predecessor node.  Now we just manipulate the current state, and a driver
function creates nodes as needed.

llvm-svn: 46040

llvm-svn: 46038

llvm-svn: 46037

the graph reachability engine.

llvm-svn: 46036

llvm-svn: 46035

Finish up handling all permutations of "complex int" (in Sema::UsualArithmeticConversions()).
A FIXME remains to verify the conversion rules are consistent with GCC.

Thanks to Eli for the new/improved test case...

llvm-svn: 46022

- Change Type::isComplexType() to exlude GCC's complex integer extension. In general, we will keep the lowest level Type predicates "pure" (i.e. true to the C99 spec). 
- Modify Sema::UsualArithmeticConversions() to work with the new definition of Type::isComplexType().

This is a nice cleanup and also fixes a bug submitted by Eli (which I've added to the test suite).

llvm-svn: 46005

llvm-svn: 46000

   abc+L"foo" -> abc L"foo", not abcL"foo"

llvm-svn: 45999