1// Copyright 2011 the V8 project authors. All rights reserved.
2// Redistribution and use in source and binary forms, with or without
3// modification, are permitted provided that the following conditions are
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
28#include <stdlib.h>
29#include <string.h>
30#include "src/v8.h"
31#include "test/cctest/cctest.h"
32
33using namespace v8::internal;
34
35// Use a testing allocator that clears memory before deletion.
36class ZeroingAllocationPolicy {
37 public:
38  void* New(size_t size) {
39    // Stash the size in the first word to use for Delete.
40    size_t true_size = size + sizeof(size_t);
41    size_t* result = reinterpret_cast<size_t*>(malloc(true_size));
42    if (result == NULL) return result;
43    *result = true_size;
44    return result + 1;
45  }
46
47  static void Delete(void* ptr) {
48    size_t* true_ptr = reinterpret_cast<size_t*>(ptr) - 1;
49    memset(true_ptr, 0, *true_ptr);
50    free(true_ptr);
51  }
52};
53
54
55// Check that we can add (a reference to) an element of the list
56// itself.
57TEST(ListAdd) {
58  // Add elements to the list to grow it to its capacity.
59  List<int, ZeroingAllocationPolicy> list(4);
60  list.Add(1);
61  list.Add(2);
62  list.Add(3);
63  list.Add(4);
64
65  // Add an existing element, the backing store should have to grow.
66  list.Add(list[0]);
67  CHECK_EQ(1, list[4]);
68}
69
70
71// Test that we can add all elements from a list to another list.
72TEST(ListAddAll) {
73  List<int, ZeroingAllocationPolicy> list(4);
74  list.Add(0);
75  list.Add(1);
76  list.Add(2);
77
78  CHECK_EQ(3, list.length());
79  for (int i = 0; i < 3; i++) {
80    CHECK_EQ(i, list[i]);
81  }
82
83  List<int, ZeroingAllocationPolicy> other_list(4);
84
85  // Add no elements to list since other_list is empty.
86  list.AddAll(other_list);
87  CHECK_EQ(3, list.length());
88  for (int i = 0; i < 3; i++) {
89    CHECK_EQ(i, list[i]);
90  }
91
92  // Add three elements to other_list.
93  other_list.Add(0);
94  other_list.Add(1);
95  other_list.Add(2);
96
97  // Copy the three elements from other_list to list.
98  list.AddAll(other_list);
99  CHECK_EQ(6, list.length());
100  for (int i = 0; i < 6; i++) {
101    CHECK_EQ(i % 3, list[i]);
102  }
103}
104
105
106TEST(RemoveLast) {
107  List<int> list(4);
108  CHECK_EQ(0, list.length());
109  list.Add(1);
110  CHECK_EQ(1, list.length());
111  CHECK_EQ(1, list.last());
112  list.RemoveLast();
113  CHECK_EQ(0, list.length());
114  list.Add(2);
115  list.Add(3);
116  CHECK_EQ(2, list.length());
117  CHECK_EQ(3, list.last());
118  list.RemoveLast();
119  CHECK_EQ(1, list.length());
120  CHECK_EQ(2, list.last());
121  list.RemoveLast();
122  CHECK_EQ(0, list.length());
123
124  const int kElements = 100;
125  for (int i = 0; i < kElements; i++) list.Add(i);
126  for (int j = kElements - 1; j >= 0; j--) {
127    CHECK_EQ(j + 1, list.length());
128    CHECK_EQ(j, list.last());
129    list.RemoveLast();
130    CHECK_EQ(j, list.length());
131  }
132}
133
134
135TEST(Allocate) {
136  List<int> list(4);
137  list.Add(1);
138  CHECK_EQ(1, list.length());
139  list.Allocate(100);
140  CHECK_EQ(100, list.length());
141  CHECK_LE(100, list.capacity());
142  list[99] = 123;
143  CHECK_EQ(123, list[99]);
144}
145
146
147TEST(Clear) {
148  List<int> list(4);
149  CHECK_EQ(0, list.length());
150  for (int i = 0; i < 4; ++i) list.Add(i);
151  CHECK_EQ(4, list.length());
152  list.Clear();
153  CHECK_EQ(0, list.length());
154}
155
156
157TEST(DeleteEmpty) {
158  {
159    List<int>* list = new List<int>(0);
160    delete list;
161  }
162  {
163    List<int> list(0);
164  }
165}
166