Home
last modified time | relevance | path

Searched refs:camel_name (Results 1 – 6 of 6) sorted by relevance

/external/v8/src/heap/
Dheap.h767 #define ROOT_ACCESSOR(type, name, camel_name) \ argument
768 type* name() { return type::cast(roots_[k##camel_name##RootIndex]); } \
770 return reinterpret_cast<type*>(roots_[k##camel_name##RootIndex]); \
1055 #define ROOT_INDEX_DECLARATION(type, name, camel_name) k##camel_name##RootIndex, argument
1069 #define ROOT_INDEX_DECLARATION(type, name, camel_name) k##camel_name##RootIndex, argument
1492 #define ROOT_ACCESSOR(type, name, camel_name) \ argument
1496 DCHECK(k##camel_name##RootIndex >= kOldSpaceRoots || !InNewSpace(value)); \
1497 roots_[k##camel_name##RootIndex] = value; \
Dspaces.cc1833 #define INCREMENT(type, size, name, camel_name) \ in ReportHistogram() argument
1876 #define INCREMENT(type, size, name, camel_name) \ in DoReportStatistics() argument
Dheap.cc2341 #define STRING_TYPE_ELEMENT(type, size, name, camel_name) \ argument
2342 { type, size, k##camel_name##MapRootIndex } \
/external/v8/src/
Dd8.cc1481 #define ROOT_LIST_CASE(type, name, camel_name) \ in DumpHeapConstants() argument
1482 if (n == NULL && o == heap->name()) n = #camel_name; in DumpHeapConstants()
1483 #define STRUCT_LIST_CASE(upper_name, camel_name, name) \ in DumpHeapConstants() argument
1484 if (n == NULL && o == heap->name##_map()) n = #camel_name "Map"; in DumpHeapConstants()
1503 #define ROOT_LIST_CASE(type, name, camel_name) \ in DumpHeapConstants() argument
1504 if (n == NULL && o == heap->name()) n = #camel_name; in DumpHeapConstants()
Dfactory.h567 #define ROOT_ACCESSOR(type, name, camel_name) \ argument
570 &isolate()->heap()->roots_[Heap::k##camel_name##RootIndex])); \
Dheap-snapshot-generator.cc2158 #define ROOT_NAME(type, name, camel_name) NAME_ENTRY(name) in GetStrongGcSubrootName() argument