compressBound() functionality #107

New Issue

claunia · 2026-01-29T20:34:58Z

claunia commented

2026-01-29 20:34:58 +00:00

Originally created by @richgel999 on GitHub (May 19, 2016).

Hi,
I'm using brotli::BrotliCompressBuffer() in my benchmark, but I need a way to compute the max size of the buffer to allocate to hold the encoded data. zlib has a function like this:

compressBound()

For now, I tried just allocating 10% more bytes than the source file's size, but I encountered 65 exceptions (out of 30,000+ files) so I guess I'll need to bump this up more.

Originally created by @richgel999 on GitHub (May 19, 2016). Hi, I'm using brotli::BrotliCompressBuffer() in my benchmark, but I need a way to compute the max size of the buffer to allocate to hold the encoded data. zlib has a function like this: [compressBound()](https://refspecs.linuxbase.org/LSB_2.1.0/LSB-generic/LSB-generic/zlib-compressbound-1.html) For now, I tried just allocating 10% more bytes than the source file's size, but I encountered 65 exceptions (out of 30,000+ files) so I guess I'll need to bump this up more.

claunia closed this issue

2026-01-29 20:35:00 +00:00

claunia commented

2026-01-29 20:35:03 +00:00

@nemequ commented on GitHub (May 25, 2016):

Dup of #274

Until that is fixed, I think the function in Squash is safe: 26aa037b61/plugins/brotli/squash-brotli.cpp (L265)

@nemequ commented on GitHub (May 25, 2016): Dup of #274 Until that is fixed, I think the function in Squash is safe: https://github.com/quixdb/squash/blob/26aa037b618c1a37d984099b8dd5a3e04d3058c3/plugins/brotli/squash-brotli.cpp#L265

claunia commented

2026-01-29 20:35:06 +00:00

@nemequ commented on GitHub (Jun 16, 2016):

0.5 provides BrotliEncoderMaxCompressedSize, I think this can be closed.

@nemequ commented on GitHub (Jun 16, 2016): 0.5 provides `BrotliEncoderMaxCompressedSize`, I think this can be closed.

claunia referenced this issue

2026-01-29 20:50:29 +00:00

[PR #107] Fix broken quality 0, make it same as quality 1. #714

Sign in to join this conversation.