Chromium Code Reviews| 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 2457 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 2468 // Initialize or change the enum cache, | 2468 // Initialize or change the enum cache, |
| 2469 // using the supplied storage for the small "bridge". | 2469 // using the supplied storage for the small "bridge". |
| 2470 void SetEnumCache(FixedArray* bridge_storage, | 2470 void SetEnumCache(FixedArray* bridge_storage, |
| 2471 FixedArray* new_cache, | 2471 FixedArray* new_cache, |
| 2472 Object* new_index_cache); | 2472 Object* new_index_cache); |
| 2473 | 2473 |
| 2474 // Accessors for fetching instance descriptor at descriptor number. | 2474 // Accessors for fetching instance descriptor at descriptor number. |
| 2475 inline String* GetKey(int descriptor_number); | 2475 inline String* GetKey(int descriptor_number); |
| 2476 inline Object* GetValue(int descriptor_number); | 2476 inline Object* GetValue(int descriptor_number); |
| 2477 inline PropertyDetails GetDetails(int descriptor_number); | 2477 inline PropertyDetails GetDetails(int descriptor_number); |
| 2478 | |
| 2479 inline Object* RawGetValue(int descriptor_number); | |
|
Michael Starzinger
2012/05/24 14:02:25
These methods are only needed by the IntrusiveMapT
Toon Verwaest
2012/05/25 11:36:46
Done.
| |
| 2480 inline PropertyDetails RawGetDetails(int descriptor_number); | |
| 2481 | |
| 2478 inline PropertyType GetType(int descriptor_number); | 2482 inline PropertyType GetType(int descriptor_number); |
| 2479 inline int GetFieldIndex(int descriptor_number); | 2483 inline int GetFieldIndex(int descriptor_number); |
| 2480 inline JSFunction* GetConstantFunction(int descriptor_number); | 2484 inline JSFunction* GetConstantFunction(int descriptor_number); |
| 2481 inline Object* GetCallbacksObject(int descriptor_number); | 2485 inline Object* GetCallbacksObject(int descriptor_number); |
| 2482 inline AccessorDescriptor* GetCallbacks(int descriptor_number); | 2486 inline AccessorDescriptor* GetCallbacks(int descriptor_number); |
| 2483 inline bool IsProperty(int descriptor_number); | 2487 inline bool IsProperty(int descriptor_number); |
| 2484 inline bool IsTransitionOnly(int descriptor_number); | 2488 inline bool IsTransitionOnly(int descriptor_number); |
| 2485 inline bool IsNullDescriptor(int descriptor_number); | 2489 inline bool IsNullDescriptor(int descriptor_number); |
| 2486 | 2490 |
| 2487 class WhitenessWitness { | 2491 class WhitenessWitness { |
| (...skipping 155 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 2643 static inline void NoIncrementalWriteBarrierSwap( | 2647 static inline void NoIncrementalWriteBarrierSwap( |
| 2644 FixedArray* array, int first, int second); | 2648 FixedArray* array, int first, int second); |
| 2645 | 2649 |
| 2646 // Swap descriptor first and second. | 2650 // Swap descriptor first and second. |
| 2647 inline void NoIncrementalWriteBarrierSwapDescriptors( | 2651 inline void NoIncrementalWriteBarrierSwapDescriptors( |
| 2648 int first, int second); | 2652 int first, int second); |
| 2649 | 2653 |
| 2650 FixedArray* GetContentArray() { | 2654 FixedArray* GetContentArray() { |
| 2651 return FixedArray::cast(get(kContentArrayIndex)); | 2655 return FixedArray::cast(get(kContentArrayIndex)); |
| 2652 } | 2656 } |
| 2657 inline FixedArray* RawGetContentArray(); | |
|
Michael Starzinger
2012/05/24 14:02:25
Likewise.
Toon Verwaest
2012/05/25 11:36:46
Done.
| |
| 2653 DISALLOW_IMPLICIT_CONSTRUCTORS(DescriptorArray); | 2658 DISALLOW_IMPLICIT_CONSTRUCTORS(DescriptorArray); |
| 2654 }; | 2659 }; |
| 2655 | 2660 |
| 2656 | 2661 |
| 2657 // HashTable is a subclass of FixedArray that implements a hash table | 2662 // HashTable is a subclass of FixedArray that implements a hash table |
| 2658 // that uses open addressing and quadratic probing. | 2663 // that uses open addressing and quadratic probing. |
| 2659 // | 2664 // |
| 2660 // In order for the quadratic probing to work, elements that have not | 2665 // In order for the quadratic probing to work, elements that have not |
| 2661 // yet been used and elements that have been deleted are | 2666 // yet been used and elements that have been deleted are |
| 2662 // distinguished. Probing continues when deleted elements are | 2667 // distinguished. Probing continues when deleted elements are |
| (...skipping 5984 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 8647 } else { | 8652 } else { |
| 8648 value &= ~(1 << bit_position); | 8653 value &= ~(1 << bit_position); |
| 8649 } | 8654 } |
| 8650 return value; | 8655 return value; |
| 8651 } | 8656 } |
| 8652 }; | 8657 }; |
| 8653 | 8658 |
| 8654 } } // namespace v8::internal | 8659 } } // namespace v8::internal |
| 8655 | 8660 |
| 8656 #endif // V8_OBJECTS_H_ | 8661 #endif // V8_OBJECTS_H_ |
| OLD | NEW |