From 7ff61698183bc27067589df6e75cdc38f3cfa3ee Mon Sep 17 00:00:00 2001
From: Gareth Rees <gdr@ravenbrook.com>
Date: Thu, 19 Mar 2015 10:59:38 +0000
Subject: [PATCH] Fix cross-references.

Copied from Perforce
 Change: 187791
 ServerID: perforce.ravenbrook.com
---
 mps/code/splay.c | 2 +-
 mps/code/tree.c  | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/mps/code/splay.c b/mps/code/splay.c
index fa15575b505..ed46c7a4ba4 100644
--- a/mps/code/splay.c
+++ b/mps/code/splay.c
@@ -11,7 +11,7 @@
  *
  * .note.stack: It's important that the MPS have a bounded stack size,
  * and this is a problem for tree algorithms. Basically, we have to
- * avoid recursion. See design.mps.sp.req.sol.depth.no-recursion.
+ * avoid recursion. See design.mps.sp.sol.depth.no-recursion.
  */
 
 
diff --git a/mps/code/tree.c b/mps/code/tree.c
index b2ccccb972e..f87e8364ea7 100644
--- a/mps/code/tree.c
+++ b/mps/code/tree.c
@@ -11,7 +11,7 @@
  *
  * .note.stack: It's important that the MPS have a bounded stack size,
  * and this is a problem for tree algorithms. Basically, we have to
- * avoid recursion. See design.mps.sp.req.sol.depth.no-recursion.
+ * avoid recursion. See design.mps.sp.sol.depth.no-recursion.
  */
 
 #include "tree.h"