Fix all invalid haddock comments in the compiler

Fixes #20935 and #20924

3 files changed, 12 insertions, 12 deletions

diff --git a/compiler/GHC/Cmm/Dataflow.hs b/compiler/GHC/Cmm/Dataflow.hs
index ad1c37ace2..edd91481e7 100644
--- a/compiler/GHC/Cmm/Dataflow.hs
+++ b/compiler/GHC/Cmm/Dataflow.hs
@@ -151,8 +151,8 @@ fixpointAnalysis direction lattice do_block entry blockmap = loop start
     join       = fact_join lattice
 
     loop
-        :: IntHeap     -- ^ Worklist, i.e., blocks to process
-        -> FactBase f  -- ^ Current result (increases monotonically)
+        :: IntHeap     -- Worklist, i.e., blocks to process
+        -> FactBase f  -- Current result (increases monotonically)
         -> FactBase f
     loop todo !fbase1 | Just (index, todo1) <- IntSet.minView todo =
         let block = block_arr ! index
@@ -218,9 +218,9 @@ fixpointRewrite dir lattice do_block entry blockmap = loop start blockmap
     join       = fact_join lattice
 
     loop
-        :: IntHeap            -- ^ Worklist, i.e., blocks to process
-        -> LabelMap (Block node C C)  -- ^ Rewritten blocks.
-        -> FactBase f         -- ^ Current facts.
+        :: IntHeap                    -- Worklist, i.e., blocks to process
+        -> LabelMap (Block node C C)  -- Rewritten blocks.
+        -> FactBase f                 -- Current facts.
         -> UniqSM (LabelMap (Block node C C), FactBase f)
     loop todo !blocks1 !fbase1
       | Just (index, todo1) <- IntSet.minView todo = do
diff --git a/compiler/GHC/Cmm/Dataflow/Graph.hs b/compiler/GHC/Cmm/Dataflow/Graph.hs
index 3fbdae85ec..953ccdabaa 100644
--- a/compiler/GHC/Cmm/Dataflow/Graph.hs
+++ b/compiler/GHC/Cmm/Dataflow/Graph.hs
@@ -154,13 +154,13 @@ revPostorderFrom graph start = go start_worklist setEmpty []
   where
     start_worklist = lookup_for_descend start Nil
 
-    -- To compute the postorder we need to "visit" a block (mark as done)
-    -- *after* visiting all its successors. So we need to know whether we
-    -- already processed all successors of each block (and @NonLocal@ allows
-    -- arbitrary many successors). So we use an explicit stack with an extra bit
+    -- To compute the postorder we need to "visit" a block (mark as done) *after*
+    -- visiting all its successors. So we need to know whether we already
+    -- processed all successors of each block (and @NonLocal@ allows arbitrary
+    -- many successors). So we use an explicit stack with an extra bit
     -- of information:
-    -- * @ConsTodo@ means to explore the block if it wasn't visited before
-    -- * @ConsMark@ means that all successors were already done and we can add
+    -- - @ConsTodo@ means to explore the block if it wasn't visited before
+    -- - @ConsMark@ means that all successors were already done and we can add
     --   the block to the result.
     --
     -- NOTE: We add blocks to the result list in postorder, but we *prepend*
diff --git a/compiler/GHC/Cmm/ProcPoint.hs b/compiler/GHC/Cmm/ProcPoint.hs
index cd55b4d255..9297a25378 100644
--- a/compiler/GHC/Cmm/ProcPoint.hs
+++ b/compiler/GHC/Cmm/ProcPoint.hs
@@ -213,7 +213,7 @@ extendPPSet platform g blocks procPoints =
                                 ProcPoint -> 1
                                 ReachedBy ps -> setSize ps
                 block_procpoints = nreached (entryLabel b)
-                -- | Looking for a successor of b that is reached by
+                -- Looking for a successor of b that is reached by
                 -- more proc points than b and is not already a proc
                 -- point.  If found, it can become a proc point.
                 newId succ_id = not (setMember succ_id procPoints') &&