(Binary Analysis) M68k disassembler checkpoint; non-working
(Binary Analysis) M68k disassembler checkpoint 2; non-working
(Binary Analysis) Added M68k support for disassemble --isa switch
(Binary Analysis) M68k disassembler checkpoint 3; non-working
(Binary Analysis) M68k adjustments for changes to SgAsmIntegerValueExpression types
(Binary Analysis) M68k disassembler checkpoint 4; non-working
(Binary Analysis) Added tests for BitPattern class
(Binary Analysis) Partitioner recognizes m68k "link.w a6, xxxx" as function

Conflicts:
	src/frontend/Disassemblers/Partitioner.C
		Avoid changes to the x86: "c8 xx xx 00" is "enter xxxx, 0"
		pattern since we're not adding that on this branch.  The
		pattern had been added previously, but deleted in the
		future because it didn't work.
(Binary Analysis) More work on m68k
(Binary Analysis) m68k disassembler checkpoint
(Binary Analysis) m68k disassembler checkpoint

All integer instructions are implemented, but not compiling yet
(Binary Analysis) m68k disassembler checkpoint

* Added a register dictionary for m68000 and removed two
  unused dictionaries that were incomplete.

* Integer instructions compile
(Binary Analysis) Bug fix in BinaryAnalysis::ControlFlow::build_block_cfg_from_ast

This function assumed that the base nodes for SgAsmIntegerValueExpression
returned by SgAsmBlock::get_successors were always the very same basic
block to which the CFG edge refers.  I fixed the function to handle
the other cases.
(Binary Analysis) Recognizes another common function prologue

The common sequence "mov edi, edi; push ebp; mov ebp, esp" is also
recognized as a possible beginning of function.
(Binary Analysis) Tweaks to CFG successors for indirect CALL
(Binary Analysis) New functions for MemoryMap

* hull() returns min and max mapped addresses

* next() returns next mapped address at or above a specified
  address.

* match_bytes() returns number of consecutive bytes that
  match any in a specified set.

* find_sequence() finds the location of a substring

* find_any() finds the first address for any of the values
  in a specified set.
(Binary Analysis) Analysis to find post-padding function entry points

This attempts to improve upon the analysis that finds functions between
padding.  The new analysis iteratively looks for padding and discovers a
function rather than first looking for all padding and then discovering
all functions between padding.  The goal is to avoid splitting one
function that happens to contain something that looks like padding but
isn't into two or more functions.

This analysis is currently commented out near line 3525 of Partitioner.C
because it's too slow. Fixing the slowness issue will require changing
the way we keep track of used/unused bytes in the address space.
(Binary Analysis) Symbolic semantics and Yices no longer restricted to values <= 64 bits

The symbolic semantics layer can now handle values of arbitrary width. Constant folding
works for most things, except multiplication, division, and modulo are only constant-folded
when the operands are 64 bits or narrower.

The Yices interface has also been updated to handle wider constants.
Merge branch 'sawyer' of ../sawyer into partitioner
(Binary Analysis) Use Sawyer message stream for diagnostics