87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering#include <unistd.h>

0ac38b707212e9aa40e25d65ffbae648cc9116f5Lennart Poettering#include <sys/mman.h>

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering#include <fcntl.h>

cec736d21ff86c4ac81b4d306ddba2120333818cLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering#include "util.h"

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering#include "macro.h"

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering#include "journal-def.h"

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering#include "journal-file.h"

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering#include "journal-authenticate.h"

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering#include "journal-verify.h"

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering#include "lookup3.h"

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering#include "compress.h"

de190aef08bb267b645205a747762df573b36834Lennart Poettering#include "fsprg.h"

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poetteringstatic int journal_file_object_verify(JournalFile *f, Object *o) {

c2373f848dddcc1827cf715c5ef778dc8d475761Lennart Poettering assert(f);

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering assert(o);

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering /* This does various superficial tests about the length an

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering if ((o->object.flags & OBJECT_COMPRESSED) &&

c2373f848dddcc1827cf715c5ef778dc8d475761Lennart Poettering o->object.type != OBJECT_DATA)

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering return -EBADMSG;

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering switch (o->object.type) {

de190aef08bb267b645205a747762df573b36834Lennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering case OBJECT_DATA: {

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering uint64_t h1, h2;

de190aef08bb267b645205a747762df573b36834Lennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering if (le64toh(o->data.entry_offset) <= 0 ||

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering le64toh(o->data.n_entries) <= 0)

de190aef08bb267b645205a747762df573b36834Lennart Poettering return -EBADMSG;

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering if (le64toh(o->object.size) - offsetof(DataObject, payload) <= 0)

de190aef08bb267b645205a747762df573b36834Lennart Poettering return -EBADMSG;

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

de190aef08bb267b645205a747762df573b36834Lennart Poettering h1 = le64toh(o->data.hash);

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering if (o->object.flags & OBJECT_COMPRESSED) {

de190aef08bb267b645205a747762df573b36834Lennart Poettering void *b = NULL;

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering uint64_t alloc = 0, b_size;

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

de190aef08bb267b645205a747762df573b36834Lennart Poettering if (!uncompress_blob(o->data.payload,

de190aef08bb267b645205a747762df573b36834Lennart Poettering le64toh(o->object.size) - offsetof(Object, data.payload),

de190aef08bb267b645205a747762df573b36834Lennart Poettering &b, &alloc, &b_size))

de190aef08bb267b645205a747762df573b36834Lennart Poettering return -EBADMSG;

de190aef08bb267b645205a747762df573b36834Lennart Poettering

de190aef08bb267b645205a747762df573b36834Lennart Poettering h2 = hash64(b, b_size);

de190aef08bb267b645205a747762df573b36834Lennart Poettering free(b);

de190aef08bb267b645205a747762df573b36834Lennart Poettering } else

de190aef08bb267b645205a747762df573b36834Lennart Poettering h2 = hash64(o->data.payload, le64toh(o->object.size) - offsetof(Object, data.payload));

de190aef08bb267b645205a747762df573b36834Lennart Poettering

de190aef08bb267b645205a747762df573b36834Lennart Poettering if (h1 != h2)

de190aef08bb267b645205a747762df573b36834Lennart Poettering return -EBADMSG;

de190aef08bb267b645205a747762df573b36834Lennart Poettering

de190aef08bb267b645205a747762df573b36834Lennart Poettering break;

de190aef08bb267b645205a747762df573b36834Lennart Poettering }

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering case OBJECT_FIELD:

de190aef08bb267b645205a747762df573b36834Lennart Poettering if (le64toh(o->object.size) - offsetof(FieldObject, payload) <= 0)

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering return -EBADMSG;

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering break;

de190aef08bb267b645205a747762df573b36834Lennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering case OBJECT_ENTRY:

de190aef08bb267b645205a747762df573b36834Lennart Poettering if ((le64toh(o->object.size) - offsetof(EntryObject, items)) % sizeof(EntryItem) != 0)

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering return -EBADMSG;

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

de190aef08bb267b645205a747762df573b36834Lennart Poettering if ((le64toh(o->object.size) - offsetof(EntryObject, items)) / sizeof(EntryItem) <= 0)

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering return -EBADMSG;

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

de190aef08bb267b645205a747762df573b36834Lennart Poettering if (le64toh(o->entry.seqnum) <= 0 ||

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering le64toh(o->entry.realtime) <= 0)

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering return -EBADMSG;

de190aef08bb267b645205a747762df573b36834Lennart Poettering

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering break;

0ac38b707212e9aa40e25d65ffbae648cc9116f5Lennart Poettering

0ac38b707212e9aa40e25d65ffbae648cc9116f5Lennart Poettering case OBJECT_DATA_HASH_TABLE:

0ac38b707212e9aa40e25d65ffbae648cc9116f5Lennart Poettering case OBJECT_FIELD_HASH_TABLE:

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering if ((le64toh(o->object.size) - offsetof(HashTableObject, items)) % sizeof(HashItem) != 0)

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering return -EBADMSG;

0ac38b707212e9aa40e25d65ffbae648cc9116f5Lennart Poettering

0ac38b707212e9aa40e25d65ffbae648cc9116f5Lennart Poettering if ((le64toh(o->object.size) - offsetof(HashTableObject, items)) / sizeof(HashItem) <= 0)

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering return -EBADMSG;

87d2c1ff6a7375f03476767e6f59454bcc5cd04bLennart Poettering

break;

case OBJECT_ENTRY_ARRAY:

if ((le64toh(o->object.size) - offsetof(EntryArrayObject, items)) % sizeof(le64_t) != 0)

return -EBADMSG;

if ((le64toh(o->object.size) - offsetof(EntryArrayObject, items)) / sizeof(le64_t) <= 0)

return -EBADMSG;

break;

case OBJECT_TAG:

if (le64toh(o->object.size) != sizeof(TagObject))

return -EBADMSG;

break;

}

return 0;

}

static void draw_progress(uint64_t p, usec_t *last_usec) {

unsigned n, i, j, k;

usec_t z, x;

if (!isatty(STDOUT_FILENO))

return;

z = now(CLOCK_MONOTONIC);

x = *last_usec;

if (x != 0 && x + 40 * USEC_PER_MSEC > z)

return;

*last_usec = z;

n = (3 * columns()) / 4;

j = (n * (unsigned) p) / 65535ULL;

k = n - j;

fputs("\r\x1B[?25l" ANSI_HIGHLIGHT_GREEN_ON, stdout);

for (i = 0; i < j; i++)

fputs("\xe2\x96\x88", stdout);

fputs(ANSI_HIGHLIGHT_OFF, stdout);

for (i = 0; i < k; i++)

fputs("\xe2\x96\x91", stdout);

printf(" %3lu%%", 100LU * (unsigned long) p / 65535LU);

fputs("\r\x1B[?25h", stdout);

fflush(stdout);

}

static void flush_progress(void) {

unsigned n, i;

if (!isatty(STDOUT_FILENO))

return;

n = (3 * columns()) / 4;

putchar('\r');

for (i = 0; i < n + 5; i++)

putchar(' ');

putchar('\r');

fflush(stdout);

}

static int write_uint64(int fd, uint64_t p) {

ssize_t k;

k = write(fd, &p, sizeof(p));

if (k < 0)

return -errno;

if (k != sizeof(p))

return -EIO;

return 0;

}

static int contains_uint64(MMapCache *m, int fd, uint64_t n, uint64_t p) {

uint64_t a, b;

int r;

assert(m);

assert(fd >= 0);

/* Bisection ... */

a = 0; b = n;

while (a < b) {

uint64_t c, *z;

c = (a + b) / 2;

r = mmap_cache_get(m, fd, PROT_READ|PROT_WRITE, 0, c * sizeof(uint64_t), sizeof(uint64_t), (void **) &z);

if (r < 0)

return r;

if (*z == p)

return 1;

if (p < *z)

b = c;

else

a = c;

}

return 0;

}

