llvm-svn: 92405

llvm-svn: 92404

instead of hand rolling a loop.

llvm-svn: 92403

a constantexpr gep on the 'base' side of the expression.
This completes comment #4 in PR3351, which comes from
483.xalancbmk.

llvm-svn: 92402

expressions.  This is a step towards comment #4 in PR3351.

llvm-svn: 92401

llvm-svn: 92400

llvm-svn: 92399

llvm-svn: 92398

Make sure that the search for visible declarations looks into the semantic parents of out-of-line function contexts

llvm-svn: 92397

llvm-svn: 92396

SelectionDAGBuilder.cpp:4294: warning: suggest explicit braces to avoid
ambiguous ‘else’

llvm-svn: 92395

llvm-svn: 92394

llvm-svn: 92393

llvm-svn: 92392

llvm-svn: 92391

llvm-svn: 92390

llvm-svn: 92389

multiply sequence when the power is a constant integer.  Before, our
codegen for std::pow(.., int) always turned into a libcall, which was
really inefficient.

This should also make many gfortran programs happier I'd imagine.

llvm-svn: 92388

llvm-svn: 92387

llvm-svn: 92386

llvm-svn: 92385

llvm-svn: 92384

llvm-svn: 92383

on integers as well and codegen should lower them to branch trees.

llvm-svn: 92382

positive and negative forms of constants together.  This 
allows us to compile:

int foo(int x, int y) {
    return (x-y) + (x-y) + (x-y);
}

into:

_foo:                                                       ## @foo
	subl	%esi, %edi
	leal	(%rdi,%rdi,2), %eax
	ret

instead of (where the 3 and -3 were not factored):

_foo:
        imull   $-3, 8(%esp), %ecx
        imull   $3, 4(%esp), %eax
        addl    %ecx, %eax
        ret

this started out as:
    movl    12(%ebp), %ecx
    imull   $3, 8(%ebp), %eax
    subl    %ecx, %eax
    subl    %ecx, %eax
    subl    %ecx, %eax
    ret

This comes from PR5359.

llvm-svn: 92381

llvm-svn: 92380

class), provide a suggestion for the type or class found. However,
since we can't recover properly in this case, don't provide a fix-it
hint. Example:

test/FixIt/typo.m:8:3: error: use of undeclared identifier 'NSstring';
did you
      mean 'NSString'?
  NSstring *str = @"A string";
  ...
  ^
1 diagnostic generated.

llvm-svn: 92379

llvm-svn: 92378

llvm-svn: 92377

test/FixIt/typo.c:19:4: error: field designator 'bunds' does not refer to any
      field in type 'struct Window'; did you mean 'bounds'?
  .bunds.
   ^~~~~
   bounds

llvm-svn: 92376

llvm-svn: 92375

llvm-svn: 92374

This allows us to optimize test12 into:

define i32 @test12(i32 %X) {
  %factor = mul i32 %X, -3                        ; <i32> [#uses=1]
  %Z = add i32 %factor, 6                         ; <i32> [#uses=1]
  ret i32 %Z
}

instead of:

define i32 @test12(i32 %X) {
  %Y = sub i32 6, %X                              ; <i32> [#uses=1]
  %C = sub i32 %Y, %X                             ; <i32> [#uses=1]
  %Z = sub i32 %C, %X                             ; <i32> [#uses=1]
  ret i32 %Z
}

llvm-svn: 92373

sorted, so we can just do a linear scan.

llvm-svn: 92372

llvm-svn: 92371

llvm-svn: 92370

llvm-svn: 92369

fix RemoveDeadBinaryOp to actually do something.

llvm-svn: 92368

llvm-svn: 92367

instead of std::vector.

llvm-svn: 92366