mirror of
https://codeberg.org/ziglang/zig.git
synced 2025-12-09 23:29:03 +00:00
93775de45f
-- On the standard library side: The `input: []const u8` parameter of functions passed to `testing.fuzz` has changed to `smith: *testing.Smith`. `Smith` is used to generate values from libfuzzer or input bytes generated by libfuzzer. `Smith` contains the following base methods: * `value` as a generic method for generating any type * `eos` for generating end-of-stream markers. Provides the additional guarantee `true` will eventually by provided. * `bytes` for filling a byte array. * `slice` for filling part of a buffer and providing the length. `Smith.Weight` is used for giving value ranges a higher probability of being selected. By default, every value has a weight of zero (i.e. they will not be selected). Weights can only apply to values that fit within a u64. The above functions have corresponding ones that accept weights. Additionally, the following functions are provided: * `baselineWeights` which provides a set of weights containing every possible value of a type. * `eosSimpleWeighted` for unique weights for `true` and `false` * `valueRangeAtMost` and `valueRangeLessThan` for weighing only a range of values. -- On the libfuzzer and abi side: --- Uids These are u32s which are used to classify requested values. This solves the problem of a mutation causing a new value to be requested and shifting all future values; for example: 1. An initial input contains the values 1, 2, 3 which are interpreted as a, b, and c respectively by the test. 2. The 1 is mutated to a 4 which causes the test to request an extra value interpreted as d. The input is now 4, 2, 3, 5 (new value) which the test corresponds to a, d, b, c; however, b and c no longer correspond to their original values. Uids contain a hash component and type component. The hash component is currently determined in `Smith` by taking a hash of the calling `@returnAddress()` or via an argument in the corresponding `WithHash` functions. The type component is used extensively in libfuzzer with its hashmaps. --- Mutations At the start of a cycle (a run), a random number of values to mutate is selected with less being exponentially more likely. The indexes of the values are selected from a selected uid with a logarithmic bias to uids with more values. Mutations may change a single values, several consecutive values in a uid, or several consecutive values in the uid-independent order they were requested. They may generate random values, mutate from previous ones, or copy from other values in the same uid from the same input or spliced from another. For integers, mutations from previous ones currently only generates random values. For bytes, mutations from previous mix new random data and previous bytes with a set number of mutations. --- Passive Minimization A different approach has been taken for minimizing inputs: instead of trying a fixed set of mutations when a fresh input is found, the input is instead simply added to the corpus and removed when it is no longer valuable. The quality of an input is measured based off how many unique pcs it hit and how many values it needed from the fuzzer. It is tracked which inputs hold the best qualities for each pc for hitting the minimum and maximum unique pcs while needing the least values. Once all an input's qualities have been superseded for the pcs it hit, it is removed from the corpus. -- Comparison to byte-based smith A byte-based smith would be much more inefficient and complex than this solution. It would be unable to solve the shifting problem that Uids do. It is unable to provide values from the fuzzer past end-of-stream. Even with feedback, it would be unable to act on dynamic weights which have proven essential with the updated tests (e.g. to constrain values to a range). -- Test updates All the standard library tests have been updated to use the new smith interface. For `Deque`, an ad hoc allocator was written to improve performance and remove reliance on heap allocation. `TokenSmith` has been added to aid in testing Ast and help inform decisions on the smith interface. |
||
|---|---|---|
| .. | ||
| Build | ||
| builtin | ||
| c | ||
| compress | ||
| crypto | ||
| debug | ||
| dwarf | ||
| fmt | ||
| fs | ||
| hash | ||
| heap | ||
| http | ||
| Io | ||
| json | ||
| math | ||
| mem | ||
| meta | ||
| os | ||
| posix | ||
| process | ||
| Random | ||
| sort | ||
| tar | ||
| Target | ||
| testing | ||
| Thread | ||
| time | ||
| tz | ||
| unicode | ||
| valgrind | ||
| zig | ||
| zon | ||
| array_hash_map.zig | ||
| array_list.zig | ||
| ascii.zig | ||
| atomic.zig | ||
| base64.zig | ||
| bit_set.zig | ||
| BitStack.zig | ||
| buf_map.zig | ||
| buf_set.zig | ||
| Build.zig | ||
| builtin.zig | ||
| c.zig | ||
| coff.zig | ||
| compress.zig | ||
| crypto.zig | ||
| debug.zig | ||
| deque.zig | ||
| DoublyLinkedList.zig | ||
| dwarf.zig | ||
| dynamic_library.zig | ||
| elf.zig | ||
| enums.zig | ||
| fmt.zig | ||
| fs.zig | ||
| gpu.zig | ||
| hash.zig | ||
| hash_map.zig | ||
| heap.zig | ||
| http.zig | ||
| Io.zig | ||
| json.zig | ||
| leb128.zig | ||
| log.zig | ||
| macho.zig | ||
| math.zig | ||
| mem.zig | ||
| meta.zig | ||
| multi_array_list.zig | ||
| once.zig | ||
| os.zig | ||
| pdb.zig | ||
| pie.zig | ||
| posix.zig | ||
| priority_dequeue.zig | ||
| priority_queue.zig | ||
| process.zig | ||
| Progress.zig | ||
| Random.zig | ||
| SemanticVersion.zig | ||
| simd.zig | ||
| SinglyLinkedList.zig | ||
| sort.zig | ||
| start.zig | ||
| static_string_map.zig | ||
| std.zig | ||
| tar.zig | ||
| Target.zig | ||
| testing.zig | ||
| Thread.zig | ||
| time.zig | ||
| treap.zig | ||
| tz.zig | ||
| unicode.zig | ||
| Uri.zig | ||
| valgrind.zig | ||
| wasm.zig | ||
| zig.zig | ||
| zip.zig | ||
| zon.zig | ||