static int entry_points_to_data(

JournalFile *f,

int entry_fd,

uint64_t n_entries,

uint64_t entry_p,

uint64_t data_p) {

int r;

uint64_t i, n, a;

Object *o;

bool found = false;

assert(f);

assert(entry_fd >= 0);

if (!contains_uint64(f->mmap, entry_fd, n_entries, entry_p)) {

log_error("Data object references invalid entry at %llu", (unsigned long long) data_p);

return -EBADMSG;

}

r = journal_file_move_to_object(f, OBJECT_ENTRY, entry_p, &o);

if (r < 0)

return r;

n = journal_file_entry_n_items(o);

for (i = 0; i < n; i++)

if (le64toh(o->entry.items[i].object_offset) == data_p) {

found = true;

break;

}

if (!found) {

log_error("Data object not referenced by linked entry at %llu", (unsigned long long) data_p);

return -EBADMSG;

}

/* Check if this entry is also in main entry array. Since the

n = le64toh(f->header->n_entries);

a = le64toh(f->header->entry_array_offset);

i = 0;

while (i < n) {

uint64_t m, j;

r = journal_file_move_to_object(f, OBJECT_ENTRY_ARRAY, a, &o);

if (r < 0)

return r;

m = journal_file_entry_array_n_items(o);

for (j = 0; i < n && j < m; i++, j++)

if (le64toh(o->entry_array.items[j]) == entry_p)

return 0;

a = le64toh(o->entry_array.next_entry_array_offset);;

}

return 0;

}

static int verify_data(

JournalFile *f,

Object *o, uint64_t p,

int entry_fd, uint64_t n_entries,

int entry_array_fd, uint64_t n_entry_arrays) {

uint64_t i, n, a, last, q;

int r;

assert(f);

assert(o);

assert(entry_fd >= 0);

assert(entry_array_fd >= 0);

n = le64toh(o->data.n_entries);

a = le64toh(o->data.entry_array_offset);

/* We already checked this earlier */

assert(n > 0);

last = q = le64toh(o->data.entry_offset);

r = entry_points_to_data(f, entry_fd, n_entries, q, p);

if (r < 0)

return r;

i = 1;

while (i < n) {

uint64_t next, m, j;

if (a == 0) {

log_error("Array chain too short at %llu.", (unsigned long long) p);

return -EBADMSG;

}

if (!contains_uint64(f->mmap, entry_array_fd, n_entry_arrays, a)) {

log_error("Invalid array at %llu.", (unsigned long long) p);

return -EBADMSG;

}

r = journal_file_move_to_object(f, OBJECT_ENTRY_ARRAY, a, &o);

if (r < 0)

return r;

next = le64toh(o->entry_array.next_entry_array_offset);

if (next != 0 && next <= a) {

log_error("Array chain has cycle at %llu.", (unsigned long long) p);

return -EBADMSG;

}

m = journal_file_entry_array_n_items(o);

for (j = 0; i < n && j < m; i++, j++) {

q = le64toh(o->entry_array.items[j]);

if (q <= last) {

log_error("Data object's entry array not sorted at %llu.", (unsigned long long) p);

return -EBADMSG;

}

last = q;

r = entry_points_to_data(f, entry_fd, n_entries, q, p);

if (r < 0)

return r;

/* Pointer might have moved, reposition */

r = journal_file_move_to_object(f, OBJECT_ENTRY_ARRAY, a, &o);

if (r < 0)

return r;

}

a = next;

}

return 0;

}

