[Ada] Minor rewording of one sentence

2019-12-13  Gary Dismukes  <dismukes@adacore.com>

gcc/ada/

	* doc/gnat_rm/implementation_defined_pragmas.rst: Minor
	rewording of one sentence.
	* gnat_rm.texi: Regenerate.

From-SVN: r279368

diff --git a/gcc/ada/ChangeLog b/gcc/ada/ChangeLog
index d48a3610e55bda42b0fd931c94d27673d452a094..1fea3533b73f4b0c29dc5b2a9838f3fc239a5aad 100644 (file)
--- a/gcc/ada/ChangeLog
+++ b/gcc/ada/ChangeLog
@@ -1,3 +1,9 @@
+2019-12-13  Gary Dismukes  <dismukes@adacore.com>
+
+       * doc/gnat_rm/implementation_defined_pragmas.rst: Minor
+       rewording of one sentence.
+       * gnat_rm.texi: Regenerate.
+
 2019-12-13  Arnaud Charlet  <charlet@adacore.com>
 
        * exp_unst.adb (Unnest_Subprogram): Account for trees produced

diff --git a/gcc/ada/doc/gnat_rm/implementation_defined_pragmas.rst b/gcc/ada/doc/gnat_rm/implementation_defined_pragmas.rst
index 04e4ac8049f91ddae089e7e9b4513e71585d9172..6d0bdd8e7859e0ed7febe316cf7d7e284a96c355 100644 (file)
--- a/gcc/ada/doc/gnat_rm/implementation_defined_pragmas.rst
+++ b/gcc/ada/doc/gnat_rm/implementation_defined_pragmas.rst
@@ -3058,8 +3058,8 @@ different ways:
 
   The compile-time approach is intended to optimize the generated code for the
   pragma, by possibly using fast operations such as ``memset``. Note that such
-  optimizations require using values the bytes of which all have the same
-  binary representation.
+  optimizations require using values where the bytes all have the same binary
+  representation.
 
 * At bind time, the programmer has several options:
 

diff --git a/gcc/ada/gnat_rm.texi b/gcc/ada/gnat_rm.texi
index 19c6290edd36aa225d28b43874f2d26f808efb99..f7c29237d9f43de9fa66a179ebb56fdb0c9a1c43 100644 (file)
--- a/gcc/ada/gnat_rm.texi
+++ b/gcc/ada/gnat_rm.texi
@@ -4509,8 +4509,8 @@ particular family of scalar types using the optional arguments of the pragma.
 
 The compile-time approach is intended to optimize the generated code for the
 pragma, by possibly using fast operations such as @code{memset}. Note that such
-optimizations require using values the bytes of which all have the same
-binary representation.
+optimizations require using values where the bytes all have the same binary
+representation.
 
 @item 
 At bind time, the programmer has several options: