Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 10 matching lines...) Expand all Loading... | |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include <stdlib.h> | 28 #include <stdlib.h> |
| 29 #include <string.h> | 29 #include <string.h> |
| 30 #include "v8.h" | 30 #include "v8.h" |
| 31 #include "allocation.h" | |
| 31 #include "cctest.h" | 32 #include "cctest.h" |
| 32 | 33 |
| 33 using namespace v8::internal; | 34 using namespace v8::internal; |
| 34 | 35 |
| 35 // Use a testing allocator that clears memory before deletion. | 36 // Use a testing allocator that clears memory before deletion. |
| 36 class ZeroingAllocationPolicy { | 37 class ZeroingAllocator { |
| 37 public: | 38 public: |
| 38 static void* New(size_t size) { | 39 void* New(size_t size) { |
| 39 // Stash the size in the first word to use for Delete. | 40 // Stash the size in the first word to use for Delete. |
| 40 size_t true_size = size + sizeof(size_t); | 41 size_t true_size = size + sizeof(size_t); |
| 41 size_t* result = reinterpret_cast<size_t*>(malloc(true_size)); | 42 size_t* result = reinterpret_cast<size_t*>(malloc(true_size)); |
| 42 if (result == NULL) return result; | 43 if (result == NULL) return result; |
| 43 *result = true_size; | 44 *result = true_size; |
| 44 return result + 1; | 45 return result + 1; |
| 45 } | 46 } |
| 47 }; | |
| 46 | 48 |
| 47 static void Delete(void* ptr) { | 49 |
| 50 class ZeroingDeallocator { | |
| 51 public: | |
| 52 void Delete(void* ptr) { | |
| 48 size_t* true_ptr = reinterpret_cast<size_t*>(ptr) - 1; | 53 size_t* true_ptr = reinterpret_cast<size_t*>(ptr) - 1; |
| 49 memset(true_ptr, 0, *true_ptr); | 54 memset(true_ptr, 0, *true_ptr); |
| 50 free(true_ptr); | 55 free(true_ptr); |
| 51 } | 56 } |
| 52 }; | 57 }; |
| 53 | 58 |
| 59 | |
| 60 struct ZeroingAllocationPolicy { | |
| 61 typedef ZeroingAllocator Alloc; | |
|
danno
2012/05/25 11:03:37
Full "Allocator" and "Deallocator"
| |
| 62 typedef ZeroingDeallocator Dealloc; | |
| 63 }; | |
| 64 | |
| 54 // Check that we can add (a reference to) an element of the list | 65 // Check that we can add (a reference to) an element of the list |
| 55 // itself. | 66 // itself. |
| 56 TEST(ListAdd) { | 67 TEST(ListAdd) { |
| 57 // Add elements to the list to grow it to its capacity. | 68 // Add elements to the list to grow it to its capacity. |
| 58 List<int, ZeroingAllocationPolicy> list(4); | 69 List<int, ZeroingAllocationPolicy> list(4); |
| 59 list.Add(1); | 70 list.Add(1); |
| 60 list.Add(2); | 71 list.Add(2); |
| 61 list.Add(3); | 72 list.Add(3); |
| 62 list.Add(4); | 73 list.Add(4); |
| 63 | 74 |
| (...skipping 90 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 154 | 165 |
| 155 TEST(DeleteEmpty) { | 166 TEST(DeleteEmpty) { |
| 156 { | 167 { |
| 157 List<int>* list = new List<int>(0); | 168 List<int>* list = new List<int>(0); |
| 158 delete list; | 169 delete list; |
| 159 } | 170 } |
| 160 { | 171 { |
| 161 List<int> list(0); | 172 List<int> list(0); |
| 162 } | 173 } |
| 163 } | 174 } |
| OLD | NEW |