llvm-svn: 17432

llvm-svn: 17431

llvm-svn: 17428

* Disable broken transforms for simplifying (setcc (cast X to larger), CI)
  where CC is not != or ==

llvm-svn: 17422

Make the bugpoint link reference the man page in the CommandGuide until
the Bugpoint.html file can describe bugpoint in a little more of a tutorial
style instead of just being a man page.

llvm-svn: 17416

NOTE: This doc needs to describe the bugpoint "subsystem" not the tool.

llvm-svn: 17415

llvm-svn: 17414

llvm-svn: 17413

llvm-svn: 17412

delete some dead methods

llvm-svn: 17410

llvm-svn: 17409

llvm-svn: 17408

We only need one instance of the vector that it contains at a time.

llvm-svn: 17407

llvm-svn: 17406

llvm-svn: 17405

llvm-svn: 17404

llvm-svn: 17403

llvm-svn: 17402

llvm-svn: 17401

llvm-svn: 17400

llvm-svn: 17399

llvm-svn: 17398

llvm-svn: 17397

llvm-svn: 17396

llvm-svn: 17395

llvm-svn: 17394

This is easier than attempting to figure out dual purpose columnar layouts
for multiple browser types. All browsers understand tables.

llvm-svn: 17393

llvm-svn: 17392

Make lex/yacc output cleaned only if in a directory that has those sources.

llvm-svn: 17391

#define CL0(a) case a: f(); goto c;
 #define CL1(a) CL0(a##0) CL0(a##1) CL0(a##2) CL0(a##3) CL0(a##4) CL0(a##5) \
 CL0(a##6) CL0(a##7) CL0(a##8) CL0(a##9)
 #define CL2(a) CL1(a##0) CL1(a##1) CL1(a##2) CL1(a##3) CL1(a##4) CL1(a##5) \
 CL1(a##6) CL1(a##7) CL1(a##8) CL1(a##9)
 #define CL3(a) CL2(a##0) CL2(a##1) CL2(a##2) CL2(a##3) CL2(a##4) CL2(a##5) \
 CL2(a##6) CL2(a##7) CL2(a##8) CL2(a##9)
 #define CL4(a) CL3(a##0) CL3(a##1) CL3(a##2) CL3(a##3) CL3(a##4) CL3(a##5) \
 CL3(a##6) CL3(a##7) CL3(a##8) CL3(a##9)

 void f();

 void a() {
     int b;
  c: switch (b) {
         CL4(1)
     }
 }

This comes from GCC PR 15524

llvm-svn: 17390

This speeds up simplifycfg on this program, from 44.87s to 0.29s (with
a profiled build):

 #define CL0(a) case a: goto c;
 #define CL1(a) CL0(a##0) CL0(a##1) CL0(a##2) CL0(a##3) CL0(a##4) CL0(a##5) \
 CL0(a##6) CL0(a##7) CL0(a##8) CL0(a##9)
 #define CL2(a) CL1(a##0) CL1(a##1) CL1(a##2) CL1(a##3) CL1(a##4) CL1(a##5) \
 CL1(a##6) CL1(a##7) CL1(a##8) CL1(a##9)
 #define CL3(a) CL2(a##0) CL2(a##1) CL2(a##2) CL2(a##3) CL2(a##4) CL2(a##5) \
 CL2(a##6) CL2(a##7) CL2(a##8) CL2(a##9)
 #define CL4(a) CL3(a##0) CL3(a##1) CL3(a##2) CL3(a##3) CL3(a##4) CL3(a##5) \
 CL3(a##6) CL3(a##7) CL3(a##8) CL3(a##9)

 void f();

 void a() {
     int b;
  c: switch (b) {
         CL4(1)
     }
 }

This testcase is contrived to expose N^2 behavior, but this patch should speedup
simplifycfg on any programs that use large switch statements.  This testcase
comes from GCC PR17895.

llvm-svn: 17389

llvm-svn: 17388

* *DO NOT* print CBU graphs when asked to print our own.  This is just
  FREAKING confusing and misleading: it's better to not print anything.
* Simplify and clean up some code
* Add some more paranoia assertion checking code that I found to track
  down this bug:
* Fix a nasty bug that was causing us to crash on Prolangs-C++/objects,
  where we were missing processing some graphs.  This hunk is the bugfix:

-    if (!I->isExternal() && !FoldedGraphsMap.count(I))
+    if (!I->isExternal() && !ValMap.count(I))

  urg!

llvm-svn: 17386

llvm-svn: 17385

llvm-svn: 17384

llvm-svn: 17383

llvm-svn: 17382

* Changed names of libraries to reflect new naming scheme
* Added some more introductory material
* Added a rule of thumb.

llvm-svn: 17381

llvm-svn: 17380

Chris wants on his platform.

llvm-svn: 17379