if (!ResultCarrier.conforms(node.getInstruction())) {
OPT_Instruction s = node.getInstruction(); if (s.operator == GUARD_COMBINE || s.operator == GUARD_COND_MOVE || s.operator == GUARD_MOVE || !ResultCarrier.conforms(s)) {
  private void readySetInsert(OPT_BURS_TreeNode node) {    // Adjust numRegisters to bias away from picking trees that    // are rooted in result carriers, since they start a new live     // range.    if (!ResultCarrier.conforms(node.getInstruction())) {      node.setNumRegisters(node.numRegisters()+2);    }    numElements++;    if (numElements == heap.length) {      OPT_BURS_TreeNode[] tmp = new OPT_BURS_TreeNode[heap.length*2];      for (int i=0; i<heap.length; i++) {	tmp[i] = heap[i];      }      heap = tmp;    }    // restore heap property    int current = numElements;    heap[current] = node;    for (int parent = current / 2;	 current > 1 && heap[current].numRegisters() > heap[parent].numRegisters();	 current = parent, parent = current / 2) {      swap(current, parent);    }  }