Lines Matching defs:dest

247   int  dest() const            { return _dest; }
251 void setRange(jint lo, jint hi, int dest, int table_index) {
253 _lo = lo, _hi = hi; _dest = dest; _table_index = table_index;
255 bool adjoinRange(jint lo, jint hi, int dest, int table_index) {
257 if (lo == _hi+1 && dest == _dest && table_index == _table_index) {
264 void set (jint value, int dest, int table_index) {
265 setRange(value, value, dest, table_index);
267 bool adjoin(jint value, int dest, int table_index) {
268 return adjoinRange(value, value, dest, table_index);
273 tty->print(" {%d}=>%d", lo(), dest());
275 tty->print(" {..%d}=>%d", hi(), dest());
277 tty->print(" {%d..}=>%d", lo(), dest());
279 tty->print(" {%d..%d}=>%d", lo(), hi(), dest());
311 int dest = iter().get_dest_table(j+3);
312 makes_backward_branch |= (dest <= bci());
314 if (rp < 0 || !ranges[rp].adjoin(match_int, dest, table_index)) {
315 ranges[++rp].set(match_int, dest, table_index);
363 int dest = table[j+j+1];
366 makes_backward_branch |= (dest <= bci());
370 if( rp < 0 || !ranges[rp].adjoin(match_int, dest, table_index) ) {
371 ranges[++rp].set(match_int, dest, table_index);
410 if (lo->dest() == hi->dest()) {
412 default_dest = lo->dest();
415 default_dest = lo->dest();
418 default_dest = hi->dest();
425 if (default_dest == lo->dest()) lo++;
426 if (default_dest == hi->dest()) hi--;
475 Node* input = _gvn.transform(new (C) JumpProjNode(jtn, i, r->dest(), j - lowval));
479 jump_if_always_fork(r->dest(), r->table_index());
508 if (p->dest() == target->start()) successors_found++;
526 if (lo->lo() < min_val) lo->setRange(min_val, lo->hi(), lo->dest(), lo->table_index());
528 if (hi->hi() > max_val) hi->setRange(hi->lo(), max_val, hi->dest(), hi->table_index());
540 jump_if_always_fork(lo->dest(), lo->table_index());
561 jump_if_false_fork(iff_ne, mid->dest(), mid->table_index());
566 bool eq_test_only = (hi == lo+2 && hi->dest() == lo->dest());
591 jump_if_true_fork(iff_ge, mid->dest(), mid->table_index());