more of a testcase for profiling information than anything that should reasonably
be used, but it's a starting point.  When I have more time I will whip this into
better shape.

llvm-svn: 11311

MO_VirtualRegister but actually be representing a physical register.

llvm-svn: 11310

llvm-svn: 11309

llvm-svn: 11308

Having a proper 'select' instruction would allow the elimination of a lot
of the special case cruft in this patch, but we don't have one yet.

llvm-svn: 11307

llvm-svn: 11305

llvm-svn: 11304

llvm-svn: 11302

llvm-svn: 11301

eventually allow Passes to use profiling information to direct them.

llvm-svn: 11294

llvm-svn: 11285

llvm-svn: 11283

llvm-svn: 11282

llvm-svn: 11281

llvm-svn: 11280

llvm-svn: 11278

llvm-svn: 11277

llvm-svn: 11276

llvm-svn: 11274

passed into main, make sure they use the return value of the init call
instead of the one passed in.

llvm-svn: 11262

I will observe that the concept of using WriteAsOperand is completely broken,
but then we all knew that, didn't we?

llvm-svn: 11255

llvm-svn: 11252

occurs in the program.

llvm-svn: 11249

placed into any alignment situation.

llvm-svn: 11247

in this for programs with lots of types (like the testcase in PR224).
The problem was that the type ID that the outer vector was using was not
very dense (as many types are getting resolved), so the vector is large
and gets reallocated a lot.

Since there are a lot of values in the program (the .ll file is 10M),
each reallocation has to copy the subvectors, which is also quite slow
(this wouldn't be a problem if C++ supported move semantics, but it
doesn't, at least not yet :(

Changing the outer data structure to a map speeds a release build of
llvm-as up from 11.21s to 5.13s on the testcase in PR224.

llvm-svn: 11244

llvm-svn: 11243

this speeds up a release llvm-as from 21.95s to 11.21s, because before it
would do an expensive traversal of the type-graph of every type resolved.

llvm-svn: 11242

type at the same time, resolve the upreferences to each other before resolving
it to the outer type.  This shaves off some time from the testcase in PR224, from
25.41s -> 21.72s.

llvm-svn: 11241

llvm-svn: 11239

instead of randomly groping about inside its outEdges array.
Make SchedGraph::addDummyEdges() use getNumOutEdges() instead of
outEdges.size().
Get rid of ifdefed-out code in SchedGraph::buildGraph().

llvm-svn: 11238

type resolution.  Unfortunately it doesn't help.

Also delete some dead debugging code.

llvm-svn: 11237

llvm-svn: 11233

consistent across the various type classes, we can factor out a LOT more
almost-identical code.  Also, add a couple of temporary statistics.

llvm-svn: 11232

all of the ad-hoc storage of contained types.  This allows getContainedType to
not be virtual, and allows us to entirely delete the TypeIterator class.

llvm-svn: 11230

llvm-svn: 11229

llvm-svn: 11228

llvm-svn: 11224

llvm-svn: 11222

contains the type we are looking for, just search the immediately used types.
We can only do this because we keep the "current" type in the nesting level
as we decrement upreferences.

This change speeds up the testcase in PR224 from 50.4s to 22.08s, not
too shabby.

llvm-svn: 11221

type from containing one.  This speeds up the asmparser on the testcase in PR224 from
61->50s.

llvm-svn: 11220