Patchwork Committed: typos in atomic patterns docs, md.texi

login
register
mail settings
Submitter Hans-Peter Nilsson
Date May 28, 2012, 4:04 p.m.
Message ID <201205281604.q4SG4UXC002179@ignucius.se.axis.com>
Download mbox | patch
Permalink /patch/161628/
State New
Headers show

Comments

Hans-Peter Nilsson - May 28, 2012, 4:04 p.m.
Committed as obvious.

gcc:
	* doc/md.texi (Standard Names): Fix typos in documentation of atomic patterns.


brgds, H-P

Patch

Index: doc/md.texi
===================================================================
--- doc/md.texi	(revision 187934)
+++ doc/md.texi	(working copy)
@@ -5885,7 +5885,7 @@  from a compare-and-swap operation, if de
 @itemx @samp{sync_old_ior@var{mode}}, @samp{sync_old_and@var{mode}}
 @itemx @samp{sync_old_xor@var{mode}}, @samp{sync_old_nand@var{mode}}
 
-These patterns are emit code for an atomic operation on memory,
+These patterns emit code for an atomic operation on memory,
 and return the value that the memory contained before the operation.
 Operand 0 is the result value, operand 1 is the memory on which the
 atomic operation is performed, and operand 2 is the second operand
@@ -6037,7 +6037,7 @@  performed.  Operand 1 is the second oper
 Operand 2 is the memory model to be used by the operation.
 
 If these patterns are not defined, attempts will be made to use legacy
-@code{sync} patterns, or equivilent patterns which return a result.  If
+@code{sync} patterns, or equivalent patterns which return a result.  If
 none of these are available a compare-and-swap loop will be used.
 
 @cindex @code{atomic_fetch_add@var{mode}} instruction pattern
@@ -6079,7 +6079,7 @@  performed.  Operand 2 is the second oper
 Operand 3 is the memory model to be used by the operation.
 
 If these patterns are not defined, attempts will be made to use legacy
-@code{sync} patterns, or equivilent patterns which return the result before
+@code{sync} patterns, or equivalent patterns which return the result before
 the operation followed by the arithmetic operation required to produce the
 result.  If none of these are available a compare-and-swap loop will be
 used.