trace_processor: improve costing algorithm to better account for sort
Up until now we've had a very simplistic algorithm for estimating cost
which only looked at filter constraints and ignored sorting. However, we
will need to consider sort constraints carefully as on real workloads
they dominate performance (if they exist).
Context: go/perfetto-tp-refactor
Bug: 135177627
Change-Id: Ie695a58b2c21055a862973bf0c1b72f941448f83
diff --git a/Android.bp b/Android.bp
index 47ad208..7ac370a 100644
--- a/Android.bp
+++ b/Android.bp
@@ -4692,6 +4692,7 @@
filegroup {
name: "perfetto_src_trace_processor_sqlite_unittests",
srcs: [
+ "src/trace_processor/sqlite/db_sqlite_table_unittest.cc",
"src/trace_processor/sqlite/query_constraints_unittest.cc",
"src/trace_processor/sqlite/sqlite3_str_split_unittest.cc",
],