1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
|
/*
* Copyright (C) 2019 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef SRC_TRACE_PROCESSOR_SQLITE_DB_SQLITE_TABLE_H_
#define SRC_TRACE_PROCESSOR_SQLITE_DB_SQLITE_TABLE_H_
#include "perfetto/base/status.h"
#include "src/trace_processor/containers/bit_vector.h"
#include "src/trace_processor/db/table.h"
#include "src/trace_processor/prelude/table_functions/table_function.h"
#include "src/trace_processor/sqlite/query_cache.h"
#include "src/trace_processor/sqlite/sqlite_table.h"
namespace perfetto {
namespace trace_processor {
enum class DbSqliteTableComputation {
// Mode when the table is static (i.e. passed in at construction
// time).
kStatic,
// Mode when table is dynamically computed at filter time.
kDynamic,
};
struct DbSqliteTableContext {
QueryCache* cache;
DbSqliteTableComputation computation;
// Only valid when computation == TableComputation::kStatic.
const Table* static_table;
// Only valid when computation == TableComputation::kDynamic.
std::unique_ptr<TableFunction> generator;
};
// Implements the SQLite table interface for db tables.
class DbSqliteTable final
: public TypedSqliteTable<DbSqliteTable, DbSqliteTableContext> {
public:
using TableComputation = DbSqliteTableComputation;
using Context = DbSqliteTableContext;
class Cursor final : public SqliteTable::BaseCursor {
public:
Cursor(DbSqliteTable*, QueryCache*);
~Cursor() final;
Cursor(Cursor&&) noexcept = default;
Cursor& operator=(Cursor&&) = default;
// Implementation of SqliteTable::Cursor.
base::Status Filter(const QueryConstraints& qc,
sqlite3_value** argv,
FilterHistory);
base::Status Next();
bool Eof();
base::Status Column(sqlite3_context*, int N);
private:
enum class Mode {
kSingleRow,
kTable,
};
// Tries to create a sorted table to cache in |sorted_cache_table_| if the
// constraint set matches the requirements.
void TryCacheCreateSortedTable(const QueryConstraints&, FilterHistory);
const Table* SourceTable() const {
// Try and use the sorted cache table (if it exists) to speed up the
// sorting. Otherwise, just use the original table.
return sorted_cache_table_ ? &*sorted_cache_table_ : upstream_table_;
}
Cursor(const Cursor&) = delete;
Cursor& operator=(const Cursor&) = delete;
DbSqliteTable* db_sqlite_table_ = nullptr;
QueryCache* cache_ = nullptr;
const Table* upstream_table_ = nullptr;
// Only valid for |db_sqlite_table_->computation_| ==
// TableComputation::kDynamic.
std::unique_ptr<Table> dynamic_table_;
// Only valid for Mode::kSingleRow.
std::optional<uint32_t> single_row_;
// Only valid for Mode::kTable.
std::optional<Table> db_table_;
std::optional<Table::Iterator> iterator_;
bool eof_ = true;
// Stores a sorted version of |db_table_| sorted on a repeated equals
// constraint. This allows speeding up repeated subqueries in joins
// significantly.
std::shared_ptr<Table> sorted_cache_table_;
// Stores the count of repeated equality queries to decide whether it is
// wortwhile to sort |db_table_| to create |sorted_cache_table_|.
uint32_t repeated_cache_count_ = 0;
Mode mode_ = Mode::kSingleRow;
std::vector<Constraint> constraints_;
std::vector<Order> orders_;
};
struct QueryCost {
double cost;
uint32_t rows;
};
DbSqliteTable(sqlite3*, Context context);
virtual ~DbSqliteTable() final;
// Table implementation.
base::Status Init(int, const char* const*, SqliteTable::Schema*) final;
std::unique_ptr<SqliteTable::BaseCursor> CreateCursor() final;
base::Status ModifyConstraints(QueryConstraints*) final;
int BestIndex(const QueryConstraints&, BestIndexInfo*) final;
// These static functions are useful to allow other callers to make use
// of them.
static SqliteTable::Schema ComputeSchema(const Table::Schema&,
const char* table_name);
static void ModifyConstraints(const Table::Schema&, QueryConstraints*);
static void BestIndex(const Table::Schema&,
uint32_t row_count,
const QueryConstraints&,
BestIndexInfo*);
// static for testing.
static QueryCost EstimateCost(const Table::Schema&,
uint32_t row_count,
const QueryConstraints& qc);
private:
QueryCache* cache_ = nullptr;
TableComputation computation_ = TableComputation::kStatic;
// Only valid after Init has completed.
Table::Schema schema_;
// Only valid when computation_ == TableComputation::kStatic.
const Table* static_table_ = nullptr;
// Only valid when computation_ == TableComputation::kDynamic.
std::unique_ptr<TableFunction> generator_;
};
} // namespace trace_processor
} // namespace perfetto
#endif // SRC_TRACE_PROCESSOR_SQLITE_DB_SQLITE_TABLE_H_
|
