Searched refs:memory_at (Results 1 - 11 of 11) sorted by relevance
/openjdk9/hotspot/src/share/vm/opto/ |
H A D | intrinsicnode.cpp | 48 mem = mem->is_MergeMem() ? mem->as_MergeMem()->memory_at(alias_idx) : mem;
|
H A D | macroArrayCopy.cpp | 343 Node* slow_mem = mem->memory_at(alias_idx); 361 checked_mem = mem->memory_at(alias_idx); 398 mb->set_req(TypeFunc::Memory, local_mem->memory_at(Compile::AliasIdxRaw)); 410 result_memory->init_req(zero_path, local_mem->memory_at(alias_idx)); 459 result_memory->init_req(bcopy_path, local_mem->memory_at(alias_idx)); 481 done_mem->init_req(1, mem->memory_at(alias_idx)); 487 done_mem->init_req(2, mem->memory_at(alias_idx)); 546 checked_mem = local_mem->memory_at(alias_idx); 575 result_memory->init_req(fast_path, local_mem->memory_at(alias_idx)); 674 result_memory->init_req(slow_call_path, local_mem->memory_at(alias_id [all...] |
H A D | arraycopynode.cpp | 202 Node* v = LoadNode::make(*phase, ctl, mem->memory_at(fieldidx), next_src, adr_type, type, bt, MemNode::unordered); 204 Node* s = StoreNode::make(*phase, ctl, mem->memory_at(fieldidx), next_dest, adr_type, v, bt, MemNode::unordered); 556 start_mem_src = in_mem->as_MergeMem()->memory_at(alias_idx_src); 557 start_mem_dest = in_mem->as_MergeMem()->memory_at(alias_idx_dest);
|
H A D | memnode.cpp | 266 mem = (m->is_MergeMem())? m->as_MergeMem()->memory_at(alias_idx) : m; 695 mem = mem->as_MergeMem()->memory_at(alias_idx); 989 Node* new_st = merge->memory_at(alias_idx); 2658 Node* mem = my_store->as_MergeMem()->memory_at(oop_alias_idx()); 3139 return mem->as_MergeMem()->memory_at(alias_idx); 3308 if (n->as_MergeMem()->memory_at(alias_idx) == m) { 4079 // the distinguished "wide" state. The accessor MergeMemNode::memory_at(N) returns 4081 // it returns the base memory. To prevent bugs, memory_at does not accept <Top> 4087 // "bot_memory()" for "memory_at(AliasIdxBot)" would keep code tidy. 4229 assert(old_mem == memory_at( 4427 Node* MergeMemNode::memory_at(uint alias_idx) const { function in class:MergeMemNode [all...] |
H A D | memnode.hpp | 1385 Node* memory_at(uint alias_idx) const; 1426 // or the memory_at accessor, flaws in the sparseness will 1447 return _mm->memory_at(_idx); 1452 return at_base_memory()? _mm2->base_memory(): _mm2->memory_at(_idx);
|
H A D | idealKit.cpp | 339 Node* p = mem->memory_at(alias_idx);
|
H A D | escape.cpp | 2571 mem = mmem->memory_at(alias_idx); 2593 assert(n == mmem->memory_at(alias_idx), "should be on instance memory slice"); 2594 if (n != mmem->memory_at(general_idx) || alias_idx == general_idx) { 2721 result = mmem->memory_at(C->get_general_index(alias_idx)); 3344 result = nmm->memory_at(_compile->get_general_index(ni));
|
H A D | graphKit.cpp | 1424 Node* p = mem->memory_at(alias_idx); 2603 Node* m = mem->memory_at(C->get_alias_index(gvn->type(p1)->is_ptr())); 2622 m = mem->memory_at(C->get_alias_index(gvn->type(p2)->is_ptr())); 3296 assert(init_in_merge->memory_at(alias_idx) == init_in_raw, "");
|
H A D | macro.cpp | 336 mem = mem->as_MergeMem()->memory_at(alias_idx); 1399 mem = mem->as_MergeMem()->memory_at(Compile::AliasIdxRaw);
|
H A D | parse1.cpp | 1998 Node *o = (idx == Compile::AliasIdxBot)? mem->base_memory(): mem->memory_at(idx);
|
H A D | cfgnode.cpp | 1930 m->as_MergeMem()->memory_at(alias_idx) : m;
|
Completed in 210 milliseconds