| ... | ... | @@ -37,7 +37,6 @@ pub const Error = error{ |
| 37 | 37 | EndOfStream, |
| 38 | 38 | HuffmanTreeIncomplete, |
| 39 | 39 | InvalidBitStream, |
| 40 | | LiteralsBufferUndersize, |
| 41 | 40 | MalformedAccuracyLog, |
| 42 | 41 | MalformedBlock, |
| 43 | 42 | MalformedCompressedBlock, |
| ... | ... | @@ -1224,7 +1223,6 @@ pub const LiteralsSection = struct { |
| 1224 | 1223 | /// Not enough bytes to complete the section. |
| 1225 | 1224 | EndOfStream, |
| 1226 | 1225 | ReadFailed, |
| 1227 | | LiteralsBufferUndersize, |
| 1228 | 1226 | MissingStartBit, |
| 1229 | 1227 | }; |
| 1230 | 1228 | |
| ... | ... | @@ -1232,7 +1230,7 @@ pub const LiteralsSection = struct { |
| 1232 | 1230 | const header = try Header.decode(in, remaining); |
| 1233 | 1231 | switch (header.block_type) { |
| 1234 | 1232 | .raw => { |
| 1235 | | if (buffer.len < header.regenerated_size) return error.LiteralsBufferUndersize; |
| 1233 | if (buffer.len < header.regenerated_size) return error.MalformedLiteralsSection; |
| 1236 | 1234 | remaining.* = remaining.subtract(header.regenerated_size) orelse return error.EndOfStream; |
| 1237 | 1235 | try in.readSlice(buffer[0..header.regenerated_size]); |
| 1238 | 1236 | return .{ |
| ... | ... | @@ -1259,7 +1257,7 @@ pub const LiteralsSection = struct { |
| 1259 | 1257 | const huffman_tree_size = @intFromEnum(before_remaining) - @intFromEnum(remaining.*); |
| 1260 | 1258 | const total_streams_size = std.math.sub(usize, header.compressed_size.?, huffman_tree_size) catch |
| 1261 | 1259 | return error.MalformedLiteralsSection; |
| 1262 | | if (total_streams_size > buffer.len) return error.LiteralsBufferUndersize; |
| 1260 | if (total_streams_size > buffer.len) return error.MalformedLiteralsSection; |
| 1263 | 1261 | remaining.* = remaining.subtract(total_streams_size) orelse return error.EndOfStream; |
| 1264 | 1262 | try in.readSlice(buffer[0..total_streams_size]); |
| 1265 | 1263 | const stream_data = buffer[0..total_streams_size]; |