Empty stub of can-we-inline check.
Add inline bytecode size check.
Make spesh graph build more flexible wrt bytecode.

This is a step towards being able to graph a specialized form of the
bytecode, which we'll need to do to get a graph to merge while doing
inlining.
Decouple handler in graph build from original too.

If building handlers for spesh'd bytecode for inline, we'll need to use
the fixed up handler addresses.
Build inline graph for specialized bytecode.
Mark some ops a not suitable to inline.
Fix oplist parser bug.

An op with no operands but an adverb was mis-parsed.
Re-generate ops.c, carrying no-inline data.
Refuse inline if non-inlinable ops encountered.
For now, capturelex and takeclosure are :noinline.

May be able to relax this later.
Things with free lexicals can't be inlined.

May be able to relax this later with more careful analysis of outer
relationships; for now keep things simple.
Try building inline graph; don't use it yet.
Start tracking local/lexical counts in graph.

We'll need to modify these as we inline.
Start merging of inlinee into inliner spesh graph.

This adds basic graph merging (some bits missing yet) and sketches out
the next bits of the inline algorithm.
Note which operands are spesh slots.

Need to fix these up during inlining, and should do it programatically
rather than hard-coding instructions.
Spesh slot fixups in inline graph merge.
Correct operand_type_mask.
Handle spesh slot type in graph/codegen.
For now, don't inline things with handlers.

We'll support it later, but it's easier to add features to a working
inliner, so try to get there first.
Start storing local/lexical count per candidate.

This means we can support frame size varying by spesh candidate, since
different candidates may inline differently.