< prev index next >

src/share/vm/gc/g1/dirtyCardQueue.hpp

Print this page
rev 10336 : [mq]: inc1

*** 50,75 **** ~DirtyCardQueue(); // Process queue entries and release resources. void flush() { flush_impl(); } ! // Apply the closure to all active elements, from index to size. If ! // all closure applications return true, then returns true. Stops ! // processing after the first false closure application and returns ! // false. If "consume" is true, index is updated to follow the last ! // processed element. bool apply_closure(CardTableEntryClosure* cl, bool consume = true, uint worker_i = 0); ! // Apply the closure to all active elements of "node", from it's ! // index to sz. If all closure applications return true, then ! // returns true. Stops processing after the first false closure ! // application and returns false. If "consume" is true, the node's ! // index is updated to follow the last processed element. static bool apply_closure_to_buffer(CardTableEntryClosure* cl, ! BufferNode* node, size_t sz, bool consume = true, uint worker_i = 0); void **get_buf() { return _buf;} size_t get_index() { return _index;} void reinitialize() { _buf = 0; _sz = 0; _index = 0;} --- 50,77 ---- ~DirtyCardQueue(); // Process queue entries and release resources. void flush() { flush_impl(); } ! // Apply the closure to the elements from _index to _sz. If all ! // closure applications return true, then returns true. Stops ! // processing after the first closure application that returns ! // false, and returns false from this function. If "consume" is ! // true, _index is updated to follow the last processed element. bool apply_closure(CardTableEntryClosure* cl, bool consume = true, uint worker_i = 0); ! // Apply the closure to the elements of "node" from it's index to ! // buffer_size. If all closure applications return true, then ! // returns true. Stops processing after the first closure ! // application that returns false, and returns false from this ! // function. If "consume" is true, the node's index is updated to ! // follow the last processed element. static bool apply_closure_to_buffer(CardTableEntryClosure* cl, ! BufferNode* node, ! size_t buffer_size, bool consume = true, uint worker_i = 0); void **get_buf() { return _buf;} size_t get_index() { return _index;} void reinitialize() { _buf = 0; _sz = 0; _index = 0;}
*** 93,103 **** // The closure used in mut_process_buffer(). CardTableEntryClosure* _mut_process_closure; DirtyCardQueue _shared_dirty_card_queue; - // Override. bool mut_process_buffer(BufferNode* node); // Protected by the _cbl_mon. FreeIdSet* _free_ids; --- 95,104 ----
*** 133,143 **** // specified closure to its active elements. If all active elements // are processed, returns "true". If no completed buffers exist, // returns false. If a completed buffer exists, but is only // partially completed before a "yield" happens, the partially // completed buffer (with its index updated to exclude the processed ! // eleemnts) is returned to the completed buffer set, and this call // returns false. bool apply_closure_to_completed_buffer(CardTableEntryClosure* cl, uint worker_i, size_t stop_at, bool during_pause); --- 134,144 ---- // specified closure to its active elements. If all active elements // are processed, returns "true". If no completed buffers exist, // returns false. If a completed buffer exists, but is only // partially completed before a "yield" happens, the partially // completed buffer (with its index updated to exclude the processed ! // elements) is returned to the completed buffer set, and this call // returns false. bool apply_closure_to_completed_buffer(CardTableEntryClosure* cl, uint worker_i, size_t stop_at, bool during_pause);
< prev index next >