Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright 2016 The Chromium Authors. All rights reserved. | |
| 2 // Use of this source code is governed by a BSD-style license that can be | |
| 3 // found in the LICENSE file. | |
| 4 | |
| 5 #include <stddef.h> | |
| 6 #include <stdint.h> | |
| 7 | |
| 8 #include "third_party/skia/include/core/SkCanvas.h" | |
| 9 #include "third_party/skia/include/core/SkPaint.h" | |
| 10 #include "third_party/skia/include/core/SkPath.h" | |
| 11 #include "third_party/skia/include/core/SkSurface.h" | |
| 12 | |
| 13 const int OPERATION_COUNT = 9; | |
| 14 | |
| 15 template <typename T> | |
|
Martin Barbella
2016/06/01 23:43:36
I'm assuming this comes up a lot in other fuzzers
mmoroz
2016/06/02 10:05:22
I've seen a similar thing in some of networking fu
| |
| 16 static bool read(uint8_t** data, size_t* size, T* value) { | |
| 17 if (*size < sizeof(value)) | |
| 18 return false; | |
| 19 | |
| 20 *value = *reinterpret_cast<T*>(*data); | |
| 21 *data += sizeof(value); | |
| 22 *size -= sizeof(value); | |
| 23 return true; | |
| 24 } | |
| 25 | |
| 26 extern "C" int LLVMFuzzerTestOneInput(uint8_t* data, size_t size) { | |
| 27 SkPath path; | |
|
Martin Barbella
2016/06/01 23:43:36
SkPath::readFromMemory actually looks takes data a
| |
| 28 uint8_t operation; | |
| 29 SkScalar a, b, c, d, e, f; | |
| 30 | |
| 31 while (read<uint8_t>(&data, &size, &operation)) { | |
| 32 bool result = true; | |
| 33 switch (operation % OPERATION_COUNT) { | |
| 34 // Path building. | |
| 35 case 0: | |
| 36 result = read<SkScalar>(&data, &size, &a) && | |
| 37 read<SkScalar>(&data, &size, &b); | |
| 38 if (result) | |
| 39 path.lineTo(a, b); | |
| 40 break; | |
| 41 | |
| 42 case 1: | |
| 43 result = read<SkScalar>(&data, &size, &a) && | |
| 44 read<SkScalar>(&data, &size, &b) && | |
| 45 read<SkScalar>(&data, &size, &c) && | |
| 46 read<SkScalar>(&data, &size, &d); | |
| 47 if (result) | |
| 48 path.quadTo(a, b, c, d); | |
| 49 break; | |
| 50 | |
| 51 case 2: | |
| 52 result = read<SkScalar>(&data, &size, &a) && | |
| 53 read<SkScalar>(&data, &size, &b) && | |
| 54 read<SkScalar>(&data, &size, &c) && | |
| 55 read<SkScalar>(&data, &size, &d) && | |
| 56 read<SkScalar>(&data, &size, &e); | |
| 57 if (result) | |
| 58 path.conicTo(a, b, c, d, e); | |
| 59 break; | |
| 60 | |
| 61 case 3: | |
| 62 result = read<SkScalar>(&data, &size, &a) && | |
| 63 read<SkScalar>(&data, &size, &b) && | |
| 64 read<SkScalar>(&data, &size, &c) && | |
| 65 read<SkScalar>(&data, &size, &d) && | |
| 66 read<SkScalar>(&data, &size, &e) && | |
| 67 read<SkScalar>(&data, &size, &f); | |
| 68 if (result) | |
| 69 path.cubicTo(a, b, c, d, e, f); | |
| 70 break; | |
| 71 | |
| 72 case 5: | |
| 73 result = read<SkScalar>(&data, &size, &a) && | |
| 74 read<SkScalar>(&data, &size, &b); | |
| 75 if (result) | |
| 76 path.moveTo(a, b); | |
| 77 break; | |
| 78 | |
| 79 case 6: | |
| 80 path.close(); | |
| 81 break; | |
| 82 | |
| 83 // Potentially interesting calls using the current path. | |
| 84 case 7: | |
| 85 result = read<SkScalar>(&data, &size, &a) && | |
| 86 read<SkScalar>(&data, &size, &b); | |
| 87 if (result) | |
| 88 path.contains(a, b); | |
| 89 break; | |
| 90 | |
| 91 case 8: | |
| 92 result = read<SkScalar>(&data, &size, &a) && | |
| 93 read<SkScalar>(&data, &size, &b) && | |
| 94 read<SkScalar>(&data, &size, &c) && | |
| 95 read<SkScalar>(&data, &size, &d); | |
| 96 if (result) { | |
| 97 SkRect rect = SkRect::MakeLTRB(a, b, c, d); | |
| 98 path.conservativelyContainsRect(rect); | |
| 99 } | |
| 100 break; | |
| 101 } | |
| 102 | |
| 103 if (!result) | |
| 104 break; | |
| 105 } | |
| 106 | |
| 107 SkPaint paint; | |
| 108 auto surface(SkSurface::MakeRasterN32Premul(128, 128)); | |
| 109 SkCanvas* canvas = surface->getCanvas(); | |
| 110 canvas->drawPath(path, paint); | |
| 111 | |
| 112 return 0; | |
| 113 } | |
| OLD | NEW |