1 /*
2 * Copyright 2001-2007 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
103 // with the world stopped).
104 void set_closure(CardTableEntryClosure* closure);
105
106 // If there is a registered closure for buffers, apply it to all entries
107 // in all currently-active buffers. This should only be applied at a
108 // safepoint. (Currently must not be called in parallel; this should
109 // change in the future.) If "consume" is true, processed entries are
110 // discarded.
111 void iterate_closure_all_threads(bool consume = true,
112 size_t worker_i = 0);
113
114 // If there exists some completed buffer, pop it, then apply the
115 // registered closure to all its elements, nulling out those elements
116 // processed. If all elements are processed, returns "true". If no
117 // completed buffers exist, returns false. If a completed buffer exists,
118 // but is only partially completed before a "yield" happens, the
119 // partially completed buffer (with its processed elements set to NULL)
120 // is returned to the completed buffer set, and this call returns false.
121 bool apply_closure_to_completed_buffer(int worker_i = 0,
122 int stop_at = 0,
123 bool with_CAS = false);
124 bool apply_closure_to_completed_buffer_helper(int worker_i,
125 CompletedBufferNode* nd);
126
127 CompletedBufferNode* get_completed_buffer_CAS();
128 CompletedBufferNode* get_completed_buffer_lock(int stop_at);
129 // Applies the current closure to all completed buffers,
130 // non-consumptively.
131 void apply_closure_to_all_completed_buffers();
132
133 DirtyCardQueue* shared_dirty_card_queue() {
134 return &_shared_dirty_card_queue;
135 }
136
137 // If a full collection is happening, reset partial logs, and ignore
138 // completed ones: the full collection will make them all irrelevant.
139 void abandon_logs();
140
141 // If any threads have partial logs, add them to the global list of logs.
142 void concatenate_logs();
143 void clear_n_completed_buffers() { _n_completed_buffers = 0;}
144
145 jint processed_buffers_mut() {
146 return _processed_buffers_mut;
147 }
148 jint processed_buffers_rs_thread() {
|
1 /*
2 * Copyright 2001-2009 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
103 // with the world stopped).
104 void set_closure(CardTableEntryClosure* closure);
105
106 // If there is a registered closure for buffers, apply it to all entries
107 // in all currently-active buffers. This should only be applied at a
108 // safepoint. (Currently must not be called in parallel; this should
109 // change in the future.) If "consume" is true, processed entries are
110 // discarded.
111 void iterate_closure_all_threads(bool consume = true,
112 size_t worker_i = 0);
113
114 // If there exists some completed buffer, pop it, then apply the
115 // registered closure to all its elements, nulling out those elements
116 // processed. If all elements are processed, returns "true". If no
117 // completed buffers exist, returns false. If a completed buffer exists,
118 // but is only partially completed before a "yield" happens, the
119 // partially completed buffer (with its processed elements set to NULL)
120 // is returned to the completed buffer set, and this call returns false.
121 bool apply_closure_to_completed_buffer(int worker_i = 0,
122 int stop_at = 0,
123 bool during_pause = false);
124
125 bool apply_closure_to_completed_buffer_helper(int worker_i,
126 CompletedBufferNode* nd);
127
128 CompletedBufferNode* get_completed_buffer(int stop_at);
129
130 // Applies the current closure to all completed buffers,
131 // non-consumptively.
132 void apply_closure_to_all_completed_buffers();
133
134 DirtyCardQueue* shared_dirty_card_queue() {
135 return &_shared_dirty_card_queue;
136 }
137
138 // If a full collection is happening, reset partial logs, and ignore
139 // completed ones: the full collection will make them all irrelevant.
140 void abandon_logs();
141
142 // If any threads have partial logs, add them to the global list of logs.
143 void concatenate_logs();
144 void clear_n_completed_buffers() { _n_completed_buffers = 0;}
145
146 jint processed_buffers_mut() {
147 return _processed_buffers_mut;
148 }
149 jint processed_buffers_rs_thread() {
|