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