static int verify_hash_table(

JournalFile *f,

int data_fd, uint64_t n_data,

int entry_fd, uint64_t n_entries,

int entry_array_fd, uint64_t n_entry_arrays,

usec_t *last_usec) {

uint64_t i, n;

int r;

assert(f);

assert(data_fd >= 0);

assert(entry_fd >= 0);

assert(entry_array_fd >= 0);

assert(last_usec);

n = le64toh(f->header->data_hash_table_size) / sizeof(HashItem);

for (i = 0; i < n; i++) {

uint64_t last = 0, p;

draw_progress(0xC000 + (0x3FFF * i / n), last_usec);

p = le64toh(f->data_hash_table[i].head_hash_offset);

while (p != 0) {

Object *o;

uint64_t next;

if (!contains_uint64(f->mmap, data_fd, n_data, p)) {

log_error("Invalid data object at hash entry %llu of %llu.",

(unsigned long long) i, (unsigned long long) n);

return -EBADMSG;

}

r = journal_file_move_to_object(f, OBJECT_DATA, p, &o);

if (r < 0)

return r;

next = le64toh(o->data.next_hash_offset);

if (next != 0 && next <= p) {

log_error("Hash chain has a cycle in hash entry %llu of %llu.",

(unsigned long long) i, (unsigned long long) n);

return -EBADMSG;

}

if (le64toh(o->data.hash) % n != i) {

log_error("Hash value mismatch in hash entry %llu of %llu.",

(unsigned long long) i, (unsigned long long) n);

return -EBADMSG;

}

r = verify_data(f, o, p, entry_fd, n_entries, entry_array_fd, n_entry_arrays);

if (r < 0)

return r;

last = p;

p = next;

}

if (last != le64toh(f->data_hash_table[i].tail_hash_offset)) {

log_error("Tail hash pointer mismatch in hash table.");

return -EBADMSG;

}

}

return 0;

}

