Lines Matching refs:empty_mem

3961 // This use of top is named "empty_memory()", or "empty_mem" (no-memory) as a variable.
4008 Node* empty_mem = make_empty_memory();
4010 init_req(i,empty_mem);
4012 assert(empty_memory() == empty_mem, "");
4016 assert(mdef->empty_memory() == empty_mem, "consistent sentinels");
4043 Node* empty_mem = empty_memory();
4044 if (base_mem != empty_mem) { // Memory path is not dead?
4047 if (mem != empty_mem && mem != base_mem) {
4068 Node* empty_mem = empty_memory();
4069 if (old_base == empty_mem)
4113 assert(!old_mbase || old_mbase->is_empty_memory(empty_mem), "consistent sentinels");
4120 if (old_mem == empty_mem) old_mem = old_base;
4144 new_mem = (new_base == this || new_base == empty_mem)? empty_mem : new_base;
4171 if (new_in == new_base) new_in = empty_mem;
4191 set_req(Compile::AliasIdxBot, empty_mem);
4200 m->is_MergeMem() && m->as_MergeMem()->base_memory() == empty_mem) ) {
4202 set_req(Compile::AliasIdxBot, empty_mem);
4206 if( base_memory() == empty_mem ) {
4212 if( in(i) != empty_mem ) { set_req(i, empty_mem); }
4238 Node* empty_mem = empty_memory();
4242 if (new_base != empty_mem) {
4244 if (in(i) == new_base) set_req(i, empty_mem);
4357 Node* empty_mem = empty_memory();
4358 if (n == base_memory()) n = empty_mem; // collapse default
4361 if (n == empty_mem) return; // already the default, so do not grow me
4364 add_req(empty_mem);
4395 Node* empty_mem = empty_memory();
4396 assert(other->is_empty_memory(empty_mem), "consistent sentinels");
4399 if (other->in(i) != empty_mem) {
4401 while (req() < new_len) add_req(empty_mem);