Conflicts:
	bin/varnishtest/tests/m00011.vtc
	lib/libvmod_debug/vmod.vcc
	lib/libvmod_debug/vmod_debug.c

And sync the documentation with the current behavior, part of which used
to be implicit.

Conflicts:
	lib/libvmod_std/vmod.vcc
	lib/libvmod_std/vmod_std_conversions.c

Conflicts:
	lib/libvmod_std/vmod_std_conversions.c

This is how std.ip is documented, so VSS_ResolveOne doesn't work there.
It might not be the only migration to VSS_ResolveOne that requires
attention.

Speaking of attention, VSA_Malloc may require some.

Conflicts:
	lib/libvmod_std/vmod_std_conversions.c

It can now be shared by established callback-based resolvers and the new
VSS_ResolveOne. This also changes the semantics of VSS_ResolveOne in the
sense that the port is now a default port, overriden by the address if
it contains one.

Also make it clear that VTCP was already relying on a VSS function that
didn't and still doesn't allow a null errp argument, while conversely
all VTCP_open call sites provide a valid errp argument.

At this point the workspace already overflowed so there's no point
making further progress to fail on the next workspace operation.

Incidentally, we are failing for an IP conversion, not an integer.

Conflicts:
	lib/libvmod_std/vmod_std_conversions.c

we want a single unique suckaddr.

Conflicts:
	bin/varnishtest/vtc_client.c
	lib/libvmod_std/vmod_std_conversions.c

not need it (acceptor, h2_sess)

The moment we unlock the oh, another thread could rush req

Partially undoes f35b86bc

Huge thank you to @mbgrydeland for spotting my mistake

and polish the output formatting by reordering

Ref #1799

Ref #2743

see 11 lines down

Conflicts:
	bin/varnishd/cache/cache_hash.c

req's on waiting list do indeed hold an objhead ref (req->hash_objhead),
so the condition for the while loop in hsh_deref_objhead_unlock will
always evaluate to false.

This gets rid of the needless rushing code and replaces it with an
assert.

Simplify the !busy cases

Inspired by:	#2856

Use req->hash_always_miss directly

Inspired by:    #2856

Refactor the hit-cases

Inspired by:	#2856

Move successful loop termination out of the loop.

Inspired by:	#2856

Make use of the new hsh_deref_objhead_unlock() in HSH_Lookup() to reduce
the number of times the objhead mutex is taken during cache hits.

Split hsh_deref_objhead() into two parts, with the new
hsh_deref_objhead_unlock() function expecting a locked objhead reference
on input.

Make this function lower case for consistency.

This changes the hash slingers deref function to take a locked objhead on
input, and unlocking it before returning. This saves a lock/unlock
sequence for critbit (which is the critical one) on HSH_DerefObjHead.

Move the clean up call to HSH_DeleteObjHead inside of the hash deref
methods that require it, instead of having the outside (single) caller do
it based off the return value. This just cleans up and makes the logic
more transparent.

This is caught by

	assert(lr == HSH_HIT || lr == HSH_GRACE);

in cnt_lookup()

Closes #2743

Conflicts:
	doc/changes.rst

doc/changes.rst was considered binary in master, it won't be in 6.0 so
there will be no need to pick a1d2db69
too.

Refs a1d2db69

in particular, move logging