Cross Reference: /openjdk7/hotspot/src/share/vm/opto/compile.cpp

Lines Matching refs:at
99 // Return the index at which m must be inserted (or already exists).
104     CallGenerator* cg1 = _intrinsics->at(i-1);
105     CallGenerator* cg2 = _intrinsics->at(i);
116     ciMethod* mid_m = _intrinsics->at(mid)->method();
122       // look at minor sort key
123       bool mid_virt = _intrinsics->at(mid)->is_virtual();
149     CallGenerator* oldcg = _intrinsics->at(index);
152     _intrinsics->append(_intrinsics->at(len-1));
155       _intrinsics->at_put(pos+1,_intrinsics->at(pos));
167         && _intrinsics->at(index)->method() == m
168         && _intrinsics->at(index)->is_virtual() == is_virtual) {
169       return _intrinsics->at(index);
342     Node *n  = useful.at(next);
370     CallGenerator* cg = inlines->at(i);
382 // Disconnect all useless nodes by disconnecting those at the boundary.
386     Node *n = useful.at(next++);
552   // allocated at the beginning of the compile task, and
557   assert(blob != NULL, "Initialize BufferBlob at start");
673     // so we can at least track the decompile_count().
687   // Even if NO memory addresses are used, MergeMem nodes must have at least 1 slice
1010   _immutable_memory = NULL; // filled in at first inquiry
1180               useful.at(i)->dump();
1264 // single covering check that is at least as strong as any of them.
1379       // object's klass is unloaded at compile time (4965979).
1458     case Type::AryPtr:   // do not distinguish arrays at all
1465   case 2:                       // No collapsing at level 2; keep all splits
1466   case 3:                       // No collapsing at level 3; keep all splits
1493 void Compile::AliasType::Init(int i, const TypePtr* at) {
1495   _adr_type = at;
1498   const TypeOopPtr *atoop = (at != NULL) ? at->isa_oopptr() : NULL;
1831     CallGenerator* cg = _late_inlines.at(i);
1838     _late_inlines.at_put(j, _late_inlines.at(i));
2058     // at least to this point, even if no loop optimizations were done.
2100   // nodes.  Mapping is only valid at the root of each matched subtree.
2111   // nodes.  Mapping is only valid at the root of each matched subtree.
2150     // no longer accurate (at spill code) and so must be ignored.
3030     _expensive_nodes->at(i)->set_req(0, NULL);
3111 // Report if there are too many traps at the current method and bci.
3157 // Report if there are too many recompiles at the current method and bci.
3364     Constant con = _constants.at(i);
3398     Constant con = _constants.at(i);
3440   int offset = _constants.at(idx).offset();
3448     if (idx != -1 && _constants.at(idx).can_be_reused()) {
3507     *constant_addr = cb.consts()->target(*labels.at(i), (address) constant_addr);
3517       CallGenerator* cg = _late_inlines.at(i);
3523       Node* n  = useful.at(next);
3537       tty->print(_print_inlining_list->at(i).ss()->as_string());
3587     Node* n = _expensive_nodes->at(i);
3597   // and check for at least two nodes of identical kind with same data
3626     if (_expensive_nodes->at(i)->Opcode() == _expensive_nodes->at(i+1)->Opcode()) {
3628       _expensive_nodes->at_put(j++, _expensive_nodes->at(i));
3632       _expensive_nodes->at_put(j++, _expensive_nodes->at(i));
3635       Node* n = _expensive_nodes->at(i);
3642     _expensive_nodes->at_put(j++, _expensive_nodes->at(i));
3644     Node* n = _expensive_nodes->at(i);