diff --git a/Documentation/RCU/Design/Requirements/Requirements.html b/Documentation/RCU/Design/Requirements/Requirements.html
index cc5b587c0ec51..1052471499756 100644
--- a/Documentation/RCU/Design/Requirements/Requirements.html
+++ b/Documentation/RCU/Design/Requirements/Requirements.html
@@ -1494,6 +1494,14 @@ <h3><a name="Composability">Composability</a></h3>
 section, neither of which is conducive to a long-lived and prosperous
 kernel.
 
+<p>
+It is worth noting that RCU is not alone in limiting composability.
+For example, many transactional-memory implementations prohibit
+composing a pair of transactions separated by an irrevocable
+operation (for example, a network receive operation).
+For another example, lock-based critical sections can be composed
+surprisingly freely, but only if deadlock is avoided.
+
 <p>
 In short, although RCU read-side critical sections are highly composable,
 care is required in some situations, just as is the case for any other
diff --git a/Documentation/RCU/Design/Requirements/Requirements.htmlx b/Documentation/RCU/Design/Requirements/Requirements.htmlx
index 23524d75a3c38..5b76e21fa0925 100644
--- a/Documentation/RCU/Design/Requirements/Requirements.htmlx
+++ b/Documentation/RCU/Design/Requirements/Requirements.htmlx
@@ -1653,6 +1653,14 @@ in RCU implicitly splitting the enclosing RCU read-side critical
 section, neither of which is conducive to a long-lived and prosperous
 kernel.
 
+<p>
+It is worth noting that RCU is not alone in limiting composability.
+For example, many transactional-memory implementations prohibit
+composing a pair of transactions separated by an irrevocable
+operation (for example, a network receive operation).
+For another example, lock-based critical sections can be composed
+surprisingly freely, but only if deadlock is avoided.
+
 <p>
 In short, although RCU read-side critical sections are highly composable,
 care is required in some situations, just as is the case for any other