Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(849)

Unified Diff: src/objects.h

Issue 1435643002: Make gen-postmortem-metadata.py more reliable (Closed) Base URL: https://chromium.googlesource.com/v8/v8.git@master
Patch Set: Created 5 years, 1 month ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
« no previous file with comments | « AUTHORS ('k') | tools/gen-postmortem-metadata.py » ('j') | no next file with comments »
Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
Index: src/objects.h
diff --git a/src/objects.h b/src/objects.h
index c2421d019efcf51a71de4167346edb0f305fda2c..8b7745e31b7f95ebac5f30fb3dc265fd5b95b08e 100644
--- a/src/objects.h
+++ b/src/objects.h
@@ -1009,7 +1009,7 @@ template <class C> inline bool Is(Object* obj);
// allocation of the C++ vtable.
// Since both Smi and HeapObject are subclasses of Object no
// data members can be present in Object.
-class Object {
+class Object { /* POSTMORTEM */
public:
// Type testing.
bool IsObject() const { return true; }
@@ -1418,7 +1418,7 @@ std::ostream& operator<<(std::ostream& os, const Brief& v);
// For long smis it has the following format:
// [32 bit signed int] [31 bits zero padding] 0
// Smi stands for small integer.
-class Smi: public Object {
+class Smi: public Object { /* POSTMORTEM */
public:
// Returns the integer value.
inline int value() const { return Internals::SmiValue(this); }
@@ -1513,7 +1513,7 @@ enum class HeapObjectContents { kTaggedValues, kMixedValues, kRawValues };
// HeapObject is the superclass for all classes describing heap allocated
// objects.
-class HeapObject: public Object {
+class HeapObject: public Object { /* POSTMORTEM */
public:
// [map]: Contains a map which contains the object's reflective
// information.
@@ -1638,7 +1638,7 @@ class HeapObject: public Object {
// This is the base class for object's body descriptors.
-class BodyDescriptorBase {
+class BodyDescriptorBase { /* POSTMORTEM */
Jakob Kummerow 2015/11/10 15:12:12 really?
protected:
static inline void IterateBodyImpl(HeapObject* obj, int start_offset,
int end_offset, ObjectVisitor* v);
@@ -1702,7 +1702,7 @@ class FlexibleBodyDescriptor : public FlexibleBodyDescriptorBase<start_offset> {
// The HeapNumber class describes heap allocated numbers that cannot be
// represented in a Smi (small integer)
-class HeapNumber: public HeapObject {
+class HeapNumber: public HeapObject { /* POSTMORTEM */
public:
// [value]: number value.
inline double value() const;
@@ -1839,7 +1839,7 @@ enum GetKeysConversion { KEEP_NUMBERS, CONVERT_TO_STRING };
// JSReceiver includes types on which properties can be defined, i.e.,
// JSObject and JSProxy.
-class JSReceiver: public HeapObject {
+class JSReceiver: public HeapObject { /* POSTMORTEM */
public:
DECLARE_CAST(JSReceiver)
@@ -1970,7 +1970,7 @@ class JSReceiver: public HeapObject {
// properties.
// Note that the map of JSObject changes during execution to enable inline
// caching.
-class JSObject: public JSReceiver {
+class JSObject: public JSReceiver { /* POSTMORTEM */
public:
// [properties]: Backing storage for properties.
// properties is a FixedArray in the fast case and a Dictionary in the
@@ -2140,7 +2140,7 @@ class JSObject: public JSReceiver {
static void InvalidatePrototypeChains(Map* map);
// Alternative implementation of WeakFixedArray::NullCallback.
- class PrototypeRegistryCompactionCallback {
+ class PrototypeRegistryCompactionCallback { /* POSTMORTEM */
Jakob Kummerow 2015/11/10 15:12:12 really?
public:
static void Callback(Object* value, int old_index, int new_index);
};
@@ -2435,7 +2435,7 @@ class JSObject: public JSReceiver {
#ifdef DEBUG
// Structure for collecting spill information about JSObjects.
- class SpillInformation {
+ class SpillInformation { /* POSTMORTEM */
Jakob Kummerow 2015/11/10 15:12:12 really?
public:
void Clear();
void Print();
@@ -2586,7 +2586,7 @@ class JSObject: public JSReceiver {
// Common superclass for FixedArrays that allow implementations to share
// common accessors and some code paths.
-class FixedArrayBase: public HeapObject {
+class FixedArrayBase: public HeapObject { /* POSTMORTEM */
public:
// [length]: length of the array.
inline int length() const;
@@ -2610,7 +2610,7 @@ class IncrementalMarking;
// FixedArray describes fixed-sized arrays with element type Object*.
-class FixedArray: public FixedArrayBase {
+class FixedArray: public FixedArrayBase { /* POSTMORTEM */
public:
// Setter and getter for elements.
inline Object* get(int index) const;
@@ -2706,7 +2706,7 @@ class FixedArray: public FixedArrayBase {
// FixedDoubleArray describes fixed-sized arrays with element type double.
-class FixedDoubleArray: public FixedArrayBase {
+class FixedDoubleArray: public FixedArrayBase { /* POSTMORTEM */
public:
// Setter and getter for elements.
inline double get_scalar(int index);
@@ -2749,7 +2749,7 @@ class FixedDoubleArray: public FixedArrayBase {
};
-class WeakFixedArray : public FixedArray {
+class WeakFixedArray : public FixedArray { /* POSTMORTEM */
public:
// If |maybe_array| is not a WeakFixedArray, a fresh one will be allocated.
// This function does not check if the value exists already, callers must
@@ -2761,7 +2761,7 @@ class WeakFixedArray : public FixedArray {
// Returns true if an entry was found and removed.
bool Remove(Handle<HeapObject> value);
- class NullCallback {
+ class NullCallback { /* POSTMORTEM */
Jakob Kummerow 2015/11/10 15:12:11 really?
public:
static void Callback(Object* value, int old_index, int new_index) {}
};
@@ -2776,7 +2776,7 @@ class WeakFixedArray : public FixedArray {
inline bool IsEmptySlot(int index) const;
static Object* Empty() { return Smi::FromInt(0); }
- class Iterator {
+ class Iterator { /* POSTMORTEM */
Jakob Kummerow 2015/11/10 15:12:12 really?
public:
explicit Iterator(Object* maybe_array) : list_(NULL) { Reset(maybe_array); }
void Reset(Object* maybe_array);
@@ -2819,7 +2819,7 @@ class WeakFixedArray : public FixedArray {
// Generic array grows dynamically with O(1) amortized insertion.
-class ArrayList : public FixedArray {
+class ArrayList : public FixedArray { /* POSTMORTEM */
public:
enum AddMode {
kNone,
@@ -2854,7 +2854,7 @@ class ArrayList : public FixedArray {
// [1]: either Smi(0) or pointer to fixed array with indices
// [2]: first key
// [2 + number of descriptors * kDescriptorSize]: start of slack
-class DescriptorArray: public FixedArray {
+class DescriptorArray: public FixedArray { /* POSTMORTEM */
public:
// Returns true for both shared empty_descriptor_array and for smis, which the
// map uses to encode additional bit fields when the descriptor array is not
@@ -3014,7 +3014,7 @@ class DescriptorArray: public FixedArray {
// witness, incremental marking is globally disabled. The witness is then
// passed along wherever needed to statically prove that the array is known to
// be white.
- class WhitenessWitness {
+ class WhitenessWitness { /* POSTMORTEM */
Jakob Kummerow 2015/11/10 15:12:11 really?
public:
inline explicit WhitenessWitness(DescriptorArray* array);
inline ~WhitenessWitness();
@@ -3024,7 +3024,7 @@ class DescriptorArray: public FixedArray {
};
// An entry in a DescriptorArray, represented as an (array, index) pair.
- class Entry {
+ class Entry { /* POSTMORTEM */
Jakob Kummerow 2015/11/10 15:12:12 really?
public:
inline explicit Entry(DescriptorArray* descs, int index) :
descs_(descs), index_(index) { }
@@ -3112,7 +3112,7 @@ inline int Search(T* array, Name* name, int valid_entries = 0,
// information by subclasses.
template<typename Key>
-class BaseShape {
+class BaseShape { /* POSTMORTEM */
Jakob Kummerow 2015/11/10 15:12:11 really?
public:
static const bool UsesSeed = false;
static uint32_t Hash(Key key) { return 0; }
@@ -3128,7 +3128,7 @@ class BaseShape {
};
-class HashTableBase : public FixedArray {
+class HashTableBase : public FixedArray { /* POSTMORTEM */
public:
// Returns the number of elements in the hash table.
inline int NumberOfElements();
@@ -3194,7 +3194,7 @@ class HashTableBase : public FixedArray {
template <typename Derived, typename Shape, typename Key>
-class HashTable : public HashTableBase {
+class HashTable : public HashTableBase { /* POSTMORTEM */
public:
// Wrapper methods
inline uint32_t Hash(Key key) {
@@ -3295,7 +3295,7 @@ class HashTable : public HashTableBase {
// HashTableKey is an abstract superclass for virtual key behavior.
-class HashTableKey {
+class HashTableKey { /* POSTMORTEM */
Jakob Kummerow 2015/11/10 15:12:12 really?
public:
// Returns whether the other object matches this key.
virtual bool IsMatch(Object* other) = 0;
@@ -3338,7 +3338,7 @@ class SeqOneByteString;
// because only the string itself (the key) needs to be stored.
class StringTable: public HashTable<StringTable,
StringTableShape,
- HashTableKey*> {
+ HashTableKey*> { /* POSTMORTEM */
public:
// Find string in the string table. If it is not there yet, it is
// added. The return value is the string found.
@@ -3375,7 +3375,7 @@ class StringTable: public HashTable<StringTable,
template <typename Derived, typename Shape, typename Key>
-class Dictionary: public HashTable<Derived, Shape, Key> {
+class Dictionary: public HashTable<Derived, Shape, Key> { /* POSTMORTEM */
typedef HashTable<Derived, Shape, Key> DerivedHashTable;
public:
@@ -3802,7 +3802,7 @@ class ObjectHashTable: public HashTable<ObjectHashTable,
// [3 + NumberOfRemovedHoles()..length]: Not used
//
template<class Derived, class Iterator, int entrysize>
-class OrderedHashTable: public FixedArray {
+class OrderedHashTable: public FixedArray { /* POSTMORTEM */
public:
// Returns an OrderedHashTable with a capacity of at least |capacity|.
static Handle<Derived> Allocate(
@@ -4332,7 +4332,7 @@ class NormalizedMapCache: public FixedArray {
// ByteArray represents fixed sized byte arrays. Used for the relocation info
// that is attached to code objects.
-class ByteArray: public FixedArrayBase {
+class ByteArray: public FixedArrayBase { /* POSTMORTEM */
public:
inline int Size();
@@ -4444,7 +4444,7 @@ class BytecodeArray : public FixedArrayBase {
// the heap remains iterable. They have a size and a next pointer.
// The next pointer is the raw address of the next FreeSpace object (or NULL)
// in the free list.
-class FreeSpace: public HeapObject {
+class FreeSpace: public HeapObject { /* POSTMORTEM */
public:
// [size]: size of the free space including the header.
inline int size() const;
@@ -4830,7 +4830,7 @@ class HandlerTable : public FixedArray {
// Code describes objects with on-the-fly generated machine code.
-class Code: public HeapObject {
+class Code: public HeapObject { /* POSTMORTEM */
public:
// Opaque data type for encapsulating code flags like kind, inline
// cache state, and arguments count.
@@ -5505,7 +5505,7 @@ class PrototypeInfo;
// A Map contains information about:
// - Size information about the object
// - How to iterate over an object (for garbage collection)
-class Map: public HeapObject {
+class Map: public HeapObject { /* POSTMORTEM */
public:
// Instance size.
// Size in bytes or kVariableSizeSentinel if instances do not have
@@ -6269,7 +6269,7 @@ class SloppyBlockWithEvalContextExtension : public Struct {
// Script describes a script which has been added to the VM.
-class Script: public Struct {
+class Script: public Struct { /* POSTMORTEM */
public:
// Script types.
enum Type {
@@ -6505,7 +6505,7 @@ struct CodeAndLiterals {
// SharedFunctionInfo describes the JSFunction information that can be
// shared by multiple instances of the function.
-class SharedFunctionInfo: public HeapObject {
+class SharedFunctionInfo: public HeapObject { /* POSTMORTEM */
public:
// [name]: Function name.
DECL_ACCESSORS(name, Object)
@@ -7171,7 +7171,7 @@ struct SourceCodeOf {
std::ostream& operator<<(std::ostream& os, const SourceCodeOf& v);
-class JSGeneratorObject: public JSObject {
+class JSGeneratorObject: public JSObject { /* POSTMORTEM */
public:
// [function]: The function corresponding to this generator object.
DECL_ACCESSORS(function, JSFunction)
@@ -7223,7 +7223,7 @@ class JSGeneratorObject: public JSObject {
// Representation for module instance objects.
-class JSModule: public JSObject {
+class JSModule: public JSObject { /* POSTMORTEM */
public:
// [context]: the context holding the module's locals, or undefined if none.
DECL_ACCESSORS(context, Object)
@@ -7248,7 +7248,7 @@ class JSModule: public JSObject {
// JSFunction describes JavaScript functions.
-class JSFunction: public JSObject {
+class JSFunction: public JSObject { /* POSTMORTEM */
public:
// [prototype_or_initial_map]:
DECL_ACCESSORS(prototype_or_initial_map, Object)
@@ -7477,7 +7477,7 @@ class JSGlobalProxy : public JSObject {
// JavaScript global object.
-class JSGlobalObject : public JSObject {
+class JSGlobalObject : public JSObject { /* POSTMORTEM */
public:
// [native context]: the natives corresponding to this global object.
DECL_ACCESSORS(native_context, Context)
@@ -7512,7 +7512,7 @@ class JSGlobalObject : public JSObject {
// Representation for JS Wrapper objects, String, Number, Boolean, etc.
-class JSValue: public JSObject {
+class JSValue: public JSObject { /* POSTMORTEM */
public:
// [value]: the object being wrapped.
DECL_ACCESSORS(value, Object)
@@ -7535,7 +7535,7 @@ class JSValue: public JSObject {
class DateCache;
// Representation for JS date objects.
-class JSDate: public JSObject {
+class JSDate: public JSObject { /* POSTMORTEM */
public:
// If one component is NaN, all of them are, indicating a NaN time value.
// [value]: the time value.
@@ -7634,7 +7634,7 @@ class JSDate: public JSObject {
// error messages are not directly accessible from JavaScript to
// prevent leaking information to user code called during error
// formatting.
-class JSMessageObject: public JSObject {
+class JSMessageObject: public JSObject { /* POSTMORTEM */
public:
// [type]: the type of error message.
inline int type() const;
@@ -7694,7 +7694,7 @@ class JSMessageObject: public JSObject {
// used for tracking the last usage (used for code flushing)..
// - max number of registers used by irregexp implementations.
// - number of capture registers (output values) of the regexp.
-class JSRegExp: public JSObject {
+class JSRegExp: public JSObject { /* POSTMORTEM */
public:
// Meaning of Type:
// NOT_COMPILED: Initial value. No data has been stored in the JSRegExp yet.
@@ -7892,7 +7892,7 @@ class CompilationCacheTable: public HashTable<CompilationCacheTable,
};
-class CodeCache: public Struct {
+class CodeCache: public Struct { /* POSTMORTEM */
public:
DECL_ACCESSORS(default_cache, FixedArray)
DECL_ACCESSORS(normal_type_cache, Object)
@@ -7987,7 +7987,7 @@ class CodeCacheHashTable: public HashTable<CodeCacheHashTable,
};
-class PolymorphicCodeCache: public Struct {
+class PolymorphicCodeCache: public Struct { /* POSTMORTEM */
public:
DECL_ACCESSORS(cache, Object)
@@ -8035,7 +8035,7 @@ class PolymorphicCodeCacheHashTable
};
-class TypeFeedbackInfo: public Struct {
+class TypeFeedbackInfo: public Struct { /* POSTMORTEM */
public:
inline int ic_total_count();
inline void set_ic_total_count(int count);
@@ -8090,7 +8090,7 @@ enum AllocationSiteMode {
};
-class AllocationSite: public Struct {
+class AllocationSite: public Struct { /* POSTMORTEM */
public:
static const uint32_t kMaximumArrayBytesToPretransition = 8 * 1024;
static const double kPretenureRatio;
@@ -8219,7 +8219,7 @@ class AllocationSite: public Struct {
};
-class AllocationMemento: public Struct {
+class AllocationMemento: public Struct { /* POSTMORTEM */
public:
static const int kAllocationSiteOffset = HeapObject::kHeaderSize;
static const int kSize = kAllocationSiteOffset + kPointerSize;
@@ -8247,7 +8247,7 @@ class AllocationMemento: public Struct {
// - the parameter map contains no fast alias mapping (i.e. the hole)
// - this struct (in the slow backing store) contains an index into the context
// - all attributes are available as part if the property details
-class AliasedArgumentsEntry: public Struct {
+class AliasedArgumentsEntry: public Struct { /* POSTMORTEM */
public:
inline int aliased_context_slot() const;
inline void set_aliased_context_slot(int count);
@@ -8951,7 +8951,7 @@ class SeqString: public String {
// The OneByteString class captures sequential one-byte string objects.
// Each character in the OneByteString is an one-byte character.
-class SeqOneByteString: public SeqString {
+class SeqOneByteString: public SeqString { /* POSTMORTEM */
public:
static const bool kHasOneByteEncoding = true;
@@ -8987,7 +8987,7 @@ class SeqOneByteString: public SeqString {
// The TwoByteString class captures sequential unicode string objects.
// Each character in the TwoByteString is a two-byte uint16_t.
-class SeqTwoByteString: public SeqString {
+class SeqTwoByteString: public SeqString { /* POSTMORTEM */
public:
static const bool kHasOneByteEncoding = false;
@@ -9033,7 +9033,7 @@ class SeqTwoByteString: public SeqString {
// are non-ConsString string values. The string value represented by
// a ConsString can be obtained by concatenating the leaf string
// values in a left-to-right depth-first traversal of the tree.
-class ConsString: public String {
+class ConsString: public String { /* POSTMORTEM */
public:
// First string of the cons cell.
inline String* first();
@@ -9086,7 +9086,7 @@ class ConsString: public String {
// - handling externalized parent strings
// - external strings as parent
// - truncating sliced string to enable otherwise unneeded parent to be GC'ed.
-class SlicedString: public String {
+class SlicedString: public String { /* POSTMORTEM */
public:
inline String* parent();
inline void set_parent(String* parent,
@@ -9127,7 +9127,7 @@ class SlicedString: public String {
//
// The API expects that all ExternalStrings are created through the
// API. Therefore, ExternalStrings should not be used internally.
-class ExternalString: public String {
+class ExternalString: public String { /* POSTMORTEM */
public:
DECLARE_CAST(ExternalString)
@@ -9188,7 +9188,7 @@ class ExternalOneByteString : public ExternalString {
// The ExternalTwoByteString class is an external string backed by a UTF-16
// encoded string.
-class ExternalTwoByteString: public ExternalString {
+class ExternalTwoByteString: public ExternalString { /* POSTMORTEM */
public:
static const bool kHasOneByteEncoding = false;
@@ -9355,7 +9355,7 @@ class VectorIterator {
// The Oddball describes objects null, undefined, true, and false.
-class Oddball: public HeapObject {
+class Oddball: public HeapObject { /* POSTMORTEM */
public:
// [to_string]: Cached to_string computed at startup.
DECL_ACCESSORS(to_string, String)
@@ -9412,7 +9412,7 @@ class Oddball: public HeapObject {
};
-class Cell: public HeapObject {
+class Cell: public HeapObject { /* POSTMORTEM */
public:
// [value]: value of the cell.
DECL_ACCESSORS(value, Object)
@@ -9534,7 +9534,7 @@ class WeakCell : public HeapObject {
// The JSProxy describes EcmaScript Harmony proxies
-class JSProxy: public JSReceiver {
+class JSProxy: public JSReceiver { /* POSTMORTEM */
public:
// [handler]: The handler property.
DECL_ACCESSORS(handler, Object)
@@ -9619,7 +9619,7 @@ class JSProxy: public JSReceiver {
};
-class JSFunctionProxy: public JSProxy {
+class JSFunctionProxy: public JSProxy { /* POSTMORTEM */
public:
// [call_trap]: The call trap.
DECL_ACCESSORS(call_trap, JSReceiver)
@@ -9651,7 +9651,7 @@ class JSFunctionProxy: public JSProxy {
};
-class JSCollection : public JSObject {
+class JSCollection : public JSObject { /* POSTMORTEM */
public:
// [table]: the backing hash table
DECL_ACCESSORS(table, Object)
@@ -9665,7 +9665,7 @@ class JSCollection : public JSObject {
// The JSSet describes EcmaScript Harmony sets
-class JSSet : public JSCollection {
+class JSSet : public JSCollection { /* POSTMORTEM */
public:
DECLARE_CAST(JSSet)
@@ -9682,7 +9682,7 @@ class JSSet : public JSCollection {
// The JSMap describes EcmaScript Harmony maps
-class JSMap : public JSCollection {
+class JSMap : public JSCollection { /* POSTMORTEM */
public:
DECLARE_CAST(JSMap)
@@ -9839,7 +9839,7 @@ class JSIteratorResult final : public JSObject {
// Base class for both JSWeakMap and JSWeakSet
-class JSWeakCollection: public JSObject {
+class JSWeakCollection: public JSObject { /* POSTMORTEM */
public:
// [table]: the backing hash table mapping keys to values.
DECL_ACCESSORS(table, Object)
@@ -9863,7 +9863,7 @@ class JSWeakCollection: public JSObject {
// The JSWeakMap describes EcmaScript Harmony weak maps
-class JSWeakMap: public JSWeakCollection {
+class JSWeakMap: public JSWeakCollection { /* POSTMORTEM */
public:
DECLARE_CAST(JSWeakMap)
@@ -9877,7 +9877,7 @@ class JSWeakMap: public JSWeakCollection {
// The JSWeakSet describes EcmaScript Harmony weak sets
-class JSWeakSet: public JSWeakCollection {
+class JSWeakSet: public JSWeakCollection { /* POSTMORTEM */
public:
DECLARE_CAST(JSWeakSet)
@@ -9894,7 +9894,7 @@ class JSWeakSet: public JSWeakCollection {
enum class SharedFlag { kNotShared, kShared };
-class JSArrayBuffer: public JSObject {
+class JSArrayBuffer: public JSObject { /* POSTMORTEM */
public:
// [backing_store]: backing memory for this array
DECL_ACCESSORS(backing_store, void)
@@ -9968,7 +9968,7 @@ class JSArrayBuffer: public JSObject {
};
-class JSArrayBufferView: public JSObject {
+class JSArrayBufferView: public JSObject { /* POSTMORTEM */
public:
// [buffer]: ArrayBuffer that this typed array views.
DECL_ACCESSORS(buffer, Object)
@@ -10000,7 +10000,7 @@ class JSArrayBufferView: public JSObject {
};
-class JSTypedArray: public JSArrayBufferView {
+class JSTypedArray: public JSArrayBufferView { /* POSTMORTEM */
public:
// [length]: length of typed array in elements.
DECL_ACCESSORS(length, Object)
@@ -10034,7 +10034,7 @@ class JSTypedArray: public JSArrayBufferView {
};
-class JSDataView: public JSArrayBufferView {
+class JSDataView: public JSArrayBufferView { /* POSTMORTEM */
public:
DECLARE_CAST(JSDataView)
@@ -10053,7 +10053,7 @@ class JSDataView: public JSArrayBufferView {
// Foreign describes objects pointing from JavaScript to C structures.
-class Foreign: public HeapObject {
+class Foreign: public HeapObject { /* POSTMORTEM */
public:
// [address]: field containing the address.
inline Address foreign_address();
@@ -10088,7 +10088,7 @@ class Foreign: public HeapObject {
// - fast, backing storage is a FixedArray and length <= elements.length();
// Please note: push and pop can be used to grow and shrink the array.
// - slow, backing storage is a HashTable with numbers as keys.
-class JSArray: public JSObject {
+class JSArray: public JSObject { /* POSTMORTEM */
public:
// [length]: The length property.
DECL_ACCESSORS(length, Object)
@@ -10169,7 +10169,7 @@ Handle<Object> CacheInitialJSArrayMaps(Handle<Context> native_context,
// faster creation of RegExp exec results.
// This class just holds constants used when creating the result.
// After creation the result must be treated as a JSArray in all regards.
-class JSRegExpResult: public JSArray {
+class JSRegExpResult: public JSArray { /* POSTMORTEM */
public:
// Offsets of object fields.
static const int kIndexOffset = JSArray::kSize;
@@ -10245,7 +10245,7 @@ class AccessorInfo: public Struct {
// If the accessor in the prototype has the READ_ONLY property attribute, then
// a new value is added to the derived object when the property is set.
// This shadows the accessor in the prototype.
-class ExecutableAccessorInfo: public AccessorInfo {
+class ExecutableAccessorInfo: public AccessorInfo { /* POSTMORTEM */
public:
DECL_ACCESSORS(getter, Object)
DECL_ACCESSORS(setter, Object)
@@ -10275,7 +10275,7 @@ class ExecutableAccessorInfo: public AccessorInfo {
// * undefined: considered an accessor by the spec, too, strangely enough
// * the hole: an accessor which has not been set
// * a pointer to a map: a transition used to ensure map sharing
-class AccessorPair: public Struct {
+class AccessorPair: public Struct { /* POSTMORTEM */
public:
DECL_ACCESSORS(getter, Object)
DECL_ACCESSORS(setter, Object)
@@ -10318,7 +10318,7 @@ class AccessorPair: public Struct {
};
-class AccessCheckInfo: public Struct {
+class AccessCheckInfo: public Struct { /* POSTMORTEM */
public:
DECL_ACCESSORS(named_callback, Object)
DECL_ACCESSORS(indexed_callback, Object)
@@ -10342,7 +10342,7 @@ class AccessCheckInfo: public Struct {
};
-class InterceptorInfo: public Struct {
+class InterceptorInfo: public Struct { /* POSTMORTEM */
public:
DECL_ACCESSORS(getter, Object)
DECL_ACCESSORS(setter, Object)
@@ -10381,7 +10381,7 @@ class InterceptorInfo: public Struct {
};
-class CallHandlerInfo: public Struct {
+class CallHandlerInfo: public Struct { /* POSTMORTEM */
public:
DECL_ACCESSORS(callback, Object)
DECL_ACCESSORS(data, Object)
@@ -10425,7 +10425,7 @@ class TemplateInfo: public Struct {
};
-class FunctionTemplateInfo: public TemplateInfo {
+class FunctionTemplateInfo: public TemplateInfo { /* POSTMORTEM */
public:
DECL_ACCESSORS(serial_number, Object)
DECL_ACCESSORS(call_code, Object)
@@ -10505,7 +10505,7 @@ class FunctionTemplateInfo: public TemplateInfo {
};
-class ObjectTemplateInfo: public TemplateInfo {
+class ObjectTemplateInfo: public TemplateInfo { /* POSTMORTEM */
public:
DECL_ACCESSORS(constructor, Object)
DECL_ACCESSORS(internal_field_count, Object)
@@ -10523,7 +10523,7 @@ class ObjectTemplateInfo: public TemplateInfo {
};
-class TypeSwitchInfo: public Struct {
+class TypeSwitchInfo: public Struct { /* POSTMORTEM */
public:
DECL_ACCESSORS(types, Object)
@@ -10540,7 +10540,7 @@ class TypeSwitchInfo: public Struct {
// The DebugInfo class holds additional information for a function being
// debugged.
-class DebugInfo: public Struct {
+class DebugInfo: public Struct { /* POSTMORTEM */
public:
// The shared function info for the source being debugged.
DECL_ACCESSORS(shared, SharedFunctionInfo)
@@ -10596,7 +10596,7 @@ class DebugInfo: public Struct {
// The BreakPointInfo class holds information for break points set in a
// function. The DebugInfo object holds a BreakPointInfo object for each code
// position with one or more break points.
-class BreakPointInfo: public Struct {
+class BreakPointInfo: public Struct { /* POSTMORTEM */
public:
// The position in the code for the break point.
DECL_INT_ACCESSORS(code_position)
« no previous file with comments | « AUTHORS ('k') | tools/gen-postmortem-metadata.py » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698