|
| 1 | +/* |
| 2 | + * Copyright 2023-2024 Uber Technologies, Inc. |
| 3 | + * |
| 4 | + * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | + * you may not use this file except in compliance with the License. |
| 6 | + * You may obtain a copy of the License at |
| 7 | + * |
| 8 | + * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | + * |
| 10 | + * Unless required by applicable law or agreed to in writing, software |
| 11 | + * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | + * See the License for the specific language governing permissions and |
| 14 | + * limitations under the License. |
| 15 | + */ |
| 16 | +/** @file |
| 17 | + * @brief Fuzzer program for polygonToCells2 and related functions |
| 18 | + */ |
| 19 | + |
| 20 | +#include "aflHarness.h" |
| 21 | +#include "h3api.h" |
| 22 | +#include "polyfill.h" |
| 23 | +#include "polygon.h" |
| 24 | +#include "utility.h" |
| 25 | + |
| 26 | +typedef struct { |
| 27 | + int res; |
| 28 | + int numHoles; |
| 29 | + // repeating: num verts, verts |
| 30 | + // We add a large fixed buffer so our test case generator for AFL |
| 31 | + // knows how large to make the file. |
| 32 | + uint8_t buffer[1024]; |
| 33 | +} inputArgs; |
| 34 | + |
| 35 | +const int MAX_RES = 15; |
| 36 | +const int MAX_SZ = 4000000; |
| 37 | +const int MAX_HOLES = 100; |
| 38 | + |
| 39 | +int populateGeoLoop(GeoLoop *g, const uint8_t *data, size_t *offset, |
| 40 | + size_t size) { |
| 41 | + if (size < *offset + sizeof(int)) { |
| 42 | + return 1; |
| 43 | + } |
| 44 | + int numVerts = *(const int *)(data + *offset); |
| 45 | + *offset = *offset + sizeof(int); |
| 46 | + g->numVerts = numVerts; |
| 47 | + if (size < *offset + sizeof(LatLng) * numVerts) { |
| 48 | + return 1; |
| 49 | + } |
| 50 | + g->verts = (LatLng *)(data + *offset); |
| 51 | + *offset = *offset + sizeof(LatLng) * numVerts; |
| 52 | + return 0; |
| 53 | +} |
| 54 | + |
| 55 | +void run(GeoPolygon *geoPolygon, uint32_t flags, int res) { |
| 56 | + int64_t sz; |
| 57 | + H3Error err = H3_EXPORT(maxPolygonToCellsSizeExperimental)(geoPolygon, res, |
| 58 | + flags, &sz); |
| 59 | + if (!err && sz < MAX_SZ) { |
| 60 | + H3Index *out = calloc(sz, sizeof(H3Index)); |
| 61 | + H3_EXPORT(polygonToCellsExperimental)(geoPolygon, res, flags, out); |
| 62 | + free(out); |
| 63 | + } |
| 64 | +} |
| 65 | + |
| 66 | +int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) { |
| 67 | + // TODO: It is difficult for the fuzzer to generate inputs that are |
| 68 | + // considered valid by this fuzzer. fuzzerPolygonToCellsNoHoles.c |
| 69 | + // is a workaround for that. |
| 70 | + if (size < sizeof(inputArgs)) { |
| 71 | + return 0; |
| 72 | + } |
| 73 | + const inputArgs *args = (const inputArgs *)data; |
| 74 | + int res = args->res % (MAX_RES + 1); |
| 75 | + |
| 76 | + GeoPolygon geoPolygon; |
| 77 | + int originalNumHoles = args->numHoles % MAX_HOLES; |
| 78 | + geoPolygon.numHoles = originalNumHoles; |
| 79 | + if (geoPolygon.numHoles < 0) { |
| 80 | + return 0; |
| 81 | + } |
| 82 | + geoPolygon.holes = calloc(geoPolygon.numHoles, sizeof(GeoLoop)); |
| 83 | + size_t offset = sizeof(inputArgs) - sizeof(args->buffer); |
| 84 | + if (populateGeoLoop(&geoPolygon.geoloop, data, &offset, size)) { |
| 85 | + free(geoPolygon.holes); |
| 86 | + return 0; |
| 87 | + } |
| 88 | + for (int i = 0; i < geoPolygon.numHoles; i++) { |
| 89 | + if (populateGeoLoop(&geoPolygon.holes[i], data, &offset, size)) { |
| 90 | + free(geoPolygon.holes); |
| 91 | + return 0; |
| 92 | + } |
| 93 | + } |
| 94 | + |
| 95 | + for (uint32_t flags = 0; flags < CONTAINMENT_INVALID; flags++) { |
| 96 | + geoPolygon.numHoles = originalNumHoles; |
| 97 | + run(&geoPolygon, flags, res); |
| 98 | + geoPolygon.numHoles = 0; |
| 99 | + run(&geoPolygon, flags, res); |
| 100 | + } |
| 101 | + free(geoPolygon.holes); |
| 102 | + |
| 103 | + return 0; |
| 104 | +} |
| 105 | + |
| 106 | +AFL_HARNESS_MAIN(sizeof(inputArgs)); |
0 commit comments