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
|
/*
* Copyright (C) 2022 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.
*/
#include "src/trace_processor/prelude/table_functions/descendant.h"
#include "src/trace_processor/prelude/table_functions/tables_py.h"
#include "test/gtest_and_gmock.h"
namespace perfetto {
namespace trace_processor {
namespace {
TEST(Ancestor, SliceTableNullConstraint) {
// Insert a row to make sure that we are not returning an empty table just
// because the source is empty.
TraceStorage storage;
storage.mutable_slice_table()->Insert({});
Descendant generator{Descendant::Type::kSlice, &storage};
// Check that if we pass start_id = NULL as a constraint, we correctly return
// an empty table.
std::unique_ptr<Table> res;
Constraint c{tables::DescendantSliceTable::ColumnIndex::start_id,
FilterOp::kEq, SqlValue()};
base::Status status = generator.ComputeTable({c}, {}, BitVector(), res);
ASSERT_TRUE(status.ok());
ASSERT_EQ(res->row_count(), 0u);
}
TEST(Ancestor, SliceByStackTableNullConstraint) {
// Insert a row to make sure that we are not returning an empty table just
// because the source is empty.
TraceStorage storage;
storage.mutable_slice_table()->Insert({});
Descendant generator{Descendant::Type::kSliceByStack, &storage};
// Check that if we pass start_id = NULL as a constraint, we correctly return
// an empty table.
std::unique_ptr<Table> res;
Constraint c{tables::DescendantSliceByStackTable::ColumnIndex::start_stack_id,
FilterOp::kEq, SqlValue()};
base::Status status = generator.ComputeTable({c}, {}, BitVector(), res);
ASSERT_TRUE(status.ok());
ASSERT_EQ(res->row_count(), 0u);
}
} // namespace
} // namespace trace_processor
} // namespace perfetto
|
