Searched defs:hr (Results 1 - 25 of 34) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DheapRegionSets.cpp42 const char* FreeRegionList::verify_region_extra(HeapRegion* hr) { argument
43 if (hr->is_young()) {
48 return HeapRegionLinkedList::verify_region_extra(hr);
53 const char* MasterFreeRegionList::verify_region_extra(HeapRegion* hr) { argument
57 if (!hr->rem_set()->verify_ready_for_par_iteration()) {
60 return FreeRegionList::verify_region_extra(hr);
101 const char* OldRegionSet::verify_region_extra(HeapRegion* hr) { argument
102 if (hr->is_young()) {
107 return HeapRegionSet::verify_region_extra(hr);
143 const char* HumongousRegionSet::verify_region_extra(HeapRegion* hr) { argument
[all...]
H A Dg1OopClosures.inline.hpp126 HeapRegion* hr = _g1h->heap_region_containing((HeapWord*) obj); local
127 if (hr != NULL) {
128 _cm->grayRoot(obj, obj->size(), _worker_id, hr);
H A DheapRegionSeq.inline.hpp44 HeapRegion* hr = _regions_biased[index_biased]; local
45 assert(hr != NULL, "invariant");
46 return hr;
60 HeapRegion* hr = _regions[index];
61 assert(hr != NULL, "sanity");
62 assert(hr->hrs_index() == index, "sanity");
63 return hr;
H A Dg1HRPrinter.cpp78 HeapRegion* hr, HeapWord* top) {
81 HeapWord* bottom = hr->bottom();
77 print(ActionType action, RegionType type, HeapRegion* hr, HeapWord* top) argument
H A Dg1HotCardCache.cpp142 void G1HotCardCache::reset_card_counts(HeapRegion* hr) { argument
143 _card_counts.clear_region(hr);
H A DheapRegionSet.inline.hpp32 inline void HeapRegionSetBase::update_for_addition(HeapRegion* hr) { argument
36 _region_num += hr->region_num();
37 _total_used_bytes += hr->used();
40 inline void HeapRegionSetBase::add_internal(HeapRegion* hr) { argument
41 hrs_assert_region_ok(this, hr, NULL);
42 assert(hr->next() == NULL, hrs_ext_msg(this, "should not already be linked"));
44 update_for_addition(hr);
45 hr->set_containing_set(this);
48 inline void HeapRegionSetBase::update_for_removal(HeapRegion* hr) { argument
53 uint region_num_diff = hr
68 remove_internal(HeapRegion* hr) argument
78 add(HeapRegion* hr) argument
84 remove(HeapRegion* hr) argument
90 remove_with_proxy(HeapRegion* hr, HeapRegionSet* proxy_set) argument
104 add_as_head(HeapRegion* hr) argument
121 add_as_tail(HeapRegion* hr) argument
145 HeapRegion* hr = _head; local
[all...]
H A DheapRegionSeq.cpp132 HeapRegion* hr = at(index);
133 list->add_as_tail(hr);
135 next_bottom = hr->end();
181 void HeapRegionSeq::iterate_from(HeapRegion* hr, HeapRegionClosure* blk) const {
183 if (hr != NULL) {
184 hr_index = hr->hrs_index();
259 HeapRegion* hr = _regions[i]; local
260 guarantee(hr != NULL, err_msg("invariant: i: %u", i));
261 guarantee(hr->bottom() == prev_end,
263 i, HR_FORMAT_PARAMS(hr), prev_en
[all...]
H A DcollectionSetChooser.cpp150 void CollectionSetChooser::add_region(HeapRegion* hr) { argument
151 assert(!hr->isHumongous(),
153 assert(!hr->is_young(), "should not be young!");
154 _regions.append(hr);
156 _remaining_reclaimable_bytes += hr->reclaimable_bytes();
157 hr->calc_gc_efficiency();
189 void CollectionSetChooser::set_region(uint index, HeapRegion* hr) { argument
191 assert(!hr->is_young(), "should not be young!");
192 regions_at_put(index, hr);
193 hr
[all...]
H A DcollectionSetChooser.hpp41 void regions_at_put(uint i, HeapRegion* hr) { argument
42 _regions.at_put((int) i, hr);
44 void regions_at_put_grow(uint i, HeapRegion* hr) { argument
45 _regions.at_put_grow((int) i, hr);
79 err_msg("Unexpected NULL hr in _regions at index %u",
88 void remove_and_move_to_next(HeapRegion* hr) { argument
89 assert(hr != NULL, "pre-condition");
91 assert(regions_at(_curr_index) == hr, "pre-condition");
93 assert(hr->reclaimable_bytes() <= _remaining_reclaimable_bytes,
96 hr
109 should_add(HeapRegion* hr) argument
176 add_region(HeapRegion* hr) argument
192 should_add(HeapRegion* hr) argument
[all...]
H A Dg1CardCounts.cpp167 void G1CardCounts::clear_region(HeapRegion* hr) { argument
168 assert(!hr->isHumongous(), "Should have been cleared");
170 HeapWord* bottom = hr->bottom();
172 // We use the last address in hr as hr could be the
174 // the card for hr->end() will be an OOB accesss to the
176 HeapWord* last = hr->end() - 1;
190 assert(start_addr == hr->bottom(), "alignment");
192 assert((last_addr + CardTableModRefBS::card_size_in_words) == hr->end(), "alignment");
H A Dg1CollectedHeap.inline.hpp40 HeapRegion* hr = _hrs.addr_to_region((HeapWord*) addr); local
41 // hr can be null if addr in perm_gen
42 if (hr != NULL && hr->continuesHumongous()) {
43 hr = hr->humongous_start_region();
45 return hr;
H A Dg1EvacFailure.hpp77 HeapRegion* hr,
82 _g1(g1), _cm(cm), _hr(hr), _marked_bytes(0),
171 bool doHeapRegion(HeapRegion *hr) { argument
175 assert(!hr->isHumongous(), "sanity");
176 assert(hr->in_collection_set(), "bad CS");
178 if (hr->claimHeapRegion(HeapRegion::ParEvacFailureClaimValue)) {
179 if (hr->evacuation_failed()) {
180 RemoveSelfForwardPtrObjClosure rspc(_g1h, _cm, hr, _update_rset_cl,
185 MemRegion mr(hr->bottom(), hr
76 RemoveSelfForwardPtrObjClosure(G1CollectedHeap* g1, ConcurrentMark* cm, HeapRegion* hr, OopsInHeapRegionClosure* update_rset_cl, bool during_initial_mark, bool during_conc_mark, uint worker_id) argument
238 HeapRegion* hr = _g1h->start_cset_region_for_worker(worker_id); local
[all...]
H A Dg1MarkSweep.cpp219 void free_humongous_region(HeapRegion* hr) { argument
220 HeapWord* end = hr->end();
224 assert(hr->startsHumongous(),
226 _g1h->free_humongous_region(hr, &dummy_pre_used, &dummy_free_list,
228 hr->prepare_for_compaction(&_cp);
231 _mrbs->clear(MemRegion(hr->compaction_top(), end));
252 bool doHeapRegion(HeapRegion* hr) { argument
253 if (hr->isHumongous()) {
254 if (hr->startsHumongous()) {
255 oop obj = oop(hr
365 doHeapRegion(HeapRegion* hr) argument
[all...]
H A DheapRegionSet.cpp45 bool HeapRegionSetBase::verify_region(HeapRegion* hr, argument
50 if (hr->isHumongous()) {
54 if (!hr->isHumongous() || !hr->startsHumongous()) {
60 if (hr->is_empty()) {
64 if (!hr->is_empty()) {
71 if (hr->containing_set() != expected_containing_set) {
76 const char* extra_error_message = verify_region_extra(hr);
85 out->print_cr("## Offending Region: "PTR_FORMAT, hr);
86 out->print_cr(" "HR_FORMAT, HR_FORMAT_PARAMS(hr));
138 verify_next_region(HeapRegion* hr) argument
270 HeapRegion* hr = iter.get_next(); local
309 HeapRegion* hr = iter.get_next(); local
[all...]
H A DconcurrentMark.inline.hpp80 inline void ConcurrentMark::count_region(MemRegion mr, HeapRegion* hr, argument
89 uint index = hr->hrs_index();
91 assert(!hr->continuesHumongous(), "should not be HC region");
92 assert(hr == g1h->heap_region_containing(start), "sanity");
93 assert(hr == g1h->heap_region_containing(mr.last()), "sanity");
121 HeapRegion* hr,
125 count_region(mr, hr, marked_bytes_array, task_card_bm);
132 HeapRegion* hr = _g1h->heap_region_containing_raw(addr); local
133 count_region(mr, hr, worker_id);
138 HeapRegion* hr,
120 count_region(MemRegion mr, HeapRegion* hr, uint worker_id) argument
137 count_object(oop obj, HeapRegion* hr, size_t* marked_bytes_array, BitMap* task_card_bm) argument
147 count_object(oop obj, HeapRegion* hr, uint worker_id) argument
158 par_mark_and_count(oop obj, HeapRegion* hr, size_t* marked_bytes_array, BitMap* task_card_bm) argument
174 par_mark_and_count(oop obj, size_t word_size, HeapRegion* hr, uint worker_id) argument
190 par_mark_and_count(oop obj, HeapRegion* hr, uint worker_id) argument
206 HeapRegion* hr = _g1h->heap_region_containing_raw(addr); local
228 mark_and_count(oop obj, HeapRegion* hr) argument
240 HeapRegion* hr = _g1h->heap_region_containing_raw(addr); local
335 HeapRegion* hr = _g1h->heap_region_containing_raw(obj); local
405 grayRoot(oop obj, size_t word_size, uint worker_id, HeapRegion* hr) argument
[all...]
H A Dg1HRPrinter.hpp76 HeapRegion* hr, HeapWord* top);
97 void alloc(HeapRegion* hr, RegionType type, bool force = false) { argument
99 print((!force) ? Alloc : AllocForce, type, hr, NULL);
103 void alloc(RegionType type, HeapRegion* hr, HeapWord* top) { argument
105 print(Alloc, type, hr, top);
109 void retire(HeapRegion* hr) { argument
111 if (!SKIP_RETIRED_FULL_REGIONS || hr->top() < hr->end()) {
112 print(Retire, Unset, hr, hr
117 reuse(HeapRegion* hr) argument
123 cset(HeapRegion* hr) argument
129 evac_failure(HeapRegion* hr) argument
135 cleanup(HeapRegion* hr) argument
141 post_compaction(HeapRegion* hr, RegionType type) argument
[all...]
H A DheapRegionSet.hpp107 virtual const char* verify_region_extra(HeapRegion* hr) { return NULL; } argument
108 bool verify_region(HeapRegion* hr,
130 // It updates the fields of the set to reflect hr being added to
132 inline void update_for_addition(HeapRegion* hr);
134 // It updates the fields of the set to reflect hr being added to
136 inline void add_internal(HeapRegion* hr);
138 // It updates the fields of the set to reflect hr being removed
140 inline void update_for_removal(HeapRegion* hr);
142 // It updates the fields of the set to reflect hr being removed
144 inline void remove_internal(HeapRegion* hr);
240 verify_region_extra(HeapRegion* hr) argument
371 HeapRegion* hr = _curr; local
[all...]
H A DsparsePRT.cpp461 SparsePRT::SparsePRT(HeapRegion* hr) : argument
462 _hr(hr), _expanded(false), _next_expanded(NULL)
H A DheapRegionRemSet.hpp106 // for "hr". If this list contains an entry for "hr", return it,
108 PerRegionTable* find_region_table(size_t ind, HeapRegion* hr) const;
115 // If a PRT for "hr" is in the bucket list indicated by "ind" (which must
116 // be the correct index for "hr"), delete it and return true; else return
118 bool del_single_region_table(size_t ind, HeapRegion* hr);
131 OtherRegionsTable(HeapRegion* hr);
133 HeapRegion* hr() const { return _hr; } function in class:VALUE_OBJ_CLASS_SPEC
217 HeapRegion* hr);
222 HeapRegion* hr() cons function in class:HeapRegionRemSet
[all...]
H A DheapRegion.cpp43 HeapRegion* hr, OopClosure* cl,
46 ContiguousSpaceDCTOC(hr, cl, precision, NULL),
47 _hr(hr), _fk(fk), _g1(g1) { }
193 HeapRegion* hr,
200 if (!g1h->is_obj_dead(cur_oop, hr)) {
525 HeapRegion* hr = g1h->region_at(index); local
526 if (!hr->isHumongous()) {
527 return hr;
42 HeapRegionDCTOC(G1CollectedHeap* g1, HeapRegion* hr, OopClosure* cl, CardTableModRefBS::PrecisionStyle precision, FilterKind fk) argument
192 walk_mem_region_loop(ClosureType* cl, G1CollectedHeap* g1h, HeapRegion* hr, HeapWord* cur, HeapWord* top) argument
H A Dg1CollectorPolicy.hpp301 void set_region_eden(HeapRegion* hr, int young_index_in_cset) { argument
302 hr->set_young();
303 hr->install_surv_rate_group(_short_lived_surv_rate_group);
304 hr->set_young_index_in_cset(young_index_in_cset);
307 void set_region_survivor(HeapRegion* hr, int young_index_in_cset) { argument
308 assert(hr->is_young() && hr->is_survivor(), "pre-condition");
309 hr->install_surv_rate_group(_survivor_surv_rate_group);
310 hr->set_young_index_in_cset(young_index_in_cset);
417 size_t predict_bytes_to_copy(HeapRegion* hr);
[all...]
H A DheapRegion.hpp122 HeapRegion* hr, OopClosure* cl,
583 void set_next_young_region(HeapRegion* hr) { argument
584 _next_young_region = hr;
589 void set_next_dirty_cards_region(HeapRegion* hr) { _next_dirty_cards_region = hr; } argument
/openjdk7/jdk/src/share/sample/vm/jvm-clr/
H A Dinvoker.cpp70 HRESULT hr = CorBindToRuntimeEx(NULL,NULL,0,CLSID_CorRuntimeHost,IID_ICorRuntimeHost,(VOID**)&pHost); local
72 if(!FAILED(hr)) {
76 hr = pHost->Start();
77 if(!FAILED(hr)) {
81 hr = pHost->GetDefaultDomain(&pAppDomainThunk);
82 if(!FAILED(hr)) {
84 hr = pAppDomainThunk->QueryInterface(__uuidof(_AppDomain), (void**)&pAppDomain);
85 if(!FAILED(hr)) {
89 hr = pAppDomain->ExecuteAssembly_2(_bstr_t(wszApplication), &lReturn);
90 if (FAILED(hr)) {
[all...]
/openjdk7/hotspot/src/share/vm/prims/
H A Dwhitebox.cpp61 const HeapRegion* hr = g1->heap_region_containing(result); variable
62 return hr->isHumongous();
/openjdk7/jdk/src/share/native/sun/java2d/cmm/lcms/
H A Dcmscam02.c276 cmsFloat64Number t, e, p1, p2, p3, p4, p5, hr, d2r; local
293 hr = clr.h * d2r;
295 if (fabs(sin(hr)) >= fabs(cos(hr))) {
296 p4 = p1 / sin(hr);
299 (cos(hr) / sin(hr)) - (27.0 / 1403.0) +
301 clr.a = clr.b * (cos(hr) / sin(hr));
304 p5 = p1 / cos(hr);
[all...]

Completed in 190 milliseconds

12