From 65b9667f0a82ecdca961784a11e4649e9249ed5b Mon Sep 17 00:00:00 2001 From: Jonathan Roelofs Date: Thu, 9 Feb 2017 23:02:37 +0000 Subject: [PATCH] [docs] Fix typo git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@294645 91177308-0d34-0410-b5e6-96231b3b80d8 --- docs/CodeGenerator.rst | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/CodeGenerator.rst b/docs/CodeGenerator.rst index 6e5a54a592c..106fc8456f6 100644 --- a/docs/CodeGenerator.rst +++ b/docs/CodeGenerator.rst @@ -1005,7 +1005,7 @@ The TableGen DAG instruction selector generator reads the instruction patterns in the ``.td`` file and automatically builds parts of the pattern matching code for your target. It has the following strengths: -* At compiler-compiler time, it analyzes your instruction patterns and tells you +* At compiler-compile time, it analyzes your instruction patterns and tells you if your patterns make sense or not. * It can handle arbitrary constraints on operands for the pattern match. In @@ -1026,7 +1026,7 @@ for your target. It has the following strengths: * Targets can define their own (and rely on built-in) "pattern fragments". Pattern fragments are chunks of reusable patterns that get inlined into your - patterns during compiler-compiler time. For example, the integer "``(not + patterns during compiler-compile time. For example, the integer "``(not x)``" operation is actually defined as a pattern fragment that expands as "``(xor x, -1)``", since the SelectionDAG does not have a native '``not``' operation. Targets can define their own short-hand fragments as they see fit.