src/journal/sd-journal.c

   1 /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
   2
   3 /***
   4   This file is part of systemd.
   5
   6   Copyright 2011 Lennart Poettering
   7
   8   systemd is free software; you can redistribute it and/or modify it
   9   under the terms of the GNU Lesser General Public License as published by
  10   the Free Software Foundation; either version 2.1 of the License, or
  11   (at your option) any later version.
  12
  13   systemd is distributed in the hope that it will be useful, but
  14   WITHOUT ANY WARRANTY; without even the implied warranty of
  15   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16   Lesser General Public License for more details.
  17
  18   You should have received a copy of the GNU Lesser General Public License
  19   along with systemd; If not, see <http://www.gnu.org/licenses/>.
  20 ***/
  21
  22 #include <errno.h>
  23 #include <fcntl.h>
  24 #include <stddef.h>
  25 #include <unistd.h>
  26 #include <sys/inotify.h>
  27 #include <sys/poll.h>
  28 #include <sys/vfs.h>
  29 #include <linux/magic.h>
  30
  31 #include "sd-journal.h"
  32 #include "journal-def.h"
  33 #include "journal-file.h"
  34 #include "hashmap.h"
  35 #include "list.h"
  36 #include "strv.h"
  37 #include "path-util.h"
  38 #include "lookup3.h"
  39 #include "compress.h"
  40 #include "journal-internal.h"
  41 #include "missing.h"
  42 #include "catalog.h"
  43 #include "replace-var.h"
  44 #include "fileio.h"
  45
  46 #define JOURNAL_FILES_MAX 1024
  47
  48 #define JOURNAL_FILES_RECHECK_USEC (2 * USEC_PER_SEC)
  49
  50 #define REPLACE_VAR_MAX 256
  51
  52 #define DEFAULT_DATA_THRESHOLD (64*1024)
  53
  54 static void remove_file_real(sd_journal *j, JournalFile *f);
  55
  56 static bool journal_pid_changed(sd_journal *j) {
  57         assert(j);
  58
  59         /* We don't support people creating a journal object and
  60          * keeping it around over a fork(). Let's complain. */
  61
  62         return j->original_pid != getpid();
  63 }
  64
  65 /* We return an error here only if we didn't manage to
  66    memorize the real error. */
  67 static int set_put_error(sd_journal *j, int r) {
  68         int k;
  69
  70         if (r >= 0)
  71                 return r;
  72
  73         k = set_ensure_allocated(&j->errors, trivial_hash_func, trivial_compare_func);
  74         if (k < 0)
  75                 return k;
  76
  77         return set_put(j->errors, INT_TO_PTR(r));
  78 }
  79
  80 static void detach_location(sd_journal *j) {
  81         Iterator i;
  82         JournalFile *f;
  83
  84         assert(j);
  85
  86         j->current_file = NULL;
  87         j->current_field = 0;
  88
  89         HASHMAP_FOREACH(f, j->files, i)
  90                 f->current_offset = 0;
  91 }
  92
  93 static void reset_location(sd_journal *j) {
  94         assert(j);
  95
  96         detach_location(j);
  97         zero(j->current_location);
  98 }
  99
 100 static void init_location(Location *l, LocationType type, JournalFile *f, Object *o) {
 101         assert(l);
 102         assert(type == LOCATION_DISCRETE || type == LOCATION_SEEK);
 103         assert(f);
 104         assert(o->object.type == OBJECT_ENTRY);
 105
 106         l->type = type;
 107         l->seqnum = le64toh(o->entry.seqnum);
 108         l->seqnum_id = f->header->seqnum_id;
 109         l->realtime = le64toh(o->entry.realtime);
 110         l->monotonic = le64toh(o->entry.monotonic);
 111         l->boot_id = o->entry.boot_id;
 112         l->xor_hash = le64toh(o->entry.xor_hash);
 113
 114         l->seqnum_set = l->realtime_set = l->monotonic_set = l->xor_hash_set = true;
 115 }
 116
 117 static void set_location(sd_journal *j, LocationType type, JournalFile *f, Object *o,
 118                          direction_t direction, uint64_t offset) {
 119         assert(j);
 120         assert(type == LOCATION_DISCRETE || type == LOCATION_SEEK);
 121         assert(f);
 122         assert(o);
 123
 124         init_location(&j->current_location, type, f, o);
 125
 126         j->current_file = f;
 127         j->current_field = 0;
 128
 129         f->last_direction = direction;
 130         f->current_offset = offset;
 131 }
 132
 133 static int match_is_valid(const void *data, size_t size) {
 134         const char *b, *p;
 135
 136         assert(data);
 137
 138         if (size < 2)
 139                 return false;
 140
 141         if (startswith(data, "__"))
 142                 return false;
 143
 144         b = data;
 145         for (p = b; p < b + size; p++) {
 146
 147                 if (*p == '=')
 148                         return p > b;
 149
 150                 if (*p == '_')
 151                         continue;
 152
 153                 if (*p >= 'A' && *p <= 'Z')
 154                         continue;
 155
 156                 if (*p >= '0' && *p <= '9')
 157                         continue;
 158
 159                 return false;
 160         }
 161
 162         return false;
 163 }
 164
 165 static bool same_field(const void *_a, size_t s, const void *_b, size_t t) {
 166         const uint8_t *a = _a, *b = _b;
 167         size_t j;
 168
 169         for (j = 0; j < s && j < t; j++) {
 170
 171                 if (a[j] != b[j])
 172                         return false;
 173
 174                 if (a[j] == '=')
 175                         return true;
 176         }
 177
 178         assert_not_reached("\"=\" not found");
 179 }
 180
 181 static Match *match_new(Match *p, MatchType t) {
 182         Match *m;
 183
 184         m = new0(Match, 1);
 185         if (!m)
 186                 return NULL;
 187
 188         m->type = t;
 189
 190         if (p) {
 191                 m->parent = p;
 192                 LIST_PREPEND(matches, p->matches, m);
 193         }
 194
 195         return m;
 196 }
 197
 198 static void match_free(Match *m) {
 199         assert(m);
 200
 201         while (m->matches)
 202                 match_free(m->matches);
 203
 204         if (m->parent)
 205                 LIST_REMOVE(matches, m->parent->matches, m);
 206
 207         free(m->data);
 208         free(m);
 209 }
 210
 211 static void match_free_if_empty(Match *m) {
 212         if (!m || m->matches)
 213                 return;
 214
 215         match_free(m);
 216 }
 217
 218 _public_ int sd_journal_add_match(sd_journal *j, const void *data, size_t size) {
 219         Match *l3, *l4, *add_here = NULL, *m;
 220         le64_t le_hash;
 221
 222         assert_return(j, -EINVAL);
 223         assert_return(!journal_pid_changed(j), -ECHILD);
 224         assert_return(data, -EINVAL);
 225
 226         if (size == 0)
 227                 size = strlen(data);
 228
 229         assert_return(match_is_valid(data, size), -EINVAL);
 230
 231         /* level 0: AND term
 232          * level 1: OR terms
 233          * level 2: AND terms
 234          * level 3: OR terms
 235          * level 4: concrete matches */
 236
 237         if (!j->level0) {
 238                 j->level0 = match_new(NULL, MATCH_AND_TERM);
 239                 if (!j->level0)
 240                         return -ENOMEM;
 241         }
 242
 243         if (!j->level1) {
 244                 j->level1 = match_new(j->level0, MATCH_OR_TERM);
 245                 if (!j->level1)
 246                         return -ENOMEM;
 247         }
 248
 249         if (!j->level2) {
 250                 j->level2 = match_new(j->level1, MATCH_AND_TERM);
 251                 if (!j->level2)
 252                         return -ENOMEM;
 253         }
 254
 255         assert(j->level0->type == MATCH_AND_TERM);
 256         assert(j->level1->type == MATCH_OR_TERM);
 257         assert(j->level2->type == MATCH_AND_TERM);
 258
 259         le_hash = htole64(hash64(data, size));
 260
 261         LIST_FOREACH(matches, l3, j->level2->matches) {
 262                 assert(l3->type == MATCH_OR_TERM);
 263
 264                 LIST_FOREACH(matches, l4, l3->matches) {
 265                         assert(l4->type == MATCH_DISCRETE);
 266
 267                         /* Exactly the same match already? Then ignore
 268                          * this addition */
 269                         if (l4->le_hash == le_hash &&
 270                             l4->size == size &&
 271                             memcmp(l4->data, data, size) == 0)
 272                                 return 0;
 273
 274                         /* Same field? Then let's add this to this OR term */
 275                         if (same_field(data, size, l4->data, l4->size)) {
 276                                 add_here = l3;
 277                                 break;
 278                         }
 279                 }
 280
 281                 if (add_here)
 282                         break;
 283         }
 284
 285         if (!add_here) {
 286                 add_here = match_new(j->level2, MATCH_OR_TERM);
 287                 if (!add_here)
 288                         goto fail;
 289         }
 290
 291         m = match_new(add_here, MATCH_DISCRETE);
 292         if (!m)
 293                 goto fail;
 294
 295         m->le_hash = le_hash;
 296         m->size = size;
 297         m->data = memdup(data, size);
 298         if (!m->data)
 299                 goto fail;
 300
 301         detach_location(j);
 302
 303         return 0;
 304
 305 fail:
 306         match_free_if_empty(add_here);
 307         match_free_if_empty(j->level2);
 308         match_free_if_empty(j->level1);
 309         match_free_if_empty(j->level0);
 310
 311         return -ENOMEM;
 312 }
 313
 314 _public_ int sd_journal_add_conjunction(sd_journal *j) {
 315         assert_return(j, -EINVAL);
 316         assert_return(!journal_pid_changed(j), -ECHILD);
 317
 318         if (!j->level0)
 319                 return 0;
 320
 321         if (!j->level1)
 322                 return 0;
 323
 324         if (!j->level1->matches)
 325                 return 0;
 326
 327         j->level1 = NULL;
 328         j->level2 = NULL;
 329
 330         return 0;
 331 }
 332
 333 _public_ int sd_journal_add_disjunction(sd_journal *j) {
 334         assert_return(j, -EINVAL);
 335         assert_return(!journal_pid_changed(j), -ECHILD);
 336
 337         if (!j->level0)
 338                 return 0;
 339
 340         if (!j->level1)
 341                 return 0;
 342
 343         if (!j->level2)
 344                 return 0;
 345
 346         if (!j->level2->matches)
 347                 return 0;
 348
 349         j->level2 = NULL;
 350         return 0;
 351 }
 352
 353 static char *match_make_string(Match *m) {
 354         char *p, *r;
 355         Match *i;
 356         bool enclose = false;
 357
 358         if (!m)
 359                 return strdup("none");
 360
 361         if (m->type == MATCH_DISCRETE)
 362                 return strndup(m->data, m->size);
 363
 364         p = NULL;
 365         LIST_FOREACH(matches, i, m->matches) {
 366                 char *t, *k;
 367
 368                 t = match_make_string(i);
 369                 if (!t) {
 370                         free(p);
 371                         return NULL;
 372                 }
 373
 374                 if (p) {
 375                         k = strjoin(p, m->type == MATCH_OR_TERM ? " OR " : " AND ", t, NULL);
 376                         free(p);
 377                         free(t);
 378
 379                         if (!k)
 380                                 return NULL;
 381
 382                         p = k;
 383
 384                         enclose = true;
 385                 } else
 386                         p = t;
 387         }
 388
 389         if (enclose) {
 390                 r = strjoin("(", p, ")", NULL);
 391                 free(p);
 392                 return r;
 393         }
 394
 395         return p;
 396 }
 397
 398 char *journal_make_match_string(sd_journal *j) {
 399         assert(j);
 400
 401         return match_make_string(j->level0);
 402 }
 403
 404 _public_ void sd_journal_flush_matches(sd_journal *j) {
 405         if (!j)
 406                 return;
 407
 408         if (j->level0)
 409                 match_free(j->level0);
 410
 411         j->level0 = j->level1 = j->level2 = NULL;
 412
 413         detach_location(j);
 414 }
 415
 416 static int compare_entry_order(JournalFile *af, Object *_ao,
 417                                JournalFile *bf, uint64_t bp) {
 418
 419         uint64_t a, b;
 420         Object *ao, *bo;
 421         int r;
 422
 423         assert(af);
 424         assert(bf);
 425         assert(_ao);
 426
 427         /* The mmap cache might invalidate the object from the first
 428          * file if we look at the one from the second file. Hence
 429          * temporarily copy the header of the first one, and look at
 430          * that only. */
 431         ao = alloca(offsetof(EntryObject, items));
 432         memcpy(ao, _ao, offsetof(EntryObject, items));
 433
 434         r = journal_file_move_to_object(bf, OBJECT_ENTRY, bp, &bo);
 435         if (r < 0)
 436                 return strcmp(af->path, bf->path);
 437
 438         /* We operate on two different files here, hence we can access
 439          * two objects at the same time, which we normally can't.
 440          *
 441          * If contents and timestamps match, these entries are
 442          * identical, even if the seqnum does not match */
 443
 444         if (sd_id128_equal(ao->entry.boot_id, bo->entry.boot_id) &&
 445             ao->entry.monotonic == bo->entry.monotonic &&
 446             ao->entry.realtime == bo->entry.realtime &&
 447             ao->entry.xor_hash == bo->entry.xor_hash)
 448                 return 0;
 449
 450         if (sd_id128_equal(af->header->seqnum_id, bf->header->seqnum_id)) {
 451
 452                 /* If this is from the same seqnum source, compare
 453                  * seqnums */
 454                 a = le64toh(ao->entry.seqnum);
 455                 b = le64toh(bo->entry.seqnum);
 456
 457                 if (a < b)
 458                         return -1;
 459                 if (a > b)
 460                         return 1;
 461
 462                 /* Wow! This is weird, different data but the same
 463                  * seqnums? Something is borked, but let's make the
 464                  * best of it and compare by time. */
 465         }
 466
 467         if (sd_id128_equal(ao->entry.boot_id, bo->entry.boot_id)) {
 468
 469                 /* If the boot id matches, compare monotonic time */
 470                 a = le64toh(ao->entry.monotonic);
 471                 b = le64toh(bo->entry.monotonic);
 472
 473                 if (a < b)
 474                         return -1;
 475                 if (a > b)
 476                         return 1;
 477         }
 478
 479         /* Otherwise, compare UTC time */
 480         a = le64toh(ao->entry.realtime);
 481         b = le64toh(bo->entry.realtime);
 482
 483         if (a < b)
 484                 return -1;
 485         if (a > b)
 486                 return 1;
 487
 488         /* Finally, compare by contents */
 489         a = le64toh(ao->entry.xor_hash);
 490         b = le64toh(bo->entry.xor_hash);
 491
 492         if (a < b)
 493                 return -1;
 494         if (a > b)
 495                 return 1;
 496
 497         return 0;
 498 }
 499
 500 _pure_ static int compare_with_location(JournalFile *af, Object *ao, Location *l) {
 501         uint64_t a;
 502
 503         assert(af);
 504         assert(ao);
 505         assert(l);
 506         assert(l->type == LOCATION_DISCRETE || l->type == LOCATION_SEEK);
 507
 508         if (l->monotonic_set &&
 509             sd_id128_equal(ao->entry.boot_id, l->boot_id) &&
 510             l->realtime_set &&
 511             le64toh(ao->entry.realtime) == l->realtime &&
 512             l->xor_hash_set &&
 513             le64toh(ao->entry.xor_hash) == l->xor_hash)
 514                 return 0;
 515
 516         if (l->seqnum_set &&
 517             sd_id128_equal(af->header->seqnum_id, l->seqnum_id)) {
 518
 519                 a = le64toh(ao->entry.seqnum);
 520
 521                 if (a < l->seqnum)
 522                         return -1;
 523                 if (a > l->seqnum)
 524                         return 1;
 525         }
 526
 527         if (l->monotonic_set &&
 528             sd_id128_equal(ao->entry.boot_id, l->boot_id)) {
 529
 530                 a = le64toh(ao->entry.monotonic);
 531
 532                 if (a < l->monotonic)
 533                         return -1;
 534                 if (a > l->monotonic)
 535                         return 1;
 536         }
 537
 538         if (l->realtime_set) {
 539
 540                 a = le64toh(ao->entry.realtime);
 541
 542                 if (a < l->realtime)
 543                         return -1;
 544                 if (a > l->realtime)
 545                         return 1;
 546         }
 547
 548         if (l->xor_hash_set) {
 549                 a = le64toh(ao->entry.xor_hash);
 550
 551                 if (a < l->xor_hash)
 552                         return -1;
 553                 if (a > l->xor_hash)
 554                         return 1;
 555         }
 556
 557         return 0;
 558 }
 559
 560 static int next_for_match(
 561                 sd_journal *j,
 562                 Match *m,
 563                 JournalFile *f,
 564                 uint64_t after_offset,
 565                 direction_t direction,
 566                 Object **ret,
 567                 uint64_t *offset) {
 568
 569         int r;
 570         uint64_t np = 0;
 571         Object *n;
 572
 573         assert(j);
 574         assert(m);
 575         assert(f);
 576
 577         if (m->type == MATCH_DISCRETE) {
 578                 uint64_t dp;
 579
 580                 r = journal_file_find_data_object_with_hash(f, m->data, m->size, le64toh(m->le_hash), NULL, &dp);
 581                 if (r <= 0)
 582                         return r;
 583
 584                 return journal_file_move_to_entry_by_offset_for_data(f, dp, after_offset, direction, ret, offset);
 585
 586         } else if (m->type == MATCH_OR_TERM) {
 587                 Match *i;
 588
 589                 /* Find the earliest match beyond after_offset */
 590
 591                 LIST_FOREACH(matches, i, m->matches) {
 592                         uint64_t cp;
 593
 594                         r = next_for_match(j, i, f, after_offset, direction, NULL, &cp);
 595                         if (r < 0)
 596                                 return r;
 597                         else if (r > 0) {
 598                                 if (np == 0 || (direction == DIRECTION_DOWN ? cp < np : cp > np))
 599                                         np = cp;
 600                         }
 601                 }
 602
 603                 if (np == 0)
 604                         return 0;
 605
 606         } else if (m->type == MATCH_AND_TERM) {
 607                 Match *i, *last_moved;
 608
 609                 /* Always jump to the next matching entry and repeat
 610                  * this until we find an offset that matches for all
 611                  * matches. */
 612
 613                 if (!m->matches)
 614                         return 0;
 615
 616                 r = next_for_match(j, m->matches, f, after_offset, direction, NULL, &np);
 617                 if (r <= 0)
 618                         return r;
 619
 620                 assert(direction == DIRECTION_DOWN ? np >= after_offset : np <= after_offset);
 621                 last_moved = m->matches;
 622
 623                 LIST_LOOP_BUT_ONE(matches, i, m->matches, last_moved) {
 624                         uint64_t cp;
 625
 626                         r = next_for_match(j, i, f, np, direction, NULL, &cp);
 627                         if (r <= 0)
 628                                 return r;
 629
 630                         assert(direction == DIRECTION_DOWN ? cp >= np : cp <= np);
 631                         if (direction == DIRECTION_DOWN ? cp > np : cp < np) {
 632                                 np = cp;
 633                                 last_moved = i;
 634                         }
 635                 }
 636         }
 637
 638         assert(np > 0);
 639
 640         r = journal_file_move_to_object(f, OBJECT_ENTRY, np, &n);
 641         if (r < 0)
 642                 return r;
 643
 644         if (ret)
 645                 *ret = n;
 646         if (offset)
 647                 *offset = np;
 648
 649         return 1;
 650 }
 651
 652 static int find_location_for_match(
 653                 sd_journal *j,
 654                 Match *m,
 655                 JournalFile *f,
 656                 direction_t direction,
 657                 Object **ret,
 658                 uint64_t *offset) {
 659
 660         int r;
 661
 662         assert(j);
 663         assert(m);
 664         assert(f);
 665
 666         if (m->type == MATCH_DISCRETE) {
 667                 uint64_t dp;
 668
 669                 r = journal_file_find_data_object_with_hash(f, m->data, m->size, le64toh(m->le_hash), NULL, &dp);
 670                 if (r <= 0)
 671                         return r;
 672
 673                 /* FIXME: missing: find by monotonic */
 674
 675                 if (j->current_location.type == LOCATION_HEAD)
 676                         return journal_file_next_entry_for_data(f, NULL, 0, dp, DIRECTION_DOWN, ret, offset);
 677                 if (j->current_location.type == LOCATION_TAIL)
 678                         return journal_file_next_entry_for_data(f, NULL, 0, dp, DIRECTION_UP, ret, offset);
 679                 if (j->current_location.seqnum_set && sd_id128_equal(j->current_location.seqnum_id, f->header->seqnum_id))
 680                         return journal_file_move_to_entry_by_seqnum_for_data(f, dp, j->current_location.seqnum, direction, ret, offset);
 681                 if (j->current_location.monotonic_set) {
 682                         r = journal_file_move_to_entry_by_monotonic_for_data(f, dp, j->current_location.boot_id, j->current_location.monotonic, direction, ret, offset);
 683                         if (r != -ENOENT)
 684                                 return r;
 685                 }
 686                 if (j->current_location.realtime_set)
 687                         return journal_file_move_to_entry_by_realtime_for_data(f, dp, j->current_location.realtime, direction, ret, offset);
 688
 689                 return journal_file_next_entry_for_data(f, NULL, 0, dp, direction, ret, offset);
 690
 691         } else if (m->type == MATCH_OR_TERM) {
 692                 uint64_t np = 0;
 693                 Object *n;
 694                 Match *i;
 695
 696                 /* Find the earliest match */
 697
 698                 LIST_FOREACH(matches, i, m->matches) {
 699                         uint64_t cp;
 700
 701                         r = find_location_for_match(j, i, f, direction, NULL, &cp);
 702                         if (r < 0)
 703                                 return r;
 704                         else if (r > 0) {
 705                                 if (np == 0 || (direction == DIRECTION_DOWN ? np > cp : np < cp))
 706                                         np = cp;
 707                         }
 708                 }
 709
 710                 if (np == 0)
 711                         return 0;
 712
 713                 r = journal_file_move_to_object(f, OBJECT_ENTRY, np, &n);
 714                 if (r < 0)
 715                         return r;
 716
 717                 if (ret)
 718                         *ret = n;
 719                 if (offset)
 720                         *offset = np;
 721
 722                 return 1;
 723
 724         } else {
 725                 Match *i;
 726                 uint64_t np = 0;
 727
 728                 assert(m->type == MATCH_AND_TERM);
 729
 730                 /* First jump to the last match, and then find the
 731                  * next one where all matches match */
 732
 733                 if (!m->matches)
 734                         return 0;
 735
 736                 LIST_FOREACH(matches, i, m->matches) {
 737                         uint64_t cp;
 738
 739                         r = find_location_for_match(j, i, f, direction, NULL, &cp);
 740                         if (r <= 0)
 741                                 return r;
 742
 743                         if (np == 0 || (direction == DIRECTION_DOWN ? cp > np : cp < np))
 744                                 np = cp;
 745                 }
 746
 747                 return next_for_match(j, m, f, np, direction, ret, offset);
 748         }
 749 }
 750
 751 static int find_location_with_matches(
 752                 sd_journal *j,
 753                 JournalFile *f,
 754                 direction_t direction,
 755                 Object **ret,
 756                 uint64_t *offset) {
 757
 758         int r;
 759
 760         assert(j);
 761         assert(f);
 762         assert(ret);
 763         assert(offset);
 764
 765         if (!j->level0) {
 766                 /* No matches is simple */
 767
 768                 if (j->current_location.type == LOCATION_HEAD)
 769                         return journal_file_next_entry(f, NULL, 0, DIRECTION_DOWN, ret, offset);
 770                 if (j->current_location.type == LOCATION_TAIL)
 771                         return journal_file_next_entry(f, NULL, 0, DIRECTION_UP, ret, offset);
 772                 if (j->current_location.seqnum_set && sd_id128_equal(j->current_location.seqnum_id, f->header->seqnum_id))
 773                         return journal_file_move_to_entry_by_seqnum(f, j->current_location.seqnum, direction, ret, offset);
 774                 if (j->current_location.monotonic_set) {
 775                         r = journal_file_move_to_entry_by_monotonic(f, j->current_location.boot_id, j->current_location.monotonic, direction, ret, offset);
 776                         if (r != -ENOENT)
 777                                 return r;
 778                 }
 779                 if (j->current_location.realtime_set)
 780                         return journal_file_move_to_entry_by_realtime(f, j->current_location.realtime, direction, ret, offset);
 781
 782                 return journal_file_next_entry(f, NULL, 0, direction, ret, offset);
 783         } else
 784                 return find_location_for_match(j, j->level0, f, direction, ret, offset);
 785 }
 786
 787 static int next_with_matches(
 788                 sd_journal *j,
 789                 JournalFile *f,
 790                 direction_t direction,
 791                 Object **ret,
 792                 uint64_t *offset) {
 793
 794         Object *c;
 795         uint64_t cp;
 796
 797         assert(j);
 798         assert(f);
 799         assert(ret);
 800         assert(offset);
 801
 802         c = *ret;
 803         cp = *offset;
 804
 805         /* No matches is easy. We simple advance the file
 806          * pointer by one. */
 807         if (!j->level0)
 808                 return journal_file_next_entry(f, c, cp, direction, ret, offset);
 809
 810         /* If we have a match then we look for the next matching entry
 811          * with an offset at least one step larger */
 812         return next_for_match(j, j->level0, f, direction == DIRECTION_DOWN ? cp+1 : cp-1, direction, ret, offset);
 813 }
 814
 815 static int next_beyond_location(sd_journal *j, JournalFile *f, direction_t direction, Object **ret, uint64_t *offset) {
 816         Object *c;
 817         uint64_t cp;
 818         int r;
 819
 820         assert(j);
 821         assert(f);
 822
 823         if (f->last_direction == direction && f->current_offset > 0) {
 824                 cp = f->current_offset;
 825
 826                 r = journal_file_move_to_object(f, OBJECT_ENTRY, cp, &c);
 827                 if (r < 0)
 828                         return r;
 829
 830                 r = next_with_matches(j, f, direction, &c, &cp);
 831                 if (r <= 0)
 832                         return r;
 833         } else {
 834                 r = find_location_with_matches(j, f, direction, &c, &cp);
 835                 if (r <= 0)
 836                         return r;
 837         }
 838
 839         /* OK, we found the spot, now let's advance until an entry
 840          * that is actually different from what we were previously
 841          * looking at. This is necessary to handle entries which exist
 842          * in two (or more) journal files, and which shall all be
 843          * suppressed but one. */
 844
 845         for (;;) {
 846                 bool found;
 847
 848                 if (j->current_location.type == LOCATION_DISCRETE) {
 849                         int k;
 850
 851                         k = compare_with_location(f, c, &j->current_location);
 852                         if (direction == DIRECTION_DOWN)
 853                                 found = k > 0;
 854                         else
 855                                 found = k < 0;
 856                 } else
 857                         found = true;
 858
 859                 if (found) {
 860                         if (ret)
 861                                 *ret = c;
 862                         if (offset)
 863                                 *offset = cp;
 864                         return 1;
 865                 }
 866
 867                 r = next_with_matches(j, f, direction, &c, &cp);
 868                 if (r <= 0)
 869                         return r;
 870         }
 871 }
 872
 873 static int real_journal_next(sd_journal *j, direction_t direction) {
 874         JournalFile *f, *new_file = NULL;
 875         uint64_t new_offset = 0;
 876         uint64_t p = 0;
 877         Iterator i;
 878         Object *o;
 879         int r;
 880
 881         assert_return(j, -EINVAL);
 882         assert_return(!journal_pid_changed(j), -ECHILD);
 883
 884         HASHMAP_FOREACH(f, j->files, i) {
 885                 bool found;
 886
 887                 r = next_beyond_location(j, f, direction, &o, &p);
 888                 if (r < 0) {
 889                         log_debug("Can't iterate through %s, ignoring: %s", f->path, strerror(-r));
 890                         remove_file_real(j, f);
 891                         continue;
 892                 } else if (r == 0)
 893                         continue;
 894
 895                 if (!new_file)
 896                         found = true;
 897                 else {
 898                         int k;
 899
 900                         k = compare_entry_order(f, o, new_file, new_offset);
 901
 902                         found = direction == DIRECTION_DOWN ? k < 0 : k > 0;
 903                 }
 904
 905                 if (found) {
 906                         new_file = f;
 907                         new_offset = p;
 908                 }
 909         }
 910
 911         if (!new_file)
 912                 return 0;
 913
 914         r = journal_file_move_to_object(new_file, OBJECT_ENTRY, new_offset, &o);
 915         if (r < 0)
 916                 return r;
 917
 918         set_location(j, LOCATION_DISCRETE, new_file, o, direction, new_offset);
 919
 920         return 1;
 921 }
 922
 923 _public_ int sd_journal_next(sd_journal *j) {
 924         return real_journal_next(j, DIRECTION_DOWN);
 925 }
 926
 927 _public_ int sd_journal_previous(sd_journal *j) {
 928         return real_journal_next(j, DIRECTION_UP);
 929 }
 930
 931 static int real_journal_next_skip(sd_journal *j, direction_t direction, uint64_t skip) {
 932         int c = 0, r;
 933
 934         assert_return(j, -EINVAL);
 935         assert_return(!journal_pid_changed(j), -ECHILD);
 936
 937         if (skip == 0) {
 938                 /* If this is not a discrete skip, then at least
 939                  * resolve the current location */
 940                 if (j->current_location.type != LOCATION_DISCRETE)
 941                         return real_journal_next(j, direction);
 942
 943                 return 0;
 944         }
 945
 946         do {
 947                 r = real_journal_next(j, direction);
 948                 if (r < 0)
 949                         return r;
 950
 951                 if (r == 0)
 952                         return c;
 953
 954                 skip--;
 955                 c++;
 956         } while (skip > 0);
 957
 958         return c;
 959 }
 960
 961 _public_ int sd_journal_next_skip(sd_journal *j, uint64_t skip) {
 962         return real_journal_next_skip(j, DIRECTION_DOWN, skip);
 963 }
 964
 965 _public_ int sd_journal_previous_skip(sd_journal *j, uint64_t skip) {
 966         return real_journal_next_skip(j, DIRECTION_UP, skip);
 967 }
 968
 969 _public_ int sd_journal_get_cursor(sd_journal *j, char **cursor) {
 970         Object *o;
 971         int r;
 972         char bid[33], sid[33];
 973
 974         assert_return(j, -EINVAL);
 975         assert_return(!journal_pid_changed(j), -ECHILD);
 976         assert_return(cursor, -EINVAL);
 977
 978         if (!j->current_file || j->current_file->current_offset <= 0)
 979                 return -EADDRNOTAVAIL;
 980
 981         r = journal_file_move_to_object(j->current_file, OBJECT_ENTRY, j->current_file->current_offset, &o);
 982         if (r < 0)
 983                 return r;
 984
 985         sd_id128_to_string(j->current_file->header->seqnum_id, sid);
 986         sd_id128_to_string(o->entry.boot_id, bid);
 987
 988         if (asprintf(cursor,
 989                      "s=%s;i=%"PRIx64";b=%s;m=%"PRIx64";t=%"PRIx64";x=%"PRIx64,
 990                      sid, le64toh(o->entry.seqnum),
 991                      bid, le64toh(o->entry.monotonic),
 992                      le64toh(o->entry.realtime),
 993                      le64toh(o->entry.xor_hash)) < 0)
 994                 return -ENOMEM;
 995
 996         return 0;
 997 }
 998
 999 _public_ int sd_journal_seek_cursor(sd_journal *j, const char *cursor) {
1000         char *w, *state;
1001         size_t l;
1002         unsigned long long seqnum, monotonic, realtime, xor_hash;
1003         bool
1004                 seqnum_id_set = false,
1005                 seqnum_set = false,
1006                 boot_id_set = false,
1007                 monotonic_set = false,
1008                 realtime_set = false,
1009                 xor_hash_set = false;
1010         sd_id128_t seqnum_id, boot_id;
1011
1012         assert_return(j, -EINVAL);
1013         assert_return(!journal_pid_changed(j), -ECHILD);
1014         assert_return(!isempty(cursor), -EINVAL);
1015
1016         FOREACH_WORD_SEPARATOR(w, l, cursor, ";", state) {
1017                 char *item;
1018                 int k = 0;
1019
1020                 if (l < 2 || w[1] != '=')
1021                         return -EINVAL;
1022
1023                 item = strndup(w, l);
1024                 if (!item)
1025                         return -ENOMEM;
1026
1027                 switch (w[0]) {
1028
1029                 case 's':
1030                         seqnum_id_set = true;
1031                         k = sd_id128_from_string(item+2, &seqnum_id);
1032                         break;
1033
1034                 case 'i':
1035                         seqnum_set = true;
1036                         if (sscanf(item+2, "%llx", &seqnum) != 1)
1037                                 k = -EINVAL;
1038                         break;
1039
1040                 case 'b':
1041                         boot_id_set = true;
1042                         k = sd_id128_from_string(item+2, &boot_id);
1043                         break;
1044
1045                 case 'm':
1046                         monotonic_set = true;
1047                         if (sscanf(item+2, "%llx", &monotonic) != 1)
1048                                 k = -EINVAL;
1049                         break;
1050
1051                 case 't':
1052                         realtime_set = true;
1053                         if (sscanf(item+2, "%llx", &realtime) != 1)
1054                                 k = -EINVAL;
1055                         break;
1056
1057                 case 'x':
1058                         xor_hash_set = true;
1059                         if (sscanf(item+2, "%llx", &xor_hash) != 1)
1060                                 k = -EINVAL;
1061                         break;
1062                 }
1063
1064                 free(item);
1065
1066                 if (k < 0)
1067                         return k;
1068         }
1069
1070         if ((!seqnum_set || !seqnum_id_set) &&
1071             (!monotonic_set || !boot_id_set) &&
1072             !realtime_set)
1073                 return -EINVAL;
1074
1075         reset_location(j);
1076
1077         j->current_location.type = LOCATION_SEEK;
1078
1079         if (realtime_set) {
1080                 j->current_location.realtime = (uint64_t) realtime;
1081                 j->current_location.realtime_set = true;
1082         }
1083
1084         if (seqnum_set && seqnum_id_set) {
1085                 j->current_location.seqnum = (uint64_t) seqnum;
1086                 j->current_location.seqnum_id = seqnum_id;
1087                 j->current_location.seqnum_set = true;
1088         }
1089
1090         if (monotonic_set && boot_id_set) {
1091                 j->current_location.monotonic = (uint64_t) monotonic;
1092                 j->current_location.boot_id = boot_id;
1093                 j->current_location.monotonic_set = true;
1094         }
1095
1096         if (xor_hash_set) {
1097                 j->current_location.xor_hash = (uint64_t) xor_hash;
1098                 j->current_location.xor_hash_set = true;
1099         }
1100
1101         return 0;
1102 }
1103
1104 _public_ int sd_journal_test_cursor(sd_journal *j, const char *cursor) {
1105         int r;
1106         char *w, *state;
1107         size_t l;
1108         Object *o;
1109
1110         assert_return(j, -EINVAL);
1111         assert_return(!journal_pid_changed(j), -ECHILD);
1112         assert_return(!isempty(cursor), -EINVAL);
1113
1114         if (!j->current_file || j->current_file->current_offset <= 0)
1115                 return -EADDRNOTAVAIL;
1116
1117         r = journal_file_move_to_object(j->current_file, OBJECT_ENTRY, j->current_file->current_offset, &o);
1118         if (r < 0)
1119                 return r;
1120
1121         FOREACH_WORD_SEPARATOR(w, l, cursor, ";", state) {
1122                 _cleanup_free_ char *item = NULL;
1123                 sd_id128_t id;
1124                 unsigned long long ll;
1125                 int k = 0;
1126
1127                 if (l < 2 || w[1] != '=')
1128                         return -EINVAL;
1129
1130                 item = strndup(w, l);
1131                 if (!item)
1132                         return -ENOMEM;
1133
1134                 switch (w[0]) {
1135
1136                 case 's':
1137                         k = sd_id128_from_string(item+2, &id);
1138                         if (k < 0)
1139                                 return k;
1140                         if (!sd_id128_equal(id, j->current_file->header->seqnum_id))
1141                                 return 0;
1142                         break;
1143
1144                 case 'i':
1145                         if (sscanf(item+2, "%llx", &ll) != 1)
1146                                 return -EINVAL;
1147                         if (ll != le64toh(o->entry.seqnum))
1148                                 return 0;
1149                         break;
1150
1151                 case 'b':
1152                         k = sd_id128_from_string(item+2, &id);
1153                         if (k < 0)
1154                                 return k;
1155                         if (!sd_id128_equal(id, o->entry.boot_id))
1156                                 return 0;
1157                         break;
1158
1159                 case 'm':
1160                         if (sscanf(item+2, "%llx", &ll) != 1)
1161                                 return -EINVAL;
1162                         if (ll != le64toh(o->entry.monotonic))
1163                                 return 0;
1164                         break;
1165
1166                 case 't':
1167                         if (sscanf(item+2, "%llx", &ll) != 1)
1168                                 return -EINVAL;
1169                         if (ll != le64toh(o->entry.realtime))
1170                                 return 0;
1171                         break;
1172
1173                 case 'x':
1174                         if (sscanf(item+2, "%llx", &ll) != 1)
1175                                 return -EINVAL;
1176                         if (ll != le64toh(o->entry.xor_hash))
1177                                 return 0;
1178                         break;
1179                 }
1180         }
1181
1182         return 1;
1183 }
1184
1185
1186 _public_ int sd_journal_seek_monotonic_usec(sd_journal *j, sd_id128_t boot_id, uint64_t usec) {
1187         assert_return(j, -EINVAL);
1188         assert_return(!journal_pid_changed(j), -ECHILD);
1189
1190         reset_location(j);
1191         j->current_location.type = LOCATION_SEEK;
1192         j->current_location.boot_id = boot_id;
1193         j->current_location.monotonic = usec;
1194         j->current_location.monotonic_set = true;
1195
1196         return 0;
1197 }
1198
1199 _public_ int sd_journal_seek_realtime_usec(sd_journal *j, uint64_t usec) {
1200         assert_return(j, -EINVAL);
1201         assert_return(!journal_pid_changed(j), -ECHILD);
1202
1203         reset_location(j);
1204         j->current_location.type = LOCATION_SEEK;
1205         j->current_location.realtime = usec;
1206         j->current_location.realtime_set = true;
1207
1208         return 0;
1209 }
1210
1211 _public_ int sd_journal_seek_head(sd_journal *j) {
1212         assert_return(j, -EINVAL);
1213         assert_return(!journal_pid_changed(j), -ECHILD);
1214
1215         reset_location(j);
1216         j->current_location.type = LOCATION_HEAD;
1217
1218         return 0;
1219 }
1220
1221 _public_ int sd_journal_seek_tail(sd_journal *j) {
1222         assert_return(j, -EINVAL);
1223         assert_return(!journal_pid_changed(j), -ECHILD);
1224
1225         reset_location(j);
1226         j->current_location.type = LOCATION_TAIL;
1227
1228         return 0;
1229 }
1230
1231 static void check_network(sd_journal *j, int fd) {
1232         struct statfs sfs;
1233
1234         assert(j);
1235
1236         if (j->on_network)
1237                 return;
1238
1239         if (fstatfs(fd, &sfs) < 0)
1240                 return;
1241
1242         j->on_network =
1243                 F_TYPE_EQUAL(sfs.f_type, CIFS_MAGIC_NUMBER) ||
1244                 F_TYPE_EQUAL(sfs.f_type, CODA_SUPER_MAGIC) ||
1245                 F_TYPE_EQUAL(sfs.f_type, NCP_SUPER_MAGIC) ||
1246                 F_TYPE_EQUAL(sfs.f_type, NFS_SUPER_MAGIC) ||
1247                 F_TYPE_EQUAL(sfs.f_type, SMB_SUPER_MAGIC);
1248 }
1249
1250 static bool file_has_type_prefix(const char *prefix, const char *filename) {
1251         const char *full, *tilded, *atted;
1252
1253         full = strappenda(prefix, ".journal");
1254         tilded = strappenda(full, "~");
1255         atted = strappenda(prefix, "@");
1256
1257         return streq(filename, full) ||
1258                streq(filename, tilded) ||
1259                startswith(filename, atted);
1260 }
1261
1262 static bool file_type_wanted(int flags, const char *filename) {
1263         if (!endswith(filename, ".journal") && !endswith(filename, ".journal~"))
1264                 return false;
1265
1266         /* no flags set → every type is OK */
1267         if (!(flags & (SD_JOURNAL_SYSTEM | SD_JOURNAL_CURRENT_USER)))
1268                 return true;
1269
1270         if (flags & SD_JOURNAL_SYSTEM && file_has_type_prefix("system", filename))
1271                 return true;
1272
1273         if (flags & SD_JOURNAL_CURRENT_USER) {
1274                 char prefix[5 + DECIMAL_STR_MAX(uid_t) + 1];
1275
1276                 assert_se(snprintf(prefix, sizeof(prefix), "user-"UID_FMT, getuid())
1277                           < (int) sizeof(prefix));
1278
1279                 if (file_has_type_prefix(prefix, filename))
1280                         return true;
1281         }
1282
1283         return false;
1284 }
1285
1286 static int add_any_file(sd_journal *j, const char *path) {
1287         JournalFile *f = NULL;
1288         int r;
1289
1290         assert(j);
1291         assert(path);
1292
1293         if (hashmap_get(j->files, path))
1294                 return 0;
1295
1296         if (hashmap_size(j->files) >= JOURNAL_FILES_MAX) {
1297                 log_warning("Too many open journal files, not adding %s.", path);
1298                 return set_put_error(j, -ETOOMANYREFS);
1299         }
1300
1301         r = journal_file_open(path, O_RDONLY, 0, false, false, NULL, j->mmap, NULL, &f);
1302         if (r < 0)
1303                 return r;
1304
1305         /* journal_file_dump(f); */
1306
1307         r = hashmap_put(j->files, f->path, f);
1308         if (r < 0) {
1309                 journal_file_close(f);
1310                 return r;
1311         }
1312
1313         log_debug("File %s added.", f->path);
1314
1315         check_network(j, f->fd);
1316
1317         j->current_invalidate_counter ++;
1318
1319         return 0;
1320 }
1321
1322 static int add_file(sd_journal *j, const char *prefix, const char *filename) {
1323         _cleanup_free_ char *path = NULL;
1324         int r;
1325
1326         assert(j);
1327         assert(prefix);
1328         assert(filename);
1329
1330         if (j->no_new_files ||
1331             !file_type_wanted(j->flags, filename))
1332                 return 0;
1333
1334         path = strjoin(prefix, "/", filename, NULL);
1335         if (!path)
1336                 return -ENOMEM;
1337
1338         r = add_any_file(j, path);
1339         if (r == -ENOENT)
1340                 return 0;
1341         return 0;
1342 }
1343
1344 static int remove_file(sd_journal *j, const char *prefix, const char *filename) {
1345         _cleanup_free_ char *path;
1346         JournalFile *f;
1347
1348         assert(j);
1349         assert(prefix);
1350         assert(filename);
1351
1352         path = strjoin(prefix, "/", filename, NULL);
1353         if (!path)
1354                 return -ENOMEM;
1355
1356         f = hashmap_get(j->files, path);
1357         if (!f)
1358                 return 0;
1359
1360         remove_file_real(j, f);
1361         return 0;
1362 }
1363
1364 static void remove_file_real(sd_journal *j, JournalFile *f) {
1365         assert(j);
1366         assert(f);
1367
1368         hashmap_remove(j->files, f->path);
1369
1370         log_debug("File %s removed.", f->path);
1371
1372         if (j->current_file == f) {
1373                 j->current_file = NULL;
1374                 j->current_field = 0;
1375         }
1376
1377         if (j->unique_file == f) {
1378                 j->unique_file = NULL;
1379                 j->unique_offset = 0;
1380         }
1381
1382         journal_file_close(f);
1383
1384         j->current_invalidate_counter ++;
1385 }
1386
1387 static int add_directory(sd_journal *j, const char *prefix, const char *dirname) {
1388         _cleanup_free_ char *path = NULL;
1389         int r;
1390         _cleanup_closedir_ DIR *d = NULL;
1391         sd_id128_t id, mid;
1392         Directory *m;
1393
1394         assert(j);
1395         assert(prefix);
1396         assert(dirname);
1397
1398         log_debug("Considering %s/%s.", prefix, dirname);
1399
1400         if ((j->flags & SD_JOURNAL_LOCAL_ONLY) &&
1401             (sd_id128_from_string(dirname, &id) < 0 ||
1402              sd_id128_get_machine(&mid) < 0 ||
1403              !(sd_id128_equal(id, mid) || path_startswith(prefix, "/run"))))
1404             return 0;
1405
1406         path = strjoin(prefix, "/", dirname, NULL);
1407         if (!path)
1408                 return -ENOMEM;
1409
1410         d = opendir(path);
1411         if (!d) {
1412                 log_debug("Failed to open %s: %m", path);
1413                 if (errno == ENOENT)
1414                         return 0;
1415                 return -errno;
1416         }
1417
1418         m = hashmap_get(j->directories_by_path, path);
1419         if (!m) {
1420                 m = new0(Directory, 1);
1421                 if (!m)
1422                         return -ENOMEM;
1423
1424                 m->is_root = false;
1425                 m->path = path;
1426
1427                 if (hashmap_put(j->directories_by_path, m->path, m) < 0) {
1428                         free(m);
1429                         return -ENOMEM;
1430                 }
1431
1432                 path = NULL; /* avoid freeing in cleanup */
1433                 j->current_invalidate_counter ++;
1434
1435                 log_debug("Directory %s added.", m->path);
1436
1437         } else if (m->is_root)
1438                 return 0;
1439
1440         if (m->wd <= 0 && j->inotify_fd >= 0) {
1441
1442                 m->wd = inotify_add_watch(j->inotify_fd, m->path,
1443                                           IN_CREATE|IN_MOVED_TO|IN_MODIFY|IN_ATTRIB|IN_DELETE|
1444                                           IN_DELETE_SELF|IN_MOVE_SELF|IN_UNMOUNT|IN_MOVED_FROM|
1445                                           IN_ONLYDIR);
1446
1447                 if (m->wd > 0 && hashmap_put(j->directories_by_wd, INT_TO_PTR(m->wd), m) < 0)
1448                         inotify_rm_watch(j->inotify_fd, m->wd);
1449         }
1450
1451         for (;;) {
1452                 struct dirent *de;
1453
1454                 errno = 0;
1455                 de = readdir(d);
1456                 if (!de && errno != 0) {
1457                         r = -errno;
1458                         log_debug("Failed to read directory %s: %m", m->path);
1459                         return r;
1460                 }
1461                 if (!de)
1462                         break;
1463
1464                 if (dirent_is_file_with_suffix(de, ".journal") ||
1465                     dirent_is_file_with_suffix(de, ".journal~")) {
1466                         r = add_file(j, m->path, de->d_name);
1467                         if (r < 0) {
1468                                 log_debug("Failed to add file %s/%s: %s",
1469                                           m->path, de->d_name, strerror(-r));
1470                                 r = set_put_error(j, r);
1471                                 if (r < 0)
1472                                         return r;
1473                         }
1474                 }
1475         }
1476
1477         check_network(j, dirfd(d));
1478
1479         return 0;
1480 }
1481
1482 static int add_root_directory(sd_journal *j, const char *p) {
1483         _cleanup_closedir_ DIR *d = NULL;
1484         Directory *m;
1485         int r;
1486
1487         assert(j);
1488         assert(p);
1489
1490         if ((j->flags & SD_JOURNAL_RUNTIME_ONLY) &&
1491             !path_startswith(p, "/run"))
1492                 return -EINVAL;
1493
1494         if (j->prefix)
1495                 p = strappenda(j->prefix, p);
1496
1497         d = opendir(p);
1498         if (!d)
1499                 return -errno;
1500
1501         m = hashmap_get(j->directories_by_path, p);
1502         if (!m) {
1503                 m = new0(Directory, 1);
1504                 if (!m)
1505                         return -ENOMEM;
1506
1507                 m->is_root = true;
1508                 m->path = strdup(p);
1509                 if (!m->path) {
1510                         free(m);
1511                         return -ENOMEM;
1512                 }
1513
1514                 if (hashmap_put(j->directories_by_path, m->path, m) < 0) {
1515                         free(m->path);
1516                         free(m);
1517                         return -ENOMEM;
1518                 }
1519
1520                 j->current_invalidate_counter ++;
1521
1522                 log_debug("Root directory %s added.", m->path);
1523
1524         } else if (!m->is_root)
1525                 return 0;
1526
1527         if (m->wd <= 0 && j->inotify_fd >= 0) {
1528
1529                 m->wd = inotify_add_watch(j->inotify_fd, m->path,
1530                                           IN_CREATE|IN_MOVED_TO|IN_MODIFY|IN_ATTRIB|IN_DELETE|
1531                                           IN_ONLYDIR);
1532
1533                 if (m->wd > 0 && hashmap_put(j->directories_by_wd, INT_TO_PTR(m->wd), m) < 0)
1534                         inotify_rm_watch(j->inotify_fd, m->wd);
1535         }
1536
1537         if (j->no_new_files)
1538                 return 0;
1539
1540         for (;;) {
1541                 struct dirent *de;
1542                 sd_id128_t id;
1543
1544                 errno = 0;
1545                 de = readdir(d);
1546                 if (!de && errno != 0) {
1547                         r = -errno;
1548                         log_debug("Failed to read directory %s: %m", m->path);
1549                         return r;
1550                 }
1551                 if (!de)
1552                         break;
1553
1554                 if (dirent_is_file_with_suffix(de, ".journal") ||
1555                     dirent_is_file_with_suffix(de, ".journal~")) {
1556                         r = add_file(j, m->path, de->d_name);
1557                         if (r < 0) {
1558                                 log_debug("Failed to add file %s/%s: %s",
1559                                           m->path, de->d_name, strerror(-r));
1560                                 r = set_put_error(j, r);
1561                                 if (r < 0)
1562                                         return r;
1563                         }
1564                 } else if ((de->d_type == DT_DIR || de->d_type == DT_LNK || de->d_type == DT_UNKNOWN) &&
1565                            sd_id128_from_string(de->d_name, &id) >= 0) {
1566
1567                         r = add_directory(j, m->path, de->d_name);
1568                         if (r < 0)
1569                                 log_debug("Failed to add directory %s/%s: %s", m->path, de->d_name, strerror(-r));
1570                 }
1571         }
1572
1573         check_network(j, dirfd(d));
1574
1575         return 0;
1576 }
1577
1578 static int remove_directory(sd_journal *j, Directory *d) {
1579         assert(j);
1580
1581         if (d->wd > 0) {
1582                 hashmap_remove(j->directories_by_wd, INT_TO_PTR(d->wd));
1583
1584                 if (j->inotify_fd >= 0)
1585                         inotify_rm_watch(j->inotify_fd, d->wd);
1586         }
1587
1588         hashmap_remove(j->directories_by_path, d->path);
1589
1590         if (d->is_root)
1591                 log_debug("Root directory %s removed.", d->path);
1592         else
1593                 log_debug("Directory %s removed.", d->path);
1594
1595         free(d->path);
1596         free(d);
1597
1598         return 0;
1599 }
1600
1601 static int add_search_paths(sd_journal *j) {
1602         int r;
1603         const char search_paths[] =
1604                 "/run/log/journal\0"
1605                 "/var/log/journal\0";
1606         const char *p;
1607
1608         assert(j);
1609
1610         /* We ignore most errors here, since the idea is to only open
1611          * what's actually accessible, and ignore the rest. */
1612
1613         NULSTR_FOREACH(p, search_paths) {
1614                 r = add_root_directory(j, p);
1615                 if (r < 0 && r != -ENOENT) {
1616                         r = set_put_error(j, r);
1617                         if (r < 0)
1618                                 return r;
1619                 }
1620         }
1621
1622         return 0;
1623 }
1624
1625 static int add_current_paths(sd_journal *j) {
1626         Iterator i;
1627         JournalFile *f;
1628
1629         assert(j);
1630         assert(j->no_new_files);
1631
1632         /* Simply adds all directories for files we have open as
1633          * "root" directories. We don't expect errors here, so we
1634          * treat them as fatal. */
1635
1636         HASHMAP_FOREACH(f, j->files, i) {
1637                 _cleanup_free_ char *dir;
1638                 int r;
1639
1640                 dir = dirname_malloc(f->path);
1641                 if (!dir)
1642                         return -ENOMEM;
1643
1644                 r = add_root_directory(j, dir);
1645                 if (r < 0) {
1646                         set_put_error(j, r);
1647                         return r;
1648                 }
1649         }
1650
1651         return 0;
1652 }
1653
1654
1655 static int allocate_inotify(sd_journal *j) {
1656         assert(j);
1657
1658         if (j->inotify_fd < 0) {
1659                 j->inotify_fd = inotify_init1(IN_NONBLOCK|IN_CLOEXEC);
1660                 if (j->inotify_fd < 0)
1661                         return -errno;
1662         }
1663
1664         if (!j->directories_by_wd) {
1665                 j->directories_by_wd = hashmap_new(trivial_hash_func, trivial_compare_func);
1666                 if (!j->directories_by_wd)
1667                         return -ENOMEM;
1668         }
1669
1670         return 0;
1671 }
1672
1673 static sd_journal *journal_new(int flags, const char *path) {
1674         sd_journal *j;
1675
1676         j = new0(sd_journal, 1);
1677         if (!j)
1678                 return NULL;
1679
1680         j->original_pid = getpid();
1681         j->inotify_fd = -1;
1682         j->flags = flags;
1683         j->data_threshold = DEFAULT_DATA_THRESHOLD;
1684
1685         if (path) {
1686                 j->path = strdup(path);
1687                 if (!j->path)
1688                         goto fail;
1689         }
1690
1691         j->files = hashmap_new(string_hash_func, string_compare_func);
1692         j->directories_by_path = hashmap_new(string_hash_func, string_compare_func);
1693         j->mmap = mmap_cache_new();
1694         if (!j->files || !j->directories_by_path || !j->mmap)
1695                 goto fail;
1696
1697         return j;
1698
1699 fail:
1700         sd_journal_close(j);
1701         return NULL;
1702 }
1703
1704 _public_ int sd_journal_open(sd_journal **ret, int flags) {
1705         sd_journal *j;
1706         int r;
1707
1708         assert_return(ret, -EINVAL);
1709         assert_return((flags & ~(SD_JOURNAL_LOCAL_ONLY|SD_JOURNAL_RUNTIME_ONLY|SD_JOURNAL_SYSTEM|SD_JOURNAL_CURRENT_USER)) == 0, -EINVAL);
1710
1711         j = journal_new(flags, NULL);
1712         if (!j)
1713                 return -ENOMEM;
1714
1715         r = add_search_paths(j);
1716         if (r < 0)
1717                 goto fail;
1718
1719         *ret = j;
1720         return 0;
1721
1722 fail:
1723         sd_journal_close(j);
1724
1725         return r;
1726 }
1727
1728 _public_ int sd_journal_open_container(sd_journal **ret, const char *machine, int flags) {
1729         _cleanup_free_ char *root = NULL, *class = NULL;
1730         sd_journal *j;
1731         char *p;
1732         int r;
1733
1734         assert_return(machine, -EINVAL);
1735         assert_return(ret, -EINVAL);
1736         assert_return((flags & ~(SD_JOURNAL_LOCAL_ONLY|SD_JOURNAL_SYSTEM)) == 0, -EINVAL);
1737         assert_return(filename_is_safe(machine), -EINVAL);
1738
1739         p = strappenda("/run/systemd/machines/", machine);
1740         r = parse_env_file(p, NEWLINE, "ROOT", &root, "CLASS", &class, NULL);
1741         if (r == -ENOENT)
1742                 return -EHOSTDOWN;
1743         if (r < 0)
1744                 return r;
1745         if (!root)
1746                 return -ENODATA;
1747
1748         if (!streq_ptr(class, "container"))
1749                 return -EIO;
1750
1751         j = journal_new(flags, NULL);
1752         if (!j)
1753                 return -ENOMEM;
1754
1755         j->prefix = root;
1756         root = NULL;
1757
1758         r = add_search_paths(j);
1759         if (r < 0)
1760                 goto fail;
1761
1762         *ret = j;
1763         return 0;
1764
1765 fail:
1766         sd_journal_close(j);
1767         return r;
1768 }
1769
1770 _public_ int sd_journal_open_directory(sd_journal **ret, const char *path, int flags) {
1771         sd_journal *j;
1772         int r;
1773
1774         assert_return(ret, -EINVAL);
1775         assert_return(path, -EINVAL);
1776         assert_return(flags == 0, -EINVAL);
1777
1778         j = journal_new(flags, path);
1779         if (!j)
1780                 return -ENOMEM;
1781
1782         r = add_root_directory(j, path);
1783         if (r < 0) {
1784                 set_put_error(j, r);
1785                 goto fail;
1786         }
1787
1788         *ret = j;
1789         return 0;
1790
1791 fail:
1792         sd_journal_close(j);
1793
1794         return r;
1795 }
1796
1797 _public_ int sd_journal_open_files(sd_journal **ret, const char **paths, int flags) {
1798         sd_journal *j;
1799         const char **path;
1800         int r;
1801
1802         assert_return(ret, -EINVAL);
1803         assert_return(flags == 0, -EINVAL);
1804
1805         j = journal_new(flags, NULL);
1806         if (!j)
1807                 return -ENOMEM;
1808
1809         STRV_FOREACH(path, paths) {
1810                 r = add_any_file(j, *path);
1811                 if (r < 0) {
1812                         log_error("Failed to open %s: %s", *path, strerror(-r));
1813                         goto fail;
1814                 }
1815         }
1816
1817         j->no_new_files = true;
1818
1819         *ret = j;
1820         return 0;
1821
1822 fail:
1823         sd_journal_close(j);
1824
1825         return r;
1826 }
1827
1828 _public_ void sd_journal_close(sd_journal *j) {
1829         Directory *d;
1830         JournalFile *f;
1831
1832         if (!j)
1833                 return;
1834
1835         sd_journal_flush_matches(j);
1836
1837         while ((f = hashmap_steal_first(j->files)))
1838                 journal_file_close(f);
1839
1840         hashmap_free(j->files);
1841
1842         while ((d = hashmap_first(j->directories_by_path)))
1843                 remove_directory(j, d);
1844
1845         while ((d = hashmap_first(j->directories_by_wd)))
1846                 remove_directory(j, d);
1847
1848         hashmap_free(j->directories_by_path);
1849         hashmap_free(j->directories_by_wd);
1850
1851         safe_close(j->inotify_fd);
1852
1853         if (j->mmap) {
1854                 log_debug("mmap cache statistics: %u hit, %u miss", mmap_cache_get_hit(j->mmap), mmap_cache_get_missed(j->mmap));
1855                 mmap_cache_unref(j->mmap);
1856         }
1857
1858         free(j->path);
1859         free(j->prefix);
1860         free(j->unique_field);
1861         set_free(j->errors);
1862         free(j);
1863 }
1864
1865 _public_ int sd_journal_get_realtime_usec(sd_journal *j, uint64_t *ret) {
1866         Object *o;
1867         JournalFile *f;
1868         int r;
1869
1870         assert_return(j, -EINVAL);
1871         assert_return(!journal_pid_changed(j), -ECHILD);
1872         assert_return(ret, -EINVAL);
1873
1874         f = j->current_file;
1875         if (!f)
1876                 return -EADDRNOTAVAIL;
1877
1878         if (f->current_offset <= 0)
1879                 return -EADDRNOTAVAIL;
1880
1881         r = journal_file_move_to_object(f, OBJECT_ENTRY, f->current_offset, &o);
1882         if (r < 0)
1883                 return r;
1884
1885         *ret = le64toh(o->entry.realtime);
1886         return 0;
1887 }
1888
1889 _public_ int sd_journal_get_monotonic_usec(sd_journal *j, uint64_t *ret, sd_id128_t *ret_boot_id) {
1890         Object *o;
1891         JournalFile *f;
1892         int r;
1893         sd_id128_t id;
1894
1895         assert_return(j, -EINVAL);
1896         assert_return(!journal_pid_changed(j), -ECHILD);
1897
1898         f = j->current_file;
1899         if (!f)
1900                 return -EADDRNOTAVAIL;
1901
1902         if (f->current_offset <= 0)
1903                 return -EADDRNOTAVAIL;
1904
1905         r = journal_file_move_to_object(f, OBJECT_ENTRY, f->current_offset, &o);
1906         if (r < 0)
1907                 return r;
1908
1909         if (ret_boot_id)
1910                 *ret_boot_id = o->entry.boot_id;
1911         else {
1912                 r = sd_id128_get_boot(&id);
1913                 if (r < 0)
1914                         return r;
1915
1916                 if (!sd_id128_equal(id, o->entry.boot_id))
1917                         return -ESTALE;
1918         }
1919
1920         if (ret)
1921                 *ret = le64toh(o->entry.monotonic);
1922
1923         return 0;
1924 }
1925
1926 static bool field_is_valid(const char *field) {
1927         const char *p;
1928
1929         assert(field);
1930
1931         if (isempty(field))
1932                 return false;
1933
1934         if (startswith(field, "__"))
1935                 return false;
1936
1937         for (p = field; *p; p++) {
1938
1939                 if (*p == '_')
1940                         continue;
1941
1942                 if (*p >= 'A' && *p <= 'Z')
1943                         continue;
1944
1945                 if (*p >= '0' && *p <= '9')
1946                         continue;
1947
1948                 return false;
1949         }
1950
1951         return true;
1952 }
1953
1954 _public_ int sd_journal_get_data(sd_journal *j, const char *field, const void **data, size_t *size) {
1955         JournalFile *f;
1956         uint64_t i, n;
1957         size_t field_length;
1958         int r;
1959         Object *o;
1960
1961         assert_return(j, -EINVAL);
1962         assert_return(!journal_pid_changed(j), -ECHILD);
1963         assert_return(field, -EINVAL);
1964         assert_return(data, -EINVAL);
1965         assert_return(size, -EINVAL);
1966         assert_return(field_is_valid(field), -EINVAL);
1967
1968         f = j->current_file;
1969         if (!f)
1970                 return -EADDRNOTAVAIL;
1971
1972         if (f->current_offset <= 0)
1973                 return -EADDRNOTAVAIL;
1974
1975         r = journal_file_move_to_object(f, OBJECT_ENTRY, f->current_offset, &o);
1976         if (r < 0)
1977                 return r;
1978
1979         field_length = strlen(field);
1980
1981         n = journal_file_entry_n_items(o);
1982         for (i = 0; i < n; i++) {
1983                 uint64_t p, l;
1984                 le64_t le_hash;
1985                 size_t t;
1986
1987                 p = le64toh(o->entry.items[i].object_offset);
1988                 le_hash = o->entry.items[i].hash;
1989                 r = journal_file_move_to_object(f, OBJECT_DATA, p, &o);
1990                 if (r < 0)
1991                         return r;
1992
1993                 if (le_hash != o->data.hash)
1994                         return -EBADMSG;
1995
1996                 l = le64toh(o->object.size) - offsetof(Object, data.payload);
1997
1998                 if (o->object.flags & OBJECT_COMPRESSED) {
1999
2000 #ifdef HAVE_XZ
2001                         if (uncompress_startswith(o->data.payload, l,
2002                                                   &f->compress_buffer, &f->compress_buffer_size,
2003                                                   field, field_length, '=')) {
2004
2005                                 uint64_t rsize;
2006
2007                                 if (!uncompress_blob(o->data.payload, l,
2008                                                      &f->compress_buffer, &f->compress_buffer_size, &rsize,
2009                                                      j->data_threshold))
2010                                         return -EBADMSG;
2011
2012                                 *data = f->compress_buffer;
2013                                 *size = (size_t) rsize;
2014
2015                                 return 0;
2016                         }
2017 #else
2018                         return -EPROTONOSUPPORT;
2019 #endif
2020
2021                 } else if (l >= field_length+1 &&
2022                            memcmp(o->data.payload, field, field_length) == 0 &&
2023                            o->data.payload[field_length] == '=') {
2024
2025                         t = (size_t) l;
2026
2027                         if ((uint64_t) t != l)
2028                                 return -E2BIG;
2029
2030                         *data = o->data.payload;
2031                         *size = t;
2032
2033                         return 0;
2034                 }
2035
2036                 r = journal_file_move_to_object(f, OBJECT_ENTRY, f->current_offset, &o);
2037                 if (r < 0)
2038                         return r;
2039         }
2040
2041         return -ENOENT;
2042 }
2043
2044 static int return_data(sd_journal *j, JournalFile *f, Object *o, const void **data, size_t *size) {
2045         size_t t;
2046         uint64_t l;
2047
2048         l = le64toh(o->object.size) - offsetof(Object, data.payload);
2049         t = (size_t) l;
2050
2051         /* We can't read objects larger than 4G on a 32bit machine */
2052         if ((uint64_t) t != l)
2053                 return -E2BIG;
2054
2055         if (o->object.flags & OBJECT_COMPRESSED) {
2056 #ifdef HAVE_XZ
2057                 uint64_t rsize;
2058
2059                 if (!uncompress_blob(o->data.payload, l, &f->compress_buffer, &f->compress_buffer_size, &rsize, j->data_threshold))
2060                         return -EBADMSG;
2061
2062                 *data = f->compress_buffer;
2063                 *size = (size_t) rsize;
2064 #else
2065                 return -EPROTONOSUPPORT;
2066 #endif
2067         } else {
2068                 *data = o->data.payload;
2069                 *size = t;
2070         }
2071
2072         return 0;
2073 }
2074
2075 _public_ int sd_journal_enumerate_data(sd_journal *j, const void **data, size_t *size) {
2076         JournalFile *f;
2077         uint64_t p, n;
2078         le64_t le_hash;
2079         int r;
2080         Object *o;
2081
2082         assert_return(j, -EINVAL);
2083         assert_return(!journal_pid_changed(j), -ECHILD);
2084         assert_return(data, -EINVAL);
2085         assert_return(size, -EINVAL);
2086
2087         f = j->current_file;
2088         if (!f)
2089                 return -EADDRNOTAVAIL;
2090
2091         if (f->current_offset <= 0)
2092                 return -EADDRNOTAVAIL;
2093
2094         r = journal_file_move_to_object(f, OBJECT_ENTRY, f->current_offset, &o);
2095         if (r < 0)
2096                 return r;
2097
2098         n = journal_file_entry_n_items(o);
2099         if (j->current_field >= n)
2100                 return 0;
2101
2102         p = le64toh(o->entry.items[j->current_field].object_offset);
2103         le_hash = o->entry.items[j->current_field].hash;
2104         r = journal_file_move_to_object(f, OBJECT_DATA, p, &o);
2105         if (r < 0)
2106                 return r;
2107
2108         if (le_hash != o->data.hash)
2109                 return -EBADMSG;
2110
2111         r = return_data(j, f, o, data, size);
2112         if (r < 0)
2113                 return r;
2114
2115         j->current_field ++;
2116
2117         return 1;
2118 }
2119
2120 _public_ void sd_journal_restart_data(sd_journal *j) {
2121         if (!j)
2122                 return;
2123
2124         j->current_field = 0;
2125 }
2126
2127 _public_ int sd_journal_get_fd(sd_journal *j) {
2128         int r;
2129
2130         assert_return(j, -EINVAL);
2131         assert_return(!journal_pid_changed(j), -ECHILD);
2132
2133         if (j->inotify_fd >= 0)
2134                 return j->inotify_fd;
2135
2136         r = allocate_inotify(j);
2137         if (r < 0)
2138                 return r;
2139
2140         /* Iterate through all dirs again, to add them to the
2141          * inotify */
2142         if (j->no_new_files)
2143                 r = add_current_paths(j);
2144         else if (j->path)
2145                 r = add_root_directory(j, j->path);
2146         else
2147                 r = add_search_paths(j);
2148         if (r < 0)
2149                 return r;
2150
2151         return j->inotify_fd;
2152 }
2153
2154 _public_ int sd_journal_get_events(sd_journal *j) {
2155         int fd;
2156
2157         assert_return(j, -EINVAL);
2158         assert_return(!journal_pid_changed(j), -ECHILD);
2159
2160         fd = sd_journal_get_fd(j);
2161         if (fd < 0)
2162                 return fd;
2163
2164         return POLLIN;
2165 }
2166
2167 _public_ int sd_journal_get_timeout(sd_journal *j, uint64_t *timeout_usec) {
2168         int fd;
2169
2170         assert_return(j, -EINVAL);
2171         assert_return(!journal_pid_changed(j), -ECHILD);
2172         assert_return(timeout_usec, -EINVAL);
2173
2174         fd = sd_journal_get_fd(j);
2175         if (fd < 0)
2176                 return fd;
2177
2178         if (!j->on_network) {
2179                 *timeout_usec = (uint64_t) -1;
2180                 return 0;
2181         }
2182
2183         /* If we are on the network we need to regularly check for
2184          * changes manually */
2185
2186         *timeout_usec = j->last_process_usec + JOURNAL_FILES_RECHECK_USEC;
2187         return 1;
2188 }
2189
2190 static void process_inotify_event(sd_journal *j, struct inotify_event *e) {
2191         Directory *d;
2192         int r;
2193
2194         assert(j);
2195         assert(e);
2196
2197         /* Is this a subdirectory we watch? */
2198         d = hashmap_get(j->directories_by_wd, INT_TO_PTR(e->wd));
2199         if (d) {
2200                 sd_id128_t id;
2201
2202                 if (!(e->mask & IN_ISDIR) && e->len > 0 &&
2203                     (endswith(e->name, ".journal") ||
2204                      endswith(e->name, ".journal~"))) {
2205
2206                         /* Event for a journal file */
2207
2208                         if (e->mask & (IN_CREATE|IN_MOVED_TO|IN_MODIFY|IN_ATTRIB)) {
2209                                 r = add_file(j, d->path, e->name);
2210                                 if (r < 0) {
2211                                         log_debug("Failed to add file %s/%s: %s",
2212                                                   d->path, e->name, strerror(-r));
2213                                         set_put_error(j, r);
2214                                 }
2215
2216                         } else if (e->mask & (IN_DELETE|IN_MOVED_FROM|IN_UNMOUNT)) {
2217
2218                                 r = remove_file(j, d->path, e->name);
2219                                 if (r < 0)
2220                                         log_debug("Failed to remove file %s/%s: %s", d->path, e->name, strerror(-r));
2221                         }
2222
2223                 } else if (!d->is_root && e->len == 0) {
2224
2225                         /* Event for a subdirectory */
2226
2227                         if (e->mask & (IN_DELETE_SELF|IN_MOVE_SELF|IN_UNMOUNT)) {
2228                                 r = remove_directory(j, d);
2229                                 if (r < 0)
2230                                         log_debug("Failed to remove directory %s: %s", d->path, strerror(-r));
2231                         }
2232
2233
2234                 } else if (d->is_root && (e->mask & IN_ISDIR) && e->len > 0 && sd_id128_from_string(e->name, &id) >= 0) {
2235
2236                         /* Event for root directory */
2237
2238                         if (e->mask & (IN_CREATE|IN_MOVED_TO|IN_MODIFY|IN_ATTRIB)) {
2239                                 r = add_directory(j, d->path, e->name);
2240                                 if (r < 0)
2241                                         log_debug("Failed to add directory %s/%s: %s", d->path, e->name, strerror(-r));
2242                         }
2243                 }
2244
2245                 return;
2246         }
2247
2248         if (e->mask & IN_IGNORED)
2249                 return;
2250
2251         log_warning("Unknown inotify event.");
2252 }
2253
2254 static int determine_change(sd_journal *j) {
2255         bool b;
2256
2257         assert(j);
2258
2259         b = j->current_invalidate_counter != j->last_invalidate_counter;
2260         j->last_invalidate_counter = j->current_invalidate_counter;
2261
2262         return b ? SD_JOURNAL_INVALIDATE : SD_JOURNAL_APPEND;
2263 }
2264
2265 _public_ int sd_journal_process(sd_journal *j) {
2266         uint8_t buffer[sizeof(struct inotify_event) + FILENAME_MAX] _alignas_(struct inotify_event);
2267         bool got_something = false;
2268
2269         assert_return(j, -EINVAL);
2270         assert_return(!journal_pid_changed(j), -ECHILD);
2271
2272         j->last_process_usec = now(CLOCK_MONOTONIC);
2273
2274         for (;;) {
2275                 struct inotify_event *e;
2276                 ssize_t l;
2277
2278                 l = read(j->inotify_fd, buffer, sizeof(buffer));
2279                 if (l < 0) {
2280                         if (errno == EAGAIN || errno == EINTR)
2281                                 return got_something ? determine_change(j) : SD_JOURNAL_NOP;
2282
2283                         return -errno;
2284                 }
2285
2286                 got_something = true;
2287
2288                 e = (struct inotify_event*) buffer;
2289                 while (l > 0) {
2290                         size_t step;
2291
2292                         process_inotify_event(j, e);
2293
2294                         step = sizeof(struct inotify_event) + e->len;
2295                         assert(step <= (size_t) l);
2296
2297                         e = (struct inotify_event*) ((uint8_t*) e + step);
2298                         l -= step;
2299                 }
2300         }
2301 }
2302
2303 _public_ int sd_journal_wait(sd_journal *j, uint64_t timeout_usec) {
2304         int r;
2305         uint64_t t;
2306
2307         assert_return(j, -EINVAL);
2308         assert_return(!journal_pid_changed(j), -ECHILD);
2309
2310         if (j->inotify_fd < 0) {
2311
2312                 /* This is the first invocation, hence create the
2313                  * inotify watch */
2314                 r = sd_journal_get_fd(j);
2315                 if (r < 0)
2316                         return r;
2317
2318                 /* The journal might have changed since the context
2319                  * object was created and we weren't watching before,
2320                  * hence don't wait for anything, and return
2321                  * immediately. */
2322                 return determine_change(j);
2323         }
2324
2325         r = sd_journal_get_timeout(j, &t);
2326         if (r < 0)
2327                 return r;
2328
2329         if (t != (uint64_t) -1) {
2330                 usec_t n;
2331
2332                 n = now(CLOCK_MONOTONIC);
2333                 t = t > n ? t - n : 0;
2334
2335                 if (timeout_usec == (uint64_t) -1 || timeout_usec > t)
2336                         timeout_usec = t;
2337         }
2338
2339         do {
2340                 r = fd_wait_for_event(j->inotify_fd, POLLIN, timeout_usec);
2341         } while (r == -EINTR);
2342
2343         if (r < 0)
2344                 return r;
2345
2346         return sd_journal_process(j);
2347 }
2348
2349 _public_ int sd_journal_get_cutoff_realtime_usec(sd_journal *j, uint64_t *from, uint64_t *to) {
2350         Iterator i;
2351         JournalFile *f;
2352         bool first = true;
2353         uint64_t fmin = 0, tmax = 0;
2354         int r;
2355
2356         assert_return(j, -EINVAL);
2357         assert_return(!journal_pid_changed(j), -ECHILD);
2358         assert_return(from || to, -EINVAL);
2359         assert_return(from != to, -EINVAL);
2360
2361         HASHMAP_FOREACH(f, j->files, i) {
2362                 usec_t fr, t;
2363
2364                 r = journal_file_get_cutoff_realtime_usec(f, &fr, &t);
2365                 if (r == -ENOENT)
2366                         continue;
2367                 if (r < 0)
2368                         return r;
2369                 if (r == 0)
2370                         continue;
2371
2372                 if (first) {
2373                         fmin = fr;
2374                         tmax = t;
2375                         first = false;
2376                 } else {
2377                         fmin = MIN(fr, fmin);
2378                         tmax = MAX(t, tmax);
2379                 }
2380         }
2381
2382         if (from)
2383                 *from = fmin;
2384         if (to)
2385                 *to = tmax;
2386
2387         return first ? 0 : 1;
2388 }
2389
2390 _public_ int sd_journal_get_cutoff_monotonic_usec(sd_journal *j, sd_id128_t boot_id, uint64_t *from, uint64_t *to) {
2391         Iterator i;
2392         JournalFile *f;
2393         bool first = true;
2394         int r;
2395
2396         assert_return(j, -EINVAL);
2397         assert_return(!journal_pid_changed(j), -ECHILD);
2398         assert_return(from || to, -EINVAL);
2399         assert_return(from != to, -EINVAL);
2400
2401         HASHMAP_FOREACH(f, j->files, i) {
2402                 usec_t fr, t;
2403
2404                 r = journal_file_get_cutoff_monotonic_usec(f, boot_id, &fr, &t);
2405                 if (r == -ENOENT)
2406                         continue;
2407                 if (r < 0)
2408                         return r;
2409                 if (r == 0)
2410                         continue;
2411
2412                 if (first) {
2413                         if (from)
2414                                 *from = fr;
2415                         if (to)
2416                                 *to = t;
2417                         first = false;
2418                 } else {
2419                         if (from)
2420                                 *from = MIN(fr, *from);
2421                         if (to)
2422                                 *to = MAX(t, *to);
2423                 }
2424         }
2425
2426         return first ? 0 : 1;
2427 }
2428
2429 void journal_print_header(sd_journal *j) {
2430         Iterator i;
2431         JournalFile *f;
2432         bool newline = false;
2433
2434         assert(j);
2435
2436         HASHMAP_FOREACH(f, j->files, i) {
2437                 if (newline)
2438                         putchar('\n');
2439                 else
2440                         newline = true;
2441
2442                 journal_file_print_header(f);
2443         }
2444 }
2445
2446 _public_ int sd_journal_get_usage(sd_journal *j, uint64_t *bytes) {
2447         Iterator i;
2448         JournalFile *f;
2449         uint64_t sum = 0;
2450
2451         assert_return(j, -EINVAL);
2452         assert_return(!journal_pid_changed(j), -ECHILD);
2453         assert_return(bytes, -EINVAL);
2454
2455         HASHMAP_FOREACH(f, j->files, i) {
2456                 struct stat st;
2457
2458                 if (fstat(f->fd, &st) < 0)
2459                         return -errno;
2460
2461                 sum += (uint64_t) st.st_blocks * 512ULL;
2462         }
2463
2464         *bytes = sum;
2465         return 0;
2466 }
2467
2468 _public_ int sd_journal_query_unique(sd_journal *j, const char *field) {
2469         char *f;
2470
2471         assert_return(j, -EINVAL);
2472         assert_return(!journal_pid_changed(j), -ECHILD);
2473         assert_return(!isempty(field), -EINVAL);
2474         assert_return(field_is_valid(field), -EINVAL);
2475
2476         f = strdup(field);
2477         if (!f)
2478                 return -ENOMEM;
2479
2480         free(j->unique_field);
2481         j->unique_field = f;
2482         j->unique_file = NULL;
2483         j->unique_offset = 0;
2484
2485         return 0;
2486 }
2487
2488 _public_ int sd_journal_enumerate_unique(sd_journal *j, const void **data, size_t *l) {
2489         size_t k;
2490
2491         assert_return(j, -EINVAL);
2492         assert_return(!journal_pid_changed(j), -ECHILD);
2493         assert_return(data, -EINVAL);
2494         assert_return(l, -EINVAL);
2495         assert_return(j->unique_field, -EINVAL);
2496
2497         k = strlen(j->unique_field);
2498
2499         if (!j->unique_file) {
2500                 j->unique_file = hashmap_first(j->files);
2501                 if (!j->unique_file)
2502                         return 0;
2503                 j->unique_offset = 0;
2504         }
2505
2506         for (;;) {
2507                 JournalFile *of;
2508                 Iterator i;
2509                 Object *o;
2510                 const void *odata;
2511                 size_t ol;
2512                 bool found;
2513                 int r;
2514
2515                 /* Proceed to next data object in the field's linked list */
2516                 if (j->unique_offset == 0) {
2517                         r = journal_file_find_field_object(j->unique_file, j->unique_field, k, &o, NULL);
2518                         if (r < 0)
2519                                 return r;
2520
2521                         j->unique_offset = r > 0 ? le64toh(o->field.head_data_offset) : 0;
2522                 } else {
2523                         r = journal_file_move_to_object(j->unique_file, OBJECT_DATA, j->unique_offset, &o);
2524                         if (r < 0)
2525                                 return r;
2526
2527                         j->unique_offset = le64toh(o->data.next_field_offset);
2528                 }
2529
2530                 /* We reached the end of the list? Then start again, with the next file */
2531                 if (j->unique_offset == 0) {
2532                         JournalFile *n;
2533
2534                         n = hashmap_next(j->files, j->unique_file->path);
2535                         if (!n)
2536                                 return 0;
2537
2538                         j->unique_file = n;
2539                         continue;
2540                 }
2541
2542                 /* We do not use the type context here, but 0 instead,
2543                  * so that we can look at this data object at the same
2544                  * time as one on another file */
2545                 r = journal_file_move_to_object(j->unique_file, 0, j->unique_offset, &o);
2546                 if (r < 0)
2547                         return r;
2548
2549                 /* Let's do the type check by hand, since we used 0 context above. */
2550                 if (o->object.type != OBJECT_DATA) {
2551                         log_error("%s:offset " OFSfmt ": object has type %d, expected %d",
2552                                   j->unique_file->path, j->unique_offset,
2553                                   o->object.type, OBJECT_DATA);
2554                         return -EBADMSG;
2555                 }
2556
2557                 r = journal_file_object_keep(j->unique_file, o, j->unique_offset);
2558                 if (r < 0)
2559                         return r;
2560
2561                 r = return_data(j, j->unique_file, o, &odata, &ol);
2562                 if (r < 0)
2563                         return r;
2564
2565                 /* OK, now let's see if we already returned this data
2566                  * object by checking if it exists in the earlier
2567                  * traversed files. */
2568                 found = false;
2569                 HASHMAP_FOREACH(of, j->files, i) {
2570                         Object *oo;
2571                         uint64_t op;
2572
2573                         if (of == j->unique_file)
2574                                 break;
2575
2576                         /* Skip this file it didn't have any fields
2577                          * indexed */
2578                         if (JOURNAL_HEADER_CONTAINS(of->header, n_fields) &&
2579                             le64toh(of->header->n_fields) <= 0)
2580                                 continue;
2581
2582                         r = journal_file_find_data_object_with_hash(of, odata, ol, le64toh(o->data.hash), &oo, &op);
2583                         if (r < 0)
2584                                 return r;
2585
2586                         if (r > 0)
2587                                 found = true;
2588                 }
2589
2590                 if (found)
2591                         continue;
2592
2593                 r = journal_file_object_release(j->unique_file, o, j->unique_offset);
2594                 if (r < 0)
2595                         return r;
2596
2597                 r = return_data(j, j->unique_file, o, data, l);
2598                 if (r < 0)
2599                         return r;
2600
2601                 return 1;
2602         }
2603 }
2604
2605 _public_ void sd_journal_restart_unique(sd_journal *j) {
2606         if (!j)
2607                 return;
2608
2609         j->unique_file = NULL;
2610         j->unique_offset = 0;
2611 }
2612
2613 _public_ int sd_journal_reliable_fd(sd_journal *j) {
2614         assert_return(j, -EINVAL);
2615         assert_return(!journal_pid_changed(j), -ECHILD);
2616
2617         return !j->on_network;
2618 }
2619
2620 static char *lookup_field(const char *field, void *userdata) {
2621         sd_journal *j = userdata;
2622         const void *data;
2623         size_t size, d;
2624         int r;
2625
2626         assert(field);
2627         assert(j);
2628
2629         r = sd_journal_get_data(j, field, &data, &size);
2630         if (r < 0 ||
2631             size > REPLACE_VAR_MAX)
2632                 return strdup(field);
2633
2634         d = strlen(field) + 1;
2635
2636         return strndup((const char*) data + d, size - d);
2637 }
2638
2639 _public_ int sd_journal_get_catalog(sd_journal *j, char **ret) {
2640         const void *data;
2641         size_t size;
2642         sd_id128_t id;
2643         _cleanup_free_ char *text = NULL, *cid = NULL;
2644         char *t;
2645         int r;
2646
2647         assert_return(j, -EINVAL);
2648         assert_return(!journal_pid_changed(j), -ECHILD);
2649         assert_return(ret, -EINVAL);
2650
2651         r = sd_journal_get_data(j, "MESSAGE_ID", &data, &size);
2652         if (r < 0)
2653                 return r;
2654
2655         cid = strndup((const char*) data + 11, size - 11);
2656         if (!cid)
2657                 return -ENOMEM;
2658
2659         r = sd_id128_from_string(cid, &id);
2660         if (r < 0)
2661                 return r;
2662
2663         r = catalog_get(CATALOG_DATABASE, id, &text);
2664         if (r < 0)
2665                 return r;
2666
2667         t = replace_var(text, lookup_field, j);
2668         if (!t)
2669                 return -ENOMEM;
2670
2671         *ret = t;
2672         return 0;
2673 }
2674
2675 _public_ int sd_journal_get_catalog_for_message_id(sd_id128_t id, char **ret) {
2676         assert_return(ret, -EINVAL);
2677
2678         return catalog_get(CATALOG_DATABASE, id, ret);
2679 }
2680
2681 _public_ int sd_journal_set_data_threshold(sd_journal *j, size_t sz) {
2682         assert_return(j, -EINVAL);
2683         assert_return(!journal_pid_changed(j), -ECHILD);
2684
2685         j->data_threshold = sz;
2686         return 0;
2687 }
2688
2689 _public_ int sd_journal_get_data_threshold(sd_journal *j, size_t *sz) {
2690         assert_return(j, -EINVAL);
2691         assert_return(!journal_pid_changed(j), -ECHILD);
2692         assert_return(sz, -EINVAL);
2693
2694         *sz = j->data_threshold;
2695         return 0;
2696 }