]>
Commit | Line | Data |
---|---|---|
53e1b683 | 1 | /* SPDX-License-Identifier: LGPL-2.1+ */ |
cec736d2 LP |
2 | /*** |
3 | This file is part of systemd. | |
4 | ||
5 | Copyright 2011 Lennart Poettering | |
cec736d2 LP |
6 | ***/ |
7 | ||
cec736d2 | 8 | #include <errno.h> |
cec736d2 | 9 | #include <fcntl.h> |
11689d2a | 10 | #include <linux/fs.h> |
ac2e41f5 | 11 | #include <pthread.h> |
07630cea LP |
12 | #include <stddef.h> |
13 | #include <sys/mman.h> | |
14 | #include <sys/statvfs.h> | |
15 | #include <sys/uio.h> | |
16 | #include <unistd.h> | |
fb0951b0 | 17 | |
b5efdb8a | 18 | #include "alloc-util.h" |
f27a3864 | 19 | #include "btrfs-util.h" |
c8b3094d | 20 | #include "chattr-util.h" |
07630cea | 21 | #include "compress.h" |
3ffd4af2 | 22 | #include "fd-util.h" |
11b29a96 | 23 | #include "fs-util.h" |
0284adc6 | 24 | #include "journal-authenticate.h" |
cec736d2 LP |
25 | #include "journal-def.h" |
26 | #include "journal-file.h" | |
27 | #include "lookup3.h" | |
6bedfcbb | 28 | #include "parse-util.h" |
5d1ce257 | 29 | #include "path-util.h" |
3df3e884 | 30 | #include "random-util.h" |
7a24f3bf | 31 | #include "sd-event.h" |
b58c888f | 32 | #include "set.h" |
3cc44114 | 33 | #include "stat-util.h" |
07630cea | 34 | #include "string-util.h" |
4761fd0f | 35 | #include "strv.h" |
89a5a90c | 36 | #include "xattr-util.h" |
cec736d2 | 37 | |
4a92baf3 LP |
38 | #define DEFAULT_DATA_HASH_TABLE_SIZE (2047ULL*sizeof(HashItem)) |
39 | #define DEFAULT_FIELD_HASH_TABLE_SIZE (333ULL*sizeof(HashItem)) | |
cec736d2 | 40 | |
57850536 AG |
41 | #define DEFAULT_COMPRESS_THRESHOLD (512ULL) |
42 | #define MIN_COMPRESS_THRESHOLD (8ULL) | |
807e17f0 | 43 | |
babfc091 | 44 | /* This is the minimum journal file size */ |
16098e93 | 45 | #define JOURNAL_FILE_SIZE_MIN (512ULL*1024ULL) /* 512 KiB */ |
babfc091 LP |
46 | |
47 | /* These are the lower and upper bounds if we deduce the max_use value | |
48 | * from the file system size */ | |
49 | #define DEFAULT_MAX_USE_LOWER (1ULL*1024ULL*1024ULL) /* 1 MiB */ | |
50 | #define DEFAULT_MAX_USE_UPPER (4ULL*1024ULL*1024ULL*1024ULL) /* 4 GiB */ | |
51 | ||
8580d1f7 LP |
52 | /* This is the default minimal use limit, how much we'll use even if keep_free suggests otherwise. */ |
53 | #define DEFAULT_MIN_USE (1ULL*1024ULL*1024ULL) /* 1 MiB */ | |
54 | ||
babfc091 | 55 | /* This is the upper bound if we deduce max_size from max_use */ |
71100051 | 56 | #define DEFAULT_MAX_SIZE_UPPER (128ULL*1024ULL*1024ULL) /* 128 MiB */ |
babfc091 LP |
57 | |
58 | /* This is the upper bound if we deduce the keep_free value from the | |
59 | * file system size */ | |
60 | #define DEFAULT_KEEP_FREE_UPPER (4ULL*1024ULL*1024ULL*1024ULL) /* 4 GiB */ | |
61 | ||
62 | /* This is the keep_free value when we can't determine the system | |
63 | * size */ | |
64 | #define DEFAULT_KEEP_FREE (1024ULL*1024ULL) /* 1 MB */ | |
65 | ||
8580d1f7 LP |
66 | /* This is the default maximum number of journal files to keep around. */ |
67 | #define DEFAULT_N_MAX_FILES (100) | |
68 | ||
dca6219e LP |
69 | /* n_data was the first entry we added after the initial file format design */ |
70 | #define HEADER_SIZE_MIN ALIGN64(offsetof(Header, n_data)) | |
cec736d2 | 71 | |
a4bcff5b LP |
72 | /* How many entries to keep in the entry array chain cache at max */ |
73 | #define CHAIN_CACHE_MAX 20 | |
74 | ||
a676e665 LP |
75 | /* How much to increase the journal file size at once each time we allocate something new. */ |
76 | #define FILE_SIZE_INCREASE (8ULL*1024ULL*1024ULL) /* 8MB */ | |
77 | ||
2678031a LP |
78 | /* Reread fstat() of the file for detecting deletions at least this often */ |
79 | #define LAST_STAT_REFRESH_USEC (5*USEC_PER_SEC) | |
80 | ||
fa6ac760 LP |
81 | /* The mmap context to use for the header we pick as one above the last defined typed */ |
82 | #define CONTEXT_HEADER _OBJECT_TYPE_MAX | |
83 | ||
51804460 ZJS |
84 | #ifdef __clang__ |
85 | # pragma GCC diagnostic ignored "-Waddress-of-packed-member" | |
86 | #endif | |
87 | ||
ac2e41f5 VC |
88 | /* This may be called from a separate thread to prevent blocking the caller for the duration of fsync(). |
89 | * As a result we use atomic operations on f->offline_state for inter-thread communications with | |
90 | * journal_file_set_offline() and journal_file_set_online(). */ | |
91 | static void journal_file_set_offline_internal(JournalFile *f) { | |
26687bf8 | 92 | assert(f); |
ac2e41f5 VC |
93 | assert(f->fd >= 0); |
94 | assert(f->header); | |
95 | ||
96 | for (;;) { | |
97 | switch (f->offline_state) { | |
98 | case OFFLINE_CANCEL: | |
99 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_CANCEL, OFFLINE_DONE)) | |
100 | continue; | |
101 | return; | |
102 | ||
103 | case OFFLINE_AGAIN_FROM_SYNCING: | |
104 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_AGAIN_FROM_SYNCING, OFFLINE_SYNCING)) | |
105 | continue; | |
106 | break; | |
107 | ||
108 | case OFFLINE_AGAIN_FROM_OFFLINING: | |
109 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_AGAIN_FROM_OFFLINING, OFFLINE_SYNCING)) | |
110 | continue; | |
111 | break; | |
112 | ||
113 | case OFFLINE_SYNCING: | |
114 | (void) fsync(f->fd); | |
26687bf8 | 115 | |
ac2e41f5 VC |
116 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_SYNCING, OFFLINE_OFFLINING)) |
117 | continue; | |
26687bf8 | 118 | |
8eb85171 | 119 | f->header->state = f->archive ? STATE_ARCHIVED : STATE_OFFLINE; |
ac2e41f5 VC |
120 | (void) fsync(f->fd); |
121 | break; | |
122 | ||
123 | case OFFLINE_OFFLINING: | |
124 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_OFFLINING, OFFLINE_DONE)) | |
125 | continue; | |
4831981d | 126 | _fallthrough_; |
ac2e41f5 VC |
127 | case OFFLINE_DONE: |
128 | return; | |
129 | ||
130 | case OFFLINE_JOINED: | |
131 | log_debug("OFFLINE_JOINED unexpected offline state for journal_file_set_offline_internal()"); | |
132 | return; | |
133 | } | |
134 | } | |
135 | } | |
136 | ||
137 | static void * journal_file_set_offline_thread(void *arg) { | |
138 | JournalFile *f = arg; | |
139 | ||
fa7ff4cf LP |
140 | (void) pthread_setname_np(pthread_self(), "journal-offline"); |
141 | ||
ac2e41f5 VC |
142 | journal_file_set_offline_internal(f); |
143 | ||
144 | return NULL; | |
145 | } | |
146 | ||
147 | static int journal_file_set_offline_thread_join(JournalFile *f) { | |
148 | int r; | |
149 | ||
150 | assert(f); | |
151 | ||
152 | if (f->offline_state == OFFLINE_JOINED) | |
153 | return 0; | |
154 | ||
155 | r = pthread_join(f->offline_thread, NULL); | |
156 | if (r) | |
157 | return -r; | |
158 | ||
159 | f->offline_state = OFFLINE_JOINED; | |
26687bf8 | 160 | |
be7cdd8e | 161 | if (mmap_cache_got_sigbus(f->mmap, f->cache_fd)) |
fa6ac760 LP |
162 | return -EIO; |
163 | ||
ac2e41f5 VC |
164 | return 0; |
165 | } | |
26687bf8 | 166 | |
ac2e41f5 VC |
167 | /* Trigger a restart if the offline thread is mid-flight in a restartable state. */ |
168 | static bool journal_file_set_offline_try_restart(JournalFile *f) { | |
169 | for (;;) { | |
170 | switch (f->offline_state) { | |
171 | case OFFLINE_AGAIN_FROM_SYNCING: | |
172 | case OFFLINE_AGAIN_FROM_OFFLINING: | |
173 | return true; | |
174 | ||
175 | case OFFLINE_CANCEL: | |
176 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_CANCEL, OFFLINE_AGAIN_FROM_SYNCING)) | |
177 | continue; | |
178 | return true; | |
179 | ||
180 | case OFFLINE_SYNCING: | |
181 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_SYNCING, OFFLINE_AGAIN_FROM_SYNCING)) | |
182 | continue; | |
183 | return true; | |
184 | ||
185 | case OFFLINE_OFFLINING: | |
186 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_OFFLINING, OFFLINE_AGAIN_FROM_OFFLINING)) | |
187 | continue; | |
188 | return true; | |
26687bf8 OS |
189 | |
190 | default: | |
ac2e41f5 VC |
191 | return false; |
192 | } | |
26687bf8 OS |
193 | } |
194 | } | |
195 | ||
ac2e41f5 VC |
196 | /* Sets a journal offline. |
197 | * | |
198 | * If wait is false then an offline is dispatched in a separate thread for a | |
199 | * subsequent journal_file_set_offline() or journal_file_set_online() of the | |
200 | * same journal to synchronize with. | |
201 | * | |
202 | * If wait is true, then either an existing offline thread will be restarted | |
203 | * and joined, or if none exists the offline is simply performed in this | |
204 | * context without involving another thread. | |
205 | */ | |
206 | int journal_file_set_offline(JournalFile *f, bool wait) { | |
207 | bool restarted; | |
208 | int r; | |
209 | ||
26687bf8 OS |
210 | assert(f); |
211 | ||
212 | if (!f->writable) | |
213 | return -EPERM; | |
214 | ||
215 | if (!(f->fd >= 0 && f->header)) | |
216 | return -EINVAL; | |
217 | ||
b8f99e27 VC |
218 | /* An offlining journal is implicitly online and may modify f->header->state, |
219 | * we must also join any potentially lingering offline thread when not online. */ | |
220 | if (!journal_file_is_offlining(f) && f->header->state != STATE_ONLINE) | |
221 | return journal_file_set_offline_thread_join(f); | |
26687bf8 | 222 | |
ac2e41f5 VC |
223 | /* Restart an in-flight offline thread and wait if needed, or join a lingering done one. */ |
224 | restarted = journal_file_set_offline_try_restart(f); | |
225 | if ((restarted && wait) || !restarted) { | |
226 | r = journal_file_set_offline_thread_join(f); | |
227 | if (r < 0) | |
228 | return r; | |
229 | } | |
26687bf8 | 230 | |
ac2e41f5 VC |
231 | if (restarted) |
232 | return 0; | |
233 | ||
234 | /* Initiate a new offline. */ | |
235 | f->offline_state = OFFLINE_SYNCING; | |
fa6ac760 | 236 | |
ac2e41f5 VC |
237 | if (wait) /* Without using a thread if waiting. */ |
238 | journal_file_set_offline_internal(f); | |
239 | else { | |
5e9f01e8 LP |
240 | sigset_t ss, saved_ss; |
241 | int k; | |
242 | ||
243 | if (sigfillset(&ss) < 0) | |
244 | return -errno; | |
245 | ||
246 | r = pthread_sigmask(SIG_BLOCK, &ss, &saved_ss); | |
247 | if (r > 0) | |
248 | return -r; | |
249 | ||
ac2e41f5 | 250 | r = pthread_create(&f->offline_thread, NULL, journal_file_set_offline_thread, f); |
5e9f01e8 LP |
251 | |
252 | k = pthread_sigmask(SIG_SETMASK, &saved_ss, NULL); | |
ec9ffa2c VC |
253 | if (r > 0) { |
254 | f->offline_state = OFFLINE_JOINED; | |
ac2e41f5 | 255 | return -r; |
ec9ffa2c | 256 | } |
5e9f01e8 LP |
257 | if (k > 0) |
258 | return -k; | |
ac2e41f5 VC |
259 | } |
260 | ||
261 | return 0; | |
262 | } | |
263 | ||
264 | static int journal_file_set_online(JournalFile *f) { | |
265 | bool joined = false; | |
266 | ||
267 | assert(f); | |
268 | ||
269 | if (!f->writable) | |
270 | return -EPERM; | |
271 | ||
272 | if (!(f->fd >= 0 && f->header)) | |
273 | return -EINVAL; | |
274 | ||
275 | while (!joined) { | |
276 | switch (f->offline_state) { | |
277 | case OFFLINE_JOINED: | |
278 | /* No offline thread, no need to wait. */ | |
279 | joined = true; | |
280 | break; | |
281 | ||
282 | case OFFLINE_SYNCING: | |
283 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_SYNCING, OFFLINE_CANCEL)) | |
284 | continue; | |
285 | /* Canceled syncing prior to offlining, no need to wait. */ | |
286 | break; | |
287 | ||
288 | case OFFLINE_AGAIN_FROM_SYNCING: | |
289 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_AGAIN_FROM_SYNCING, OFFLINE_CANCEL)) | |
290 | continue; | |
291 | /* Canceled restart from syncing, no need to wait. */ | |
292 | break; | |
293 | ||
294 | case OFFLINE_AGAIN_FROM_OFFLINING: | |
295 | if (!__sync_bool_compare_and_swap(&f->offline_state, OFFLINE_AGAIN_FROM_OFFLINING, OFFLINE_CANCEL)) | |
296 | continue; | |
297 | /* Canceled restart from offlining, must wait for offlining to complete however. */ | |
4831981d | 298 | _fallthrough_; |
ac2e41f5 VC |
299 | default: { |
300 | int r; | |
301 | ||
302 | r = journal_file_set_offline_thread_join(f); | |
303 | if (r < 0) | |
304 | return r; | |
305 | ||
306 | joined = true; | |
307 | break; | |
308 | } | |
309 | } | |
310 | } | |
26687bf8 | 311 | |
be7cdd8e | 312 | if (mmap_cache_got_sigbus(f->mmap, f->cache_fd)) |
fa6ac760 LP |
313 | return -EIO; |
314 | ||
ac2e41f5 VC |
315 | switch (f->header->state) { |
316 | case STATE_ONLINE: | |
317 | return 0; | |
26687bf8 | 318 | |
ac2e41f5 VC |
319 | case STATE_OFFLINE: |
320 | f->header->state = STATE_ONLINE; | |
321 | (void) fsync(f->fd); | |
322 | return 0; | |
323 | ||
324 | default: | |
325 | return -EINVAL; | |
326 | } | |
26687bf8 OS |
327 | } |
328 | ||
b58c888f VC |
329 | bool journal_file_is_offlining(JournalFile *f) { |
330 | assert(f); | |
331 | ||
332 | __sync_synchronize(); | |
333 | ||
3742095b | 334 | if (IN_SET(f->offline_state, OFFLINE_DONE, OFFLINE_JOINED)) |
b58c888f VC |
335 | return false; |
336 | ||
337 | return true; | |
338 | } | |
339 | ||
804ae586 | 340 | JournalFile* journal_file_close(JournalFile *f) { |
de190aef | 341 | assert(f); |
cec736d2 | 342 | |
349cc4a5 | 343 | #if HAVE_GCRYPT |
b0af6f41 | 344 | /* Write the final tag */ |
43cd8794 FB |
345 | if (f->seal && f->writable) { |
346 | int r; | |
347 | ||
348 | r = journal_file_append_tag(f); | |
349 | if (r < 0) | |
350 | log_error_errno(r, "Failed to append tag when closing journal: %m"); | |
351 | } | |
feb12d3e | 352 | #endif |
b0af6f41 | 353 | |
7a24f3bf VC |
354 | if (f->post_change_timer) { |
355 | int enabled; | |
356 | ||
357 | if (sd_event_source_get_enabled(f->post_change_timer, &enabled) >= 0) | |
358 | if (enabled == SD_EVENT_ONESHOT) | |
359 | journal_file_post_change(f); | |
360 | ||
e167d7fd | 361 | (void) sd_event_source_set_enabled(f->post_change_timer, SD_EVENT_OFF); |
7a24f3bf VC |
362 | sd_event_source_unref(f->post_change_timer); |
363 | } | |
364 | ||
ac2e41f5 | 365 | journal_file_set_offline(f, true); |
cec736d2 | 366 | |
be7cdd8e VC |
367 | if (f->mmap && f->cache_fd) |
368 | mmap_cache_free_fd(f->mmap, f->cache_fd); | |
cec736d2 | 369 | |
11689d2a LP |
370 | if (f->fd >= 0 && f->defrag_on_close) { |
371 | ||
372 | /* Be friendly to btrfs: turn COW back on again now, | |
373 | * and defragment the file. We won't write to the file | |
374 | * ever again, hence remove all fragmentation, and | |
375 | * reenable all the good bits COW usually provides | |
376 | * (such as data checksumming). */ | |
377 | ||
1ed8f8c1 | 378 | (void) chattr_fd(f->fd, 0, FS_NOCOW_FL); |
11689d2a LP |
379 | (void) btrfs_defrag_fd(f->fd); |
380 | } | |
f27a3864 | 381 | |
5d1ce257 LP |
382 | if (f->close_fd) |
383 | safe_close(f->fd); | |
cec736d2 | 384 | free(f->path); |
807e17f0 | 385 | |
f649045c | 386 | mmap_cache_unref(f->mmap); |
16e9f408 | 387 | |
4743015d | 388 | ordered_hashmap_free_free(f->chain_cache); |
a4bcff5b | 389 | |
349cc4a5 | 390 | #if HAVE_XZ || HAVE_LZ4 |
807e17f0 LP |
391 | free(f->compress_buffer); |
392 | #endif | |
393 | ||
349cc4a5 | 394 | #if HAVE_GCRYPT |
baed47c3 LP |
395 | if (f->fss_file) |
396 | munmap(f->fss_file, PAGE_ALIGN(f->fss_file_size)); | |
dc4ebc07 | 397 | else |
b7c9ae91 LP |
398 | free(f->fsprg_state); |
399 | ||
400 | free(f->fsprg_seed); | |
7560fffc LP |
401 | |
402 | if (f->hmac) | |
403 | gcry_md_close(f->hmac); | |
404 | #endif | |
405 | ||
6b430fdb | 406 | return mfree(f); |
cec736d2 LP |
407 | } |
408 | ||
0ac38b70 | 409 | static int journal_file_init_header(JournalFile *f, JournalFile *template) { |
d89c8fdf | 410 | Header h = {}; |
cec736d2 LP |
411 | ssize_t k; |
412 | int r; | |
413 | ||
414 | assert(f); | |
415 | ||
7560fffc | 416 | memcpy(h.signature, HEADER_SIGNATURE, 8); |
23b0b2b2 | 417 | h.header_size = htole64(ALIGN64(sizeof(h))); |
cec736d2 | 418 | |
d89c8fdf ZJS |
419 | h.incompatible_flags |= htole32( |
420 | f->compress_xz * HEADER_INCOMPATIBLE_COMPRESSED_XZ | | |
421 | f->compress_lz4 * HEADER_INCOMPATIBLE_COMPRESSED_LZ4); | |
7560fffc | 422 | |
d89c8fdf ZJS |
423 | h.compatible_flags = htole32( |
424 | f->seal * HEADER_COMPATIBLE_SEALED); | |
7560fffc | 425 | |
cec736d2 LP |
426 | r = sd_id128_randomize(&h.file_id); |
427 | if (r < 0) | |
428 | return r; | |
429 | ||
0ac38b70 LP |
430 | if (template) { |
431 | h.seqnum_id = template->header->seqnum_id; | |
beec0085 | 432 | h.tail_entry_seqnum = template->header->tail_entry_seqnum; |
0ac38b70 LP |
433 | } else |
434 | h.seqnum_id = h.file_id; | |
cec736d2 LP |
435 | |
436 | k = pwrite(f->fd, &h, sizeof(h), 0); | |
437 | if (k < 0) | |
438 | return -errno; | |
439 | ||
440 | if (k != sizeof(h)) | |
441 | return -EIO; | |
442 | ||
443 | return 0; | |
444 | } | |
445 | ||
446 | static int journal_file_refresh_header(JournalFile *f) { | |
de190aef | 447 | sd_id128_t boot_id; |
fa6ac760 | 448 | int r; |
cec736d2 LP |
449 | |
450 | assert(f); | |
c88cc6af | 451 | assert(f->header); |
cec736d2 LP |
452 | |
453 | r = sd_id128_get_machine(&f->header->machine_id); | |
454 | if (r < 0) | |
455 | return r; | |
456 | ||
de190aef | 457 | r = sd_id128_get_boot(&boot_id); |
cec736d2 LP |
458 | if (r < 0) |
459 | return r; | |
460 | ||
de190aef LP |
461 | f->header->boot_id = boot_id; |
462 | ||
fa6ac760 | 463 | r = journal_file_set_online(f); |
b788cc23 | 464 | |
7560fffc | 465 | /* Sync the online state to disk */ |
fb426037 | 466 | (void) fsync(f->fd); |
b788cc23 | 467 | |
a0fe2a2d LP |
468 | /* We likely just created a new file, also sync the directory this file is located in. */ |
469 | (void) fsync_directory_of_file(f->fd); | |
470 | ||
fa6ac760 | 471 | return r; |
cec736d2 LP |
472 | } |
473 | ||
4214009f ZJS |
474 | static bool warn_wrong_flags(const JournalFile *f, bool compatible) { |
475 | const uint32_t any = compatible ? HEADER_COMPATIBLE_ANY : HEADER_INCOMPATIBLE_ANY, | |
476 | supported = compatible ? HEADER_COMPATIBLE_SUPPORTED : HEADER_INCOMPATIBLE_SUPPORTED; | |
477 | const char *type = compatible ? "compatible" : "incompatible"; | |
d89c8fdf ZJS |
478 | uint32_t flags; |
479 | ||
4214009f ZJS |
480 | flags = le32toh(compatible ? f->header->compatible_flags : f->header->incompatible_flags); |
481 | ||
482 | if (flags & ~supported) { | |
483 | if (flags & ~any) | |
4761fd0f | 484 | log_debug("Journal file %s has unknown %s flags 0x%"PRIx32, |
4214009f ZJS |
485 | f->path, type, flags & ~any); |
486 | flags = (flags & any) & ~supported; | |
4761fd0f ZJS |
487 | if (flags) { |
488 | const char* strv[3]; | |
489 | unsigned n = 0; | |
490 | _cleanup_free_ char *t = NULL; | |
491 | ||
492 | if (compatible && (flags & HEADER_COMPATIBLE_SEALED)) | |
493 | strv[n++] = "sealed"; | |
494 | if (!compatible && (flags & HEADER_INCOMPATIBLE_COMPRESSED_XZ)) | |
495 | strv[n++] = "xz-compressed"; | |
496 | if (!compatible && (flags & HEADER_INCOMPATIBLE_COMPRESSED_LZ4)) | |
497 | strv[n++] = "lz4-compressed"; | |
498 | strv[n] = NULL; | |
499 | assert(n < ELEMENTSOF(strv)); | |
500 | ||
501 | t = strv_join((char**) strv, ", "); | |
502 | log_debug("Journal file %s uses %s %s %s disabled at compilation time.", | |
503 | f->path, type, n > 1 ? "flags" : "flag", strnull(t)); | |
504 | } | |
4214009f ZJS |
505 | return true; |
506 | } | |
507 | ||
508 | return false; | |
509 | } | |
510 | ||
511 | static int journal_file_verify_header(JournalFile *f) { | |
6f94e420 TS |
512 | uint64_t arena_size, header_size; |
513 | ||
cec736d2 | 514 | assert(f); |
c88cc6af | 515 | assert(f->header); |
cec736d2 | 516 | |
7560fffc | 517 | if (memcmp(f->header->signature, HEADER_SIGNATURE, 8)) |
cec736d2 LP |
518 | return -EBADMSG; |
519 | ||
4214009f ZJS |
520 | /* In both read and write mode we refuse to open files with incompatible |
521 | * flags we don't know. */ | |
522 | if (warn_wrong_flags(f, false)) | |
cec736d2 LP |
523 | return -EPROTONOSUPPORT; |
524 | ||
4214009f ZJS |
525 | /* When open for writing we refuse to open files with compatible flags, too. */ |
526 | if (f->writable && warn_wrong_flags(f, true)) | |
d89c8fdf | 527 | return -EPROTONOSUPPORT; |
7560fffc | 528 | |
db11ac1a LP |
529 | if (f->header->state >= _STATE_MAX) |
530 | return -EBADMSG; | |
531 | ||
6f94e420 TS |
532 | header_size = le64toh(f->header->header_size); |
533 | ||
dca6219e | 534 | /* The first addition was n_data, so check that we are at least this large */ |
6f94e420 | 535 | if (header_size < HEADER_SIZE_MIN) |
23b0b2b2 LP |
536 | return -EBADMSG; |
537 | ||
8088cbd3 | 538 | if (JOURNAL_HEADER_SEALED(f->header) && !JOURNAL_HEADER_CONTAINS(f->header, n_entry_arrays)) |
beec0085 LP |
539 | return -EBADMSG; |
540 | ||
6f94e420 TS |
541 | arena_size = le64toh(f->header->arena_size); |
542 | ||
543 | if (UINT64_MAX - header_size < arena_size || header_size + arena_size > (uint64_t) f->last_stat.st_size) | |
db11ac1a LP |
544 | return -ENODATA; |
545 | ||
6f94e420 | 546 | if (le64toh(f->header->tail_object_offset) > header_size + arena_size) |
db11ac1a LP |
547 | return -ENODATA; |
548 | ||
7762e02b LP |
549 | if (!VALID64(le64toh(f->header->data_hash_table_offset)) || |
550 | !VALID64(le64toh(f->header->field_hash_table_offset)) || | |
551 | !VALID64(le64toh(f->header->tail_object_offset)) || | |
552 | !VALID64(le64toh(f->header->entry_array_offset))) | |
553 | return -ENODATA; | |
554 | ||
cec736d2 | 555 | if (f->writable) { |
cec736d2 | 556 | sd_id128_t machine_id; |
ae739cc1 | 557 | uint8_t state; |
cec736d2 LP |
558 | int r; |
559 | ||
560 | r = sd_id128_get_machine(&machine_id); | |
561 | if (r < 0) | |
562 | return r; | |
563 | ||
564 | if (!sd_id128_equal(machine_id, f->header->machine_id)) | |
565 | return -EHOSTDOWN; | |
566 | ||
de190aef | 567 | state = f->header->state; |
cec736d2 | 568 | |
b288cdeb ZJS |
569 | if (state == STATE_ARCHIVED) |
570 | return -ESHUTDOWN; /* Already archived */ | |
571 | else if (state == STATE_ONLINE) { | |
71fa6f00 LP |
572 | log_debug("Journal file %s is already online. Assuming unclean closing.", f->path); |
573 | return -EBUSY; | |
b288cdeb | 574 | } else if (state != STATE_OFFLINE) { |
8facc349 | 575 | log_debug("Journal file %s has unknown state %i.", f->path, state); |
71fa6f00 LP |
576 | return -EBUSY; |
577 | } | |
ae739cc1 | 578 | |
5b3cc0c8 YN |
579 | if (f->header->field_hash_table_size == 0 || f->header->data_hash_table_size == 0) |
580 | return -EBADMSG; | |
581 | ||
ae739cc1 LP |
582 | /* Don't permit appending to files from the future. Because otherwise the realtime timestamps wouldn't |
583 | * be strictly ordered in the entries in the file anymore, and we can't have that since it breaks | |
584 | * bisection. */ | |
585 | if (le64toh(f->header->tail_entry_realtime) > now(CLOCK_REALTIME)) { | |
586 | log_debug("Journal file %s is from the future, refusing to append new data to it that'd be older.", f->path); | |
587 | return -ETXTBSY; | |
588 | } | |
cec736d2 LP |
589 | } |
590 | ||
d89c8fdf ZJS |
591 | f->compress_xz = JOURNAL_HEADER_COMPRESSED_XZ(f->header); |
592 | f->compress_lz4 = JOURNAL_HEADER_COMPRESSED_LZ4(f->header); | |
c586dbf1 | 593 | |
f1889c91 | 594 | f->seal = JOURNAL_HEADER_SEALED(f->header); |
7560fffc | 595 | |
cec736d2 LP |
596 | return 0; |
597 | } | |
598 | ||
2678031a | 599 | static int journal_file_fstat(JournalFile *f) { |
3cc44114 LP |
600 | int r; |
601 | ||
2678031a LP |
602 | assert(f); |
603 | assert(f->fd >= 0); | |
604 | ||
605 | if (fstat(f->fd, &f->last_stat) < 0) | |
606 | return -errno; | |
607 | ||
608 | f->last_stat_usec = now(CLOCK_MONOTONIC); | |
609 | ||
8d6a4d33 | 610 | /* Refuse dealing with with files that aren't regular */ |
3cc44114 LP |
611 | r = stat_verify_regular(&f->last_stat); |
612 | if (r < 0) | |
613 | return r; | |
8d6a4d33 | 614 | |
2678031a LP |
615 | /* Refuse appending to files that are already deleted */ |
616 | if (f->last_stat.st_nlink <= 0) | |
617 | return -EIDRM; | |
618 | ||
619 | return 0; | |
620 | } | |
621 | ||
cec736d2 | 622 | static int journal_file_allocate(JournalFile *f, uint64_t offset, uint64_t size) { |
eda4b58b | 623 | uint64_t old_size, new_size; |
fec2aa2f | 624 | int r; |
cec736d2 LP |
625 | |
626 | assert(f); | |
c88cc6af | 627 | assert(f->header); |
cec736d2 | 628 | |
cec736d2 | 629 | /* We assume that this file is not sparse, and we know that |
38ac38b2 | 630 | * for sure, since we always call posix_fallocate() |
cec736d2 LP |
631 | * ourselves */ |
632 | ||
be7cdd8e | 633 | if (mmap_cache_got_sigbus(f->mmap, f->cache_fd)) |
fa6ac760 LP |
634 | return -EIO; |
635 | ||
cec736d2 | 636 | old_size = |
23b0b2b2 | 637 | le64toh(f->header->header_size) + |
cec736d2 LP |
638 | le64toh(f->header->arena_size); |
639 | ||
bc85bfee | 640 | new_size = PAGE_ALIGN(offset + size); |
23b0b2b2 LP |
641 | if (new_size < le64toh(f->header->header_size)) |
642 | new_size = le64toh(f->header->header_size); | |
bc85bfee | 643 | |
2678031a LP |
644 | if (new_size <= old_size) { |
645 | ||
646 | /* We already pre-allocated enough space, but before | |
647 | * we write to it, let's check with fstat() if the | |
648 | * file got deleted, in order make sure we don't throw | |
649 | * away the data immediately. Don't check fstat() for | |
650 | * all writes though, but only once ever 10s. */ | |
651 | ||
652 | if (f->last_stat_usec + LAST_STAT_REFRESH_USEC > now(CLOCK_MONOTONIC)) | |
653 | return 0; | |
654 | ||
655 | return journal_file_fstat(f); | |
656 | } | |
657 | ||
658 | /* Allocate more space. */ | |
cec736d2 | 659 | |
a676e665 | 660 | if (f->metrics.max_size > 0 && new_size > f->metrics.max_size) |
bc85bfee | 661 | return -E2BIG; |
cec736d2 | 662 | |
a676e665 | 663 | if (new_size > f->metrics.min_size && f->metrics.keep_free > 0) { |
cec736d2 LP |
664 | struct statvfs svfs; |
665 | ||
666 | if (fstatvfs(f->fd, &svfs) >= 0) { | |
667 | uint64_t available; | |
668 | ||
070052ab | 669 | available = LESS_BY((uint64_t) svfs.f_bfree * (uint64_t) svfs.f_bsize, f->metrics.keep_free); |
cec736d2 LP |
670 | |
671 | if (new_size - old_size > available) | |
672 | return -E2BIG; | |
673 | } | |
674 | } | |
675 | ||
eda4b58b | 676 | /* Increase by larger blocks at once */ |
be6b0c21 | 677 | new_size = DIV_ROUND_UP(new_size, FILE_SIZE_INCREASE) * FILE_SIZE_INCREASE; |
eda4b58b LP |
678 | if (f->metrics.max_size > 0 && new_size > f->metrics.max_size) |
679 | new_size = f->metrics.max_size; | |
680 | ||
bc85bfee LP |
681 | /* Note that the glibc fallocate() fallback is very |
682 | inefficient, hence we try to minimize the allocation area | |
683 | as we can. */ | |
fec2aa2f GV |
684 | r = posix_fallocate(f->fd, old_size, new_size - old_size); |
685 | if (r != 0) | |
686 | return -r; | |
cec736d2 | 687 | |
23b0b2b2 | 688 | f->header->arena_size = htole64(new_size - le64toh(f->header->header_size)); |
cec736d2 | 689 | |
2678031a | 690 | return journal_file_fstat(f); |
cec736d2 LP |
691 | } |
692 | ||
78519831 | 693 | static unsigned type_to_context(ObjectType type) { |
d3d3208f | 694 | /* One context for each type, plus one catch-all for the rest */ |
69adae51 | 695 | assert_cc(_OBJECT_TYPE_MAX <= MMAP_CACHE_MAX_CONTEXTS); |
fa6ac760 | 696 | assert_cc(CONTEXT_HEADER < MMAP_CACHE_MAX_CONTEXTS); |
d05089d8 | 697 | return type > OBJECT_UNUSED && type < _OBJECT_TYPE_MAX ? type : 0; |
d3d3208f MS |
698 | } |
699 | ||
b439282e | 700 | static int journal_file_move_to(JournalFile *f, ObjectType type, bool keep_always, uint64_t offset, uint64_t size, void **ret, size_t *ret_size) { |
2678031a LP |
701 | int r; |
702 | ||
cec736d2 | 703 | assert(f); |
cec736d2 LP |
704 | assert(ret); |
705 | ||
7762e02b LP |
706 | if (size <= 0) |
707 | return -EINVAL; | |
708 | ||
2a59ea54 | 709 | /* Avoid SIGBUS on invalid accesses */ |
4bbdcdb3 LP |
710 | if (offset + size > (uint64_t) f->last_stat.st_size) { |
711 | /* Hmm, out of range? Let's refresh the fstat() data | |
712 | * first, before we trust that check. */ | |
713 | ||
2678031a LP |
714 | r = journal_file_fstat(f); |
715 | if (r < 0) | |
716 | return r; | |
717 | ||
718 | if (offset + size > (uint64_t) f->last_stat.st_size) | |
4bbdcdb3 LP |
719 | return -EADDRNOTAVAIL; |
720 | } | |
721 | ||
b439282e | 722 | return mmap_cache_get(f->mmap, f->cache_fd, f->prot, type_to_context(type), keep_always, offset, size, &f->last_stat, ret, ret_size); |
cec736d2 LP |
723 | } |
724 | ||
16e9f408 LP |
725 | static uint64_t minimum_header_size(Object *o) { |
726 | ||
b8e891e6 | 727 | static const uint64_t table[] = { |
16e9f408 LP |
728 | [OBJECT_DATA] = sizeof(DataObject), |
729 | [OBJECT_FIELD] = sizeof(FieldObject), | |
730 | [OBJECT_ENTRY] = sizeof(EntryObject), | |
731 | [OBJECT_DATA_HASH_TABLE] = sizeof(HashTableObject), | |
732 | [OBJECT_FIELD_HASH_TABLE] = sizeof(HashTableObject), | |
733 | [OBJECT_ENTRY_ARRAY] = sizeof(EntryArrayObject), | |
734 | [OBJECT_TAG] = sizeof(TagObject), | |
735 | }; | |
736 | ||
737 | if (o->object.type >= ELEMENTSOF(table) || table[o->object.type] <= 0) | |
738 | return sizeof(ObjectHeader); | |
739 | ||
740 | return table[o->object.type]; | |
741 | } | |
742 | ||
24754f36 TR |
743 | /* Lightweight object checks. We want this to be fast, so that we won't |
744 | * slowdown every journal_file_move_to_object() call too much. */ | |
745 | static int journal_file_check_object(JournalFile *f, uint64_t offset, Object *o) { | |
746 | assert(f); | |
747 | assert(o); | |
748 | ||
749 | switch (o->object.type) { | |
750 | ||
751 | case OBJECT_DATA: { | |
752 | if ((le64toh(o->data.entry_offset) == 0) ^ (le64toh(o->data.n_entries) == 0)) { | |
753 | log_debug("Bad n_entries: %"PRIu64": %"PRIu64, | |
10e8445b | 754 | le64toh(o->data.n_entries), offset); |
24754f36 TR |
755 | return -EBADMSG; |
756 | } | |
757 | ||
758 | if (le64toh(o->object.size) - offsetof(DataObject, payload) <= 0) { | |
759 | log_debug("Bad object size (<= %zu): %"PRIu64": %"PRIu64, | |
760 | offsetof(DataObject, payload), | |
761 | le64toh(o->object.size), | |
762 | offset); | |
763 | return -EBADMSG; | |
764 | } | |
765 | ||
10e8445b TR |
766 | if (!VALID64(le64toh(o->data.next_hash_offset)) || |
767 | !VALID64(le64toh(o->data.next_field_offset)) || | |
768 | !VALID64(le64toh(o->data.entry_offset)) || | |
769 | !VALID64(le64toh(o->data.entry_array_offset))) { | |
24754f36 TR |
770 | log_debug("Invalid offset, next_hash_offset="OFSfmt", next_field_offset="OFSfmt |
771 | ", entry_offset="OFSfmt", entry_array_offset="OFSfmt": %"PRIu64, | |
10e8445b TR |
772 | le64toh(o->data.next_hash_offset), |
773 | le64toh(o->data.next_field_offset), | |
774 | le64toh(o->data.entry_offset), | |
775 | le64toh(o->data.entry_array_offset), | |
24754f36 TR |
776 | offset); |
777 | return -EBADMSG; | |
778 | } | |
779 | ||
780 | break; | |
781 | } | |
782 | ||
783 | case OBJECT_FIELD: | |
784 | if (le64toh(o->object.size) - offsetof(FieldObject, payload) <= 0) { | |
785 | log_debug( | |
786 | "Bad field size (<= %zu): %"PRIu64": %"PRIu64, | |
787 | offsetof(FieldObject, payload), | |
788 | le64toh(o->object.size), | |
789 | offset); | |
790 | return -EBADMSG; | |
791 | } | |
792 | ||
10e8445b TR |
793 | if (!VALID64(le64toh(o->field.next_hash_offset)) || |
794 | !VALID64(le64toh(o->field.head_data_offset))) { | |
24754f36 TR |
795 | log_debug( |
796 | "Invalid offset, next_hash_offset="OFSfmt | |
797 | ", head_data_offset="OFSfmt": %"PRIu64, | |
10e8445b TR |
798 | le64toh(o->field.next_hash_offset), |
799 | le64toh(o->field.head_data_offset), | |
24754f36 TR |
800 | offset); |
801 | return -EBADMSG; | |
802 | } | |
803 | break; | |
804 | ||
805 | case OBJECT_ENTRY: | |
806 | if ((le64toh(o->object.size) - offsetof(EntryObject, items)) % sizeof(EntryItem) != 0) { | |
807 | log_debug( | |
808 | "Bad entry size (<= %zu): %"PRIu64": %"PRIu64, | |
809 | offsetof(EntryObject, items), | |
810 | le64toh(o->object.size), | |
811 | offset); | |
812 | return -EBADMSG; | |
813 | } | |
814 | ||
815 | if ((le64toh(o->object.size) - offsetof(EntryObject, items)) / sizeof(EntryItem) <= 0) { | |
816 | log_debug( | |
817 | "Invalid number items in entry: %"PRIu64": %"PRIu64, | |
818 | (le64toh(o->object.size) - offsetof(EntryObject, items)) / sizeof(EntryItem), | |
819 | offset); | |
820 | return -EBADMSG; | |
821 | } | |
822 | ||
823 | if (le64toh(o->entry.seqnum) <= 0) { | |
824 | log_debug( | |
825 | "Invalid entry seqnum: %"PRIx64": %"PRIu64, | |
826 | le64toh(o->entry.seqnum), | |
827 | offset); | |
828 | return -EBADMSG; | |
829 | } | |
830 | ||
831 | if (!VALID_REALTIME(le64toh(o->entry.realtime))) { | |
832 | log_debug( | |
833 | "Invalid entry realtime timestamp: %"PRIu64": %"PRIu64, | |
834 | le64toh(o->entry.realtime), | |
835 | offset); | |
836 | return -EBADMSG; | |
837 | } | |
838 | ||
839 | if (!VALID_MONOTONIC(le64toh(o->entry.monotonic))) { | |
840 | log_debug( | |
841 | "Invalid entry monotonic timestamp: %"PRIu64": %"PRIu64, | |
842 | le64toh(o->entry.monotonic), | |
843 | offset); | |
844 | return -EBADMSG; | |
845 | } | |
846 | ||
847 | break; | |
848 | ||
849 | case OBJECT_DATA_HASH_TABLE: | |
850 | case OBJECT_FIELD_HASH_TABLE: | |
851 | if ((le64toh(o->object.size) - offsetof(HashTableObject, items)) % sizeof(HashItem) != 0 || | |
852 | (le64toh(o->object.size) - offsetof(HashTableObject, items)) / sizeof(HashItem) <= 0) { | |
853 | log_debug( | |
854 | "Invalid %s hash table size: %"PRIu64": %"PRIu64, | |
855 | o->object.type == OBJECT_DATA_HASH_TABLE ? "data" : "field", | |
856 | le64toh(o->object.size), | |
857 | offset); | |
858 | return -EBADMSG; | |
859 | } | |
860 | ||
861 | break; | |
862 | ||
863 | case OBJECT_ENTRY_ARRAY: | |
864 | if ((le64toh(o->object.size) - offsetof(EntryArrayObject, items)) % sizeof(le64_t) != 0 || | |
865 | (le64toh(o->object.size) - offsetof(EntryArrayObject, items)) / sizeof(le64_t) <= 0) { | |
866 | log_debug( | |
867 | "Invalid object entry array size: %"PRIu64": %"PRIu64, | |
868 | le64toh(o->object.size), | |
869 | offset); | |
870 | return -EBADMSG; | |
871 | } | |
872 | ||
10e8445b | 873 | if (!VALID64(le64toh(o->entry_array.next_entry_array_offset))) { |
24754f36 TR |
874 | log_debug( |
875 | "Invalid object entry array next_entry_array_offset: "OFSfmt": %"PRIu64, | |
10e8445b | 876 | le64toh(o->entry_array.next_entry_array_offset), |
24754f36 TR |
877 | offset); |
878 | return -EBADMSG; | |
879 | } | |
880 | ||
881 | break; | |
882 | ||
883 | case OBJECT_TAG: | |
884 | if (le64toh(o->object.size) != sizeof(TagObject)) { | |
885 | log_debug( | |
886 | "Invalid object tag size: %"PRIu64": %"PRIu64, | |
887 | le64toh(o->object.size), | |
888 | offset); | |
889 | return -EBADMSG; | |
890 | } | |
891 | ||
10e8445b | 892 | if (!VALID_EPOCH(le64toh(o->tag.epoch))) { |
24754f36 TR |
893 | log_debug( |
894 | "Invalid object tag epoch: %"PRIu64": %"PRIu64, | |
10e8445b | 895 | le64toh(o->tag.epoch), |
24754f36 TR |
896 | offset); |
897 | return -EBADMSG; | |
898 | } | |
899 | ||
900 | break; | |
901 | } | |
902 | ||
903 | return 0; | |
904 | } | |
905 | ||
78519831 | 906 | int journal_file_move_to_object(JournalFile *f, ObjectType type, uint64_t offset, Object **ret) { |
cec736d2 LP |
907 | int r; |
908 | void *t; | |
b439282e | 909 | size_t tsize; |
cec736d2 LP |
910 | Object *o; |
911 | uint64_t s; | |
912 | ||
913 | assert(f); | |
914 | assert(ret); | |
915 | ||
db11ac1a | 916 | /* Objects may only be located at multiple of 64 bit */ |
202fd896 LP |
917 | if (!VALID64(offset)) { |
918 | log_debug("Attempt to move to object at non-64bit boundary: %" PRIu64, offset); | |
bd30fdf2 | 919 | return -EBADMSG; |
202fd896 | 920 | } |
db11ac1a | 921 | |
50809d7a | 922 | /* Object may not be located in the file header */ |
202fd896 LP |
923 | if (offset < le64toh(f->header->header_size)) { |
924 | log_debug("Attempt to move to object located in file header: %" PRIu64, offset); | |
50809d7a | 925 | return -EBADMSG; |
202fd896 | 926 | } |
50809d7a | 927 | |
b439282e | 928 | r = journal_file_move_to(f, type, false, offset, sizeof(ObjectHeader), &t, &tsize); |
cec736d2 LP |
929 | if (r < 0) |
930 | return r; | |
931 | ||
932 | o = (Object*) t; | |
933 | s = le64toh(o->object.size); | |
934 | ||
1c69f096 LP |
935 | if (s == 0) { |
936 | log_debug("Attempt to move to uninitialized object: %" PRIu64, offset); | |
937 | return -EBADMSG; | |
938 | } | |
202fd896 LP |
939 | if (s < sizeof(ObjectHeader)) { |
940 | log_debug("Attempt to move to overly short object: %" PRIu64, offset); | |
cec736d2 | 941 | return -EBADMSG; |
202fd896 | 942 | } |
cec736d2 | 943 | |
202fd896 LP |
944 | if (o->object.type <= OBJECT_UNUSED) { |
945 | log_debug("Attempt to move to object with invalid type: %" PRIu64, offset); | |
16e9f408 | 946 | return -EBADMSG; |
202fd896 | 947 | } |
16e9f408 | 948 | |
202fd896 LP |
949 | if (s < minimum_header_size(o)) { |
950 | log_debug("Attempt to move to truncated object: %" PRIu64, offset); | |
16e9f408 | 951 | return -EBADMSG; |
202fd896 | 952 | } |
16e9f408 | 953 | |
202fd896 LP |
954 | if (type > OBJECT_UNUSED && o->object.type != type) { |
955 | log_debug("Attempt to move to object of unexpected type: %" PRIu64, offset); | |
cec736d2 | 956 | return -EBADMSG; |
202fd896 | 957 | } |
cec736d2 | 958 | |
b439282e VC |
959 | if (s > tsize) { |
960 | r = journal_file_move_to(f, type, false, offset, s, &t, NULL); | |
cec736d2 LP |
961 | if (r < 0) |
962 | return r; | |
963 | ||
964 | o = (Object*) t; | |
965 | } | |
966 | ||
24754f36 TR |
967 | r = journal_file_check_object(f, offset, o); |
968 | if (r < 0) | |
969 | return r; | |
970 | ||
cec736d2 LP |
971 | *ret = o; |
972 | return 0; | |
973 | } | |
974 | ||
d98cc1f2 | 975 | static uint64_t journal_file_entry_seqnum(JournalFile *f, uint64_t *seqnum) { |
cec736d2 LP |
976 | uint64_t r; |
977 | ||
978 | assert(f); | |
c88cc6af | 979 | assert(f->header); |
cec736d2 | 980 | |
beec0085 | 981 | r = le64toh(f->header->tail_entry_seqnum) + 1; |
c2373f84 LP |
982 | |
983 | if (seqnum) { | |
de190aef | 984 | /* If an external seqnum counter was passed, we update |
c2373f84 LP |
985 | * both the local and the external one, and set it to |
986 | * the maximum of both */ | |
987 | ||
988 | if (*seqnum + 1 > r) | |
989 | r = *seqnum + 1; | |
990 | ||
991 | *seqnum = r; | |
992 | } | |
993 | ||
beec0085 | 994 | f->header->tail_entry_seqnum = htole64(r); |
cec736d2 | 995 | |
beec0085 LP |
996 | if (f->header->head_entry_seqnum == 0) |
997 | f->header->head_entry_seqnum = htole64(r); | |
de190aef | 998 | |
cec736d2 LP |
999 | return r; |
1000 | } | |
1001 | ||
78519831 | 1002 | int journal_file_append_object(JournalFile *f, ObjectType type, uint64_t size, Object **ret, uint64_t *offset) { |
cec736d2 LP |
1003 | int r; |
1004 | uint64_t p; | |
1005 | Object *tail, *o; | |
1006 | void *t; | |
1007 | ||
1008 | assert(f); | |
c88cc6af | 1009 | assert(f->header); |
d05089d8 | 1010 | assert(type > OBJECT_UNUSED && type < _OBJECT_TYPE_MAX); |
cec736d2 LP |
1011 | assert(size >= sizeof(ObjectHeader)); |
1012 | assert(offset); | |
1013 | assert(ret); | |
1014 | ||
26687bf8 OS |
1015 | r = journal_file_set_online(f); |
1016 | if (r < 0) | |
1017 | return r; | |
1018 | ||
cec736d2 | 1019 | p = le64toh(f->header->tail_object_offset); |
cec736d2 | 1020 | if (p == 0) |
23b0b2b2 | 1021 | p = le64toh(f->header->header_size); |
cec736d2 | 1022 | else { |
d05089d8 | 1023 | r = journal_file_move_to_object(f, OBJECT_UNUSED, p, &tail); |
cec736d2 LP |
1024 | if (r < 0) |
1025 | return r; | |
1026 | ||
1027 | p += ALIGN64(le64toh(tail->object.size)); | |
1028 | } | |
1029 | ||
1030 | r = journal_file_allocate(f, p, size); | |
1031 | if (r < 0) | |
1032 | return r; | |
1033 | ||
b439282e | 1034 | r = journal_file_move_to(f, type, false, p, size, &t, NULL); |
cec736d2 LP |
1035 | if (r < 0) |
1036 | return r; | |
1037 | ||
1038 | o = (Object*) t; | |
1039 | ||
1040 | zero(o->object); | |
de190aef | 1041 | o->object.type = type; |
cec736d2 LP |
1042 | o->object.size = htole64(size); |
1043 | ||
1044 | f->header->tail_object_offset = htole64(p); | |
cec736d2 LP |
1045 | f->header->n_objects = htole64(le64toh(f->header->n_objects) + 1); |
1046 | ||
1047 | *ret = o; | |
1048 | *offset = p; | |
1049 | ||
1050 | return 0; | |
1051 | } | |
1052 | ||
de190aef | 1053 | static int journal_file_setup_data_hash_table(JournalFile *f) { |
cec736d2 LP |
1054 | uint64_t s, p; |
1055 | Object *o; | |
1056 | int r; | |
1057 | ||
1058 | assert(f); | |
c88cc6af | 1059 | assert(f->header); |
cec736d2 | 1060 | |
070052ab LP |
1061 | /* We estimate that we need 1 hash table entry per 768 bytes |
1062 | of journal file and we want to make sure we never get | |
1063 | beyond 75% fill level. Calculate the hash table size for | |
1064 | the maximum file size based on these metrics. */ | |
4a92baf3 | 1065 | |
dfabe643 | 1066 | s = (f->metrics.max_size * 4 / 768 / 3) * sizeof(HashItem); |
4a92baf3 LP |
1067 | if (s < DEFAULT_DATA_HASH_TABLE_SIZE) |
1068 | s = DEFAULT_DATA_HASH_TABLE_SIZE; | |
1069 | ||
507f22bd | 1070 | log_debug("Reserving %"PRIu64" entries in hash table.", s / sizeof(HashItem)); |
4a92baf3 | 1071 | |
de190aef LP |
1072 | r = journal_file_append_object(f, |
1073 | OBJECT_DATA_HASH_TABLE, | |
1074 | offsetof(Object, hash_table.items) + s, | |
1075 | &o, &p); | |
cec736d2 LP |
1076 | if (r < 0) |
1077 | return r; | |
1078 | ||
29804cc1 | 1079 | memzero(o->hash_table.items, s); |
cec736d2 | 1080 | |
de190aef LP |
1081 | f->header->data_hash_table_offset = htole64(p + offsetof(Object, hash_table.items)); |
1082 | f->header->data_hash_table_size = htole64(s); | |
cec736d2 LP |
1083 | |
1084 | return 0; | |
1085 | } | |
1086 | ||
de190aef | 1087 | static int journal_file_setup_field_hash_table(JournalFile *f) { |
cec736d2 LP |
1088 | uint64_t s, p; |
1089 | Object *o; | |
1090 | int r; | |
1091 | ||
1092 | assert(f); | |
c88cc6af | 1093 | assert(f->header); |
cec736d2 | 1094 | |
3c1668da LP |
1095 | /* We use a fixed size hash table for the fields as this |
1096 | * number should grow very slowly only */ | |
1097 | ||
de190aef LP |
1098 | s = DEFAULT_FIELD_HASH_TABLE_SIZE; |
1099 | r = journal_file_append_object(f, | |
1100 | OBJECT_FIELD_HASH_TABLE, | |
1101 | offsetof(Object, hash_table.items) + s, | |
1102 | &o, &p); | |
cec736d2 LP |
1103 | if (r < 0) |
1104 | return r; | |
1105 | ||
29804cc1 | 1106 | memzero(o->hash_table.items, s); |
cec736d2 | 1107 | |
de190aef LP |
1108 | f->header->field_hash_table_offset = htole64(p + offsetof(Object, hash_table.items)); |
1109 | f->header->field_hash_table_size = htole64(s); | |
cec736d2 LP |
1110 | |
1111 | return 0; | |
1112 | } | |
1113 | ||
dade37d4 | 1114 | int journal_file_map_data_hash_table(JournalFile *f) { |
cec736d2 LP |
1115 | uint64_t s, p; |
1116 | void *t; | |
1117 | int r; | |
1118 | ||
1119 | assert(f); | |
c88cc6af | 1120 | assert(f->header); |
cec736d2 | 1121 | |
dade37d4 LP |
1122 | if (f->data_hash_table) |
1123 | return 0; | |
1124 | ||
de190aef LP |
1125 | p = le64toh(f->header->data_hash_table_offset); |
1126 | s = le64toh(f->header->data_hash_table_size); | |
cec736d2 | 1127 | |
de190aef | 1128 | r = journal_file_move_to(f, |
16e9f408 | 1129 | OBJECT_DATA_HASH_TABLE, |
fcde2389 | 1130 | true, |
de190aef | 1131 | p, s, |
b42549ad | 1132 | &t, NULL); |
cec736d2 LP |
1133 | if (r < 0) |
1134 | return r; | |
1135 | ||
de190aef | 1136 | f->data_hash_table = t; |
cec736d2 LP |
1137 | return 0; |
1138 | } | |
1139 | ||
dade37d4 | 1140 | int journal_file_map_field_hash_table(JournalFile *f) { |
cec736d2 LP |
1141 | uint64_t s, p; |
1142 | void *t; | |
1143 | int r; | |
1144 | ||
1145 | assert(f); | |
c88cc6af | 1146 | assert(f->header); |
cec736d2 | 1147 | |
dade37d4 LP |
1148 | if (f->field_hash_table) |
1149 | return 0; | |
1150 | ||
de190aef LP |
1151 | p = le64toh(f->header->field_hash_table_offset); |
1152 | s = le64toh(f->header->field_hash_table_size); | |
cec736d2 | 1153 | |
de190aef | 1154 | r = journal_file_move_to(f, |
16e9f408 | 1155 | OBJECT_FIELD_HASH_TABLE, |
fcde2389 | 1156 | true, |
de190aef | 1157 | p, s, |
b42549ad | 1158 | &t, NULL); |
cec736d2 LP |
1159 | if (r < 0) |
1160 | return r; | |
1161 | ||
de190aef | 1162 | f->field_hash_table = t; |
cec736d2 LP |
1163 | return 0; |
1164 | } | |
1165 | ||
3c1668da LP |
1166 | static int journal_file_link_field( |
1167 | JournalFile *f, | |
1168 | Object *o, | |
1169 | uint64_t offset, | |
1170 | uint64_t hash) { | |
1171 | ||
805d1486 | 1172 | uint64_t p, h, m; |
3c1668da LP |
1173 | int r; |
1174 | ||
1175 | assert(f); | |
c88cc6af | 1176 | assert(f->header); |
90d222c1 | 1177 | assert(f->field_hash_table); |
3c1668da LP |
1178 | assert(o); |
1179 | assert(offset > 0); | |
1180 | ||
1181 | if (o->object.type != OBJECT_FIELD) | |
1182 | return -EINVAL; | |
1183 | ||
805d1486 LP |
1184 | m = le64toh(f->header->field_hash_table_size) / sizeof(HashItem); |
1185 | if (m <= 0) | |
1186 | return -EBADMSG; | |
3c1668da | 1187 | |
805d1486 | 1188 | /* This might alter the window we are looking at */ |
3c1668da LP |
1189 | o->field.next_hash_offset = o->field.head_data_offset = 0; |
1190 | ||
805d1486 | 1191 | h = hash % m; |
3c1668da LP |
1192 | p = le64toh(f->field_hash_table[h].tail_hash_offset); |
1193 | if (p == 0) | |
1194 | f->field_hash_table[h].head_hash_offset = htole64(offset); | |
1195 | else { | |
1196 | r = journal_file_move_to_object(f, OBJECT_FIELD, p, &o); | |
1197 | if (r < 0) | |
1198 | return r; | |
1199 | ||
1200 | o->field.next_hash_offset = htole64(offset); | |
1201 | } | |
1202 | ||
1203 | f->field_hash_table[h].tail_hash_offset = htole64(offset); | |
1204 | ||
1205 | if (JOURNAL_HEADER_CONTAINS(f->header, n_fields)) | |
1206 | f->header->n_fields = htole64(le64toh(f->header->n_fields) + 1); | |
1207 | ||
1208 | return 0; | |
1209 | } | |
1210 | ||
1211 | static int journal_file_link_data( | |
1212 | JournalFile *f, | |
1213 | Object *o, | |
1214 | uint64_t offset, | |
1215 | uint64_t hash) { | |
1216 | ||
805d1486 | 1217 | uint64_t p, h, m; |
cec736d2 LP |
1218 | int r; |
1219 | ||
1220 | assert(f); | |
c88cc6af | 1221 | assert(f->header); |
90d222c1 | 1222 | assert(f->data_hash_table); |
cec736d2 LP |
1223 | assert(o); |
1224 | assert(offset > 0); | |
b588975f LP |
1225 | |
1226 | if (o->object.type != OBJECT_DATA) | |
1227 | return -EINVAL; | |
cec736d2 | 1228 | |
805d1486 LP |
1229 | m = le64toh(f->header->data_hash_table_size) / sizeof(HashItem); |
1230 | if (m <= 0) | |
1231 | return -EBADMSG; | |
48496df6 | 1232 | |
805d1486 | 1233 | /* This might alter the window we are looking at */ |
de190aef LP |
1234 | o->data.next_hash_offset = o->data.next_field_offset = 0; |
1235 | o->data.entry_offset = o->data.entry_array_offset = 0; | |
1236 | o->data.n_entries = 0; | |
cec736d2 | 1237 | |
805d1486 | 1238 | h = hash % m; |
8db4213e | 1239 | p = le64toh(f->data_hash_table[h].tail_hash_offset); |
3c1668da | 1240 | if (p == 0) |
cec736d2 | 1241 | /* Only entry in the hash table is easy */ |
de190aef | 1242 | f->data_hash_table[h].head_hash_offset = htole64(offset); |
3c1668da | 1243 | else { |
48496df6 LP |
1244 | /* Move back to the previous data object, to patch in |
1245 | * pointer */ | |
cec736d2 | 1246 | |
de190aef | 1247 | r = journal_file_move_to_object(f, OBJECT_DATA, p, &o); |
cec736d2 LP |
1248 | if (r < 0) |
1249 | return r; | |
1250 | ||
de190aef | 1251 | o->data.next_hash_offset = htole64(offset); |
cec736d2 LP |
1252 | } |
1253 | ||
de190aef | 1254 | f->data_hash_table[h].tail_hash_offset = htole64(offset); |
cec736d2 | 1255 | |
dca6219e LP |
1256 | if (JOURNAL_HEADER_CONTAINS(f->header, n_data)) |
1257 | f->header->n_data = htole64(le64toh(f->header->n_data) + 1); | |
1258 | ||
cec736d2 LP |
1259 | return 0; |
1260 | } | |
1261 | ||
3c1668da LP |
1262 | int journal_file_find_field_object_with_hash( |
1263 | JournalFile *f, | |
1264 | const void *field, uint64_t size, uint64_t hash, | |
1265 | Object **ret, uint64_t *offset) { | |
1266 | ||
805d1486 | 1267 | uint64_t p, osize, h, m; |
3c1668da LP |
1268 | int r; |
1269 | ||
1270 | assert(f); | |
c88cc6af | 1271 | assert(f->header); |
3c1668da LP |
1272 | assert(field && size > 0); |
1273 | ||
dade37d4 LP |
1274 | /* If the field hash table is empty, we can't find anything */ |
1275 | if (le64toh(f->header->field_hash_table_size) <= 0) | |
1276 | return 0; | |
1277 | ||
1278 | /* Map the field hash table, if it isn't mapped yet. */ | |
1279 | r = journal_file_map_field_hash_table(f); | |
1280 | if (r < 0) | |
1281 | return r; | |
1282 | ||
3c1668da LP |
1283 | osize = offsetof(Object, field.payload) + size; |
1284 | ||
805d1486 | 1285 | m = le64toh(f->header->field_hash_table_size) / sizeof(HashItem); |
805d1486 | 1286 | if (m <= 0) |
3c1668da LP |
1287 | return -EBADMSG; |
1288 | ||
805d1486 | 1289 | h = hash % m; |
3c1668da LP |
1290 | p = le64toh(f->field_hash_table[h].head_hash_offset); |
1291 | ||
1292 | while (p > 0) { | |
1293 | Object *o; | |
1294 | ||
1295 | r = journal_file_move_to_object(f, OBJECT_FIELD, p, &o); | |
1296 | if (r < 0) | |
1297 | return r; | |
1298 | ||
1299 | if (le64toh(o->field.hash) == hash && | |
1300 | le64toh(o->object.size) == osize && | |
1301 | memcmp(o->field.payload, field, size) == 0) { | |
1302 | ||
1303 | if (ret) | |
1304 | *ret = o; | |
1305 | if (offset) | |
1306 | *offset = p; | |
1307 | ||
1308 | return 1; | |
1309 | } | |
1310 | ||
1311 | p = le64toh(o->field.next_hash_offset); | |
1312 | } | |
1313 | ||
1314 | return 0; | |
1315 | } | |
1316 | ||
1317 | int journal_file_find_field_object( | |
1318 | JournalFile *f, | |
1319 | const void *field, uint64_t size, | |
1320 | Object **ret, uint64_t *offset) { | |
1321 | ||
1322 | uint64_t hash; | |
1323 | ||
1324 | assert(f); | |
1325 | assert(field && size > 0); | |
1326 | ||
1327 | hash = hash64(field, size); | |
1328 | ||
1329 | return journal_file_find_field_object_with_hash(f, | |
1330 | field, size, hash, | |
1331 | ret, offset); | |
1332 | } | |
1333 | ||
de190aef LP |
1334 | int journal_file_find_data_object_with_hash( |
1335 | JournalFile *f, | |
1336 | const void *data, uint64_t size, uint64_t hash, | |
1337 | Object **ret, uint64_t *offset) { | |
48496df6 | 1338 | |
805d1486 | 1339 | uint64_t p, osize, h, m; |
cec736d2 LP |
1340 | int r; |
1341 | ||
1342 | assert(f); | |
c88cc6af | 1343 | assert(f->header); |
cec736d2 LP |
1344 | assert(data || size == 0); |
1345 | ||
dade37d4 LP |
1346 | /* If there's no data hash table, then there's no entry. */ |
1347 | if (le64toh(f->header->data_hash_table_size) <= 0) | |
1348 | return 0; | |
1349 | ||
1350 | /* Map the data hash table, if it isn't mapped yet. */ | |
1351 | r = journal_file_map_data_hash_table(f); | |
1352 | if (r < 0) | |
1353 | return r; | |
1354 | ||
cec736d2 LP |
1355 | osize = offsetof(Object, data.payload) + size; |
1356 | ||
805d1486 LP |
1357 | m = le64toh(f->header->data_hash_table_size) / sizeof(HashItem); |
1358 | if (m <= 0) | |
bc85bfee LP |
1359 | return -EBADMSG; |
1360 | ||
805d1486 | 1361 | h = hash % m; |
de190aef | 1362 | p = le64toh(f->data_hash_table[h].head_hash_offset); |
cec736d2 | 1363 | |
de190aef LP |
1364 | while (p > 0) { |
1365 | Object *o; | |
cec736d2 | 1366 | |
de190aef | 1367 | r = journal_file_move_to_object(f, OBJECT_DATA, p, &o); |
cec736d2 LP |
1368 | if (r < 0) |
1369 | return r; | |
1370 | ||
807e17f0 | 1371 | if (le64toh(o->data.hash) != hash) |
85a131e8 | 1372 | goto next; |
807e17f0 | 1373 | |
d89c8fdf | 1374 | if (o->object.flags & OBJECT_COMPRESSION_MASK) { |
349cc4a5 | 1375 | #if HAVE_XZ || HAVE_LZ4 |
fa1c4b51 | 1376 | uint64_t l; |
a7f7d1bd | 1377 | size_t rsize = 0; |
cec736d2 | 1378 | |
807e17f0 LP |
1379 | l = le64toh(o->object.size); |
1380 | if (l <= offsetof(Object, data.payload)) | |
cec736d2 LP |
1381 | return -EBADMSG; |
1382 | ||
807e17f0 LP |
1383 | l -= offsetof(Object, data.payload); |
1384 | ||
d89c8fdf ZJS |
1385 | r = decompress_blob(o->object.flags & OBJECT_COMPRESSION_MASK, |
1386 | o->data.payload, l, &f->compress_buffer, &f->compress_buffer_size, &rsize, 0); | |
1387 | if (r < 0) | |
1388 | return r; | |
807e17f0 | 1389 | |
b785c858 | 1390 | if (rsize == size && |
807e17f0 LP |
1391 | memcmp(f->compress_buffer, data, size) == 0) { |
1392 | ||
1393 | if (ret) | |
1394 | *ret = o; | |
1395 | ||
1396 | if (offset) | |
1397 | *offset = p; | |
1398 | ||
1399 | return 1; | |
1400 | } | |
3b1a55e1 ZJS |
1401 | #else |
1402 | return -EPROTONOSUPPORT; | |
1403 | #endif | |
807e17f0 LP |
1404 | } else if (le64toh(o->object.size) == osize && |
1405 | memcmp(o->data.payload, data, size) == 0) { | |
1406 | ||
cec736d2 LP |
1407 | if (ret) |
1408 | *ret = o; | |
1409 | ||
1410 | if (offset) | |
1411 | *offset = p; | |
1412 | ||
de190aef | 1413 | return 1; |
cec736d2 LP |
1414 | } |
1415 | ||
85a131e8 | 1416 | next: |
cec736d2 LP |
1417 | p = le64toh(o->data.next_hash_offset); |
1418 | } | |
1419 | ||
de190aef LP |
1420 | return 0; |
1421 | } | |
1422 | ||
1423 | int journal_file_find_data_object( | |
1424 | JournalFile *f, | |
1425 | const void *data, uint64_t size, | |
1426 | Object **ret, uint64_t *offset) { | |
1427 | ||
1428 | uint64_t hash; | |
1429 | ||
1430 | assert(f); | |
1431 | assert(data || size == 0); | |
1432 | ||
1433 | hash = hash64(data, size); | |
1434 | ||
1435 | return journal_file_find_data_object_with_hash(f, | |
1436 | data, size, hash, | |
1437 | ret, offset); | |
1438 | } | |
1439 | ||
3c1668da LP |
1440 | static int journal_file_append_field( |
1441 | JournalFile *f, | |
1442 | const void *field, uint64_t size, | |
1443 | Object **ret, uint64_t *offset) { | |
1444 | ||
1445 | uint64_t hash, p; | |
1446 | uint64_t osize; | |
1447 | Object *o; | |
1448 | int r; | |
1449 | ||
1450 | assert(f); | |
1451 | assert(field && size > 0); | |
1452 | ||
1453 | hash = hash64(field, size); | |
1454 | ||
1455 | r = journal_file_find_field_object_with_hash(f, field, size, hash, &o, &p); | |
1456 | if (r < 0) | |
1457 | return r; | |
1458 | else if (r > 0) { | |
1459 | ||
1460 | if (ret) | |
1461 | *ret = o; | |
1462 | ||
1463 | if (offset) | |
1464 | *offset = p; | |
1465 | ||
1466 | return 0; | |
1467 | } | |
1468 | ||
1469 | osize = offsetof(Object, field.payload) + size; | |
1470 | r = journal_file_append_object(f, OBJECT_FIELD, osize, &o, &p); | |
8c92d4bb LP |
1471 | if (r < 0) |
1472 | return r; | |
3c1668da LP |
1473 | |
1474 | o->field.hash = htole64(hash); | |
1475 | memcpy(o->field.payload, field, size); | |
1476 | ||
1477 | r = journal_file_link_field(f, o, p, hash); | |
1478 | if (r < 0) | |
1479 | return r; | |
1480 | ||
1481 | /* The linking might have altered the window, so let's | |
1482 | * refresh our pointer */ | |
1483 | r = journal_file_move_to_object(f, OBJECT_FIELD, p, &o); | |
1484 | if (r < 0) | |
1485 | return r; | |
1486 | ||
349cc4a5 | 1487 | #if HAVE_GCRYPT |
3c1668da LP |
1488 | r = journal_file_hmac_put_object(f, OBJECT_FIELD, o, p); |
1489 | if (r < 0) | |
1490 | return r; | |
1491 | #endif | |
1492 | ||
1493 | if (ret) | |
1494 | *ret = o; | |
1495 | ||
1496 | if (offset) | |
1497 | *offset = p; | |
1498 | ||
1499 | return 0; | |
1500 | } | |
1501 | ||
48496df6 LP |
1502 | static int journal_file_append_data( |
1503 | JournalFile *f, | |
1504 | const void *data, uint64_t size, | |
1505 | Object **ret, uint64_t *offset) { | |
1506 | ||
de190aef LP |
1507 | uint64_t hash, p; |
1508 | uint64_t osize; | |
1509 | Object *o; | |
d89c8fdf | 1510 | int r, compression = 0; |
3c1668da | 1511 | const void *eq; |
de190aef LP |
1512 | |
1513 | assert(f); | |
1514 | assert(data || size == 0); | |
1515 | ||
1516 | hash = hash64(data, size); | |
1517 | ||
1518 | r = journal_file_find_data_object_with_hash(f, data, size, hash, &o, &p); | |
1519 | if (r < 0) | |
1520 | return r; | |
0240c603 | 1521 | if (r > 0) { |
de190aef LP |
1522 | |
1523 | if (ret) | |
1524 | *ret = o; | |
1525 | ||
1526 | if (offset) | |
1527 | *offset = p; | |
1528 | ||
1529 | return 0; | |
1530 | } | |
1531 | ||
1532 | osize = offsetof(Object, data.payload) + size; | |
1533 | r = journal_file_append_object(f, OBJECT_DATA, osize, &o, &p); | |
cec736d2 LP |
1534 | if (r < 0) |
1535 | return r; | |
1536 | ||
cec736d2 | 1537 | o->data.hash = htole64(hash); |
807e17f0 | 1538 | |
349cc4a5 | 1539 | #if HAVE_XZ || HAVE_LZ4 |
57850536 | 1540 | if (JOURNAL_FILE_COMPRESS(f) && size >= f->compress_threshold_bytes) { |
a7f7d1bd | 1541 | size_t rsize = 0; |
807e17f0 | 1542 | |
5d6f46b6 | 1543 | compression = compress_blob(data, size, o->data.payload, size - 1, &rsize); |
807e17f0 | 1544 | |
d1afbcd2 | 1545 | if (compression >= 0) { |
807e17f0 | 1546 | o->object.size = htole64(offsetof(Object, data.payload) + rsize); |
d89c8fdf | 1547 | o->object.flags |= compression; |
807e17f0 | 1548 | |
fa1c4b51 | 1549 | log_debug("Compressed data object %"PRIu64" -> %zu using %s", |
d89c8fdf | 1550 | size, rsize, object_compressed_to_string(compression)); |
d1afbcd2 LP |
1551 | } else |
1552 | /* Compression didn't work, we don't really care why, let's continue without compression */ | |
1553 | compression = 0; | |
807e17f0 LP |
1554 | } |
1555 | #endif | |
1556 | ||
75f32f04 ZJS |
1557 | if (compression == 0) |
1558 | memcpy_safe(o->data.payload, data, size); | |
cec736d2 | 1559 | |
de190aef | 1560 | r = journal_file_link_data(f, o, p, hash); |
cec736d2 LP |
1561 | if (r < 0) |
1562 | return r; | |
1563 | ||
349cc4a5 | 1564 | #if HAVE_GCRYPT |
33685a5a FB |
1565 | r = journal_file_hmac_put_object(f, OBJECT_DATA, o, p); |
1566 | if (r < 0) | |
1567 | return r; | |
1568 | #endif | |
1569 | ||
48496df6 LP |
1570 | /* The linking might have altered the window, so let's |
1571 | * refresh our pointer */ | |
1572 | r = journal_file_move_to_object(f, OBJECT_DATA, p, &o); | |
1573 | if (r < 0) | |
1574 | return r; | |
1575 | ||
08c6f819 SL |
1576 | if (!data) |
1577 | eq = NULL; | |
1578 | else | |
1579 | eq = memchr(data, '=', size); | |
3c1668da | 1580 | if (eq && eq > data) { |
748db592 | 1581 | Object *fo = NULL; |
3c1668da | 1582 | uint64_t fp; |
3c1668da LP |
1583 | |
1584 | /* Create field object ... */ | |
1585 | r = journal_file_append_field(f, data, (uint8_t*) eq - (uint8_t*) data, &fo, &fp); | |
1586 | if (r < 0) | |
1587 | return r; | |
1588 | ||
1589 | /* ... and link it in. */ | |
1590 | o->data.next_field_offset = fo->field.head_data_offset; | |
1591 | fo->field.head_data_offset = le64toh(p); | |
1592 | } | |
1593 | ||
cec736d2 LP |
1594 | if (ret) |
1595 | *ret = o; | |
1596 | ||
1597 | if (offset) | |
de190aef | 1598 | *offset = p; |
cec736d2 LP |
1599 | |
1600 | return 0; | |
1601 | } | |
1602 | ||
1603 | uint64_t journal_file_entry_n_items(Object *o) { | |
1604 | assert(o); | |
b588975f LP |
1605 | |
1606 | if (o->object.type != OBJECT_ENTRY) | |
1607 | return 0; | |
cec736d2 LP |
1608 | |
1609 | return (le64toh(o->object.size) - offsetof(Object, entry.items)) / sizeof(EntryItem); | |
1610 | } | |
1611 | ||
0284adc6 | 1612 | uint64_t journal_file_entry_array_n_items(Object *o) { |
de190aef | 1613 | assert(o); |
b588975f LP |
1614 | |
1615 | if (o->object.type != OBJECT_ENTRY_ARRAY) | |
1616 | return 0; | |
de190aef LP |
1617 | |
1618 | return (le64toh(o->object.size) - offsetof(Object, entry_array.items)) / sizeof(uint64_t); | |
1619 | } | |
1620 | ||
fb9a24b6 LP |
1621 | uint64_t journal_file_hash_table_n_items(Object *o) { |
1622 | assert(o); | |
b588975f | 1623 | |
ec2ce0c5 | 1624 | if (!IN_SET(o->object.type, OBJECT_DATA_HASH_TABLE, OBJECT_FIELD_HASH_TABLE)) |
b588975f | 1625 | return 0; |
fb9a24b6 LP |
1626 | |
1627 | return (le64toh(o->object.size) - offsetof(Object, hash_table.items)) / sizeof(HashItem); | |
1628 | } | |
1629 | ||
de190aef | 1630 | static int link_entry_into_array(JournalFile *f, |
4fd052ae FC |
1631 | le64_t *first, |
1632 | le64_t *idx, | |
de190aef | 1633 | uint64_t p) { |
cec736d2 | 1634 | int r; |
de190aef LP |
1635 | uint64_t n = 0, ap = 0, q, i, a, hidx; |
1636 | Object *o; | |
1637 | ||
cec736d2 | 1638 | assert(f); |
c88cc6af | 1639 | assert(f->header); |
de190aef LP |
1640 | assert(first); |
1641 | assert(idx); | |
1642 | assert(p > 0); | |
cec736d2 | 1643 | |
de190aef LP |
1644 | a = le64toh(*first); |
1645 | i = hidx = le64toh(*idx); | |
1646 | while (a > 0) { | |
1647 | ||
1648 | r = journal_file_move_to_object(f, OBJECT_ENTRY_ARRAY, a, &o); | |
1649 | if (r < 0) | |
1650 | return r; | |
cec736d2 | 1651 | |
de190aef LP |
1652 | n = journal_file_entry_array_n_items(o); |
1653 | if (i < n) { | |
1654 | o->entry_array.items[i] = htole64(p); | |
1655 | *idx = htole64(hidx + 1); | |
1656 | return 0; | |
1657 | } | |
cec736d2 | 1658 | |
de190aef LP |
1659 | i -= n; |
1660 | ap = a; | |
1661 | a = le64toh(o->entry_array.next_entry_array_offset); | |
1662 | } | |
1663 | ||
1664 | if (hidx > n) | |
1665 | n = (hidx+1) * 2; | |
1666 | else | |
1667 | n = n * 2; | |
1668 | ||
1669 | if (n < 4) | |
1670 | n = 4; | |
1671 | ||
1672 | r = journal_file_append_object(f, OBJECT_ENTRY_ARRAY, | |
1673 | offsetof(Object, entry_array.items) + n * sizeof(uint64_t), | |
1674 | &o, &q); | |
cec736d2 LP |
1675 | if (r < 0) |
1676 | return r; | |
1677 | ||
349cc4a5 | 1678 | #if HAVE_GCRYPT |
5996c7c2 | 1679 | r = journal_file_hmac_put_object(f, OBJECT_ENTRY_ARRAY, o, q); |
b0af6f41 LP |
1680 | if (r < 0) |
1681 | return r; | |
feb12d3e | 1682 | #endif |
b0af6f41 | 1683 | |
de190aef | 1684 | o->entry_array.items[i] = htole64(p); |
cec736d2 | 1685 | |
de190aef | 1686 | if (ap == 0) |
7be3aa17 | 1687 | *first = htole64(q); |
cec736d2 | 1688 | else { |
de190aef | 1689 | r = journal_file_move_to_object(f, OBJECT_ENTRY_ARRAY, ap, &o); |
cec736d2 LP |
1690 | if (r < 0) |
1691 | return r; | |
1692 | ||
de190aef LP |
1693 | o->entry_array.next_entry_array_offset = htole64(q); |
1694 | } | |
cec736d2 | 1695 | |
2dee23eb LP |
1696 | if (JOURNAL_HEADER_CONTAINS(f->header, n_entry_arrays)) |
1697 | f->header->n_entry_arrays = htole64(le64toh(f->header->n_entry_arrays) + 1); | |
1698 | ||
de190aef LP |
1699 | *idx = htole64(hidx + 1); |
1700 | ||
1701 | return 0; | |
1702 | } | |
cec736d2 | 1703 | |
de190aef | 1704 | static int link_entry_into_array_plus_one(JournalFile *f, |
4fd052ae FC |
1705 | le64_t *extra, |
1706 | le64_t *first, | |
1707 | le64_t *idx, | |
de190aef LP |
1708 | uint64_t p) { |
1709 | ||
1710 | int r; | |
1711 | ||
1712 | assert(f); | |
1713 | assert(extra); | |
1714 | assert(first); | |
1715 | assert(idx); | |
1716 | assert(p > 0); | |
1717 | ||
1718 | if (*idx == 0) | |
1719 | *extra = htole64(p); | |
1720 | else { | |
4fd052ae | 1721 | le64_t i; |
de190aef | 1722 | |
7be3aa17 | 1723 | i = htole64(le64toh(*idx) - 1); |
de190aef LP |
1724 | r = link_entry_into_array(f, first, &i, p); |
1725 | if (r < 0) | |
1726 | return r; | |
cec736d2 LP |
1727 | } |
1728 | ||
de190aef LP |
1729 | *idx = htole64(le64toh(*idx) + 1); |
1730 | return 0; | |
1731 | } | |
1732 | ||
1733 | static int journal_file_link_entry_item(JournalFile *f, Object *o, uint64_t offset, uint64_t i) { | |
1734 | uint64_t p; | |
1735 | int r; | |
1736 | assert(f); | |
1737 | assert(o); | |
1738 | assert(offset > 0); | |
1739 | ||
1740 | p = le64toh(o->entry.items[i].object_offset); | |
1741 | if (p == 0) | |
1742 | return -EINVAL; | |
1743 | ||
1744 | r = journal_file_move_to_object(f, OBJECT_DATA, p, &o); | |
cec736d2 LP |
1745 | if (r < 0) |
1746 | return r; | |
1747 | ||
de190aef LP |
1748 | return link_entry_into_array_plus_one(f, |
1749 | &o->data.entry_offset, | |
1750 | &o->data.entry_array_offset, | |
1751 | &o->data.n_entries, | |
1752 | offset); | |
cec736d2 LP |
1753 | } |
1754 | ||
1755 | static int journal_file_link_entry(JournalFile *f, Object *o, uint64_t offset) { | |
de190aef | 1756 | uint64_t n, i; |
cec736d2 LP |
1757 | int r; |
1758 | ||
1759 | assert(f); | |
c88cc6af | 1760 | assert(f->header); |
cec736d2 LP |
1761 | assert(o); |
1762 | assert(offset > 0); | |
b588975f LP |
1763 | |
1764 | if (o->object.type != OBJECT_ENTRY) | |
1765 | return -EINVAL; | |
cec736d2 | 1766 | |
b788cc23 LP |
1767 | __sync_synchronize(); |
1768 | ||
cec736d2 | 1769 | /* Link up the entry itself */ |
de190aef LP |
1770 | r = link_entry_into_array(f, |
1771 | &f->header->entry_array_offset, | |
1772 | &f->header->n_entries, | |
1773 | offset); | |
1774 | if (r < 0) | |
1775 | return r; | |
cec736d2 | 1776 | |
507f22bd | 1777 | /* log_debug("=> %s seqnr=%"PRIu64" n_entries=%"PRIu64, f->path, o->entry.seqnum, f->header->n_entries); */ |
cec736d2 | 1778 | |
de190aef | 1779 | if (f->header->head_entry_realtime == 0) |
0ac38b70 | 1780 | f->header->head_entry_realtime = o->entry.realtime; |
cec736d2 | 1781 | |
0ac38b70 | 1782 | f->header->tail_entry_realtime = o->entry.realtime; |
de190aef LP |
1783 | f->header->tail_entry_monotonic = o->entry.monotonic; |
1784 | ||
cec736d2 LP |
1785 | /* Link up the items */ |
1786 | n = journal_file_entry_n_items(o); | |
1787 | for (i = 0; i < n; i++) { | |
1788 | r = journal_file_link_entry_item(f, o, offset, i); | |
1789 | if (r < 0) | |
1790 | return r; | |
1791 | } | |
1792 | ||
cec736d2 LP |
1793 | return 0; |
1794 | } | |
1795 | ||
1796 | static int journal_file_append_entry_internal( | |
1797 | JournalFile *f, | |
1798 | const dual_timestamp *ts, | |
1799 | uint64_t xor_hash, | |
1800 | const EntryItem items[], unsigned n_items, | |
de190aef | 1801 | uint64_t *seqnum, |
cec736d2 LP |
1802 | Object **ret, uint64_t *offset) { |
1803 | uint64_t np; | |
1804 | uint64_t osize; | |
1805 | Object *o; | |
1806 | int r; | |
1807 | ||
1808 | assert(f); | |
c88cc6af | 1809 | assert(f->header); |
cec736d2 | 1810 | assert(items || n_items == 0); |
de190aef | 1811 | assert(ts); |
cec736d2 LP |
1812 | |
1813 | osize = offsetof(Object, entry.items) + (n_items * sizeof(EntryItem)); | |
1814 | ||
de190aef | 1815 | r = journal_file_append_object(f, OBJECT_ENTRY, osize, &o, &np); |
cec736d2 LP |
1816 | if (r < 0) |
1817 | return r; | |
1818 | ||
d98cc1f2 | 1819 | o->entry.seqnum = htole64(journal_file_entry_seqnum(f, seqnum)); |
75f32f04 | 1820 | memcpy_safe(o->entry.items, items, n_items * sizeof(EntryItem)); |
de190aef LP |
1821 | o->entry.realtime = htole64(ts->realtime); |
1822 | o->entry.monotonic = htole64(ts->monotonic); | |
cec736d2 LP |
1823 | o->entry.xor_hash = htole64(xor_hash); |
1824 | o->entry.boot_id = f->header->boot_id; | |
1825 | ||
349cc4a5 | 1826 | #if HAVE_GCRYPT |
5996c7c2 | 1827 | r = journal_file_hmac_put_object(f, OBJECT_ENTRY, o, np); |
b0af6f41 LP |
1828 | if (r < 0) |
1829 | return r; | |
feb12d3e | 1830 | #endif |
b0af6f41 | 1831 | |
cec736d2 LP |
1832 | r = journal_file_link_entry(f, o, np); |
1833 | if (r < 0) | |
1834 | return r; | |
1835 | ||
1836 | if (ret) | |
1837 | *ret = o; | |
1838 | ||
1839 | if (offset) | |
1840 | *offset = np; | |
1841 | ||
1842 | return 0; | |
1843 | } | |
1844 | ||
cf244689 | 1845 | void journal_file_post_change(JournalFile *f) { |
50f20cfd LP |
1846 | assert(f); |
1847 | ||
1848 | /* inotify() does not receive IN_MODIFY events from file | |
1849 | * accesses done via mmap(). After each access we hence | |
1850 | * trigger IN_MODIFY by truncating the journal file to its | |
1851 | * current size which triggers IN_MODIFY. */ | |
1852 | ||
bc85bfee LP |
1853 | __sync_synchronize(); |
1854 | ||
50f20cfd | 1855 | if (ftruncate(f->fd, f->last_stat.st_size) < 0) |
e167d7fd | 1856 | log_debug_errno(errno, "Failed to truncate file to its own size: %m"); |
50f20cfd LP |
1857 | } |
1858 | ||
7a24f3bf VC |
1859 | static int post_change_thunk(sd_event_source *timer, uint64_t usec, void *userdata) { |
1860 | assert(userdata); | |
1861 | ||
1862 | journal_file_post_change(userdata); | |
1863 | ||
1864 | return 1; | |
1865 | } | |
1866 | ||
1867 | static void schedule_post_change(JournalFile *f) { | |
1868 | sd_event_source *timer; | |
1869 | int enabled, r; | |
1870 | uint64_t now; | |
1871 | ||
1872 | assert(f); | |
1873 | assert(f->post_change_timer); | |
1874 | ||
1875 | timer = f->post_change_timer; | |
1876 | ||
1877 | r = sd_event_source_get_enabled(timer, &enabled); | |
1878 | if (r < 0) { | |
e167d7fd LP |
1879 | log_debug_errno(r, "Failed to get ftruncate timer state: %m"); |
1880 | goto fail; | |
7a24f3bf VC |
1881 | } |
1882 | ||
1883 | if (enabled == SD_EVENT_ONESHOT) | |
1884 | return; | |
1885 | ||
1886 | r = sd_event_now(sd_event_source_get_event(timer), CLOCK_MONOTONIC, &now); | |
1887 | if (r < 0) { | |
e167d7fd LP |
1888 | log_debug_errno(r, "Failed to get clock's now for scheduling ftruncate: %m"); |
1889 | goto fail; | |
7a24f3bf VC |
1890 | } |
1891 | ||
1892 | r = sd_event_source_set_time(timer, now+f->post_change_timer_period); | |
1893 | if (r < 0) { | |
e167d7fd LP |
1894 | log_debug_errno(r, "Failed to set time for scheduling ftruncate: %m"); |
1895 | goto fail; | |
7a24f3bf VC |
1896 | } |
1897 | ||
1898 | r = sd_event_source_set_enabled(timer, SD_EVENT_ONESHOT); | |
1899 | if (r < 0) { | |
e167d7fd LP |
1900 | log_debug_errno(r, "Failed to enable scheduled ftruncate: %m"); |
1901 | goto fail; | |
7a24f3bf | 1902 | } |
e167d7fd LP |
1903 | |
1904 | return; | |
1905 | ||
1906 | fail: | |
1907 | /* On failure, let's simply post the change immediately. */ | |
1908 | journal_file_post_change(f); | |
7a24f3bf VC |
1909 | } |
1910 | ||
1911 | /* Enable coalesced change posting in a timer on the provided sd_event instance */ | |
1912 | int journal_file_enable_post_change_timer(JournalFile *f, sd_event *e, usec_t t) { | |
1913 | _cleanup_(sd_event_source_unrefp) sd_event_source *timer = NULL; | |
1914 | int r; | |
1915 | ||
1916 | assert(f); | |
1917 | assert_return(!f->post_change_timer, -EINVAL); | |
1918 | assert(e); | |
1919 | assert(t); | |
1920 | ||
1921 | r = sd_event_add_time(e, &timer, CLOCK_MONOTONIC, 0, 0, post_change_thunk, f); | |
1922 | if (r < 0) | |
1923 | return r; | |
1924 | ||
1925 | r = sd_event_source_set_enabled(timer, SD_EVENT_OFF); | |
1926 | if (r < 0) | |
1927 | return r; | |
1928 | ||
1cc6c93a | 1929 | f->post_change_timer = TAKE_PTR(timer); |
7a24f3bf VC |
1930 | f->post_change_timer_period = t; |
1931 | ||
1932 | return r; | |
1933 | } | |
1934 | ||
1f2da9ec LP |
1935 | static int entry_item_cmp(const void *_a, const void *_b) { |
1936 | const EntryItem *a = _a, *b = _b; | |
1937 | ||
1938 | if (le64toh(a->object_offset) < le64toh(b->object_offset)) | |
1939 | return -1; | |
1940 | if (le64toh(a->object_offset) > le64toh(b->object_offset)) | |
1941 | return 1; | |
1942 | return 0; | |
1943 | } | |
1944 | ||
de190aef | 1945 | int journal_file_append_entry(JournalFile *f, const dual_timestamp *ts, const struct iovec iovec[], unsigned n_iovec, uint64_t *seqnum, Object **ret, uint64_t *offset) { |
cec736d2 LP |
1946 | unsigned i; |
1947 | EntryItem *items; | |
1948 | int r; | |
1949 | uint64_t xor_hash = 0; | |
de190aef | 1950 | struct dual_timestamp _ts; |
cec736d2 LP |
1951 | |
1952 | assert(f); | |
c88cc6af | 1953 | assert(f->header); |
cec736d2 LP |
1954 | assert(iovec || n_iovec == 0); |
1955 | ||
de190aef LP |
1956 | if (!ts) { |
1957 | dual_timestamp_get(&_ts); | |
1958 | ts = &_ts; | |
1959 | } | |
1960 | ||
349cc4a5 | 1961 | #if HAVE_GCRYPT |
7560fffc LP |
1962 | r = journal_file_maybe_append_tag(f, ts->realtime); |
1963 | if (r < 0) | |
1964 | return r; | |
feb12d3e | 1965 | #endif |
7560fffc | 1966 | |
64825d3c | 1967 | /* alloca() can't take 0, hence let's allocate at least one */ |
cf409d15 | 1968 | items = newa(EntryItem, MAX(1u, n_iovec)); |
cec736d2 LP |
1969 | |
1970 | for (i = 0; i < n_iovec; i++) { | |
1971 | uint64_t p; | |
1972 | Object *o; | |
1973 | ||
1974 | r = journal_file_append_data(f, iovec[i].iov_base, iovec[i].iov_len, &o, &p); | |
1975 | if (r < 0) | |
cf244689 | 1976 | return r; |
cec736d2 LP |
1977 | |
1978 | xor_hash ^= le64toh(o->data.hash); | |
1979 | items[i].object_offset = htole64(p); | |
de7b95cd | 1980 | items[i].hash = o->data.hash; |
cec736d2 LP |
1981 | } |
1982 | ||
1f2da9ec LP |
1983 | /* Order by the position on disk, in order to improve seek |
1984 | * times for rotating media. */ | |
7ff7394d | 1985 | qsort_safe(items, n_iovec, sizeof(EntryItem), entry_item_cmp); |
1f2da9ec | 1986 | |
de190aef | 1987 | r = journal_file_append_entry_internal(f, ts, xor_hash, items, n_iovec, seqnum, ret, offset); |
cec736d2 | 1988 | |
fa6ac760 LP |
1989 | /* If the memory mapping triggered a SIGBUS then we return an |
1990 | * IO error and ignore the error code passed down to us, since | |
1991 | * it is very likely just an effect of a nullified replacement | |
1992 | * mapping page */ | |
1993 | ||
be7cdd8e | 1994 | if (mmap_cache_got_sigbus(f->mmap, f->cache_fd)) |
fa6ac760 LP |
1995 | r = -EIO; |
1996 | ||
7a24f3bf VC |
1997 | if (f->post_change_timer) |
1998 | schedule_post_change(f); | |
1999 | else | |
2000 | journal_file_post_change(f); | |
50f20cfd | 2001 | |
cec736d2 LP |
2002 | return r; |
2003 | } | |
2004 | ||
a4bcff5b | 2005 | typedef struct ChainCacheItem { |
fb099c8d | 2006 | uint64_t first; /* the array at the beginning of the chain */ |
a4bcff5b LP |
2007 | uint64_t array; /* the cached array */ |
2008 | uint64_t begin; /* the first item in the cached array */ | |
2009 | uint64_t total; /* the total number of items in all arrays before this one in the chain */ | |
f268980d | 2010 | uint64_t last_index; /* the last index we looked at, to optimize locality when bisecting */ |
a4bcff5b LP |
2011 | } ChainCacheItem; |
2012 | ||
2013 | static void chain_cache_put( | |
4743015d | 2014 | OrderedHashmap *h, |
a4bcff5b LP |
2015 | ChainCacheItem *ci, |
2016 | uint64_t first, | |
2017 | uint64_t array, | |
2018 | uint64_t begin, | |
f268980d LP |
2019 | uint64_t total, |
2020 | uint64_t last_index) { | |
a4bcff5b LP |
2021 | |
2022 | if (!ci) { | |
34741aa3 LP |
2023 | /* If the chain item to cache for this chain is the |
2024 | * first one it's not worth caching anything */ | |
2025 | if (array == first) | |
2026 | return; | |
2027 | ||
29433089 | 2028 | if (ordered_hashmap_size(h) >= CHAIN_CACHE_MAX) { |
4743015d | 2029 | ci = ordered_hashmap_steal_first(h); |
29433089 LP |
2030 | assert(ci); |
2031 | } else { | |
a4bcff5b LP |
2032 | ci = new(ChainCacheItem, 1); |
2033 | if (!ci) | |
2034 | return; | |
2035 | } | |
2036 | ||
2037 | ci->first = first; | |
2038 | ||
4743015d | 2039 | if (ordered_hashmap_put(h, &ci->first, ci) < 0) { |
a4bcff5b LP |
2040 | free(ci); |
2041 | return; | |
2042 | } | |
2043 | } else | |
2044 | assert(ci->first == first); | |
2045 | ||
2046 | ci->array = array; | |
2047 | ci->begin = begin; | |
2048 | ci->total = total; | |
f268980d | 2049 | ci->last_index = last_index; |
a4bcff5b LP |
2050 | } |
2051 | ||
f268980d LP |
2052 | static int generic_array_get( |
2053 | JournalFile *f, | |
2054 | uint64_t first, | |
2055 | uint64_t i, | |
2056 | Object **ret, uint64_t *offset) { | |
de190aef | 2057 | |
cec736d2 | 2058 | Object *o; |
a4bcff5b | 2059 | uint64_t p = 0, a, t = 0; |
cec736d2 | 2060 | int r; |
a4bcff5b | 2061 | ChainCacheItem *ci; |
cec736d2 LP |
2062 | |
2063 | assert(f); | |
2064 | ||
de190aef | 2065 | a = first; |
a4bcff5b LP |
2066 | |
2067 | /* Try the chain cache first */ | |
4743015d | 2068 | ci = ordered_hashmap_get(f->chain_cache, &first); |
a4bcff5b LP |
2069 | if (ci && i > ci->total) { |
2070 | a = ci->array; | |
2071 | i -= ci->total; | |
2072 | t = ci->total; | |
2073 | } | |
2074 | ||
de190aef | 2075 | while (a > 0) { |
a4bcff5b | 2076 | uint64_t k; |
cec736d2 | 2077 | |
de190aef LP |
2078 | r = journal_file_move_to_object(f, OBJECT_ENTRY_ARRAY, a, &o); |
2079 | if (r < 0) | |
2080 | return r; | |
cec736d2 | 2081 | |
a4bcff5b LP |
2082 | k = journal_file_entry_array_n_items(o); |
2083 | if (i < k) { | |
de190aef | 2084 | p = le64toh(o->entry_array.items[i]); |
a4bcff5b | 2085 | goto found; |
cec736d2 LP |
2086 | } |
2087 | ||
a4bcff5b LP |
2088 | i -= k; |
2089 | t += k; | |
de190aef LP |
2090 | a = le64toh(o->entry_array.next_entry_array_offset); |
2091 | } | |
2092 | ||
a4bcff5b LP |
2093 | return 0; |
2094 | ||
2095 | found: | |
2096 | /* Let's cache this item for the next invocation */ | |
af13a6b0 | 2097 | chain_cache_put(f->chain_cache, ci, first, a, le64toh(o->entry_array.items[0]), t, i); |
de190aef LP |
2098 | |
2099 | r = journal_file_move_to_object(f, OBJECT_ENTRY, p, &o); | |
2100 | if (r < 0) | |
2101 | return r; | |
2102 | ||
2103 | if (ret) | |
2104 | *ret = o; | |
2105 | ||
2106 | if (offset) | |
2107 | *offset = p; | |
2108 | ||
2109 | return 1; | |
2110 | } | |
2111 | ||
f268980d LP |
2112 | static int generic_array_get_plus_one( |
2113 | JournalFile *f, | |
2114 | uint64_t extra, | |
2115 | uint64_t first, | |
2116 | uint64_t i, | |
2117 | Object **ret, uint64_t *offset) { | |
de190aef LP |
2118 | |
2119 | Object *o; | |
2120 | ||
2121 | assert(f); | |
2122 | ||
2123 | if (i == 0) { | |
2124 | int r; | |
2125 | ||
2126 | r = journal_file_move_to_object(f, OBJECT_ENTRY, extra, &o); | |
cec736d2 LP |
2127 | if (r < 0) |
2128 | return r; | |
2129 | ||
de190aef LP |
2130 | if (ret) |
2131 | *ret = o; | |
cec736d2 | 2132 | |
de190aef LP |
2133 | if (offset) |
2134 | *offset = extra; | |
cec736d2 | 2135 | |
de190aef | 2136 | return 1; |
cec736d2 LP |
2137 | } |
2138 | ||
de190aef LP |
2139 | return generic_array_get(f, first, i-1, ret, offset); |
2140 | } | |
cec736d2 | 2141 | |
de190aef LP |
2142 | enum { |
2143 | TEST_FOUND, | |
2144 | TEST_LEFT, | |
2145 | TEST_RIGHT | |
2146 | }; | |
cec736d2 | 2147 | |
f268980d LP |
2148 | static int generic_array_bisect( |
2149 | JournalFile *f, | |
2150 | uint64_t first, | |
2151 | uint64_t n, | |
2152 | uint64_t needle, | |
2153 | int (*test_object)(JournalFile *f, uint64_t p, uint64_t needle), | |
2154 | direction_t direction, | |
2155 | Object **ret, | |
2156 | uint64_t *offset, | |
2157 | uint64_t *idx) { | |
2158 | ||
2159 | uint64_t a, p, t = 0, i = 0, last_p = 0, last_index = (uint64_t) -1; | |
de190aef LP |
2160 | bool subtract_one = false; |
2161 | Object *o, *array = NULL; | |
2162 | int r; | |
a4bcff5b | 2163 | ChainCacheItem *ci; |
cec736d2 | 2164 | |
de190aef LP |
2165 | assert(f); |
2166 | assert(test_object); | |
cec736d2 | 2167 | |
a4bcff5b | 2168 | /* Start with the first array in the chain */ |
de190aef | 2169 | a = first; |
a4bcff5b | 2170 | |
4743015d | 2171 | ci = ordered_hashmap_get(f->chain_cache, &first); |
96d4d024 | 2172 | if (ci && n > ci->total && ci->begin != 0) { |
a4bcff5b LP |
2173 | /* Ah, we have iterated this bisection array chain |
2174 | * previously! Let's see if we can skip ahead in the | |
2175 | * chain, as far as the last time. But we can't jump | |
2176 | * backwards in the chain, so let's check that | |
2177 | * first. */ | |
2178 | ||
2179 | r = test_object(f, ci->begin, needle); | |
2180 | if (r < 0) | |
2181 | return r; | |
2182 | ||
2183 | if (r == TEST_LEFT) { | |
f268980d | 2184 | /* OK, what we are looking for is right of the |
a4bcff5b LP |
2185 | * begin of this EntryArray, so let's jump |
2186 | * straight to previously cached array in the | |
2187 | * chain */ | |
2188 | ||
2189 | a = ci->array; | |
2190 | n -= ci->total; | |
2191 | t = ci->total; | |
f268980d | 2192 | last_index = ci->last_index; |
a4bcff5b LP |
2193 | } |
2194 | } | |
2195 | ||
de190aef LP |
2196 | while (a > 0) { |
2197 | uint64_t left, right, k, lp; | |
2198 | ||
2199 | r = journal_file_move_to_object(f, OBJECT_ENTRY_ARRAY, a, &array); | |
cec736d2 LP |
2200 | if (r < 0) |
2201 | return r; | |
2202 | ||
de190aef LP |
2203 | k = journal_file_entry_array_n_items(array); |
2204 | right = MIN(k, n); | |
2205 | if (right <= 0) | |
2206 | return 0; | |
cec736d2 | 2207 | |
de190aef LP |
2208 | i = right - 1; |
2209 | lp = p = le64toh(array->entry_array.items[i]); | |
2210 | if (p <= 0) | |
bee6a291 LP |
2211 | r = -EBADMSG; |
2212 | else | |
2213 | r = test_object(f, p, needle); | |
2214 | if (r == -EBADMSG) { | |
2215 | log_debug_errno(r, "Encountered invalid entry while bisecting, cutting algorithm short. (1)"); | |
2216 | n = i; | |
2217 | continue; | |
2218 | } | |
de190aef LP |
2219 | if (r < 0) |
2220 | return r; | |
cec736d2 | 2221 | |
de190aef LP |
2222 | if (r == TEST_FOUND) |
2223 | r = direction == DIRECTION_DOWN ? TEST_RIGHT : TEST_LEFT; | |
2224 | ||
2225 | if (r == TEST_RIGHT) { | |
2226 | left = 0; | |
2227 | right -= 1; | |
f268980d LP |
2228 | |
2229 | if (last_index != (uint64_t) -1) { | |
2230 | assert(last_index <= right); | |
2231 | ||
2232 | /* If we cached the last index we | |
2233 | * looked at, let's try to not to jump | |
2234 | * too wildly around and see if we can | |
2235 | * limit the range to look at early to | |
2236 | * the immediate neighbors of the last | |
2237 | * index we looked at. */ | |
2238 | ||
2239 | if (last_index > 0) { | |
2240 | uint64_t x = last_index - 1; | |
2241 | ||
2242 | p = le64toh(array->entry_array.items[x]); | |
2243 | if (p <= 0) | |
2244 | return -EBADMSG; | |
2245 | ||
2246 | r = test_object(f, p, needle); | |
2247 | if (r < 0) | |
2248 | return r; | |
2249 | ||
2250 | if (r == TEST_FOUND) | |
2251 | r = direction == DIRECTION_DOWN ? TEST_RIGHT : TEST_LEFT; | |
2252 | ||
2253 | if (r == TEST_RIGHT) | |
2254 | right = x; | |
2255 | else | |
2256 | left = x + 1; | |
2257 | } | |
2258 | ||
2259 | if (last_index < right) { | |
2260 | uint64_t y = last_index + 1; | |
2261 | ||
2262 | p = le64toh(array->entry_array.items[y]); | |
2263 | if (p <= 0) | |
2264 | return -EBADMSG; | |
2265 | ||
2266 | r = test_object(f, p, needle); | |
2267 | if (r < 0) | |
2268 | return r; | |
2269 | ||
2270 | if (r == TEST_FOUND) | |
2271 | r = direction == DIRECTION_DOWN ? TEST_RIGHT : TEST_LEFT; | |
2272 | ||
2273 | if (r == TEST_RIGHT) | |
2274 | right = y; | |
2275 | else | |
2276 | left = y + 1; | |
2277 | } | |
f268980d LP |
2278 | } |
2279 | ||
de190aef LP |
2280 | for (;;) { |
2281 | if (left == right) { | |
2282 | if (direction == DIRECTION_UP) | |
2283 | subtract_one = true; | |
2284 | ||
2285 | i = left; | |
2286 | goto found; | |
2287 | } | |
2288 | ||
2289 | assert(left < right); | |
de190aef | 2290 | i = (left + right) / 2; |
f268980d | 2291 | |
de190aef LP |
2292 | p = le64toh(array->entry_array.items[i]); |
2293 | if (p <= 0) | |
bee6a291 LP |
2294 | r = -EBADMSG; |
2295 | else | |
2296 | r = test_object(f, p, needle); | |
2297 | if (r == -EBADMSG) { | |
2298 | log_debug_errno(r, "Encountered invalid entry while bisecting, cutting algorithm short. (2)"); | |
2299 | right = n = i; | |
2300 | continue; | |
2301 | } | |
de190aef LP |
2302 | if (r < 0) |
2303 | return r; | |
cec736d2 | 2304 | |
de190aef LP |
2305 | if (r == TEST_FOUND) |
2306 | r = direction == DIRECTION_DOWN ? TEST_RIGHT : TEST_LEFT; | |
2307 | ||
2308 | if (r == TEST_RIGHT) | |
2309 | right = i; | |
2310 | else | |
2311 | left = i + 1; | |
2312 | } | |
2313 | } | |
2314 | ||
2173cbf8 | 2315 | if (k >= n) { |
cbdca852 LP |
2316 | if (direction == DIRECTION_UP) { |
2317 | i = n; | |
2318 | subtract_one = true; | |
2319 | goto found; | |
2320 | } | |
2321 | ||
cec736d2 | 2322 | return 0; |
cbdca852 | 2323 | } |
cec736d2 | 2324 | |
de190aef LP |
2325 | last_p = lp; |
2326 | ||
2327 | n -= k; | |
2328 | t += k; | |
f268980d | 2329 | last_index = (uint64_t) -1; |
de190aef | 2330 | a = le64toh(array->entry_array.next_entry_array_offset); |
cec736d2 LP |
2331 | } |
2332 | ||
2333 | return 0; | |
de190aef LP |
2334 | |
2335 | found: | |
2336 | if (subtract_one && t == 0 && i == 0) | |
2337 | return 0; | |
2338 | ||
a4bcff5b | 2339 | /* Let's cache this item for the next invocation */ |
af13a6b0 | 2340 | chain_cache_put(f->chain_cache, ci, first, a, le64toh(array->entry_array.items[0]), t, subtract_one ? (i > 0 ? i-1 : (uint64_t) -1) : i); |
a4bcff5b | 2341 | |
de190aef LP |
2342 | if (subtract_one && i == 0) |
2343 | p = last_p; | |
2344 | else if (subtract_one) | |
2345 | p = le64toh(array->entry_array.items[i-1]); | |
2346 | else | |
2347 | p = le64toh(array->entry_array.items[i]); | |
2348 | ||
2349 | r = journal_file_move_to_object(f, OBJECT_ENTRY, p, &o); | |
2350 | if (r < 0) | |
2351 | return r; | |
2352 | ||
2353 | if (ret) | |
2354 | *ret = o; | |
2355 | ||
2356 | if (offset) | |
2357 | *offset = p; | |
2358 | ||
2359 | if (idx) | |
cbdca852 | 2360 | *idx = t + i + (subtract_one ? -1 : 0); |
de190aef LP |
2361 | |
2362 | return 1; | |
cec736d2 LP |
2363 | } |
2364 | ||
f268980d LP |
2365 | static int generic_array_bisect_plus_one( |
2366 | JournalFile *f, | |
2367 | uint64_t extra, | |
2368 | uint64_t first, | |
2369 | uint64_t n, | |
2370 | uint64_t needle, | |
2371 | int (*test_object)(JournalFile *f, uint64_t p, uint64_t needle), | |
2372 | direction_t direction, | |
2373 | Object **ret, | |
2374 | uint64_t *offset, | |
2375 | uint64_t *idx) { | |
de190aef | 2376 | |
cec736d2 | 2377 | int r; |
cbdca852 LP |
2378 | bool step_back = false; |
2379 | Object *o; | |
cec736d2 LP |
2380 | |
2381 | assert(f); | |
de190aef | 2382 | assert(test_object); |
cec736d2 | 2383 | |
de190aef LP |
2384 | if (n <= 0) |
2385 | return 0; | |
cec736d2 | 2386 | |
de190aef LP |
2387 | /* This bisects the array in object 'first', but first checks |
2388 | * an extra */ | |
de190aef LP |
2389 | r = test_object(f, extra, needle); |
2390 | if (r < 0) | |
2391 | return r; | |
a536e261 LP |
2392 | |
2393 | if (r == TEST_FOUND) | |
2394 | r = direction == DIRECTION_DOWN ? TEST_RIGHT : TEST_LEFT; | |
2395 | ||
cbdca852 LP |
2396 | /* if we are looking with DIRECTION_UP then we need to first |
2397 | see if in the actual array there is a matching entry, and | |
2398 | return the last one of that. But if there isn't any we need | |
2399 | to return this one. Hence remember this, and return it | |
2400 | below. */ | |
2401 | if (r == TEST_LEFT) | |
2402 | step_back = direction == DIRECTION_UP; | |
de190aef | 2403 | |
cbdca852 LP |
2404 | if (r == TEST_RIGHT) { |
2405 | if (direction == DIRECTION_DOWN) | |
2406 | goto found; | |
2407 | else | |
2408 | return 0; | |
a536e261 | 2409 | } |
cec736d2 | 2410 | |
de190aef LP |
2411 | r = generic_array_bisect(f, first, n-1, needle, test_object, direction, ret, offset, idx); |
2412 | ||
cbdca852 LP |
2413 | if (r == 0 && step_back) |
2414 | goto found; | |
2415 | ||
ecf68b1d | 2416 | if (r > 0 && idx) |
313cefa1 | 2417 | (*idx)++; |
de190aef LP |
2418 | |
2419 | return r; | |
cbdca852 LP |
2420 | |
2421 | found: | |
2422 | r = journal_file_move_to_object(f, OBJECT_ENTRY, extra, &o); | |
2423 | if (r < 0) | |
2424 | return r; | |
2425 | ||
2426 | if (ret) | |
2427 | *ret = o; | |
2428 | ||
2429 | if (offset) | |
2430 | *offset = extra; | |
2431 | ||
2432 | if (idx) | |
2433 | *idx = 0; | |
2434 | ||
2435 | return 1; | |
2436 | } | |
2437 | ||
44a6b1b6 | 2438 | _pure_ static int test_object_offset(JournalFile *f, uint64_t p, uint64_t needle) { |
cbdca852 LP |
2439 | assert(f); |
2440 | assert(p > 0); | |
2441 | ||
2442 | if (p == needle) | |
2443 | return TEST_FOUND; | |
2444 | else if (p < needle) | |
2445 | return TEST_LEFT; | |
2446 | else | |
2447 | return TEST_RIGHT; | |
2448 | } | |
2449 | ||
de190aef LP |
2450 | static int test_object_seqnum(JournalFile *f, uint64_t p, uint64_t needle) { |
2451 | Object *o; | |
2452 | int r; | |
2453 | ||
2454 | assert(f); | |
2455 | assert(p > 0); | |
2456 | ||
2457 | r = journal_file_move_to_object(f, OBJECT_ENTRY, p, &o); | |
cec736d2 LP |
2458 | if (r < 0) |
2459 | return r; | |
2460 | ||
de190aef LP |
2461 | if (le64toh(o->entry.seqnum) == needle) |
2462 | return TEST_FOUND; | |
2463 | else if (le64toh(o->entry.seqnum) < needle) | |
2464 | return TEST_LEFT; | |
2465 | else | |
2466 | return TEST_RIGHT; | |
2467 | } | |
cec736d2 | 2468 | |
de190aef LP |
2469 | int journal_file_move_to_entry_by_seqnum( |
2470 | JournalFile *f, | |
2471 | uint64_t seqnum, | |
2472 | direction_t direction, | |
2473 | Object **ret, | |
2474 | uint64_t *offset) { | |
c88cc6af VC |
2475 | assert(f); |
2476 | assert(f->header); | |
de190aef LP |
2477 | |
2478 | return generic_array_bisect(f, | |
2479 | le64toh(f->header->entry_array_offset), | |
2480 | le64toh(f->header->n_entries), | |
2481 | seqnum, | |
2482 | test_object_seqnum, | |
2483 | direction, | |
2484 | ret, offset, NULL); | |
2485 | } | |
cec736d2 | 2486 | |
de190aef LP |
2487 | static int test_object_realtime(JournalFile *f, uint64_t p, uint64_t needle) { |
2488 | Object *o; | |
2489 | int r; | |
2490 | ||
2491 | assert(f); | |
2492 | assert(p > 0); | |
2493 | ||
2494 | r = journal_file_move_to_object(f, OBJECT_ENTRY, p, &o); | |
2495 | if (r < 0) | |
2496 | return r; | |
2497 | ||
2498 | if (le64toh(o->entry.realtime) == needle) | |
2499 | return TEST_FOUND; | |
2500 | else if (le64toh(o->entry.realtime) < needle) | |
2501 | return TEST_LEFT; | |
2502 | else | |
2503 | return TEST_RIGHT; | |
cec736d2 LP |
2504 | } |
2505 | ||
de190aef LP |
2506 | int journal_file_move_to_entry_by_realtime( |
2507 | JournalFile *f, | |
2508 | uint64_t realtime, | |
2509 | direction_t direction, | |
2510 | Object **ret, | |
2511 | uint64_t *offset) { | |
c88cc6af VC |
2512 | assert(f); |
2513 | assert(f->header); | |
de190aef LP |
2514 | |
2515 | return generic_array_bisect(f, | |
2516 | le64toh(f->header->entry_array_offset), | |
2517 | le64toh(f->header->n_entries), | |
2518 | realtime, | |
2519 | test_object_realtime, | |
2520 | direction, | |
2521 | ret, offset, NULL); | |
2522 | } | |
2523 | ||
2524 | static int test_object_monotonic(JournalFile *f, uint64_t p, uint64_t needle) { | |
2525 | Object *o; | |
2526 | int r; | |
2527 | ||
2528 | assert(f); | |
2529 | assert(p > 0); | |
2530 | ||
2531 | r = journal_file_move_to_object(f, OBJECT_ENTRY, p, &o); | |
2532 | if (r < 0) | |
2533 | return r; | |
2534 | ||
2535 | if (le64toh(o->entry.monotonic) == needle) | |
2536 | return TEST_FOUND; | |
2537 | else if (le64toh(o->entry.monotonic) < needle) | |
2538 | return TEST_LEFT; | |
2539 | else | |
2540 | return TEST_RIGHT; | |
2541 | } | |
2542 | ||
2a560338 | 2543 | static int find_data_object_by_boot_id( |
47838ab3 ZJS |
2544 | JournalFile *f, |
2545 | sd_id128_t boot_id, | |
2546 | Object **o, | |
2547 | uint64_t *b) { | |
2a560338 | 2548 | |
fbd0b64f | 2549 | char t[STRLEN("_BOOT_ID=") + 32 + 1] = "_BOOT_ID="; |
47838ab3 ZJS |
2550 | |
2551 | sd_id128_to_string(boot_id, t + 9); | |
2552 | return journal_file_find_data_object(f, t, sizeof(t) - 1, o, b); | |
2553 | } | |
2554 | ||
de190aef LP |
2555 | int journal_file_move_to_entry_by_monotonic( |
2556 | JournalFile *f, | |
2557 | sd_id128_t boot_id, | |
2558 | uint64_t monotonic, | |
2559 | direction_t direction, | |
2560 | Object **ret, | |
2561 | uint64_t *offset) { | |
2562 | ||
de190aef LP |
2563 | Object *o; |
2564 | int r; | |
2565 | ||
cbdca852 | 2566 | assert(f); |
de190aef | 2567 | |
47838ab3 | 2568 | r = find_data_object_by_boot_id(f, boot_id, &o, NULL); |
de190aef LP |
2569 | if (r < 0) |
2570 | return r; | |
cbdca852 | 2571 | if (r == 0) |
de190aef LP |
2572 | return -ENOENT; |
2573 | ||
2574 | return generic_array_bisect_plus_one(f, | |
2575 | le64toh(o->data.entry_offset), | |
2576 | le64toh(o->data.entry_array_offset), | |
2577 | le64toh(o->data.n_entries), | |
2578 | monotonic, | |
2579 | test_object_monotonic, | |
2580 | direction, | |
2581 | ret, offset, NULL); | |
2582 | } | |
2583 | ||
1fc605b0 | 2584 | void journal_file_reset_location(JournalFile *f) { |
6573ef05 | 2585 | f->location_type = LOCATION_HEAD; |
1fc605b0 | 2586 | f->current_offset = 0; |
6573ef05 MS |
2587 | f->current_seqnum = 0; |
2588 | f->current_realtime = 0; | |
2589 | f->current_monotonic = 0; | |
2590 | zero(f->current_boot_id); | |
2591 | f->current_xor_hash = 0; | |
2592 | } | |
2593 | ||
950c07d4 | 2594 | void journal_file_save_location(JournalFile *f, Object *o, uint64_t offset) { |
6573ef05 MS |
2595 | f->location_type = LOCATION_SEEK; |
2596 | f->current_offset = offset; | |
2597 | f->current_seqnum = le64toh(o->entry.seqnum); | |
2598 | f->current_realtime = le64toh(o->entry.realtime); | |
2599 | f->current_monotonic = le64toh(o->entry.monotonic); | |
2600 | f->current_boot_id = o->entry.boot_id; | |
2601 | f->current_xor_hash = le64toh(o->entry.xor_hash); | |
1fc605b0 MS |
2602 | } |
2603 | ||
d8ae66d7 MS |
2604 | int journal_file_compare_locations(JournalFile *af, JournalFile *bf) { |
2605 | assert(af); | |
c88cc6af | 2606 | assert(af->header); |
d8ae66d7 | 2607 | assert(bf); |
c88cc6af | 2608 | assert(bf->header); |
d8ae66d7 MS |
2609 | assert(af->location_type == LOCATION_SEEK); |
2610 | assert(bf->location_type == LOCATION_SEEK); | |
2611 | ||
2612 | /* If contents and timestamps match, these entries are | |
2613 | * identical, even if the seqnum does not match */ | |
2614 | if (sd_id128_equal(af->current_boot_id, bf->current_boot_id) && | |
2615 | af->current_monotonic == bf->current_monotonic && | |
2616 | af->current_realtime == bf->current_realtime && | |
2617 | af->current_xor_hash == bf->current_xor_hash) | |
2618 | return 0; | |
2619 | ||
2620 | if (sd_id128_equal(af->header->seqnum_id, bf->header->seqnum_id)) { | |
2621 | ||
2622 | /* If this is from the same seqnum source, compare | |
2623 | * seqnums */ | |
2624 | if (af->current_seqnum < bf->current_seqnum) | |
2625 | return -1; | |
2626 | if (af->current_seqnum > bf->current_seqnum) | |
2627 | return 1; | |
2628 | ||
2629 | /* Wow! This is weird, different data but the same | |
2630 | * seqnums? Something is borked, but let's make the | |
2631 | * best of it and compare by time. */ | |
2632 | } | |
2633 | ||
2634 | if (sd_id128_equal(af->current_boot_id, bf->current_boot_id)) { | |
2635 | ||
2636 | /* If the boot id matches, compare monotonic time */ | |
2637 | if (af->current_monotonic < bf->current_monotonic) | |
2638 | return -1; | |
2639 | if (af->current_monotonic > bf->current_monotonic) | |
2640 | return 1; | |
2641 | } | |
2642 | ||
2643 | /* Otherwise, compare UTC time */ | |
2644 | if (af->current_realtime < bf->current_realtime) | |
2645 | return -1; | |
2646 | if (af->current_realtime > bf->current_realtime) | |
2647 | return 1; | |
2648 | ||
2649 | /* Finally, compare by contents */ | |
2650 | if (af->current_xor_hash < bf->current_xor_hash) | |
2651 | return -1; | |
2652 | if (af->current_xor_hash > bf->current_xor_hash) | |
2653 | return 1; | |
2654 | ||
2655 | return 0; | |
2656 | } | |
2657 | ||
aa598ba5 LP |
2658 | static int bump_array_index(uint64_t *i, direction_t direction, uint64_t n) { |
2659 | ||
2660 | /* Increase or decrease the specified index, in the right direction. */ | |
2661 | ||
2662 | if (direction == DIRECTION_DOWN) { | |
2663 | if (*i >= n - 1) | |
2664 | return 0; | |
2665 | ||
2666 | (*i) ++; | |
2667 | } else { | |
2668 | if (*i <= 0) | |
2669 | return 0; | |
2670 | ||
2671 | (*i) --; | |
2672 | } | |
2673 | ||
2674 | return 1; | |
2675 | } | |
2676 | ||
b6da4ed0 LP |
2677 | static bool check_properly_ordered(uint64_t new_offset, uint64_t old_offset, direction_t direction) { |
2678 | ||
2679 | /* Consider it an error if any of the two offsets is uninitialized */ | |
2680 | if (old_offset == 0 || new_offset == 0) | |
2681 | return false; | |
2682 | ||
2683 | /* If we go down, the new offset must be larger than the old one. */ | |
2684 | return direction == DIRECTION_DOWN ? | |
2685 | new_offset > old_offset : | |
2686 | new_offset < old_offset; | |
2687 | } | |
2688 | ||
de190aef LP |
2689 | int journal_file_next_entry( |
2690 | JournalFile *f, | |
f534928a | 2691 | uint64_t p, |
de190aef LP |
2692 | direction_t direction, |
2693 | Object **ret, uint64_t *offset) { | |
2694 | ||
fb099c8d | 2695 | uint64_t i, n, ofs; |
cec736d2 LP |
2696 | int r; |
2697 | ||
2698 | assert(f); | |
c88cc6af | 2699 | assert(f->header); |
de190aef LP |
2700 | |
2701 | n = le64toh(f->header->n_entries); | |
2702 | if (n <= 0) | |
2703 | return 0; | |
cec736d2 | 2704 | |
f534928a | 2705 | if (p == 0) |
de190aef | 2706 | i = direction == DIRECTION_DOWN ? 0 : n - 1; |
cec736d2 | 2707 | else { |
de190aef LP |
2708 | r = generic_array_bisect(f, |
2709 | le64toh(f->header->entry_array_offset), | |
2710 | le64toh(f->header->n_entries), | |
2711 | p, | |
2712 | test_object_offset, | |
2713 | DIRECTION_DOWN, | |
2714 | NULL, NULL, | |
2715 | &i); | |
2716 | if (r <= 0) | |
2717 | return r; | |
2718 | ||
aa598ba5 LP |
2719 | r = bump_array_index(&i, direction, n); |
2720 | if (r <= 0) | |
2721 | return r; | |
cec736d2 LP |
2722 | } |
2723 | ||
de190aef | 2724 | /* And jump to it */ |
989793d3 LP |
2725 | for (;;) { |
2726 | r = generic_array_get(f, | |
2727 | le64toh(f->header->entry_array_offset), | |
2728 | i, | |
2729 | ret, &ofs); | |
2730 | if (r > 0) | |
2731 | break; | |
2732 | if (r != -EBADMSG) | |
2733 | return r; | |
2734 | ||
2735 | /* OK, so this entry is borked. Most likely some entry didn't get synced to disk properly, let's see if | |
2736 | * the next one might work for us instead. */ | |
2737 | log_debug_errno(r, "Entry item %" PRIu64 " is bad, skipping over it.", i); | |
2738 | ||
2739 | r = bump_array_index(&i, direction, n); | |
2740 | if (r <= 0) | |
2741 | return r; | |
caeab8f6 | 2742 | } |
fb099c8d | 2743 | |
b6da4ed0 LP |
2744 | /* Ensure our array is properly ordered. */ |
2745 | if (p > 0 && !check_properly_ordered(ofs, p, direction)) { | |
2746 | log_debug("%s: entry array not properly ordered at entry %" PRIu64, f->path, i); | |
fb099c8d ZJS |
2747 | return -EBADMSG; |
2748 | } | |
2749 | ||
2750 | if (offset) | |
2751 | *offset = ofs; | |
2752 | ||
2753 | return 1; | |
de190aef | 2754 | } |
cec736d2 | 2755 | |
de190aef LP |
2756 | int journal_file_next_entry_for_data( |
2757 | JournalFile *f, | |
2758 | Object *o, uint64_t p, | |
2759 | uint64_t data_offset, | |
2760 | direction_t direction, | |
2761 | Object **ret, uint64_t *offset) { | |
2762 | ||
ded5034e | 2763 | uint64_t i, n, ofs; |
de190aef | 2764 | Object *d; |
989793d3 | 2765 | int r; |
cec736d2 LP |
2766 | |
2767 | assert(f); | |
de190aef | 2768 | assert(p > 0 || !o); |
cec736d2 | 2769 | |
de190aef | 2770 | r = journal_file_move_to_object(f, OBJECT_DATA, data_offset, &d); |
466ccd92 | 2771 | if (r < 0) |
de190aef | 2772 | return r; |
cec736d2 | 2773 | |
de190aef LP |
2774 | n = le64toh(d->data.n_entries); |
2775 | if (n <= 0) | |
2776 | return n; | |
cec736d2 | 2777 | |
de190aef LP |
2778 | if (!o) |
2779 | i = direction == DIRECTION_DOWN ? 0 : n - 1; | |
2780 | else { | |
2781 | if (o->object.type != OBJECT_ENTRY) | |
2782 | return -EINVAL; | |
cec736d2 | 2783 | |
de190aef LP |
2784 | r = generic_array_bisect_plus_one(f, |
2785 | le64toh(d->data.entry_offset), | |
2786 | le64toh(d->data.entry_array_offset), | |
2787 | le64toh(d->data.n_entries), | |
2788 | p, | |
2789 | test_object_offset, | |
2790 | DIRECTION_DOWN, | |
2791 | NULL, NULL, | |
2792 | &i); | |
2793 | ||
2794 | if (r <= 0) | |
cec736d2 LP |
2795 | return r; |
2796 | ||
aa598ba5 LP |
2797 | r = bump_array_index(&i, direction, n); |
2798 | if (r <= 0) | |
2799 | return r; | |
de190aef | 2800 | } |
cec736d2 | 2801 | |
989793d3 LP |
2802 | for (;;) { |
2803 | r = generic_array_get_plus_one(f, | |
2804 | le64toh(d->data.entry_offset), | |
2805 | le64toh(d->data.entry_array_offset), | |
2806 | i, | |
2807 | ret, &ofs); | |
2808 | if (r > 0) | |
2809 | break; | |
2810 | if (r != -EBADMSG) | |
2811 | return r; | |
2812 | ||
2813 | log_debug_errno(r, "Data entry item %" PRIu64 " is bad, skipping over it.", i); | |
2814 | ||
2815 | r = bump_array_index(&i, direction, n); | |
2816 | if (r <= 0) | |
2817 | return r; | |
2818 | } | |
ded5034e LP |
2819 | |
2820 | /* Ensure our array is properly ordered. */ | |
2821 | if (p > 0 && check_properly_ordered(ofs, p, direction)) { | |
2822 | log_debug("%s data entry array not properly ordered at entry %" PRIu64, f->path, i); | |
2823 | return -EBADMSG; | |
2824 | } | |
2825 | ||
2826 | if (offset) | |
2827 | *offset = ofs; | |
2828 | ||
2829 | return 1; | |
de190aef | 2830 | } |
cec736d2 | 2831 | |
cbdca852 LP |
2832 | int journal_file_move_to_entry_by_offset_for_data( |
2833 | JournalFile *f, | |
2834 | uint64_t data_offset, | |
2835 | uint64_t p, | |
2836 | direction_t direction, | |
2837 | Object **ret, uint64_t *offset) { | |
2838 | ||
2839 | int r; | |
2840 | Object *d; | |
2841 | ||
2842 | assert(f); | |
2843 | ||
2844 | r = journal_file_move_to_object(f, OBJECT_DATA, data_offset, &d); | |
2845 | if (r < 0) | |
2846 | return r; | |
2847 | ||
2848 | return generic_array_bisect_plus_one(f, | |
2849 | le64toh(d->data.entry_offset), | |
2850 | le64toh(d->data.entry_array_offset), | |
2851 | le64toh(d->data.n_entries), | |
2852 | p, | |
2853 | test_object_offset, | |
2854 | direction, | |
2855 | ret, offset, NULL); | |
2856 | } | |
2857 | ||
2858 | int journal_file_move_to_entry_by_monotonic_for_data( | |
2859 | JournalFile *f, | |
2860 | uint64_t data_offset, | |
2861 | sd_id128_t boot_id, | |
2862 | uint64_t monotonic, | |
2863 | direction_t direction, | |
2864 | Object **ret, uint64_t *offset) { | |
2865 | ||
cbdca852 LP |
2866 | Object *o, *d; |
2867 | int r; | |
2868 | uint64_t b, z; | |
2869 | ||
2870 | assert(f); | |
2871 | ||
2872 | /* First, seek by time */ | |
47838ab3 | 2873 | r = find_data_object_by_boot_id(f, boot_id, &o, &b); |
cbdca852 LP |
2874 | if (r < 0) |
2875 | return r; | |
2876 | if (r == 0) | |
2877 | return -ENOENT; | |
2878 | ||
2879 | r = generic_array_bisect_plus_one(f, | |
2880 | le64toh(o->data.entry_offset), | |
2881 | le64toh(o->data.entry_array_offset), | |
2882 | le64toh(o->data.n_entries), | |
2883 | monotonic, | |
2884 | test_object_monotonic, | |
2885 | direction, | |
2886 | NULL, &z, NULL); | |
2887 | if (r <= 0) | |
2888 | return r; | |
2889 | ||
2890 | /* And now, continue seeking until we find an entry that | |
2891 | * exists in both bisection arrays */ | |
2892 | ||
2893 | for (;;) { | |
2894 | Object *qo; | |
2895 | uint64_t p, q; | |
2896 | ||
2897 | r = journal_file_move_to_object(f, OBJECT_DATA, data_offset, &d); | |
2898 | if (r < 0) | |
2899 | return r; | |
2900 | ||
2901 | r = generic_array_bisect_plus_one(f, | |
2902 | le64toh(d->data.entry_offset), | |
2903 | le64toh(d->data.entry_array_offset), | |
2904 | le64toh(d->data.n_entries), | |
2905 | z, | |
2906 | test_object_offset, | |
2907 | direction, | |
2908 | NULL, &p, NULL); | |
2909 | if (r <= 0) | |
2910 | return r; | |
2911 | ||
2912 | r = journal_file_move_to_object(f, OBJECT_DATA, b, &o); | |
2913 | if (r < 0) | |
2914 | return r; | |
2915 | ||
2916 | r = generic_array_bisect_plus_one(f, | |
2917 | le64toh(o->data.entry_offset), | |
2918 | le64toh(o->data.entry_array_offset), | |
2919 | le64toh(o->data.n_entries), | |
2920 | p, | |
2921 | test_object_offset, | |
2922 | direction, | |
2923 | &qo, &q, NULL); | |
2924 | ||
2925 | if (r <= 0) | |
2926 | return r; | |
2927 | ||
2928 | if (p == q) { | |
2929 | if (ret) | |
2930 | *ret = qo; | |
2931 | if (offset) | |
2932 | *offset = q; | |
2933 | ||
2934 | return 1; | |
2935 | } | |
2936 | ||
2937 | z = q; | |
2938 | } | |
cbdca852 LP |
2939 | } |
2940 | ||
de190aef LP |
2941 | int journal_file_move_to_entry_by_seqnum_for_data( |
2942 | JournalFile *f, | |
2943 | uint64_t data_offset, | |
2944 | uint64_t seqnum, | |
2945 | direction_t direction, | |
2946 | Object **ret, uint64_t *offset) { | |
cec736d2 | 2947 | |
de190aef LP |
2948 | Object *d; |
2949 | int r; | |
cec736d2 | 2950 | |
91a31dde LP |
2951 | assert(f); |
2952 | ||
de190aef | 2953 | r = journal_file_move_to_object(f, OBJECT_DATA, data_offset, &d); |
91a31dde | 2954 | if (r < 0) |
de190aef | 2955 | return r; |
cec736d2 | 2956 | |
de190aef LP |
2957 | return generic_array_bisect_plus_one(f, |
2958 | le64toh(d->data.entry_offset), | |
2959 | le64toh(d->data.entry_array_offset), | |
2960 | le64toh(d->data.n_entries), | |
2961 | seqnum, | |
2962 | test_object_seqnum, | |
2963 | direction, | |
2964 | ret, offset, NULL); | |
2965 | } | |
cec736d2 | 2966 | |
de190aef LP |
2967 | int journal_file_move_to_entry_by_realtime_for_data( |
2968 | JournalFile *f, | |
2969 | uint64_t data_offset, | |
2970 | uint64_t realtime, | |
2971 | direction_t direction, | |
2972 | Object **ret, uint64_t *offset) { | |
2973 | ||
2974 | Object *d; | |
2975 | int r; | |
2976 | ||
91a31dde LP |
2977 | assert(f); |
2978 | ||
de190aef | 2979 | r = journal_file_move_to_object(f, OBJECT_DATA, data_offset, &d); |
91a31dde | 2980 | if (r < 0) |
de190aef LP |
2981 | return r; |
2982 | ||
2983 | return generic_array_bisect_plus_one(f, | |
2984 | le64toh(d->data.entry_offset), | |
2985 | le64toh(d->data.entry_array_offset), | |
2986 | le64toh(d->data.n_entries), | |
2987 | realtime, | |
2988 | test_object_realtime, | |
2989 | direction, | |
2990 | ret, offset, NULL); | |
cec736d2 LP |
2991 | } |
2992 | ||
0284adc6 | 2993 | void journal_file_dump(JournalFile *f) { |
7560fffc | 2994 | Object *o; |
7560fffc | 2995 | int r; |
0284adc6 | 2996 | uint64_t p; |
7560fffc LP |
2997 | |
2998 | assert(f); | |
c88cc6af | 2999 | assert(f->header); |
7560fffc | 3000 | |
0284adc6 | 3001 | journal_file_print_header(f); |
7560fffc | 3002 | |
0284adc6 LP |
3003 | p = le64toh(f->header->header_size); |
3004 | while (p != 0) { | |
d05089d8 | 3005 | r = journal_file_move_to_object(f, OBJECT_UNUSED, p, &o); |
0284adc6 LP |
3006 | if (r < 0) |
3007 | goto fail; | |
7560fffc | 3008 | |
0284adc6 | 3009 | switch (o->object.type) { |
d98cc1f2 | 3010 | |
0284adc6 LP |
3011 | case OBJECT_UNUSED: |
3012 | printf("Type: OBJECT_UNUSED\n"); | |
3013 | break; | |
d98cc1f2 | 3014 | |
0284adc6 LP |
3015 | case OBJECT_DATA: |
3016 | printf("Type: OBJECT_DATA\n"); | |
3017 | break; | |
7560fffc | 3018 | |
3c1668da LP |
3019 | case OBJECT_FIELD: |
3020 | printf("Type: OBJECT_FIELD\n"); | |
3021 | break; | |
3022 | ||
0284adc6 | 3023 | case OBJECT_ENTRY: |
507f22bd ZJS |
3024 | printf("Type: OBJECT_ENTRY seqnum=%"PRIu64" monotonic=%"PRIu64" realtime=%"PRIu64"\n", |
3025 | le64toh(o->entry.seqnum), | |
3026 | le64toh(o->entry.monotonic), | |
3027 | le64toh(o->entry.realtime)); | |
0284adc6 | 3028 | break; |
7560fffc | 3029 | |
0284adc6 LP |
3030 | case OBJECT_FIELD_HASH_TABLE: |
3031 | printf("Type: OBJECT_FIELD_HASH_TABLE\n"); | |
3032 | break; | |
7560fffc | 3033 | |
0284adc6 LP |
3034 | case OBJECT_DATA_HASH_TABLE: |
3035 | printf("Type: OBJECT_DATA_HASH_TABLE\n"); | |
3036 | break; | |
7560fffc | 3037 | |
0284adc6 LP |
3038 | case OBJECT_ENTRY_ARRAY: |
3039 | printf("Type: OBJECT_ENTRY_ARRAY\n"); | |
3040 | break; | |
7560fffc | 3041 | |
0284adc6 | 3042 | case OBJECT_TAG: |
507f22bd ZJS |
3043 | printf("Type: OBJECT_TAG seqnum=%"PRIu64" epoch=%"PRIu64"\n", |
3044 | le64toh(o->tag.seqnum), | |
3045 | le64toh(o->tag.epoch)); | |
0284adc6 | 3046 | break; |
3c1668da LP |
3047 | |
3048 | default: | |
8facc349 | 3049 | printf("Type: unknown (%i)\n", o->object.type); |
3c1668da | 3050 | break; |
0284adc6 | 3051 | } |
7560fffc | 3052 | |
d89c8fdf ZJS |
3053 | if (o->object.flags & OBJECT_COMPRESSION_MASK) |
3054 | printf("Flags: %s\n", | |
3055 | object_compressed_to_string(o->object.flags & OBJECT_COMPRESSION_MASK)); | |
7560fffc | 3056 | |
0284adc6 LP |
3057 | if (p == le64toh(f->header->tail_object_offset)) |
3058 | p = 0; | |
3059 | else | |
3060 | p = p + ALIGN64(le64toh(o->object.size)); | |
3061 | } | |
7560fffc | 3062 | |
0284adc6 LP |
3063 | return; |
3064 | fail: | |
3065 | log_error("File corrupt"); | |
7560fffc LP |
3066 | } |
3067 | ||
718fe4b1 ZJS |
3068 | static const char* format_timestamp_safe(char *buf, size_t l, usec_t t) { |
3069 | const char *x; | |
3070 | ||
3071 | x = format_timestamp(buf, l, t); | |
3072 | if (x) | |
3073 | return x; | |
3074 | return " --- "; | |
3075 | } | |
3076 | ||
0284adc6 | 3077 | void journal_file_print_header(JournalFile *f) { |
2765b7bb | 3078 | char a[33], b[33], c[33], d[33]; |
ed375beb | 3079 | char x[FORMAT_TIMESTAMP_MAX], y[FORMAT_TIMESTAMP_MAX], z[FORMAT_TIMESTAMP_MAX]; |
a1a03e30 LP |
3080 | struct stat st; |
3081 | char bytes[FORMAT_BYTES_MAX]; | |
7560fffc LP |
3082 | |
3083 | assert(f); | |
c88cc6af | 3084 | assert(f->header); |
7560fffc | 3085 | |
0284adc6 LP |
3086 | printf("File Path: %s\n" |
3087 | "File ID: %s\n" | |
3088 | "Machine ID: %s\n" | |
3089 | "Boot ID: %s\n" | |
3090 | "Sequential Number ID: %s\n" | |
3091 | "State: %s\n" | |
3092 | "Compatible Flags:%s%s\n" | |
d89c8fdf | 3093 | "Incompatible Flags:%s%s%s\n" |
507f22bd ZJS |
3094 | "Header size: %"PRIu64"\n" |
3095 | "Arena size: %"PRIu64"\n" | |
3096 | "Data Hash Table Size: %"PRIu64"\n" | |
3097 | "Field Hash Table Size: %"PRIu64"\n" | |
0284adc6 | 3098 | "Rotate Suggested: %s\n" |
0808b92f LP |
3099 | "Head Sequential Number: %"PRIu64" (%"PRIx64")\n" |
3100 | "Tail Sequential Number: %"PRIu64" (%"PRIx64")\n" | |
3101 | "Head Realtime Timestamp: %s (%"PRIx64")\n" | |
3102 | "Tail Realtime Timestamp: %s (%"PRIx64")\n" | |
3103 | "Tail Monotonic Timestamp: %s (%"PRIx64")\n" | |
507f22bd ZJS |
3104 | "Objects: %"PRIu64"\n" |
3105 | "Entry Objects: %"PRIu64"\n", | |
0284adc6 LP |
3106 | f->path, |
3107 | sd_id128_to_string(f->header->file_id, a), | |
3108 | sd_id128_to_string(f->header->machine_id, b), | |
3109 | sd_id128_to_string(f->header->boot_id, c), | |
2765b7bb | 3110 | sd_id128_to_string(f->header->seqnum_id, d), |
3223f44f LP |
3111 | f->header->state == STATE_OFFLINE ? "OFFLINE" : |
3112 | f->header->state == STATE_ONLINE ? "ONLINE" : | |
3113 | f->header->state == STATE_ARCHIVED ? "ARCHIVED" : "UNKNOWN", | |
8088cbd3 | 3114 | JOURNAL_HEADER_SEALED(f->header) ? " SEALED" : "", |
d89c8fdf ZJS |
3115 | (le32toh(f->header->compatible_flags) & ~HEADER_COMPATIBLE_ANY) ? " ???" : "", |
3116 | JOURNAL_HEADER_COMPRESSED_XZ(f->header) ? " COMPRESSED-XZ" : "", | |
3117 | JOURNAL_HEADER_COMPRESSED_LZ4(f->header) ? " COMPRESSED-LZ4" : "", | |
3118 | (le32toh(f->header->incompatible_flags) & ~HEADER_INCOMPATIBLE_ANY) ? " ???" : "", | |
507f22bd ZJS |
3119 | le64toh(f->header->header_size), |
3120 | le64toh(f->header->arena_size), | |
3121 | le64toh(f->header->data_hash_table_size) / sizeof(HashItem), | |
3122 | le64toh(f->header->field_hash_table_size) / sizeof(HashItem), | |
fb0951b0 | 3123 | yes_no(journal_file_rotate_suggested(f, 0)), |
0808b92f LP |
3124 | le64toh(f->header->head_entry_seqnum), le64toh(f->header->head_entry_seqnum), |
3125 | le64toh(f->header->tail_entry_seqnum), le64toh(f->header->tail_entry_seqnum), | |
3126 | format_timestamp_safe(x, sizeof(x), le64toh(f->header->head_entry_realtime)), le64toh(f->header->head_entry_realtime), | |
3127 | format_timestamp_safe(y, sizeof(y), le64toh(f->header->tail_entry_realtime)), le64toh(f->header->tail_entry_realtime), | |
3128 | format_timespan(z, sizeof(z), le64toh(f->header->tail_entry_monotonic), USEC_PER_MSEC), le64toh(f->header->tail_entry_monotonic), | |
507f22bd ZJS |
3129 | le64toh(f->header->n_objects), |
3130 | le64toh(f->header->n_entries)); | |
7560fffc | 3131 | |
0284adc6 | 3132 | if (JOURNAL_HEADER_CONTAINS(f->header, n_data)) |
507f22bd | 3133 | printf("Data Objects: %"PRIu64"\n" |
0284adc6 | 3134 | "Data Hash Table Fill: %.1f%%\n", |
507f22bd | 3135 | le64toh(f->header->n_data), |
0284adc6 | 3136 | 100.0 * (double) le64toh(f->header->n_data) / ((double) (le64toh(f->header->data_hash_table_size) / sizeof(HashItem)))); |
7560fffc | 3137 | |
0284adc6 | 3138 | if (JOURNAL_HEADER_CONTAINS(f->header, n_fields)) |
507f22bd | 3139 | printf("Field Objects: %"PRIu64"\n" |
0284adc6 | 3140 | "Field Hash Table Fill: %.1f%%\n", |
507f22bd | 3141 | le64toh(f->header->n_fields), |
0284adc6 | 3142 | 100.0 * (double) le64toh(f->header->n_fields) / ((double) (le64toh(f->header->field_hash_table_size) / sizeof(HashItem)))); |
3223f44f LP |
3143 | |
3144 | if (JOURNAL_HEADER_CONTAINS(f->header, n_tags)) | |
507f22bd ZJS |
3145 | printf("Tag Objects: %"PRIu64"\n", |
3146 | le64toh(f->header->n_tags)); | |
3223f44f | 3147 | if (JOURNAL_HEADER_CONTAINS(f->header, n_entry_arrays)) |
507f22bd ZJS |
3148 | printf("Entry Array Objects: %"PRIu64"\n", |
3149 | le64toh(f->header->n_entry_arrays)); | |
a1a03e30 LP |
3150 | |
3151 | if (fstat(f->fd, &st) >= 0) | |
59f448cf | 3152 | printf("Disk usage: %s\n", format_bytes(bytes, sizeof(bytes), (uint64_t) st.st_blocks * 512ULL)); |
7560fffc LP |
3153 | } |
3154 | ||
fc68c929 LP |
3155 | static int journal_file_warn_btrfs(JournalFile *f) { |
3156 | unsigned attrs; | |
3157 | int r; | |
3158 | ||
3159 | assert(f); | |
3160 | ||
3161 | /* Before we write anything, check if the COW logic is turned | |
3162 | * off on btrfs. Given our write pattern that is quite | |
3163 | * unfriendly to COW file systems this should greatly improve | |
3164 | * performance on COW file systems, such as btrfs, at the | |
3165 | * expense of data integrity features (which shouldn't be too | |
3166 | * bad, given that we do our own checksumming). */ | |
3167 | ||
3168 | r = btrfs_is_filesystem(f->fd); | |
3169 | if (r < 0) | |
3170 | return log_warning_errno(r, "Failed to determine if journal is on btrfs: %m"); | |
3171 | if (!r) | |
3172 | return 0; | |
3173 | ||
3174 | r = read_attr_fd(f->fd, &attrs); | |
3175 | if (r < 0) | |
3176 | return log_warning_errno(r, "Failed to read file attributes: %m"); | |
3177 | ||
3178 | if (attrs & FS_NOCOW_FL) { | |
3179 | log_debug("Detected btrfs file system with copy-on-write disabled, all is good."); | |
3180 | return 0; | |
3181 | } | |
3182 | ||
3183 | log_notice("Creating journal file %s on a btrfs file system, and copy-on-write is enabled. " | |
3184 | "This is likely to slow down journal access substantially, please consider turning " | |
3185 | "off the copy-on-write file attribute on the journal directory, using chattr +C.", f->path); | |
3186 | ||
3187 | return 1; | |
3188 | } | |
3189 | ||
0284adc6 | 3190 | int journal_file_open( |
5d1ce257 | 3191 | int fd, |
0284adc6 LP |
3192 | const char *fname, |
3193 | int flags, | |
3194 | mode_t mode, | |
3195 | bool compress, | |
57850536 | 3196 | uint64_t compress_threshold_bytes, |
baed47c3 | 3197 | bool seal, |
0284adc6 LP |
3198 | JournalMetrics *metrics, |
3199 | MMapCache *mmap_cache, | |
b58c888f | 3200 | Set *deferred_closes, |
0284adc6 LP |
3201 | JournalFile *template, |
3202 | JournalFile **ret) { | |
7560fffc | 3203 | |
fa6ac760 | 3204 | bool newly_created = false; |
0284adc6 | 3205 | JournalFile *f; |
fa6ac760 | 3206 | void *h; |
0284adc6 | 3207 | int r; |
57850536 | 3208 | char bytes[FORMAT_BYTES_MAX]; |
7560fffc | 3209 | |
0559d3a5 | 3210 | assert(ret); |
5d1ce257 | 3211 | assert(fd >= 0 || fname); |
7560fffc | 3212 | |
ec2ce0c5 | 3213 | if (!IN_SET((flags & O_ACCMODE), O_RDONLY, O_RDWR)) |
0284adc6 | 3214 | return -EINVAL; |
7560fffc | 3215 | |
6eda13d3 LP |
3216 | if (fname && (flags & O_CREAT) && !endswith(fname, ".journal")) |
3217 | return -EINVAL; | |
7560fffc | 3218 | |
0284adc6 LP |
3219 | f = new0(JournalFile, 1); |
3220 | if (!f) | |
3221 | return -ENOMEM; | |
7560fffc | 3222 | |
5d1ce257 | 3223 | f->fd = fd; |
0284adc6 | 3224 | f->mode = mode; |
7560fffc | 3225 | |
0284adc6 LP |
3226 | f->flags = flags; |
3227 | f->prot = prot_from_flags(flags); | |
3228 | f->writable = (flags & O_ACCMODE) != O_RDONLY; | |
349cc4a5 | 3229 | #if HAVE_LZ4 |
d89c8fdf | 3230 | f->compress_lz4 = compress; |
349cc4a5 | 3231 | #elif HAVE_XZ |
d89c8fdf | 3232 | f->compress_xz = compress; |
48b61739 | 3233 | #endif |
57850536 AG |
3234 | |
3235 | if (compress_threshold_bytes == (uint64_t) -1) | |
3236 | f->compress_threshold_bytes = DEFAULT_COMPRESS_THRESHOLD; | |
3237 | else | |
3238 | f->compress_threshold_bytes = MAX(MIN_COMPRESS_THRESHOLD, compress_threshold_bytes); | |
3239 | ||
349cc4a5 | 3240 | #if HAVE_GCRYPT |
baed47c3 | 3241 | f->seal = seal; |
49a32d43 | 3242 | #endif |
7560fffc | 3243 | |
57850536 AG |
3244 | log_debug("Journal effective settings seal=%s compress=%s compress_threshold_bytes=%s", |
3245 | yes_no(f->seal), yes_no(JOURNAL_FILE_COMPRESS(f)), | |
3246 | format_bytes(bytes, sizeof(bytes), f->compress_threshold_bytes)); | |
3247 | ||
0284adc6 LP |
3248 | if (mmap_cache) |
3249 | f->mmap = mmap_cache_ref(mmap_cache); | |
3250 | else { | |
84168d80 | 3251 | f->mmap = mmap_cache_new(); |
0284adc6 LP |
3252 | if (!f->mmap) { |
3253 | r = -ENOMEM; | |
3254 | goto fail; | |
3255 | } | |
3256 | } | |
7560fffc | 3257 | |
7645c77b | 3258 | if (fname) { |
5d1ce257 | 3259 | f->path = strdup(fname); |
7645c77b ZJS |
3260 | if (!f->path) { |
3261 | r = -ENOMEM; | |
3262 | goto fail; | |
3263 | } | |
3264 | } else { | |
817b1c5b LP |
3265 | assert(fd >= 0); |
3266 | ||
7645c77b ZJS |
3267 | /* If we don't know the path, fill in something explanatory and vaguely useful */ |
3268 | if (asprintf(&f->path, "/proc/self/%i", fd) < 0) { | |
3269 | r = -ENOMEM; | |
3270 | goto fail; | |
3271 | } | |
0284adc6 | 3272 | } |
7560fffc | 3273 | |
4743015d | 3274 | f->chain_cache = ordered_hashmap_new(&uint64_hash_ops); |
a4bcff5b LP |
3275 | if (!f->chain_cache) { |
3276 | r = -ENOMEM; | |
3277 | goto fail; | |
3278 | } | |
3279 | ||
0284adc6 | 3280 | if (f->fd < 0) { |
817b1c5b LP |
3281 | /* We pass O_NONBLOCK here, so that in case somebody pointed us to some character device node or FIFO |
3282 | * or so, we likely fail quickly than block for long. For regular files O_NONBLOCK has no effect, hence | |
3283 | * it doesn't hurt in that case. */ | |
3284 | ||
3285 | f->fd = open(f->path, f->flags|O_CLOEXEC|O_NONBLOCK, f->mode); | |
5d1ce257 LP |
3286 | if (f->fd < 0) { |
3287 | r = -errno; | |
3288 | goto fail; | |
3289 | } | |
3290 | ||
3291 | /* fds we opened here by us should also be closed by us. */ | |
3292 | f->close_fd = true; | |
817b1c5b LP |
3293 | |
3294 | r = fd_nonblock(f->fd, false); | |
3295 | if (r < 0) | |
3296 | goto fail; | |
7560fffc | 3297 | } |
7560fffc | 3298 | |
be7cdd8e VC |
3299 | f->cache_fd = mmap_cache_add_fd(f->mmap, f->fd); |
3300 | if (!f->cache_fd) { | |
3301 | r = -ENOMEM; | |
3302 | goto fail; | |
3303 | } | |
3304 | ||
2678031a LP |
3305 | r = journal_file_fstat(f); |
3306 | if (r < 0) | |
0284adc6 | 3307 | goto fail; |
7560fffc | 3308 | |
0284adc6 | 3309 | if (f->last_stat.st_size == 0 && f->writable) { |
11689d2a | 3310 | |
fc68c929 | 3311 | (void) journal_file_warn_btrfs(f); |
11689d2a | 3312 | |
4c2e1b39 LP |
3313 | /* Let's attach the creation time to the journal file, so that the vacuuming code knows the age of this |
3314 | * file even if the file might end up corrupted one day... Ideally we'd just use the creation time many | |
3315 | * file systems maintain for each file, but the API to query this is very new, hence let's emulate this | |
3316 | * via extended attributes. If extended attributes are not supported we'll just skip this, and rely | |
3317 | * solely on mtime/atime/ctime of the file. */ | |
3318 | (void) fd_setcrtime(f->fd, 0); | |
7560fffc | 3319 | |
349cc4a5 | 3320 | #if HAVE_GCRYPT |
0284adc6 | 3321 | /* Try to load the FSPRG state, and if we can't, then |
baed47c3 | 3322 | * just don't do sealing */ |
49a32d43 LP |
3323 | if (f->seal) { |
3324 | r = journal_file_fss_load(f); | |
3325 | if (r < 0) | |
3326 | f->seal = false; | |
3327 | } | |
feb12d3e | 3328 | #endif |
7560fffc | 3329 | |
0284adc6 LP |
3330 | r = journal_file_init_header(f, template); |
3331 | if (r < 0) | |
3332 | goto fail; | |
7560fffc | 3333 | |
2678031a LP |
3334 | r = journal_file_fstat(f); |
3335 | if (r < 0) | |
0284adc6 | 3336 | goto fail; |
fb0951b0 LP |
3337 | |
3338 | newly_created = true; | |
0284adc6 | 3339 | } |
7560fffc | 3340 | |
0284adc6 | 3341 | if (f->last_stat.st_size < (off_t) HEADER_SIZE_MIN) { |
cfb571f3 | 3342 | r = -ENODATA; |
0284adc6 LP |
3343 | goto fail; |
3344 | } | |
7560fffc | 3345 | |
b42549ad | 3346 | r = mmap_cache_get(f->mmap, f->cache_fd, f->prot, CONTEXT_HEADER, true, 0, PAGE_ALIGN(sizeof(Header)), &f->last_stat, &h, NULL); |
977eaa1e | 3347 | if (r < 0) |
0284adc6 | 3348 | goto fail; |
7560fffc | 3349 | |
fa6ac760 LP |
3350 | f->header = h; |
3351 | ||
0284adc6 | 3352 | if (!newly_created) { |
f9168190 | 3353 | set_clear_with_destructor(deferred_closes, journal_file_close); |
b58c888f | 3354 | |
0284adc6 LP |
3355 | r = journal_file_verify_header(f); |
3356 | if (r < 0) | |
3357 | goto fail; | |
3358 | } | |
7560fffc | 3359 | |
349cc4a5 | 3360 | #if HAVE_GCRYPT |
0284adc6 | 3361 | if (!newly_created && f->writable) { |
baed47c3 | 3362 | r = journal_file_fss_load(f); |
0284adc6 LP |
3363 | if (r < 0) |
3364 | goto fail; | |
3365 | } | |
feb12d3e | 3366 | #endif |
cec736d2 LP |
3367 | |
3368 | if (f->writable) { | |
4a92baf3 LP |
3369 | if (metrics) { |
3370 | journal_default_metrics(metrics, f->fd); | |
3371 | f->metrics = *metrics; | |
3372 | } else if (template) | |
3373 | f->metrics = template->metrics; | |
3374 | ||
cec736d2 LP |
3375 | r = journal_file_refresh_header(f); |
3376 | if (r < 0) | |
3377 | goto fail; | |
3378 | } | |
3379 | ||
349cc4a5 | 3380 | #if HAVE_GCRYPT |
baed47c3 | 3381 | r = journal_file_hmac_setup(f); |
14d10188 LP |
3382 | if (r < 0) |
3383 | goto fail; | |
feb12d3e | 3384 | #endif |
14d10188 | 3385 | |
cec736d2 | 3386 | if (newly_created) { |
de190aef | 3387 | r = journal_file_setup_field_hash_table(f); |
cec736d2 LP |
3388 | if (r < 0) |
3389 | goto fail; | |
3390 | ||
de190aef | 3391 | r = journal_file_setup_data_hash_table(f); |
cec736d2 LP |
3392 | if (r < 0) |
3393 | goto fail; | |
7560fffc | 3394 | |
349cc4a5 | 3395 | #if HAVE_GCRYPT |
7560fffc LP |
3396 | r = journal_file_append_first_tag(f); |
3397 | if (r < 0) | |
3398 | goto fail; | |
feb12d3e | 3399 | #endif |
cec736d2 LP |
3400 | } |
3401 | ||
be7cdd8e | 3402 | if (mmap_cache_got_sigbus(f->mmap, f->cache_fd)) { |
fa6ac760 LP |
3403 | r = -EIO; |
3404 | goto fail; | |
3405 | } | |
3406 | ||
7a24f3bf | 3407 | if (template && template->post_change_timer) { |
e167d7fd LP |
3408 | r = journal_file_enable_post_change_timer( |
3409 | f, | |
3410 | sd_event_source_get_event(template->post_change_timer), | |
3411 | template->post_change_timer_period); | |
7a24f3bf | 3412 | |
7a24f3bf VC |
3413 | if (r < 0) |
3414 | goto fail; | |
3415 | } | |
3416 | ||
f8e2f4d6 | 3417 | /* The file is opened now successfully, thus we take possession of any passed in fd. */ |
5d1ce257 LP |
3418 | f->close_fd = true; |
3419 | ||
0559d3a5 | 3420 | *ret = f; |
cec736d2 LP |
3421 | return 0; |
3422 | ||
3423 | fail: | |
be7cdd8e | 3424 | if (f->cache_fd && mmap_cache_got_sigbus(f->mmap, f->cache_fd)) |
fa6ac760 LP |
3425 | r = -EIO; |
3426 | ||
69a3a6fd | 3427 | (void) journal_file_close(f); |
cec736d2 LP |
3428 | |
3429 | return r; | |
3430 | } | |
0ac38b70 | 3431 | |
57850536 | 3432 | int journal_file_rotate(JournalFile **f, bool compress, uint64_t compress_threshold_bytes, bool seal, Set *deferred_closes) { |
57535f47 | 3433 | _cleanup_free_ char *p = NULL; |
0ac38b70 LP |
3434 | size_t l; |
3435 | JournalFile *old_file, *new_file = NULL; | |
3436 | int r; | |
3437 | ||
3438 | assert(f); | |
3439 | assert(*f); | |
3440 | ||
3441 | old_file = *f; | |
3442 | ||
3443 | if (!old_file->writable) | |
3444 | return -EINVAL; | |
3445 | ||
5d1ce257 | 3446 | /* Is this a journal file that was passed to us as fd? If so, we synthesized a path name for it, and we refuse |
13e785f7 | 3447 | * rotation, since we don't know the actual path, and couldn't rename the file hence. */ |
5d1ce257 LP |
3448 | if (path_startswith(old_file->path, "/proc/self/fd")) |
3449 | return -EINVAL; | |
3450 | ||
0ac38b70 LP |
3451 | if (!endswith(old_file->path, ".journal")) |
3452 | return -EINVAL; | |
3453 | ||
3454 | l = strlen(old_file->path); | |
57535f47 ZJS |
3455 | r = asprintf(&p, "%.*s@" SD_ID128_FORMAT_STR "-%016"PRIx64"-%016"PRIx64".journal", |
3456 | (int) l - 8, old_file->path, | |
3457 | SD_ID128_FORMAT_VAL(old_file->header->seqnum_id), | |
3458 | le64toh((*f)->header->head_entry_seqnum), | |
3459 | le64toh((*f)->header->head_entry_realtime)); | |
3460 | if (r < 0) | |
0ac38b70 LP |
3461 | return -ENOMEM; |
3462 | ||
2678031a LP |
3463 | /* Try to rename the file to the archived version. If the file |
3464 | * already was deleted, we'll get ENOENT, let's ignore that | |
3465 | * case. */ | |
0ac38b70 | 3466 | r = rename(old_file->path, p); |
2678031a | 3467 | if (r < 0 && errno != ENOENT) |
0ac38b70 LP |
3468 | return -errno; |
3469 | ||
1fcefd88 LP |
3470 | /* Sync the rename to disk */ |
3471 | (void) fsync_directory_of_file(old_file->fd); | |
3472 | ||
8eb85171 VC |
3473 | /* Set as archive so offlining commits w/state=STATE_ARCHIVED. |
3474 | * Previously we would set old_file->header->state to STATE_ARCHIVED directly here, | |
3475 | * but journal_file_set_offline() short-circuits when state != STATE_ONLINE, which | |
3476 | * would result in the rotated journal never getting fsync() called before closing. | |
3477 | * Now we simply queue the archive state by setting an archive bit, leaving the state | |
3478 | * as STATE_ONLINE so proper offlining occurs. */ | |
3479 | old_file->archive = true; | |
0ac38b70 | 3480 | |
f27a3864 LP |
3481 | /* Currently, btrfs is not very good with out write patterns |
3482 | * and fragments heavily. Let's defrag our journal files when | |
3483 | * we archive them */ | |
3484 | old_file->defrag_on_close = true; | |
3485 | ||
57850536 AG |
3486 | r = journal_file_open(-1, old_file->path, old_file->flags, old_file->mode, compress, |
3487 | compress_threshold_bytes, seal, NULL, old_file->mmap, deferred_closes, | |
3488 | old_file, &new_file); | |
b58c888f VC |
3489 | |
3490 | if (deferred_closes && | |
3491 | set_put(deferred_closes, old_file) >= 0) | |
3492 | (void) journal_file_set_offline(old_file, false); | |
3493 | else | |
3494 | (void) journal_file_close(old_file); | |
0ac38b70 LP |
3495 | |
3496 | *f = new_file; | |
3497 | return r; | |
3498 | } | |
3499 | ||
9447a7f1 LP |
3500 | int journal_file_open_reliably( |
3501 | const char *fname, | |
3502 | int flags, | |
3503 | mode_t mode, | |
7560fffc | 3504 | bool compress, |
57850536 | 3505 | uint64_t compress_threshold_bytes, |
baed47c3 | 3506 | bool seal, |
4a92baf3 | 3507 | JournalMetrics *metrics, |
27370278 | 3508 | MMapCache *mmap_cache, |
b58c888f | 3509 | Set *deferred_closes, |
9447a7f1 LP |
3510 | JournalFile *template, |
3511 | JournalFile **ret) { | |
3512 | ||
3513 | int r; | |
3514 | size_t l; | |
ed375beb | 3515 | _cleanup_free_ char *p = NULL; |
9447a7f1 | 3516 | |
57850536 AG |
3517 | r = journal_file_open(-1, fname, flags, mode, compress, compress_threshold_bytes, seal, metrics, mmap_cache, |
3518 | deferred_closes, template, ret); | |
288359db | 3519 | if (!IN_SET(r, |
b288cdeb ZJS |
3520 | -EBADMSG, /* Corrupted */ |
3521 | -ENODATA, /* Truncated */ | |
3522 | -EHOSTDOWN, /* Other machine */ | |
3523 | -EPROTONOSUPPORT, /* Incompatible feature */ | |
3524 | -EBUSY, /* Unclean shutdown */ | |
3525 | -ESHUTDOWN, /* Already archived */ | |
288359db | 3526 | -EIO, /* IO error, including SIGBUS on mmap */ |
ae739cc1 LP |
3527 | -EIDRM, /* File has been deleted */ |
3528 | -ETXTBSY)) /* File is from the future */ | |
9447a7f1 LP |
3529 | return r; |
3530 | ||
3531 | if ((flags & O_ACCMODE) == O_RDONLY) | |
3532 | return r; | |
3533 | ||
3534 | if (!(flags & O_CREAT)) | |
3535 | return r; | |
3536 | ||
7560fffc LP |
3537 | if (!endswith(fname, ".journal")) |
3538 | return r; | |
3539 | ||
5c70eab4 LP |
3540 | /* The file is corrupted. Rotate it away and try it again (but only once) */ |
3541 | ||
9447a7f1 | 3542 | l = strlen(fname); |
d587eca5 | 3543 | if (asprintf(&p, "%.*s@%016"PRIx64 "-%016"PRIx64 ".journal~", |
57535f47 | 3544 | (int) l - 8, fname, |
d587eca5 | 3545 | now(CLOCK_REALTIME), |
9bf3b535 | 3546 | random_u64()) < 0) |
9447a7f1 LP |
3547 | return -ENOMEM; |
3548 | ||
65089b82 | 3549 | if (rename(fname, p) < 0) |
9447a7f1 LP |
3550 | return -errno; |
3551 | ||
f27a3864 LP |
3552 | /* btrfs doesn't cope well with our write pattern and |
3553 | * fragments heavily. Let's defrag all files we rotate */ | |
11689d2a | 3554 | |
a67d68b8 | 3555 | (void) chattr_path(p, 0, FS_NOCOW_FL); |
f27a3864 LP |
3556 | (void) btrfs_defrag(p); |
3557 | ||
65089b82 | 3558 | log_warning_errno(r, "File %s corrupted or uncleanly shut down, renaming and replacing.", fname); |
9447a7f1 | 3559 | |
57850536 AG |
3560 | return journal_file_open(-1, fname, flags, mode, compress, compress_threshold_bytes, seal, metrics, mmap_cache, |
3561 | deferred_closes, template, ret); | |
9447a7f1 LP |
3562 | } |
3563 | ||
cf244689 LP |
3564 | int journal_file_copy_entry(JournalFile *from, JournalFile *to, Object *o, uint64_t p, uint64_t *seqnum, Object **ret, uint64_t *offset) { |
3565 | uint64_t i, n; | |
3566 | uint64_t q, xor_hash = 0; | |
3567 | int r; | |
3568 | EntryItem *items; | |
3569 | dual_timestamp ts; | |
3570 | ||
3571 | assert(from); | |
3572 | assert(to); | |
3573 | assert(o); | |
3574 | assert(p); | |
3575 | ||
3576 | if (!to->writable) | |
3577 | return -EPERM; | |
3578 | ||
3579 | ts.monotonic = le64toh(o->entry.monotonic); | |
3580 | ts.realtime = le64toh(o->entry.realtime); | |
3581 | ||
cf244689 | 3582 | n = journal_file_entry_n_items(o); |
4faa7004 | 3583 | /* alloca() can't take 0, hence let's allocate at least one */ |
cf409d15 | 3584 | items = newa(EntryItem, MAX(1u, n)); |
cf244689 LP |
3585 | |
3586 | for (i = 0; i < n; i++) { | |
4fd052ae FC |
3587 | uint64_t l, h; |
3588 | le64_t le_hash; | |
cf244689 LP |
3589 | size_t t; |
3590 | void *data; | |
3591 | Object *u; | |
3592 | ||
3593 | q = le64toh(o->entry.items[i].object_offset); | |
3594 | le_hash = o->entry.items[i].hash; | |
3595 | ||
3596 | r = journal_file_move_to_object(from, OBJECT_DATA, q, &o); | |
3597 | if (r < 0) | |
3598 | return r; | |
3599 | ||
3600 | if (le_hash != o->data.hash) | |
3601 | return -EBADMSG; | |
3602 | ||
3603 | l = le64toh(o->object.size) - offsetof(Object, data.payload); | |
3604 | t = (size_t) l; | |
3605 | ||
3606 | /* We hit the limit on 32bit machines */ | |
3607 | if ((uint64_t) t != l) | |
3608 | return -E2BIG; | |
3609 | ||
d89c8fdf | 3610 | if (o->object.flags & OBJECT_COMPRESSION_MASK) { |
349cc4a5 | 3611 | #if HAVE_XZ || HAVE_LZ4 |
a7f7d1bd | 3612 | size_t rsize = 0; |
cf244689 | 3613 | |
d89c8fdf ZJS |
3614 | r = decompress_blob(o->object.flags & OBJECT_COMPRESSION_MASK, |
3615 | o->data.payload, l, &from->compress_buffer, &from->compress_buffer_size, &rsize, 0); | |
3616 | if (r < 0) | |
3617 | return r; | |
cf244689 LP |
3618 | |
3619 | data = from->compress_buffer; | |
3620 | l = rsize; | |
3b1a55e1 ZJS |
3621 | #else |
3622 | return -EPROTONOSUPPORT; | |
3623 | #endif | |
cf244689 LP |
3624 | } else |
3625 | data = o->data.payload; | |
3626 | ||
3627 | r = journal_file_append_data(to, data, l, &u, &h); | |
3628 | if (r < 0) | |
3629 | return r; | |
3630 | ||
3631 | xor_hash ^= le64toh(u->data.hash); | |
3632 | items[i].object_offset = htole64(h); | |
3633 | items[i].hash = u->data.hash; | |
3634 | ||
3635 | r = journal_file_move_to_object(from, OBJECT_ENTRY, p, &o); | |
3636 | if (r < 0) | |
3637 | return r; | |
3638 | } | |
3639 | ||
fa6ac760 LP |
3640 | r = journal_file_append_entry_internal(to, &ts, xor_hash, items, n, seqnum, ret, offset); |
3641 | ||
be7cdd8e | 3642 | if (mmap_cache_got_sigbus(to->mmap, to->cache_fd)) |
fa6ac760 LP |
3643 | return -EIO; |
3644 | ||
3645 | return r; | |
cf244689 | 3646 | } |
babfc091 | 3647 | |
8580d1f7 LP |
3648 | void journal_reset_metrics(JournalMetrics *m) { |
3649 | assert(m); | |
3650 | ||
3651 | /* Set everything to "pick automatic values". */ | |
3652 | ||
3653 | *m = (JournalMetrics) { | |
3654 | .min_use = (uint64_t) -1, | |
3655 | .max_use = (uint64_t) -1, | |
3656 | .min_size = (uint64_t) -1, | |
3657 | .max_size = (uint64_t) -1, | |
3658 | .keep_free = (uint64_t) -1, | |
3659 | .n_max_files = (uint64_t) -1, | |
3660 | }; | |
3661 | } | |
3662 | ||
babfc091 | 3663 | void journal_default_metrics(JournalMetrics *m, int fd) { |
8580d1f7 | 3664 | char a[FORMAT_BYTES_MAX], b[FORMAT_BYTES_MAX], c[FORMAT_BYTES_MAX], d[FORMAT_BYTES_MAX], e[FORMAT_BYTES_MAX]; |
babfc091 | 3665 | struct statvfs ss; |
8580d1f7 | 3666 | uint64_t fs_size; |
babfc091 LP |
3667 | |
3668 | assert(m); | |
3669 | assert(fd >= 0); | |
3670 | ||
3671 | if (fstatvfs(fd, &ss) >= 0) | |
3672 | fs_size = ss.f_frsize * ss.f_blocks; | |
8580d1f7 | 3673 | else { |
8fc58f1a | 3674 | log_debug_errno(errno, "Failed to determine disk size: %m"); |
8580d1f7 LP |
3675 | fs_size = 0; |
3676 | } | |
babfc091 LP |
3677 | |
3678 | if (m->max_use == (uint64_t) -1) { | |
3679 | ||
3680 | if (fs_size > 0) { | |
3681 | m->max_use = PAGE_ALIGN(fs_size / 10); /* 10% of file system size */ | |
3682 | ||
3683 | if (m->max_use > DEFAULT_MAX_USE_UPPER) | |
3684 | m->max_use = DEFAULT_MAX_USE_UPPER; | |
3685 | ||
3686 | if (m->max_use < DEFAULT_MAX_USE_LOWER) | |
3687 | m->max_use = DEFAULT_MAX_USE_LOWER; | |
3688 | } else | |
3689 | m->max_use = DEFAULT_MAX_USE_LOWER; | |
3690 | } else { | |
3691 | m->max_use = PAGE_ALIGN(m->max_use); | |
3692 | ||
8580d1f7 | 3693 | if (m->max_use != 0 && m->max_use < JOURNAL_FILE_SIZE_MIN*2) |
babfc091 LP |
3694 | m->max_use = JOURNAL_FILE_SIZE_MIN*2; |
3695 | } | |
3696 | ||
8580d1f7 LP |
3697 | if (m->min_use == (uint64_t) -1) |
3698 | m->min_use = DEFAULT_MIN_USE; | |
3699 | ||
3700 | if (m->min_use > m->max_use) | |
3701 | m->min_use = m->max_use; | |
3702 | ||
babfc091 LP |
3703 | if (m->max_size == (uint64_t) -1) { |
3704 | m->max_size = PAGE_ALIGN(m->max_use / 8); /* 8 chunks */ | |
3705 | ||
3706 | if (m->max_size > DEFAULT_MAX_SIZE_UPPER) | |
3707 | m->max_size = DEFAULT_MAX_SIZE_UPPER; | |
3708 | } else | |
3709 | m->max_size = PAGE_ALIGN(m->max_size); | |
3710 | ||
8580d1f7 LP |
3711 | if (m->max_size != 0) { |
3712 | if (m->max_size < JOURNAL_FILE_SIZE_MIN) | |
3713 | m->max_size = JOURNAL_FILE_SIZE_MIN; | |
babfc091 | 3714 | |
8580d1f7 LP |
3715 | if (m->max_use != 0 && m->max_size*2 > m->max_use) |
3716 | m->max_use = m->max_size*2; | |
3717 | } | |
babfc091 LP |
3718 | |
3719 | if (m->min_size == (uint64_t) -1) | |
3720 | m->min_size = JOURNAL_FILE_SIZE_MIN; | |
3721 | else { | |
3722 | m->min_size = PAGE_ALIGN(m->min_size); | |
3723 | ||
3724 | if (m->min_size < JOURNAL_FILE_SIZE_MIN) | |
3725 | m->min_size = JOURNAL_FILE_SIZE_MIN; | |
3726 | ||
8580d1f7 | 3727 | if (m->max_size != 0 && m->min_size > m->max_size) |
babfc091 LP |
3728 | m->max_size = m->min_size; |
3729 | } | |
3730 | ||
3731 | if (m->keep_free == (uint64_t) -1) { | |
3732 | ||
3733 | if (fs_size > 0) { | |
8621b110 | 3734 | m->keep_free = PAGE_ALIGN(fs_size * 3 / 20); /* 15% of file system size */ |
babfc091 LP |
3735 | |
3736 | if (m->keep_free > DEFAULT_KEEP_FREE_UPPER) | |
3737 | m->keep_free = DEFAULT_KEEP_FREE_UPPER; | |
3738 | ||
3739 | } else | |
3740 | m->keep_free = DEFAULT_KEEP_FREE; | |
3741 | } | |
3742 | ||
8580d1f7 LP |
3743 | if (m->n_max_files == (uint64_t) -1) |
3744 | m->n_max_files = DEFAULT_N_MAX_FILES; | |
3745 | ||
3746 | log_debug("Fixed min_use=%s max_use=%s max_size=%s min_size=%s keep_free=%s n_max_files=%" PRIu64, | |
3747 | format_bytes(a, sizeof(a), m->min_use), | |
3748 | format_bytes(b, sizeof(b), m->max_use), | |
3749 | format_bytes(c, sizeof(c), m->max_size), | |
3750 | format_bytes(d, sizeof(d), m->min_size), | |
3751 | format_bytes(e, sizeof(e), m->keep_free), | |
3752 | m->n_max_files); | |
babfc091 | 3753 | } |
08984293 LP |
3754 | |
3755 | int journal_file_get_cutoff_realtime_usec(JournalFile *f, usec_t *from, usec_t *to) { | |
08984293 | 3756 | assert(f); |
c88cc6af | 3757 | assert(f->header); |
08984293 LP |
3758 | assert(from || to); |
3759 | ||
3760 | if (from) { | |
162566a4 LP |
3761 | if (f->header->head_entry_realtime == 0) |
3762 | return -ENOENT; | |
08984293 | 3763 | |
162566a4 | 3764 | *from = le64toh(f->header->head_entry_realtime); |
08984293 LP |
3765 | } |
3766 | ||
3767 | if (to) { | |
162566a4 LP |
3768 | if (f->header->tail_entry_realtime == 0) |
3769 | return -ENOENT; | |
08984293 | 3770 | |
162566a4 | 3771 | *to = le64toh(f->header->tail_entry_realtime); |
08984293 LP |
3772 | } |
3773 | ||
3774 | return 1; | |
3775 | } | |
3776 | ||
3777 | int journal_file_get_cutoff_monotonic_usec(JournalFile *f, sd_id128_t boot_id, usec_t *from, usec_t *to) { | |
08984293 LP |
3778 | Object *o; |
3779 | uint64_t p; | |
3780 | int r; | |
3781 | ||
3782 | assert(f); | |
3783 | assert(from || to); | |
3784 | ||
47838ab3 | 3785 | r = find_data_object_by_boot_id(f, boot_id, &o, &p); |
08984293 LP |
3786 | if (r <= 0) |
3787 | return r; | |
3788 | ||
3789 | if (le64toh(o->data.n_entries) <= 0) | |
3790 | return 0; | |
3791 | ||
3792 | if (from) { | |
3793 | r = journal_file_move_to_object(f, OBJECT_ENTRY, le64toh(o->data.entry_offset), &o); | |
3794 | if (r < 0) | |
3795 | return r; | |
3796 | ||
3797 | *from = le64toh(o->entry.monotonic); | |
3798 | } | |
3799 | ||
3800 | if (to) { | |
3801 | r = journal_file_move_to_object(f, OBJECT_DATA, p, &o); | |
3802 | if (r < 0) | |
3803 | return r; | |
3804 | ||
3805 | r = generic_array_get_plus_one(f, | |
3806 | le64toh(o->data.entry_offset), | |
3807 | le64toh(o->data.entry_array_offset), | |
3808 | le64toh(o->data.n_entries)-1, | |
3809 | &o, NULL); | |
3810 | if (r <= 0) | |
3811 | return r; | |
3812 | ||
3813 | *to = le64toh(o->entry.monotonic); | |
3814 | } | |
3815 | ||
3816 | return 1; | |
3817 | } | |
dca6219e | 3818 | |
fb0951b0 | 3819 | bool journal_file_rotate_suggested(JournalFile *f, usec_t max_file_usec) { |
dca6219e | 3820 | assert(f); |
c88cc6af | 3821 | assert(f->header); |
dca6219e LP |
3822 | |
3823 | /* If we gained new header fields we gained new features, | |
3824 | * hence suggest a rotation */ | |
361f9cbc LP |
3825 | if (le64toh(f->header->header_size) < sizeof(Header)) { |
3826 | log_debug("%s uses an outdated header, suggesting rotation.", f->path); | |
dca6219e | 3827 | return true; |
361f9cbc | 3828 | } |
dca6219e LP |
3829 | |
3830 | /* Let's check if the hash tables grew over a certain fill | |
3831 | * level (75%, borrowing this value from Java's hash table | |
3832 | * implementation), and if so suggest a rotation. To calculate | |
3833 | * the fill level we need the n_data field, which only exists | |
3834 | * in newer versions. */ | |
3835 | ||
3836 | if (JOURNAL_HEADER_CONTAINS(f->header, n_data)) | |
361f9cbc | 3837 | if (le64toh(f->header->n_data) * 4ULL > (le64toh(f->header->data_hash_table_size) / sizeof(HashItem)) * 3ULL) { |
507f22bd | 3838 | log_debug("Data hash table of %s has a fill level at %.1f (%"PRIu64" of %"PRIu64" items, %llu file size, %"PRIu64" bytes per hash table item), suggesting rotation.", |
361f9cbc LP |
3839 | f->path, |
3840 | 100.0 * (double) le64toh(f->header->n_data) / ((double) (le64toh(f->header->data_hash_table_size) / sizeof(HashItem))), | |
507f22bd ZJS |
3841 | le64toh(f->header->n_data), |
3842 | le64toh(f->header->data_hash_table_size) / sizeof(HashItem), | |
3843 | (unsigned long long) f->last_stat.st_size, | |
3844 | f->last_stat.st_size / le64toh(f->header->n_data)); | |
dca6219e | 3845 | return true; |
361f9cbc | 3846 | } |
dca6219e LP |
3847 | |
3848 | if (JOURNAL_HEADER_CONTAINS(f->header, n_fields)) | |
361f9cbc | 3849 | if (le64toh(f->header->n_fields) * 4ULL > (le64toh(f->header->field_hash_table_size) / sizeof(HashItem)) * 3ULL) { |
507f22bd | 3850 | log_debug("Field hash table of %s has a fill level at %.1f (%"PRIu64" of %"PRIu64" items), suggesting rotation.", |
361f9cbc LP |
3851 | f->path, |
3852 | 100.0 * (double) le64toh(f->header->n_fields) / ((double) (le64toh(f->header->field_hash_table_size) / sizeof(HashItem))), | |
507f22bd ZJS |
3853 | le64toh(f->header->n_fields), |
3854 | le64toh(f->header->field_hash_table_size) / sizeof(HashItem)); | |
dca6219e | 3855 | return true; |
361f9cbc | 3856 | } |
dca6219e | 3857 | |
0598fd4a LP |
3858 | /* Are the data objects properly indexed by field objects? */ |
3859 | if (JOURNAL_HEADER_CONTAINS(f->header, n_data) && | |
3860 | JOURNAL_HEADER_CONTAINS(f->header, n_fields) && | |
3861 | le64toh(f->header->n_data) > 0 && | |
3862 | le64toh(f->header->n_fields) == 0) | |
3863 | return true; | |
3864 | ||
fb0951b0 LP |
3865 | if (max_file_usec > 0) { |
3866 | usec_t t, h; | |
3867 | ||
3868 | h = le64toh(f->header->head_entry_realtime); | |
3869 | t = now(CLOCK_REALTIME); | |
3870 | ||
3871 | if (h > 0 && t > h + max_file_usec) | |
3872 | return true; | |
3873 | } | |
3874 | ||
dca6219e LP |
3875 | return false; |
3876 | } |