reftable: handle trivial allocation failures
Handle trivial allocation failures in the reftable library and its unit tests. Signed-off-by: Patrick Steinhardt <ps@pks.im> Signed-off-by: Junio C Hamano <gitster@pobox.com>maint
parent
51afc709dc
commit
12b9078066
|
@ -203,6 +203,9 @@ int reftable_merged_table_new(struct reftable_merged_table **dest,
|
|||
}
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(m, 1);
|
||||
if (!m)
|
||||
return REFTABLE_OUT_OF_MEMORY_ERROR;
|
||||
|
||||
m->readers = readers;
|
||||
m->readers_len = n;
|
||||
m->min = first_min;
|
||||
|
|
|
@ -598,6 +598,10 @@ int reftable_reader_new(struct reftable_reader **out,
|
|||
int err;
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(r, 1);
|
||||
if (!r) {
|
||||
err = REFTABLE_OUT_OF_MEMORY_ERROR;
|
||||
goto done;
|
||||
}
|
||||
|
||||
/*
|
||||
* We need one extra byte to read the type of first block. We also
|
||||
|
@ -627,7 +631,11 @@ int reftable_reader_new(struct reftable_reader **out,
|
|||
|
||||
r->size = file_size - footer_size(r->version);
|
||||
r->source = *source;
|
||||
r->name = xstrdup(name);
|
||||
r->name = reftable_strdup(name);
|
||||
if (!r->name) {
|
||||
err = REFTABLE_OUT_OF_MEMORY_ERROR;
|
||||
goto done;
|
||||
}
|
||||
r->hash_id = 0;
|
||||
r->refcount = 1;
|
||||
|
||||
|
|
|
@ -116,6 +116,11 @@ static int fd_read_lines(int fd, char ***namesp)
|
|||
}
|
||||
|
||||
REFTABLE_ALLOC_ARRAY(buf, size + 1);
|
||||
if (!buf) {
|
||||
err = REFTABLE_OUT_OF_MEMORY_ERROR;
|
||||
goto done;
|
||||
}
|
||||
|
||||
if (read_in_full(fd, buf, size) != size) {
|
||||
err = REFTABLE_IO_ERROR;
|
||||
goto done;
|
||||
|
@ -140,6 +145,8 @@ int read_lines(const char *filename, char ***namesp)
|
|||
if (fd < 0) {
|
||||
if (errno == ENOENT) {
|
||||
REFTABLE_CALLOC_ARRAY(*namesp, 1);
|
||||
if (!*namesp)
|
||||
return REFTABLE_OUT_OF_MEMORY_ERROR;
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
@ -420,6 +427,10 @@ static int reftable_stack_reload_maybe_reuse(struct reftable_stack *st,
|
|||
}
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(names, 1);
|
||||
if (!names) {
|
||||
err = REFTABLE_OUT_OF_MEMORY_ERROR;
|
||||
goto out;
|
||||
}
|
||||
} else {
|
||||
err = fd_read_lines(fd, &names);
|
||||
if (err < 0)
|
||||
|
@ -779,7 +790,11 @@ int reftable_stack_new_addition(struct reftable_addition **dest,
|
|||
{
|
||||
int err = 0;
|
||||
struct reftable_addition empty = REFTABLE_ADDITION_INIT;
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(*dest, 1);
|
||||
if (!*dest)
|
||||
return REFTABLE_OUT_OF_MEMORY_ERROR;
|
||||
|
||||
**dest = empty;
|
||||
err = reftable_stack_init_addition(*dest, st);
|
||||
if (err) {
|
||||
|
@ -886,7 +901,12 @@ int reftable_addition_add(struct reftable_addition *add,
|
|||
|
||||
REFTABLE_ALLOC_GROW(add->new_tables, add->new_tables_len + 1,
|
||||
add->new_tables_cap);
|
||||
if (!add->new_tables) {
|
||||
err = REFTABLE_OUT_OF_MEMORY_ERROR;
|
||||
goto done;
|
||||
}
|
||||
add->new_tables[add->new_tables_len++] = strbuf_detach(&next_name, NULL);
|
||||
|
||||
done:
|
||||
delete_tempfile(&tab_file);
|
||||
strbuf_release(&temp_tab_file_name);
|
||||
|
|
|
@ -49,8 +49,14 @@ static int padded_write(struct reftable_writer *w, uint8_t *data, size_t len,
|
|||
{
|
||||
int n = 0;
|
||||
if (w->pending_padding > 0) {
|
||||
uint8_t *zeroed = reftable_calloc(w->pending_padding, sizeof(*zeroed));
|
||||
int n = w->write(w->write_arg, zeroed, w->pending_padding);
|
||||
uint8_t *zeroed;
|
||||
int n;
|
||||
|
||||
zeroed = reftable_calloc(w->pending_padding, sizeof(*zeroed));
|
||||
if (!zeroed)
|
||||
return -1;
|
||||
|
||||
n = w->write(w->write_arg, zeroed, w->pending_padding);
|
||||
if (n < 0)
|
||||
return n;
|
||||
|
||||
|
@ -767,6 +773,9 @@ static int writer_flush_nonempty_block(struct reftable_writer *w)
|
|||
* case we will end up with a multi-level index.
|
||||
*/
|
||||
REFTABLE_ALLOC_GROW(w->index, w->index_len + 1, w->index_cap);
|
||||
if (!w->index)
|
||||
return REFTABLE_OUT_OF_MEMORY_ERROR;
|
||||
|
||||
index_record.offset = w->next;
|
||||
strbuf_reset(&index_record.last_key);
|
||||
strbuf_addbuf(&index_record.last_key, &w->block_writer->last_key);
|
||||
|
|
|
@ -32,6 +32,7 @@ static void t_ref_block_read_write(void)
|
|||
struct strbuf want = STRBUF_INIT, buf = STRBUF_INIT;
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(block.data, block_size);
|
||||
check(block.data != NULL);
|
||||
block.len = block_size;
|
||||
block_source_from_strbuf(&block.source ,&buf);
|
||||
ret = block_writer_init(&bw, BLOCK_TYPE_REF, block.data, block_size,
|
||||
|
@ -125,6 +126,7 @@ static void t_log_block_read_write(void)
|
|||
struct strbuf want = STRBUF_INIT, buf = STRBUF_INIT;
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(block.data, block_size);
|
||||
check(block.data != NULL);
|
||||
block.len = block_size;
|
||||
block_source_from_strbuf(&block.source ,&buf);
|
||||
ret = block_writer_init(&bw, BLOCK_TYPE_LOG, block.data, block_size,
|
||||
|
@ -214,6 +216,7 @@ static void t_obj_block_read_write(void)
|
|||
struct strbuf want = STRBUF_INIT, buf = STRBUF_INIT;
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(block.data, block_size);
|
||||
check(block.data != NULL);
|
||||
block.len = block_size;
|
||||
block_source_from_strbuf(&block.source, &buf);
|
||||
ret = block_writer_init(&bw, BLOCK_TYPE_OBJ, block.data, block_size,
|
||||
|
@ -297,6 +300,7 @@ static void t_index_block_read_write(void)
|
|||
struct strbuf want = STRBUF_INIT, buf = STRBUF_INIT;
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(block.data, block_size);
|
||||
check(block.data != NULL);
|
||||
block.len = block_size;
|
||||
block_source_from_strbuf(&block.source, &buf);
|
||||
ret = block_writer_init(&bw, BLOCK_TYPE_INDEX, block.data, block_size,
|
||||
|
|
|
@ -29,7 +29,9 @@ merged_table_from_records(struct reftable_ref_record **refs,
|
|||
int err;
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(*readers, n);
|
||||
check(*readers != NULL);
|
||||
REFTABLE_CALLOC_ARRAY(*source, n);
|
||||
check(*source != NULL);
|
||||
|
||||
for (size_t i = 0; i < n; i++) {
|
||||
t_reftable_write_to_buf(&buf[i], refs[i], sizes[i], NULL, 0, &opts);
|
||||
|
@ -285,7 +287,9 @@ merged_table_from_log_records(struct reftable_log_record **logs,
|
|||
int err;
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(*readers, n);
|
||||
check(*readers != NULL);
|
||||
REFTABLE_CALLOC_ARRAY(*source, n);
|
||||
check(*source != NULL);
|
||||
|
||||
for (size_t i = 0; i < n; i++) {
|
||||
t_reftable_write_to_buf(&buf[i], NULL, 0, logs[i], sizes[i], &opts);
|
||||
|
|
|
@ -52,8 +52,11 @@ static void write_table(char ***names, struct strbuf *buf, int N,
|
|||
int i;
|
||||
|
||||
REFTABLE_CALLOC_ARRAY(*names, N + 1);
|
||||
check(*names != NULL);
|
||||
REFTABLE_CALLOC_ARRAY(refs, N);
|
||||
check(refs != NULL);
|
||||
REFTABLE_CALLOC_ARRAY(logs, N);
|
||||
check(logs != NULL);
|
||||
|
||||
for (i = 0; i < N; i++) {
|
||||
refs[i].refname = (*names)[i] = xstrfmt("refs/heads/branch%02d", i);
|
||||
|
@ -150,23 +153,25 @@ static void t_log_overflow(void)
|
|||
|
||||
static void t_log_write_read(void)
|
||||
{
|
||||
int N = 2;
|
||||
char **names = reftable_calloc(N + 1, sizeof(*names));
|
||||
int err;
|
||||
struct reftable_write_options opts = {
|
||||
.block_size = 256,
|
||||
};
|
||||
struct reftable_ref_record ref = { 0 };
|
||||
int i = 0;
|
||||
struct reftable_log_record log = { 0 };
|
||||
int n;
|
||||
struct reftable_iterator it = { 0 };
|
||||
struct reftable_reader *reader;
|
||||
struct reftable_block_source source = { 0 };
|
||||
struct strbuf buf = STRBUF_INIT;
|
||||
struct reftable_writer *w = t_reftable_strbuf_writer(&buf, &opts);
|
||||
const struct reftable_stats *stats = NULL;
|
||||
int N = 2, err, i, n;
|
||||
char **names;
|
||||
|
||||
names = reftable_calloc(N + 1, sizeof(*names));
|
||||
check(names != NULL);
|
||||
|
||||
reftable_writer_set_limits(w, 0, N);
|
||||
|
||||
for (i = 0; i < N; i++) {
|
||||
char name[256];
|
||||
struct reftable_ref_record ref = { 0 };
|
||||
|
@ -178,6 +183,7 @@ static void t_log_write_read(void)
|
|||
err = reftable_writer_add_ref(w, &ref);
|
||||
check(!err);
|
||||
}
|
||||
|
||||
for (i = 0; i < N; i++) {
|
||||
struct reftable_log_record log = { 0 };
|
||||
|
||||
|
@ -476,8 +482,7 @@ static void t_table_read_write_seek_index(void)
|
|||
|
||||
static void t_table_refs_for(int indexed)
|
||||
{
|
||||
int N = 50;
|
||||
char **want_names = reftable_calloc(N + 1, sizeof(*want_names));
|
||||
char **want_names;
|
||||
int want_names_len = 0;
|
||||
uint8_t want_hash[GIT_SHA1_RAWSZ];
|
||||
|
||||
|
@ -485,15 +490,15 @@ static void t_table_refs_for(int indexed)
|
|||
.block_size = 256,
|
||||
};
|
||||
struct reftable_ref_record ref = { 0 };
|
||||
int i = 0;
|
||||
int n;
|
||||
int err;
|
||||
struct reftable_reader *reader;
|
||||
struct reftable_block_source source = { 0 };
|
||||
struct strbuf buf = STRBUF_INIT;
|
||||
struct reftable_writer *w = t_reftable_strbuf_writer(&buf, &opts);
|
||||
struct reftable_iterator it = { 0 };
|
||||
int j;
|
||||
int N = 50, n, j, err, i;
|
||||
|
||||
want_names = reftable_calloc(N + 1, sizeof(*want_names));
|
||||
check(want_names != NULL);
|
||||
|
||||
t_reftable_set_hash(want_hash, 4, GIT_SHA1_FORMAT_ID);
|
||||
|
||||
|
|
Loading…
Reference in New Issue