jdk

1
/*
2
 * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
3
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4
 *
5
 * This code is free software; you can redistribute it and/or modify it
6
 * under the terms of the GNU General Public License version 2 only, as
7
 * published by the Free Software Foundation.
8
 *
9
 * This code is distributed in the hope that it will be useful, but WITHOUT
10
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12
 * version 2 for more details (a copy is included in the LICENSE file that
13
 * accompanied this code).
14
 *
15
 * You should have received a copy of the GNU General Public License version
16
 * 2 along with this work; if not, write to the Free Software Foundation,
17
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18
 *
19
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20
 * or visit www.oracle.com if you need additional information or have any
21
 * questions.
22
 *
23
 */
24

25
#include "precompiled.hpp"
26
#include "memory/allocation.hpp"
27
#include "nmt/nmtNativeCallStackStorage.hpp"
28

29
NativeCallStackStorage::StackIndex NativeCallStackStorage::put(const NativeCallStack& value) {
30
  int bucket = value.calculate_hash() % _table_size;
31
  TableEntryIndex link = _table[bucket];
32
  while (link != TableEntryStorage::nil) {
33
    TableEntry& l = _entry_storage.at(link);
34
    if (value.equals(get(l.stack))) {
35
      return l.stack;
36
    }
37
    link = l.next;
38
  }
39
  int idx = _stacks.append(value);
40
  StackIndex si{idx};
41
  TableEntryIndex new_link = _entry_storage.allocate(_table[bucket], si);
42
  _table[bucket] = new_link;
43
  return si;
44
}
45
NativeCallStackStorage::NativeCallStackStorage(bool is_detailed_mode, int table_size)
46
  : _table_size(table_size),
47
    _table(nullptr),
48
    _stacks(),
49
    _is_detailed_mode(is_detailed_mode),
50
    _fake_stack() {
51
  if (_is_detailed_mode) {
52
    _table = NEW_C_HEAP_ARRAY(TableEntryIndex, _table_size, mtNMT);
53
    for (int i = 0; i < _table_size; i++) {
54
      _table[i] = TableEntryStorage::nil;
55
    }
56
  }
57
}
58
NativeCallStackStorage::~NativeCallStackStorage() {
59
  FREE_C_HEAP_ARRAY(LinkPtr, _table);
60
}
61