Lines Matching refs:bsdiff
20 * naive bsdiff of these files is not useful because small changes in the data lead to large
21 * changes in the compressed bitstream; bsdiff patches of gzipped data are typically as large as
25 * "normal" and "gzip". Normal chunks are simply patched using a plain bsdiff. Gzip chunks are
26 * first expanded, then a bsdiff is applied to the uncompressed data, then the patched data is
37 * encoding parameters needed for the gzipped chunks, followed by N bsdiff patches, one per chunk.
62 * bsdiff patch offset (8) [from start of patch file]
66 * bsdiff patch offset (8) [from start of patch file]
80 * bsdiff patch offset (8) [from start of patch file]
95 * size of the uncompressed data after applying the bsdiff patch. The next five parameters
100 * After the header there are 'chunk count' bsdiff patches; the offset of each from the beginning
124 * this chunk and later do bsdiff between all the skipped trunks and the whole split source image.
166 #include <bsdiff/bsdiff.h>
334 bsdiff::SuffixArrayIndexInterface** bsdiff_cache) {
348 int r = bsdiff::bsdiff(src.DataForPatch(), src.DataLengthForPatch(), tgt.DataForPatch(),
351 LOG(ERROR) << "bsdiff() failed: " << r;
547 // the offset of each bsdiff patch within the file.
567 // Append each chunk's bsdiff patch, in order.
1051 // bsdiff since src_content.data() == nullptr.
1104 bsdiff::SuffixArrayIndexInterface* bsdiff_cache = nullptr;
1118 bsdiff::SuffixArrayIndexInterface** bsdiff_cache_ptr =
1568 // Compute bsdiff patches for each chunk's data (the uncompressed data, in the case of
