llvm-svn: 120514

llvm-svn: 120513

statements.

llvm-svn: 120512

llvm-svn: 120507

llvm-svn: 120506

llvm-svn: 120504

legalization time. Since at legalization time there is no mapping from
SDNode back to the corresponding LLVM instruction and the return
SDNode is target specific, this requires a target hook to check for
eligibility. Only x86 and ARM support this form of sibcall optimization
right now.
rdar://8707777

llvm-svn: 120501

llvm-svn: 120500

llvm-svn: 120499

llvm-svn: 120498

llvm-svn: 120497

llvm-svn: 120496

llvm-svn: 120495

llvm-svn: 120494

llvm-svn: 120493

llvm-svn: 120492

in favor of the widespread llvm style. Capitalize variables and add
newlines for visual parsing. Rename variables for readability.
And other cleanup.

llvm-svn: 120490

llvm-svn: 120488

may-aliasing stores that partially overlap with different base
pointers.  This implements PR6043 and the non-variable part of
PR8657

llvm-svn: 120485

  t_addrmode_s4, but with a different scaling factor.

* Encode the Thumb1 load and store instructions. This involved a bit of
  refactoring (hi, Chris! :-). Some of the patterns became dead afterwards and
  were removed.

llvm-svn: 120482

Thumb2 encoding to share code with the ARM encoding, which gets use fixup support for free.
It also allows us to fold away at least one codegen-only pattern.

llvm-svn: 120481

llvm-svn: 120480

llvm-svn: 120476

llvm-svn: 120474

llvm-svn: 120471

llvm-svn: 120470

the code.  We now get accurate sizes on Loads, though it surely doesn't
matter in practice.

llvm-svn: 120469

1. if the underlying pointer passed in can be resolved
   to any argument or alloca, then we don't need to scan.
   Previously we would only avoid the scan if the alloca
   or byval was actually considered dead.
2. The dead store processing code is itself completely
   dead and didn't handle volatile stores right anyway,
   so delete it.  This allows simplifying the interface
   to RemoveAccessedObjects.

llvm-svn: 120467

while I'm in there.

llvm-svn: 120466

made sense to me.  We now have a set of dead stack objects, and
they become live when loaded.  Fix a theoretical problem where
we'd pass in the wrong pointer to the alias query.

llvm-svn: 120465

If the call might read all the allocas, stop scanning early.
Convert a vector to smallvector, shrink SmallPtrSet to 16 instead
of 64 to avoid crazy linear scans.

llvm-svn: 120463

- Use a DenseSet instead of a FoldingSet to cache
canonicalized nodes.  This reduces the overhead
of double-hashing.

- Use reference counts in ImutAVLTree to much
more aggressively recover tree nodes that are
no longer usable.  We can generate many
transient nodes while using add() and remove()
on ImmutableSet/ImmutableMaps to generate a final
set/map.

For the clang static analyzer (the main client
of these data structures), this results in
a slight speedup (0.5%) when analyzing sqlite3,
but much more importantly results in a 30-60%
reduction in peak memory usage when the analyzer
is analyzing a given function in a file.  On
average that's about a ** 44% reduction ** in the
memory footprint of the static analyzer.

llvm-svn: 120459

there should be a better way to do this.  PR 8679.

llvm-svn: 120457

llvm-svn: 120455

llvm-svn: 120454

AA and MD pass info instead of using getAnalysis<> all over.

llvm-svn: 120453

llvm-svn: 120452

llvm-svn: 120451

llvm-svn: 120450

llvm-svn: 120449