Comments Style: s/skbug.com/bug.skia.org/

src/core/SkRRect.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "SkRRect.h"
 #include "SkMatrix.h"
 
@@ skipping 184 matching lines @@
     scale = compute_min_scale(fRadii[2].fX, fRadii[3].fX, fRect.width(),  scale);
     scale = compute_min_scale(fRadii[3].fY, fRadii[0].fY, fRect.height(), scale);
 
     if (scale < 1.0) {
         for (int i = 0; i < 4; ++i) {
             fRadii[i].fX *= scale;
             fRadii[i].fY *= scale;
         }
     }
 
-    // skbug.com/3239 -- its possible that we can hit the following inconsistency:
+    // https://bug.skia.org/3239 -- its possible that we can hit the following inconsistency:
     //     rad == bounds.bottom - bounds.top
     //     bounds.bottom - radius < bounds.top
     //     YIKES
     // We need to detect and "fix" this now, otherwise we can have the following wackiness:
     //     path.addRRect(rrect);
     //     rrect.rect() != path.getBounds()
     for (int i = 0; i < 4; ++i) {
         fRadii[i].fX = clamp_radius_check_predicates(fRadii[i].fX, fRect.fLeft, fRect.fRight);
         fRadii[i].fY = clamp_radius_check_predicates(fRadii[i].fY, fRect.fTop, fRect.fBottom);
     }
@@ skipping 376 matching lines @@
     }
 
     for (int i = 0; i < 4; ++i) {
         validate_radius_check_predicates(fRadii[i].fX, fRect.fLeft, fRect.fRight);
         validate_radius_check_predicates(fRadii[i].fY, fRect.fTop, fRect.fBottom);
     }
 }
 #endif // SK_DEBUG
 
 ///////////////////////////////////////////////////////////////////////////////