llvm-svn: 40957

This allows us to dump:

typedef short S;
int test(S X, long long Y) {
  return X < ((100));
}

as:

typedef short S;

int test(S X, long long Y)
(CompoundStmt 0x2905d40
  (ReturnStmt 0x2905d30
    (BinaryOperator 0x2905d10 'int' '<'
      (ImplicitCastExpr 0x2905d00 'int'
        (DeclRefExpr 0x2905c80 'S':'short' Decl='X' 0x2905c20))
      (ParenExpr 0x2905ce0 'int'
        (ParenExpr 0x2905cc0 'int'
          (IntegerLiteral 0x2905ca0 'int' 100))))))

llvm-svn: 40956

to do so.

llvm-svn: 40955

the AST in a structural, non-pretty, form useful for understanding
the AST.  It isn't quite done yet, but is already somewhat useful.

For this example:

int test(short X, long long Y) {
  return X < ((100));
}

we get (with -parse-ast-dump):

int test(short X, long long Y)
(CompoundStmt 0x2905ce0
  (ReturnStmt 0x2905cd0
    (BinaryOperator 0x2905cb0 '<'
      (ImplicitCastExpr 0x2905ca0
        (DeclRefExpr 0x2905c20 Decl='X' 0x2905bb0))
      (ParenExpr 0x2905c80
        (ParenExpr 0x2905c60
          (IntegerLiteral 0x2905c40 100))))))

llvm-svn: 40954

llvm-svn: 40953

llvm-svn: 40952

llvm-svn: 40951

llvm-svn: 40950

llvm-svn: 40949

llvm-svn: 40948

llvm-svn: 40947

llvm-svn: 40946

llvm-svn: 40945

llvm-svn: 40944

llvm-svn: 40943

llvm-svn: 40941

llvm-svn: 40940

documentation implies and as its uses depend.

llvm-svn: 40939

stdin through llvm-ld and llvm-link.

llvm-svn: 40938

llvm-svn: 40936

and one hack to avoid hitting a bad case when the alias analysis is imprecise.

llvm-svn: 40935

it for potentially undeading pointers.

llvm-svn: 40933

No functionality change.

llvm-svn: 40932

EmitUsualArithmeticConversions.

llvm-svn: 40931

it is used by "tgmath.h" (so we need to support it). It might also come in handy when
developing the overloaded function macros for OpenCU.

Next check-in will make this an integer constant expression...

llvm-svn: 40930

EmitExprWithUsualUnaryConversions.

llvm-svn: 40929

llvm-svn: 40927

llvm-svn: 40926

llvm-svn: 40925

ConstantFoldInstruction on calls) by avoiding Value::getName().  getName() constructs
and returns an std::string, which does heap allocation stuff.  This slightly speeds up
instcombine.

llvm-svn: 40924

1. domtree is a tree, not a graph.  There is no need to avoid revisiting nodes with a set.
2. the worklist can contain the child iterator pointers so we don't get N^2 rescanning of children.

This speeds up updateDFSNumbers significantly, making it basically free.  On the testcase in PR1432,
this speeds up loopsimplify by another 3x, dropping it from the 12th most expensive pass to the to
the 30th. :)  It used to be #1.

llvm-svn: 40923

llvm-svn: 40922

llvm-svn: 40921

natural loop canonicalization (which does many cfg xforms) by 4.3x, for 
example.  This also fixes a bug in postdom dfnumber computation.

llvm-svn: 40920

llvm-svn: 40919

- Fix some minor bugs related to special markers on val# def. ~0U means
  undefined, ~1U means dead val#.

llvm-svn: 40916

llvm-svn: 40915

llvm-svn: 40914

kill instruction #, and source register number (iff the value# is defined by a
copy).
- Now def instruction # is set for every value#, not just for copy defined ones.
- Update some outdated code related inactive live ranges.
- Kill info not yet set. That's next patch.

llvm-svn: 40913

llvm-svn: 40912