From 7e13cacb9b589662a1f748c362a70e753ae4a9db Mon Sep 17 00:00:00 2001 From: Gerald Combs Date: Mon, 20 Jul 2015 13:07:26 -0700 Subject: Try to minimize sorting overhead. Process application events as little as possible while sorting. Change-Id: I9d779aebf6edaafc1e6af3a99b4a0dac682ea6b6 Reviewed-on: https://code.wireshark.org/review/9722 Reviewed-by: Gerald Combs --- ui/qt/packet_list_model.cpp | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) (limited to 'ui/qt/packet_list_model.cpp') diff --git a/ui/qt/packet_list_model.cpp b/ui/qt/packet_list_model.cpp index 59274bab92..79fe759e6f 100644 --- a/ui/qt/packet_list_model.cpp +++ b/ui/qt/packet_list_model.cpp @@ -289,9 +289,11 @@ bool PacketListModel::recordLessThan(PacketListRecord *r1, PacketListRecord *r2) // _packet_list_compare_records, and packet_list_compare_custom from // gtk/packet_list_store.c into one function + // What's the least amount of processing that we can do which will draw + // the busy indicator? if (busy_timer_.elapsed() > busy_timeout_) { busy_timer_.restart(); - wsApp->processEvents(); + wsApp->processEvents(QEventLoop::ExcludeUserInputEvents | QEventLoop::ExcludeSocketNotifiers, 1); } if (sort_column_ < 0) { // No column. -- cgit v1.2.1