pprof fetches profiles concurrently, which allows to profile multiple running
servers concurrently. However, this may translate into a large use of memory
if many profiles are merged, as pprof attempts to decode all profiles in parallel.

Limit the concurrency by chunking the concurrent fetches in groups of up to
64 profiles.

Separate implementation of graph and tree creation to speed it up.
Graph implementation maps upfront all locations to sequences of nodes,
tree implementation uses a per-parent map to keep track of a different
node per location per parent.

Non functional changes -- pre-size maps and slices to reduce
cost of building a graph out of a profile.

Profile merging spends a lot of time computing function keys, which are currently a string.
Using structs for the keys whenever possible will reduce the overhead.

The names produced by addr2line are often incomplete.  Fix this by
falling back to nm to get function names and using the nm-provided
name if it is longer.

When reconciling samples, cleanup file paths to allow functions to be
combined if their source filenames match after cleanup (eg "src.cpp" and
"./src.cpp").

Also clean up existing uses of filepath to avoid passing empty strings
to it: filepath.Base("") returns "."

internal/driver: fix spelling in help text

Add field for profile sources to indicate what is the primary
sample value, which visualizers should display by default.
Previously there was a convention for pprof to use the last
sample_index by default, this provides more flexibility.

Instead of including it the demangle package with pprof,
point to its own repo.

remove binutils wrappers used for testing

Provide native Go mocks for binutils to use during testing, instead of
relying on shell-script mocks of those tools.

Also update the build instructions to use go get