Lines Matching defs:map
140 // The safepoint is a map which will feed an uncommon trap.
177 // Helper routine which sets up elements of the initial parser map when
178 // performing a parse for on stack replacement. Add values into map.
186 // Mismatch between method and jvms can occur since map briefly held
191 assert((int)jvms()->endoff() == (int)map()->req(), "sanity");
237 map()->push_monitor(flock);
369 SafePointNode* types_are_good = map();
542 // Setup the initial JVM state map.
545 // Check for bailouts during map initialization
574 entry_map = map(); // capture any changes performed by method setup code
575 assert(jvms()->endoff() == map()->req(), "map matches JVMS layout");
660 // Leave behind an undisturbed copy of the map, for future merges.
757 SafePointNode* map = new (this) SafePointNode(max_size, NULL);
758 record_for_igvn(map);
772 map->init_req(i, parm);
776 for (; i < map->req(); i++) {
777 map->init_req(i, top());
781 map->set_jvms(jvms);
782 jvms->set_map(map);
865 assert(stopped(), "catch_inline_exceptions trashes the map");
875 // Merge the given map into an exception exit from this method.
881 caller.set_map_clone(_caller->map());
886 caller.map()->set_req(i, ex_map->in(i));
953 SafePointNode* normal_map = kit.map(); // keep this guy safe
963 ex_jvms->map()->set_jvms(ex_jvms);
968 kit.map()->push_monitor(_synch_lock);
983 assert(_exits.map() == normal_map, "keep the same return state");
997 // Initialize our parser map to contain the types at method entry.
998 // For OSR, the map contains a single RawPtr parameter.
1025 jvms->set_map(map());
1026 record_for_igvn(map());
1029 SafePointNode* inmap = _caller->map();
1036 map()->init_req(i, inmap->in(i));
1040 assert(map()->memory()->Opcode() == Op_Parm, "");
1050 map()->init_req(i, inmap->argument(_caller, i - TypeFunc::Parms));
1053 // Clear out the rest of the map (locals and stack)
1055 map()->init_req(i, top());
1107 // Initialize our parser map to contain the types/monitors at method entry.
1323 // Load block/map/sp. But not do not touch iter/bci.
1513 // which must not be allowed into this block's map.)
1557 SafePointNode* newin = map();// Hang on to incoming mapping
1586 // Update all the non-control inputs to map:
1587 assert(TypeFunc::Parms == newin->jvms()->locoff(), "parser map should contain only youngest jvms");
1590 Node* m = map()->in(j); // Current state of target.
1609 const JVMState* jvms = map()->jvms();
1642 map()->set_req(j, _gvn.transform_no_reclaim(phi));
1750 uint monoff = map()->jvms()->monoff();
1751 uint nof_monitors = map()->jvms()->nof_monitors();
1753 assert(TypeFunc::Parms == map()->jvms()->locoff(), "parser map should contain only youngest jvms");
1766 ensure_phi(map()->jvms()->monitor_obj_offset(m));
1774 // If there is no map, return the lowest unused path number.
1775 if (!is_merged()) return pred_count()+1; // there will be a map shortly
1777 SafePointNode* map = start_map();
1778 if (!map->control()->is_Region())
1780 RegionNode* r = map->control()->as_Region();
1786 for (uint i = 1; i < map->req(); i++) {
1787 Node* n = map->in(i);
1809 // Turn the idx'th entry of the current map into a Phi
1811 SafePointNode* map = this->map();
1812 Node* region = map->control();
1815 Node* o = map->in(idx);
1826 const JVMState* jvms = map->jvms();
1845 map->set_req(idx, top());
1852 map->set_req(idx, top());
1859 map->set_req(idx, phi);
1986 SafePointNode* exit_return = _exits.map();
2068 Node* mem = MergeMemNode::make(C, map()->memory());