Lines Matching defs:ctrl
1145 Node *ctrl, Node *mem, Node *abio,
1154 init_req( TypeFunc::Control , ctrl );
1379 static Node *next_control(Node *ctrl) {
1380 if (ctrl == NULL)
1383 if (ctrl->is_Region()) {
1384 RegionNode *r = ctrl->as_Region();
1389 ctrl = n;
1390 } else if (ctrl->is_Proj()) {
1391 Node *in0 = ctrl->in(0);
1393 ctrl = in0->in(0);
1401 return ctrl;
1407 bool AbstractLockNode::find_matching_unlock(const Node* ctrl, LockNode* lock,
1409 ProjNode *ctrl_proj = (ctrl->is_Proj()) ? ctrl->as_Proj() : NULL;
1431 Node *ctrl = next_control(unlock->in(0));
1433 assert(ctrl != NULL, "invalid control graph");
1434 assert(!ctrl->is_Start(), "missing lock for unlock");
1435 if (ctrl->is_top()) break; // dead control path
1436 if (ctrl->is_Proj()) ctrl = ctrl->in(0);
1437 if (ctrl->is_SafePoint()) {
1439 } else if (ctrl->is_Region()) {
1441 if (ctrl->req() == 3 && ctrl->in(1) != NULL && ctrl->in(2) != NULL) {
1442 Node *in1 = next_control(ctrl->in(1));
1443 Node *in2 = next_control(ctrl->in(2));
1446 ctrl = next_control(in1->in(0)->in(0));
1454 ctrl = next_control(ctrl->in(0)); // keep searching
1457 if (ctrl->is_Lock()) {
1458 LockNode *lock = ctrl->as_Lock();
1583 Node *ctrl = next_control(in(0));
1586 if (find_matching_unlock(ctrl, this, lock_ops)) {
1590 } else if (ctrl->is_Region() ) {
1591 if (find_unlocks_for_region(ctrl->as_Region(), this, lock_ops)) {
1599 if (find_lock_and_unlock_through_if(ctrl, this, lock_ops)) {
1634 } else if (ctrl->is_Region() &&
1635 iter->_worklist.member(ctrl)) {