[runtime] Support Proxy setPrototypeOf trap

src/parsing/token.h

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef V8_PARSING_TOKEN_H_
 #define V8_PARSING_TOKEN_H_
 
 #include "src/base/logging.h"
 #include "src/globals.h"
 
@@ skipping 156 matching lines @@
   T(WHITESPACE, NULL, 0)                                             \
   T(UNINITIALIZED, NULL, 0)                                          \
                                                                      \
   /* ES6 Template Literals */                                        \
   T(TEMPLATE_SPAN, NULL, 0)                                          \
   T(TEMPLATE_TAIL, NULL, 0)
 
 
 class Token {
  public:
-  // All token values.
+// All token values.
 #define T(name, string, precedence) name,
-  enum Value {
-    TOKEN_LIST(T, T)
-    NUM_TOKENS
-  };
+  enum Value { TOKEN_LIST(T, T) NUM_TOKENS };
 #undef T
 
   // Returns a string corresponding to the C++ token name
   // (e.g. "LT" for the token LT).
   static const char* Name(Value tok) {
     DCHECK(tok < NUM_TOKENS);  // tok is unsigned
     return name_[tok];
   }
 
   // Predicates
-  static bool IsKeyword(Value tok) {
-    return token_type[tok] == 'K';
-  }
+  static bool IsKeyword(Value tok) { return token_type[tok] == 'K'; }
 
   static bool IsIdentifier(Value tok, LanguageMode language_mode,
                            bool is_generator) {
     switch (tok) {
       case IDENTIFIER:
         return true;
       case ESCAPED_STRICT_RESERVED_WORD:
       case FUTURE_STRICT_RESERVED_WORD:
       case LET:
       case STATIC:
         return is_sloppy(language_mode);
       case YIELD:
         return !is_generator && is_sloppy(language_mode);
       default:
         return false;
     }
     UNREACHABLE();
     return false;
   }
 
   static bool IsAssignmentOp(Value tok) {
     return INIT <= tok && tok <= ASSIGN_MOD;
   }
 
-  static bool IsBinaryOp(Value op) {
-    return COMMA <= op && op <= MOD;
-  }
+  static bool IsBinaryOp(Value op) { return COMMA <= op && op <= MOD; }
 
   static bool IsTruncatingBinaryOp(Value op) {
     return BIT_OR <= op && op <= ROR;
   }
 
-  static bool IsCompareOp(Value op) {
-    return EQ <= op && op <= IN;
-  }
+  static bool IsCompareOp(Value op) { return EQ <= op && op <= IN; }
 
   static bool IsOrderedRelationalCompareOp(Value op) {
     return op == LT || op == LTE || op == GT || op == GTE;
   }
 
-  static bool IsEqualityOp(Value op) {
-    return op == EQ || op == EQ_STRICT;
-  }
+  static bool IsEqualityOp(Value op) { return op == EQ || op == EQ_STRICT; }
 
-  static bool IsInequalityOp(Value op) {
-    return op == NE || op == NE_STRICT;
-  }
+  static bool IsInequalityOp(Value op) { return op == NE || op == NE_STRICT; }
 
   static bool IsArithmeticCompareOp(Value op) {
-    return IsOrderedRelationalCompareOp(op) ||
-        IsEqualityOp(op) || IsInequalityOp(op);
+    return IsOrderedRelationalCompareOp(op) || IsEqualityOp(op) ||
+           IsInequalityOp(op);
   }
 
   static Value NegateCompareOp(Value op) {
     DCHECK(IsArithmeticCompareOp(op));
     switch (op) {
-      case EQ: return NE;
-      case NE: return EQ;
-      case EQ_STRICT: return NE_STRICT;
-      case NE_STRICT: return EQ_STRICT;
-      case LT: return GTE;
-      case GT: return LTE;
-      case LTE: return GT;
-      case GTE: return LT;
+      case EQ:
+        return NE;
+      case NE:
+        return EQ;
+      case EQ_STRICT:
+        return NE_STRICT;
+      case NE_STRICT:
+        return EQ_STRICT;
+      case LT:
+        return GTE;
+      case GT:
+        return LTE;
+      case LTE:
+        return GT;
+      case GTE:
+        return LT;
       default:
         UNREACHABLE();
         return op;
     }
   }
 
   static Value ReverseCompareOp(Value op) {
     DCHECK(IsArithmeticCompareOp(op));
     switch (op) {
-      case EQ: return EQ;
-      case NE: return NE;
-      case EQ_STRICT: return EQ_STRICT;
-      case NE_STRICT: return NE_STRICT;
-      case LT: return GT;
-      case GT: return LT;
-      case LTE: return GTE;
-      case GTE: return LTE;
+      case EQ:
+        return EQ;
+      case NE:
+        return NE;
+      case EQ_STRICT:
+        return EQ_STRICT;
+      case NE_STRICT:
+        return NE_STRICT;
+      case LT:
+        return GT;
+      case GT:
+        return LT;
+      case LTE:
+        return GTE;
+      case GTE:
+        return LTE;
       default:
         UNREACHABLE();
         return op;
     }
   }
 
   static bool IsBitOp(Value op) {
     return (BIT_OR <= op && op <= SHR) || op == BIT_NOT;
   }
 
   static bool IsUnaryOp(Value op) {
     return (NOT <= op && op <= VOID) || op == ADD || op == SUB;
   }
 
-  static bool IsCountOp(Value op) {
-    return op == INC || op == DEC;
-  }
+  static bool IsCountOp(Value op) { return op == INC || op == DEC; }
 
-  static bool IsShiftOp(Value op) {
-    return (SHL <= op) && (op <= SHR);
-  }
+  static bool IsShiftOp(Value op) { return (SHL <= op) && (op <= SHR); }
 
   // Returns a string corresponding to the JS token string
   // (.e., "<" for the token LT) or NULL if the token doesn't
   // have a (unique) string (e.g. an IDENTIFIER).
   static const char* String(Value tok) {
     DCHECK(tok < NUM_TOKENS);  // tok is unsigned.
     return string_[tok];
   }
 
   // Returns the precedence > 0 for binary and compare
   // operators; returns 0 otherwise.
   static int Precedence(Value tok) {
     DCHECK(tok < NUM_TOKENS);  // tok is unsigned.
     return precedence_[tok];
   }
 
  private:
   static const char* const name_[NUM_TOKENS];
   static const char* const string_[NUM_TOKENS];
   static const int8_t precedence_[NUM_TOKENS];
   static const char token_type[NUM_TOKENS];
 };
 
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_PARSING_TOKEN_H_