| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // modification, are permitted provided that the following conditions are | 3 // found in the LICENSE file. |
| 4 // met: | |
| 5 // | |
| 6 // * Redistributions of source code must retain the above copyright | |
| 7 // notice, this list of conditions and the following disclaimer. | |
| 8 // * Redistributions in binary form must reproduce the above | |
| 9 // copyright notice, this list of conditions and the following | |
| 10 // disclaimer in the documentation and/or other materials provided | |
| 11 // with the distribution. | |
| 12 // * Neither the name of Google Inc. nor the names of its | |
| 13 // contributors may be used to endorse or promote products derived | |
| 14 // from this software without specific prior written permission. | |
| 15 // | |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 27 | 4 |
| 28 #ifndef V8_ZONE_INL_H_ | 5 #ifndef V8_ZONE_INL_H_ |
| 29 #define V8_ZONE_INL_H_ | 6 #define V8_ZONE_INL_H_ |
| 30 | 7 |
| 31 #include "zone.h" | 8 #include "zone.h" |
| 32 | 9 |
| 33 #ifdef V8_USE_ADDRESS_SANITIZER | 10 #ifdef V8_USE_ADDRESS_SANITIZER |
| 34 #include <sanitizer/asan_interface.h> | 11 #include <sanitizer/asan_interface.h> |
| 35 #else | 12 #else |
| 36 #define ASAN_UNPOISON_MEMORY_REGION(start, size) ((void) 0) | 13 #define ASAN_UNPOISON_MEMORY_REGION(start, size) ((void) 0) |
| 37 #endif | 14 #endif |
| 38 | 15 |
| 39 #include "counters.h" | |
| 40 #include "isolate.h" | 16 #include "isolate.h" |
| 41 #include "utils.h" | 17 #include "utils.h" |
| 42 #include "v8-counters.h" | 18 #include "v8-counters.h" |
| 43 | 19 |
| 44 namespace v8 { | 20 namespace v8 { |
| 45 namespace internal { | 21 namespace internal { |
| 46 | 22 |
| 47 | 23 |
| 48 static const int kASanRedzoneBytes = 24; // Must be a multiple of 8. | 24 static const int kASanRedzoneBytes = 24; // Must be a multiple of 8. |
| 49 | 25 |
| (...skipping 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 113 // in the destructor. For a zone-allocated tree, nodes will be | 89 // in the destructor. For a zone-allocated tree, nodes will be |
| 114 // freed by the Zone. | 90 // freed by the Zone. |
| 115 SplayTree<Config, ZoneAllocationPolicy>::ResetRoot(); | 91 SplayTree<Config, ZoneAllocationPolicy>::ResetRoot(); |
| 116 } | 92 } |
| 117 | 93 |
| 118 | 94 |
| 119 void* ZoneObject::operator new(size_t size, Zone* zone) { | 95 void* ZoneObject::operator new(size_t size, Zone* zone) { |
| 120 return zone->New(static_cast<int>(size)); | 96 return zone->New(static_cast<int>(size)); |
| 121 } | 97 } |
| 122 | 98 |
| 99 |
| 123 inline void* ZoneAllocationPolicy::New(size_t size) { | 100 inline void* ZoneAllocationPolicy::New(size_t size) { |
| 124 ASSERT(zone_); | 101 ASSERT(zone_); |
| 125 return zone_->New(static_cast<int>(size)); | 102 return zone_->New(static_cast<int>(size)); |
| 126 } | 103 } |
| 127 | 104 |
| 128 | 105 |
| 129 template <typename T> | 106 template <typename T> |
| 130 void* ZoneList<T>::operator new(size_t size, Zone* zone) { | 107 void* ZoneList<T>::operator new(size_t size, Zone* zone) { |
| 131 return zone->New(static_cast<int>(size)); | 108 return zone->New(static_cast<int>(size)); |
| 132 } | 109 } |
| 133 | 110 |
| 134 | 111 |
| 135 template <typename T> | 112 template <typename T> |
| 136 void* ZoneSplayTree<T>::operator new(size_t size, Zone* zone) { | 113 void* ZoneSplayTree<T>::operator new(size_t size, Zone* zone) { |
| 137 return zone->New(static_cast<int>(size)); | 114 return zone->New(static_cast<int>(size)); |
| 138 } | 115 } |
| 139 | 116 |
| 140 | |
| 141 } } // namespace v8::internal | 117 } } // namespace v8::internal |
| 142 | 118 |
| 143 #endif // V8_ZONE_INL_H_ | 119 #endif // V8_ZONE_INL_H_ |
| OLD | NEW |