Lines Matching refs:Name
76 #define INT_ACCESSORS(holder, name, offset) \
77 int holder::name() const { return READ_INT_FIELD(this, offset); } \
78 void holder::set_##name(int value) { WRITE_INT_FIELD(this, offset, value); }
81 #define ACCESSORS(holder, name, type, offset) \
82 type* holder::name() const { return type::cast(READ_FIELD(this, offset)); } \
83 void holder::set_##name(type* value, WriteBarrierMode mode) { \
90 #define SMI_ACCESSORS(holder, name, offset) \
91 int holder::name() const { \
95 void holder::set_##name(int value) { \
99 #define SYNCHRONIZED_SMI_ACCESSORS(holder, name, offset) \
100 int holder::synchronized_##name() const { \
104 void holder::synchronized_set_##name(int value) { \
108 #define NOBARRIER_SMI_ACCESSORS(holder, name, offset) \
109 int holder::nobarrier_##name() const { \
113 void holder::nobarrier_set_##name(int value) { \
117 #define BOOL_GETTER(holder, field, name, offset) \
118 bool holder::name() const { \
123 #define BOOL_ACCESSORS(holder, field, name, offset) \
124 bool holder::name() const { \
127 void holder::set_##name(bool value) { \
292 return Name::cast(second)->AsArrayIndex(&index) && index == expected;
294 return Name::cast(first)->Equals(Name::cast(second));
1032 #define MAKE_STRUCT_CASE(NAME, Name, name) case NAME##_TYPE: return true;
1040 #define MAKE_STRUCT_PREDICATE(NAME, Name, name) \
1041 bool Object::Is##Name() const { \
1043 && HeapObject::cast(this)->map()->instance_type() == NAME##_TYPE; \
1162 bool Object::HasSpecificClassOf(String* name) {
1163 return this->IsJSObject() && (JSObject::cast(this)->class_name() == name);
1168 Handle<Name> name,
1170 LookupIterator it(object, name);
1207 const char* name,
1209 Handle<String> str = isolate->factory()->InternalizeUtf8String(name);
2714 int BinarySearch(T* array, Name* name, int low, int high, int valid_entries,
2717 uint32_t hash = name->Hash();
2724 Name* mid_name = array->GetSortedKey(mid);
2736 Name* entry = array->GetKey(sort_index);
2744 if (entry->Equals(name)) {
2760 int LinearSearch(T* array, Name* name, int len, int valid_entries,
2762 uint32_t hash = name->Hash();
2766 Name* entry = array->GetKey(sorted_index);
2772 if (current_hash == hash && entry->Equals(name)) return sorted_index;
2780 Name* entry = array->GetKey(number);
2782 if (current_hash == hash && entry->Equals(name)) return number;
2790 int Search(T* array, Name* name, int valid_entries, int* out_insertion_index) {
2809 return LinearSearch<search_mode>(array, name, nof, valid_entries,
2814 return BinarySearch<search_mode>(array, name, 0, nof - 1, valid_entries,
2819 int DescriptorArray::Search(Name* name, int valid_descriptors) {
2820 return internal::Search<VALID_ENTRIES>(this, name, valid_descriptors, NULL);
2824 int DescriptorArray::SearchWithCache(Name* name, Map* map) {
2829 int number = cache->Lookup(map, name);
2832 number = Search(name, number_of_own_descriptors);
2833 cache->Update(map, name, number);
2909 Name* DescriptorArray::GetKey(int descriptor_number) {
2911 return Name::cast(get(ToKeyIndex(descriptor_number)));
2920 Name* DescriptorArray::GetSortedKey(int descriptor_number) {
3046 Name* key = GetSortedKey(insertion - 1);
3242 CAST_ACCESSOR(Name)
3299 #define DEFINE_DEOPT_ELEMENT_ACCESSORS(name
3300 type* DeoptimizationInputData::name() { \
3301 return type::cast(get(k##name##Index)); \
3303 void DeoptimizationInputData::Set##name(type* value) { \
3304 set(k##name##Index, value); \
3319 #define DEFINE_DEOPT_ENTRY_ACCESSORS(name, type) \
3320 type* DeoptimizationInputData::name(int i) { \
3321 return type::cast(get(IndexForEntry(i) + k##name##Offset)); \
3323 void DeoptimizationInputData::Set##name(int i, type* value) { \
3324 set(IndexForEntry(i) + k##name##Offset, value); \
3458 #define MAKE_STRUCT_CAST(NAME, Name, name) CAST_ACCESSOR(Name)
3517 uint32_t Name::hash_field() {
3522 void Name::set_hash_field(uint32_t value) {
3534 bool Name::Equals(Name* other) {
3544 bool Name::Equals(Handle<Name> one, Handle<Name> two) {
3555 ACCESSORS(Symbol, name, Object, kNameOffset)
3587 Handle<Name> Name::Flatten(Handle<Name> name, PretenureFlag pretenure) {
3588 if (name->IsSymbol()) return name;
3589 return String::Flatten(Handle<String>::cast(name));
5101 #define CASE(name) case name: return true;
5456 ACCESSORS(JSBoundFunction, name, Object, kNameOffset)
5473 ACCESSORS(AccessorInfo, name, Object, kNameOffset)
5556 ACCESSORS(Script, name, Object, kNameOffset)
5612 ACCESSORS(SharedFunctionInfo, name, Object, kNameOffset)
5699 #define PSEUDO_SMI_ACCESSORS_LO(holder, name, offset) \
5701 int holder::name() const { \
5707 void holder::set_##name(int value) { \
5713 #define PSEUDO_SMI_ACCESSORS_HI(holder, name, offset) \
5715 INT_ACCESSORS(holder, name, offset)
6265 #define ORDERED_HASH_TABLE_ITERATOR_ACCESSORS(name, type, offset) \
6267 type* OrderedHashTableIterator<Derived, TableType>::name() const { \
6271 void OrderedHashTableIterator<Derived, TableType>::set_##name( \
6768 bool Name::IsHashFieldComputed(uint32_t field) {
6773 bool Name::HasHashCode() {
6778 uint32_t Name::Hash() {
6787 bool Name::IsPrivate() {
6937 bool Name::AsArrayIndex(uint32_t* index) {
7050 Handle<Name> name,
7053 LookupIterator::PropertyOrElement(name->GetIsolate(), object, name);
7059 Handle<Name> name,
7063 name->GetIsolate(), receiver, name, holder);
7094 Handle<Name> name) {
7096 LookupIterator::PropertyOrElement(object->GetIsolate(), object, name);
7102 Handle<Name> name) {
7105 object->GetIsolate(), object, name, LookupIterator::HIDDEN);
7110 JSReceiver::GetOwnPropertyAttributes(object, name);
7117 Handle<JSReceiver> object, Handle<Name> name) {
7119 LookupIterator::PropertyOrElement(name->GetIsolate(), object, name);
7125 Handle<JSReceiver> object, Handle<Name> name) {
7127 name->GetIsolate(), object, name, LookupIterator::HIDDEN);
7359 bool NameDictionaryShape::IsMatch(Handle<Name> key, Object* other) {
7362 if (key->Hash() != Name::cast(other)->Hash()) return false;
7363 return key->Equals(Name::cast(other));
7367 uint32_t NameDictionaryShape::Hash(Handle<Name> key) {
7372 uint32_t NameDictionaryShape::HashForObject(Handle<Name> key, Object* other) {
7373 return Name::cast(other)->Hash();
7378 Handle<Name> key) {
7496 #define SCOPE_INFO_FIELD_ACCESSORS(name) \
7497 void ScopeInfo::Set##name(int value) { set(k##name, Smi::FromInt(value)); } \
7498 int ScopeInfo::name() { \
7500 return Smi::cast(get(k##name))->value(); \
