Sema: rewrite peer type resolution

The existing logic for peer type resolution was quite convoluted and
buggy. This rewrite makes it much more resilient, readable, and
extensible. The algorithm works by first iterating over the types to
select a "strategy", then applying that strategy, possibly applying peer
resolution recursively.

Several new tests have been added to cover cases which the old logic did
not correctly handle.

Resolves: ziglang#15138
Resolves: ziglang#15644
Resolves: ziglang#15693
Resolves: ziglang#15709
Resolves: ziglang#15752

src/Module.zig

@@ -6912,7 +6912,7 @@ pub fn intBitsForValue(mod: *Module, val: Value, sign: bool) u16 {
  assert(sign);
  // Protect against overflow in the following negation.
  if (x == std.math.minInt(i64)) return 64;
- return Type.smallestUnsignedBits(@intCast(u64, -x - 1)) + 1;
+ return Type.smallestUnsignedBits(@intCast(u64, -(x + 1))) + 1;
  },
  .u64 => |x| {
  return Type.smallestUnsignedBits(x) + @boolToInt(sign);