llvm-svn: 78432

llvm-svn: 78431

llvm-svn: 78430

llvm-svn: 78429

llvm-svn: 78428

driven by TAI to being static, driven by tblgen.  This means that a
target doesn't get impacted by this stuff at all if it doesn't opt
into it.

llvm-svn: 78427

llvm-svn: 78426

llvm-svn: 78425

The use case is if you have a wrapper class:

class Base {
  void *Ptr;
public:
  Base() : Ptr(0) { }
  operator bool() const { return Ptr; }
.....
}

and sub-wrappers that have exactly the same size:

class Sub : public Base {
public:
....
static bool classof(const Base*);
}

and in the code you would do:

void f(Base b) {
  Sub sub = dyn_cast<Sub>(b);
  if (sub) {
    ....
  }
}

llvm-svn: 78424

I can clean this up a bit more and do way with the TheCondState and just use
the top element on the TheCondStack if not empty.  Also may tweak the code
around ParseConditionalAssemblyDirectives() to simplify the AsmParser code.

llvm-svn: 78423

llvm-svn: 78422

llvm-svn: 78421

llvm-svn: 78420

llvm-svn: 78419

llvm-svn: 78418

llvm-svn: 78417

llvm-svn: 78416

llvm-svn: 78415

separately.  Add the framework (currently unfed) for finding friend declarations
during argument-dependent lookup.

llvm-svn: 78414

fortuitous.  WIP.

llvm-svn: 78413

llvm-svn: 78412

llvm-svn: 78411

llvm-svn: 78410

llvm-svn: 78409

llvm-svn: 78408

llvm-svn: 78407

motivated to fix it.

llvm-svn: 78406

llvm-svn: 78405

llvm-svn: 78404

llvm-svn: 78403

llvm-svn: 78402

llvm-svn: 78401

http://llvm.org/viewvc/llvm-project?view=rev&revision=78127, I'm changing the
ExecutionEngine's global mappings to hold AssertingVH<const GlobalValue>. That
way, if unregistering a mapping fails to actually unregister it, we'll get an
assert. Running the jit nightly tests didn't uncover any actual instances of
the problem.

This also uncovered the fact that AssertingVH<const X> didn't work, so I fixed
that too.

llvm-svn: 78400

llvm-svn: 78399

llvm-svn: 78398

llvm-svn: 78397

llvm-svn: 78396

llvm-svn: 78395

LoopDependenceAnalysis::getLoops is currently O(N*M) for a loop-nest of
depth N and a compound SCEV of M atomic SCEVs. As both N and M will
typically be very small, this should not be a problem. If it turns out
to be one, rewriting getLoops as SCEVVisitor will reduce complexity to
O(M).

llvm-svn: 78394

llvm-svn: 78393