Searched defs:end_idx (Results 1 - 7 of 7) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1HotCardCache.cpp105 int end_idx = start_idx + _hot_cache_par_chunk_size; local
108 Atomic::cmpxchg(end_idx, &_hot_cache_par_claimed_idx, start_idx)) {
109 // The current worker has successfully claimed the chunk [start_idx..end_idx)
110 end_idx = MIN2(end_idx, _n_hot);
111 for (int i = start_idx; i < end_idx; i++) {
H A DconcurrentMark.inline.hpp35 BitMap::idx_t end_idx,
38 // Set the exclusive bit range [start_idx, end_idx).
39 assert((end_idx - start_idx) > 0, "at least one card");
40 assert(end_idx <= card_bm->size(), "sanity");
43 end_idx = MIN2(end_idx, card_bm->size());
49 if ((end_idx - start_idx) <= 8) {
50 for (BitMap::idx_t i = start_idx; i < end_idx; i += 1) {
60 card_bm->par_at_put_range(start_idx, end_idx, true);
62 card_bm->set_range(start_idx, end_idx);
33 set_card_bitmap_range(BitMap* card_bm, BitMap::idx_t start_idx, BitMap::idx_t end_idx, bool is_par) argument
101 BitMap::idx_t end_idx = card_bitmap_index_for(end); local
[all...]
H A DconcurrentMark.cpp1317 BitMap::idx_t end_idx = _cm->card_bitmap_index_for(obj_end); local
1320 // could be actually just beyond the end of the heap; end_idx
1326 end_idx += 1;
1330 _cm->set_card_bitmap_range(_card_bm, start_idx, end_idx, true /* is_par */);
1343 BitMap::idx_t end_idx = _cm->card_bitmap_index_for(top); local
1346 // could be actually just beyond the end of the heap; end_idx
1352 end_idx += 1;
1354 _cm->set_card_bitmap_range(_card_bm, start_idx, end_idx, true /* is_par */);
1469 BitMap::idx_t end_idx = _cm->card_bitmap_index_for(hr->top()); local
1471 for (BitMap::idx_t i = start_idx; i < end_idx;
1608 BitMap::idx_t end_idx = _cm->card_bitmap_index_for(top); local
2970 BitMap::idx_t end_idx = _cm->card_bitmap_index_for(end); local
[all...]
/openjdk7/hotspot/src/share/vm/classfile/
H A DsymbolTable.cpp776 void StringTable::buckets_do(OopClosure* f, int start_idx, int end_idx) { argument
781 assert(0 <= end_idx && end_idx <= limit,
782 err_msg("end_idx (" INT32_FORMAT ") oob?", end_idx));
783 assert(start_idx <= end_idx,
784 err_msg("Ordering: start_idx=" INT32_FORMAT", end_idx=" INT32_FORMAT,
785 start_idx, end_idx));
787 for (int i = start_idx; i < end_idx; i += 1) {
822 int end_idx local
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dblock.hpp261 uint end_idx() const { function in class:Block
264 // This will not give correct end_idx for block 0 when it only contains root.
274 Node *end() const { return _nodes[end_idx()]; }
278 void add_inst( Node *n ) { _nodes.insert(end_idx(),n); }
H A Dgcm.cpp1019 uint end_latency = _node_latency->at_grow(LCA->_nodes[LCA->end_idx()]->_idx);
1043 LCA->_nodes[LCA->end_idx()]->_idx,
1065 uint end_idx = LCA->end_idx(); local
1066 uint end_lat = _node_latency->at_grow(LCA->_nodes[end_idx]->_idx);
1071 LCA->_pre_order, LCA->_nodes[0]->_idx, start_lat, end_idx, end_lat, LCA_freq);
1689 int eidx = end_idx();
1773 int eidx = end_idx();
1825 int eidx = end_idx();
1870 int eidx = end_idx();
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DpsParallelCompact.cpp621 const size_t end_idx = addr_to_region_idx(target_end); local
626 beg_idx, end_idx);
628 for (size_t idx = beg_idx; idx < end_idx; ++idx) {

Completed in 72 milliseconds