| |
| |
| |
|
|
| package fuzz |
|
|
| import ( |
| "reflect" |
| ) |
|
|
| func isMinimizable(t reflect.Type) bool { |
| return t == reflect.TypeOf("") || t == reflect.TypeOf([]byte(nil)) |
| } |
|
|
| func minimizeBytes(v []byte, try func([]byte) bool, shouldStop func() bool) { |
| tmp := make([]byte, len(v)) |
| |
| |
| |
| |
| |
| defer copy(tmp, v) |
|
|
| |
| for n := 1024; n != 0; n /= 2 { |
| for len(v) > n { |
| if shouldStop() { |
| return |
| } |
| candidate := v[:len(v)-n] |
| if !try(candidate) { |
| break |
| } |
| |
| v = candidate |
| } |
| } |
|
|
| |
| for i := 0; i < len(v)-1; i++ { |
| if shouldStop() { |
| return |
| } |
| candidate := tmp[:len(v)-1] |
| copy(candidate[:i], v[:i]) |
| copy(candidate[i:], v[i+1:]) |
| if !try(candidate) { |
| continue |
| } |
| |
| copy(v[i:], v[i+1:]) |
| v = v[:len(candidate)] |
| |
| |
| i-- |
| } |
|
|
| |
| for i := 0; i < len(v)-1; i++ { |
| copy(tmp, v[:i]) |
| for j := len(v); j > i+1; j-- { |
| if shouldStop() { |
| return |
| } |
| candidate := tmp[:len(v)-j+i] |
| copy(candidate[i:], v[j:]) |
| if !try(candidate) { |
| continue |
| } |
| |
| copy(v[i:], v[j:]) |
| v = v[:len(candidate)] |
| j = len(v) |
| } |
| } |
|
|
| |
| |
| printableChars := []byte("012789ABCXYZabcxyz !\"#$%&'()*+,.") |
| for i, b := range v { |
| if shouldStop() { |
| return |
| } |
|
|
| for _, pc := range printableChars { |
| v[i] = pc |
| if try(v) { |
| |
| break |
| } |
| |
| v[i] = b |
| } |
| } |
| } |
|
|