blob: 165f935a6e04f9be5a49f019877c6b9b5b661e42 [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>
peter klausler55fe4d22018-02-02 23:52:4315#include <sstream>
peter klausler16c6f532018-02-05 22:29:2616#include <stack>
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,
peter klausler16c6f532018-02-05 22:29:2668 const Fortran::CharPointerWithLength &y) const {
peter klausler33d78542018-01-30 20:21:2569 return x.size() == y.size() &&
peter klausler16c6f532018-02-05 22:29:2670 std::memcmp(static_cast<const void *>(&x[0]),
71 static_cast<const void *>(&y[0]), x.size()) == 0;
peter klausler90cd9ba2018-01-30 19:54:3172 }
73};
74
75namespace Fortran {
76
77// Buffers a contiguous sequence of characters that has been partitioned into
78// a sequence of preprocessing tokens.
79class TokenSequence {
peter klauslerbdea10d2018-02-05 20:54:3680public:
peter klausler90cd9ba2018-01-30 19:54:3181 TokenSequence() {}
peter klauslerad7125f2018-02-01 23:01:2382 TokenSequence(const TokenSequence &that) { Append(that); }
peter klausler90cd9ba2018-01-30 19:54:3183 TokenSequence(TokenSequence &&that)
peter klausler16c6f532018-02-05 22:29:2684 : start_{std::move(that.start_)},
85 nextStart_{that.nextStart_}, char_{std::move(that.char_)} {}
peter klauslerad7125f2018-02-01 23:01:2386 TokenSequence(const std::string &s) { push_back(s); }
87
88 TokenSequence &operator=(const TokenSequence &that) {
89 clear();
90 Append(that);
91 return *this;
92 }
peter klausler90cd9ba2018-01-30 19:54:3193 TokenSequence &operator=(TokenSequence &&that) {
94 start_ = std::move(that.start_);
95 nextStart_ = that.nextStart_;
96 char_ = std::move(that.char_);
97 return *this;
98 }
99
peter klauslerad7125f2018-02-01 23:01:23100 CharPointerWithLength operator[](size_t token) const {
peter klausler55fe4d22018-02-02 23:52:43101 return {&char_[start_[token]],
peter klausler16c6f532018-02-05 22:29:26102 (token + 1 >= start_.size() ? char_.size() : start_[token + 1]) -
103 start_[token]};
peter klausler90cd9ba2018-01-30 19:54:31104 }
105
peter klausler16c6f532018-02-05 22:29:26106 void AddChar(char ch) { char_.emplace_back(ch); }
peter klausler6f94e842018-01-30 23:22:26107
peter klausler90cd9ba2018-01-30 19:54:31108 void EndToken() {
109 // CHECK(char_.size() > nextStart_);
110 start_.emplace_back(nextStart_);
111 nextStart_ = char_.size();
112 }
113
peter klausler6f94e842018-01-30 23:22:26114 void ReopenLastToken() {
115 nextStart_ = start_.back();
116 start_.pop_back();
117 }
118
peter klausler90cd9ba2018-01-30 19:54:31119 void Append(const TokenSequence &);
peter klausler55fe4d22018-02-02 23:52:43120 void EmitWithCaseConversion(CharBuffer *) const;
121 std::string ToString() const;
peter klausler90cd9ba2018-01-30 19:54:31122
123 bool empty() const { return start_.empty(); }
peter klausler90cd9ba2018-01-30 19:54:31124 size_t size() const { return start_.size(); }
peter klausler6f94e842018-01-30 23:22:26125 const char *data() const { return &char_[0]; }
peter klauslerbe830d62018-02-05 20:48:09126 void clear();
127 void push_back(const char *, size_t);
128 void push_back(const CharPointerWithLength &);
129 void push_back(const std::string &);
130 void push_back(const std::stringstream &);
131 void pop_back();
132 void shrink_to_fit();
peter klausler90cd9ba2018-01-30 19:54:31133
peter klauslerbdea10d2018-02-05 20:54:36134private:
peter klausler90cd9ba2018-01-30 19:54:31135 std::vector<int> start_;
136 size_t nextStart_{0};
137 std::vector<char> char_;
138};
139
140// Defines a macro
141class Definition {
peter klauslerbdea10d2018-02-05 20:54:36142public:
peter klausler90cd9ba2018-01-30 19:54:31143 Definition(const TokenSequence &, size_t firstToken, size_t tokens);
144 Definition(const std::vector<std::string> &argNames, const TokenSequence &,
peter klausler16c6f532018-02-05 22:29:26145 size_t firstToken, size_t tokens, bool isVariadic = false);
peter klauslerad7125f2018-02-01 23:01:23146 explicit Definition(const std::string &predefined);
peter klausler90cd9ba2018-01-30 19:54:31147
148 bool isFunctionLike() const { return isFunctionLike_; }
149 size_t argumentCount() const { return argumentCount_; }
150 bool isVariadic() const { return isVariadic_; }
151 bool isDisabled() const { return isDisabled_; }
peter klauslerad7125f2018-02-01 23:01:23152 bool isPredefined() const { return isPredefined_; }
peter klausler90cd9ba2018-01-30 19:54:31153 const TokenSequence &replacement() const { return replacement_; }
154
155 bool set_isDisabled(bool disable);
156
157 TokenSequence Apply(const std::vector<TokenSequence> &args);
158
peter klauslerbdea10d2018-02-05 20:54:36159private:
peter klausler90cd9ba2018-01-30 19:54:31160 static TokenSequence Tokenize(const std::vector<std::string> &argNames,
peter klausler16c6f532018-02-05 22:29:26161 const TokenSequence &token, size_t firstToken, size_t tokens);
peter klausler90cd9ba2018-01-30 19:54:31162
163 bool isFunctionLike_{false};
164 size_t argumentCount_{0};
165 bool isVariadic_{false};
166 bool isDisabled_{false};
peter klauslerad7125f2018-02-01 23:01:23167 bool isPredefined_{false};
peter klausler90cd9ba2018-01-30 19:54:31168 TokenSequence replacement_;
169};
170
171// Preprocessing state
172class Preprocessor {
peter klauslerbdea10d2018-02-05 20:54:36173public:
peter klauslerad7125f2018-02-01 23:01:23174 explicit Preprocessor(Prescanner &);
peter klausler90cd9ba2018-01-30 19:54:31175
176 // When the input contains macros to be replaced, the new token sequence
177 // is appended to the output and the returned value is true. When
178 // no macro replacement is necessary, the output is unmodified and the
179 // return value is false.
180 bool MacroReplacement(const TokenSequence &, TokenSequence *);
181
peter klausler55fe4d22018-02-02 23:52:43182 // Implements a preprocessor directive; returns true when no fatal error.
183 bool Directive(const TokenSequence &);
peter klausler90cd9ba2018-01-30 19:54:31184
peter klauslerbdea10d2018-02-05 20:54:36185private:
peter klausler93cf3ae2018-02-01 20:08:02186 enum class IsElseActive { No, Yes };
187 enum class CanDeadElseAppear { No, Yes };
peter klauslerad7125f2018-02-01 23:01:23188
peter klausler55fe4d22018-02-02 23:52:43189 void Complain(const std::string &);
peter klauslerad7125f2018-02-01 23:01:23190 CharPointerWithLength SaveToken(const CharPointerWithLength &);
peter klausler93cf3ae2018-02-01 20:08:02191 bool IsNameDefined(const CharPointerWithLength &);
peter klauslerad7125f2018-02-01 23:01:23192 TokenSequence ReplaceMacros(const TokenSequence &);
peter klausler55fe4d22018-02-02 23:52:43193 bool SkipDisabledConditionalCode(const std::string &dirName, IsElseActive);
peter klausler16c6f532018-02-05 22:29:26194 bool IsIfPredicateTrue(
195 const TokenSequence &expr, size_t first, size_t exprTokens);
peter klausler93cf3ae2018-02-01 20:08:02196
peter klauslerad7125f2018-02-01 23:01:23197 Prescanner &prescanner_;
peter klausler90cd9ba2018-01-30 19:54:31198 std::list<std::string> names_;
199 std::unordered_map<CharPointerWithLength, Definition> definitions_;
peter klausler93cf3ae2018-02-01 20:08:02200 std::stack<CanDeadElseAppear> ifStack_;
peter klausler90cd9ba2018-01-30 19:54:31201};
202} // namespace Fortran
203#endif // FORTRAN_PREPROCESSOR_H_