(uint i) {   int eidx = end_idx();   Node *n = get_node(eidx);  // Get ending Node    int op = n->Opcode();   if (n->is_Mach()) {     if (n->is_MachNullCheck()) {       // In theory, either side can fall-thru, for simplicity sake,       // let's say only the false branch can now.       return 