static int data_object_in_hash_table(JournalFile *f, uint64_t hash, uint64_t p) {

uint64_t n, h, q;

int r;

assert(f);

n = le64toh(f->header->data_hash_table_size) / sizeof(HashItem);

h = hash % n;

q = le64toh(f->data_hash_table[h].head_hash_offset);

while (q != 0) {

Object *o;

if (p == q)

return 1;

r = journal_file_move_to_object(f, OBJECT_DATA, q, &o);

if (r < 0)

return r;

q = le64toh(o->data.next_hash_offset);

}

return 0;

}

static int verify_entry(

JournalFile *f,

Object *o, uint64_t p,

int data_fd, uint64_t n_data) {

uint64_t i, n;

int r;

assert(f);

assert(o);

assert(data_fd >= 0);

n = journal_file_entry_n_items(o);

for (i = 0; i < n; i++) {

uint64_t q, h;

Object *u;

q = le64toh(o->entry.items[i].object_offset);

h = le64toh(o->entry.items[i].hash);

if (!contains_uint64(f->mmap, data_fd, n_data, q)) {

log_error("Invalid data object at entry %llu.",

(unsigned long long) o);

return -EBADMSG;

}

r = journal_file_move_to_object(f, OBJECT_DATA, q, &u);

if (r < 0)

return r;

if (le64toh(u->data.hash) != h) {

log_error("Hash mismatch for data object at entry %llu.",

(unsigned long long) p);

return -EBADMSG;

}

r = data_object_in_hash_table(f, h, q);

if (r < 0)

return r;

if (r == 0) {

log_error("Data object missing from hash at entry %llu.",

(unsigned long long) p);

return -EBADMSG;

}

}

return 0;

}

static int verify_entry_array(

JournalFile *f,

int data_fd, uint64_t n_data,

int entry_fd, uint64_t n_entries,

int entry_array_fd, uint64_t n_entry_arrays,

usec_t *last_usec) {

uint64_t i = 0, a, n, last = 0;

int r;

assert(f);

assert(data_fd >= 0);

assert(entry_fd >= 0);

assert(entry_array_fd >= 0);

assert(last_usec);

n = le64toh(f->header->n_entries);

a = le64toh(f->header->entry_array_offset);

while (i < n) {

uint64_t next, m, j;

Object *o;

draw_progress(0x8000 + (0x3FFF * i / n), last_usec);

if (a == 0) {

log_error("Array chain too short at %llu of %llu.",

(unsigned long long) i, (unsigned long long) n);

return -EBADMSG;

}

if (!contains_uint64(f->mmap, entry_array_fd, n_entry_arrays, a)) {

log_error("Invalid array at %llu of %llu.",

(unsigned long long) i, (unsigned long long) n);

return -EBADMSG;

}

r = journal_file_move_to_object(f, OBJECT_ENTRY_ARRAY, a, &o);

if (r < 0)

return r;

next = le64toh(o->entry_array.next_entry_array_offset);

if (next != 0 && next <= a) {

log_error("Array chain has cycle at %llu of %llu.",

(unsigned long long) i, (unsigned long long) n);

return -EBADMSG;

}

m = journal_file_entry_array_n_items(o);

for (j = 0; i < n && j < m; i++, j++) {

uint64_t p;

p = le64toh(o->entry_array.items[j]);

if (p <= last) {

log_error("Entry array not sorted at %llu of %llu.",

(unsigned long long) i, (unsigned long long) n);

return -EBADMSG;

}

last = p;

if (!contains_uint64(f->mmap, entry_fd, n_entries, p)) {

log_error("Invalid array entry at %llu of %llu.",

(unsigned long long) i, (unsigned long long) n);

return -EBADMSG;

}

r = journal_file_move_to_object(f, OBJECT_ENTRY, p, &o);

if (r < 0)

return r;

r = verify_entry(f, o, p, data_fd, n_data);

if (r < 0)

return r;

/* Pointer might have moved, reposition */

r = journal_file_move_to_object(f, OBJECT_ENTRY_ARRAY, a, &o);

if (r < 0)

return r;

}

a = next;

}

return 0;

}

