]> git.ipfire.org Git - thirdparty/systemd.git/blob - src/libsystemd/sd-journal/sd-journal.c
projects / thirdparty / systemd.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
strv: make iterator in STRV_FOREACH() declaread in the loop
[thirdparty/systemd.git] / src / libsystemd / sd-journal / sd-journal.c
1 /* SPDX-License-Identifier: LGPL-2.1-or-later */
2
3 #include <errno.h>
4 #include <fcntl.h>
5 #include <inttypes.h>
6 #include <linux/magic.h>
7 #include <poll.h>
8 #include <stddef.h>
9 #include <sys/inotify.h>
10 #include <sys/vfs.h>
11 #include <unistd.h>
12
13 #include "sd-journal.h"
14
15 #include "alloc-util.h"
16 #include "catalog.h"
17 #include "compress.h"
18 #include "dirent-util.h"
19 #include "env-file.h"
20 #include "escape.h"
21 #include "fd-util.h"
22 #include "fileio.h"
23 #include "format-util.h"
24 #include "fs-util.h"
25 #include "hashmap.h"
26 #include "hostname-util.h"
27 #include "id128-util.h"
28 #include "inotify-util.h"
29 #include "io-util.h"
30 #include "journal-def.h"
31 #include "journal-file.h"
32 #include "journal-internal.h"
33 #include "list.h"
34 #include "lookup3.h"
35 #include "nulstr-util.h"
36 #include "path-util.h"
37 #include "process-util.h"
38 #include "replace-var.h"
39 #include "stat-util.h"
40 #include "stdio-util.h"
41 #include "string-util.h"
42 #include "strv.h"
43 #include "syslog-util.h"
44
45 #define JOURNAL_FILES_MAX 7168
46
47 #define JOURNAL_FILES_RECHECK_USEC (2 * USEC_PER_SEC)
48
49 /* The maximum size of variable values we'll expand in catalog entries. We bind this to PATH_MAX for now, as
50 * we want to be able to show all officially valid paths at least */
51 #define REPLACE_VAR_MAX PATH_MAX
52
53 #define DEFAULT_DATA_THRESHOLD (64*1024)
54
55 static void remove_file_real(sd_journal *j, JournalFile *f);
56
57 static bool journal_pid_changed(sd_journal *j) {
58 assert(j);
59
60 /* We don't support people creating a journal object and
61 * keeping it around over a fork(). Let's complain. */
62
63 return j->original_pid != getpid_cached();
64 }
65
66 static int journal_put_error(sd_journal *j, int r, const char *path) {
67 _cleanup_free_ char *copy = NULL;
68 int k;
69
70 /* Memorize an error we encountered, and store which
71 * file/directory it was generated from. Note that we store
72 * only *one* path per error code, as the error code is the
73 * key into the hashmap, and the path is the value. This means
74 * we keep track only of all error kinds, but not of all error
75 * locations. This has the benefit that the hashmap cannot
76 * grow beyond bounds.
77 *
78 * We return an error here only if we didn't manage to
79 * memorize the real error. */
80
81 if (r >= 0)
82 return r;
83
84 if (path) {
85 copy = strdup(path);
86 if (!copy)
87 return -ENOMEM;
88 }
89
90 k = hashmap_ensure_put(&j->errors, NULL, INT_TO_PTR(r), copy);
91 if (k < 0) {
92 if (k == -EEXIST)
93 return 0;
94
95 return k;
96 }
97
98 TAKE_PTR(copy);
99 return 0;
100 }
101
102 static void detach_location(sd_journal *j) {
103 JournalFile *f;
104
105 assert(j);
106
107 j->current_file = NULL;
108 j->current_field = 0;
109
110 ORDERED_HASHMAP_FOREACH(f, j->files)
111 journal_file_reset_location(f);
112 }
113
114 static void init_location(Location *l, LocationType type, JournalFile *f, Object *o) {
115 assert(l);
116 assert(IN_SET(type, LOCATION_DISCRETE, LOCATION_SEEK));
117 assert(f);
118
119 *l = (Location) {
120 .type = type,
121 .seqnum = le64toh(o->entry.seqnum),
122 .seqnum_id = f->header->seqnum_id,
123 .realtime = le64toh(o->entry.realtime),
124 .monotonic = le64toh(o->entry.monotonic),
125 .boot_id = o->entry.boot_id,
126 .xor_hash = le64toh(o->entry.xor_hash),
127 .seqnum_set = true,
128 .realtime_set = true,
129 .monotonic_set = true,
130 .xor_hash_set = true,
131 };
132 }
133
134 static void set_location(sd_journal *j, JournalFile *f, Object *o) {
135 assert(j);
136 assert(f);
137 assert(o);
138
139 init_location(&j->current_location, LOCATION_DISCRETE, f, o);
140
141 j->current_file = f;
142 j->current_field = 0;
143
144 /* Let f know its candidate entry was picked. */
145 assert(f->location_type == LOCATION_SEEK);
146 f->location_type = LOCATION_DISCRETE;
147 }
148
149 static int match_is_valid(const void *data, size_t size) {
150 const char *b, *p;
151
152 assert(data);
153
154 if (size < 2)
155 return false;
156
157 if (((char*) data)[0] == '_' && ((char*) data)[1] == '_')
158 return false;
159
160 b = data;
161 for (p = b; p < b + size; p++) {
162
163 if (*p == '=')
164 return p > b;
165
166 if (*p == '_')
167 continue;
168
169 if (*p >= 'A' && *p <= 'Z')
170 continue;
171
172 if (*p >= '0' && *p <= '9')
173 continue;
174
175 return false;
176 }
177
178 return false;
179 }
180
181 static bool same_field(const void *_a, size_t s, const void *_b, size_t t) {
182 const uint8_t *a = _a, *b = _b;
183 size_t j;
184
185 for (j = 0; j < s && j < t; j++) {
186
187 if (a[j] != b[j])
188 return false;
189
190 if (a[j] == '=')
191 return true;
192 }
193
194 assert_not_reached();
195 }
196
197 static Match *match_new(Match *p, MatchType t) {
198 Match *m;
199
200 m = new(Match, 1);
201 if (!m)
202 return NULL;
203
204 *m = (Match) {
205 .type = t,
206 .parent = p,
207 };
208
209 if (p)
210 LIST_PREPEND(matches, p->matches, m);
211
212 return m;
213 }
214
215 static Match *match_free(Match *m) {
216 assert(m);
217
218 while (m->matches)
219 match_free(m->matches);
220
221 if (m->parent)
222 LIST_REMOVE(matches, m->parent->matches, m);
223
224 free(m->data);
225 return mfree(m);
226 }
227
228 static Match *match_free_if_empty(Match *m) {
229 if (!m || m->matches)
230 return m;
231
232 return match_free(m);
233 }
234
235 _public_ int sd_journal_add_match(sd_journal *j, const void *data, size_t size) {
236 Match *add_here = NULL, *m = NULL;
237 uint64_t hash;
238
239 assert_return(j, -EINVAL);
240 assert_return(!journal_pid_changed(j), -ECHILD);
241 assert_return(data, -EINVAL);
242
243 if (size == 0)
244 size = strlen(data);
245
246 assert_return(match_is_valid(data, size), -EINVAL);
247
248 /* level 0: AND term
249 * level 1: OR terms
250 * level 2: AND terms
251 * level 3: OR terms
252 * level 4: concrete matches */
253
254 if (!j->level0) {
255 j->level0 = match_new(NULL, MATCH_AND_TERM);
256 if (!j->level0)
257 return -ENOMEM;
258 }
259
260 if (!j->level1) {
261 j->level1 = match_new(j->level0, MATCH_OR_TERM);
262 if (!j->level1)
263 return -ENOMEM;
264 }
265
266 if (!j->level2) {
267 j->level2 = match_new(j->level1, MATCH_AND_TERM);
268 if (!j->level2)
269 return -ENOMEM;
270 }
271
272 assert(j->level0->type == MATCH_AND_TERM);
273 assert(j->level1->type == MATCH_OR_TERM);
274 assert(j->level2->type == MATCH_AND_TERM);
275
276 /* Old-style Jenkins (unkeyed) hashing only here. We do not cover new-style siphash (keyed) hashing
277 * here, since it's different for each file, and thus can't be pre-calculated in the Match object. */
278 hash = jenkins_hash64(data, size);
279
280 LIST_FOREACH(matches, l3, j->level2->matches) {
281 assert(l3->type == MATCH_OR_TERM);
282
283 LIST_FOREACH(matches, l4, l3->matches) {
284 assert(l4->type == MATCH_DISCRETE);
285
286 /* Exactly the same match already? Then ignore
287 * this addition */
288 if (l4->hash == hash &&
289 l4->size == size &&
290 memcmp(l4->data, data, size) == 0)
291 return 0;
292
293 /* Same field? Then let's add this to this OR term */
294 if (same_field(data, size, l4->data, l4->size)) {
295 add_here = l3;
296 break;
297 }
298 }
299
300 if (add_here)
301 break;
302 }
303
304 if (!add_here) {
305 add_here = match_new(j->level2, MATCH_OR_TERM);
306 if (!add_here)
307 goto fail;
308 }
309
310 m = match_new(add_here, MATCH_DISCRETE);
311 if (!m)
312 goto fail;
313
314 m->hash = hash;
315 m->size = size;
316 m->data = memdup(data, size);
317 if (!m->data)
318 goto fail;
319
320 detach_location(j);
321
322 return 0;
323
324 fail:
325 match_free(m);
326 match_free_if_empty(add_here);
327 j->level2 = match_free_if_empty(j->level2);
328 j->level1 = match_free_if_empty(j->level1);
329 j->level0 = match_free_if_empty(j->level0);
330
331 return -ENOMEM;
332 }
333
334 _public_ int sd_journal_add_conjunction(sd_journal *j) {
335 assert_return(j, -EINVAL);
336 assert_return(!journal_pid_changed(j), -ECHILD);
337
338 if (!j->level0)
339 return 0;
340
341 if (!j->level1)
342 return 0;
343
344 if (!j->level1->matches)
345 return 0;
346
347 j->level1 = NULL;
348 j->level2 = NULL;
349
350 return 0;
351 }
352
353 _public_ int sd_journal_add_disjunction(sd_journal *j) {
354 assert_return(j, -EINVAL);
355 assert_return(!journal_pid_changed(j), -ECHILD);
356
357 if (!j->level0)
358 return 0;
359
360 if (!j->level1)
361 return 0;
362
363 if (!j->level2)
364 return 0;
365
366 if (!j->level2->matches)
367 return 0;
368
369 j->level2 = NULL;
370 return 0;
371 }
372
373 static char *match_make_string(Match *m) {
374 char *p = NULL, *r;
375 bool enclose = false;
376
377 if (!m)
378 return strdup("none");
379
380 if (m->type == MATCH_DISCRETE)
381 return cescape_length(m->data, m->size);
382
383 LIST_FOREACH(matches, i, m->matches) {
384 char *t, *k;
385
386 t = match_make_string(i);
387 if (!t)
388 return mfree(p);
389
390 if (p) {
391 k = strjoin(p, m->type == MATCH_OR_TERM ? " OR " : " AND ", t);
392 free(p);
393 free(t);
394
395 if (!k)
396 return NULL;
397
398 p = k;
399
400 enclose = true;
401 } else
402 p = t;
403 }
404
405 if (enclose) {
406 r = strjoin("(", p, ")");
407 free(p);
408 return r;
409 }
410
411 return p;
412 }
413
414 char *journal_make_match_string(sd_journal *j) {
415 assert(j);
416
417 return match_make_string(j->level0);
418 }
419
420 _public_ void sd_journal_flush_matches(sd_journal *j) {
421 if (!j)
422 return;
423
424 if (j->level0)
425 match_free(j->level0);
426
427 j->level0 = j->level1 = j->level2 = NULL;
428
429 detach_location(j);
430 }
431
432 _pure_ static int compare_with_location(const JournalFile *f, const Location *l, const JournalFile *current_file) {
433 int r;
434
435 assert(f);
436 assert(l);
437 assert(f->location_type == LOCATION_SEEK);
438 assert(IN_SET(l->type, LOCATION_DISCRETE, LOCATION_SEEK));
439
440 if (l->monotonic_set &&
441 sd_id128_equal(f->current_boot_id, l->boot_id) &&
442 l->realtime_set &&
443 f->current_realtime == l->realtime &&
444 l->xor_hash_set &&
445 f->current_xor_hash == l->xor_hash &&
446 l->seqnum_set &&
447 sd_id128_equal(f->header->seqnum_id, l->seqnum_id) &&
448 f->current_seqnum == l->seqnum &&
449 f != current_file)
450 return 0;
451
452 if (l->seqnum_set &&
453 sd_id128_equal(f->header->seqnum_id, l->seqnum_id)) {
454
455 r = CMP(f->current_seqnum, l->seqnum);
456 if (r != 0)
457 return r;
458 }
459
460 if (l->monotonic_set &&
461 sd_id128_equal(f->current_boot_id, l->boot_id)) {
462
463 r = CMP(f->current_monotonic, l->monotonic);
464 if (r != 0)
465 return r;
466 }
467
468 if (l->realtime_set) {
469
470 r = CMP(f->current_realtime, l->realtime);
471 if (r != 0)
472 return r;
473 }
474
475 if (l->xor_hash_set) {
476
477 r = CMP(f->current_xor_hash, l->xor_hash);
478 if (r != 0)
479 return r;
480 }
481
482 return 0;
483 }
484
485 static int next_for_match(
486 sd_journal *j,
487 Match *m,
488 JournalFile *f,
489 uint64_t after_offset,
490 direction_t direction,
491 Object **ret,
492 uint64_t *offset) {
493
494 int r;
495 uint64_t np = 0;
496 Object *n;
497
498 assert(j);
499 assert(m);
500 assert(f);
501
502 if (m->type == MATCH_DISCRETE) {
503 Object *d;
504 uint64_t hash;
505
506 /* If the keyed hash logic is used, we need to calculate the hash fresh per file. Otherwise
507 * we can use what we pre-calculated. */
508 if (JOURNAL_HEADER_KEYED_HASH(f->header))
509 hash = journal_file_hash_data(f, m->data, m->size);
510 else
511 hash = m->hash;
512
513 r = journal_file_find_data_object_with_hash(f, m->data, m->size, hash, &d, NULL);
514 if (r <= 0)
515 return r;
516
517 return journal_file_move_to_entry_by_offset_for_data(f, d, after_offset, direction, ret, offset);
518
519 } else if (m->type == MATCH_OR_TERM) {
520
521 /* Find the earliest match beyond after_offset */
522
523 LIST_FOREACH(matches, i, m->matches) {
524 uint64_t cp;
525
526 r = next_for_match(j, i, f, after_offset, direction, NULL, &cp);
527 if (r < 0)
528 return r;
529 else if (r > 0) {
530 if (np == 0 || (direction == DIRECTION_DOWN ? cp < np : cp > np))
531 np = cp;
532 }
533 }
534
535 if (np == 0)
536 return 0;
537
538 } else if (m->type == MATCH_AND_TERM) {
539 Match *last_moved;
540
541 /* Always jump to the next matching entry and repeat
542 * this until we find an offset that matches for all
543 * matches. */
544
545 if (!m->matches)
546 return 0;
547
548 r = next_for_match(j, m->matches, f, after_offset, direction, NULL, &np);
549 if (r <= 0)
550 return r;
551
552 assert(direction == DIRECTION_DOWN ? np >= after_offset : np <= after_offset);
553 last_moved = m->matches;
554
555 LIST_LOOP_BUT_ONE(matches, i, m->matches, last_moved) {
556 uint64_t cp;
557
558 r = next_for_match(j, i, f, np, direction, NULL, &cp);
559 if (r <= 0)
560 return r;
561
562 assert(direction == DIRECTION_DOWN ? cp >= np : cp <= np);
563 if (direction == DIRECTION_DOWN ? cp > np : cp < np) {
564 np = cp;
565 last_moved = i;
566 }
567 }
568 }
569
570 assert(np > 0);
571
572 r = journal_file_move_to_object(f, OBJECT_ENTRY, np, &n);
573 if (r < 0)
574 return r;
575
576 if (ret)
577 *ret = n;
578 if (offset)
579 *offset = np;
580
581 return 1;
582 }
583
584 static int find_location_for_match(
585 sd_journal *j,
586 Match *m,
587 JournalFile *f,
588 direction_t direction,
589 Object **ret,
590 uint64_t *offset) {
591
592 int r;
593
594 assert(j);
595 assert(m);
596 assert(f);
597
598 if (m->type == MATCH_DISCRETE) {
599 Object *d;
600 uint64_t dp, hash;
601
602 if (JOURNAL_HEADER_KEYED_HASH(f->header))
603 hash = journal_file_hash_data(f, m->data, m->size);
604 else
605 hash = m->hash;
606
607 r = journal_file_find_data_object_with_hash(f, m->data, m->size, hash, &d, &dp);
608 if (r <= 0)
609 return r;
610
611 /* FIXME: missing: find by monotonic */
612
613 if (j->current_location.type == LOCATION_HEAD)
614 return journal_file_next_entry_for_data(f, d, DIRECTION_DOWN, ret, offset);
615 if (j->current_location.type == LOCATION_TAIL)
616 return journal_file_next_entry_for_data(f, d, DIRECTION_UP, ret, offset);
617 if (j->current_location.seqnum_set && sd_id128_equal(j->current_location.seqnum_id, f->header->seqnum_id))
618 return journal_file_move_to_entry_by_seqnum_for_data(f, d, j->current_location.seqnum, direction, ret, offset);
619 if (j->current_location.monotonic_set) {
620 r = journal_file_move_to_entry_by_monotonic_for_data(f, d, j->current_location.boot_id, j->current_location.monotonic, direction, ret, offset);
621 if (r != -ENOENT)
622 return r;
623
624 /* The data object might have been invalidated. */
625 r = journal_file_move_to_object(f, OBJECT_DATA, dp, &d);
626 if (r < 0)
627 return r;
628 }
629 if (j->current_location.realtime_set)
630 return journal_file_move_to_entry_by_realtime_for_data(f, d, j->current_location.realtime, direction, ret, offset);
631
632 return journal_file_next_entry_for_data(f, d, direction, ret, offset);
633
634 } else if (m->type == MATCH_OR_TERM) {
635 uint64_t np = 0;
636 Object *n;
637
638 /* Find the earliest match */
639
640 LIST_FOREACH(matches, i, m->matches) {
641 uint64_t cp;
642
643 r = find_location_for_match(j, i, f, direction, NULL, &cp);
644 if (r < 0)
645 return r;
646 else if (r > 0) {
647 if (np == 0 || (direction == DIRECTION_DOWN ? np > cp : np < cp))
648 np = cp;
649 }
650 }
651
652 if (np == 0)
653 return 0;
654
655 r = journal_file_move_to_object(f, OBJECT_ENTRY, np, &n);
656 if (r < 0)
657 return r;
658
659 if (ret)
660 *ret = n;
661 if (offset)
662 *offset = np;
663
664 return 1;
665
666 } else {
667 uint64_t np = 0;
668
669 assert(m->type == MATCH_AND_TERM);
670
671 /* First jump to the last match, and then find the
672 * next one where all matches match */
673
674 if (!m->matches)
675 return 0;
676
677 LIST_FOREACH(matches, i, m->matches) {
678 uint64_t cp;
679
680 r = find_location_for_match(j, i, f, direction, NULL, &cp);
681 if (r <= 0)
682 return r;
683
684 if (np == 0 || (direction == DIRECTION_DOWN ? cp > np : cp < np))
685 np = cp;
686 }
687
688 return next_for_match(j, m, f, np, direction, ret, offset);
689 }
690 }
691
692 static int find_location_with_matches(
693 sd_journal *j,
694 JournalFile *f,
695 direction_t direction,
696 Object **ret,
697 uint64_t *offset) {
698
699 int r;
700
701 assert(j);
702 assert(f);
703 assert(ret);
704 assert(offset);
705
706 if (!j->level0) {
707 /* No matches is simple */
708
709 if (j->current_location.type == LOCATION_HEAD)
710 return journal_file_next_entry(f, 0, DIRECTION_DOWN, ret, offset);
711 if (j->current_location.type == LOCATION_TAIL)
712 return journal_file_next_entry(f, 0, DIRECTION_UP, ret, offset);
713 if (j->current_location.seqnum_set && sd_id128_equal(j->current_location.seqnum_id, f->header->seqnum_id))
714 return journal_file_move_to_entry_by_seqnum(f, j->current_location.seqnum, direction, ret, offset);
715 if (j->current_location.monotonic_set) {
716 r = journal_file_move_to_entry_by_monotonic(f, j->current_location.boot_id, j->current_location.monotonic, direction, ret, offset);
717 if (r != -ENOENT)
718 return r;
719 }
720 if (j->current_location.realtime_set)
721 return journal_file_move_to_entry_by_realtime(f, j->current_location.realtime, direction, ret, offset);
722
723 return journal_file_next_entry(f, 0, direction, ret, offset);
724 } else
725 return find_location_for_match(j, j->level0, f, direction, ret, offset);
726 }
727
728 static int next_with_matches(
729 sd_journal *j,
730 JournalFile *f,
731 direction_t direction,
732 Object **ret,
733 uint64_t *offset) {
734
735 assert(j);
736 assert(f);
737 assert(ret);
738 assert(offset);
739
740 /* No matches is easy. We simple advance the file
741 * pointer by one. */
742 if (!j->level0)
743 return journal_file_next_entry(f, f->current_offset, direction, ret, offset);
744
745 /* If we have a match then we look for the next matching entry
746 * with an offset at least one step larger */
747 return next_for_match(j, j->level0, f,
748 direction == DIRECTION_DOWN ? f->current_offset + 1
749 : f->current_offset - 1,
750 direction, ret, offset);
751 }
752
753 static int next_beyond_location(sd_journal *j, JournalFile *f, direction_t direction) {
754 Object *c;
755 uint64_t cp, n_entries;
756 int r;
757
758 assert(j);
759 assert(f);
760
761 n_entries = le64toh(f->header->n_entries);
762
763 /* If we hit EOF before, we don't need to look into this file again
764 * unless direction changed or new entries appeared. */
765 if (f->last_direction == direction && f->location_type == LOCATION_TAIL &&
766 n_entries == f->last_n_entries)
767 return 0;
768
769 f->last_n_entries = n_entries;
770
771 if (f->last_direction == direction && f->current_offset > 0) {
772 /* LOCATION_SEEK here means we did the work in a previous
773 * iteration and the current location already points to a
774 * candidate entry. */
775 if (f->location_type != LOCATION_SEEK) {
776 r = next_with_matches(j, f, direction, &c, &cp);
777 if (r <= 0)
778 return r;
779
780 journal_file_save_location(f, c, cp);
781 }
782 } else {
783 f->last_direction = direction;
784
785 r = find_location_with_matches(j, f, direction, &c, &cp);
786 if (r <= 0)
787 return r;
788
789 journal_file_save_location(f, c, cp);
790 }
791
792 /* OK, we found the spot, now let's advance until an entry
793 * that is actually different from what we were previously
794 * looking at. This is necessary to handle entries which exist
795 * in two (or more) journal files, and which shall all be
796 * suppressed but one. */
797
798 for (;;) {
799 bool found;
800
801 if (j->current_location.type == LOCATION_DISCRETE) {
802 int k;
803
804 k = compare_with_location(f, &j->current_location, j->current_file);
805
806 found = direction == DIRECTION_DOWN ? k > 0 : k < 0;
807 } else
808 found = true;
809
810 if (found)
811 return 1;
812
813 r = next_with_matches(j, f, direction, &c, &cp);
814 if (r <= 0)
815 return r;
816
817 journal_file_save_location(f, c, cp);
818 }
819 }
820
821 static int real_journal_next(sd_journal *j, direction_t direction) {
822 JournalFile *new_file = NULL;
823 unsigned i, n_files;
824 const void **files;
825 Object *o;
826 int r;
827
828 assert_return(j, -EINVAL);
829 assert_return(!journal_pid_changed(j), -ECHILD);
830
831 r = iterated_cache_get(j->files_cache, NULL, &files, &n_files);
832 if (r < 0)
833 return r;
834
835 for (i = 0; i < n_files; i++) {
836 JournalFile *f = (JournalFile *)files[i];
837 bool found;
838
839 r = next_beyond_location(j, f, direction);
840 if (r < 0) {
841 log_debug_errno(r, "Can't iterate through %s, ignoring: %m", f->path);
842 remove_file_real(j, f);
843 continue;
844 } else if (r == 0) {
845 f->location_type = LOCATION_TAIL;
846 continue;
847 }
848
849 if (!new_file)
850 found = true;
851 else {
852 int k;
853
854 k = journal_file_compare_locations(f, new_file);
855
856 found = direction == DIRECTION_DOWN ? k < 0 : k > 0;
857 }
858
859 if (found)
860 new_file = f;
861 }
862
863 if (!new_file)
864 return 0;
865
866 r = journal_file_move_to_object(new_file, OBJECT_ENTRY, new_file->current_offset, &o);
867 if (r < 0)
868 return r;
869
870 set_location(j, new_file, o);
871
872 return 1;
873 }
874
875 _public_ int sd_journal_next(sd_journal *j) {
876 return real_journal_next(j, DIRECTION_DOWN);
877 }
878
879 _public_ int sd_journal_previous(sd_journal *j) {
880 return real_journal_next(j, DIRECTION_UP);
881 }
882
883 static int real_journal_next_skip(sd_journal *j, direction_t direction, uint64_t skip) {
884 int c = 0, r;
885
886 assert_return(j, -EINVAL);
887 assert_return(!journal_pid_changed(j), -ECHILD);
888 assert_return(skip <= INT_MAX, -ERANGE);
889
890 if (skip == 0) {
891 /* If this is not a discrete skip, then at least
892 * resolve the current location */
893 if (j->current_location.type != LOCATION_DISCRETE) {
894 r = real_journal_next(j, direction);
895 if (r < 0)
896 return r;
897 }
898
899 return 0;
900 }
901
902 do {
903 r = real_journal_next(j, direction);
904 if (r < 0)
905 return r;
906
907 if (r == 0)
908 return c;
909
910 skip--;
911 c++;
912 } while (skip > 0);
913
914 return c;
915 }
916
917 _public_ int sd_journal_next_skip(sd_journal *j, uint64_t skip) {
918 return real_journal_next_skip(j, DIRECTION_DOWN, skip);
919 }
920
921 _public_ int sd_journal_previous_skip(sd_journal *j, uint64_t skip) {
922 return real_journal_next_skip(j, DIRECTION_UP, skip);
923 }
924
925 _public_ int sd_journal_get_cursor(sd_journal *j, char **cursor) {
926 Object *o;
927 int r;
928
929 assert_return(j, -EINVAL);
930 assert_return(!journal_pid_changed(j), -ECHILD);
931 assert_return(cursor, -EINVAL);
932
933 if (!j->current_file || j->current_file->current_offset <= 0)
934 return -EADDRNOTAVAIL;
935
936 r = journal_file_move_to_object(j->current_file, OBJECT_ENTRY, j->current_file->current_offset, &o);
937 if (r < 0)
938 return r;
939
940 if (asprintf(cursor,
941 "s=%s;i=%"PRIx64";b=%s;m=%"PRIx64";t=%"PRIx64";x=%"PRIx64,
942 SD_ID128_TO_STRING(j->current_file->header->seqnum_id), le64toh(o->entry.seqnum),
943 SD_ID128_TO_STRING(o->entry.boot_id), le64toh(o->entry.monotonic),
944 le64toh(o->entry.realtime),
945 le64toh(o->entry.xor_hash)) < 0)
946 return -ENOMEM;
947
948 return 0;
949 }
950
951 _public_ int sd_journal_seek_cursor(sd_journal *j, const char *cursor) {
952 unsigned long long seqnum, monotonic, realtime, xor_hash;
953 bool seqnum_id_set = false,
954 seqnum_set = false,
955 boot_id_set = false,
956 monotonic_set = false,
957 realtime_set = false,
958 xor_hash_set = false;
959 sd_id128_t seqnum_id, boot_id;
960 int r;
961
962 assert_return(j, -EINVAL);
963 assert_return(!journal_pid_changed(j), -ECHILD);
964 assert_return(!isempty(cursor), -EINVAL);
965
966 for (const char *p = cursor;;) {
967 _cleanup_free_ char *word = NULL;
968
969 r = extract_first_word(&p, &word, ";", EXTRACT_DONT_COALESCE_SEPARATORS);
970 if (r < 0)
971 return r;
972 if (r == 0)
973 break;
974
975 if (word[0] == '\0' || word[1] != '=')
976 return -EINVAL;
977
978 switch (word[0]) {
979 case 's':
980 seqnum_id_set = true;
981 r = sd_id128_from_string(word + 2, &seqnum_id);
982 if (r < 0)
983 return r;
984 break;
985
986 case 'i':
987 seqnum_set = true;
988 if (sscanf(word + 2, "%llx", &seqnum) != 1)
989 return -EINVAL;
990 break;
991
992 case 'b':
993 boot_id_set = true;
994 r = sd_id128_from_string(word + 2, &boot_id);
995 break;
996
997 case 'm':
998 monotonic_set = true;
999 if (sscanf(word + 2, "%llx", &monotonic) != 1)
1000 return -EINVAL;
1001 break;
1002
1003 case 't':
1004 realtime_set = true;
1005 if (sscanf(word + 2, "%llx", &realtime) != 1)
1006 return -EINVAL;
1007 break;
1008
1009 case 'x':
1010 xor_hash_set = true;
1011 if (sscanf(word + 2, "%llx", &xor_hash) != 1)
1012 return -EINVAL;
1013 break;
1014 }
1015 }
1016
1017 if ((!seqnum_set || !seqnum_id_set) &&
1018 (!monotonic_set || !boot_id_set) &&
1019 !realtime_set)
1020 return -EINVAL;
1021
1022 detach_location(j);
1023 j->current_location = (Location) {
1024 .type = LOCATION_SEEK,
1025 };
1026
1027 if (realtime_set) {
1028 j->current_location.realtime = (uint64_t) realtime;
1029 j->current_location.realtime_set = true;
1030 }
1031
1032 if (seqnum_set && seqnum_id_set) {
1033 j->current_location.seqnum = (uint64_t) seqnum;
1034 j->current_location.seqnum_id = seqnum_id;
1035 j->current_location.seqnum_set = true;
1036 }
1037
1038 if (monotonic_set && boot_id_set) {
1039 j->current_location.monotonic = (uint64_t) monotonic;
1040 j->current_location.boot_id = boot_id;
1041 j->current_location.monotonic_set = true;
1042 }
1043
1044 if (xor_hash_set) {
1045 j->current_location.xor_hash = (uint64_t) xor_hash;
1046 j->current_location.xor_hash_set = true;
1047 }
1048
1049 return 0;
1050 }
1051
1052 _public_ int sd_journal_test_cursor(sd_journal *j, const char *cursor) {
1053 int r;
1054 Object *o;
1055
1056 assert_return(j, -EINVAL);
1057 assert_return(!journal_pid_changed(j), -ECHILD);
1058 assert_return(!isempty(cursor), -EINVAL);
1059
1060 if (!j->current_file || j->current_file->current_offset <= 0)
1061 return -EADDRNOTAVAIL;
1062
1063 r = journal_file_move_to_object(j->current_file, OBJECT_ENTRY, j->current_file->current_offset, &o);
1064 if (r < 0)
1065 return r;
1066
1067 for (;;) {
1068 _cleanup_free_ char *item = NULL;
1069 unsigned long long ll;
1070 sd_id128_t id;
1071 int k = 0;
1072
1073 r = extract_first_word(&cursor, &item, ";", EXTRACT_DONT_COALESCE_SEPARATORS);
1074 if (r < 0)
1075 return r;
1076
1077 if (r == 0)
1078 break;
1079
1080 if (strlen(item) < 2 || item[1] != '=')
1081 return -EINVAL;
1082
1083 switch (item[0]) {
1084
1085 case 's':
1086 k = sd_id128_from_string(item+2, &id);
1087 if (k < 0)
1088 return k;
1089 if (!sd_id128_equal(id, j->current_file->header->seqnum_id))
1090 return 0;
1091 break;
1092
1093 case 'i':
1094 if (sscanf(item+2, "%llx", &ll) != 1)
1095 return -EINVAL;
1096 if (ll != le64toh(o->entry.seqnum))
1097 return 0;
1098 break;
1099
1100 case 'b':
1101 k = sd_id128_from_string(item+2, &id);
1102 if (k < 0)
1103 return k;
1104 if (!sd_id128_equal(id, o->entry.boot_id))
1105 return 0;
1106 break;
1107
1108 case 'm':
1109 if (sscanf(item+2, "%llx", &ll) != 1)
1110 return -EINVAL;
1111 if (ll != le64toh(o->entry.monotonic))
1112 return 0;
1113 break;
1114
1115 case 't':
1116 if (sscanf(item+2, "%llx", &ll) != 1)
1117 return -EINVAL;
1118 if (ll != le64toh(o->entry.realtime))
1119 return 0;
1120 break;
1121
1122 case 'x':
1123 if (sscanf(item+2, "%llx", &ll) != 1)
1124 return -EINVAL;
1125 if (ll != le64toh(o->entry.xor_hash))
1126 return 0;
1127 break;
1128 }
1129 }
1130
1131 return 1;
1132 }
1133
1134 _public_ int sd_journal_seek_monotonic_usec(sd_journal *j, sd_id128_t boot_id, uint64_t usec) {
1135 assert_return(j, -EINVAL);
1136 assert_return(!journal_pid_changed(j), -ECHILD);
1137
1138 detach_location(j);
1139
1140 j->current_location = (Location) {
1141 .type = LOCATION_SEEK,
1142 .boot_id = boot_id,
1143 .monotonic = usec,
1144 .monotonic_set = true,
1145 };
1146
1147 return 0;
1148 }
1149
1150 _public_ int sd_journal_seek_realtime_usec(sd_journal *j, uint64_t usec) {
1151 assert_return(j, -EINVAL);
1152 assert_return(!journal_pid_changed(j), -ECHILD);
1153
1154 detach_location(j);
1155
1156 j->current_location = (Location) {
1157 .type = LOCATION_SEEK,
1158 .realtime = usec,
1159 .realtime_set = true,
1160 };
1161
1162 return 0;
1163 }
1164
1165 _public_ int sd_journal_seek_head(sd_journal *j) {
1166 assert_return(j, -EINVAL);
1167 assert_return(!journal_pid_changed(j), -ECHILD);
1168
1169 detach_location(j);
1170
1171 j->current_location = (Location) {
1172 .type = LOCATION_HEAD,
1173 };
1174
1175 return 0;
1176 }
1177
1178 _public_ int sd_journal_seek_tail(sd_journal *j) {
1179 assert_return(j, -EINVAL);
1180 assert_return(!journal_pid_changed(j), -ECHILD);
1181
1182 detach_location(j);
1183
1184 j->current_location = (Location) {
1185 .type = LOCATION_TAIL,
1186 };
1187
1188 return 0;
1189 }
1190
1191 static void check_network(sd_journal *j, int fd) {
1192 assert(j);
1193
1194 if (j->on_network)
1195 return;
1196
1197 j->on_network = fd_is_network_fs(fd);
1198 }
1199
1200 static bool file_has_type_prefix(const char *prefix, const char *filename) {
1201 const char *full, *tilded, *atted;
1202
1203 full = strjoina(prefix, ".journal");
1204 tilded = strjoina(full, "~");
1205 atted = strjoina(prefix, "@");
1206
1207 return STR_IN_SET(filename, full, tilded) ||
1208 startswith(filename, atted);
1209 }
1210
1211 static bool file_type_wanted(int flags, const char *filename) {
1212 assert(filename);
1213
1214 if (!endswith(filename, ".journal") && !endswith(filename, ".journal~"))
1215 return false;
1216
1217 /* no flags set → every type is OK */
1218 if (!(flags & (SD_JOURNAL_SYSTEM | SD_JOURNAL_CURRENT_USER)))
1219 return true;
1220
1221 if (flags & SD_JOURNAL_SYSTEM && file_has_type_prefix("system", filename))
1222 return true;
1223
1224 if (flags & SD_JOURNAL_CURRENT_USER) {
1225 char prefix[5 + DECIMAL_STR_MAX(uid_t) + 1];
1226
1227 xsprintf(prefix, "user-"UID_FMT, getuid());
1228
1229 if (file_has_type_prefix(prefix, filename))
1230 return true;
1231 }
1232
1233 return false;
1234 }
1235
1236 static bool path_has_prefix(sd_journal *j, const char *path, const char *prefix) {
1237 assert(j);
1238 assert(path);
1239 assert(prefix);
1240
1241 if (j->toplevel_fd >= 0)
1242 return false;
1243
1244 return path_startswith(path, prefix);
1245 }
1246
1247 static void track_file_disposition(sd_journal *j, JournalFile *f) {
1248 assert(j);
1249 assert(f);
1250
1251 if (!j->has_runtime_files && path_has_prefix(j, f->path, "/run"))
1252 j->has_runtime_files = true;
1253 else if (!j->has_persistent_files && path_has_prefix(j, f->path, "/var"))
1254 j->has_persistent_files = true;
1255 }
1256
1257 static const char *skip_slash(const char *p) {
1258
1259 if (!p)
1260 return NULL;
1261
1262 while (*p == '/')
1263 p++;
1264
1265 return p;
1266 }
1267
1268 static int add_any_file(
1269 sd_journal *j,
1270 int fd,
1271 const char *path) {
1272
1273 bool close_fd = false;
1274 JournalFile *f;
1275 struct stat st;
1276 int r, k;
1277
1278 assert(j);
1279 assert(fd >= 0 || path);
1280
1281 if (fd < 0) {
1282 if (j->toplevel_fd >= 0)
1283 /* If there's a top-level fd defined make the path relative, explicitly, since otherwise
1284 * openat() ignores the first argument. */
1285
1286 fd = openat(j->toplevel_fd, skip_slash(path), O_RDONLY|O_CLOEXEC|O_NONBLOCK);
1287 else
1288 fd = open(path, O_RDONLY|O_CLOEXEC|O_NONBLOCK);
1289 if (fd < 0) {
1290 r = log_debug_errno(errno, "Failed to open journal file %s: %m", path);
1291 goto finish;
1292 }
1293
1294 close_fd = true;
1295
1296 r = fd_nonblock(fd, false);
1297 if (r < 0) {
1298 r = log_debug_errno(errno, "Failed to turn off O_NONBLOCK for %s: %m", path);
1299 goto finish;
1300 }
1301 }
1302
1303 if (fstat(fd, &st) < 0) {
1304 r = log_debug_errno(errno, "Failed to fstat file '%s': %m", path);
1305 goto finish;
1306 }
1307
1308 r = stat_verify_regular(&st);
1309 if (r < 0) {
1310 log_debug_errno(r, "Refusing to open '%s', as it is not a regular file.", path);
1311 goto finish;
1312 }
1313
1314 f = ordered_hashmap_get(j->files, path);
1315 if (f) {
1316 if (stat_inode_same(&f->last_stat, &st)) {
1317
1318 /* We already track this file, under the same path and with the same device/inode numbers, it's
1319 * hence really the same. Mark this file as seen in this generation. This is used to GC old
1320 * files in process_q_overflow() to detect journal files that are still there and discern them
1321 * from those which are gone. */
1322
1323 f->last_seen_generation = j->generation;
1324 r = 0;
1325 goto finish;
1326 }
1327
1328 /* So we tracked a file under this name, but it has a different inode/device. In that case, it got
1329 * replaced (probably due to rotation?), let's drop it hence from our list. */
1330 remove_file_real(j, f);
1331 f = NULL;
1332 }
1333
1334 if (ordered_hashmap_size(j->files) >= JOURNAL_FILES_MAX) {
1335 log_debug("Too many open journal files, not adding %s.", path);
1336 r = -ETOOMANYREFS;
1337 goto finish;
1338 }
1339
1340 r = journal_file_open(fd, path, O_RDONLY, 0, false, 0, false, NULL, j->mmap, NULL, &f);
1341 if (r < 0) {
1342 log_debug_errno(r, "Failed to open journal file %s: %m", path);
1343 goto finish;
1344 }
1345
1346 /* journal_file_dump(f); */
1347
1348 r = ordered_hashmap_put(j->files, f->path, f);
1349 if (r < 0) {
1350 f->close_fd = false; /* make sure journal_file_close() doesn't close the caller's fd (or our own). We'll let the caller do that, or ourselves */
1351 (void) journal_file_close(f);
1352 goto finish;
1353 }
1354
1355 close_fd = false; /* the fd is now owned by the JournalFile object */
1356
1357 f->last_seen_generation = j->generation;
1358
1359 track_file_disposition(j, f);
1360 check_network(j, f->fd);
1361
1362 j->current_invalidate_counter++;
1363
1364 log_debug("File %s added.", f->path);
1365
1366 r = 0;
1367
1368 finish:
1369 if (close_fd)
1370 safe_close(fd);
1371
1372 if (r < 0) {
1373 k = journal_put_error(j, r, path);
1374 if (k < 0)
1375 return k;
1376 }
1377
1378 return r;
1379 }
1380
1381 static int add_file_by_name(
1382 sd_journal *j,
1383 const char *prefix,
1384 const char *filename) {
1385
1386 const char *path;
1387
1388 assert(j);
1389 assert(prefix);
1390 assert(filename);
1391
1392 if (j->no_new_files)
1393 return 0;
1394
1395 if (!file_type_wanted(j->flags, filename))
1396 return 0;
1397
1398 path = prefix_roota(prefix, filename);
1399 return add_any_file(j, -1, path);
1400 }
1401
1402 static void remove_file_by_name(
1403 sd_journal *j,
1404 const char *prefix,
1405 const char *filename) {
1406
1407 const char *path;
1408 JournalFile *f;
1409
1410 assert(j);
1411 assert(prefix);
1412 assert(filename);
1413
1414 path = prefix_roota(prefix, filename);
1415 f = ordered_hashmap_get(j->files, path);
1416 if (!f)
1417 return;
1418
1419 remove_file_real(j, f);
1420 }
1421
1422 static void remove_file_real(sd_journal *j, JournalFile *f) {
1423 assert(j);
1424 assert(f);
1425
1426 (void) ordered_hashmap_remove(j->files, f->path);
1427
1428 log_debug("File %s removed.", f->path);
1429
1430 if (j->current_file == f) {
1431 j->current_file = NULL;
1432 j->current_field = 0;
1433 }
1434
1435 if (j->unique_file == f) {
1436 /* Jump to the next unique_file or NULL if that one was last */
1437 j->unique_file = ordered_hashmap_next(j->files, j->unique_file->path);
1438 j->unique_offset = 0;
1439 if (!j->unique_file)
1440 j->unique_file_lost = true;
1441 }
1442
1443 if (j->fields_file == f) {
1444 j->fields_file = ordered_hashmap_next(j->files, j->fields_file->path);
1445 j->fields_offset = 0;
1446 if (!j->fields_file)
1447 j->fields_file_lost = true;
1448 }
1449
1450 (void) journal_file_close(f);
1451
1452 j->current_invalidate_counter++;
1453 }
1454
1455 static int dirname_is_machine_id(const char *fn) {
1456 sd_id128_t id, machine;
1457 const char *e;
1458 int r;
1459
1460 /* Returns true if the specified directory name matches the local machine ID */
1461
1462 r = sd_id128_get_machine(&machine);
1463 if (r < 0)
1464 return r;
1465
1466 e = strchr(fn, '.');
1467 if (e) {
1468 const char *k;
1469
1470 /* Looks like it has a namespace suffix. Verify that. */
1471 if (!log_namespace_name_valid(e + 1))
1472 return false;
1473
1474 k = strndupa_safe(fn, e - fn);
1475 r = sd_id128_from_string(k, &id);
1476 } else
1477 r = sd_id128_from_string(fn, &id);
1478 if (r < 0)
1479 return r;
1480
1481 return sd_id128_equal(id, machine);
1482 }
1483
1484 static int dirname_has_namespace(const char *fn, const char *namespace) {
1485 const char *e;
1486
1487 /* Returns true if the specified directory name matches the specified namespace */
1488
1489 e = strchr(fn, '.');
1490 if (e) {
1491 const char *k;
1492
1493 if (!namespace)
1494 return false;
1495
1496 if (!streq(e + 1, namespace))
1497 return false;
1498
1499 k = strndupa_safe(fn, e - fn);
1500 return id128_is_valid(k);
1501 }
1502
1503 if (namespace)
1504 return false;
1505
1506 return id128_is_valid(fn);
1507 }
1508
1509 static bool dirent_is_journal_file(const struct dirent *de) {
1510 assert(de);
1511
1512 /* Returns true if the specified directory entry looks like a journal file we might be interested in */
1513
1514 if (!IN_SET(de->d_type, DT_REG, DT_LNK, DT_UNKNOWN))
1515 return false;
1516
1517 return endswith(de->d_name, ".journal") ||
1518 endswith(de->d_name, ".journal~");
1519 }
1520
1521 static bool dirent_is_journal_subdir(const struct dirent *de) {
1522 const char *e, *n;
1523 assert(de);
1524
1525 /* returns true if the specified directory entry looks like a directory that might contain journal
1526 * files we might be interested in, i.e. is either a 128bit ID or a 128bit ID suffixed by a
1527 * namespace. */
1528
1529 if (!IN_SET(de->d_type, DT_DIR, DT_LNK, DT_UNKNOWN))
1530 return false;
1531
1532 e = strchr(de->d_name, '.');
1533 if (!e)
1534 return id128_is_valid(de->d_name); /* No namespace */
1535
1536 n = strndupa_safe(de->d_name, e - de->d_name);
1537 if (!id128_is_valid(n))
1538 return false;
1539
1540 return log_namespace_name_valid(e + 1);
1541 }
1542
1543 static int directory_open(sd_journal *j, const char *path, DIR **ret) {
1544 DIR *d;
1545
1546 assert(j);
1547 assert(path);
1548 assert(ret);
1549
1550 if (j->toplevel_fd < 0)
1551 d = opendir(path);
1552 else
1553 /* Open the specified directory relative to the toplevel fd. Enforce that the path specified is
1554 * relative, by dropping the initial slash */
1555 d = xopendirat(j->toplevel_fd, skip_slash(path), 0);
1556 if (!d)
1557 return -errno;
1558
1559 *ret = d;
1560 return 0;
1561 }
1562
1563 static int add_directory(sd_journal *j, const char *prefix, const char *dirname);
1564
1565 static void directory_enumerate(sd_journal *j, Directory *m, DIR *d) {
1566 assert(j);
1567 assert(m);
1568 assert(d);
1569
1570 FOREACH_DIRENT_ALL(de, d, goto fail) {
1571 if (dirent_is_journal_file(de))
1572 (void) add_file_by_name(j, m->path, de->d_name);
1573
1574 if (m->is_root && dirent_is_journal_subdir(de))
1575 (void) add_directory(j, m->path, de->d_name);
1576 }
1577
1578 return;
1579 fail:
1580 log_debug_errno(errno, "Failed to enumerate directory %s, ignoring: %m", m->path);
1581 }
1582
1583 static void directory_watch(sd_journal *j, Directory *m, int fd, uint32_t mask) {
1584 int r;
1585
1586 assert(j);
1587 assert(m);
1588 assert(fd >= 0);
1589
1590 /* Watch this directory if that's enabled and if it not being watched yet. */
1591
1592 if (m->wd > 0) /* Already have a watch? */
1593 return;
1594 if (j->inotify_fd < 0) /* Not watching at all? */
1595 return;
1596
1597 m->wd = inotify_add_watch_fd(j->inotify_fd, fd, mask);
1598 if (m->wd < 0) {
1599 log_debug_errno(errno, "Failed to watch journal directory '%s', ignoring: %m", m->path);
1600 return;
1601 }
1602
1603 r = hashmap_put(j->directories_by_wd, INT_TO_PTR(m->wd), m);
1604 if (r == -EEXIST)
1605 log_debug_errno(r, "Directory '%s' already being watched under a different path, ignoring: %m", m->path);
1606 if (r < 0) {
1607 log_debug_errno(r, "Failed to add watch for journal directory '%s' to hashmap, ignoring: %m", m->path);
1608 (void) inotify_rm_watch(j->inotify_fd, m->wd);
1609 m->wd = -1;
1610 }
1611 }
1612
1613 static int add_directory(
1614 sd_journal *j,
1615 const char *prefix,
1616 const char *dirname) {
1617
1618 _cleanup_free_ char *path = NULL;
1619 _cleanup_closedir_ DIR *d = NULL;
1620 Directory *m;
1621 int r, k;
1622
1623 assert(j);
1624 assert(prefix);
1625
1626 /* Adds a journal file directory to watch. If the directory is already tracked this updates the inotify watch
1627 * and reenumerates directory contents */
1628
1629 path = path_join(prefix, dirname);
1630 if (!path) {
1631 r = -ENOMEM;
1632 goto fail;
1633 }
1634
1635 log_debug("Considering directory '%s'.", path);
1636
1637 /* We consider everything local that is in a directory for the local machine ID, or that is stored in /run */
1638 if ((j->flags & SD_JOURNAL_LOCAL_ONLY) &&
1639 !((dirname && dirname_is_machine_id(dirname) > 0) || path_has_prefix(j, path, "/run")))
1640 return 0;
1641
1642 if (dirname &&
1643 (!(FLAGS_SET(j->flags, SD_JOURNAL_ALL_NAMESPACES) ||
1644 dirname_has_namespace(dirname, j->namespace) > 0 ||
1645 (FLAGS_SET(j->flags, SD_JOURNAL_INCLUDE_DEFAULT_NAMESPACE) && dirname_has_namespace(dirname, NULL) > 0))))
1646 return 0;
1647
1648 r = directory_open(j, path, &d);
1649 if (r < 0) {
1650 log_debug_errno(r, "Failed to open directory '%s': %m", path);
1651 goto fail;
1652 }
1653
1654 m = hashmap_get(j->directories_by_path, path);
1655 if (!m) {
1656 m = new(Directory, 1);
1657 if (!m) {
1658 r = -ENOMEM;
1659 goto fail;
1660 }
1661
1662 *m = (Directory) {
1663 .is_root = false,
1664 .path = path,
1665 };
1666
1667 if (hashmap_put(j->directories_by_path, m->path, m) < 0) {
1668 free(m);
1669 r = -ENOMEM;
1670 goto fail;
1671 }
1672
1673 path = NULL; /* avoid freeing in cleanup */
1674 j->current_invalidate_counter++;
1675
1676 log_debug("Directory %s added.", m->path);
1677
1678 } else if (m->is_root)
1679 return 0; /* Don't 'downgrade' from root directory */
1680
1681 m->last_seen_generation = j->generation;
1682
1683 directory_watch(j, m, dirfd(d),
1684 IN_CREATE|IN_MOVED_TO|IN_MODIFY|IN_ATTRIB|IN_DELETE|
1685 IN_DELETE_SELF|IN_MOVE_SELF|IN_UNMOUNT|IN_MOVED_FROM|
1686 IN_ONLYDIR);
1687
1688 if (!j->no_new_files)
1689 directory_enumerate(j, m, d);
1690
1691 check_network(j, dirfd(d));
1692
1693 return 0;
1694
1695 fail:
1696 k = journal_put_error(j, r, path ?: prefix);
1697 if (k < 0)
1698 return k;
1699
1700 return r;
1701 }
1702
1703 static int add_root_directory(sd_journal *j, const char *p, bool missing_ok) {
1704
1705 _cleanup_closedir_ DIR *d = NULL;
1706 Directory *m;
1707 int r, k;
1708
1709 assert(j);
1710
1711 /* Adds a root directory to our set of directories to use. If the root directory is already in the set, we
1712 * update the inotify logic, and renumerate the directory entries. This call may hence be called to initially
1713 * populate the set, as well as to update it later. */
1714
1715 if (p) {
1716 /* If there's a path specified, use it. */
1717
1718 log_debug("Considering root directory '%s'.", p);
1719
1720 if ((j->flags & SD_JOURNAL_RUNTIME_ONLY) &&
1721 !path_has_prefix(j, p, "/run"))
1722 return -EINVAL;
1723
1724 if (j->prefix)
1725 p = strjoina(j->prefix, p);
1726
1727 r = directory_open(j, p, &d);
1728 if (r == -ENOENT && missing_ok)
1729 return 0;
1730 if (r < 0) {
1731 log_debug_errno(r, "Failed to open root directory %s: %m", p);
1732 goto fail;
1733 }
1734 } else {
1735 _cleanup_close_ int dfd = -1;
1736
1737 /* If there's no path specified, then we use the top-level fd itself. We duplicate the fd here, since
1738 * opendir() will take possession of the fd, and close it, which we don't want. */
1739
1740 p = "."; /* store this as "." in the directories hashmap */
1741
1742 dfd = fcntl(j->toplevel_fd, F_DUPFD_CLOEXEC, 3);
1743 if (dfd < 0) {
1744 r = -errno;
1745 goto fail;
1746 }
1747
1748 d = take_fdopendir(&dfd);
1749 if (!d) {
1750 r = -errno;
1751 goto fail;
1752 }
1753
1754 rewinddir(d);
1755 }
1756
1757 m = hashmap_get(j->directories_by_path, p);
1758 if (!m) {
1759 m = new0(Directory, 1);
1760 if (!m) {
1761 r = -ENOMEM;
1762 goto fail;
1763 }
1764
1765 m->is_root = true;
1766
1767 m->path = strdup(p);
1768 if (!m->path) {
1769 free(m);
1770 r = -ENOMEM;
1771 goto fail;
1772 }
1773
1774 if (hashmap_put(j->directories_by_path, m->path, m) < 0) {
1775 free(m->path);
1776 free(m);
1777 r = -ENOMEM;
1778 goto fail;
1779 }
1780
1781 j->current_invalidate_counter++;
1782
1783 log_debug("Root directory %s added.", m->path);
1784
1785 } else if (!m->is_root)
1786 return 0;
1787
1788 directory_watch(j, m, dirfd(d),
1789 IN_CREATE|IN_MOVED_TO|IN_MODIFY|IN_ATTRIB|IN_DELETE|
1790 IN_ONLYDIR);
1791
1792 if (!j->no_new_files)
1793 directory_enumerate(j, m, d);
1794
1795 check_network(j, dirfd(d));
1796
1797 return 0;
1798
1799 fail:
1800 k = journal_put_error(j, r, p);
1801 if (k < 0)
1802 return k;
1803
1804 return r;
1805 }
1806
1807 static void remove_directory(sd_journal *j, Directory *d) {
1808 assert(j);
1809
1810 if (d->wd > 0) {
1811 hashmap_remove(j->directories_by_wd, INT_TO_PTR(d->wd));
1812
1813 if (j->inotify_fd >= 0)
1814 (void) inotify_rm_watch(j->inotify_fd, d->wd);
1815 }
1816
1817 hashmap_remove(j->directories_by_path, d->path);
1818
1819 if (d->is_root)
1820 log_debug("Root directory %s removed.", d->path);
1821 else
1822 log_debug("Directory %s removed.", d->path);
1823
1824 free(d->path);
1825 free(d);
1826 }
1827
1828 static int add_search_paths(sd_journal *j) {
1829
1830 static const char search_paths[] =
1831 "/run/log/journal\0"
1832 "/var/log/journal\0";
1833 const char *p;
1834
1835 assert(j);
1836
1837 /* We ignore most errors here, since the idea is to only open
1838 * what's actually accessible, and ignore the rest. */
1839
1840 NULSTR_FOREACH(p, search_paths)
1841 (void) add_root_directory(j, p, true);
1842
1843 if (!(j->flags & SD_JOURNAL_LOCAL_ONLY))
1844 (void) add_root_directory(j, "/var/log/journal/remote", true);
1845
1846 return 0;
1847 }
1848
1849 static int add_current_paths(sd_journal *j) {
1850 JournalFile *f;
1851
1852 assert(j);
1853 assert(j->no_new_files);
1854
1855 /* Simply adds all directories for files we have open as directories. We don't expect errors here, so we
1856 * treat them as fatal. */
1857
1858 ORDERED_HASHMAP_FOREACH(f, j->files) {
1859 _cleanup_free_ char *dir = NULL;
1860 int r;
1861
1862 dir = dirname_malloc(f->path);
1863 if (!dir)
1864 return -ENOMEM;
1865
1866 r = add_directory(j, dir, NULL);
1867 if (r < 0)
1868 return r;
1869 }
1870
1871 return 0;
1872 }
1873
1874 static int allocate_inotify(sd_journal *j) {
1875 assert(j);
1876
1877 if (j->inotify_fd < 0) {
1878 j->inotify_fd = inotify_init1(IN_NONBLOCK|IN_CLOEXEC);
1879 if (j->inotify_fd < 0)
1880 return -errno;
1881 }
1882
1883 return hashmap_ensure_allocated(&j->directories_by_wd, NULL);
1884 }
1885
1886 static sd_journal *journal_new(int flags, const char *path, const char *namespace) {
1887 _cleanup_(sd_journal_closep) sd_journal *j = NULL;
1888
1889 j = new0(sd_journal, 1);
1890 if (!j)
1891 return NULL;
1892
1893 j->original_pid = getpid_cached();
1894 j->toplevel_fd = -1;
1895 j->inotify_fd = -1;
1896 j->flags = flags;
1897 j->data_threshold = DEFAULT_DATA_THRESHOLD;
1898
1899 if (path) {
1900 char *t;
1901
1902 t = strdup(path);
1903 if (!t)
1904 return NULL;
1905
1906 if (flags & SD_JOURNAL_OS_ROOT)
1907 j->prefix = t;
1908 else
1909 j->path = t;
1910 }
1911
1912 if (namespace) {
1913 j->namespace = strdup(namespace);
1914 if (!j->namespace)
1915 return NULL;
1916 }
1917
1918 j->files = ordered_hashmap_new(&path_hash_ops);
1919 if (!j->files)
1920 return NULL;
1921
1922 j->files_cache = ordered_hashmap_iterated_cache_new(j->files);
1923 j->directories_by_path = hashmap_new(&path_hash_ops);
1924 j->mmap = mmap_cache_new();
1925 if (!j->files_cache || !j->directories_by_path || !j->mmap)
1926 return NULL;
1927
1928 return TAKE_PTR(j);
1929 }
1930
1931 #define OPEN_ALLOWED_FLAGS \
1932 (SD_JOURNAL_LOCAL_ONLY | \
1933 SD_JOURNAL_RUNTIME_ONLY | \
1934 SD_JOURNAL_SYSTEM | \
1935 SD_JOURNAL_CURRENT_USER | \
1936 SD_JOURNAL_ALL_NAMESPACES | \
1937 SD_JOURNAL_INCLUDE_DEFAULT_NAMESPACE)
1938
1939 _public_ int sd_journal_open_namespace(sd_journal **ret, const char *namespace, int flags) {
1940 _cleanup_(sd_journal_closep) sd_journal *j = NULL;
1941 int r;
1942
1943 assert_return(ret, -EINVAL);
1944 assert_return((flags & ~OPEN_ALLOWED_FLAGS) == 0, -EINVAL);
1945
1946 j = journal_new(flags, NULL, namespace);
1947 if (!j)
1948 return -ENOMEM;
1949
1950 r = add_search_paths(j);
1951 if (r < 0)
1952 return r;
1953
1954 *ret = TAKE_PTR(j);
1955 return 0;
1956 }
1957
1958 _public_ int sd_journal_open(sd_journal **ret, int flags) {
1959 return sd_journal_open_namespace(ret, NULL, flags);
1960 }
1961
1962 #define OPEN_CONTAINER_ALLOWED_FLAGS \
1963 (SD_JOURNAL_LOCAL_ONLY | SD_JOURNAL_SYSTEM)
1964
1965 _public_ int sd_journal_open_container(sd_journal **ret, const char *machine, int flags) {
1966 _cleanup_free_ char *root = NULL, *class = NULL;
1967 _cleanup_(sd_journal_closep) sd_journal *j = NULL;
1968 char *p;
1969 int r;
1970
1971 /* This is deprecated, people should use machined's OpenMachineRootDirectory() call instead in
1972 * combination with sd_journal_open_directory_fd(). */
1973
1974 assert_return(machine, -EINVAL);
1975 assert_return(ret, -EINVAL);
1976 assert_return((flags & ~OPEN_CONTAINER_ALLOWED_FLAGS) == 0, -EINVAL);
1977 assert_return(hostname_is_valid(machine, 0), -EINVAL);
1978
1979 p = strjoina("/run/systemd/machines/", machine);
1980 r = parse_env_file(NULL, p,
1981 "ROOT", &root,
1982 "CLASS", &class);
1983 if (r == -ENOENT)
1984 return -EHOSTDOWN;
1985 if (r < 0)
1986 return r;
1987 if (!root)
1988 return -ENODATA;
1989
1990 if (!streq_ptr(class, "container"))
1991 return -EIO;
1992
1993 j = journal_new(flags, root, NULL);
1994 if (!j)
1995 return -ENOMEM;
1996
1997 r = add_search_paths(j);
1998 if (r < 0)
1999 return r;
2000
2001 *ret = TAKE_PTR(j);
2002 return 0;
2003 }
2004
2005 #define OPEN_DIRECTORY_ALLOWED_FLAGS \
2006 (SD_JOURNAL_OS_ROOT | \
2007 SD_JOURNAL_SYSTEM | SD_JOURNAL_CURRENT_USER )
2008
2009 _public_ int sd_journal_open_directory(sd_journal **ret, const char *path, int flags) {
2010 _cleanup_(sd_journal_closep) sd_journal *j = NULL;
2011 int r;
2012
2013 assert_return(ret, -EINVAL);
2014 assert_return(path, -EINVAL);
2015 assert_return((flags & ~OPEN_DIRECTORY_ALLOWED_FLAGS) == 0, -EINVAL);
2016
2017 j = journal_new(flags, path, NULL);
2018 if (!j)
2019 return -ENOMEM;
2020
2021 if (flags & SD_JOURNAL_OS_ROOT)
2022 r = add_search_paths(j);
2023 else
2024 r = add_root_directory(j, path, false);
2025 if (r < 0)
2026 return r;
2027
2028 *ret = TAKE_PTR(j);
2029 return 0;
2030 }
2031
2032 _public_ int sd_journal_open_files(sd_journal **ret, const char **paths, int flags) {
2033 _cleanup_(sd_journal_closep) sd_journal *j = NULL;
2034 int r;
2035
2036 assert_return(ret, -EINVAL);
2037 assert_return(flags == 0, -EINVAL);
2038
2039 j = journal_new(flags, NULL, NULL);
2040 if (!j)
2041 return -ENOMEM;
2042
2043 STRV_FOREACH(path, paths) {
2044 r = add_any_file(j, -1, *path);
2045 if (r < 0)
2046 return r;
2047 }
2048
2049 j->no_new_files = true;
2050
2051 *ret = TAKE_PTR(j);
2052 return 0;
2053 }
2054
2055 #define OPEN_DIRECTORY_FD_ALLOWED_FLAGS \
2056 (SD_JOURNAL_OS_ROOT | \
2057 SD_JOURNAL_SYSTEM | SD_JOURNAL_CURRENT_USER )
2058
2059 _public_ int sd_journal_open_directory_fd(sd_journal **ret, int fd, int flags) {
2060 _cleanup_(sd_journal_closep) sd_journal *j = NULL;
2061 struct stat st;
2062 int r;
2063
2064 assert_return(ret, -EINVAL);
2065 assert_return(fd >= 0, -EBADF);
2066 assert_return((flags & ~OPEN_DIRECTORY_FD_ALLOWED_FLAGS) == 0, -EINVAL);
2067
2068 if (fstat(fd, &st) < 0)
2069 return -errno;
2070
2071 if (!S_ISDIR(st.st_mode))
2072 return -EBADFD;
2073
2074 j = journal_new(flags, NULL, NULL);
2075 if (!j)
2076 return -ENOMEM;
2077
2078 j->toplevel_fd = fd;
2079
2080 if (flags & SD_JOURNAL_OS_ROOT)
2081 r = add_search_paths(j);
2082 else
2083 r = add_root_directory(j, NULL, false);
2084 if (r < 0)
2085 return r;
2086
2087 *ret = TAKE_PTR(j);
2088 return 0;
2089 }
2090
2091 _public_ int sd_journal_open_files_fd(sd_journal **ret, int fds[], unsigned n_fds, int flags) {
2092 JournalFile *f;
2093 _cleanup_(sd_journal_closep) sd_journal *j = NULL;
2094 unsigned i;
2095 int r;
2096
2097 assert_return(ret, -EINVAL);
2098 assert_return(n_fds > 0, -EBADF);
2099 assert_return(flags == 0, -EINVAL);
2100
2101 j = journal_new(flags, NULL, NULL);
2102 if (!j)
2103 return -ENOMEM;
2104
2105 for (i = 0; i < n_fds; i++) {
2106 struct stat st;
2107
2108 if (fds[i] < 0) {
2109 r = -EBADF;
2110 goto fail;
2111 }
2112
2113 if (fstat(fds[i], &st) < 0) {
2114 r = -errno;
2115 goto fail;
2116 }
2117
2118 r = stat_verify_regular(&st);
2119 if (r < 0)
2120 goto fail;
2121
2122 r = add_any_file(j, fds[i], NULL);
2123 if (r < 0)
2124 goto fail;
2125 }
2126
2127 j->no_new_files = true;
2128 j->no_inotify = true;
2129
2130 *ret = TAKE_PTR(j);
2131 return 0;
2132
2133 fail:
2134 /* If we fail, make sure we don't take possession of the files we managed to make use of successfully, and they
2135 * remain open */
2136 ORDERED_HASHMAP_FOREACH(f, j->files)
2137 f->close_fd = false;
2138
2139 return r;
2140 }
2141
2142 _public_ void sd_journal_close(sd_journal *j) {
2143 Directory *d;
2144
2145 if (!j)
2146 return;
2147
2148 sd_journal_flush_matches(j);
2149
2150 ordered_hashmap_free_with_destructor(j->files, journal_file_close);
2151 iterated_cache_free(j->files_cache);
2152
2153 while ((d = hashmap_first(j->directories_by_path)))
2154 remove_directory(j, d);
2155
2156 while ((d = hashmap_first(j->directories_by_wd)))
2157 remove_directory(j, d);
2158
2159 hashmap_free(j->directories_by_path);
2160 hashmap_free(j->directories_by_wd);
2161
2162 safe_close(j->inotify_fd);
2163
2164 if (j->mmap) {
2165 mmap_cache_stats_log_debug(j->mmap);
2166 mmap_cache_unref(j->mmap);
2167 }
2168
2169 hashmap_free_free(j->errors);
2170
2171 free(j->path);
2172 free(j->prefix);
2173 free(j->namespace);
2174 free(j->unique_field);
2175 free(j->fields_buffer);
2176 free(j);
2177 }
2178
2179 _public_ int sd_journal_get_realtime_usec(sd_journal *j, uint64_t *ret) {
2180 Object *o;
2181 JournalFile *f;
2182 int r;
2183
2184 assert_return(j, -EINVAL);
2185 assert_return(!journal_pid_changed(j), -ECHILD);
2186 assert_return(ret, -EINVAL);
2187
2188 f = j->current_file;
2189 if (!f)
2190 return -EADDRNOTAVAIL;
2191
2192 if (f->current_offset <= 0)
2193 return -EADDRNOTAVAIL;
2194
2195 r = journal_file_move_to_object(f, OBJECT_ENTRY, f->current_offset, &o);
2196 if (r < 0)
2197 return r;
2198
2199 *ret = le64toh(o->entry.realtime);
2200 return 0;
2201 }
2202
2203 _public_ int sd_journal_get_monotonic_usec(sd_journal *j, uint64_t *ret, sd_id128_t *ret_boot_id) {
2204 Object *o;
2205 JournalFile *f;
2206 int r;
2207
2208 assert_return(j, -EINVAL);
2209 assert_return(!journal_pid_changed(j), -ECHILD);
2210
2211 f = j->current_file;
2212 if (!f)
2213 return -EADDRNOTAVAIL;
2214
2215 if (f->current_offset <= 0)
2216 return -EADDRNOTAVAIL;
2217
2218 r = journal_file_move_to_object(f, OBJECT_ENTRY, f->current_offset, &o);
2219 if (r < 0)
2220 return r;
2221
2222 if (ret_boot_id)
2223 *ret_boot_id = o->entry.boot_id;
2224 else {
2225 sd_id128_t id;
2226
2227 r = sd_id128_get_boot(&id);
2228 if (r < 0)
2229 return r;
2230
2231 if (!sd_id128_equal(id, o->entry.boot_id))
2232 return -ESTALE;
2233 }
2234
2235 if (ret)
2236 *ret = le64toh(o->entry.monotonic);
2237
2238 return 0;
2239 }
2240
2241 static bool field_is_valid(const char *field) {
2242 const char *p;
2243
2244 assert(field);
2245
2246 if (isempty(field))
2247 return false;
2248
2249 if (startswith(field, "__"))
2250 return false;
2251
2252 for (p = field; *p; p++) {
2253
2254 if (*p == '_')
2255 continue;
2256
2257 if (*p >= 'A' && *p <= 'Z')
2258 continue;
2259
2260 if (*p >= '0' && *p <= '9')
2261 continue;
2262
2263 return false;
2264 }
2265
2266 return true;
2267 }
2268
2269 _public_ int sd_journal_get_data(sd_journal *j, const char *field, const void **data, size_t *size) {
2270 JournalFile *f;
2271 uint64_t i, n;
2272 size_t field_length;
2273 int r;
2274 Object *o;
2275
2276 assert_return(j, -EINVAL);
2277 assert_return(!journal_pid_changed(j), -ECHILD);
2278 assert_return(field, -EINVAL);
2279 assert_return(data, -EINVAL);
2280 assert_return(size, -EINVAL);
2281 assert_return(field_is_valid(field), -EINVAL);
2282
2283 f = j->current_file;
2284 if (!f)
2285 return -EADDRNOTAVAIL;
2286
2287 if (f->current_offset <= 0)
2288 return -EADDRNOTAVAIL;
2289
2290 r = journal_file_move_to_object(f, OBJECT_ENTRY, f->current_offset, &o);
2291 if (r < 0)
2292 return r;
2293
2294 field_length = strlen(field);
2295
2296 n = journal_file_entry_n_items(o);
2297 for (i = 0; i < n; i++) {
2298 Object *d;
2299 uint64_t p, l;
2300 size_t t;
2301 int compression;
2302
2303 p = le64toh(o->entry.items[i].object_offset);
2304 r = journal_file_move_to_object(f, OBJECT_DATA, p, &d);
2305 if (IN_SET(r, -EADDRNOTAVAIL, -EBADMSG)) {
2306 log_debug_errno(r, "Entry item %"PRIu64" data object is bad, skipping over it: %m", i);
2307 continue;
2308 }
2309 if (r < 0)
2310 return r;
2311
2312 l = le64toh(d->object.size) - offsetof(Object, data.payload);
2313
2314 compression = d->object.flags & OBJECT_COMPRESSION_MASK;
2315 if (compression) {
2316 #if HAVE_COMPRESSION
2317 r = decompress_startswith(compression,
2318 d->data.payload, l,
2319 &f->compress_buffer,
2320 field, field_length, '=');
2321 if (r < 0)
2322 log_debug_errno(r, "Cannot decompress %s object of length %"PRIu64" at offset "OFSfmt": %m",
2323 object_compressed_to_string(compression), l, p);
2324 else if (r > 0) {
2325
2326 size_t rsize;
2327
2328 r = decompress_blob(compression,
2329 d->data.payload, l,
2330 &f->compress_buffer, &rsize,
2331 j->data_threshold);
2332 if (r < 0)
2333 return r;
2334
2335 *data = f->compress_buffer;
2336 *size = (size_t) rsize;
2337
2338 return 0;
2339 }
2340 #else
2341 return -EPROTONOSUPPORT;
2342 #endif
2343 } else if (l >= field_length+1 &&
2344 memcmp(d->data.payload, field, field_length) == 0 &&
2345 d->data.payload[field_length] == '=') {
2346
2347 t = (size_t) l;
2348
2349 if ((uint64_t) t != l)
2350 return -E2BIG;
2351
2352 *data = d->data.payload;
2353 *size = t;
2354
2355 return 0;
2356 }
2357 }
2358
2359 return -ENOENT;
2360 }
2361
2362 static int return_data(
2363 sd_journal *j,
2364 JournalFile *f,
2365 Object *o,
2366 const void **ret_data,
2367 size_t *ret_size) {
2368
2369 size_t t;
2370 uint64_t l;
2371 int compression;
2372
2373 assert(j);
2374 assert(f);
2375
2376 l = le64toh(READ_NOW(o->object.size));
2377 if (l < offsetof(Object, data.payload))
2378 return -EBADMSG;
2379 l -= offsetof(Object, data.payload);
2380
2381 /* We can't read objects larger than 4G on a 32bit machine */
2382 t = (size_t) l;
2383 if ((uint64_t) t != l)
2384 return -E2BIG;
2385
2386 compression = o->object.flags & OBJECT_COMPRESSION_MASK;
2387 if (compression) {
2388 #if HAVE_COMPRESSION
2389 size_t rsize;
2390 int r;
2391
2392 r = decompress_blob(
2393 compression,
2394 o->data.payload, l,
2395 &f->compress_buffer, &rsize,
2396 j->data_threshold);
2397 if (r < 0)
2398 return r;
2399
2400 if (ret_data)
2401 *ret_data = f->compress_buffer;
2402 if (ret_size)
2403 *ret_size = (size_t) rsize;
2404 #else
2405 return -EPROTONOSUPPORT;
2406 #endif
2407 } else {
2408 if (ret_data)
2409 *ret_data = o->data.payload;
2410 if (ret_size)
2411 *ret_size = t;
2412 }
2413
2414 return 0;
2415 }
2416
2417 _public_ int sd_journal_enumerate_data(sd_journal *j, const void **data, size_t *size) {
2418 JournalFile *f;
2419 Object *o;
2420 int r;
2421
2422 assert_return(j, -EINVAL);
2423 assert_return(!journal_pid_changed(j), -ECHILD);
2424 assert_return(data, -EINVAL);
2425 assert_return(size, -EINVAL);
2426
2427 f = j->current_file;
2428 if (!f)
2429 return -EADDRNOTAVAIL;
2430
2431 if (f->current_offset <= 0)
2432 return -EADDRNOTAVAIL;
2433
2434 r = journal_file_move_to_object(f, OBJECT_ENTRY, f->current_offset, &o);
2435 if (r < 0)
2436 return r;
2437
2438 for (uint64_t n = journal_file_entry_n_items(o); j->current_field < n; j->current_field++) {
2439 uint64_t p;
2440
2441 p = le64toh(o->entry.items[j->current_field].object_offset);
2442 r = journal_file_move_to_object(f, OBJECT_DATA, p, &o);
2443 if (IN_SET(r, -EADDRNOTAVAIL, -EBADMSG)) {
2444 log_debug_errno(r, "Entry item %"PRIu64" data object is bad, skipping over it: %m", j->current_field);
2445 continue;
2446 }
2447 if (r < 0)
2448 return r;
2449
2450 r = return_data(j, f, o, data, size);
2451 if (r == -EBADMSG) {
2452 log_debug("Entry item %"PRIu64" data payload is bad, skipping over it.", j->current_field);
2453 continue;
2454 }
2455 if (r < 0)
2456 return r;
2457
2458 j->current_field++;
2459
2460 return 1;
2461 }
2462
2463 return 0;
2464 }
2465
2466 _public_ int sd_journal_enumerate_available_data(sd_journal *j, const void **data, size_t *size) {
2467 for (;;) {
2468 int r;
2469
2470 r = sd_journal_enumerate_data(j, data, size);
2471 if (r >= 0)
2472 return r;
2473 if (!JOURNAL_ERRNO_IS_UNAVAILABLE_FIELD(r))
2474 return r;
2475 j->current_field++; /* Try with the next field */
2476 }
2477 }
2478
2479 _public_ void sd_journal_restart_data(sd_journal *j) {
2480 if (!j)
2481 return;
2482
2483 j->current_field = 0;
2484 }
2485
2486 static int reiterate_all_paths(sd_journal *j) {
2487 assert(j);
2488
2489 if (j->no_new_files)
2490 return add_current_paths(j);
2491
2492 if (j->flags & SD_JOURNAL_OS_ROOT)
2493 return add_search_paths(j);
2494
2495 if (j->toplevel_fd >= 0)
2496 return add_root_directory(j, NULL, false);
2497
2498 if (j->path)
2499 return add_root_directory(j, j->path, true);
2500
2501 return add_search_paths(j);
2502 }
2503
2504 _public_ int sd_journal_get_fd(sd_journal *j) {
2505 int r;
2506
2507 assert_return(j, -EINVAL);
2508 assert_return(!journal_pid_changed(j), -ECHILD);
2509
2510 if (j->no_inotify)
2511 return -EMEDIUMTYPE;
2512
2513 if (j->inotify_fd >= 0)
2514 return j->inotify_fd;
2515
2516 r = allocate_inotify(j);
2517 if (r < 0)
2518 return r;
2519
2520 log_debug("Reiterating files to get inotify watches established.");
2521
2522 /* Iterate through all dirs again, to add them to the inotify */
2523 r = reiterate_all_paths(j);
2524 if (r < 0)
2525 return r;
2526
2527 return j->inotify_fd;
2528 }
2529
2530 _public_ int sd_journal_get_events(sd_journal *j) {
2531 int fd;
2532
2533 assert_return(j, -EINVAL);
2534 assert_return(!journal_pid_changed(j), -ECHILD);
2535
2536 fd = sd_journal_get_fd(j);
2537 if (fd < 0)
2538 return fd;
2539
2540 return POLLIN;
2541 }
2542
2543 _public_ int sd_journal_get_timeout(sd_journal *j, uint64_t *timeout_usec) {
2544 int fd;
2545
2546 assert_return(j, -EINVAL);
2547 assert_return(!journal_pid_changed(j), -ECHILD);
2548 assert_return(timeout_usec, -EINVAL);
2549
2550 fd = sd_journal_get_fd(j);
2551 if (fd < 0)
2552 return fd;
2553
2554 if (!j->on_network) {
2555 *timeout_usec = UINT64_MAX;
2556 return 0;
2557 }
2558
2559 /* If we are on the network we need to regularly check for
2560 * changes manually */
2561
2562 *timeout_usec = j->last_process_usec + JOURNAL_FILES_RECHECK_USEC;
2563 return 1;
2564 }
2565
2566 static void process_q_overflow(sd_journal *j) {
2567 JournalFile *f;
2568 Directory *m;
2569
2570 assert(j);
2571
2572 /* When the inotify queue overruns we need to enumerate and re-validate all journal files to bring our list
2573 * back in sync with what's on disk. For this we pick a new generation counter value. It'll be assigned to all
2574 * journal files we encounter. All journal files and all directories that don't carry it after reenumeration
2575 * are subject for unloading. */
2576
2577 log_debug("Inotify queue overrun, reiterating everything.");
2578
2579 j->generation++;
2580 (void) reiterate_all_paths(j);
2581
2582 ORDERED_HASHMAP_FOREACH(f, j->files) {
2583
2584 if (f->last_seen_generation == j->generation)
2585 continue;
2586
2587 log_debug("File '%s' hasn't been seen in this enumeration, removing.", f->path);
2588 remove_file_real(j, f);
2589 }
2590
2591 HASHMAP_FOREACH(m, j->directories_by_path) {
2592
2593 if (m->last_seen_generation == j->generation)
2594 continue;
2595
2596 if (m->is_root) /* Never GC root directories */
2597 continue;
2598
2599 log_debug("Directory '%s' hasn't been seen in this enumeration, removing.", f->path);
2600 remove_directory(j, m);
2601 }
2602
2603 log_debug("Reiteration complete.");
2604 }
2605
2606 static void process_inotify_event(sd_journal *j, const struct inotify_event *e) {
2607 Directory *d;
2608
2609 assert(j);
2610 assert(e);
2611
2612 if (e->mask & IN_Q_OVERFLOW) {
2613 process_q_overflow(j);
2614 return;
2615 }
2616
2617 /* Is this a subdirectory we watch? */
2618 d = hashmap_get(j->directories_by_wd, INT_TO_PTR(e->wd));
2619 if (d) {
2620 if (!(e->mask & IN_ISDIR) && e->len > 0 &&
2621 (endswith(e->name, ".journal") ||
2622 endswith(e->name, ".journal~"))) {
2623
2624 /* Event for a journal file */
2625
2626 if (e->mask & (IN_CREATE|IN_MOVED_TO|IN_MODIFY|IN_ATTRIB))
2627 (void) add_file_by_name(j, d->path, e->name);
2628 else if (e->mask & (IN_DELETE|IN_MOVED_FROM|IN_UNMOUNT))
2629 remove_file_by_name(j, d->path, e->name);
2630
2631 } else if (!d->is_root && e->len == 0) {
2632
2633 /* Event for a subdirectory */
2634
2635 if (e->mask & (IN_DELETE_SELF|IN_MOVE_SELF|IN_UNMOUNT))
2636 remove_directory(j, d);
2637
2638 } else if (d->is_root && (e->mask & IN_ISDIR) && e->len > 0 && id128_is_valid(e->name)) {
2639
2640 /* Event for root directory */
2641
2642 if (e->mask & (IN_CREATE|IN_MOVED_TO|IN_MODIFY|IN_ATTRIB))
2643 (void) add_directory(j, d->path, e->name);
2644 }
2645
2646 return;
2647 }
2648
2649 if (e->mask & IN_IGNORED)
2650 return;
2651
2652 log_debug("Unexpected inotify event.");
2653 }
2654
2655 static int determine_change(sd_journal *j) {
2656 bool b;
2657
2658 assert(j);
2659
2660 b = j->current_invalidate_counter != j->last_invalidate_counter;
2661 j->last_invalidate_counter = j->current_invalidate_counter;
2662
2663 return b ? SD_JOURNAL_INVALIDATE : SD_JOURNAL_APPEND;
2664 }
2665
2666 _public_ int sd_journal_process(sd_journal *j) {
2667 bool got_something = false;
2668
2669 assert_return(j, -EINVAL);
2670 assert_return(!journal_pid_changed(j), -ECHILD);
2671
2672 if (j->inotify_fd < 0) /* We have no inotify fd yet? Then there's noting to process. */
2673 return 0;
2674
2675 j->last_process_usec = now(CLOCK_MONOTONIC);
2676 j->last_invalidate_counter = j->current_invalidate_counter;
2677
2678 for (;;) {
2679 union inotify_event_buffer buffer;
2680 struct inotify_event *e;
2681 ssize_t l;
2682
2683 l = read(j->inotify_fd, &buffer, sizeof(buffer));
2684 if (l < 0) {
2685 if (ERRNO_IS_TRANSIENT(errno))
2686 return got_something ? determine_change(j) : SD_JOURNAL_NOP;
2687
2688 return -errno;
2689 }
2690
2691 got_something = true;
2692
2693 FOREACH_INOTIFY_EVENT(e, buffer, l)
2694 process_inotify_event(j, e);
2695 }
2696 }
2697
2698 _public_ int sd_journal_wait(sd_journal *j, uint64_t timeout_usec) {
2699 int r;
2700 uint64_t t;
2701
2702 assert_return(j, -EINVAL);
2703 assert_return(!journal_pid_changed(j), -ECHILD);
2704
2705 if (j->inotify_fd < 0) {
2706 JournalFile *f;
2707
2708 /* This is the first invocation, hence create the
2709 * inotify watch */
2710 r = sd_journal_get_fd(j);
2711 if (r < 0)
2712 return r;
2713
2714 /* Server might have done some vacuuming while we weren't watching.
2715 Get rid of the deleted files now so they don't stay around indefinitely. */
2716 ORDERED_HASHMAP_FOREACH(f, j->files) {
2717 r = journal_file_fstat(f);
2718 if (r == -EIDRM)
2719 remove_file_real(j, f);
2720 else if (r < 0) {
2721 log_debug_errno(r,"Failed to fstat() journal file '%s' : %m", f->path);
2722 continue;
2723 }
2724 }
2725
2726 /* The journal might have changed since the context
2727 * object was created and we weren't watching before,
2728 * hence don't wait for anything, and return
2729 * immediately. */
2730 return determine_change(j);
2731 }
2732
2733 r = sd_journal_get_timeout(j, &t);
2734 if (r < 0)
2735 return r;
2736
2737 if (t != UINT64_MAX) {
2738 t = usec_sub_unsigned(t, now(CLOCK_MONOTONIC));
2739
2740 if (timeout_usec == UINT64_MAX || timeout_usec > t)
2741 timeout_usec = t;
2742 }
2743
2744 do {
2745 r = fd_wait_for_event(j->inotify_fd, POLLIN, timeout_usec);
2746 } while (r == -EINTR);
2747
2748 if (r < 0)
2749 return r;
2750
2751 return sd_journal_process(j);
2752 }
2753
2754 _public_ int sd_journal_get_cutoff_realtime_usec(sd_journal *j, uint64_t *from, uint64_t *to) {
2755 JournalFile *f;
2756 bool first = true;
2757 uint64_t fmin = 0, tmax = 0;
2758 int r;
2759
2760 assert_return(j, -EINVAL);
2761 assert_return(!journal_pid_changed(j), -ECHILD);
2762 assert_return(from || to, -EINVAL);
2763 assert_return(from != to, -EINVAL);
2764
2765 ORDERED_HASHMAP_FOREACH(f, j->files) {
2766 usec_t fr, t;
2767
2768 r = journal_file_get_cutoff_realtime_usec(f, &fr, &t);
2769 if (r == -ENOENT)
2770 continue;
2771 if (r < 0)
2772 return r;
2773 if (r == 0)
2774 continue;
2775
2776 if (first) {
2777 fmin = fr;
2778 tmax = t;
2779 first = false;
2780 } else {
2781 fmin = MIN(fr, fmin);
2782 tmax = MAX(t, tmax);
2783 }
2784 }
2785
2786 if (from)
2787 *from = fmin;
2788 if (to)
2789 *to = tmax;
2790
2791 return first ? 0 : 1;
2792 }
2793
2794 _public_ int sd_journal_get_cutoff_monotonic_usec(
2795 sd_journal *j,
2796 sd_id128_t boot_id,
2797 uint64_t *ret_from,
2798 uint64_t *ret_to) {
2799
2800 uint64_t from = UINT64_MAX, to = UINT64_MAX;
2801 bool found = false;
2802 JournalFile *f;
2803 int r;
2804
2805 assert_return(j, -EINVAL);
2806 assert_return(!journal_pid_changed(j), -ECHILD);
2807 assert_return(ret_from != ret_to, -EINVAL);
2808
2809 ORDERED_HASHMAP_FOREACH(f, j->files) {
2810 usec_t ff, tt;
2811
2812 r = journal_file_get_cutoff_monotonic_usec(f, boot_id, &ff, &tt);
2813 if (r == -ENOENT)
2814 continue;
2815 if (r < 0)
2816 return r;
2817 if (r == 0)
2818 continue;
2819
2820 if (found) {
2821 from = MIN(ff, from);
2822 to = MAX(tt, to);
2823 } else {
2824 from = ff;
2825 to = tt;
2826 found = true;
2827 }
2828 }
2829
2830 if (ret_from)
2831 *ret_from = from;
2832 if (ret_to)
2833 *ret_to = to;
2834
2835 return found;
2836 }
2837
2838 void journal_print_header(sd_journal *j) {
2839 JournalFile *f;
2840 bool newline = false;
2841
2842 assert(j);
2843
2844 ORDERED_HASHMAP_FOREACH(f, j->files) {
2845 if (newline)
2846 putchar('\n');
2847 else
2848 newline = true;
2849
2850 journal_file_print_header(f);
2851 }
2852 }
2853
2854 _public_ int sd_journal_get_usage(sd_journal *j, uint64_t *ret) {
2855 JournalFile *f;
2856 uint64_t sum = 0;
2857
2858 assert_return(j, -EINVAL);
2859 assert_return(!journal_pid_changed(j), -ECHILD);
2860 assert_return(ret, -EINVAL);
2861
2862 ORDERED_HASHMAP_FOREACH(f, j->files) {
2863 struct stat st;
2864 uint64_t b;
2865
2866 if (fstat(f->fd, &st) < 0)
2867 return -errno;
2868
2869 b = (uint64_t) st.st_blocks;
2870 if (b > UINT64_MAX / 512)
2871 return -EOVERFLOW;
2872 b *= 512;
2873
2874 if (sum > UINT64_MAX - b)
2875 return -EOVERFLOW;
2876 sum += b;
2877 }
2878
2879 *ret = sum;
2880 return 0;
2881 }
2882
2883 _public_ int sd_journal_query_unique(sd_journal *j, const char *field) {
2884 int r;
2885
2886 assert_return(j, -EINVAL);
2887 assert_return(!journal_pid_changed(j), -ECHILD);
2888 assert_return(!isempty(field), -EINVAL);
2889 assert_return(field_is_valid(field), -EINVAL);
2890
2891 r = free_and_strdup(&j->unique_field, field);
2892 if (r < 0)
2893 return r;
2894
2895 j->unique_file = NULL;
2896 j->unique_offset = 0;
2897 j->unique_file_lost = false;
2898
2899 return 0;
2900 }
2901
2902 _public_ int sd_journal_enumerate_unique(
2903 sd_journal *j,
2904 const void **ret_data,
2905 size_t *ret_size) {
2906
2907 size_t k;
2908
2909 assert_return(j, -EINVAL);
2910 assert_return(!journal_pid_changed(j), -ECHILD);
2911 assert_return(j->unique_field, -EINVAL);
2912
2913 k = strlen(j->unique_field);
2914
2915 if (!j->unique_file) {
2916 if (j->unique_file_lost)
2917 return 0;
2918
2919 j->unique_file = ordered_hashmap_first(j->files);
2920 if (!j->unique_file)
2921 return 0;
2922
2923 j->unique_offset = 0;
2924 }
2925
2926 for (;;) {
2927 JournalFile *of;
2928 Object *o;
2929 const void *odata;
2930 size_t ol;
2931 bool found;
2932 int r;
2933
2934 /* Proceed to next data object in the field's linked list */
2935 if (j->unique_offset == 0) {
2936 r = journal_file_find_field_object(j->unique_file, j->unique_field, k, &o, NULL);
2937 if (r < 0)
2938 return r;
2939
2940 j->unique_offset = r > 0 ? le64toh(o->field.head_data_offset) : 0;
2941 } else {
2942 r = journal_file_move_to_object(j->unique_file, OBJECT_DATA, j->unique_offset, &o);
2943 if (r < 0)
2944 return r;
2945
2946 j->unique_offset = le64toh(o->data.next_field_offset);
2947 }
2948
2949 /* We reached the end of the list? Then start again, with the next file */
2950 if (j->unique_offset == 0) {
2951 j->unique_file = ordered_hashmap_next(j->files, j->unique_file->path);
2952 if (!j->unique_file)
2953 return 0;
2954
2955 continue;
2956 }
2957
2958 /* We do not use OBJECT_DATA context here, but OBJECT_UNUSED
2959 * instead, so that we can look at this data object at the same
2960 * time as one on another file */
2961 r = journal_file_move_to_object(j->unique_file, OBJECT_UNUSED, j->unique_offset, &o);
2962 if (r < 0)
2963 return r;
2964
2965 /* Let's do the type check by hand, since we used 0 context above. */
2966 if (o->object.type != OBJECT_DATA)
2967 return log_debug_errno(SYNTHETIC_ERRNO(EBADMSG),
2968 "%s:offset " OFSfmt ": object has type %d, expected %d",
2969 j->unique_file->path,
2970 j->unique_offset,
2971 o->object.type, OBJECT_DATA);
2972
2973 r = return_data(j, j->unique_file, o, &odata, &ol);
2974 if (r < 0)
2975 return r;
2976
2977 /* Check if we have at least the field name and "=". */
2978 if (ol <= k)
2979 return log_debug_errno(SYNTHETIC_ERRNO(EBADMSG),
2980 "%s:offset " OFSfmt ": object has size %zu, expected at least %zu",
2981 j->unique_file->path,
2982 j->unique_offset, ol, k + 1);
2983
2984 if (memcmp(odata, j->unique_field, k) != 0 || ((const char*) odata)[k] != '=')
2985 return log_debug_errno(SYNTHETIC_ERRNO(EBADMSG),
2986 "%s:offset " OFSfmt ": object does not start with \"%s=\"",
2987 j->unique_file->path,
2988 j->unique_offset,
2989 j->unique_field);
2990
2991 /* OK, now let's see if we already returned this data object by checking if it exists in the
2992 * earlier traversed files. */
2993 found = false;
2994 ORDERED_HASHMAP_FOREACH(of, j->files) {
2995 if (of == j->unique_file)
2996 break;
2997
2998 /* Skip this file it didn't have any fields indexed */
2999 if (JOURNAL_HEADER_CONTAINS(of->header, n_fields) && le64toh(of->header->n_fields) <= 0)
3000 continue;
3001
3002 /* We can reuse the hash from our current file only on old-style journal files
3003 * without keyed hashes. On new-style files we have to calculate the hash anew, to
3004 * take the per-file hash seed into consideration. */
3005 if (!JOURNAL_HEADER_KEYED_HASH(j->unique_file->header) && !JOURNAL_HEADER_KEYED_HASH(of->header))
3006 r = journal_file_find_data_object_with_hash(of, odata, ol, le64toh(o->data.hash), NULL, NULL);
3007 else
3008 r = journal_file_find_data_object(of, odata, ol, NULL, NULL);
3009 if (r < 0)
3010 return r;
3011 if (r > 0) {
3012 found = true;
3013 break;
3014 }
3015 }
3016
3017 if (found)
3018 continue;
3019
3020 r = return_data(j, j->unique_file, o, ret_data, ret_size);
3021 if (r < 0)
3022 return r;
3023
3024 return 1;
3025 }
3026 }
3027
3028 _public_ int sd_journal_enumerate_available_unique(sd_journal *j, const void **data, size_t *size) {
3029 for (;;) {
3030 int r;
3031
3032 r = sd_journal_enumerate_unique(j, data, size);
3033 if (r >= 0)
3034 return r;
3035 if (!JOURNAL_ERRNO_IS_UNAVAILABLE_FIELD(r))
3036 return r;
3037 /* Try with the next field. sd_journal_enumerate_unique() modifies state, so on the next try
3038 * we will access the next field. */
3039 }
3040 }
3041
3042 _public_ void sd_journal_restart_unique(sd_journal *j) {
3043 if (!j)
3044 return;
3045
3046 j->unique_file = NULL;
3047 j->unique_offset = 0;
3048 j->unique_file_lost = false;
3049 }
3050
3051 _public_ int sd_journal_enumerate_fields(sd_journal *j, const char **field) {
3052 int r;
3053
3054 assert_return(j, -EINVAL);
3055 assert_return(!journal_pid_changed(j), -ECHILD);
3056 assert_return(field, -EINVAL);
3057
3058 if (!j->fields_file) {
3059 if (j->fields_file_lost)
3060 return 0;
3061
3062 j->fields_file = ordered_hashmap_first(j->files);
3063 if (!j->fields_file)
3064 return 0;
3065
3066 j->fields_hash_table_index = 0;
3067 j->fields_offset = 0;
3068 }
3069
3070 for (;;) {
3071 JournalFile *f, *of;
3072 uint64_t m;
3073 Object *o;
3074 size_t sz;
3075 bool found;
3076
3077 f = j->fields_file;
3078
3079 if (j->fields_offset == 0) {
3080 bool eof = false;
3081
3082 /* We are not yet positioned at any field. Let's pick the first one */
3083 r = journal_file_map_field_hash_table(f);
3084 if (r < 0)
3085 return r;
3086
3087 m = le64toh(f->header->field_hash_table_size) / sizeof(HashItem);
3088 for (;;) {
3089 if (j->fields_hash_table_index >= m) {
3090 /* Reached the end of the hash table, go to the next file. */
3091 eof = true;
3092 break;
3093 }
3094
3095 j->fields_offset = le64toh(f->field_hash_table[j->fields_hash_table_index].head_hash_offset);
3096
3097 if (j->fields_offset != 0)
3098 break;
3099
3100 /* Empty hash table bucket, go to next one */
3101 j->fields_hash_table_index++;
3102 }
3103
3104 if (eof) {
3105 /* Proceed with next file */
3106 j->fields_file = ordered_hashmap_next(j->files, f->path);
3107 if (!j->fields_file) {
3108 *field = NULL;
3109 return 0;
3110 }
3111
3112 j->fields_offset = 0;
3113 j->fields_hash_table_index = 0;
3114 continue;
3115 }
3116
3117 } else {
3118 /* We are already positioned at a field. If so, let's figure out the next field from it */
3119
3120 r = journal_file_move_to_object(f, OBJECT_FIELD, j->fields_offset, &o);
3121 if (r < 0)
3122 return r;
3123
3124 j->fields_offset = le64toh(o->field.next_hash_offset);
3125 if (j->fields_offset == 0) {
3126 /* Reached the end of the hash table chain */
3127 j->fields_hash_table_index++;
3128 continue;
3129 }
3130 }
3131
3132 /* We use OBJECT_UNUSED here, so that the iterator below doesn't remove our mmap window */
3133 r = journal_file_move_to_object(f, OBJECT_UNUSED, j->fields_offset, &o);
3134 if (r < 0)
3135 return r;
3136
3137 /* Because we used OBJECT_UNUSED above, we need to do our type check manually */
3138 if (o->object.type != OBJECT_FIELD)
3139 return log_debug_errno(SYNTHETIC_ERRNO(EBADMSG),
3140 "%s:offset " OFSfmt ": object has type %i, expected %i",
3141 f->path, j->fields_offset,
3142 o->object.type, OBJECT_FIELD);
3143
3144 sz = le64toh(o->object.size) - offsetof(Object, field.payload);
3145
3146 /* Let's see if we already returned this field name before. */
3147 found = false;
3148 ORDERED_HASHMAP_FOREACH(of, j->files) {
3149 if (of == f)
3150 break;
3151
3152 /* Skip this file it didn't have any fields indexed */
3153 if (JOURNAL_HEADER_CONTAINS(of->header, n_fields) && le64toh(of->header->n_fields) <= 0)
3154 continue;
3155
3156 if (!JOURNAL_HEADER_KEYED_HASH(f->header) && !JOURNAL_HEADER_KEYED_HASH(of->header))
3157 r = journal_file_find_field_object_with_hash(of, o->field.payload, sz,
3158 le64toh(o->field.hash), NULL, NULL);
3159 else
3160 r = journal_file_find_field_object(of, o->field.payload, sz, NULL, NULL);
3161 if (r < 0)
3162 return r;
3163 if (r > 0) {
3164 found = true;
3165 break;
3166 }
3167 }
3168
3169 if (found)
3170 continue;
3171
3172 /* Check if this is really a valid string containing no NUL byte */
3173 if (memchr(o->field.payload, 0, sz))
3174 return -EBADMSG;
3175
3176 if (j->data_threshold > 0 && sz > j->data_threshold)
3177 sz = j->data_threshold;
3178
3179 if (!GREEDY_REALLOC(j->fields_buffer, sz + 1))
3180 return -ENOMEM;
3181
3182 memcpy(j->fields_buffer, o->field.payload, sz);
3183 j->fields_buffer[sz] = 0;
3184
3185 if (!field_is_valid(j->fields_buffer))
3186 return -EBADMSG;
3187
3188 *field = j->fields_buffer;
3189 return 1;
3190 }
3191 }
3192
3193 _public_ void sd_journal_restart_fields(sd_journal *j) {
3194 if (!j)
3195 return;
3196
3197 j->fields_file = NULL;
3198 j->fields_hash_table_index = 0;
3199 j->fields_offset = 0;
3200 j->fields_file_lost = false;
3201 }
3202
3203 _public_ int sd_journal_reliable_fd(sd_journal *j) {
3204 assert_return(j, -EINVAL);
3205 assert_return(!journal_pid_changed(j), -ECHILD);
3206
3207 return !j->on_network;
3208 }
3209
3210 static char *lookup_field(const char *field, void *userdata) {
3211 sd_journal *j = userdata;
3212 const void *data;
3213 size_t size, d;
3214 int r;
3215
3216 assert(field);
3217 assert(j);
3218
3219 r = sd_journal_get_data(j, field, &data, &size);
3220 if (r < 0 ||
3221 size > REPLACE_VAR_MAX)
3222 return strdup(field);
3223
3224 d = strlen(field) + 1;
3225
3226 return strndup((const char*) data + d, size - d);
3227 }
3228
3229 _public_ int sd_journal_get_catalog(sd_journal *j, char **ret) {
3230 const void *data;
3231 size_t size;
3232 sd_id128_t id;
3233 _cleanup_free_ char *text = NULL, *cid = NULL;
3234 char *t;
3235 int r;
3236
3237 assert_return(j, -EINVAL);
3238 assert_return(!journal_pid_changed(j), -ECHILD);
3239 assert_return(ret, -EINVAL);
3240
3241 r = sd_journal_get_data(j, "MESSAGE_ID", &data, &size);
3242 if (r < 0)
3243 return r;
3244
3245 cid = strndup((const char*) data + 11, size - 11);
3246 if (!cid)
3247 return -ENOMEM;
3248
3249 r = sd_id128_from_string(cid, &id);
3250 if (r < 0)
3251 return r;
3252
3253 r = catalog_get(CATALOG_DATABASE, id, &text);
3254 if (r < 0)
3255 return r;
3256
3257 t = replace_var(text, lookup_field, j);
3258 if (!t)
3259 return -ENOMEM;
3260
3261 *ret = t;
3262 return 0;
3263 }
3264
3265 _public_ int sd_journal_get_catalog_for_message_id(sd_id128_t id, char **ret) {
3266 assert_return(ret, -EINVAL);
3267
3268 return catalog_get(CATALOG_DATABASE, id, ret);
3269 }
3270
3271 _public_ int sd_journal_set_data_threshold(sd_journal *j, size_t sz) {
3272 assert_return(j, -EINVAL);
3273 assert_return(!journal_pid_changed(j), -ECHILD);
3274
3275 j->data_threshold = sz;
3276 return 0;
3277 }
3278
3279 _public_ int sd_journal_get_data_threshold(sd_journal *j, size_t *sz) {
3280 assert_return(j, -EINVAL);
3281 assert_return(!journal_pid_changed(j), -ECHILD);
3282 assert_return(sz, -EINVAL);
3283
3284 *sz = j->data_threshold;
3285 return 0;
3286 }
3287
3288 _public_ int sd_journal_has_runtime_files(sd_journal *j) {
3289 assert_return(j, -EINVAL);
3290
3291 return j->has_runtime_files;
3292 }
3293
3294 _public_ int sd_journal_has_persistent_files(sd_journal *j) {
3295 assert_return(j, -EINVAL);
3296
3297 return j->has_persistent_files;
3298 }
Unnamed repository; edit this file 'description' to name the repository.