1
0
mirror of https://github.com/systemd/systemd.git synced 2025-02-04 21:47:31 +03:00

sd-journal: rebreak comments

This commit is contained in:
Yu Watanabe 2023-05-07 00:23:44 +09:00
parent dd03d91527
commit de6b162d35

View File

@ -2813,21 +2813,17 @@ static int generic_array_bisect(
ci = ordered_hashmap_get(f->chain_cache, &first);
if (ci && n > ci->total && ci->begin != 0) {
/* Ah, we have iterated this bisection array chain
* previously! Let's see if we can skip ahead in the
* chain, as far as the last time. But we can't jump
* backwards in the chain, so let's check that
* first. */
/* Ah, we have iterated this bisection array chain previously! Let's see if we can skip ahead
* in the chain, as far as the last time. But we can't jump backwards in the chain, so let's
* check that first. */
r = test_object(f, ci->begin, needle);
if (r < 0)
return r;
if (r == TEST_LEFT) {
/* OK, what we are looking for is right of the
* begin of this EntryArray, so let's jump
* straight to previously cached array in the
* chain */
/* OK, what we are looking for is right of the begin of this EntryArray, so let's
* jump straight to previously cached array in the chain */
a = ci->array;
n -= ci->total;