static int journal_file_parse_seed(JournalFile *f, const char *s) {

uint8_t *seed;

size_t seed_size, c;

const char *k;

int r;

unsigned long long start, interval;

seed_size = FSPRG_RECOMMENDED_SEEDLEN;

seed = malloc(seed_size);

if (!seed)

return -ENOMEM;

k = s;

for (c = 0; c < seed_size; c++) {

int x, y;

while (*k == '-')

k++;

x = unhexchar(*k);

if (x < 0) {

free(seed);

return -EINVAL;

}

k++;

y = unhexchar(*k);

if (y < 0) {

free(seed);

return -EINVAL;

}

k++;

seed[c] = (uint8_t) (x * 16 + y);

}

if (*k != '/') {

free(seed);

return -EINVAL;

}

k++;

r = sscanf(k, "%llx-%llx", &start, &interval);

if (r != 2) {

free(seed);

return -EINVAL;

}

f->fsprg_seed = seed;

f->fsprg_seed_size = seed_size;

f->fsprg_start_usec = start;

f->fsprg_interval_usec = interval;

return 0;

}

int journal_file_verify(JournalFile *f, const char *seed) {

int r;

Object *o;

uint64_t p = 0;

uint64_t tag_seqnum = 0, entry_seqnum = 0, entry_monotonic = 0, entry_realtime = 0;

sd_id128_t entry_boot_id;

bool entry_seqnum_set = false, entry_monotonic_set = false, entry_realtime_set = false, found_main_entry_array = false;

uint64_t n_weird = 0, n_objects = 0, n_entries = 0, n_data = 0, n_fields = 0, n_data_hash_tables = 0, n_field_hash_tables = 0, n_entry_arrays = 0;

usec_t last_usec = 0;

int data_fd = -1, entry_fd = -1, entry_array_fd = -1;

char data_path[] = "/var/tmp/journal-data-XXXXXX",

entry_path[] = "/var/tmp/journal-entry-XXXXXX",

entry_array_path[] = "/var/tmp/journal-entry-array-XXXXXX";

assert(f);

if (seed) {

r = journal_file_parse_seed(f, seed);

if (r < 0) {

log_error("Failed to parse seed.");

return r;

}

}

data_fd = mkostemp(data_path, O_CLOEXEC);

if (data_fd < 0) {

log_error("Failed to create data file: %m");

r = -errno;

goto fail;

}

unlink(data_path);

entry_fd = mkostemp(entry_path, O_CLOEXEC);

if (entry_fd < 0) {

log_error("Failed to create entry file: %m");

r = -errno;

goto fail;

}

unlink(entry_path);

entry_array_fd = mkostemp(entry_array_path, O_CLOEXEC);

if (entry_array_fd < 0) {

log_error("Failed to create entry array file: %m");

r = -errno;

goto fail;

}

unlink(entry_array_path);

/* First iteration: we go through all objects, verify the

r = journal_file_hmac_put_header(f);

if (r < 0) {

log_error("Failed to calculate HMAC of header.");

goto fail;

}

p = le64toh(f->header->header_size);

while (p != 0) {

draw_progress(0x7FFF * p / le64toh(f->header->tail_object_offset), &last_usec);

r = journal_file_move_to_object(f, -1, p, &o);

if (r < 0) {

log_error("Invalid object at %llu", (unsigned long long) p);

goto fail;

}

if (le64toh(f->header->tail_object_offset) < p) {

log_error("Invalid tail object pointer.");

r = -EBADMSG;

goto fail;

}

n_objects ++;

r = journal_file_object_verify(f, o);

if (r < 0) {

log_error("Invalid object contents at %llu", (unsigned long long) p);

goto fail;

}

if (o->object.flags & OBJECT_COMPRESSED &&

!(le32toh(f->header->incompatible_flags) & HEADER_INCOMPATIBLE_COMPRESSED)) {

log_error("Compressed object without compression at %llu", (unsigned long long) p);

r = -EBADMSG;

goto fail;

}

r = journal_file_hmac_put_object(f, -1, p);

if (r < 0) {

log_error("Failed to calculate HMAC at %llu", (unsigned long long) p);

goto fail;

}

if (o->object.type == OBJECT_TAG) {

if (!(le32toh(f->header->compatible_flags) & HEADER_COMPATIBLE_AUTHENTICATED)) {

log_error("Tag object without authentication at %llu", (unsigned long long) p);

r = -EBADMSG;

goto fail;

}

if (le64toh(o->tag.seqnum) != tag_seqnum) {

log_error("Tag sequence number out of synchronization at %llu", (unsigned long long) p);

r = -EBADMSG;

goto fail;

}

} else if (o->object.type == OBJECT_ENTRY) {

r = write_uint64(entry_fd, p);

if (r < 0)

goto fail;

if (!entry_seqnum_set &&

le64toh(o->entry.seqnum) != le64toh(f->header->head_entry_seqnum)) {

log_error("Head entry sequence number incorrect");

r = -EBADMSG;

goto fail;

}

if (entry_seqnum_set &&

entry_seqnum >= le64toh(o->entry.seqnum)) {

log_error("Entry sequence number out of synchronization at %llu", (unsigned long long) p);

r = -EBADMSG;

goto fail;

}

entry_seqnum = le64toh(o->entry.seqnum);

entry_seqnum_set = true;

if (entry_monotonic_set &&

sd_id128_equal(entry_boot_id, o->entry.boot_id) &&

entry_monotonic > le64toh(o->entry.monotonic)) {

log_error("Entry timestamp out of synchronization at %llu", (unsigned long long) p);

r = -EBADMSG;

goto fail;

}

entry_monotonic = le64toh(o->entry.monotonic);

entry_boot_id = o->entry.boot_id;

entry_monotonic_set = true;

if (!entry_realtime_set &&

le64toh(o->entry.realtime) != le64toh(f->header->head_entry_realtime)) {

log_error("Head entry realtime timestamp incorrect");

r = -EBADMSG;

goto fail;

}

entry_realtime = le64toh(o->entry.realtime);

entry_realtime_set = true;

n_entries ++;

} else if (o->object.type == OBJECT_ENTRY_ARRAY) {

r = write_uint64(entry_array_fd, p);

if (r < 0)

goto fail;

if (p == le64toh(f->header->entry_array_offset)) {

if (found_main_entry_array) {

log_error("More than one main entry array at %llu", (unsigned long long) p);

r = -EBADMSG;

goto fail;

}

found_main_entry_array = true;

}

n_entry_arrays++;

} else if (o->object.type == OBJECT_DATA) {

r = write_uint64(data_fd, p);

if (r < 0)

goto fail;

n_data++;

} else if (o->object.type == OBJECT_FIELD)

n_fields++;

else if (o->object.type == OBJECT_DATA_HASH_TABLE) {

n_data_hash_tables++;

if (n_data_hash_tables > 1) {

log_error("More than one data hash table at %llu", (unsigned long long) p);

r = -EBADMSG;

goto fail;

}

if (le64toh(f->header->data_hash_table_offset) != p + offsetof(HashTableObject, items) ||

le64toh(f->header->data_hash_table_size) != le64toh(o->object.size) - offsetof(HashTableObject, items)) {

log_error("Header fields for data hash table invalid.");

r = -EBADMSG;

goto fail;

}

} else if (o->object.type == OBJECT_FIELD_HASH_TABLE) {

n_field_hash_tables++;

if (n_field_hash_tables > 1) {

log_error("More than one field hash table at %llu", (unsigned long long) p);

r = -EBADMSG;

goto fail;

}

if (le64toh(f->header->field_hash_table_offset) != p + offsetof(HashTableObject, items) ||

le64toh(f->header->field_hash_table_size) != le64toh(o->object.size) - offsetof(HashTableObject, items)) {

log_error("Header fields for field hash table invalid.");

r = -EBADMSG;

goto fail;

}

} else if (o->object.type >= _OBJECT_TYPE_MAX)

n_weird ++;

if (p == le64toh(f->header->tail_object_offset))

p = 0;

else

p = p + ALIGN64(le64toh(o->object.size));

}

if (n_objects != le64toh(f->header->n_objects)) {

log_error("Object number mismatch");

r = -EBADMSG;

goto fail;

}

if (n_entries != le64toh(f->header->n_entries)) {

log_error("Entry number mismatch");

r = -EBADMSG;

goto fail;

}

if (JOURNAL_HEADER_CONTAINS(f->header, n_data) &&

n_data != le64toh(f->header->n_data)) {

log_error("Data number mismatch");

r = -EBADMSG;

goto fail;

}

if (JOURNAL_HEADER_CONTAINS(f->header, n_fields) &&

n_fields != le64toh(f->header->n_fields)) {

log_error("Field number mismatch");

r = -EBADMSG;

goto fail;

}

if (JOURNAL_HEADER_CONTAINS(f->header, n_tags) &&

tag_seqnum != le64toh(f->header->n_tags)) {

log_error("Tag number mismatch");

r = -EBADMSG;

goto fail;

}

if (JOURNAL_HEADER_CONTAINS(f->header, n_entry_arrays) &&

n_entry_arrays != le64toh(f->header->n_entry_arrays)) {

log_error("Entry array number mismatch");

r = -EBADMSG;

goto fail;

}

if (n_data_hash_tables != 1) {

log_error("Missing data hash table");

r = -EBADMSG;

goto fail;

}

if (n_field_hash_tables != 1) {

log_error("Missing field hash table");

r = -EBADMSG;

goto fail;

}

if (!found_main_entry_array) {

log_error("Missing entry array");

r = -EBADMSG;

goto fail;

}

if (entry_seqnum_set &&

entry_seqnum != le64toh(f->header->tail_entry_seqnum)) {

log_error("Invalid tail seqnum");

r = -EBADMSG;

goto fail;

}

if (entry_monotonic_set &&

(!sd_id128_equal(entry_boot_id, f->header->boot_id) ||

entry_monotonic != le64toh(f->header->tail_entry_monotonic))) {

log_error("Invalid tail monotonic timestamp");

r = -EBADMSG;

goto fail;

}

if (entry_realtime_set && entry_realtime != le64toh(f->header->tail_entry_realtime)) {

log_error("Invalid tail realtime timestamp");

r = -EBADMSG;

goto fail;

}

/* Second iteration: we follow all objects referenced from the

r = verify_entry_array(f,

data_fd, n_data,

entry_fd, n_entries,

entry_array_fd, n_entry_arrays,

&last_usec);

if (r < 0)

goto fail;

r = verify_hash_table(f,

data_fd, n_data,

entry_fd, n_entries,

entry_array_fd, n_entry_arrays,

&last_usec);

if (r < 0)

goto fail;

flush_progress();

mmap_cache_close_fd(f->mmap, data_fd);

mmap_cache_close_fd(f->mmap, entry_fd);

mmap_cache_close_fd(f->mmap, entry_array_fd);

close_nointr_nofail(data_fd);

close_nointr_nofail(entry_fd);

close_nointr_nofail(entry_array_fd);

return 0;

fail:

flush_progress();

log_error("File corruption detected at %s:%llu (of %llu, %llu%%).",

f->path,

(unsigned long long) p,

(unsigned long long) f->last_stat.st_size,

(unsigned long long) (100 * p / f->last_stat.st_size));

if (data_fd >= 0) {

mmap_cache_close_fd(f->mmap, data_fd);

close_nointr_nofail(data_fd);

}

if (entry_fd >= 0) {

mmap_cache_close_fd(f->mmap, entry_fd);

close_nointr_nofail(entry_fd);

}

if (entry_array_fd >= 0) {

mmap_cache_close_fd(f->mmap, entry_array_fd);

close_nointr_nofail(entry_array_fd);

}

return r;

}