1 /*
   2  * Copyright (c) 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_GC_G1_G1BUFFERNODELIST_HPP
  26 #define SHARE_GC_G1_G1BUFFERNODELIST_HPP
  27 
  28 #include "utilities/globalDefinitions.hpp"
  29 
  30 class BufferNode;
  31 
  32 struct G1BufferNodeList {
  33   BufferNode* _head;            // First node in list or NULL if empty.
  34   BufferNode* _tail;            // Last node in list or NULL if empty.
  35   size_t _entry_count;          // Sum of entries in nodes in list.
  36 
  37   G1BufferNodeList();
  38   G1BufferNodeList(BufferNode* head, BufferNode* tail, size_t entry_count);
  39 };
  40 
  41 #endif // SHARE_GC_G1_G1BUFFERNODELIST_HPP
  42