Lines Matching refs:req
61 for (uint i = 1; i < region->req(); i++) {
72 for (uint j = 1; j < n->req(); j++) {
141 for (uint i2 = 1; i2 < phi->req(); i2++) {
267 for( i = 1; i < n->req(); i++ ) {
272 if( i >= n->req() )
280 for( i = 1; i < n->req(); i++ ) {
312 if( n->req() < 3 || n->req() > 4 ) return NULL;
316 Node *n3_ctrl = get_ctrl(n->in(n->req() == 3 ? 2 : 3));
473 if (region->req() != 3) return NULL;
537 for (uint j = 1; j < region->req(); j++) {
544 for (uint k = 1; k < inp->req(); k++)
608 for (uint j = 1; j < region->req(); j++) {
697 int policy = n_blk->req() >> 2;
832 for( uint i = 1; i < n_ctrl->req(); i++ )
850 for( uint j = 1; j < n_ctrl->req(); j++ )
903 if( dom->req() > 1 && dom->in(1) == bol && prevdom->in(0) == dom ) {
966 for( uint k = 0; k < u->req(); k++ ) {
1084 for( i = 1; i < phi->req(); i++ ) {
1099 for( i = 1; i < phi->req(); i++ ) {
1153 for( i = 1; i < phi->req(); i++ ) {
1167 for( uint j = 1; j < phi->req(); j++ ) {
1281 for( uint j = 0; j < nnn->req(); j++ ) {
1349 for( uint k = 1; k < useuse->req(); k++ ) {
1447 for( uint i = 1; i < prev->req(); i++ ) {
1556 for (uint i = 1; i < phi->req(); i++) {
1572 for (uint i = 1; i < phi->req(); i++) {
1860 for (uint j = 0; j < elt->req(); j++) {
1942 for (j = 0; j < use->req(); j++) {
1945 assert(j < use->req(), "must be there");
2008 for (uint j = 1; j < use->req(); j++) {
2084 use_c->is_Region() && use_c->req() == 3 &&
2599 for (uint j = 1; j < use->req(); j++) {
2742 for (uint j = 1; j < use->req(); j++)
2762 for (uint j = 1; j < use->req(); j++) {