File: test_arrayAllocator.cpp

package info (click to toggle)
openjdk-21 21.0.8%2B9-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 823,976 kB
  • sloc: java: 5,613,338; xml: 1,643,607; cpp: 1,296,296; ansic: 420,291; asm: 404,850; objc: 20,994; sh: 15,271; javascript: 11,245; python: 6,895; makefile: 2,362; perl: 357; awk: 351; sed: 172; jsp: 24; csh: 3
file content (99 lines) | stat: -rw-r--r-- 2,839 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
/*
 * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
 *
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

#include "precompiled.hpp"
#include "memory/allocation.inline.hpp"
#include "unittest.hpp"

using Element = struct TestArrayAllocatorElement {
  double a;
  int b;
};

static void fill(Element* elements, int start, int size) {
  for (int i = 0; i < size; i++) {
    new (&elements[start + i]) Element{0.0, start + i};
  }
}

static Element* allocate_and_fill(int size) {
  Element* const elements = MallocArrayAllocator<Element>::allocate(size, mtTest);

  fill(elements, 0, size);

  return elements;
}

TEST_VM(ArrayAllocator, allocate) {
  const int size = 10;

  Element* const elements = allocate_and_fill(size);

  for (int i = 0; i < size; i++) {
    ASSERT_EQ(elements[i].b, i);
  }

  MallocArrayAllocator<Element>::free(elements);
}

TEST_VM(ArrayAllocator, reallocate_0) {
  const int size = 10;

  Element* const elements = allocate_and_fill(size);

  Element* const ret = MallocArrayAllocator<Element>::reallocate(elements, 0, mtTest);
  ASSERT_NE(ret, nullptr) << "We've chosen to NOT return nullptr when reallcting with 0";

  MallocArrayAllocator<Element>::free(ret);
}

TEST_VM(ArrayAllocator, reallocate_shrink) {
  const int size = 10;

  Element* const elements = allocate_and_fill(size);

  Element* const ret = MallocArrayAllocator<Element>::reallocate(elements, size / 2, mtTest);

  for (int i = 0; i < size / 2; i++) {
    ASSERT_EQ(ret[i].b, i);
  }

  MallocArrayAllocator<Element>::free(ret);
}

TEST_VM(ArrayAllocator, reallocate_grow) {
  const int size = 10;

  Element* const elements = allocate_and_fill(size);

  Element* const ret = MallocArrayAllocator<Element>::reallocate(elements, size * 2, mtTest);

  fill(ret, size, size);

  for (int i = 0; i < size * 2; i++) {
    ASSERT_EQ(ret[i].b, i);
  }

  MallocArrayAllocator<Element>::free(ret);
}