From 411231cf04c85e4b26696c09119496f34b77cd5c Mon Sep 17 00:00:00 2001 From: Yu Watanabe Date: Jun 30 2023 23:07:22 +0000 Subject: sd-journal: rebreak comments --- diff --git a/src/libsystemd/sd-journal/journal-file.c b/src/libsystemd/sd-journal/journal-file.c index 29f0f91..355f8de 100644 --- a/src/libsystemd/sd-journal/journal-file.c +++ b/src/libsystemd/sd-journal/journal-file.c @@ -2746,21 +2746,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;