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
|
// Copyright (c) 2018, NVIDIA CORPORATION. All rights reserved.
//
// 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 "instrumented-parser.h"
#include "message.h"
#include "provenance.h"
#include <map>
#include <ostream>
namespace Fortran::parser {
void ParsingLog::clear() { perPos_.clear(); }
// In the logs, just use the addresses of the message texts to sort the
// map keys.
bool operator<(const MessageFixedText &x, const MessageFixedText &y) {
return x.text().begin() < y.text().begin();
}
bool ParsingLog::Fails(
const char *at, const MessageFixedText &tag, ParseState &state) {
std::size_t offset{reinterpret_cast<std::size_t>(at)};
auto posIter{perPos_.find(offset)};
if (posIter == perPos_.end()) {
return false;
}
auto tagIter{posIter->second.perTag.find(tag)};
if (tagIter == posIter->second.perTag.end()) {
return false;
}
auto &entry{tagIter->second};
if (entry.deferred && !state.deferMessages()) {
return false; // don't fail fast, we want to generate messages
}
++entry.count;
if (!state.deferMessages()) {
state.messages().Copy(entry.messages);
}
return !entry.pass;
}
void ParsingLog::Note(const char *at, const MessageFixedText &tag, bool pass,
const ParseState &state) {
std::size_t offset{reinterpret_cast<std::size_t>(at)};
auto &entry{perPos_[offset].perTag[tag]};
if (++entry.count == 1) {
entry.pass = pass;
entry.deferred = state.deferMessages();
if (!entry.deferred) {
entry.messages.Copy(state.messages());
}
} else {
CHECK(entry.pass == pass);
if (entry.deferred && !state.deferMessages()) {
entry.deferred = false;
entry.messages.Copy(state.messages());
}
}
}
void ParsingLog::Dump(std::ostream &o, const CookedSource &cooked) const {
for (const auto &posLog : perPos_) {
const char *at{reinterpret_cast<const char *>(posLog.first)};
for (const auto &tagLog : posLog.second.perTag) {
Message{at, tagLog.first}.Emit(o, cooked, true);
auto &entry{tagLog.second};
o << " " << (entry.pass ? "pass" : "fail") << " " << entry.count << '\n';
entry.messages.Emit(o, cooked, " ");
}
}
}
} // namespace Fortran::parser
|
