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 15 matching lines...) Expand all Loading... | |
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 "cctest.h" | 31 #include "cctest.h" |
32 | 32 |
33 using namespace v8::internal; | 33 using namespace v8::internal; |
34 | 34 |
35 // Use a testing allocator that clears memory before deletion. | 35 // Use a testing allocator that clears memory before deletion. |
36 class ZeroingAllocationPolicy { | 36 struct ZeroingAllocationPolicy { |
danno
2012/06/01 11:29:24
This is an unrelated, unnecessary change. Please r
| |
37 public: | 37 void* New(size_t size) { |
38 static void* New(size_t size) { | |
39 // Stash the size in the first word to use for Delete. | 38 // Stash the size in the first word to use for Delete. |
40 size_t true_size = size + sizeof(size_t); | 39 size_t true_size = size + sizeof(size_t); |
41 size_t* result = reinterpret_cast<size_t*>(malloc(true_size)); | 40 size_t* result = reinterpret_cast<size_t*>(malloc(true_size)); |
42 if (result == NULL) return result; | 41 if (result == NULL) return result; |
43 *result = true_size; | 42 *result = true_size; |
44 return result + 1; | 43 return result + 1; |
45 } | 44 } |
46 | 45 |
47 static void Delete(void* ptr) { | 46 static void Delete(void* ptr) { |
48 size_t* true_ptr = reinterpret_cast<size_t*>(ptr) - 1; | 47 size_t* true_ptr = reinterpret_cast<size_t*>(ptr) - 1; |
(...skipping 105 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
154 | 153 |
155 TEST(DeleteEmpty) { | 154 TEST(DeleteEmpty) { |
156 { | 155 { |
157 List<int>* list = new List<int>(0); | 156 List<int>* list = new List<int>(0); |
158 delete list; | 157 delete list; |
159 } | 158 } |
160 { | 159 { |
161 List<int> list(0); | 160 List<int> list(0); |
162 } | 161 } |
163 } | 162 } |
OLD | NEW |