PmCheck: Implement Long-distance information with Covered setswip/pmcheck-ldi

Consider

```hs
data T = A | B | C

f :: T -> Int
f A = 1
f x = case x of
  A -> 2
  B -> 3
  C -> 4
```

Clearly, the RHS returning 2 is redundant. But we don't currently see
that, because our approximation to the covered set of the inner case
expression just picks up the positive information from surrounding
pattern matches. It lacks the context sensivity that `x` can't be `A`
anymore!

Therefore, we adopt the conceptually and practically superior approach
of reusing the covered set of a particular GRHS from an outer pattern
match. In this case, we begin checking the `case` expression with the
covered set of `f`s second clause, which encodes the information that
`x` can't be `A` anymore. After this MR, we will successfully warn about
the RHS returning 2 being redundant.

Perhaps surprisingly, this was a great simplification to the code of
both the coverage checker and the desugarer.

Found a redundant case alternative in `unix` submodule, so we have to
bump it with a fix.

Metric Decrease:
    T12227

1 files changed, 5 insertions, 2 deletions

diff --git a/compiler/GHC/CmmToLlvm/CodeGen.hs b/compiler/GHC/CmmToLlvm/CodeGen.hs
index 62ebeb9ba7..e01c6fe886 100644
--- a/compiler/GHC/CmmToLlvm/CodeGen.hs
+++ b/compiler/GHC/CmmToLlvm/CodeGen.hs
@@ -1482,17 +1482,20 @@ genMachOp_slow opt op [x, y] = case op of
     MO_FF_Conv _ _ -> panicOp
 
     MO_V_Insert  {} -> panicOp
-    MO_V_Extract {} -> panicOp
 
     MO_VS_Neg {} -> panicOp
 
     MO_VF_Insert  {} -> panicOp
-    MO_VF_Extract {} -> panicOp
 
     MO_VF_Neg {} -> panicOp
 
     MO_AlignmentCheck {} -> panicOp
 
+#if __GLASGOW_HASKELL__ < 811
+    MO_VF_Extract {} -> panicOp
+    MO_V_Extract {} -> panicOp
+#endif
+
     where
         binLlvmOp ty binOp = runExprData $ do
             vx <- exprToVarW x