/*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/ /*** This file is part of systemd. Copyright 2011 Lennart Poettering systemd is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. systemd is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with systemd; If not, see . ***/ #include #include #include #include "sd-journal.h" #include "journal-def.h" #include "journal-file.h" #include "hashmap.h" #include "list.h" typedef struct Match Match; struct Match { char *data; size_t size; uint64_t hash; LIST_FIELDS(Match, matches); }; struct sd_journal { Hashmap *files; JournalFile *current_file; LIST_HEAD(Match, matches); }; int sd_journal_add_match(sd_journal *j, const char *field, const void *data, size_t size) { Match *m; char *e; assert(j); assert(field); assert(data || size == 0); m = new0(Match, 1); if (!m) return -ENOMEM; m->size = strlen(field) + 1 + size; m->data = malloc(m->size); if (!m->data) { free(m); return -ENOMEM; } e = stpcpy(m->data, field); *(e++) = '='; memcpy(e, data, size); LIST_PREPEND(Match, matches, j->matches, m); return 0; } void sd_journal_flush_matches(sd_journal *j) { assert(j); while (j->matches) { Match *m = j->matches; LIST_REMOVE(Match, matches, j->matches, m); free(m->data); free(m); } } static int compare_order(JournalFile *af, Object *ao, uint64_t ap, JournalFile *bf, Object *bo, uint64_t bp) { uint64_t a, b; if (sd_id128_equal(af->header->seqnum_id, bf->header->seqnum_id)) { /* If this is from the same seqnum source, compare * seqnums */ a = le64toh(ao->entry.seqnum); b = le64toh(bo->entry.seqnum); } else if (sd_id128_equal(ao->entry.boot_id, bo->entry.boot_id)) { /* If the boot id matches compare monotonic time */ a = le64toh(ao->entry.monotonic); b = le64toh(bo->entry.monotonic); } else { /* Otherwise compare UTC time */ a = le64toh(ao->entry.realtime); b = le64toh(ao->entry.realtime); } return a < b ? -1 : a > b ? +1 : 0; } int sd_journal_next(sd_journal *j) { JournalFile *f, *new_current = NULL; Iterator i; int r; uint64_t new_offset = 0; Object *new_entry = NULL; assert(j); HASHMAP_FOREACH(f, j->files, i) { Object *o; uint64_t p; if (f->current_offset > 0) { r = journal_file_move_to_object(f, f->current_offset, OBJECT_ENTRY, &o); if (r < 0) return r; } else o = NULL; r = journal_file_next_entry(f, o, &o, &p); if (r < 0) return r; else if (r == 0) continue; if (!new_current || compare_order(new_current, new_entry, new_offset, f, o, p) > 0) { new_current = f; new_entry = o; new_offset = p; } } if (new_current) { j->current_file = new_current; j->current_file->current_offset = new_offset; j->current_file->current_field = 0; return 1; } return 0; } int sd_journal_previous(sd_journal *j) { JournalFile *f, *new_current = NULL; Iterator i; int r; uint64_t new_offset = 0; Object *new_entry = NULL; assert(j); HASHMAP_FOREACH(f, j->files, i) { Object *o; uint64_t p; if (f->current_offset > 0) { r = journal_file_move_to_object(f, f->current_offset, OBJECT_ENTRY, &o); if (r < 0) return r; } else o = NULL; r = journal_file_prev_entry(f, o, &o, &p); if (r < 0) return r; else if (r == 0) continue; if (!new_current || compare_order(new_current, new_entry, new_offset, f, o, p) > 0) { new_current = f; new_entry = o; new_offset = p; } } if (new_current) { j->current_file = new_current; j->current_file->current_offset = new_offset; j->current_file->current_field = 0; return 1; } return 0; } int sd_journal_get_cursor(sd_journal *j, char **cursor) { Object *o; int r; char bid[33], sid[33]; assert(j); assert(cursor); if (!j->current_file || j->current_file->current_offset <= 0) return -EADDRNOTAVAIL; r = journal_file_move_to_object(j->current_file, j->current_file->current_offset, OBJECT_ENTRY, &o); if (r < 0) return r; sd_id128_to_string(j->current_file->header->seqnum_id, sid); sd_id128_to_string(o->entry.boot_id, bid); if (asprintf(cursor, "s=%s;i=%llx;b=%s;m=%llx;t=%llx;x=%llx;p=%s", sid, (unsigned long long) le64toh(o->entry.seqnum), bid, (unsigned long long) le64toh(o->entry.monotonic), (unsigned long long) le64toh(o->entry.realtime), (unsigned long long) le64toh(o->entry.xor_hash), file_name_from_path(j->current_file->path)) < 0) return -ENOMEM; return 1; } int sd_journal_set_cursor(sd_journal *j, const char *cursor) { return -EINVAL; } static int add_file(sd_journal *j, const char *prefix, const char *dir, const char *filename) { char *fn; int r; JournalFile *f; assert(j); assert(prefix); assert(filename); if (dir) fn = join(prefix, "/", dir, "/", filename, NULL); else fn = join(prefix, "/", filename, NULL); if (!fn) return -ENOMEM; r = journal_file_open(fn, O_RDONLY, 0, NULL, &f); free(fn); if (r < 0) { if (errno == ENOENT) return 0; return r; } r = hashmap_put(j->files, f->path, f); if (r < 0) { journal_file_close(f); return r; } return 0; } static int add_directory(sd_journal *j, const char *prefix, const char *dir) { char *fn; int r; DIR *d; assert(j); assert(prefix); assert(dir); fn = join(prefix, "/", dir, NULL); if (!fn) return -ENOMEM; d = opendir(fn); free(fn); if (!d) { if (errno == ENOENT) return 0; return -errno; } for (;;) { struct dirent buf, *de; r = readdir_r(d, &buf, &de); if (r != 0 || !de) break; if (!dirent_is_file_with_suffix(de, ".journal")) continue; r = add_file(j, prefix, dir, de->d_name); if (r < 0) log_debug("Failed to add file %s/%s/%s: %s", prefix, dir, de->d_name, strerror(-r)); } closedir(d); return 0; } int sd_journal_open(sd_journal **ret) { sd_journal *j; const char *p; const char search_paths[] = "/run/log/journal\0" "/var/log/journal\0"; int r; assert(ret); j = new0(sd_journal, 1); if (!j) return -ENOMEM; j->files = hashmap_new(string_hash_func, string_compare_func); if (!j->files) { r = -ENOMEM; goto fail; } /* We ignore most errors here, since the idea is to only open * what's actually accessible, and ignore the rest. */ NULSTR_FOREACH(p, search_paths) { DIR *d; d = opendir(p); if (!d) { if (errno != ENOENT) log_debug("Failed to open %s: %m", p); continue; } for (;;) { struct dirent buf, *de; sd_id128_t id; r = readdir_r(d, &buf, &de); if (r != 0 || !de) break; if (dirent_is_file_with_suffix(de, ".journal")) { r = add_file(j, p, NULL, de->d_name); if (r < 0) log_debug("Failed to add file %s/%s: %s", p, de->d_name, strerror(-r)); } else if ((de->d_type == DT_DIR || de->d_type == DT_UNKNOWN) && sd_id128_from_string(de->d_name, &id) >= 0) { r = add_directory(j, p, de->d_name); if (r < 0) log_debug("Failed to add directory %s/%s: %s", p, de->d_name, strerror(-r)); } } closedir(d); } *ret = j; return 0; fail: sd_journal_close(j); return r; }; void sd_journal_close(sd_journal *j) { assert(j); if (j->files) { JournalFile *f; while ((f = hashmap_steal_first(j->files))) journal_file_close(f); hashmap_free(j->files); } free(j); } int sd_journal_get_realtime_usec(sd_journal *j, uint64_t *ret) { Object *o; JournalFile *f; int r; assert(j); assert(ret); f = j->current_file; if (!f) return 0; if (f->current_offset <= 0) return 0; r = journal_file_move_to_object(f, f->current_offset, OBJECT_ENTRY, &o); if (r < 0) return r; *ret = le64toh(o->entry.realtime); return 1; } int sd_journal_get_monotonic_usec(sd_journal *j, uint64_t *ret) { Object *o; JournalFile *f; int r; sd_id128_t id; assert(j); assert(ret); f = j->current_file; if (!f) return 0; if (f->current_offset <= 0) return 0; r = sd_id128_get_machine(&id); if (r < 0) return r; r = journal_file_move_to_object(f, f->current_offset, OBJECT_ENTRY, &o); if (r < 0) return r; if (!sd_id128_equal(id, o->entry.boot_id)) return 0; *ret = le64toh(o->entry.monotonic); return 1; } int sd_journal_get_field(sd_journal *j, const char *field, const void **data, size_t *size) { JournalFile *f; uint64_t i, n; size_t field_length; int r; Object *o; assert(j); assert(field); assert(data); assert(size); if (isempty(field) || strchr(field, '=')) return -EINVAL; f = j->current_file; if (!f) return 0; if (f->current_offset <= 0) return 0; r = journal_file_move_to_object(f, f->current_offset, OBJECT_ENTRY, &o); if (r < 0) return r; field_length = strlen(field); n = journal_file_entry_n_items(o); for (i = 0; i < n; i++) { uint64_t p, l; size_t t; p = le64toh(o->entry.items[i].object_offset); r = journal_file_move_to_object(f, p, OBJECT_DATA, &o); if (r < 0) return r; l = le64toh(o->object.size) - offsetof(Object, data.payload); if (l >= field_length+1 && memcmp(o->data.payload, field, field_length) == 0 && o->data.payload[field_length] == '=') { t = (size_t) l; if ((uint64_t) t != l) return -E2BIG; *data = o->data.payload; *size = t; return 1; } r = journal_file_move_to_object(f, f->current_offset, OBJECT_ENTRY, &o); if (r < 0) return r; } return 0; } int sd_journal_iterate_fields(sd_journal *j, const void **data, size_t *size) { JournalFile *f; uint64_t p, l, n; size_t t; int r; Object *o; assert(j); assert(data); assert(size); f = j->current_file; if (!f) return 0; if (f->current_offset <= 0) return 0; r = journal_file_move_to_object(f, f->current_offset, OBJECT_ENTRY, &o); if (r < 0) return r; n = journal_file_entry_n_items(o); if (f->current_field >= n) return 0; p = le64toh(o->entry.items[f->current_field].object_offset); r = journal_file_move_to_object(f, p, OBJECT_DATA, &o); if (r < 0) return r; l = le64toh(o->object.size) - offsetof(Object, data.payload); t = (size_t) l; /* We can't read objects larger than 4G on a 32bit machine */ if ((uint64_t) t != l) return -E2BIG; *data = o->data.payload; *size = t; f->current_field ++; return 1; }