2 #include "chunk-format.h"
6 * When writing a chunk-based file format, collect the chunks in
7 * an array of chunk_info structs. The size stores the _expected_
8 * amount of data that will be written by write_fn.
13 chunk_write_fn write_fn;
21 struct chunk_info *chunks;
26 struct chunkfile *init_chunkfile(struct hashfile *f)
28 struct chunkfile *cf = xcalloc(1, sizeof(*cf));
33 void free_chunkfile(struct chunkfile *cf)
41 int get_num_chunks(struct chunkfile *cf)
46 void add_chunk(struct chunkfile *cf,
51 ALLOC_GROW(cf->chunks, cf->chunks_nr + 1, cf->chunks_alloc);
53 cf->chunks[cf->chunks_nr].id = id;
54 cf->chunks[cf->chunks_nr].write_fn = fn;
55 cf->chunks[cf->chunks_nr].size = size;
59 int write_chunkfile(struct chunkfile *cf, void *data)
62 uint64_t cur_offset = hashfile_total(cf->f);
64 trace2_region_enter("chunkfile", "write", the_repository);
66 /* Add the table of contents to the current offset */
67 cur_offset += (cf->chunks_nr + 1) * CHUNK_TOC_ENTRY_SIZE;
69 for (i = 0; i < cf->chunks_nr; i++) {
70 hashwrite_be32(cf->f, cf->chunks[i].id);
71 hashwrite_be64(cf->f, cur_offset);
73 cur_offset += cf->chunks[i].size;
76 /* Trailing entry marks the end of the chunks */
77 hashwrite_be32(cf->f, 0);
78 hashwrite_be64(cf->f, cur_offset);
80 for (i = 0; i < cf->chunks_nr; i++) {
81 off_t start_offset = hashfile_total(cf->f);
82 result = cf->chunks[i].write_fn(cf->f, data);
87 if (hashfile_total(cf->f) - start_offset != cf->chunks[i].size)
88 BUG("expected to write %"PRId64" bytes to chunk %"PRIx32", but wrote %"PRId64" instead",
89 cf->chunks[i].size, cf->chunks[i].id,
90 hashfile_total(cf->f) - start_offset);
94 trace2_region_leave("chunkfile", "write", the_repository);
98 int read_table_of_contents(struct chunkfile *cf,
99 const unsigned char *mfile,
106 const unsigned char *table_of_contents = mfile + toc_offset;
108 ALLOC_GROW(cf->chunks, toc_length, cf->chunks_alloc);
110 while (toc_length--) {
111 uint64_t chunk_offset, next_chunk_offset;
113 chunk_id = get_be32(table_of_contents);
114 chunk_offset = get_be64(table_of_contents + 4);
117 error(_("terminating chunk id appears earlier than expected"));
121 table_of_contents += CHUNK_TOC_ENTRY_SIZE;
122 next_chunk_offset = get_be64(table_of_contents + 4);
124 if (next_chunk_offset < chunk_offset ||
125 next_chunk_offset > mfile_size - the_hash_algo->rawsz) {
126 error(_("improper chunk offset(s) %"PRIx64" and %"PRIx64""),
127 chunk_offset, next_chunk_offset);
131 for (i = 0; i < cf->chunks_nr; i++) {
132 if (cf->chunks[i].id == chunk_id) {
133 error(_("duplicate chunk ID %"PRIx32" found"),
139 cf->chunks[cf->chunks_nr].id = chunk_id;
140 cf->chunks[cf->chunks_nr].start = mfile + chunk_offset;
141 cf->chunks[cf->chunks_nr].size = next_chunk_offset - chunk_offset;
145 chunk_id = get_be32(table_of_contents);
147 error(_("final chunk has non-zero id %"PRIx32""), chunk_id);
154 static int pair_chunk_fn(const unsigned char *chunk_start,
158 const unsigned char **p = data;
163 int pair_chunk(struct chunkfile *cf,
165 const unsigned char **p)
167 return read_chunk(cf, chunk_id, pair_chunk_fn, p);
170 int read_chunk(struct chunkfile *cf,
177 for (i = 0; i < cf->chunks_nr; i++) {
178 if (cf->chunks[i].id == chunk_id)
179 return fn(cf->chunks[i].start, cf->chunks[i].size, data);
182 return CHUNK_NOT_FOUND;