| OLD | NEW |
| 1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef V8_CODE_STUB_ASSEMBLER_H_ | 5 #ifndef V8_CODE_STUB_ASSEMBLER_H_ |
| 6 #define V8_CODE_STUB_ASSEMBLER_H_ | 6 #define V8_CODE_STUB_ASSEMBLER_H_ |
| 7 | 7 |
| 8 #include <functional> | 8 #include <functional> |
| 9 | 9 |
| 10 #include "src/compiler/code-assembler.h" | 10 #include "src/compiler/code-assembler.h" |
| 11 #include "src/globals.h" | 11 #include "src/globals.h" |
| 12 #include "src/objects.h" | 12 #include "src/objects.h" |
| 13 | 13 |
| 14 namespace v8 { | 14 namespace v8 { |
| 15 namespace internal { | 15 namespace internal { |
| 16 | 16 |
| 17 class CallInterfaceDescriptor; | 17 class CallInterfaceDescriptor; |
| 18 class StatsCounter; | 18 class StatsCounter; |
| 19 class StubCache; | 19 class StubCache; |
| 20 | 20 |
| 21 enum class PrimitiveType { kBoolean, kNumber, kString, kSymbol }; | 21 enum class PrimitiveType { kBoolean, kNumber, kString, kSymbol }; |
| 22 | 22 |
| 23 #define HEAP_CONSTANT_LIST(V) \ | 23 #define HEAP_CONSTANT_LIST(V) \ |
| 24 V(BooleanMap, BooleanMap) \ | 24 V(AccessorInfoMap, AccessorInfoMap) \ |
| 25 V(CodeMap, CodeMap) \ | 25 V(BooleanMap, BooleanMap) \ |
| 26 V(empty_string, EmptyString) \ | 26 V(CodeMap, CodeMap) \ |
| 27 V(EmptyFixedArray, EmptyFixedArray) \ | 27 V(empty_string, EmptyString) \ |
| 28 V(FalseValue, False) \ | 28 V(EmptyFixedArray, EmptyFixedArray) \ |
| 29 V(FixedArrayMap, FixedArrayMap) \ | 29 V(FalseValue, False) \ |
| 30 V(FixedCOWArrayMap, FixedCOWArrayMap) \ | 30 V(FixedArrayMap, FixedArrayMap) \ |
| 31 V(FixedDoubleArrayMap, FixedDoubleArrayMap) \ | 31 V(FixedCOWArrayMap, FixedCOWArrayMap) \ |
| 32 V(HeapNumberMap, HeapNumberMap) \ | 32 V(FixedDoubleArrayMap, FixedDoubleArrayMap) \ |
| 33 V(MinusZeroValue, MinusZero) \ | 33 V(FunctionTemplateInfoMap, FunctionTemplateInfoMap) \ |
| 34 V(NanValue, Nan) \ | 34 V(HeapNumberMap, HeapNumberMap) \ |
| 35 V(NullValue, Null) \ | 35 V(MinusZeroValue, MinusZero) \ |
| 36 V(TheHoleValue, TheHole) \ | 36 V(NanValue, Nan) \ |
| 37 V(TrueValue, True) \ | 37 V(NullValue, Null) \ |
| 38 V(SymbolMap, SymbolMap) \ |
| 39 V(TheHoleValue, TheHole) \ |
| 40 V(TrueValue, True) \ |
| 38 V(UndefinedValue, Undefined) | 41 V(UndefinedValue, Undefined) |
| 39 | 42 |
| 40 // Provides JavaScript-specific "macro-assembler" functionality on top of the | 43 // Provides JavaScript-specific "macro-assembler" functionality on top of the |
| 41 // CodeAssembler. By factoring the JavaScript-isms out of the CodeAssembler, | 44 // CodeAssembler. By factoring the JavaScript-isms out of the CodeAssembler, |
| 42 // it's possible to add JavaScript-specific useful CodeAssembler "macros" | 45 // it's possible to add JavaScript-specific useful CodeAssembler "macros" |
| 43 // without modifying files in the compiler directory (and requiring a review | 46 // without modifying files in the compiler directory (and requiring a review |
| 44 // from a compiler directory OWNER). | 47 // from a compiler directory OWNER). |
| 45 class V8_EXPORT_PRIVATE CodeStubAssembler : public compiler::CodeAssembler { | 48 class V8_EXPORT_PRIVATE CodeStubAssembler : public compiler::CodeAssembler { |
| 46 public: | 49 public: |
| 47 CodeStubAssembler(compiler::CodeAssemblerState* state) | 50 CodeStubAssembler(compiler::CodeAssemblerState* state) |
| (...skipping 302 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 350 compiler::Node* object, compiler::Node* offset, compiler::Node* value, | 353 compiler::Node* object, compiler::Node* offset, compiler::Node* value, |
| 351 MachineRepresentation rep = MachineRepresentation::kTagged); | 354 MachineRepresentation rep = MachineRepresentation::kTagged); |
| 352 // Store the Map of an HeapObject. | 355 // Store the Map of an HeapObject. |
| 353 compiler::Node* StoreMapNoWriteBarrier(compiler::Node* object, | 356 compiler::Node* StoreMapNoWriteBarrier(compiler::Node* object, |
| 354 compiler::Node* map); | 357 compiler::Node* map); |
| 355 compiler::Node* StoreObjectFieldRoot(compiler::Node* object, int offset, | 358 compiler::Node* StoreObjectFieldRoot(compiler::Node* object, int offset, |
| 356 Heap::RootListIndex root); | 359 Heap::RootListIndex root); |
| 357 // Store an array element to a FixedArray. | 360 // Store an array element to a FixedArray. |
| 358 compiler::Node* StoreFixedArrayElement( | 361 compiler::Node* StoreFixedArrayElement( |
| 359 compiler::Node* object, int index, compiler::Node* value, | 362 compiler::Node* object, int index, compiler::Node* value, |
| 360 WriteBarrierMode barrier_mode = UPDATE_WRITE_BARRIER, | 363 WriteBarrierMode barrier_mode = UPDATE_WRITE_BARRIER) { |
| 361 ParameterMode parameter_mode = INTEGER_PARAMETERS) { | 364 return StoreFixedArrayElement(object, IntPtrConstant(index), value, |
| 362 return StoreFixedArrayElement(object, Int32Constant(index), value, | 365 barrier_mode, 0, INTPTR_PARAMETERS); |
| 363 barrier_mode, parameter_mode); | |
| 364 } | 366 } |
| 365 | 367 |
| 366 compiler::Node* StoreFixedArrayElement( | 368 compiler::Node* StoreFixedArrayElement( |
| 367 compiler::Node* object, compiler::Node* index, compiler::Node* value, | 369 compiler::Node* object, compiler::Node* index, compiler::Node* value, |
| 368 WriteBarrierMode barrier_mode = UPDATE_WRITE_BARRIER, | 370 WriteBarrierMode barrier_mode = UPDATE_WRITE_BARRIER, |
| 371 int additional_offset = 0, |
| 369 ParameterMode parameter_mode = INTEGER_PARAMETERS); | 372 ParameterMode parameter_mode = INTEGER_PARAMETERS); |
| 370 | 373 |
| 371 compiler::Node* StoreFixedDoubleArrayElement( | 374 compiler::Node* StoreFixedDoubleArrayElement( |
| 372 compiler::Node* object, compiler::Node* index, compiler::Node* value, | 375 compiler::Node* object, compiler::Node* index, compiler::Node* value, |
| 373 ParameterMode parameter_mode = INTEGER_PARAMETERS); | 376 ParameterMode parameter_mode = INTEGER_PARAMETERS); |
| 374 | 377 |
| 375 void StoreFieldsNoWriteBarrier(compiler::Node* start_address, | 378 void StoreFieldsNoWriteBarrier(compiler::Node* start_address, |
| 376 compiler::Node* end_address, | 379 compiler::Node* end_address, |
| 377 compiler::Node* value); | 380 compiler::Node* value); |
| 378 | 381 |
| (...skipping 376 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 755 // See Dictionary::EntryToIndex(). | 758 // See Dictionary::EntryToIndex(). |
| 756 template <typename Dictionary> | 759 template <typename Dictionary> |
| 757 compiler::Node* EntryToIndex(compiler::Node* entry, int field_index); | 760 compiler::Node* EntryToIndex(compiler::Node* entry, int field_index); |
| 758 template <typename Dictionary> | 761 template <typename Dictionary> |
| 759 compiler::Node* EntryToIndex(compiler::Node* entry) { | 762 compiler::Node* EntryToIndex(compiler::Node* entry) { |
| 760 return EntryToIndex<Dictionary>(entry, Dictionary::kEntryKeyIndex); | 763 return EntryToIndex<Dictionary>(entry, Dictionary::kEntryKeyIndex); |
| 761 } | 764 } |
| 762 // Calculate a valid size for the a hash table. | 765 // Calculate a valid size for the a hash table. |
| 763 compiler::Node* HashTableComputeCapacity(compiler::Node* at_least_space_for); | 766 compiler::Node* HashTableComputeCapacity(compiler::Node* at_least_space_for); |
| 764 | 767 |
| 768 template <class Dictionary> |
| 769 compiler::Node* GetNumberOfElements(compiler::Node* dictionary); |
| 770 |
| 771 template <class Dictionary> |
| 772 void SetNumberOfElements(compiler::Node* dictionary, |
| 773 compiler::Node* num_elements_smi); |
| 774 |
| 775 template <class Dictionary> |
| 776 compiler::Node* GetNumberOfDeletedElements(compiler::Node* dictionary); |
| 777 |
| 778 template <class Dictionary> |
| 779 compiler::Node* GetCapacity(compiler::Node* dictionary); |
| 780 |
| 781 template <class Dictionary> |
| 782 compiler::Node* GetNextEnumerationIndex(compiler::Node* dictionary); |
| 783 |
| 784 template <class Dictionary> |
| 785 void SetNextEnumerationIndex(compiler::Node* dictionary, |
| 786 compiler::Node* next_enum_index_smi); |
| 787 |
| 765 // Looks up an entry in a NameDictionaryBase successor. If the entry is found | 788 // Looks up an entry in a NameDictionaryBase successor. If the entry is found |
| 766 // control goes to {if_found} and {var_name_index} contains an index of the | 789 // control goes to {if_found} and {var_name_index} contains an index of the |
| 767 // key field of the entry found. If the key is not found control goes to | 790 // key field of the entry found. If the key is not found control goes to |
| 768 // {if_not_found}. | 791 // {if_not_found}. |
| 769 static const int kInlinedDictionaryProbes = 4; | 792 static const int kInlinedDictionaryProbes = 4; |
| 793 enum LookupMode { kFindExisting, kFindInsertionIndex }; |
| 770 template <typename Dictionary> | 794 template <typename Dictionary> |
| 771 void NameDictionaryLookup(compiler::Node* dictionary, | 795 void NameDictionaryLookup(compiler::Node* dictionary, |
| 772 compiler::Node* unique_name, Label* if_found, | 796 compiler::Node* unique_name, Label* if_found, |
| 773 Variable* var_name_index, Label* if_not_found, | 797 Variable* var_name_index, Label* if_not_found, |
| 774 int inlined_probes = kInlinedDictionaryProbes); | 798 int inlined_probes = kInlinedDictionaryProbes, |
| 799 LookupMode mode = kFindExisting); |
| 775 | 800 |
| 776 compiler::Node* ComputeIntegerHash(compiler::Node* key, compiler::Node* seed); | 801 compiler::Node* ComputeIntegerHash(compiler::Node* key, compiler::Node* seed); |
| 777 | 802 |
| 778 template <typename Dictionary> | 803 template <typename Dictionary> |
| 779 void NumberDictionaryLookup(compiler::Node* dictionary, | 804 void NumberDictionaryLookup(compiler::Node* dictionary, |
| 780 compiler::Node* intptr_index, Label* if_found, | 805 compiler::Node* intptr_index, Label* if_found, |
| 781 Variable* var_entry, Label* if_not_found); | 806 Variable* var_entry, Label* if_not_found); |
| 782 | 807 |
| 808 template <class Dictionary> |
| 809 void FindInsertionEntry(compiler::Node* dictionary, compiler::Node* key, |
| 810 Variable* var_key_index); |
| 811 |
| 812 template <class Dictionary> |
| 813 void InsertEntry(compiler::Node* dictionary, compiler::Node* key, |
| 814 compiler::Node* value, compiler::Node* index, |
| 815 compiler::Node* enum_index); |
| 816 |
| 817 template <class Dictionary> |
| 818 void Add(compiler::Node* dictionary, compiler::Node* key, |
| 819 compiler::Node* value, Label* bailout); |
| 820 |
| 783 // Tries to check if {object} has own {unique_name} property. | 821 // Tries to check if {object} has own {unique_name} property. |
| 784 void TryHasOwnProperty(compiler::Node* object, compiler::Node* map, | 822 void TryHasOwnProperty(compiler::Node* object, compiler::Node* map, |
| 785 compiler::Node* instance_type, | 823 compiler::Node* instance_type, |
| 786 compiler::Node* unique_name, Label* if_found, | 824 compiler::Node* unique_name, Label* if_found, |
| 787 Label* if_not_found, Label* if_bailout); | 825 Label* if_not_found, Label* if_bailout); |
| 788 | 826 |
| 789 // Tries to get {object}'s own {unique_name} property value. If the property | 827 // Tries to get {object}'s own {unique_name} property value. If the property |
| 790 // is an accessor then it also calls a getter. If the property is a double | 828 // is an accessor then it also calls a getter. If the property is a double |
| 791 // field it re-wraps value in an immutable heap number. | 829 // field it re-wraps value in an immutable heap number. |
| 792 void TryGetOwnProperty(compiler::Node* context, compiler::Node* receiver, | 830 void TryGetOwnProperty(compiler::Node* context, compiler::Node* receiver, |
| (...skipping 382 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1175 } | 1213 } |
| 1176 #else | 1214 #else |
| 1177 #define CSA_SLOW_ASSERT(csa, x) ((void)0) | 1215 #define CSA_SLOW_ASSERT(csa, x) ((void)0) |
| 1178 #endif | 1216 #endif |
| 1179 | 1217 |
| 1180 DEFINE_OPERATORS_FOR_FLAGS(CodeStubAssembler::AllocationFlags); | 1218 DEFINE_OPERATORS_FOR_FLAGS(CodeStubAssembler::AllocationFlags); |
| 1181 | 1219 |
| 1182 } // namespace internal | 1220 } // namespace internal |
| 1183 } // namespace v8 | 1221 } // namespace v8 |
| 1184 #endif // V8_CODE_STUB_ASSEMBLER_H_ | 1222 #endif // V8_CODE_STUB_ASSEMBLER_H_ |
| OLD | NEW |