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
|
// Copyright 2022 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "CheckForbiddenFieldsVisitor.h"
#include "BlinkGCPluginOptions.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/StringRef.h"
CheckForbiddenFieldsVisitor::CheckForbiddenFieldsVisitor() {}
CheckForbiddenFieldsVisitor::Errors&
CheckForbiddenFieldsVisitor::forbidden_fields() {
return forbidden_fields_;
}
bool CheckForbiddenFieldsVisitor::ContainsForbiddenFields(RecordInfo* info) {
bool managed_host = info->IsStackAllocated() || info->IsGCAllocated() ||
info->IsNewDisallowed();
if (!managed_host)
return false;
return ContainsForbiddenFieldsInternal(info);
}
bool CheckForbiddenFieldsVisitor::ContainsForbiddenFieldsInternal(
RecordInfo* info) {
for (auto& field : info->GetFields()) {
current_.push_back(&field.second);
field.second.edge()->Accept(this);
current_.pop_back();
}
return !forbidden_fields_.empty();
}
void CheckForbiddenFieldsVisitor::VisitValue(Value* edge) {
// TODO: what should we do to check unions?
if (edge->value()->record()->isUnion())
return;
// Prevent infinite regress for cyclic embedded objects.
if (visiting_set_.find(edge->value()) != visiting_set_.end())
return;
visiting_set_.insert(edge->value());
// We want to keep recursing into the current field if we did not encounter
// something else than a collection during our recursion. However, in case of
// pointers, we still want to check whether their template specializations
// are forbidden classes, and then stop the recursion.
bool keep_recursing = true;
bool check_for_forbidden_fields = true;
for (Edge* e : llvm::reverse(context())) {
if (!e->IsCollection()) {
keep_recursing = false;
check_for_forbidden_fields = false;
if (e->IsRawPtr() || e->IsRefPtr() || e->IsUniquePtr()) {
check_for_forbidden_fields = true;
}
}
}
if (check_for_forbidden_fields && ContainsInvalidFieldTypes(edge)) {
visiting_set_.erase(edge->value());
return;
}
if (keep_recursing) {
ContainsForbiddenFieldsInternal(edge->value());
}
visiting_set_.erase(edge->value());
}
void CheckForbiddenFieldsVisitor::VisitArrayEdge(ArrayEdge* edge) {
if (edge->element()->IsValue()) {
edge->element()->Accept(this);
}
}
bool CheckForbiddenFieldsVisitor::ContainsInvalidFieldTypes(Value* edge) {
constexpr std::pair<llvm::StringRef, Error> kErrors[] = {
{"blink::TaskRunnerTimer", Error::kTaskRunnerInGCManaged},
{"mojo::Receiver", Error::kMojoReceiverInGCManaged},
{"mojo::Remote", Error::kMojoRemoteInGCManaged},
};
constexpr std::pair<llvm::StringRef, Error> kOptionalAssociatedErrors[] = {
{"mojo::AssociatedRemote", Error::kMojoAssociatedRemoteInGCManaged},
{"mojo::AssociatedReceiver", Error::kMojoAssociatedReceiverInGCManaged},
};
auto* decl = edge->value()->record()->getDefinition();
if (!decl) {
return false;
}
auto type_name = decl->getQualifiedNameAsString();
auto it = std::find_if(
std::begin(kErrors), std::end(kErrors),
[&type_name](const auto& val) { return val.first == type_name; });
if (it != std::end(kErrors)) {
forbidden_fields_.push_back({current_, it->second});
return true;
}
it = std::find_if(
std::begin(kOptionalAssociatedErrors),
std::end(kOptionalAssociatedErrors),
[&type_name](const auto& val) { return val.first == type_name; });
if (it != std::end(kOptionalAssociatedErrors)) {
forbidden_fields_.push_back({current_, it->second});
return true;
}
return false;
}
|
