Fix zero copy sorting

Otherwise, the multiplication overflows since sec_sent_mono is 32 bit
and NSEC_PER_SEC is kinda big.

Change-Id: I1b4ce376bad39792929142feb7c3a05308188112

diff --git a/src/libdlogutil/fdi_zero_copy.c b/src/libdlogutil/fdi_zero_copy.c
index b6f58b2..e9d7f84 100644 (file)
--- a/src/libdlogutil/fdi_zero_copy.c
+++ b/src/libdlogutil/fdi_zero_copy.c
@@ -273,7 +273,7 @@ static void sort_items_list(struct zlog_entry_list **items)
                        /* TODO: it would be good not to have to recalculate this.
                         * Perhaps have the item struct contain entry, next, timestamp?
                         * Maybe it's fine though, math is cheap. */
-                       const uint64_t timestamp64 = item->entry->sec_sent_mono * NSEC_PER_SEC + item->entry->nsec_sent_mono;
+                       const uint64_t timestamp64 = (uint64_t)item->entry->sec_sent_mono * NSEC_PER_SEC + item->entry->nsec_sent_mono;
 
                        int const bucket = (timestamp64 >> step) & 0xFF;
                        if (!begin[bucket])