|
| 1 | +package jsonparser |
| 2 | + |
| 3 | +import ( |
| 4 | + "bytes" |
| 5 | + "testing" |
| 6 | +) |
| 7 | + |
| 8 | +func TestH2I(t *testing.T) { |
| 9 | + hexChars := []byte{'0', '9', 'A', 'F', 'a', 'f', 'x', '\000'} |
| 10 | + hexValues := []int{0, 9, 10, 15, 10, 15, -1, -1} |
| 11 | + |
| 12 | + for i, c := range hexChars { |
| 13 | + if v := h2I(c); v != hexValues[i] { |
| 14 | + t.Errorf("h2I('%c') returned wrong value (obtained %d, expected %d)", c, v, hexValues[i]) |
| 15 | + } |
| 16 | + } |
| 17 | +} |
| 18 | + |
| 19 | +type escapedUnicodeRuneTest struct { |
| 20 | + in string |
| 21 | + isErr bool |
| 22 | + out rune |
| 23 | + len int |
| 24 | +} |
| 25 | + |
| 26 | +var commonUnicodeEscapeTests = []escapedUnicodeRuneTest{ |
| 27 | + {in: `\u0041`, out: 'A', len: 6}, |
| 28 | + {in: `\u0000`, out: 0, len: 6}, |
| 29 | + {in: `\u00b0`, out: '°', len: 6}, |
| 30 | + {in: `\u00B0`, out: '°', len: 6}, |
| 31 | + |
| 32 | + {in: `\x1234`, out: 0x1234, len: 6}, // These functions do not check the \u prefix |
| 33 | + |
| 34 | + {in: ``, isErr: true}, |
| 35 | + {in: `\`, isErr: true}, |
| 36 | + {in: `\u`, isErr: true}, |
| 37 | + {in: `\u1`, isErr: true}, |
| 38 | + {in: `\u11`, isErr: true}, |
| 39 | + {in: `\u111`, isErr: true}, |
| 40 | + {in: `\u123X`, isErr: true}, |
| 41 | +} |
| 42 | + |
| 43 | +var singleUnicodeEscapeTests = append([]escapedUnicodeRuneTest{ |
| 44 | + {in: `\uD83D`, out: 0xD83D, len: 6}, |
| 45 | + {in: `\uDE03`, out: 0xDE03, len: 6}, |
| 46 | + {in: `\uFFFF`, out: 0xFFFF, len: 6}, |
| 47 | +}, commonUnicodeEscapeTests...) |
| 48 | + |
| 49 | +var multiUnicodeEscapeTests = append([]escapedUnicodeRuneTest{ |
| 50 | + {in: `\uD83D`, isErr: true}, |
| 51 | + {in: `\uDE03`, isErr: true}, |
| 52 | + {in: `\uFFFF`, isErr: true}, |
| 53 | + |
| 54 | + {in: `\uD83D\uDE03`, out: '\U0001F603', len: 12}, |
| 55 | + {in: `\uD800\uDC00`, out: '\U00010000', len: 12}, |
| 56 | + |
| 57 | + {in: `\uD800\`, isErr: true}, |
| 58 | + {in: `\uD800\u`, isErr: true}, |
| 59 | + {in: `\uD800\uD`, isErr: true}, |
| 60 | + {in: `\uD800\uDC`, isErr: true}, |
| 61 | + {in: `\uD800\uDC0`, isErr: true}, |
| 62 | + {in: `\uD800\uDBFF`, isErr: true}, // invalid low surrogate |
| 63 | +}, commonUnicodeEscapeTests...) |
| 64 | + |
| 65 | +func TestDecodeSingleUnicodeEscape(t *testing.T) { |
| 66 | + for _, test := range singleUnicodeEscapeTests { |
| 67 | + r, ok := decodeSingleUnicodeEscape([]byte(test.in)) |
| 68 | + isErr := !ok |
| 69 | + |
| 70 | + if isErr != test.isErr { |
| 71 | + t.Errorf("decodeSingleUnicodeEscape(%s) returned isErr mismatch: expected %t, obtained %t", test.in, test.isErr, isErr) |
| 72 | + } else if isErr { |
| 73 | + continue |
| 74 | + } else if r != test.out { |
| 75 | + t.Errorf("decodeSingleUnicodeEscape(%s) returned rune mismatch: expected %x (%c), obtained %x (%c)", test.in, test.out, test.out, r, r) |
| 76 | + } |
| 77 | + } |
| 78 | +} |
| 79 | + |
| 80 | +func TestDecodeUnicodeEscape(t *testing.T) { |
| 81 | + for _, test := range multiUnicodeEscapeTests { |
| 82 | + r, len := decodeUnicodeEscape([]byte(test.in)) |
| 83 | + isErr := (len == -1) |
| 84 | + |
| 85 | + if isErr != test.isErr { |
| 86 | + t.Errorf("decodeUnicodeEscape(%s) returned isErr mismatch: expected %t, obtained %t", test.in, test.isErr, isErr) |
| 87 | + } else if isErr { |
| 88 | + continue |
| 89 | + } else if len != test.len { |
| 90 | + t.Errorf("decodeUnicodeEscape(%s) returned length mismatch: expected %d, obtained %d", test.in, test.len, len) |
| 91 | + } else if r != test.out { |
| 92 | + t.Errorf("decodeUnicodeEscape(%s) returned rune mismatch: expected %x (%c), obtained %x (%c)", test.in, test.out, test.out, r, r) |
| 93 | + } |
| 94 | + } |
| 95 | +} |
| 96 | + |
| 97 | +type unescapeTest struct { |
| 98 | + in string // escaped string |
| 99 | + out string // expected unescaped string |
| 100 | + canAlloc bool // can unescape cause an allocation (depending on buffer size)? true iff 'in' contains escape sequence(s) |
| 101 | + isErr bool // should this operation result in an error |
| 102 | +} |
| 103 | + |
| 104 | +var unescapeTests = []unescapeTest{ |
| 105 | + {in: ``, out: ``, canAlloc: false}, |
| 106 | + {in: `a`, out: `a`, canAlloc: false}, |
| 107 | + {in: `abcde`, out: `abcde`, canAlloc: false}, |
| 108 | + |
| 109 | + {in: `ab\\de`, out: `ab\de`, canAlloc: true}, |
| 110 | + {in: `ab\"de`, out: `ab"de`, canAlloc: true}, |
| 111 | + {in: `ab \u00B0 de`, out: `ab ° de`, canAlloc: true}, |
| 112 | + {in: `ab \uD83D\uDE03 de`, out: "ab \U0001F603 de", canAlloc: true}, |
| 113 | + {in: `\u0000\u0000\u0000\u0000\u0000`, out: "\u0000\u0000\u0000\u0000\u0000", canAlloc: true}, |
| 114 | + {in: `\u0000 \u0000 \u0000 \u0000 \u0000`, out: "\u0000 \u0000 \u0000 \u0000 \u0000", canAlloc: true}, |
| 115 | + {in: ` \u0000 \u0000 \u0000 \u0000 \u0000 `, out: " \u0000 \u0000 \u0000 \u0000 \u0000 ", canAlloc: true}, |
| 116 | + |
| 117 | + {in: `\uD800`, isErr: true}, |
| 118 | + {in: `\uFFFF`, isErr: true}, |
| 119 | + {in: `abcde\`, isErr: true}, |
| 120 | + {in: `abcde\x`, isErr: true}, |
| 121 | + {in: `abcde\u`, isErr: true}, |
| 122 | + {in: `abcde\u1`, isErr: true}, |
| 123 | + {in: `abcde\u12`, isErr: true}, |
| 124 | + {in: `abcde\u123`, isErr: true}, |
| 125 | + {in: `abcde\uD800`, isErr: true}, |
| 126 | + {in: `ab\uD800de`, isErr: true}, |
| 127 | + {in: `\uD800abcde`, isErr: true}, |
| 128 | +} |
| 129 | + |
| 130 | +// isSameMemory checks if two slices contain the same memory pointer (meaning one is a |
| 131 | +// subslice of the other, with possibly differing lengths/capacities). |
| 132 | +func isSameMemory(a, b []byte) bool { |
| 133 | + if cap(a) == 0 || cap(b) == 0 { |
| 134 | + return cap(a) == cap(b) |
| 135 | + } else if a, b = a[:1], b[:1]; a[0] != b[0] { |
| 136 | + return false |
| 137 | + } else { |
| 138 | + a[0]++ |
| 139 | + same := (a[0] == b[0]) |
| 140 | + a[0]-- |
| 141 | + return same |
| 142 | + } |
| 143 | + |
| 144 | +} |
| 145 | + |
| 146 | +func TestUnescape(t *testing.T) { |
| 147 | + for _, test := range unescapeTests { |
| 148 | + type bufferTestCase struct { |
| 149 | + buf []byte |
| 150 | + isTooSmall bool |
| 151 | + } |
| 152 | + |
| 153 | + var bufs []bufferTestCase |
| 154 | + |
| 155 | + if len(test.in) == 0 { |
| 156 | + // If the input string is length 0, only a buffer of size 0 is a meaningful test |
| 157 | + bufs = []bufferTestCase{{nil, false}} |
| 158 | + } else { |
| 159 | + // For non-empty input strings, we can try several buffer sizes (0, len-1, len) |
| 160 | + bufs = []bufferTestCase{ |
| 161 | + {nil, true}, |
| 162 | + {make([]byte, 0, len(test.in)-1), true}, |
| 163 | + {make([]byte, 0, len(test.in)), false}, |
| 164 | + } |
| 165 | + } |
| 166 | + |
| 167 | + for _, buftest := range bufs { |
| 168 | + in := []byte(test.in) |
| 169 | + buf := buftest.buf |
| 170 | + |
| 171 | + out, err := Unescape(in, buf) |
| 172 | + isErr := (err != nil) |
| 173 | + isAlloc := !isSameMemory(out, in) && !isSameMemory(out, buf) |
| 174 | + |
| 175 | + if isErr != test.isErr { |
| 176 | + t.Errorf("Unescape(`%s`, bufsize=%d) returned isErr mismatch: expected %t, obtained %t", test.in, cap(buf), test.isErr, isErr) |
| 177 | + break |
| 178 | + } else if isErr { |
| 179 | + continue |
| 180 | + } else if !bytes.Equal(out, []byte(test.out)) { |
| 181 | + t.Errorf("Unescape(`%s`, bufsize=%d) returned unescaped mismatch: expected `%s` (%v, len %d), obtained `%s` (%v, len %d)", test.in, cap(buf), test.out, []byte(test.out), len(test.out), string(out), out, len(out)) |
| 182 | + break |
| 183 | + } else if isAlloc != (test.canAlloc && buftest.isTooSmall) { |
| 184 | + t.Errorf("Unescape(`%s`, bufsize=%d) returned isAlloc mismatch: expected %t, obtained %t", test.in, cap(buf), buftest.isTooSmall, isAlloc) |
| 185 | + break |
| 186 | + } |
| 187 | + } |
| 188 | + } |
| 189 | +} |
0 commit comments