469   // Helper: Merge the current mapping into the given basic block
 470   void merge_common(Block* target, int pnum);
 471   // Helper functions for merging individual cells.
 472   PhiNode *ensure_phi(       int idx, bool nocreate = false);
 473   PhiNode *ensure_memory_phi(int idx, bool nocreate = false);
 474   // Helper to merge the current memory state into the given basic block
 475   void merge_memory_edges(MergeMemNode* n, int pnum, bool nophi);
 476 
 477   // Parse this bytecode, and alter the Parsers JVM->Node mapping
 478   void do_one_bytecode();
 479 
 480   // helper function to generate array store check
 481   void array_store_check();
 482   // Helper function to generate array load
 483   void array_load(BasicType etype);
 484   // Helper function to generate array store
 485   void array_store(BasicType etype);
 486   // Helper function to compute array addressing
 487   Node* array_addressing(BasicType type, int vals, const Type* *result2=NULL);
 488 


 489   // Pass current map to exits
 490   void return_current(Node* value);
 491 
 492   // Register finalizers on return from Object.<init>
 493   void call_register_finalizer();
 494 
 495   // Insert a compiler safepoint into the graph
 496   void add_safepoint();
 497 
 498   // Insert a compiler safepoint into the graph, if there is a back-branch.
 499   void maybe_add_safepoint(int target_bci) {
 500     if (UseLoopSafepoints && target_bci <= bci()) {
 501       add_safepoint();
 502     }
 503   }
 504 
 505   // Note:  Intrinsic generation routines may be found in library_call.cpp.
 506 
 507   // Helper function to setup Ideal Call nodes
 508   void do_call();

 469   // Helper: Merge the current mapping into the given basic block
 470   void merge_common(Block* target, int pnum);
 471   // Helper functions for merging individual cells.
 472   PhiNode *ensure_phi(       int idx, bool nocreate = false);
 473   PhiNode *ensure_memory_phi(int idx, bool nocreate = false);
 474   // Helper to merge the current memory state into the given basic block
 475   void merge_memory_edges(MergeMemNode* n, int pnum, bool nophi);
 476 
 477   // Parse this bytecode, and alter the Parsers JVM->Node mapping
 478   void do_one_bytecode();
 479 
 480   // helper function to generate array store check
 481   void array_store_check();
 482   // Helper function to generate array load
 483   void array_load(BasicType etype);
 484   // Helper function to generate array store
 485   void array_store(BasicType etype);
 486   // Helper function to compute array addressing
 487   Node* array_addressing(BasicType type, int vals, const Type* *result2=NULL);
 488 
 489   void rtm_deopt();
 490 
 491   // Pass current map to exits
 492   void return_current(Node* value);
 493 
 494   // Register finalizers on return from Object.<init>
 495   void call_register_finalizer();
 496 
 497   // Insert a compiler safepoint into the graph
 498   void add_safepoint();
 499 
 500   // Insert a compiler safepoint into the graph, if there is a back-branch.
 501   void maybe_add_safepoint(int target_bci) {
 502     if (UseLoopSafepoints && target_bci <= bci()) {
 503       add_safepoint();
 504     }
 505   }
 506 
 507   // Note:  Intrinsic generation routines may be found in library_call.cpp.
 508 
 509   // Helper function to setup Ideal Call nodes
 510   void do_call();