This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
pp.c: White space only
authorKarl Williamson <public@khwilliamson.com>
Sun, 16 Oct 2011 15:16:39 +0000 (09:16 -0600)
committerKarl Williamson <public@khwilliamson.com>
Mon, 17 Oct 2011 23:04:28 +0000 (17:04 -0600)
This outdents a block to the same level as the surrounding text, and
reflows the comments to take advantage of the extra space and use fewer
lines.

pp.c

diff --git a/pp.c b/pp.c
index c1e4c11..7114f89 100644 (file)
--- a/pp.c
+++ b/pp.c
@@ -4138,22 +4138,21 @@ PP(pp_lc)
                 * the commit message for this comment for why there isn't any
                 */
 
-                   if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
-
-                       /* If the eventually required minimum size outgrows
-                        * the available space, we need to grow. */
-                       const UV o = d - (U8*)SvPVX_const(dest);
-
-                       /* If someone lowercases one million U+0130s we
-                        * SvGROW() one million times.  Or we could try
-                        * guessing how much to allocate without allocating too
-                        * much.  Such is life.  Another option would be to
-                        * grow an extra byte or two more each time we need to
-                        * grow, which would cut down the million to 500K, with
-                        * little waste */
-                       SvGROW(dest, min);
-                       d = (U8*)SvPVX(dest) + o;
-                   }
+               if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
+
+                   /* If the eventually required minimum size outgrows the
+                    * available space, we need to grow. */
+                   const UV o = d - (U8*)SvPVX_const(dest);
+
+                   /* If someone lowercases one million U+0130s we SvGROW()
+                    * one million times.  Or we could try guessing how much to
+                    * allocate without allocating too much.  Such is life.
+                    * Another option would be to grow an extra byte or two
+                    * more each time we need to grow, which would cut down the
+                    * million to 500K, with little waste */
+                   SvGROW(dest, min);
+                   d = (U8*)SvPVX(dest) + o;
+               }
 
                /* Copy the newly lowercased letter to the output buffer we're
                 * building */