delta/liberasurecode.git/include, branch master

Release 1.6.3

2022-04-08T23:59:40+00:00

Change-Id: I7214aeecc3c568d7b0be5db441d62ca7901ec855

Add build-time option to suffix library names sent to dlopen

2021-10-26T22:20:10+00:00

This is useful when repacking libraries for python wheels, for example.

Change-Id: Ie7b36584de5054c14a9b77d87a5c5fa5cc7a3719

Release 1.6.2

2020-10-08T21:46:14+00:00

Change-Id: I733c4bcf28d845aa0413ef4af06cdab6bc25cc7b

1.6.1 release

2019-05-23T23:03:58+00:00

Change-Id: Iaa6cc5bb06e715aafb3ecab86ae7cde6ef30413d

Release 1.6.0

2018-09-21T14:28:15+00:00

Change-Id: I97b85f1b37952aaede168e274d2f4a74d3b9aaa8

Allow reading of little-endian frags on big-endian

2018-09-12T03:58:34+00:00

... and vice-versa. We'll fix up frag header values for our output
parameter from liberasurecode_get_fragment_metadata but otherwise
avoid manipulating the in-memory fragment much.

Change-Id: Idd6833bdea60e27c9a0148ee28b4a2c1070be148

Un-inline get/set_metatdata_chksum

2017-07-06T18:02:02+00:00

Each was only really used in one place, they had some strange return types,
and recent versions of clang on OS X would refuse to compile with

erasurecode_helpers.c:531:26: error: taking address of packed member 'metadata_chksum' of
      class or structure 'fragment_header_s' may result in an unaligned pointer value
      [-Werror,-Waddress-of-packed-member]
    return (uint32_t *) &header->metadata_chksum;
                         ^~~~~~~~~~~~~~~~~~~~~~~

We don't really *care* about the pointer; we just want the value!

Change-Id: I8a5e42312948a75f5dd8b23b6f5ccfa7bd22eb1d

Use zlib for CRC-32

2017-07-06T17:40:38+00:00

Previously, we had our own CRC that was almost but not quite like
zlib's implementation. However,

* it hasn't been subjected to the same rigor with regard to error-detection
  properties and
* it may not even get used, depending upon whether zlib happens to get
  loaded before or after liberasurecode.

Now, we'll use zlib's CRC-32 when writing new frags, while still
tolerating frags that were created with the old implementation.

Change-Id: Ib5ea2a830c7c23d66bf2ca404a3eb84ad00c5bc5
Closes-Bug: 1666320

Merge "Release 1.5.0"

2017-06-29T17:36:37+00:00

Stop using ceill() to compute padded data size

2017-06-06T18:53:45+00:00

The well-known idiom to compute a required number of data blocks
of size B to contain data of length d is:

     (d + (B-1))/B

The code we use, with ceill(), computes the same value, but does
it in an unorthodox way. This makes a reviewer to doubt himself
and even run tests to make sure we're really computing the
obvious thing.

Apropos the reviewer confusion, the code in Phazr.IO looks weird.
It uses (word_size - hamming_distance) to compute the necessary
number of blocks... but then returns the amount of memory needed
to store blocks of a different size (word_size). We left all of it
alone and return exactly the same values that the old computation
returned.

All these computations were the only thing in the code that used
-lm, so drop that too.

Coincidentially, this patch solves the crash of distro-built
packages of liberasurecode (see Red Hat bug #1454543). But it's
a side effect. Expect a proper patch soon.

Change-Id: Ib297f6df304abf5ca8c27d3392b1107a525e0be0