< prev index next >

src/hotspot/share/gc/shared/ptrQueue.hpp

Print this page
rev 57716 : imported patch remove_cbl_mon

*** 1,7 **** /* ! * Copyright (c) 2001, 2019, 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. --- 1,7 ---- /* ! * Copyright (c) 2001, 2020, 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.
*** 208,226 **** static size_t buffer_offset() { return offset_of(BufferNode, _buffer); } - static BufferNode* volatile* next_ptr(BufferNode& bn) { return &bn._next; } - // Allocate a new BufferNode with the "buffer" having size elements. static BufferNode* allocate(size_t size); // Free a BufferNode. static void deallocate(BufferNode* node); public: typedef LockFreeStack<BufferNode, &next_ptr> Stack; BufferNode* next() const { return _next; } void set_next(BufferNode* n) { _next = n; } size_t index() const { return _index; } --- 208,225 ---- static size_t buffer_offset() { return offset_of(BufferNode, _buffer); } // Allocate a new BufferNode with the "buffer" having size elements. static BufferNode* allocate(size_t size); // Free a BufferNode. static void deallocate(BufferNode* node); public: + static BufferNode* volatile* next_ptr(BufferNode& bn) { return &bn._next; } typedef LockFreeStack<BufferNode, &next_ptr> Stack; BufferNode* next() const { return _next; } void set_next(BufferNode* n) { _next = n; } size_t index() const { return _index; }
< prev index next >