this is to make reading disk objects more efficient later on.

This patch triggered c93.vtc failing, so we add a bit of a hack to avoid
a problem which might need more attention later:

FCO_MAX_REGIONS is an issue for chunked encoding objects (with growing
size). We have not yet implemented the best strategy and just tried
to always allocate the largest possible seglist to not use up more
regions than necessary, but small memory configurations do not support
the maximum seglist (4 MB).

previously, we just sized the disk seglist to fit.

Now we chose the size such that the memory seglist corresponding to the
disk seglist fits a power of two page.

This allows us to shrink the fellow_cache_obj allocation for the
fellow_obj_get (from disk) case from 8KB to 512 bytes.

The root cause for the massively oversized fco allocation was that
the nseg_guess heuristic could not take into account the wsl (size of
the actual object), so it had to assume that all of the disk object's
size was taken up for segments in the disk object embedded seglist.

Share the mempool between reading (flc) and writing (logbuffer).

Use different mempools and priorities for log rewrite and log flushes.

the logcache should know the best size

The previous implementation used only one BUDDY_REQS, so whenever one
segment allocation was fulfilled, other requests with lower priority
could "get through" and ultimately lead to bfa_alloc() failing to
complete.

By using two BUDDY_REQS, we now make sure to "keep out place in the
priority queue".

We also limit cramming not only by the available bitfield segment slots,
but also by a maximum of 4 (1/16th of the requested size) and yield when
a lower cram does not succeed to motivate LRU more to make room.

This has undergone a _lot_ of testing and has gone through many
iterations, which all have been squashed into this commit.

since https://github.com/varnishcache/varnish-cache/pull/3855/files
was merged a long time ago and we never supported 7.2 in a public
release.

based on insights with minimum memory testing, we need even more fine
grained priorities.

The main insight is that new objects get lower priorities than
rewrite-related allocations, but once they exist, their subordinate
requests for segments and metadata get higher priorities.

We now also re-assign the priority of waiting allocations.

DLECHK gets a top priority because it uses small allocations and is
vital for rewrite progress.