blob: b23a60649ebc8e84133c4127ff1c5b90e693534e (
plain)
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
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-
* vim: set ts=8 sts=2 et sw=2 tw=80:
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "frontend/ParseNodeVerify.h"
#include "frontend/ParseNodeVisitor.h"
using namespace js;
#ifdef DEBUG
namespace js {
namespace frontend {
class ParseNodeVerifier : public ParseNodeVisitor<ParseNodeVerifier> {
using Base = ParseNodeVisitor<ParseNodeVerifier>;
const LifoAlloc& alloc_;
public:
ParseNodeVerifier(FrontendContext* fc, const LifoAlloc& alloc)
: Base(fc), alloc_(alloc) {}
[[nodiscard]] bool visit(ParseNode* pn) {
// pn->size() asserts that pn->pn_kind is valid, so we don't redundantly
// assert that here.
JS_PARSE_NODE_ASSERT(alloc_.contains(pn),
"start of parse node is in alloc");
JS_PARSE_NODE_ASSERT(alloc_.contains((unsigned char*)pn + pn->size()),
"end of parse node is in alloc");
if (pn->is<ListNode>()) {
pn->as<ListNode>().checkConsistency();
}
return Base::visit(pn);
}
};
} // namespace frontend
} // namespace js
bool frontend::CheckParseTree(FrontendContext* fc, const LifoAlloc& alloc,
ParseNode* pn) {
ParseNodeVerifier verifier(fc, alloc);
return verifier.visit(pn);
}
#endif // DEBUG
|
