Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
/*
|
|
|
|
* Copyright 2011 Google Inc.
|
|
|
|
*
|
|
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
|
|
* found in the LICENSE file.
|
|
|
|
*/
|
|
|
|
#include "gm.h"
|
|
|
|
#include "SkCanvas.h"
|
|
|
|
#include "SkPaint.h"
|
|
|
|
#include "SkRandom.h"
|
|
|
|
|
|
|
|
namespace skiagm {
|
|
|
|
|
|
|
|
class DegenerateSegmentsGM : public GM {
|
|
|
|
public:
|
|
|
|
DegenerateSegmentsGM() {}
|
|
|
|
|
|
|
|
protected:
|
|
|
|
struct PathAndName {
|
|
|
|
SkPath fPath;
|
|
|
|
const char* fName1;
|
|
|
|
const char* fName2;
|
|
|
|
};
|
|
|
|
|
|
|
|
SkString onShortName() {
|
|
|
|
return SkString("degeneratesegments");
|
|
|
|
}
|
|
|
|
|
2011-12-21 01:48:14 +04:00
|
|
|
SkISize onISize() { return make_isize(896, 930); }
|
Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
|
|
|
|
typedef SkPoint (*AddSegmentFunc)(SkPath&, SkPoint&);
|
|
|
|
|
|
|
|
// We need to use explicit commands here, instead of addPath, because we
|
2012-01-05 01:05:51 +04:00
|
|
|
// do not want the moveTo that is added at the beginning of a path to
|
|
|
|
// appear in the appended path.
|
Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
static SkPoint AddMove(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
return moveToPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveClose(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.close();
|
|
|
|
return moveToPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddDegenLine(SkPath& path, SkPoint& startPt) {
|
|
|
|
path.lineTo(startPt);
|
|
|
|
return startPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveDegenLine(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.lineTo(moveToPt);
|
|
|
|
return moveToPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveDegenLineClose(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.lineTo(moveToPt);
|
|
|
|
path.close();
|
|
|
|
return moveToPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddDegenQuad(SkPath& path, SkPoint& startPt) {
|
|
|
|
path.quadTo(startPt, startPt);
|
|
|
|
return startPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveDegenQuad(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.quadTo(moveToPt, moveToPt);
|
|
|
|
return moveToPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveDegenQuadClose(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.quadTo(moveToPt, moveToPt);
|
|
|
|
path.close();
|
|
|
|
return moveToPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddDegenCubic(SkPath& path, SkPoint& startPt) {
|
|
|
|
path.cubicTo(startPt, startPt, startPt);
|
|
|
|
return startPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveDegenCubic(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.cubicTo(moveToPt, moveToPt, moveToPt);
|
|
|
|
return moveToPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveDegenCubicClose(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.cubicTo(moveToPt, moveToPt, moveToPt);
|
|
|
|
path.close();
|
|
|
|
return moveToPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddClose(SkPath& path, SkPoint& startPt) {
|
|
|
|
path.close();
|
|
|
|
return startPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddLine(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0);
|
|
|
|
path.lineTo(endPt);
|
|
|
|
return endPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveLine(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.lineTo(endPt);
|
|
|
|
return endPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveLineClose(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.lineTo(endPt);
|
|
|
|
path.close();
|
|
|
|
return endPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddQuad(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint midPt = startPt + SkPoint::Make(20*SK_Scalar1, 5*SK_Scalar1);
|
|
|
|
SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0);
|
|
|
|
path.quadTo(midPt, endPt);
|
|
|
|
return endPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveQuad(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
SkPoint midPt = moveToPt + SkPoint::Make(20*SK_Scalar1, 5*SK_Scalar1);
|
|
|
|
SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.quadTo(midPt, endPt);
|
|
|
|
return endPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveQuadClose(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
SkPoint midPt = moveToPt + SkPoint::Make(20*SK_Scalar1, 5*SK_Scalar1);
|
|
|
|
SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.quadTo(midPt, endPt);
|
|
|
|
path.close();
|
|
|
|
return endPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddCubic(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint t1Pt = startPt + SkPoint::Make(15*SK_Scalar1, 5*SK_Scalar1);
|
|
|
|
SkPoint t2Pt = startPt + SkPoint::Make(25*SK_Scalar1, 5*SK_Scalar1);
|
|
|
|
SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0);
|
|
|
|
path.cubicTo(t1Pt, t2Pt, endPt);
|
|
|
|
return endPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveCubic(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
SkPoint t1Pt = moveToPt + SkPoint::Make(15*SK_Scalar1, 5*SK_Scalar1);
|
|
|
|
SkPoint t2Pt = moveToPt + SkPoint::Make(25*SK_Scalar1, 5*SK_Scalar1);
|
|
|
|
SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.cubicTo(t1Pt, t2Pt, endPt);
|
|
|
|
return endPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SkPoint AddMoveCubicClose(SkPath& path, SkPoint& startPt) {
|
|
|
|
SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
|
|
|
|
SkPoint t1Pt = moveToPt + SkPoint::Make(15*SK_Scalar1, 5*SK_Scalar1);
|
|
|
|
SkPoint t2Pt = moveToPt + SkPoint::Make(25*SK_Scalar1, 5*SK_Scalar1);
|
|
|
|
SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0);
|
|
|
|
path.moveTo(moveToPt);
|
|
|
|
path.cubicTo(t1Pt, t2Pt, endPt);
|
|
|
|
path.close();
|
|
|
|
return endPt;
|
|
|
|
}
|
|
|
|
|
|
|
|
void drawPath(SkPath& path, SkCanvas* canvas, SkColor color,
|
2011-12-21 01:48:14 +04:00
|
|
|
const SkRect& clip, SkPaint::Cap cap, SkPaint::Join join,
|
Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
SkPaint::Style style, SkPath::FillType fill,
|
|
|
|
SkScalar strokeWidth) {
|
|
|
|
path.setFillType(fill);
|
|
|
|
SkPaint paint;
|
|
|
|
paint.setStrokeCap(cap);
|
|
|
|
paint.setStrokeWidth(strokeWidth);
|
2011-12-21 01:48:14 +04:00
|
|
|
paint.setStrokeJoin(join);
|
Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
paint.setColor(color);
|
|
|
|
paint.setStyle(style);
|
|
|
|
canvas->save();
|
|
|
|
canvas->clipRect(clip);
|
|
|
|
canvas->drawPath(path, paint);
|
|
|
|
canvas->restore();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void onDraw(SkCanvas* canvas) {
|
2012-01-05 01:05:51 +04:00
|
|
|
static const AddSegmentFunc gSegmentFunctions[] = {
|
|
|
|
AddMove,
|
|
|
|
AddMoveClose,
|
|
|
|
AddDegenLine,
|
|
|
|
AddMoveDegenLine,
|
|
|
|
AddMoveDegenLineClose,
|
|
|
|
AddDegenQuad,
|
|
|
|
AddMoveDegenQuad,
|
|
|
|
AddMoveDegenQuadClose,
|
|
|
|
AddDegenCubic,
|
|
|
|
AddMoveDegenCubic,
|
|
|
|
AddMoveDegenCubicClose,
|
|
|
|
AddClose,
|
|
|
|
AddLine,
|
|
|
|
AddMoveLine,
|
|
|
|
AddMoveLineClose,
|
|
|
|
AddQuad,
|
|
|
|
AddMoveQuad,
|
|
|
|
AddMoveQuadClose,
|
|
|
|
AddCubic,
|
|
|
|
AddMoveCubic,
|
|
|
|
AddMoveCubicClose
|
|
|
|
};
|
|
|
|
static const char* gSegmentNames[] = {
|
|
|
|
"Move",
|
|
|
|
"MoveClose",
|
|
|
|
"DegenLine",
|
|
|
|
"MoveDegenLine",
|
|
|
|
"MoveDegenLineClose",
|
|
|
|
"DegenQuad",
|
|
|
|
"MoveDegenQuad",
|
|
|
|
"MoveDegenQuadClose",
|
|
|
|
"DegenCubic",
|
|
|
|
"MoveDegenCubic",
|
|
|
|
"MoveDegenCubicClose",
|
|
|
|
"Close",
|
|
|
|
"Line",
|
|
|
|
"MoveLine",
|
|
|
|
"MoveLineClose",
|
|
|
|
"Quad",
|
|
|
|
"MoveQuad",
|
|
|
|
"MoveQuadClose",
|
|
|
|
"Cubic",
|
|
|
|
"MoveCubic",
|
|
|
|
"MoveCubicClose"
|
|
|
|
};
|
Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
|
|
|
|
struct FillAndName {
|
|
|
|
SkPath::FillType fFill;
|
|
|
|
const char* fName;
|
|
|
|
};
|
|
|
|
static const FillAndName gFills[] = {
|
|
|
|
{SkPath::kWinding_FillType, "Winding"},
|
|
|
|
{SkPath::kEvenOdd_FillType, "Even / Odd"},
|
|
|
|
{SkPath::kInverseWinding_FillType, "Inverse Winding"},
|
|
|
|
{SkPath::kInverseEvenOdd_FillType, "Inverse Even / Odd"}
|
|
|
|
};
|
|
|
|
struct StyleAndName {
|
|
|
|
SkPaint::Style fStyle;
|
|
|
|
const char* fName;
|
|
|
|
};
|
|
|
|
static const StyleAndName gStyles[] = {
|
|
|
|
{SkPaint::kFill_Style, "Fill"},
|
|
|
|
{SkPaint::kStroke_Style, "Stroke 10"},
|
|
|
|
{SkPaint::kStrokeAndFill_Style, "Stroke 10 And Fill"}
|
|
|
|
};
|
|
|
|
struct CapAndName {
|
2011-12-21 01:48:14 +04:00
|
|
|
SkPaint::Cap fCap;
|
|
|
|
SkPaint::Join fJoin;
|
|
|
|
const char* fName;
|
Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
};
|
|
|
|
static const CapAndName gCaps[] = {
|
2011-12-21 01:48:14 +04:00
|
|
|
{SkPaint::kButt_Cap, SkPaint::kBevel_Join, "Butt"},
|
|
|
|
{SkPaint::kRound_Cap, SkPaint::kRound_Join, "Round"},
|
|
|
|
{SkPaint::kSquare_Cap, SkPaint::kBevel_Join, "Square"}
|
Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
SkPaint titlePaint;
|
|
|
|
titlePaint.setColor(SK_ColorBLACK);
|
|
|
|
titlePaint.setAntiAlias(true);
|
|
|
|
titlePaint.setLCDRenderText(true);
|
|
|
|
titlePaint.setTextSize(15 * SK_Scalar1);
|
|
|
|
const char title[] = "Random Paths Drawn Into Rectangle Clips With "
|
|
|
|
"Indicated Style, Fill and Linecaps, "
|
|
|
|
"with Stroke width 6";
|
|
|
|
canvas->drawText(title, strlen(title),
|
|
|
|
20 * SK_Scalar1,
|
|
|
|
20 * SK_Scalar1,
|
|
|
|
titlePaint);
|
|
|
|
|
|
|
|
SkRandom rand;
|
|
|
|
SkRect rect = SkRect::MakeWH(220*SK_Scalar1, 50*SK_Scalar1);
|
|
|
|
canvas->save();
|
|
|
|
canvas->translate(2*SK_Scalar1, 30 * SK_Scalar1); // The title
|
|
|
|
canvas->save();
|
|
|
|
unsigned numSegments = SK_ARRAY_COUNT(gSegmentFunctions);
|
|
|
|
unsigned numCaps = SK_ARRAY_COUNT(gCaps);
|
|
|
|
unsigned numStyles = SK_ARRAY_COUNT(gStyles);
|
|
|
|
unsigned numFills = SK_ARRAY_COUNT(gFills);
|
2011-12-21 01:48:14 +04:00
|
|
|
for (size_t row = 0; row < 6; ++row) {
|
Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
if (0 < row) {
|
|
|
|
canvas->translate(0, rect.height() + 100*SK_Scalar1);
|
|
|
|
}
|
|
|
|
canvas->save();
|
2011-12-21 01:48:14 +04:00
|
|
|
for (size_t column = 0; column < 4; ++column) {
|
Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
if (0 < column) {
|
|
|
|
canvas->translate(rect.width() + 4*SK_Scalar1, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
SkColor color = 0xff007000;
|
|
|
|
StyleAndName style = gStyles[(rand.nextU() >> 16) % numStyles];
|
|
|
|
CapAndName cap = gCaps[(rand.nextU() >> 16) % numCaps];
|
|
|
|
FillAndName fill = gFills[(rand.nextU() >> 16) % numFills];
|
|
|
|
SkPath path;
|
|
|
|
unsigned s1 = (rand.nextU() >> 16) % numSegments;
|
|
|
|
unsigned s2 = (rand.nextU() >> 16) % numSegments;
|
|
|
|
unsigned s3 = (rand.nextU() >> 16) % numSegments;
|
|
|
|
unsigned s4 = (rand.nextU() >> 16) % numSegments;
|
|
|
|
unsigned s5 = (rand.nextU() >> 16) % numSegments;
|
|
|
|
SkPoint pt = SkPoint::Make(10*SK_Scalar1, 0);
|
|
|
|
pt = gSegmentFunctions[s1](path, pt);
|
|
|
|
pt = gSegmentFunctions[s2](path, pt);
|
|
|
|
pt = gSegmentFunctions[s3](path, pt);
|
|
|
|
pt = gSegmentFunctions[s4](path, pt);
|
|
|
|
pt = gSegmentFunctions[s5](path, pt);
|
|
|
|
|
|
|
|
this->drawPath(path, canvas, color, rect,
|
2011-12-21 01:48:14 +04:00
|
|
|
cap.fCap, cap.fJoin, style.fStyle,
|
Modifying SkPath to store all verbs provided by the user, and to give
correct results for all stroke and fill modes even on the various types
of degenerate paths.
The goals of this patch include:
1. Have Skia store all of the verbs implied by path construction methods, even
if those define degenerate paths. The SVG implementation in WebKit, which is
backed by Skia, needs to know about all elements of the path, even degenerate
ones, for the correct drawing of markers and line caps. For example, in SVG you
should be able to draw a scatter plot by specifying a marker for vertices and
then giving a sequence of moveTo commands. Skia will not store the moveTos,
requiring a different storage mechanism.
2. Assuming 1, maintain the current Skia behavior. That is, make Skia robust to
degenerate paths.
3. Fix an existing bug in Skia where a degenerate moveTo-lineTo pair spits out
warnings from rasterization and produces incorrect results in inverse-fill
renderings.
4. Adds extensive testing for degenerate paths and path rendering in general.
To meet these goals, the patch I am proposing will result in minor additional
storage for degenerate paths (a few bytes per degenerate path, only if the user
defines such paths). There is also some additional overhead in the iteration
code, with the path now cleaned to remove degenerate segments as part of the
iteration process. I suspect this will also fix issues with computing normal
vectors to degenerate segments. Benchmarking suggests that this change may
result in slightly (< 1%) slower path drawing due to the checks for
degeneracy. This overhead could be removed (in fact, a significant speedup
could occur) if the results of iterating to clean up the path were cached.
This would cost memory, of course, and quite a bit of it.
BUG=398
TEST=tests/PathTest.cpp
gm/cubicpaths.cpp
gm/degeneratesegments.cpp
gm/movepaths.cpp
gm/linepaths.cpp
gm/quadpaths.cpp
Review URL: http://codereview.appspot.com/5482051
git-svn-id: http://skia.googlecode.com/svn/trunk@2901 2bbb7eff-a529-9590-31e7-b0007b416f81
2011-12-20 19:14:18 +04:00
|
|
|
fill.fFill, SK_Scalar1*6);
|
|
|
|
|
|
|
|
SkPaint rectPaint;
|
|
|
|
rectPaint.setColor(SK_ColorBLACK);
|
|
|
|
rectPaint.setStyle(SkPaint::kStroke_Style);
|
|
|
|
rectPaint.setStrokeWidth(-1);
|
|
|
|
rectPaint.setAntiAlias(true);
|
|
|
|
canvas->drawRect(rect, rectPaint);
|
|
|
|
|
|
|
|
SkPaint labelPaint;
|
|
|
|
labelPaint.setColor(color);
|
|
|
|
labelPaint.setAntiAlias(true);
|
|
|
|
labelPaint.setLCDRenderText(true);
|
|
|
|
labelPaint.setTextSize(10 * SK_Scalar1);
|
|
|
|
canvas->drawText(style.fName,
|
|
|
|
strlen(style.fName),
|
|
|
|
0, rect.height() + 12 * SK_Scalar1,
|
|
|
|
labelPaint);
|
|
|
|
canvas->drawText(fill.fName,
|
|
|
|
strlen(fill.fName),
|
|
|
|
0, rect.height() + 24 * SK_Scalar1,
|
|
|
|
labelPaint);
|
|
|
|
canvas->drawText(cap.fName,
|
|
|
|
strlen(cap.fName),
|
|
|
|
0, rect.height() + 36 * SK_Scalar1,
|
|
|
|
labelPaint);
|
|
|
|
canvas->drawText(gSegmentNames[s1],
|
|
|
|
strlen(gSegmentNames[s1]),
|
|
|
|
0, rect.height() + 48 * SK_Scalar1,
|
|
|
|
labelPaint);
|
|
|
|
canvas->drawText(gSegmentNames[s2],
|
|
|
|
strlen(gSegmentNames[s2]),
|
|
|
|
0, rect.height() + 60 * SK_Scalar1,
|
|
|
|
labelPaint);
|
|
|
|
canvas->drawText(gSegmentNames[s3],
|
|
|
|
strlen(gSegmentNames[s3]),
|
|
|
|
0, rect.height() + 72 * SK_Scalar1,
|
|
|
|
labelPaint);
|
|
|
|
canvas->drawText(gSegmentNames[s4],
|
|
|
|
strlen(gSegmentNames[s4]),
|
|
|
|
0, rect.height() + 84 * SK_Scalar1,
|
|
|
|
labelPaint);
|
|
|
|
canvas->drawText(gSegmentNames[s5],
|
|
|
|
strlen(gSegmentNames[s5]),
|
|
|
|
0, rect.height() + 96 * SK_Scalar1,
|
|
|
|
labelPaint);
|
|
|
|
}
|
|
|
|
canvas->restore();
|
|
|
|
}
|
|
|
|
canvas->restore();
|
|
|
|
canvas->restore();
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
typedef GM INHERITED;
|
|
|
|
};
|
|
|
|
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
static GM* MyFactory(void*) { return new DegenerateSegmentsGM; }
|
|
|
|
static GMRegistry reg(MyFactory);
|
|
|
|
|
|
|
|
}
|