1050 } |
1050 } |
1051 |
1051 |
1052 |
1052 |
1053 } |
1053 } |
1054 |
1054 |
1055 |
|
1056 bool HeapRegionRemSet::_par_traversal = false; |
|
1057 |
|
1058 void HeapRegionRemSet::set_par_traversal(bool b) { |
|
1059 assert(_par_traversal != b, "Proper alternation..."); |
|
1060 _par_traversal = b; |
|
1061 } |
|
1062 |
|
1063 int HeapRegionRemSet::num_par_rem_sets() { |
1055 int HeapRegionRemSet::num_par_rem_sets() { |
1064 // We always have at least two, so that a mutator thread can claim an |
1056 // We always have at least two, so that a mutator thread can claim an |
1065 // id and add to a rem set. |
1057 // id and add to a rem set. |
1066 return (int) MAX2(ParallelGCThreads, (size_t)2); |
1058 return (int) MAX2(ParallelGCThreads, (size_t)2); |
1067 } |
1059 } |