c0bd9f9fe5
Current strategy: everything from the top
Things to look at first are the manual changes:
- added tools/rewrite_includes.py
- removed -Idirectives from BUILD.gn
- various compile.sh simplifications
- tweak tools/embed_resources.py
- update gn/find_headers.py to write paths from the top
- update gn/gn_to_bp.py SkUserConfig.h layout
so that #include "include/config/SkUserConfig.h" always
gets the header we want.
No-Presubmit: true
Change-Id: I73a4b181654e0e38d229bc456c0d0854bae3363e
Reviewed-on: https://skia-review.googlesource.com/c/skia/+/209706
Commit-Queue: Mike Klein <mtklein@google.com>
Reviewed-by: Hal Canary <halcanary@google.com>
Reviewed-by: Brian Osman <brianosman@google.com>
Reviewed-by: Florin Malita <fmalita@chromium.org>
41 lines
1.2 KiB
C++
41 lines
1.2 KiB
C++
/*
|
|
* Copyright 2018 Google LLC
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
|
|
#include "fuzz/Fuzz.h"
|
|
#include "src/utils/SkPolyUtils.h"
|
|
|
|
void inline ignoreResult(bool ) {}
|
|
|
|
DEF_FUZZ(PolyUtils, fuzz) {
|
|
int count;
|
|
fuzz->nextRange(&count, 0, 512);
|
|
SkAutoSTMalloc<64, SkPoint> polygon(count);
|
|
for (int index = 0; index < count; ++index) {
|
|
fuzz->next(&polygon[index].fX, &polygon[index].fY);
|
|
}
|
|
|
|
ignoreResult(SkGetPolygonWinding(polygon, count));
|
|
ignoreResult(SkIsConvexPolygon(polygon, count));
|
|
ignoreResult(SkIsSimplePolygon(polygon, count));
|
|
|
|
SkScalar inset;
|
|
fuzz->next(&inset);
|
|
SkTDArray<SkPoint> output;
|
|
ignoreResult(SkInsetConvexPolygon(polygon, count, inset, &output));
|
|
|
|
SkScalar offset;
|
|
fuzz->next(&offset);
|
|
ignoreResult(SkOffsetSimplePolygon(polygon, count, offset, &output));
|
|
|
|
SkAutoSTMalloc<64, uint16_t> indexMap(count);
|
|
for (int index = 0; index < count; ++index) {
|
|
fuzz->next(&indexMap[index]);
|
|
}
|
|
SkTDArray<uint16_t> outputIndices;
|
|
ignoreResult(SkTriangulateSimplePolygon(polygon, indexMap, count, &outputIndices));
|
|
}
|