Mercurial > hg > truffle

comparison src/share/vm/gc_implementation/g1/g1MMUTracker.cpp @ 1286:ab75c83d7c37

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge
author johnc
date Tue, 02 Mar 2010 13:57:46 -0800
parents b81f3572f355
children c18cbe5936b8 f16f1d7893de
comparison
equal deleted inserted replaced
1281:7d236a9688c5 1286:ab75c83d7c37
86 // increase the array size (:-) 86 // increase the array size (:-)
87 // remove the oldest entry (this might allow more GC time for 87 // remove the oldest entry (this might allow more GC time for
88 // the time slice than what's allowed) 88 // the time slice than what's allowed)
89 // consolidate the two entries with the minimum gap between them 89 // consolidate the two entries with the minimum gap between them
90 // (this might allow less GC time than what's allowed) 90 // (this might allow less GC time than what's allowed)
91 guarantee(NOT_PRODUCT(ScavengeALot ||) G1ForgetfulMMUTracker, 91 guarantee(NOT_PRODUCT(ScavengeALot ||) G1UseFixedWindowMMUTracker,
92 "array full, currently we can't recover unless +G1ForgetfulMMUTracker"); 92 "array full, currently we can't recover unless +G1UseFixedWindowMMUTracker");
93 // In the case where ScavengeALot is true, such overflow is not 93 // In the case where ScavengeALot is true, such overflow is not
94 // uncommon; in such cases, we can, without much loss of precision 94 // uncommon; in such cases, we can, without much loss of precision
95 // or performance (we are GC'ing most of the time anyway!), 95 // or performance (we are GC'ing most of the time anyway!),
96 // simply overwrite the oldest entry in the tracker: this 96 // simply overwrite the oldest entry in the tracker: this
97 // is also the behaviour when G1ForgetfulMMUTracker is enabled. 97 // is also the behaviour when G1UseFixedWindowMMUTracker is enabled.
98 _head_index = trim_index(_head_index + 1); 98 _head_index = trim_index(_head_index + 1);
99 assert(_head_index == _tail_index, "Because we have a full circular buffer"); 99 assert(_head_index == _tail_index, "Because we have a full circular buffer");
100 _tail_index = trim_index(_tail_index + 1); 100 _tail_index = trim_index(_tail_index + 1);
101 } else { 101 } else {
102 _head_index = trim_index(_head_index + 1); 102 _head_index = trim_index(_head_index + 1);