Rewrap comments to 80 columns in Source/platform/graphics/paint/.

third_party/WebKit/Source/platform/graphics/paint/GeometryMapper.cpp

 // Copyright 2016 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "platform/graphics/paint/GeometryMapper.h"
 
 #include "platform/geometry/LayoutRect.h"
 
 namespace blink {
 
@@ skipping 25 matching lines @@
 
 FloatRect GeometryMapper::slowMapToVisualRectInDestinationSpace(
     const FloatRect& rect,
     const PropertyTreeState& sourceState,
     const PropertyTreeState& destinationState,
     bool& success) {
   const TransformPaintPropertyNode* lcaTransform = leastCommonAncestor(
       sourceState.transform(), destinationState.transform());
   DCHECK(lcaTransform);
 
-  // Assume that the clip of destinationState is an ancestor of the clip of sourceState
-  // and is under the space of lcaTransform. Otherwise localToAncestorClipRect() will fail.
+  // Assume that the clip of destinationState is an ancestor of the clip of
+  // sourceState and is under the space of lcaTransform. Otherwise
+  // localToAncestorClipRect() will fail.
   PropertyTreeState lcaState = destinationState;
   lcaState.setTransform(lcaTransform);
 
   const auto clipRect = localToAncestorClipRect(sourceState, lcaState, success);
   if (!success)
     return rect;
 
   FloatRect result = localToAncestorRect(rect, sourceState, lcaState, success);
   DCHECK(success);
   result.intersect(clipRect);
@@ skipping 98 matching lines @@
     const PropertyTreeState& localState,
     const PropertyTreeState& ancestorState,
     bool& success) {
   PrecomputedDataForAncestor& precomputedData =
       getPrecomputedDataForAncestor(ancestorState);
   const ClipPaintPropertyNode* clipNode = localState.clip();
   Vector<const ClipPaintPropertyNode*> intermediateNodes;
   FloatRect clip(LayoutRect::infiniteIntRect());
 
   bool found = false;
-  // Iterate over the path from localState.clip to ancestorState.clip. Stop if we've found a memoized (precomputed) clip
-  // for any particular node.
+  // Iterate over the path from localState.clip to ancestorState.clip. Stop if
+  // we've found a memoized (precomputed) clip for any particular node.
   while (clipNode) {
     auto it = precomputedData.toAncestorClipRects.find(clipNode);
     if (it != precomputedData.toAncestorClipRects.end()) {
       clip = it->value;
       found = true;
       break;
     }
     intermediateNodes.append(clipNode);
 
     if (clipNode == ancestorState.clip())
       break;
 
     clipNode = clipNode->parent();
   }
   if (clipNode != ancestorState.clip() && !found) {
     success = false;
     return clip;
   }
 
-  // Iterate down from the top intermediate node found in the previous loop, computing and memoizing clip rects as we go.
+  // Iterate down from the top intermediate node found in the previous loop,
+  // computing and memoizing clip rects as we go.
   for (auto it = intermediateNodes.rbegin(); it != intermediateNodes.rend();
        ++it) {
     if ((*it) != ancestorState.clip()) {
       success = false;
       const TransformationMatrix& transformMatrix = localToAncestorMatrix(
           (*it)->localTransformSpace(), ancestorState, success);
       if (!success)
         return clip;
       FloatRect mappedRect = transformMatrix.mapRect((*it)->clipRect().rect());
       clip.intersect(mappedRect);
@@ skipping 11 matching lines @@
     const PropertyTreeState& ancestorState,
     bool& success) {
   PrecomputedDataForAncestor& precomputedData =
       getPrecomputedDataForAncestor(ancestorState);
 
   const TransformPaintPropertyNode* transformNode = localTransformNode;
   Vector<const TransformPaintPropertyNode*> intermediateNodes;
   TransformationMatrix transformMatrix;
 
   bool found = false;
-  // Iterate over the path from localTransformNode to ancestorState.transform. Stop if we've found a memoized (precomputed) transform
-  // for any particular node.
+  // Iterate over the path from localTransformNode to ancestorState.transform.
+  // Stop if we've found a memoized (precomputed) transform for any particular
+  // node.
   while (transformNode) {
     auto it = precomputedData.toAncestorTransforms.find(transformNode);
     if (it != precomputedData.toAncestorTransforms.end()) {
       transformMatrix = it->value;
       found = true;
       break;
     }
 
     intermediateNodes.append(transformNode);
 
     if (transformNode == ancestorState.transform())
       break;
 
     transformNode = transformNode->parent();
   }
   if (!found && transformNode != ancestorState.transform()) {
     success = false;
     return m_identity;
   }
 
-  // Iterate down from the top intermediate node found in the previous loop, computing and memoizing transforms as we go.
+  // Iterate down from the top intermediate node found in the previous loop,
+  // computing and memoizing transforms as we go.
   for (auto it = intermediateNodes.rbegin(); it != intermediateNodes.rend();
        it++) {
     if ((*it) != ancestorState.transform()) {
       TransformationMatrix localTransformMatrix = (*it)->matrix();
       localTransformMatrix.applyTransformOrigin((*it)->origin());
       transformMatrix = transformMatrix * localTransformMatrix;
     }
 
     precomputedData.toAncestorTransforms.set(*it, transformMatrix);
   }
@@ skipping 35 matching lines @@
 
   // Walk up until we find the ancestor.
   while (a != b) {
     a = a->parent();
     b = b->parent();
   }
   return a;
 }
 
 }  // namespace blink