File: CheckGCRootsVisitor.cpp

package info (click to toggle)
chromium 138.0.7204.157-1
  • links: PTS, VCS
  • area: main
  • in suites: sid, trixie
  • size: 6,071,864 kB
  • sloc: cpp: 34,936,859; ansic: 7,176,967; javascript: 4,110,704; python: 1,419,953; asm: 946,768; xml: 739,967; pascal: 187,324; sh: 89,623; perl: 88,663; objc: 79,944; sql: 50,304; cs: 41,786; fortran: 24,137; makefile: 21,806; php: 13,980; tcl: 13,166; yacc: 8,925; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (86 lines) | stat: -rw-r--r-- 2,397 bytes parent folder | download | duplicates (5)
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
// Copyright 2015 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "CheckGCRootsVisitor.h"
#include "BlinkGCPluginOptions.h"

CheckGCRootsVisitor::CheckGCRootsVisitor(const BlinkGCPluginOptions& options)
    : should_check_unique_ptrs_(options.enable_persistent_in_unique_ptr_check) {
}

CheckGCRootsVisitor::Errors& CheckGCRootsVisitor::gc_roots() {
  return gc_roots_;
}

CheckGCRootsVisitor::Errors& CheckGCRootsVisitor::gc_root_refs() {
  return gc_root_refs_;
}

bool CheckGCRootsVisitor::ContainsGCRoots(RecordInfo* info) {
  for (RecordInfo::Fields::iterator it = info->GetFields().begin();
       it != info->GetFields().end();
       ++it) {
    current_.push_back(&it->second);
    it->second.edge()->Accept(this);
    current_.pop_back();
  }
  return !gc_roots_.empty() || !gc_root_refs_.empty();
}

void CheckGCRootsVisitor::VisitValue(Value* edge) {
  // TODO: what should we do to check unions?
  if (edge->value()->record()->isUnion())
    return;

  // Prevent infinite regress for cyclic part objects.
  if (visiting_set_.find(edge->value()) != visiting_set_.end())
    return;

  visiting_set_.insert(edge->value());
  // If the value is a part object, then continue checking for roots.
  for (Context::iterator it = context().begin();
       it != context().end();
       ++it) {
    if (!(*it)->IsCollection())
      return;
  }
  ContainsGCRoots(edge->value());
  visiting_set_.erase(edge->value());
}

void CheckGCRootsVisitor::VisitUniquePtr(UniquePtr* edge) {
  if (!should_check_unique_ptrs_)
    return;
  edge->ptr()->Accept(this);
}

void CheckGCRootsVisitor::VisitRawPtr(RawPtr* edge) {
  bool previous_is_ref_ = is_ref_;
  is_ref_ = true;
  RecursiveEdgeVisitor::VisitRawPtr(edge);
  is_ref_ = previous_is_ref_;
}

void CheckGCRootsVisitor::VisitRefPtr(RefPtr* edge) {
  bool previous_is_ref_ = is_ref_;
  is_ref_ = true;
  RecursiveEdgeVisitor::VisitRefPtr(edge);
  is_ref_ = previous_is_ref_;
}

void CheckGCRootsVisitor::VisitPersistent(Persistent* edge) {
  if (is_ref_) {
    gc_root_refs_.push_back(current_);
  } else {
    gc_roots_.push_back(current_);
  }
}

void CheckGCRootsVisitor::VisitCollection(Collection* edge) {
  // There already is a matcher for handling this.
  if (edge->IsSTDCollection()) {
    return;
  }
  RecursiveEdgeVisitor::VisitCollection(edge);
}