Searched refs:fast_out (Results 1 - 25 of 28) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/opto/
H A Dlcm.cpp328 Node* n = val->fast_out(j);
350 Node* n = best->fast_out(j);
464 Node* use = n->fast_out(j);
545 Node* m = this_call->fast_out(i);
581 Node* n = mcall->fast_out(i);
597 Node* m = n->fast_out(j); // Get user
748 Node* m = n->fast_out(j);
851 Node* m = n->fast_out(i5); // Get user
1045 out->push(n->fast_out(j1));
H A Dloopopts.cpp243 Node* cd = dp->fast_out(i); // Control-dependent node
497 Node *out = region->fast_out(i);
552 Node* use = phi->fast_out(k);
597 Node *out = region->fast_out(i);
730 weight += region->fast_out(i)->outcnt();
756 Node* n = region->fast_out(i);
759 Node* m = n->fast_out(j);
929 Node* u = n->fast_out(i);
1311 worklist.push(old->fast_out(j));
1380 worklist.push(old->fast_out(
[all...]
H A DloopUnswitch.cpp164 ProjNode* proj= unswitch_iff->fast_out(i)->as_Proj();
167 Node* use = proj->fast_out(j);
H A Dmultnode.cpp47 Node *p = fast_out(i);
H A DphaseX.cpp1190 _worklist.push(in->fast_out(i));
1193 _worklist.push(in->fast_out(i));
1205 Node *n = in->fast_out(j);
1300 _worklist.push(n->fast_out(i)); // Push on worklist
1309 Node* use = n->fast_out(i); // Get use
1352 Node* u = use->fast_out(i2);
1360 Node* u = use->fast_out(i2);
1368 Node* u = use->fast_out(i2);
1454 Node* m = n->fast_out(i); // Get user
1457 Node* p = m->fast_out(i
[all...]
H A Dmacro.cpp170 ProjNode *pn = call->fast_out(i)->as_Proj();
177 const Node *cn = pn->fast_out(j);
181 cpn = cn->fast_out(k)->as_Proj();
257 Node* u = p2x->fast_out(i);
393 Node* phi = region->fast_out(k);
593 Node* use = res->fast_out(j);
606 Node* n = use->fast_out(k);
869 Node* mb = n->fast_out(p);
1441 Node *use = _memproj_fallthrough->fast_out(i);
1456 Node *use = _memproj_catchall->fast_out(
[all...]
H A Dsuperword.cpp596 Node* out = n->fast_out(i);
827 Node* t1 = s1->fast_out(i);
830 Node* t2 = s2->fast_out(j);
901 Node* s1_use = s1->fast_out(i);
906 Node* s2_use = s2->fast_out(k);
1118 Node* use = def->fast_out(j);
1522 Node* use = def->fast_out(j);
1627 Node *n = lp()->fast_out(i);
1665 Node *use = n->fast_out(i);
1809 Node *use = in->fast_out(
[all...]
H A Dgcm.cpp76 Node* use = n->fast_out(i);
554 store = mem->fast_out(i);
809 Node* n = self->fast_out(i); // Use
977 uint l = latency_from_use(use, def, use->fast_out(j));
1002 uint l = latency_from_use(n, def, n->fast_out(i));
1176 Node* use = self->fast_out(i);
H A Dnode.hpp314 inline Node* fast_out(DUIterator_Fast& i) const;
340 Node* fast_out(DUIterator_Fast i) const { return *i; }
1146 // Node* y = x->fast_out(i);
1206 Node* Node::fast_out(DUIterator_Fast& i) const { function in class:Node
1288 Node* get() { return node->fast_out(i); }
H A Dpostaloc.cpp302 Node* first = x->fast_out(i); i++;
304 Node* use = x->fast_out(i); i++;
361 Node* use = n->fast_out(i);
H A Dcallnode.cpp697 Node *use = p->fast_out(i);
721 ProjNode *pn = fast_out(i)->as_Proj();
729 const Node *cn = pn->fast_out(j);
733 cpn = cn->fast_out(k)->as_Proj();
1184 Node *cn = proj->fast_out(i);
H A Descape.cpp162 Node* m = n->fast_out(i); // Get user
1572 if (n->fast_out(i)->is_LoadStore()) {
1913 int opcode = n->fast_out(i)->Opcode();
1934 int opcode = n->fast_out(i)->Opcode();
2314 Node* phi = region->fast_out(i);
2438 Node* use = n->fast_out(i);
2755 Node *use = n->fast_out(i);
2817 Node *use = raw_result->fast_out(i);
2899 Node *use = n->fast_out(i);
2987 Node *use = n->fast_out(
[all...]
H A Dloopnode.cpp202 Node *p = parent_ctl->fast_out(i);
1201 Node *oj = _head->fast_out(j);
1285 Node *out = _head->fast_out(j);
1404 Node *out = _head->fast_out(j);
1501 Node* phi = _head->fast_out(i);
2791 Node* l = m->fast_out(j);
2845 Node* m = n->fast_out(i); // Child
2899 Node* x = m->fast_out(j);
3197 Node* c = n->fast_out(i);
3244 Node* s = mem->fast_out(
[all...]
H A DloopTransform.cpp516 Node* old = head->fast_out(j);
534 Node* use = new_head->fast_out(j2);
978 Node* main_phi = main_head->fast_out(i);
1053 Node* main_phi = main_head->fast_out(i2);
1414 Node* phi = loop_head->fast_out(j);
1958 Node* cd = dp->fast_out(i); // Control-dependent node
2100 Node* n = cl->fast_out(i);
H A DloopPredicate.cpp212 Node* use = rgn->fast_out(i);
284 Node* use = rgn->fast_out(i);
H A Dcfgnode.cpp122 Node* phi = fast_out(i);
139 Node* phi = fast_out(i);
783 Node* use = region->fast_out(k);
1474 Node* phi2 = r->fast_out(k);
1767 Node* u = this->fast_out(k);
H A Ddomgraph.cpp470 Node* p = whead->fast_out(j);
H A Dmachnode.cpp628 Node *use = fast_out(i);
H A Dsplit_if.cpp175 Node *load = memphi->fast_out(i);
H A Difnode.cpp123 Node* u = r->fast_out(j);
145 Node* v = u->fast_out(k); // User of the phi
H A Dmatcher.cpp361 Node* n = C->root()->fast_out(j);
2316 ctrl = mem->fast_out(i); // Throw out-of-bounds if proj not found
2326 Node *x = ctrl->fast_out(j);
H A Doutput.cpp2315 Node *foi = n->fast_out(i);
2820 Node* use = n->fast_out(i);
H A Dmemnode.cpp1111 Node* phi = region->fast_out(i);
2481 Node *use = adr->fast_out(i);
2595 Node *x = fast_out(i);
3189 Node *n = m->fast_out(j);
H A Dcompile.cpp1096 Node* start = root()->fast_out(i);
1112 Node *p = s->fast_out(i);
3088 if (!frc._visited.test(n->fast_out(j)->_idx)) {
H A Dlibrary_call.cpp1922 Node* cmp = start_from->fast_out(k);
1983 Node* bol = cmp->fast_out(j);
4995 Node* obs = ptr->fast_out(i);
5024 Node* obs = not_ctl->fast_out(j);

Completed in 223 milliseconds

12