ring-buffer: Have the shortest_full queue be the shortest not longest

The logic to know when the shortest waiters on the ring buffer should be
woken up or not has uses a less than instead of a greater than compare,
which causes the shortest_full to actually be the longest.

Link: https://lkml.kernel.org/r/20220927231823.718039222@goodmis.org
Cc: stable@vger.kernel.org
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Andrew Morton <akpm@linux-foundation.org>
Fixes: 57a63d9503ffb ("ring-buffer: Add percentage of ring buffer full to wake up reader")
Signed-off-by: Steven Rostedt (Google) <rostedt@goodmis.org>

diff --git a/kernel/trace/ring_buffer.c b/kernel/trace/ring_buffer.c
index 6b145d48dfd1d91c2b1e09d7334e27d0b55154ab..02db92c9eb1ba7d4e3d86aaa84ac9e5c4ac9ac5f 100644 (file)
--- a/kernel/trace/ring_buffer.c
+++ b/kernel/trace/ring_buffer.c
@@ -1011,7 +1011,7 @@ int ring_buffer_wait(struct trace_buffer *buffer, int cpu, int full)
                        nr_pages = cpu_buffer->nr_pages;
                        dirty = ring_buffer_nr_dirty_pages(buffer, cpu);
                        if (!cpu_buffer->shortest_full ||
-                           cpu_buffer->shortest_full < full)
+                           cpu_buffer->shortest_full > full)
                                cpu_buffer->shortest_full = full;
                        raw_spin_unlock_irqrestore(&cpu_buffer->reader_lock, flags);
                        if (!pagebusy &&