Lines Matching +defs:val +defs:delay
59 // The val is the pointer being checked for nullness or
61 void Block::implicit_null_check(PhaseCFG *cfg, Node *proj, Node *val, int allowed_reasons) {
124 bool is_decoden = ((intptr_t)val) & 1;
125 val = (Node*)(((intptr_t)val) & ~1);
127 assert(!is_decoden || (val->in(0) == NULL) && val->is_Mach() &&
128 (val->as_Mach()->ideal_Opcode() == Op_DecodeN), "sanity");
134 for (DUIterator i = val->outs(); val->has_out(i); i++) {
135 Node *m = val->out(i);
156 assert(mach->in(2) == val, "should be address");
171 if( mach->in(2) != val ) continue;
198 if (val == base ||
199 val == index && val->bottom_type()->isa_narrowoop()) {
214 if( val->bottom_type()->isa_narrowoop() &&
256 if( mach->in(j) == val ) {
258 // Ignore DecodeN val which could be hoisted to where needed.
319 Block *valb = cfg->_bbs[val->_idx];
322 valb->find_remove(val);
323 this->add_inst(val);
324 cfg->_bbs.map(val->_idx,this);
327 for (DUIterator_Fast jmax, j = val->fast_outs(jmax); j < jmax; j++) {
328 Node* n = val->fast_out(j);
425 // See caller for how this is used to delay scheduling
756 Node_List delay;
766 delay.push(m);
776 while (delay.size()) {
777 Node* d = delay.pop();