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 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243
|
// Copyright 2023 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/browser/attribution_reporting/sql_query_plan_test_util.h"
#include <algorithm>
#include <optional>
#include <ostream>
#include <string>
#include <string_view>
#include <utility>
#include <vector>
#include "base/check.h"
#include "base/command_line.h"
#include "base/containers/contains.h"
#include "base/files/file_util.h"
#include "base/logging.h"
#include "base/path_service.h"
#include "base/process/launch.h"
#include "base/process/process.h"
#include "base/strings/strcat.h"
#include "base/strings/string_util.h"
#include "base/types/expected.h"
#include "testing/gmock/include/gmock/gmock.h"
namespace content {
namespace {
base::FilePath GetExecPath(std::string_view name) {
base::FilePath path;
base::PathService::Get(base::DIR_EXE, &path);
return path.AppendASCII(name);
}
// TODO(apaseltiner): Instead of making each index-check opt-in, we should parse
// the entire query plan and verify the entire set of indexes.
class SqlIndexMatcher {
public:
using is_gtest_matcher = void;
// Specifies the type of index that we should match with. Note this also
// covers primary keys which are implemented as indexes in sqlite.
enum class Type {
kNonCovering, // USING INDEX
kCovering, // USING COVERING INDEX
kPrimaryKey, // USING PRIMARY KEY
};
// Every sqlite index includes a list of indexed columns. However, some query
// plans will only use a subset of the columns in the index. This matcher is
// designed to enforce that a given subset of columns are actually used by the
// query planner. Note that this list doesn't have to be exhaustive, and
// plans that use a superset of columns listed in `columns` will still match.
SqlIndexMatcher(std::string name, std::vector<std::string> columns, Type type)
: name_(std::move(name)), columns_(std::move(columns)), type_(type) {
switch (type_) {
case Type::kNonCovering:
case Type::kCovering:
CHECK_NE(name_, "");
break;
case Type::kPrimaryKey:
CHECK_EQ(name_, "");
break;
}
}
bool MatchAndExplain(const SqlQueryPlan&, std::ostream*) const;
void DescribeTo(std::ostream* out) const {
return DescribeTo(out, /*negated=*/false);
}
void DescribeNegationTo(std::ostream* out) const {
return DescribeTo(out, /*negated=*/true);
}
private:
void DescribeTo(std::ostream*, bool negated) const;
size_t FindIndexStart(std::string_view plan) const;
std::string name_;
std::vector<std::string> columns_;
Type type_;
};
bool SqlIndexMatcher::MatchAndExplain(const SqlQueryPlan& plan,
std::ostream*) const {
std::string_view plan_piece(plan.plan);
size_t start_pos = FindIndexStart(plan_piece);
if (start_pos == std::string::npos) {
return false;
}
size_t end_pos = plan_piece.find("\n", start_pos);
std::string_view index_text =
plan_piece.substr(start_pos, end_pos - start_pos);
return std::ranges::all_of(columns_, [index_text](const std::string& col) {
return base::Contains(index_text, col);
});
}
size_t SqlIndexMatcher::FindIndexStart(std::string_view plan) const {
switch (type_) {
case SqlIndexMatcher::Type::kCovering:
return plan.find(base::StrCat({"USING COVERING INDEX ", name_}));
case SqlIndexMatcher::Type::kNonCovering:
return plan.find(base::StrCat({"USING INDEX ", name_}));
case SqlIndexMatcher::Type::kPrimaryKey: {
size_t pos = plan.find("USING PRIMARY KEY ");
if (pos != std::string::npos) {
return pos;
}
return plan.find("USING INTEGER PRIMARY KEY ");
}
}
}
void SqlIndexMatcher::DescribeTo(std::ostream* out, bool negated) const {
if (negated) {
*out << "does not use ";
} else {
*out << "uses ";
}
switch (type_) {
case Type::kNonCovering:
*out << "index " << name_;
break;
case Type::kCovering:
*out << "covering index " << name_;
break;
case Type::kPrimaryKey:
*out << "primary key";
break;
}
if (columns_.empty()) {
return;
}
*out << " with columns";
const char* separator = " ";
for (const auto& column : columns_) {
*out << separator << column;
separator = ", ";
}
}
// TODO(apaseltiner): This check is not robust, as some "scans" are optimized
// using an index.
bool HasFullTableScan(const SqlQueryPlan& plan) {
return base::Contains(plan.plan, "SCAN");
}
} // namespace
testing::Matcher<SqlQueryPlan> UsesIndex(std::string name,
std::vector<std::string> columns) {
return SqlIndexMatcher(std::move(name), std::move(columns),
SqlIndexMatcher::Type::kNonCovering);
}
testing::Matcher<SqlQueryPlan> UsesCoveringIndex(
std::string name,
std::vector<std::string> columns) {
return SqlIndexMatcher(std::move(name), std::move(columns),
SqlIndexMatcher::Type::kCovering);
}
testing::Matcher<SqlQueryPlan> UsesPrimaryKey() {
return SqlIndexMatcher("", {}, SqlIndexMatcher::Type::kPrimaryKey);
}
std::ostream& operator<<(std::ostream& out, const SqlQueryPlan& plan) {
return out << plan.query << "\n" << plan.plan;
}
SqlQueryPlanExplainer::SqlQueryPlanExplainer(base::FilePath db_path)
: db_path_(std::move(db_path)),
shell_path_(GetExecPath("sqlite_dev_shell")) {}
SqlQueryPlanExplainer::~SqlQueryPlanExplainer() = default;
base::expected<SqlQueryPlan, SqlQueryPlanExplainer::Error>
SqlQueryPlanExplainer::GetPlan(
std::string query,
std::optional<SqlFullScanReason> full_scan_reason) {
base::CommandLine command_line(shell_path_);
command_line.AppendArgPath(db_path_);
std::string explain_query = base::StrCat({"EXPLAIN QUERY PLAN ", query});
command_line.AppendArg(explain_query);
std::string output;
if (!base::GetAppOutput(command_line, &output)) {
LOG(ERROR) << "command failed output: " << output;
return base::unexpected(Error::kCommandFailed);
}
if (!base::StartsWith(output, "QUERY PLAN")) {
LOG(ERROR) << "invalid query plan output: " << output;
return base::unexpected(Error::kInvalidOutput);
}
SqlQueryPlan plan{
.query = std::move(query),
.plan = std::move(output),
};
bool plan_has_full_scan = HasFullTableScan(plan);
if (plan_has_full_scan && !full_scan_reason.has_value()) {
return base::unexpected(Error::kMissingFullScanAnnotation);
}
if (!plan_has_full_scan && full_scan_reason.has_value()) {
return base::unexpected(Error::kExtraneousFullScanAnnotation);
}
return plan;
}
std::ostream& operator<<(std::ostream& out,
SqlQueryPlanExplainer::Error error) {
switch (error) {
case SqlQueryPlanExplainer::Error::kCommandFailed:
return out << "kCommandFailed";
case SqlQueryPlanExplainer::Error::kInvalidOutput:
return out << "kInvalidOutput";
case SqlQueryPlanExplainer::Error::kMissingFullScanAnnotation:
return out << "kMissingFullScanAnnotation";
case SqlQueryPlanExplainer::Error::kExtraneousFullScanAnnotation:
return out << "kExtraneousFullScanAnnotation";
}
}
} // namespace content
|