Log

Author Commit Date CI Message
eustas 37a320dd 2016-02-04T15:35:44 Fix possible pointer underflow
eustas d4f0cb98 2016-01-28T18:12:31 Merge pull request #308 from google/eustas-safe-memmove Make memmove16 safe.
eustas 28867aa4 2016-01-28T16:34:41 Remove unused definitions
eustas ee9464e3 2016-01-28T16:32:38 Remove NO_ASAN annotation
eustas 02c606d4 2016-01-28T16:28:36 Make memmove16 safe.
szabadka 058d7498 2016-01-27T10:19:19 Merge pull request #306 from szabadka/master Use a hash-to-binary-tree data structure for quality 11 as suggested by Issue #180
Zoltan Szabadka dbb53e64 2016-01-27T09:50:39 Use a hash-to-binary-tree data structure for quality 11 as suggested by Issue #180.
eustas 616e11a0 2016-01-26T13:21:34 Merge pull request #304 from google/eustas-brotlimodule-warnings Fix compilation warnings in brotlimodule.cc
szabadka e998e225 2016-01-26T12:16:20 Merge pull request #305 from szabadka/master Reorder members of the Command struct plus fix some warnings.
Zoltan Szabadka 14d6ae74 2016-01-26T11:25:53 Reorder members of the Command struct plus fix some warnings. This may save 8 bytes of padding per Command (32 -> 24 bytes).
eustas c5c80a9f 2016-01-25T15:13:17 Addressed comment
eustas 8e8b8de0 2016-01-25T12:33:38 Update brotlimodule.cc
eustas 1b938dc7 2016-01-25T12:16:36 Update brotlimodule.cc
eustas c49918e1 2016-01-25T12:07:39 Update brotlimodule.cc
eustas ca0ae4cb 2016-01-25T11:40:20 Update brotlimodule.cc
eustas a4f40c1b 2016-01-25T11:39:05 Fix brotlimodule compilation warnings
eustas 6c98f033 2016-01-25T11:24:34 Merge pull request #303 from eustas/master Update decoder
eustas a46bdf57 2016-01-25T10:44:22 Merge pull request #301 from google/eustas-remove-deprecated-api-call Remove deprecated API call
eustas fec00d24 2016-01-23T00:31:47 Make input const
eustas a22993b3 2016-01-22T14:09:25 Fix pointer dereferencing.
eustas 1f910642 2016-01-22T14:01:46 Remove deprecated API call
Eugene Kliuchnikov 92e30239 2016-01-22T10:19:41 Update decoder. * Reduce memory usage * Update API documentation * Remove deprecated API * Move non-API declatarions from decode.h * Remove streams * Add more debug logging * Fix shift in BrotliBitReaderUnload * Allocate ringbuffer at later stages * Sort / fix includes * Fix whitespaces * Eliminate dead code * Drive-by code simplifications
eustas c788a559 2016-01-19T14:11:13 Merge pull request #1 from google/master Rebase
szabadka bed93862 2016-01-12T14:59:25 Merge pull request #297 from szabadka/master Relax the prerequisites of WriteBrotliData().
Zoltan Szabadka 82c9e197 2016-01-12T14:45:35 Relax the prerequisites of WriteBrotliData(). Instead of returning false, if it is called with no new input for a non-last block, just check if it has any already processed data to flush, and if not, return true with empty output.
szabadka 4d5ce42e 2016-01-11T13:57:28 Merge pull request #296 from szabadka/master Update the internet draft to the -08 version.
Zoltan Szabadka 6a92849c 2016-01-11T13:36:41 Change the title and the expiration date of the -08 draft.
Zoltan Szabadka 8ef0a202 2016-01-11T13:35:30 Create -08 version of the draft.
szabadka f39bc2cf 2016-01-11T13:31:16 Merge pull request #290 from crowell/patch-1 s/Error of success/Error or success/
szabadka 1f01d61b 2016-01-11T13:07:22 Merge pull request #295 from szabadka/master Add two more fast modes to the brotli compressor.
Zoltan Szabadka b4c223cf 2016-01-11T12:17:44 Add missing headers.
Zoltan Szabadka 47f1eaba 2016-01-11T12:05:18 Add the new source files to setup.py
Zoltan Szabadka 417107b3 2016-01-11T11:21:42 Add two more fast modes to the brotli compressor. The new modes process the input data in independent blocks, using backward references only from within an input block. The new modes can be used by specifying quality 0 or quality 1, the old quality 1 and quality 2 modes are renamed quality 2 and quality 3, respectively, and the old quality 3 mode is removed.
szabadka 27688e60 2016-01-11T10:28:30 Merge pull request #294 from szabadka/master Faster entropy coding phase for quality 1.
Zoltan Szabadka 1bf1b0a5 2016-01-08T10:10:22 Faster entropy coding phase for quality 1. In quality 1, use static Huffman codes for distance and command histograms with <= 128 symbols and dynamic Huffman codes with static code length codes for the other histograms.
szabadka 94a1dcaa 2016-01-08T09:57:20 Merge pull request #293 from szabadka/master Partial Hasher initialization for small input data.
Zoltan Szabadka 4dd9114c 2016-01-07T17:10:34 Partial Hasher initialization for small input data. This increases compression speed of very small files (< 1KB) for quality <= 3.
szabadka 71c26bc3 2016-01-07T16:58:38 Merge pull request #292 from szabadka/master Fix more conversion warnings.
Zoltan Szabadka 8844b7f0 2016-01-07T16:27:49 Fix more conversion warnings.
szabadka 580db012 2016-01-07T09:50:54 Merge pull request #291 from rsheeter/master Remove -std=c++11 from shared.mk
Rod Sheeter 0e62a76e 2016-01-06T08:19:02 Remove -std=c++11 from shared.mk
Jeffrey Crowell 3fbc3b81 2016-01-05T16:31:36 s/Error of success/Error or success/
eustas 98ed7a23 2015-12-22T17:28:21 Merge pull request #283 from thinred/master Fix typo: LFLAGS => LDFLAGS
Tomasz Buchert 2ce1a1fc 2015-12-18T23:26:41 Fix typo: LFLAGS => LDFLAGS
eustas 90eb91b0 2015-12-11T13:15:21 Merge pull request #280 from eustas/master Fix headers
Eugene Klyuchnikov 24ffa784 2015-12-11T11:11:51 Fix headers
szabadka 9dc38abc 2015-12-10T11:35:44 Merge pull request #279 from szabadka/master Add Robert Obryk to the Acknowledgements section of the spec
Zoltan Szabadka 3178f4bc 2015-12-10T11:03:22 Add Robert Obryk to the Acknowledgements section of the spec for his work on the first version of the spec in designing the format of the compressed prefix codes.
eustas bc5da25a 2015-12-09T16:25:06 Merge pull request #272 from eustas/master Upgrade license to MIT.
szabadka 66db0815 2015-12-09T13:43:14 Merge pull request #278 from anthrotype/python-disable-c++0x don't pass `-std=c++0x` option to gcc in setup.py
Cosimo Lupo 912b0ac2 2015-12-08T12:49:04 brotlimodule.cc: fix error with clang ('expected a class or namespace')
eustas d9976e2d 2015-12-08T13:33:13 Merge pull request #277 from eustas/fix Fix WriteMetadata (unaligned and out-of-bounds write).
Cosimo Lupo 8b2ca8ef 2015-12-08T12:33:06 setup.py: don't enable c++0x for gcc
Eugene Klyuchnikov 901cd82f 2015-12-04T16:09:40 Fix WriteMetadata (unaligned and out-of-bounds write).
Eugene Klyuchnikov 771eb107 2015-11-27T11:27:11 Update license statement in source files.
Eugene Klyuchnikov 55e9768b 2015-11-27T10:40:56 Upgrade license to MIT.
eustas c60f6d0d 2015-11-26T10:04:25 Merge pull request #271 from eustas/master Update bro.cc to use new streaming API.
Eugene Klyuchnikov 1c5ae022 2015-11-25T23:07:48 Update bro.cc to use new streaming API.
eustas 5b0df4ae 2015-11-23T13:59:17 Merge pull request #270 from eustas/master Fix sign-comparison warnings
Eugene Klyuchnikov bb26d191 2015-11-23T11:05:12 Fix sign-comparison warnings + add more debug runtime checks + minor cleanup
eustas b64b2cf4 2015-11-23T10:44:55 Merge pull request #269 from eustas/master Decoder: implement custom allocator feature
Eugene Klyuchnikov b6938122 2015-11-23T10:21:09 Decoder: implement custom allocator feature Drive-by: conform stricter compilation flags; cleanup shared.mk
eustas befc549b 2015-11-17T17:01:44 Merge pull request #268 from eustas/master Add more explicit type conversions.
Eugene Klyuchnikov 152e33c3 2015-11-17T13:45:41 Add more explicit type conversions. Remove dead code. Fix includes.
szabadka fb52958e 2015-11-12T20:36:30 Merge pull request #266 from szabadka/master Fix assertion in 32-bit build.
Zoltan Szabadka 8d061836 2015-11-12T20:13:58 Fix assertion in 32-bit build.
szabadka a08855c7 2015-11-11T14:40:27 Merge pull request #260 from dsnet/master Fix 72-char line length violator
Joe Tsai 3fe5c247 2015-11-10T15:09:40 Fix 72-char line length violator
Joe Tsai af2a5519 2015-11-10T14:54:26 Merge pull request #1 from google/master Pull from tip
szabadka 77db683f 2015-11-10T16:06:47 Merge pull request #255 from ende76/master FIX: Typo in reference to NBLTYPESL, Minor: added missing word _lengths_ to insert-and-copy lengths
Thomas Pickert 0e3329d5 2015-11-10T09:52:10 Fixed accidental plural plural wording
Ende e33ff0a6 2015-11-10T05:32:50 Rearranged wording to stay under 72 character limit
Ende 1b8b8010 2015-11-07T17:55:22 Fixed two references to wrong NBLTYPESx
eustas c90ec29f 2015-11-07T13:18:15 Merge pull request #256 from eustas/master Fix implicit type conversion
eustas 65b4baf0 2015-11-07T11:52:13 Fix implicit type conversion
Ende 9bb41938 2015-11-06T14:14:18 Minor: added missing word _lengths_ to insert-and-copy lengths
eustas a6881eb3 2015-11-06T12:18:04 Merge pull request #253 from eustas/master Brotli decoder: implement new streaming API
Eugene Klyuchnikov c0ba6d6f 2015-11-06T11:46:04 Brotli decoder: implement new streaming API
szabadka 6a45dfa0 2015-11-04T15:18:57 Merge pull request #252 from szabadka/master Update the Acknowledgments section of the spec.
Zoltan Szabadka 652ca06b 2015-11-04T14:54:59 Update the Acknowledgments section of the spec.
szabadka df5bee18 2015-11-03T17:23:45 Merge pull request #251 from szabadka/master Update .txt version of the spec.
Zoltan Szabadka af61a513 2015-11-03T17:22:53 Update .txt version of the spec.
szabadka 815731d5 2015-11-02T20:08:03 Merge pull request #250 from dsnet/draft Suggested RFC changes
Joe Tsai ce2bb01f 2015-11-02T09:39:11 Revert accidental deletion in Section 10.
Joe Tsai 2421ed92 2015-11-02T03:34:42 Clarify pseudo-code in Section 10.
Joe Tsai 1a50dc9b 2015-11-02T03:30:21 fix formatting of Section 12.
Joe Tsai 902e8159 2015-11-02T03:27:27 Fix formatting, section references, and grammar * Add .nf and .fi tags everywhere they were missing * Consistently use Section X.X. instead of the following: Paragraph X.X. section X * Fix minor grammar issues
szabadka 1bf4f9b8 2015-11-02T11:15:44 Merge pull request #249 from dsnet/draft Request to change the RFC
Joe Tsai 3ab98536 2015-11-01T23:00:07 Fix grammar in Section 2. s/copy length determine /copy length determines /g
Joe Tsai e57dbc0f 2015-11-01T18:23:20 Minor capitalization fix
Joe Tsai 5c869c9d 2015-11-01T17:01:38 Clarify simple and complex prefix codes * At the beginning of the simple prefix code section, telling us that "a value of 1 indicates the number of leading zeros" is not very helpful. Instead, it should indicate that it means a complex prefix code and point the reader to the relevant section (which repeats this information in more detail) * Clearly indicate that reusing a value is an error! This seems to be the behavior of the of the reference implementation. * Clarify what the termination conditions are while reading the prefix codes. Also, indicate that it is an error if the prefix tree is over-subscribed or under-subscribed. * Clearly state what is the maximum number of individual symbols that may be read. This ensures that it is forbidden to an stream that continually says that the symbols have zero length.
Joe Tsai c5b6b5c7 2015-11-01T16:50:13 Minor formatting changes * In the description about "three categories", explicitly number them instead of using a giant paragraph that is harder to follow. * Switch lists of items to consistently use American style commas. The American style lists is better for clarity purposes. Consider the following: -Each category of value (insert and copy lengths, literals and distances) +Each category of value (insert and copy lengths, literals, and distances) * Make sure not to break a hyphenated phrase with a newline. When the nroff file is processed, "insert-\nand-copy" becomes "insert- and-copy", making it inconsistent with other uses of the hyphenated phrase. * Consistently use the same hyphenated phrase if referred to as a single unit. "insert and copy" -> "insert-and-copy" "least significant" -> "least-significant" "most significant" -> "most-significant" "fixed length" -> "fixed-length" "block switch" -> "block-switch". * Consistently use "indexes" instead of "indices"
Joe Tsai 166edb02 2015-11-01T16:28:11 Minor formatting of Section 9.2. and Section 9.3. Many of the fields are copy-pastes of each other, but differ slightly in placement of words, capitalization, or other random oddities. This commit makes it so that if you simply do a search replace on these following passages, you get the same thing: s/NBLTYPESX/(NBLTYPESI|NBLTYPESL|NBLTYPESD)/g s/CATEGORY/(insert-and-copy|literal|distance)/g >>> 1-11 bits: NBLTYPESX, # of CATEGORY block types, encoded with the same variable length code as above Prefix code over the block type code alphabet for CATEGORY block types, appears only if NBLTYPESX >= 2 Prefix code over the block count code alphabet for CATEGORY block counts, appears only if NBLTYPESX >= 2 Block count code + Extra bits for first CATEGORY block count, appears only if NBLTYPESX >= 2 <<< >>> Block type code for next CATEGORY block type, appears only if NBLTYPESX >= 2 and the previous CATEGORY block count is zero Block count code + extra bits for next CATEGORY block count, appears only if NBLTYPESX >= 2 and the previous CATEGORY block count is zero <<<
szabadka 7e0ed888 2015-10-30T07:37:11 Merge pull request #248 from dsnet/draft Request to change the RFC
Joe Tsai 542a8b77 2015-10-29T09:50:19 Clarify Section 7.3 * Acknowledge the fact that the context map is conceptually really a two-dimensional matrix with 2 different keys, but in reality stored as a one-dimensional array. * Mention that InverseMoveToFrontTransform will not cause the context map to have invalid indexes. This gives someone implementing a decoder sanity that they do not have to go through the context map again and check that all values are less than NTREES.
Joe Tsai ff3897df 2015-10-29T09:44:23 Clarify Section 8. * The phrase "difference between these distances" can either refer to the conceptual difference (i.e. they hae different semantic meaning) or to the mathematical difference (i.e. use substraction for the two). Instead, just remove the sentence since the equations below make it clear what we're supposed to do here.
Joe Tsai 2ffe45bd 2015-10-29T09:42:00 Clarify Section 4. * If NDIRECT is zero, then the paragraph reads "from 16 to 15", which doesn't make much sense. Thus, add a conditional to avoid this minor oddity.
Joe Tsai 185cb9ea 2015-10-29T09:40:41 Define the maximum number of bytes transforms may add to a word * This value is useful in implementing the decoder since we can know ahead-of-time what size buffer is needed to contain the output of a transformed word.
Joe Tsai 6d2575ea 2015-10-29T09:39:06 Use consistent bit convention in Section 5. * Rather than say "lower 3 bits" in one sentence and "bits 3-5" in the sentence right after, just consistently use the same convention and say "0-2" and "3-5".
szabadka 3985e62b 2015-10-29T16:59:32 Merge pull request #247 from dsnet/draft Clarify Section 7.1.