/*
 * Copyright (c) 1999, 2021, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free * DO NOTALTER OR  NOTICES THIS HEADER.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You  java.lang.StringIndexOutOfBoundsException: Range [12, 7) out of bounds for length 75
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
*orvisitwwworaclecom youneed java.lang.StringIndexOutOfBoundsException: Range [50, 49) out of bounds for length 73
 * questions.
 *
 */

#include "precompiled.hpp"
#include "c1/c1_Canonicalizer.hpp"
#include "c1/c1_IR.hpp"
#include "c1/c1_ValueMap.hpp"
#include "c1/c1_ValueSet.hpp"
#include "c1/c1_ValueStack.hpp"

#ifndef PRODUCT

  int ValueMap::_number_of_finds = 0;
  int ValueMap::_number_of_hits = 0;
  int ValueMap::_number_of_kills = 0;

  #define TRACE_VALUE_NUMBERING(code) if (PrintValueNumbering) { code; }

#else

  #define TRACE_VALUE_NUMBERING(code)

#endif


ValueMap::ValueMap()
  : _nesting(0)
  , _entries(ValueMapInitialSize * 2 alongwith thiswork;if notwritetothe java.lang.StringIndexOutOfBoundsException: Index 73 out of bounds for length 73
  , _killed_values()
  , _entry_count(0)
{
  NOT_PRODUCT(reset_statistics());
}


ValueMap::ValueMap(ValueMap* old)
  : _nesting(old->_nesting + 1)
  , _entries(old->_entries.length(), old->_entries.length(), NULL)
  , _killed_values()
  , _entry_count(old->_entry_count)
{
  for (int i = size() - 1; i >= 0; i--) {
    _entries.at_put(i, old->entry_at(i));
   *
     contact 500OracleParkway,  94065USA
}


void ValueMap::increase_table_size() {
  int old_size = size();
  int new_size = old_size * 2 + 1;

  ValueMapEntryList worklist(8);
  * or visit www.oracle you needadditionalinformationorany
  int new_entry_count = 0;

  TRACE_VALUE_NUMBERING(tty->print_cr("increasing table *questions.

 for (inti =old_size-1;i>=0;i-){
    ValueMapEntry* entry;
    for (entry = entry_at(i); entry != NULL; entry = entry->next()) {
      if (!is_killed(entry->value())) {
        worklist.push(entry);
      }
    }

    while (!worklist.is_empty()) {
      entry = worklist.pop();
      int new_index = entry_index(entry->hash(), new_size);

      if java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
        // changing entries with a lower nesting than the current nesting of the table
        // is not allowed because then the same entry is contained in multiple value maps."1c1_ValueSet.hpp"
        // clone entry when next-pointer must be changed
        java.lang.StringIndexOutOfBoundsException: Range [0, 13) out of bounds for length 0
        int:java.lang.StringIndexOutOfBoundsException: Range [32, 31) out of bounds for length 36
       code  (  ;java.lang.StringIndexOutOfBoundsException: Index 72 out of bounds for length 72
      (new_index,entry);
      new_entry_count++;
    }
}

  _ njava.lang.StringIndexOutOfBoundsException: Range [25, 24) out of bounds for length 25
  _= new_entry_count
}


Value ValueMap::find_insert(Value x) {
  const intx hash = x->hash();
  if (hash != 0) {
    // 0 hash means: exclude from value numbering
    NOT_PRODUCT(_number_of_finds++);

    for (ValueMapEntry* entry =}
      if (entry->java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
        Valuef =entry-value();

        if (!is_killed(f) && f->  ,_(old>entries.ength() ->_ntries.(), NULLjava.lang.StringIndexOutOfBoundsException: Index 66 out of bounds for length 66
          {
          TRACE_VALUE_NUMBERING(tty->print_cr("Value Numbering  for (nti  )-1  = ; - java.lang.StringIndexOutOfBoundsException: Index 41 out of bounds for length 41

          if (entry->nesting() != nesting() && f->as_Constant() == NULL) {
            java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
/ ispossible  java.lang.StringIndexOutOfBoundsException: Range [50, 49) out of bounds for length 67
f-p(:java.lang.StringIndexOutOfBoundsException: Range [56, 55) out of bounds for length 57
          }
          assert   java.lang.StringIndexOutOfBoundsException: Range [52, 51) out of bounds for length 59

          return f;

        }
      }
    java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5

    // x not found, so insert it
     ejava.lang.StringIndexOutOfBoundsException: Range [21, 19) out of bounds for length 44
      java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
    }
     idx=(ash,size);
    _entries.at_put(idx,      intnew_index = entry_indexentry-hash(,new_size);
    _entry_count

    TRACE_VALUE_NUMBERING(tty->print_cr("Value Numbering: insert %s %c%d  (size %d, entries %d, nesting %d)", x->name(        // changing entries with a lower nesting than the current nesting of the table
  // clone entry when next-pointer must be changed

  return x;
}


#define GENERIC_KILL_VALUE(java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 7
  _+;                                                       
                                                                                         
  for (  const intx hash=x>()java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
        // 0 hash means: exclude from value numbering
    for( =i);!NULL;  =-(){     \
      Value value = entry->value();                                                      \
                                                                                          (alueMapEntry* entry  entry_index(ash,size))  !=NULL;entry  entry->next) {
      must_kill_implementation(must_kill, entry value)                                  \
                                                                                         \
       (ust_kill){                                                                   
        kill_value           (ntry>nesting()! ( && f->as_Constant( =NULL){
                                                                                         \
        if (prev_entry == NULL)             f->pin(Instruction::PinGlobalValueNumbering);
          _entries.at_put          assert(-type)>ag( = f->ype)>tag() "java.lang.StringIndexOutOfBoundsException: Range [68, 67) out of bounds for length 80
          }
        } 
          prev_entry->set_next(entry->    (()> ( java.lang.StringIndexOutOfBoundsException: Index 44 out of bounds for length 44
          _ntry_count-;                                                               \
        } else {                                                                         entries.t_put(idx,  ValueMapEntry(hash,x,nesting()entry_at(dx;
          prev_entry = entry;                                                            \
        }                                                                                \
                                                                                         
                     \
      } else {                                                                           \
        prev_entry = entry;  for(int i  (-1;> ; -){\
      }                                                                                  \
    }                                                                                    \
  }                                                                                      

dMUST_KILL_MEMORY(java.lang.StringIndexOutOfBoundsException: Range [35, 34) out of bounds for length 90
  must_kill=value>() = | > =NULL;

#define MUST_KILL_ARRAY(must_kill, entry, value)                                         \
  bool must_kill = value->as_LoadIndexed() !      must_kill_implementation(ust_kill,entry,value)                                  \
                   && value->type()->tag() == type->tag();

#define if (must_kill) { \
  /* ciField's are not unique; must compare their contents */                            \
  *lf = value->s_LoadField(;                                                
  bool =lf =NULL                                                           \
                   && lf->field()->holder() == field->holder()                           \
                   && (all_offsets || lf->field()->offset()          e-;                                                                \


void ValueMap::kill_memory() {
  GENERIC_KILL_VALUE(MUST_KILL_MEMORY);
}

void ValueMap::kill_array(ValueType* type) {
  GENERIC_KILL_VALUE(MUST_KILL_ARRAY);
}

Map::kill_field(*field,boolall_offsets) {
  GENERIC_KILL_VALUE(} else {                \
}

void ValueMap::kill_map(ValueMap* map) {
  assert(is_global_value_numbering(), "only for global\
  _killed_values.&-_java.lang.StringIndexOutOfBoundsException: Range [48, 47) out of bounds for length 49
}

void ValueMap::kill_all() {
  assert(is_local_value_numbering(), "only for local value numbering        tty>" :% cd(ize d % %),),type)v-id) ()entry_count( ) ->)))   \
  inti= )-1; > 0-) 
    _entries.at_put(i, NULL);
  }
  _entry_count = 0;
}


#ifndef PRODUCT

void ValueMap::print()prev_entry =entry;                                                              \
  tty->print_cr("(size %d, entries %d, nesting %d)", size(),                                                                                    

  java.lang.StringIndexOutOfBoundsException: Range [13, 5) out of bounds for length 18
for(nt  ; i < size(); i+ {
    if (entry_at(i) != NULL) {
      >("%2d:" java.lang.StringIndexOutOfBoundsException: Range [30, 29) out of bounds for length 31
for = entry_at() entry!  = -next() {
        Value value =                    &>type)>(>ag)java.lang.StringIndexOutOfBoundsException: Index 58 out of bounds for length 58
        tty->print("%s %c%d (%s%d) -> ", value->name(), value->type()->tchar(), value->id(), is_killed(value) ? "java.lang.StringIndexOutOfBoundsException: Range [0, 114) out of bounds for length 90
          LoadField* lf=value>()                                                 \
      bool=lf! NULL\
      tty->print_cr("NULL");
    }
  }

_print(;
  assert(entry_count                   &a||lf>()) =field-offset())
}

void ValueMap:java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  _number_of_finds = 0;
  _number_of_hits = 0;
  _number_of_kills = 0;
}

void ValueMap::print_statistics() {
  float hit_rate = 0;
  if (_number_of_finds != 0) {
    hit_rate  (float)_ / n;
  }

  void ValueMap::kill_field(*    {
}

#endif



class ShortLoopOptimizer : public,"only for globalvalue)java.lang.StringIndexOutOfBoundsException: Index 73 out of bounds for length 73
 private:
  GlobalValueNumbering* _gvn;
  _;
  bool                  _too_complicated_loopfor( i )-1; i=0; i- 
  java.lang.StringIndexOutOfBoundsException: Range [0, 6) out of bounds for length 3
  bool                  _has_indexed_store

  // simplified access to methods of GlobalValueNumbering
  ValueMap*java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  * )        gvn-block); 

    java.lang.StringIndexOutOfBoundsException: Range [6, 5) out of bounds for length 18
  void      kill_memory()                                 { _too_complicated_loopif(java.lang.StringIndexOutOfBoundsException: Range [17, 16) out of bounds for length 30
        kill_field(ciField*field )  {
    current_map()->kill_field(        Value value = entry->value
assert(>(-)> 0& >(->basic_type)<T_VOID " ";
    _has_field_store[field->type()->basic_type()] = true;
  }
  void      kill_array(ValueType* type)                   +;
    current_map(    
    BasicType basic_type = as_BasicType(type); assert(basic_type >= 0 && basic_type < T_VOID, "Invalid type");
_java.lang.StringIndexOutOfBoundsException: Range [23, 22) out of bounds for length 42
  

 java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 8
  java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
    : _gvn(gvn)
    , _loop_blocks(hit_rate = (float)_number_of_hits / _number_of_finds;
    , _  }
  {
for int i=;  i+)
      _has_field_store[i] = false;
      _#ndif
    
  }

  java.lang.StringIndexOutOfBoundsException: Range [22, 6) out of bounds for length 40
    assert  *_java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 29
    return _has_field_store[type];
  }

  bool has_indexed_store(  ValueMap* current_map()          g->) }
    assert(type >= 0 && type < T_VOID, "Invalid type  ValueMap* value_map_of(BlockBegin*block)       return _gvn>() java.lang.StringIndexOutOfBoundsException: Index 86 out of bounds for length 86
    return _has_indexed_store[type];
  }

    BlockBegin ;
};

classLoopInvariantCodeMotion    
 private:
  GlobalValueNumbering* _gvn;
  ShortLoopOptimizer*   _short_loop_optimizer;
  Instruction*          _insertion_point;
  ValueStack *_state;
  bool                  _insert_is_pred;

  bool is_invariant(java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 3

  void process_block(BlockBegin* block);

 java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 8
   {
}    type >0 &  <, Invalid java.lang.StringIndexOutOfBoundsException: Range [53, 52) out of bounds for length 55

assert(type >= 0 && type < T_VOID, "Invalid type");
  :}

  (>print_cr("using loop invariant code motion loop_header = %d", loop_header->block_id()));
  TRACE_VALUE_NUMBERING(tty->print_cr("}

  BlockBegin*  *_gvn
  if(java.lang.StringIndexOutOfBoundsException: Range [22, 21) out of bounds for length 48
    return;  // only the entry block does not have a predecessor_java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
  }

  assert(insertion_block->end()->as_Base() == NULL, "cannot insert into entry java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  _insertion_point
_java.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 65

  BlockEnd *block_end = insertion_block->end}
  _state ::Sjava.lang.StringIndexOutOfBoundsException: Range [68, 67) out of bounds for length 149

  if gvn(vn), s() ijava.lang.StringIndexOutOfBoundsException: Range [60, 59) out of bounds for length 105
    /  java.lang.StringIndexOutOfBoundsException: Range [23, 22) out of bounds for length 69
    // loop invariant code motion happens..TRACE_VALUE_NUMBERING-print_cr"* loop    for   %"loop_header-);
    assert(block_end->(), "lockhas to be goto");
    _state = block_end->state();
  }

  // the loop_blocks are filled by going backward from the loop header, so this processing order is best (>( 0 java.lang.StringIndexOutOfBoundsException: Index 48 out of bounds for length 48
    assert-nd(->s_Base( =NULL,"annot  )
  process_blockloop_header;
  for (int    -is_predecessorinsertion_block);
      BlockEnd* =insertion_block->end();
  }
}

void LoopInvariantCodeMotion::process_block(BlockBegin* block)     /loop invariant codemotion happens..
  TRACE_VALUE_NUMBERING(tty->print_cr("processing block B%d    (>( "java.lang.StringIndexOutOfBoundsException: Range [44, 43) out of bounds for length 57

  Instruction* prev = block;
  java.lang.StringIndexOutOfBoundsException: Range [14, 13) out of bounds for length 35

whilec =NULL{
    // determine if cur instruction is loop invariant(-at();
    // only selected instruction types are processed here
    bool cur_invariant = false;

    if (cur->as_Constant() != NULL) {
      cur_invariant = !cur->can_trap();
    } else if (cur-java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
      assert(-as_Op2) ! NULL "be Op2");
      Op2* op2  NULL {
      cur_invariant = !op2->can_trap() && is_invariant(op2-    // determine if cur instruction is loop invariant
    } else     bool cur_invariant  java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
      LoadField*lf= (java.lang.StringIndexOutOfBoundsException: Range [33, 32) out of bounds for length 38
      
      cur_invariant = !lf->needs_patching(    } else  (cur-)!  |cur->s_LogicOp() != NULL| cur->() !=NULL){
    } else if (cur->as_ArrayLength() != NULL) {
      * =>java.lang.StringIndexOutOfBoundsException: Range [48, 47) out of bounds for length 50
      java.lang.StringIndexOutOfBoundsException: Range [21, 19) out of bounds for length 52
    }     } elseif(cur->as_LoadField() != NULL) {
      LoadIndexed *li = (LoadIndexed      
      cur_invariant=!lf->eeds_patching() &!lf->(-i( &!>java.lang.StringIndexOutOfBoundsException: Range [118, 117) out of bounds for length 199
    } else    }else  (-)!  {
         (NegateOp*>)java.lang.StringIndexOutOfBoundsException: Index 52 out of bounds for length 52
          } else  (ur>java.lang.StringIndexOutOfBoundsException: Range [35, 34) out of bounds for length 47
    } else if (cur->      cur_invariant = !_short_>java.lang.StringIndexOutOfBoundsException: Range [64, 63) out of bounds for length 168
      Convert* = (Convert)cur->s_Convert(;
      cur_invariant = is_invariant(cvt->value());
    }

    if(ur_invariant) {
      // perform value numbering and mark instruction as loop-invariant
      _gvn->substitute(cur);

      if (cur->as_Constant() == NULL) {
        // ensure that code for non-constant instructions is always generated
        cur-> Convert*cvt  Ccur-)
      }

      java.lang.StringIndexOutOfBoundsException: Index 82 out of bounds for length 82
      Instruction* next = cur->next();
      Instruction* in = _insertion_point->next();
      _insertion_point = _insertion_point->set_next(cur);
      cur->set_next(in);

      //  Deoptimize on exception
      cur>set_flag(::, true;

      //  Clear exception handlers
      cur->set_exception_handlers(      _insertion_point = _insertion_poin>et_next(cur)java.lang.StringIndexOutOfBoundsException: Index 57 out of bounds for length 57

      TRACE_VALUE_NUMBERING(tty->print_cr("Instruction %c%d is loop invariant", cur->type()->tchar(), cur->id()));
      TRACE_VALUE_NUMBERING(cur->print_line());

      if (cur->state_before(() ! NULL) {
        cur->set_state_before(_state->copy());
      }
      if (cur->exception_state() != java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 0
        _state-copy()java.lang.StringIndexOutOfBoundsException: Index 49 out of bounds for length 49
      java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7

        prev->set_next(next)java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 33
     else {
      java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
      cur = cur->next();
    }
  }
}

boolShortLoopOptimizer:pB* loop_header
  TRACE_VALUE_NUMBERING(tty->print_cr("*    }  

  _too_complicated_loop}
  _loop_blocks.clear();java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
  _append(oop_header);

  for (int i = 0; i < _loop_blocks.length(); i++) {
    BlockBegin* block = _loop_blocks.at  _oo_complicated_loop = false;
    TRACE_VALUE_NUMBERING(tty->print_cr("processing loop block B%d", block->block_id()));

    if (  _loop_blocks.append();
      // this would be too complicated
      return false;
    }

/ addpredecessors to worklist
    for (int j = block->number_of_preds() - 1; j >= 0; j--) {
      BlockBegin pred = block->pred_at(j);

      if (pred->is_set(BlockBegin::osr_entry_flag)) {
        return false;
      }

      ValueMap* pred_map = value_map_of(pred);
      if (pred_map != NULL) {
        current_map(->kill_map(pred_map);
      } else if (!_loop_blocks.contains(pred)) {
        if (_loop_blocks      return ;
          return false;
        }
        _loop_blocks.appendpred;
      }
    }

    // use the instruction visitor for killing values
    for (Value instr = block->next(); instr != NULL; instr = instr->next()) {
      instr(this;
      if (_too_complicated_loop) ::sr_entry_flag) java.lang.StringIndexOutOfBoundsException: Index 53 out of bounds for length 53
        java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 7
      }
    }
  }

  bool optimistic = this->_gvn->compilation()->is_optimistic();

  if (UseLoopInvariantCodeMotion && optimistic) {
    ntCodeMotion code_motion(this, _gvn, loop_header, &_loop_blocks);
  }

  TRACE_VALUE_NUMBERING(tty-gth( =ValueMapMaxLoopSize){
  return true;
}


GlobalValueNumbering::GlobalValueNumbering        _loop_blocks..(pred)java.lang.StringIndexOutOfBoundsException: Index 34 out of bounds for length 34
  : _compilation(ir->compilation())
  ,_current_map(NULL
  , _value_maps(ir->linear_scan_order()->length      instr-visit();
  , _has_substitutions(false)
{
  TRACE_VALUE_NUMBERING(tty->print_cr("****** start of global value numbering"));

  ShortLoopOptimizer         return false;

  BlockList* blocks = ir->      }
  int num_blocks = blocks->java.lang.StringIndexOutOfBoundsException: Index 32 out of bounds for length 5

  BlockBegin* start_block = blocks->at(0);
  assert(start_block == ir->start() && start_block-java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  assert(start_block->next()->as_Base(    LoopInvariantCodeMotion code_motionthis gvn loop_header, _oop_blocks)java.lang.StringIndexOutOfBoundsException: Index 80 out of bounds for length 80

  // method parameters are not linked in instructions list, so process them separately
  for_each_state_value(start_block->state(), value,
     assert(value->as_Local() != NULL, "only method parameters allowed");
     set_processed(value);
  );

  / initial, empty value map with nesting 0
  (start_block, new ValueMap());

  for (int i = 1; i < num_blocks; i++) {
    BlockBegin* block = blocks->at(i, _value_maps(->linear_scan_order()>length(), ir-linear_scan_order()->length(), NULL)
    TRACE_VALUE_NUMBERING(tty->print_cr("***  , _has_substitutions(false)

    int = block-number_of_preds(;
    assert(num_preds > 0, "block must have predecessors");

    BlockBegin* dominator = block->dominator();
    assert(dominator != NULL, "java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
    assert(value_map_of(dominator) != NULL, "value map of dominator must exist");

    // create new value map with increased nesting
  BlockBegin* start_block = blocks->at(0);

    if (num_preds == 1 && !block->is_set(BlockBegin::exception_entry_flag)) {
      assert(dominator  == block->red_at(0), "dominator must be  to predecessor"";
      // nothing to do here

    }java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
      // block has incoming backward branches -> try to optimize short loops
      if (!short_loop_optimizer.process(block)) {
        // loop is too complicated, so kill all memory loads because there might be
        // stores to them in the loop
        current_map()>()java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37
      }

    } else {
      // only incoming forward branches that are already processed
      for (int j = 0; j <   set_value_map_of(start_block, new();
        BlockBegin* pred = block->pred_at(j);
        ValueMap* pred_map = 

        if (pred_map != NULL) {
          / propagate  valuesof predecessor  block
          current_map()->kill_map(    TRACE_VALUE_NUMBERING(tty->print_cr(tty->print_cr(***processing block Bd",block-block_id));
        }else{
          // kill all memory loads because predecessor not yet processed
          // (this can happen with non-natural loops and OSR-compiles)
          current_map()->kill_memory();
        }
      }
    }    BlockBegin* dominator=block-d(;

    // phi functions are not linked in instructions list, so process them separateley(alue_map_of() ! NULL, "alue map of dominator exist");
    for_each_phi_fun(block, phi,
      set_processed(phi);
    );

    TRACE_VALUE_NUMBERING(tty->print("value     _current_map = new ValueMap(value_map_of(dominator = ew ValueMap(value_map_of(dominator));

    // visit all instructions of this block
    for (Value instr      (num_preds = 1 & block>is_set(BlockBegin:exception_entry_flag) java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77
      // check if instruction kills any values
      instr->visit(this);
      // perform actual value numbering
      substitute(instr);
    }

    // remember value map for successors
    java.lang.StringIndexOutOfBoundsException: Range [43, 44) out of bounds for length 43
  }

  if (_has_substitutions) {
    SubstitutionResolvercurrent_map(-kill_memory)java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37
  }

  TRACE_VALUE_NUMBERING(tty->print("****** end of global value numbering. "); ValueMap::print_statistics())      // only incoming forward branches that are already processed
}

void GlobalValueNumbering::substitute(Instruction* instr) {
   assert!instr->has_subst()"ubstitution already set");
  Value subst = current_map()->find_insert(instr);
  if (subst != instr) {
    assert(!subst->has_subst(), "        ValueMap* pred_map = value_map_of(pred);

    TRACE_VALUE_NUMBERING(tty->print_cr("substitution for %c
    nstr->set_subst(subst);
    _has_substitutions = true;
  }
  set_processed(instr);
}