Some 8.2.1 release notes for my stuff

Test Plan: Built it and looked at it

Reviewers: niteria, erikd, dfeuer, austin, hvr, bgamari

Reviewed By: bgamari

Subscribers: dfeuer, thomie, erikd

Differential Revision: https://phabricator.haskell.org/D2959

3 files changed, 27 insertions, 7 deletions

diff --git a/docs/users_guide/8.2.1-notes.rst b/docs/users_guide/8.2.1-notes.rst
index 2c237db4e6..c5e3cb692f 100644
--- a/docs/users_guide/8.2.1-notes.rst
+++ b/docs/users_guide/8.2.1-notes.rst
@@ -151,13 +151,32 @@ Template Haskell
 Runtime system
 ~~~~~~~~~~~~~~
 
--  TODO FIXME.
+- TODO FIXME.
+
+- Added support for *Compact Regions*, which offer a way to manually
+  move long-lived data outside of the heap so that the garbage
+  collector does not have to trace it repeatedly.  Compacted data can
+  also be serialized, stored, and deserialized again later by the same
+  program.  For more details see the :compact-ref:`Data.Compact
+  <Data-Compact.html>` module.
+
+- There is new support for improving performance on machines with a
+  Non-Uniform Memory Architecture (NUMA).  See :rts-flag:`--numa`.
+  This is supported on Linux and Windows systems.
+
+- The garbage collector can be told to use fewer threads than the
+  global number of capabilities set by :rts-flag:`-N`.  See
+  :rts-flag:`-qn`, and a `blog post
+  <http://simonmar.github.io/posts/2016-12-08-Haskell-in-the-datacentre.html>`_
+  that describes this.
 
 - The :ref:`heap profiler <prof-heap>` can now emit heap census data to the GHC
   event log, allowing heap profiles to be correlated with other tracing events
   (see :ghc-ticket:`11094`).
 
-- Added NUMA support to Windows.
+- Some bugs have been fixed in the stack-trace implementation in the
+  profiler that sometimes resulted in incorrect stack traces and
+  costs attributed to the wrong cost centre stack (see :ghc-ticket:`5654`).
 
 - Added processor group support for Windows. This allows the runtime to allocate
   threads to all cores in systems which have multiple processor groups.
diff --git a/docs/users_guide/ghc_config.py.in b/docs/users_guide/ghc_config.py.in
index 41aee8da1d..e2783e4572 100644
--- a/docs/users_guide/ghc_config.py.in
+++ b/docs/users_guide/ghc_config.py.in
@@ -1,6 +1,7 @@
 extlinks = {
     'base-ref': ('../libraries/base-@LIBRARY_base_VERSION@/%s', ''),
     'cabal-ref': ('../libraries/Cabal-@LIBRARY_Cabal_VERSION@/%s', ''),
+    'compact-ref': ('../libraries/compact-@LIBRARY_compact_VERSION@/%s', ''),
     'ghc-prim-ref': ('../libraries/ghc-prim-@LIBRARY_ghc_prim_VERSION@/%s', ''),
     'ghc-ticket': ('http://ghc.haskell.org/trac/ghc/ticket/%s', 'Trac #'),
     'ghc-wiki': ('http://ghc.haskell.org/trac/ghc/wiki/%s', 'Trac #'),
diff --git a/docs/users_guide/sooner.rst b/docs/users_guide/sooner.rst
index 8b7a985ef2..702648fb91 100644
--- a/docs/users_guide/sooner.rst
+++ b/docs/users_guide/sooner.rst
@@ -312,11 +312,11 @@ Use a bigger heap!
     calculate a value based on the amount of live data.
 
 Compact your data:
-    The ``Data.Compact`` library (in the ``compact`` package) provides
-    a way to make garbage collection more efficient for long-lived
-    data structures.  Compacting a data structure collects the objects
-    together in memory, where they are treated as a single object by
-    the garbage collector and not traversed individually.
+    The :compact-ref:`Data.Compact <Data-Compact.html>` module
+    provides a way to make garbage collection more efficient for
+    long-lived data structures. Compacting a data structure collects
+    the objects together in memory, where they are treated as a single
+    object by the garbage collector and not traversed individually.
 
 .. _smaller: