* Put one byte into the dictionary. It is assumed that there is space for it. */

Copy uncompressed data as is from input to dictionary and output buffers. */

Applies a supplemental hash function to a given hashCode, which defends against poor quality hash functions. This is critical because ConcurrentRefer

* Get the index of the appropriate probability array for decoding * the distance slot. */

Decode a literal (one 8-bit byte) */

Get pointer to literal coder probability array. */

Decode a match. The distance will be stored in s->lzma.rep0. */

* Decode a repeated match. The distance is one of the four most recently * seen matches. The distance will be stored in s->lzma.rep0. */

Test if the previous symbol was a literal. */

Indicate that the latest symbol was a literal. */

Indicate that the latest state was a long repeated match. */

Indicate that the latest symbol was a match. */

Indicate that the latest symbol was a short match. */

Copies all of the mappings from the specified map to this one. These mappings replace any mappings that this map had for any of the keys currently in

Decode direct bits (fixed fifty-fifty probability) */

Return true if there may not be enough input for the next decoding loop. */

Remove; match on key only if value null, else match both.

Sets table to new HashEntry array. Call only while holding lock or in constructor.

Returns the address of the current atomic variable. This is only used by futex() which is declared to take a volatile address (see base/mutex-inl.h).

Atomically replace the value with desired_value if it matches the expected_value. Participates in total ordering of atomic operations. Returns the exi