Comments only

compiler/codeGen/StgCmmArgRep.hs

@@ -122,9 +122,15 @@ idArgRep = toArgRep . idPrimRep
 --
 -- NSF 6 Mar 2013
 
--- These cases were found to cover about 99% of all slow calls:
 slowCallPattern :: [ArgRep] -> (FastString, RepArity)
 -- Returns the generic apply function and arity
+--
+-- The first batch of cases match (some) specialised entries
+-- The last group deals exhaustively with the cases for the first argument
+--   (and the zero-argument case)
+--
+-- In 99% of cases this function will match *all* the arguments in one batch
+
 slowCallPattern (P: P: P: P: P: P: _) = (fsLit "stg_ap_pppppp", 6)
 slowCallPattern (P: P: P: P: P: _)    = (fsLit "stg_ap_ppppp", 5)
 slowCallPattern (P: P: P: P: _)       = (fsLit "stg_ap_pppp", 4)

compiler/ghci/ByteCodeGen.lhs

@@ -1166,6 +1166,7 @@ maybe_getCCallReturnRep fn_ty
 -- Compile code which expects an unboxed Int on the top of stack,
 -- (call it i), and pushes the i'th closure in the supplied list
 -- as a consequence.
+-- The [Name] is a list of the constructors of this (enumeration) type
 implement_tagToId :: [Name] -> BcM BCInstrList
 implement_tagToId names
    = ASSERT( notNull names )