| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 4075 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 4086 } | 4086 } |
| 4087 | 4087 |
| 4088 // Copies enumerable keys to preallocated fixed array. | 4088 // Copies enumerable keys to preallocated fixed array. |
| 4089 void CopyEnumKeysTo(FixedArray* storage); | 4089 void CopyEnumKeysTo(FixedArray* storage); |
| 4090 static void DoGenerateNewEnumerationIndices( | 4090 static void DoGenerateNewEnumerationIndices( |
| 4091 Handle<NameDictionary> dictionary); | 4091 Handle<NameDictionary> dictionary); |
| 4092 | 4092 |
| 4093 // Find entry for key, otherwise return kNotFound. Optimized version of | 4093 // Find entry for key, otherwise return kNotFound. Optimized version of |
| 4094 // HashTable::FindEntry. | 4094 // HashTable::FindEntry. |
| 4095 int FindEntry(Name* key); | 4095 int FindEntry(Name* key); |
| 4096 |
| 4097 // TODO(mstarzinger): Temporary wrapper until handlified. |
| 4098 static Handle<NameDictionary> AddNameEntry(Handle<NameDictionary> dict, |
| 4099 Handle<Name> name, |
| 4100 Handle<Object> value, |
| 4101 PropertyDetails details); |
| 4096 }; | 4102 }; |
| 4097 | 4103 |
| 4098 | 4104 |
| 4099 class NumberDictionaryShape : public BaseShape<uint32_t> { | 4105 class NumberDictionaryShape : public BaseShape<uint32_t> { |
| 4100 public: | 4106 public: |
| 4101 static inline bool IsMatch(uint32_t key, Object* other); | 4107 static inline bool IsMatch(uint32_t key, Object* other); |
| 4102 MUST_USE_RESULT static inline MaybeObject* AsObject(Heap* heap, | 4108 MUST_USE_RESULT static inline MaybeObject* AsObject(Heap* heap, |
| 4103 uint32_t key); | 4109 uint32_t key); |
| 4104 static const int kEntrySize = 3; | 4110 static const int kEntrySize = 3; |
| 4105 static const bool kIsEnumerable = false; | 4111 static const bool kIsEnumerable = false; |
| (...skipping 6918 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 11024 } else { | 11030 } else { |
| 11025 value &= ~(1 << bit_position); | 11031 value &= ~(1 << bit_position); |
| 11026 } | 11032 } |
| 11027 return value; | 11033 return value; |
| 11028 } | 11034 } |
| 11029 }; | 11035 }; |
| 11030 | 11036 |
| 11031 } } // namespace v8::internal | 11037 } } // namespace v8::internal |
| 11032 | 11038 |
| 11033 #endif // V8_OBJECTS_H_ | 11039 #endif // V8_OBJECTS_H_ |
| OLD | NEW |