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 2645 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2656 static const uint32_t kMaxGap = 1024; | 2656 static const uint32_t kMaxGap = 1024; |
2657 | 2657 |
2658 // Maximal length of fast elements array that won't be checked for | 2658 // Maximal length of fast elements array that won't be checked for |
2659 // being dense enough on expansion. | 2659 // being dense enough on expansion. |
2660 static const int kMaxUncheckedFastElementsLength = 5000; | 2660 static const int kMaxUncheckedFastElementsLength = 5000; |
2661 | 2661 |
2662 // Same as above but for old arrays. This limit is more strict. We | 2662 // Same as above but for old arrays. This limit is more strict. We |
2663 // don't want to be wasteful with long lived objects. | 2663 // don't want to be wasteful with long lived objects. |
2664 static const int kMaxUncheckedOldFastElementsLength = 500; | 2664 static const int kMaxUncheckedOldFastElementsLength = 500; |
2665 | 2665 |
2666 // Note that Heap::MaxRegularSpaceAllocationSize() puts a limit on | 2666 // Note that Page::kMaxRegularHeapObjectSize puts a limit on |
2667 // permissible values (see the ASSERT in heap.cc). | 2667 // permissible values (see the ASSERT in heap.cc). |
2668 static const int kInitialMaxFastElementArray = 100000; | 2668 static const int kInitialMaxFastElementArray = 100000; |
2669 | 2669 |
2670 static const int kFastPropertiesSoftLimit = 12; | 2670 static const int kFastPropertiesSoftLimit = 12; |
2671 static const int kMaxFastProperties = 64; | 2671 static const int kMaxFastProperties = 64; |
2672 static const int kMaxInstanceSize = 255 * kPointerSize; | 2672 static const int kMaxInstanceSize = 255 * kPointerSize; |
2673 // When extending the backing storage for property values, we increase | 2673 // When extending the backing storage for property values, we increase |
2674 // its size by more than the 1 entry necessary, so sequentially adding fields | 2674 // its size by more than the 1 entry necessary, so sequentially adding fields |
2675 // to the same object requires fewer allocations and copies. | 2675 // to the same object requires fewer allocations and copies. |
2676 static const int kFieldsAdded = 3; | 2676 static const int kFieldsAdded = 3; |
(...skipping 8079 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
10756 } else { | 10756 } else { |
10757 value &= ~(1 << bit_position); | 10757 value &= ~(1 << bit_position); |
10758 } | 10758 } |
10759 return value; | 10759 return value; |
10760 } | 10760 } |
10761 }; | 10761 }; |
10762 | 10762 |
10763 } } // namespace v8::internal | 10763 } } // namespace v8::internal |
10764 | 10764 |
10765 #endif // V8_OBJECTS_H_ | 10765 #endif // V8_OBJECTS_H_ |
OLD | NEW |