X-Git-Url: https://git.codelabs.ch/?p=muen%2Flinux.git;a=blobdiff_plain;f=Documentation%2Fmemory-barriers.txt;h=a02d6bbfc9d0ae1958d3928ba1be441d3a60fa0a;hp=34c1970908a51e0dea96e464793e1f07716cf91e;hb=92400b8c8b42e53abb0fcb4ac75cb85d4177a891;hpb=1b22fc609cecd1b16c4a015e1a6b3c9717484e3a

diff --git a/Documentation/memory-barriers.txt b/Documentation/memory-barriers.txt
index 34c1970908a5..a02d6bbfc9d0 100644
--- a/Documentation/memory-barriers.txt
+++ b/Documentation/memory-barriers.txt
@@ -2904,7 +2904,7 @@ is discarded from the CPU's cache and reloaded.  To deal with this, the
 appropriate part of the kernel must invalidate the overlapping bits of the
 cache on each CPU.
 
-See Documentation/cachetlb.txt for more information on cache management.
+See Documentation/core-api/cachetlb.rst for more information on cache management.
 
 
 CACHE COHERENCY VS MMIO
@@ -3084,7 +3084,7 @@ CIRCULAR BUFFERS
 Memory barriers can be used to implement circular buffering without the need
 of a lock to serialise the producer with the consumer.  See:
 
-	Documentation/circular-buffers.txt
+	Documentation/core-api/circular-buffers.rst
 
 for details.