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
|
/*
* 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_IMPORTERS_COMMON_GLOBAL_ARGS_TRACKER_H_
#define SRC_TRACE_PROCESSOR_IMPORTERS_COMMON_GLOBAL_ARGS_TRACKER_H_
#include "perfetto/ext/base/flat_hash_map.h"
#include "perfetto/ext/base/hash.h"
#include "perfetto/ext/base/small_vector.h"
#include "src/trace_processor/storage/trace_storage.h"
#include "src/trace_processor/types/trace_processor_context.h"
#include "src/trace_processor/types/variadic.h"
namespace perfetto {
namespace trace_processor {
// Interns args into the storage from all ArgsTrackers across trace processor.
// Note: most users will want to use ArgsTracker to push args to the strorage
// and not this class. This class is really intended for ArgsTracker to use for
// that purpose.
class GlobalArgsTracker {
public:
// How to behave if two or more args with the same key were added into the
// same ArgSet. If |kSkipIfExists|, the arg will be ignored if another arg
// with the same key already exists. If |kAddOrUpdate|, any existing arg with
// the same key will be overridden.
enum class UpdatePolicy { kSkipIfExists, kAddOrUpdate };
struct Arg {
StringId flat_key = kNullStringId;
StringId key = kNullStringId;
Variadic value = Variadic::Integer(0);
Column* column;
uint32_t row;
UpdatePolicy update_policy = UpdatePolicy::kAddOrUpdate;
};
struct ArgHasher {
uint64_t operator()(const Arg& arg) const noexcept {
base::Hash hash;
hash.Update(arg.key.raw_id());
// We don't hash arg.flat_key because it's a subsequence of arg.key.
switch (arg.value.type) {
case Variadic::Type::kInt:
hash.Update(arg.value.int_value);
break;
case Variadic::Type::kUint:
hash.Update(arg.value.uint_value);
break;
case Variadic::Type::kString:
hash.Update(arg.value.string_value.raw_id());
break;
case Variadic::Type::kReal:
hash.Update(arg.value.real_value);
break;
case Variadic::Type::kPointer:
hash.Update(arg.value.pointer_value);
break;
case Variadic::Type::kBool:
hash.Update(arg.value.bool_value);
break;
case Variadic::Type::kJson:
hash.Update(arg.value.json_value.raw_id());
break;
case Variadic::Type::kNull:
hash.Update(0);
break;
}
return hash.digest();
}
};
explicit GlobalArgsTracker(TraceProcessorContext* context);
// Assumes that the interval [begin, end) of |args| is sorted by keys.
ArgSetId AddArgSet(const Arg* args, uint32_t begin, uint32_t end) {
base::SmallVector<uint32_t, 64> valid_indexes;
// TODO(eseckler): Also detect "invalid" key combinations in args sets (e.g.
// "foo" and "foo.bar" in the same arg set)?
for (uint32_t i = begin; i < end; i++) {
if (!valid_indexes.empty() &&
args[valid_indexes.back()].key == args[i].key) {
// Last arg had the same key as this one. In case of kSkipIfExists, skip
// this arg. In case of kAddOrUpdate, remove the last arg and add this
// arg instead.
if (args[i].update_policy == UpdatePolicy::kSkipIfExists) {
continue;
} else {
PERFETTO_DCHECK(args[i].update_policy == UpdatePolicy::kAddOrUpdate);
valid_indexes.pop_back();
}
}
valid_indexes.emplace_back(i);
}
base::Hash hash;
for (uint32_t i : valid_indexes) {
hash.Update(ArgHasher()(args[i]));
}
auto* arg_table = context_->storage->mutable_arg_table();
ArgSetHash digest = hash.digest();
auto it_and_inserted =
arg_row_for_hash_.Insert(digest, arg_table->row_count());
if (!it_and_inserted.second) {
// Already inserted.
return arg_table->arg_set_id()[*it_and_inserted.first];
}
// Taking size() after the Insert() ensures that nothing has an id == 0
// (0 == kInvalidArgSetId).
ArgSetId id = static_cast<uint32_t>(arg_row_for_hash_.size());
for (uint32_t i : valid_indexes) {
const auto& arg = args[i];
tables::ArgTable::Row row;
row.arg_set_id = id;
row.flat_key = arg.flat_key;
row.key = arg.key;
switch (arg.value.type) {
case Variadic::Type::kInt:
row.int_value = arg.value.int_value;
break;
case Variadic::Type::kUint:
row.int_value = static_cast<int64_t>(arg.value.uint_value);
break;
case Variadic::Type::kString:
row.string_value = arg.value.string_value;
break;
case Variadic::Type::kReal:
row.real_value = arg.value.real_value;
break;
case Variadic::Type::kPointer:
row.int_value = static_cast<int64_t>(arg.value.pointer_value);
break;
case Variadic::Type::kBool:
row.int_value = arg.value.bool_value;
break;
case Variadic::Type::kJson:
row.string_value = arg.value.json_value;
break;
case Variadic::Type::kNull:
break;
}
row.value_type = context_->storage->GetIdForVariadicType(arg.value.type);
arg_table->Insert(row);
}
return id;
}
// Exposed for making tests easier to write.
ArgSetId AddArgSet(const std::vector<Arg>& args,
uint32_t begin,
uint32_t end) {
return AddArgSet(args.data(), begin, end);
}
private:
using ArgSetHash = uint64_t;
base::FlatHashMap<ArgSetHash, uint32_t, base::AlreadyHashed<ArgSetHash>>
arg_row_for_hash_;
TraceProcessorContext* context_;
};
} // namespace trace_processor
} // namespace perfetto
#endif // SRC_TRACE_PROCESSOR_IMPORTERS_COMMON_GLOBAL_ARGS_TRACKER_H_
|
