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

From-SVN: r187935
This commit is contained in:
Hans-Peter Nilsson 2012-05-28 16:04:14 +00:00 committed by Hans-Peter Nilsson
parent e9d3ef3b2d
commit c29c10301d
2 changed files with 6 additions and 5 deletions

View file

@ -1,7 +1,8 @@
2012-05-28 Hans-Peter Nilsson <hp@axis.com>
* doc/md.texi (stack_protect_test): Remove negation of
branch to label.
* doc/md.texi (stack_protect_test): Remove negation of branch to
label.
(Standard Names): Fix typos in documentation for atomic patterns.
2012-05-27 Nathan Sidwell <nathan@acm.org>

View file

@ -5885,7 +5885,7 @@ from a compare-and-swap operation, if defined.
@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 operand to the binary operator.
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 operand to the binary operator.
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.