[llvm] a6abd0a - [Docs] Remove outdated reference to "future work" in convergence.

[Sameer Sahasrabuddhe via llvm-commits]

Author: Sameer Sahasrabuddhe
Date: 2025-02-06T14:30:20+05:30
New Revision: a6abd0a13d2748977dd1409a34948cd392a1cb21

URL: https://github.com/llvm/llvm-project/commit/a6abd0a13d2748977dd1409a34948cd392a1cb21
DIFF: https://github.com/llvm/llvm-project/commit/a6abd0a13d2748977dd1409a34948cd392a1cb21.diff

LOG: [Docs] Remove outdated reference to "future work" in convergence.

Added: 
    

Modified: 
    llvm/docs/ConvergenceAndUniformity.rst

Removed: 
    


################################################################################
diff  --git a/llvm/docs/ConvergenceAndUniformity.rst b/llvm/docs/ConvergenceAndUniformity.rst
index 863cebd91a20b82..bcc5b4b1cd41e75 100644
--- a/llvm/docs/ConvergenceAndUniformity.rst
+++ b/llvm/docs/ConvergenceAndUniformity.rst
@@ -285,8 +285,8 @@ Dependence on Cycles Headers
 Contradictions in *convergence-before* are possible only between two
 nodes that are inside some cycle. The dynamic instances of such nodes
 may be interleaved in the same thread, and this interleaving may be
-
diff erent for 
diff erent threads.
-
+
diff erent for 
diff erent threads. Cycle headers serve as implicit
+*points of convergence* in the maximal converged-with relation.
 When a thread executes a node ``X`` once and then executes it again,
 it must have followed a closed path in the CFG that includes ``X``.
 Such a path must pass through the header of at least one cycle --- the
@@ -295,14 +295,6 @@ thread, two dynamic instances of ``X`` are either separated by the
 execution of at least one cycle header, or ``X`` itself is a cycle
 header.
 
-In reducible cycles (natural loops), each execution of the header is
-equivalent to the start of a new iteration of the cycle. But this
-analogy breaks down in the presence of explicit constraints on the
-converged-with relation, such as those described in :ref:`future
-work<convergence-note-convergence>`. Instead, cycle headers should be
-treated as implicit *points of convergence* in a maximal
-converged-with relation.
-
 Consider a sequence of nested cycles ``C1``, ``C2``, ..., ``Ck`` such
 that ``C1`` is the outermost cycle and ``Ck`` is the innermost cycle,
 with headers ``H1``, ``H2``, ..., ``Hk`` respectively. When a thread