65 static ByteSize byte_offset_of_buf() {
66 return PtrQueue::byte_offset_of_buf<DirtyCardQueue>();
67 }
68 using PtrQueue::byte_width_of_buf;
69
70 };
71
72
73
74 class DirtyCardQueueSet: public PtrQueueSet {
75 // The closure used in mut_process_buffer().
76 CardTableEntryClosure* _mut_process_closure;
77
78 DirtyCardQueue _shared_dirty_card_queue;
79
80 // Apply the closure to the elements of "node" from it's index to
81 // buffer_size. If all closure applications return true, then
82 // returns true. Stops processing after the first closure
83 // application that returns false, and returns false from this
84 // function. If "consume" is true, the node's index is updated to
85 // follow the last processed element.
86 bool apply_closure_to_buffer(CardTableEntryClosure* cl,
87 BufferNode* node,
88 bool consume,
89 uint worker_i = 0);
90
91 bool mut_process_buffer(BufferNode* node);
92
93 // Protected by the _cbl_mon.
94 FreeIdSet* _free_ids;
95
96 // The number of completed buffers processed by mutator and rs thread,
97 // respectively.
98 jint _processed_buffers_mut;
99 jint _processed_buffers_rs_thread;
100
101 // Current buffer node used for parallel iteration.
102 BufferNode* volatile _cur_par_buffer_node;
103
104 void concatenate_log(DirtyCardQueue& dcq);
105
106 public:
107 DirtyCardQueueSet(bool notify_when_complete = true);
108
109 void initialize(CardTableEntryClosure* cl,
110 Monitor* cbl_mon,
111 Mutex* fl_lock,
112 int process_completed_threshold,
113 int max_completed_queue,
114 Mutex* lock,
115 DirtyCardQueueSet* fl_owner,
116 bool init_free_ids = false);
117
118 // The number of parallel ids that can be claimed to allow collector or
119 // mutator threads to do card-processing work.
120 static uint num_par_ids();
121
122 static void handle_zero_index_for_thread(JavaThread* t);
123
124 // If there exists some completed buffer, pop it, then apply the
125 // specified closure to its active elements. If all active elements
126 // are processed, returns "true". If no completed buffers exist,
127 // returns false. If a completed buffer exists, but is only
128 // partially completed before a "yield" happens, the partially
129 // completed buffer (with its index updated to exclude the processed
130 // elements) is returned to the completed buffer set, and this call
131 // returns false.
132 bool apply_closure_to_completed_buffer(CardTableEntryClosure* cl,
133 uint worker_i,
134 size_t stop_at,
135 bool during_pause);
136
137 BufferNode* get_completed_buffer(size_t stop_at);
138
139 void reset_for_par_iteration() { _cur_par_buffer_node = _completed_buffers_head; }
140 // Applies the current closure to all completed buffers, non-consumptively.
141 // Can be used in parallel, all callers using the iteration state initialized
142 // by reset_for_par_iteration.
143 void par_apply_closure_to_all_completed_buffers(CardTableEntryClosure* cl);
144
145 DirtyCardQueue* shared_dirty_card_queue() {
146 return &_shared_dirty_card_queue;
147 }
148
149 // Deallocate any completed log buffers
150 void clear();
151
|
65 static ByteSize byte_offset_of_buf() {
66 return PtrQueue::byte_offset_of_buf<DirtyCardQueue>();
67 }
68 using PtrQueue::byte_width_of_buf;
69
70 };
71
72
73
74 class DirtyCardQueueSet: public PtrQueueSet {
75 // The closure used in mut_process_buffer().
76 CardTableEntryClosure* _mut_process_closure;
77
78 DirtyCardQueue _shared_dirty_card_queue;
79
80 // Apply the closure to the elements of "node" from it's index to
81 // buffer_size. If all closure applications return true, then
82 // returns true. Stops processing after the first closure
83 // application that returns false, and returns false from this
84 // function. If "consume" is true, the node's index is updated to
85 // to exclude the processed elements, e.g. up to the element for
86 // which the closure returned false.
87 bool apply_closure_to_buffer(CardTableEntryClosure* cl,
88 BufferNode* node,
89 bool consume,
90 uint worker_i = 0);
91
92 bool mut_process_buffer(BufferNode* node);
93
94 // Protected by the _cbl_mon.
95 FreeIdSet* _free_ids;
96
97 // The number of completed buffers processed by mutator and rs thread,
98 // respectively.
99 jint _processed_buffers_mut;
100 jint _processed_buffers_rs_thread;
101
102 // Current buffer node used for parallel iteration.
103 BufferNode* volatile _cur_par_buffer_node;
104
105 void concatenate_log(DirtyCardQueue& dcq);
106
107 public:
108 DirtyCardQueueSet(bool notify_when_complete = true);
109
110 void initialize(CardTableEntryClosure* cl,
111 Monitor* cbl_mon,
112 Mutex* fl_lock,
113 int process_completed_threshold,
114 int max_completed_queue,
115 Mutex* lock,
116 DirtyCardQueueSet* fl_owner,
117 bool init_free_ids = false);
118
119 // The number of parallel ids that can be claimed to allow collector or
120 // mutator threads to do card-processing work.
121 static uint num_par_ids();
122
123 static void handle_zero_index_for_thread(JavaThread* t);
124
125 // If there are more than stop_at completed buffers, pop one, apply
126 // the specified closure to its active elements, and return true.
127 // Otherwise return false.
128 //
129 // A completely processed buffer is freed. However, if a closure
130 // invocation returns false, processing is stopped and the partially
131 // processed buffer (with its index updated to exclude the processed
132 // elements, e.g. up to the element for which the closure returned
133 // false) is returned to the completed buffer set.
134 //
135 // If during_pause is true, stop_at must be zero, and the closure
136 // must never return false.
137 bool apply_closure_to_completed_buffer(CardTableEntryClosure* cl,
138 uint worker_i,
139 size_t stop_at,
140 bool during_pause);
141
142 BufferNode* get_completed_buffer(size_t stop_at);
143
144 void reset_for_par_iteration() { _cur_par_buffer_node = _completed_buffers_head; }
145 // Applies the current closure to all completed buffers, non-consumptively.
146 // Can be used in parallel, all callers using the iteration state initialized
147 // by reset_for_par_iteration.
148 void par_apply_closure_to_all_completed_buffers(CardTableEntryClosure* cl);
149
150 DirtyCardQueue* shared_dirty_card_queue() {
151 return &_shared_dirty_card_queue;
152 }
153
154 // Deallocate any completed log buffers
155 void clear();
156
|