blob: 97c1fda10a957816fbf18bf1edb3fc874721d6f1 [file] [log] [blame]
peter klausler90cd9ba2018-01-30 19:54:311#ifndef FORTRAN_PREPROCESSOR_H_
2#define FORTRAN_PREPROCESSOR_H_
3
4// A Fortran-aware preprocessing module used by the prescanner to implement
5// preprocessing directives and macro replacement. Intended to be efficient
6// enough to always run on all source files even when no preprocessing is
7// needed, so that special compiler command options &/or source file name
8// extensions for preprocessing will not be necessary.
9
10#include "idioms.h"
11#include <cctype>
12#include <cstring>
13#include <functional>
14#include <list>
15#include <stack>
peter klausler55fe4d22018-02-02 23:52:4316#include <sstream>
peter klausler90cd9ba2018-01-30 19:54:3117#include <string>
18#include <unordered_map>
19#include <vector>
20
21namespace Fortran {
22
23class CharBuffer;
24class Prescanner;
25
26// Just a const char pointer with an associated length; does not own the
27// referenced data. Used to describe buffered tokens and hash table keys.
peter klausler33d78542018-01-30 20:21:2528class CharPointerWithLength {
peter klauslerbdea10d2018-02-05 20:54:3629public:
peter klausler90cd9ba2018-01-30 19:54:3130 CharPointerWithLength() {}
peter klausler33d78542018-01-30 20:21:2531 CharPointerWithLength(const char *x, size_t n) : data_{x}, bytes_{n} {}
peter klauslerad7125f2018-02-01 23:01:2332 CharPointerWithLength(const std::string &s)
33 : data_{s.data()}, bytes_{s.size()} {}
peter klausler90cd9ba2018-01-30 19:54:3134 CharPointerWithLength(const CharPointerWithLength &that)
peter klausler33d78542018-01-30 20:21:2535 : data_{that.data_}, bytes_{that.bytes_} {}
peter klausler90cd9ba2018-01-30 19:54:3136 CharPointerWithLength &operator=(const CharPointerWithLength &that) {
peter klausler33d78542018-01-30 20:21:2537 data_ = that.data_;
38 bytes_ = that.bytes_;
peter klausler90cd9ba2018-01-30 19:54:3139 return *this;
40 }
41
peter klausler33d78542018-01-30 20:21:2542 bool empty() const { return bytes_ == 0; }
43 size_t size() const { return bytes_; }
peter klausler33d78542018-01-30 20:21:2544 const char &operator[](size_t j) const { return data_[j]; }
peter klausler90cd9ba2018-01-30 19:54:3145
peter klausler55fe4d22018-02-02 23:52:4346 bool IsBlank() const;
peter klauslerad7125f2018-02-01 23:01:2347 std::string ToString() const { return std::string{data_, bytes_}; }
48
peter klauslerbdea10d2018-02-05 20:54:3649private:
peter klausler33d78542018-01-30 20:21:2550 const char *data_{nullptr};
51 size_t bytes_{0};
peter klausler90cd9ba2018-01-30 19:54:3152};
53} // namespace Fortran
54
55// Specializations to enable std::unordered_map<CharPointerWithLength, ...>
56template<> struct std::hash<Fortran::CharPointerWithLength> {
57 size_t operator()(const Fortran::CharPointerWithLength &x) const {
peter klauslerbe830d62018-02-05 20:48:0958 size_t hash{0}, bytes{x.size()};
59 for (size_t j{0}; j < bytes; ++j) {
60 hash = (hash * 31) ^ x[j];
peter klausler90cd9ba2018-01-30 19:54:3161 }
62 return hash;
63 }
64};
65
66template<> struct std::equal_to<Fortran::CharPointerWithLength> {
67 bool operator()(const Fortran::CharPointerWithLength &x,
68 const Fortran::CharPointerWithLength &y) const {
peter klausler33d78542018-01-30 20:21:2569 return x.size() == y.size() &&
peter klauslerbe830d62018-02-05 20:48:0970 std::memcmp(static_cast<const void *>(&x[0]),
71 static_cast<const void *>(&y[0]),
peter klausler33d78542018-01-30 20:21:2572 x.size()) == 0;
peter klausler90cd9ba2018-01-30 19:54:3173 }
74};
75
76namespace Fortran {
77
78// Buffers a contiguous sequence of characters that has been partitioned into
79// a sequence of preprocessing tokens.
80class TokenSequence {
peter klauslerbdea10d2018-02-05 20:54:3681public:
peter klausler90cd9ba2018-01-30 19:54:3182 TokenSequence() {}
peter klauslerad7125f2018-02-01 23:01:2383 TokenSequence(const TokenSequence &that) { Append(that); }
peter klausler90cd9ba2018-01-30 19:54:3184 TokenSequence(TokenSequence &&that)
85 : start_{std::move(that.start_)}, nextStart_{that.nextStart_},
86 char_{std::move(that.char_)} {}
peter klauslerad7125f2018-02-01 23:01:2387 TokenSequence(const std::string &s) { push_back(s); }
88
89 TokenSequence &operator=(const TokenSequence &that) {
90 clear();
91 Append(that);
92 return *this;
93 }
peter klausler90cd9ba2018-01-30 19:54:3194 TokenSequence &operator=(TokenSequence &&that) {
95 start_ = std::move(that.start_);
96 nextStart_ = that.nextStart_;
97 char_ = std::move(that.char_);
98 return *this;
99 }
100
peter klauslerad7125f2018-02-01 23:01:23101 CharPointerWithLength operator[](size_t token) const {
peter klausler55fe4d22018-02-02 23:52:43102 return {&char_[start_[token]],
103 (token + 1 >= start_.size() ? char_.size() : start_[token + 1]) -
104 start_[token]};
peter klausler90cd9ba2018-01-30 19:54:31105 }
106
107 void AddChar(char ch) {
108 char_.emplace_back(ch);
109 }
peter klausler6f94e842018-01-30 23:22:26110
peter klausler90cd9ba2018-01-30 19:54:31111 void EndToken() {
112 // CHECK(char_.size() > nextStart_);
113 start_.emplace_back(nextStart_);
114 nextStart_ = char_.size();
115 }
116
peter klausler6f94e842018-01-30 23:22:26117 void ReopenLastToken() {
118 nextStart_ = start_.back();
119 start_.pop_back();
120 }
121
peter klausler90cd9ba2018-01-30 19:54:31122 void Append(const TokenSequence &);
peter klausler55fe4d22018-02-02 23:52:43123 void EmitWithCaseConversion(CharBuffer *) const;
124 std::string ToString() const;
peter klausler90cd9ba2018-01-30 19:54:31125
126 bool empty() const { return start_.empty(); }
peter klausler90cd9ba2018-01-30 19:54:31127 size_t size() const { return start_.size(); }
peter klausler6f94e842018-01-30 23:22:26128 const char *data() const { return &char_[0]; }
peter klauslerbe830d62018-02-05 20:48:09129 void clear();
130 void push_back(const char *, size_t);
131 void push_back(const CharPointerWithLength &);
132 void push_back(const std::string &);
133 void push_back(const std::stringstream &);
134 void pop_back();
135 void shrink_to_fit();
peter klausler90cd9ba2018-01-30 19:54:31136
peter klauslerbdea10d2018-02-05 20:54:36137private:
peter klausler90cd9ba2018-01-30 19:54:31138 std::vector<int> start_;
139 size_t nextStart_{0};
140 std::vector<char> char_;
141};
142
143// Defines a macro
144class Definition {
peter klauslerbdea10d2018-02-05 20:54:36145public:
peter klausler90cd9ba2018-01-30 19:54:31146 Definition(const TokenSequence &, size_t firstToken, size_t tokens);
147 Definition(const std::vector<std::string> &argNames, const TokenSequence &,
peter klauslerbe830d62018-02-05 20:48:09148 size_t firstToken, size_t tokens, bool isVariadic = false);
peter klauslerad7125f2018-02-01 23:01:23149 explicit Definition(const std::string &predefined);
peter klausler90cd9ba2018-01-30 19:54:31150
151 bool isFunctionLike() const { return isFunctionLike_; }
152 size_t argumentCount() const { return argumentCount_; }
153 bool isVariadic() const { return isVariadic_; }
154 bool isDisabled() const { return isDisabled_; }
peter klauslerad7125f2018-02-01 23:01:23155 bool isPredefined() const { return isPredefined_; }
peter klausler90cd9ba2018-01-30 19:54:31156 const TokenSequence &replacement() const { return replacement_; }
157
158 bool set_isDisabled(bool disable);
159
160 TokenSequence Apply(const std::vector<TokenSequence> &args);
161
peter klauslerbdea10d2018-02-05 20:54:36162private:
peter klausler90cd9ba2018-01-30 19:54:31163 static TokenSequence Tokenize(const std::vector<std::string> &argNames,
164 const TokenSequence &token, size_t firstToken,
165 size_t tokens);
166
167 bool isFunctionLike_{false};
168 size_t argumentCount_{0};
169 bool isVariadic_{false};
170 bool isDisabled_{false};
peter klauslerad7125f2018-02-01 23:01:23171 bool isPredefined_{false};
peter klausler90cd9ba2018-01-30 19:54:31172 TokenSequence replacement_;
173};
174
175// Preprocessing state
176class Preprocessor {
peter klauslerbdea10d2018-02-05 20:54:36177public:
peter klauslerad7125f2018-02-01 23:01:23178 explicit Preprocessor(Prescanner &);
peter klausler90cd9ba2018-01-30 19:54:31179
180 // When the input contains macros to be replaced, the new token sequence
181 // is appended to the output and the returned value is true. When
182 // no macro replacement is necessary, the output is unmodified and the
183 // return value is false.
184 bool MacroReplacement(const TokenSequence &, TokenSequence *);
185
peter klausler55fe4d22018-02-02 23:52:43186 // Implements a preprocessor directive; returns true when no fatal error.
187 bool Directive(const TokenSequence &);
peter klausler90cd9ba2018-01-30 19:54:31188
peter klauslerbdea10d2018-02-05 20:54:36189private:
peter klausler93cf3ae2018-02-01 20:08:02190 enum class IsElseActive { No, Yes };
191 enum class CanDeadElseAppear { No, Yes };
peter klauslerad7125f2018-02-01 23:01:23192
peter klausler55fe4d22018-02-02 23:52:43193 void Complain(const std::string &);
peter klauslerad7125f2018-02-01 23:01:23194 CharPointerWithLength SaveToken(const CharPointerWithLength &);
peter klausler93cf3ae2018-02-01 20:08:02195 bool IsNameDefined(const CharPointerWithLength &);
peter klauslerad7125f2018-02-01 23:01:23196 TokenSequence ReplaceMacros(const TokenSequence &);
peter klausler55fe4d22018-02-02 23:52:43197 bool SkipDisabledConditionalCode(const std::string &dirName, IsElseActive);
peter klausler93cf3ae2018-02-01 20:08:02198 bool IsIfPredicateTrue(const TokenSequence &expr, size_t first,
peter klausler55fe4d22018-02-02 23:52:43199 size_t exprTokens);
peter klausler93cf3ae2018-02-01 20:08:02200
peter klauslerad7125f2018-02-01 23:01:23201 Prescanner &prescanner_;
peter klausler90cd9ba2018-01-30 19:54:31202 std::list<std::string> names_;
203 std::unordered_map<CharPointerWithLength, Definition> definitions_;
peter klausler93cf3ae2018-02-01 20:08:02204 std::stack<CanDeadElseAppear> ifStack_;
peter klausler90cd9ba2018-01-30 19:54:31205};
206} // namespace Fortran
207#endif // FORTRAN_PREPROCESSOR_H_