1/*
2 * Copyright (c) 2014, 2019, 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#ifndef SHARE_JFR_LEAKPROFILER_SAMPLING_SAMPLEPRIORITYQUEUE_HPP
26#define SHARE_JFR_LEAKPROFILER_SAMPLING_SAMPLEPRIORITYQUEUE_HPP
27
28#include "memory/allocation.hpp"
29
30class ObjectSample;
31
32// Priority queue that keeps object samples ordered
33// by the amount of allocation they span.
34class SamplePriorityQueue : public CHeapObj<mtTracing> {
35 private:
36 ObjectSample** _items;
37 size_t _allocated_size;
38 int _count;
39 size_t _total;
40
41 void swap(int i, int j);
42 void moveDown(int index);
43 void moveUp(int index);
44
45 public:
46 SamplePriorityQueue(size_t size);
47 ~SamplePriorityQueue();
48
49 void push(ObjectSample* sample);
50 ObjectSample* pop();
51 const ObjectSample* peek() const;
52 void remove(ObjectSample* sample);
53 ObjectSample* item_at(int index);
54 size_t total() const;
55 int count() const;
56};
57
58#endif // SHARE_JFR_LEAKPROFILER_SAMPLING_SAMPLEPRIORITYQUEUE_HPP
59