mark the first argument nocapture if endptr=NULL for each particular call.

llvm-svn: 64453

link-time failures when building with optimization.  Just
get rid of them.

llvm-svn: 64449

llvm-svn: 64448

llvm-svn: 64444

Make sure the SCC pass manager initializes any contained
function pass managers.  Without this, simplify-libcalls
would add nocapture attributes when run on its own, but
not when run as part of -std-compile-opts or similar.

llvm-svn: 64443

couldn't ever be the return of call instruction. However, it's quite possible
that said local allocation is itself the return of a function call. That's
what malloc and calloc are for, actually.

llvm-svn: 64442

addrec in a different loop to check the value being added to
the accumulated Start value, not the Start value before it has
the new value added to it. This prevents LSR from going crazy
on the included testcase. Dale, please review.

llvm-svn: 64440

"I got blisters on my fingers."

llvm-svn: 64439

llvm-svn: 64438

There were some that might even matter in X86FastISel.

llvm-svn: 64437

llvm-svn: 64436

llvm-svn: 64435

llvm-svn: 64433

llvm-svn: 64432

llvm-svn: 64431

llvm-svn: 64430

llvm-svn: 64429

llvm-svn: 64428

the new way, where all of the information is passed on SDNodes and machine
instructions.

llvm-svn: 64427

after sorting by stride value. This prevents it from missing
IV reuse opportunities in a host-sensitive manner.

llvm-svn: 64415

llvm-svn: 64412

llvm-svn: 64410

Modify callers.

llvm-svn: 64409

loop induction on LP64 targets. When the induction variable is
used in addressing, IndVars now is usually able to inserst a
64-bit induction variable and eliminates the sign-extending cast.
This is also useful for code using C "short" types for
induction variables on targets with 32-bit addressing.

Inserting a wider induction variable is easy; the tricky part is
determining when trunc(sext(i)) expressions are no-ops. This
requires range analysis of the loop trip count. A common case is
when the original loop iteration starts at 0 and exits when the
induction variable is signed-less-than a fixed value; this case
is now handled.

This replaces IndVarSimplify's OptimizeCanonicalIVType. It was
doing the same optimization, but it was limited to loops with
constant trip counts, because it was running after the loop
rewrite, and the information about the original induction
variable is lost by that point.

Rename ScalarEvolution's executesAtLeastOnce to
isLoopGuardedByCond, generalize it to be able to test for
ICMP_NE conditions, and move it to be a public function so that
IndVars can use it.

llvm-svn: 64407

type of the vectors being shuffled.

llvm-svn: 64401

in inline asm as signed (what gcc does).  Add partial support
for x86-specific "e" and "Z" constraints, with appropriate
signedness for printing.

llvm-svn: 64400

gets left behind, it's less cryptic.

llvm-svn: 64399

when the loop has exactly one exit, and make use of it in
LoopIndexSplit.

llvm-svn: 64388

llvm-svn: 64384

llvm-svn: 64383

leaving them in the DAG and then getting selection errors.  This is a 
fix for PR3538.

llvm-svn: 64382

llvm-svn: 64381

llvm-svn: 64379

llvm-svn: 64378

llvm-svn: 64377

llvm-svn: 64376

It's (currently) not safe to keep certain physical registers live across basic blocks, e.g. x86 fp stack registers.

llvm-svn: 64374

llvm-svn: 64373

If availability info is kept when fallthrough into a bb, add the available registers to live-in set.

llvm-svn: 64372

Replace one of burr scheduling heuristic with something more sensible. Now calcMaxScratches simply compute the number of true data dependencies. This actually improve a couple of tests in dejagnu suite as many tests in llvm nightly test suite.

llvm-svn: 64369