1 files changed, 175 insertions, 1 deletions

diff --git a/deps/v8/src/torque/utils.h b/deps/v8/src/torque/utils.h
index 0612048589..16e3b03ed4 100644
--- a/deps/v8/src/torque/utils.h
+++ b/deps/v8/src/torque/utils.h
@@ -10,6 +10,7 @@
 #include <vector>
 
 #include "src/base/functional.h"
+#include "src/torque/contextual.h"
 
 namespace v8 {
 namespace internal {
@@ -20,7 +21,37 @@ typedef std::vector<std::string> NameVector;
 std::string StringLiteralUnquote(const std::string& s);
 std::string StringLiteralQuote(const std::string& s);
 
-[[noreturn]] void ReportError(const std::string& error);
+class LintErrorStatus : public ContextualClass<LintErrorStatus> {
+ public:
+  LintErrorStatus() : has_lint_errors_(false) {}
+
+  static bool HasLintErrors() { return Get().has_lint_errors_; }
+  static void SetLintError() { Get().has_lint_errors_ = true; }
+
+ private:
+  bool has_lint_errors_;
+};
+
+void LintError(const std::string& error);
+
+// Prints a LintError with the format "{type} '{name}' doesn't follow
+// '{convention}' naming convention".
+void NamingConventionError(const std::string& type, const std::string& name,
+                           const std::string& convention);
+
+bool IsLowerCamelCase(const std::string& s);
+bool IsUpperCamelCase(const std::string& s);
+bool IsSnakeCase(const std::string& s);
+bool IsValidModuleConstName(const std::string& s);
+bool IsValidTypeName(const std::string& s);
+
+[[noreturn]] void ReportErrorString(const std::string& error);
+template <class... Args>
+[[noreturn]] void ReportError(Args&&... args) {
+  std::stringstream s;
+  USE((s << std::forward<Args>(args))...);
+  ReportErrorString(s.str());
+}
 
 std::string CamelifyString(const std::string& underscore_string);
 std::string DashifyString(const std::string& underscore_string);
@@ -82,6 +113,149 @@ void PrintCommaSeparatedList(std::ostream& os, const T& list) {
   }
 }
 
+struct BottomOffset {
+  size_t offset;
+  BottomOffset& operator++() {
+    ++offset;
+    return *this;
+  }
+  BottomOffset operator+(size_t x) const { return BottomOffset{offset + x}; }
+  BottomOffset operator-(size_t x) const {
+    DCHECK_LE(x, offset);
+    return BottomOffset{offset - x};
+  }
+  bool operator<(const BottomOffset& other) const {
+    return offset < other.offset;
+  }
+  bool operator<=(const BottomOffset& other) const {
+    return offset <= other.offset;
+  }
+  bool operator==(const BottomOffset& other) const {
+    return offset == other.offset;
+  }
+  bool operator!=(const BottomOffset& other) const {
+    return offset != other.offset;
+  }
+};
+
+inline std::ostream& operator<<(std::ostream& out, BottomOffset from_bottom) {
+  return out << "BottomOffset{" << from_bottom.offset << "}";
+}
+
+// An iterator-style range of stack slots.
+class StackRange {
+ public:
+  StackRange(BottomOffset begin, BottomOffset end) : begin_(begin), end_(end) {
+    DCHECK_LE(begin_, end_);
+  }
+
+  bool operator==(const StackRange& other) const {
+    return begin_ == other.begin_ && end_ == other.end_;
+  }
+
+  void Extend(StackRange adjacent) {
+    DCHECK_EQ(end_, adjacent.begin_);
+    end_ = adjacent.end_;
+  }
+
+  size_t Size() const { return end_.offset - begin_.offset; }
+  BottomOffset begin() const { return begin_; }
+  BottomOffset end() const { return end_; }
+
+ private:
+  BottomOffset begin_;
+  BottomOffset end_;
+};
+
+template <class T>
+class Stack {
+ public:
+  using value_type = T;
+  Stack() = default;
+  Stack(std::initializer_list<T> initializer)
+      : Stack(std::vector<T>(initializer)) {}
+  explicit Stack(std::vector<T> v) : elements_(std::move(v)) {}
+  size_t Size() const { return elements_.size(); }
+  const T& Peek(BottomOffset from_bottom) const {
+    return elements_.at(from_bottom.offset);
+  }
+  void Poke(BottomOffset from_bottom, T x) {
+    elements_.at(from_bottom.offset) = std::move(x);
+  }
+  void Push(T x) { elements_.push_back(std::move(x)); }
+  StackRange TopRange(size_t slot_count) const {
+    DCHECK_GE(Size(), slot_count);
+    return StackRange{AboveTop() - slot_count, AboveTop()};
+  }
+  StackRange PushMany(const std::vector<T>& v) {
+    for (const T& x : v) {
+      Push(x);
+    }
+    return TopRange(v.size());
+  }
+  const T& Top() const { return Peek(AboveTop() - 1); }
+  T Pop() {
+    T result = std::move(elements_.back());
+    elements_.pop_back();
+    return result;
+  }
+  std::vector<T> PopMany(size_t count) {
+    DCHECK_GE(elements_.size(), count);
+    std::vector<T> result;
+    result.reserve(count);
+    for (auto it = elements_.end() - count; it != elements_.end(); ++it) {
+      result.push_back(std::move(*it));
+    }
+    elements_.resize(elements_.size() - count);
+    return result;
+  }
+  // The invalid offset above the top element. This is useful for StackRange.
+  BottomOffset AboveTop() const { return BottomOffset{Size()}; }
+  // Delete the slots in {range}, moving higher slots to fill the gap.
+  void DeleteRange(StackRange range) {
+    DCHECK_LE(range.end(), AboveTop());
+    for (BottomOffset i = range.begin();
+         i < std::min(range.end(), AboveTop() - range.Size()); ++i) {
+      elements_[i.offset] = std::move(elements_[i.offset + range.Size()]);
+    }
+    elements_.resize(elements_.size() - range.Size());
+  }
+
+  bool operator==(const Stack& other) const {
+    return elements_ == other.elements_;
+  }
+  bool operator!=(const Stack& other) const {
+    return elements_ != other.elements_;
+  }
+
+  T* begin() { return elements_.data(); }
+  T* end() { return begin() + elements_.size(); }
+  const T* begin() const { return elements_.data(); }
+  const T* end() const { return begin() + elements_.size(); }
+
+ private:
+  std::vector<T> elements_;
+};
+
+template <class T>
+T* CheckNotNull(T* x) {
+  CHECK_NOT_NULL(x);
+  return x;
+}
+
+class ToString {
+ public:
+  template <class T>
+  ToString& operator<<(T&& x) {
+    s_ << std::forward<T>(x);
+    return *this;
+  }
+  operator std::string() { return s_.str(); }
+
+ private:
+  std::stringstream s_;
+};
+
 }  // namespace torque
 }  // namespace internal
 }  // namespace v8