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

Lines Matching defs:req
283 #define IDX_INIT(req) this->Init((req), (Compile*) this->_out)
295 inline int Node::Init(int req, Compile* C) {
300   if (req > 0) {
302     _in = (Node **) ((char *) (C->node_arena()->Amalloc_D(req * sizeof(void*))));
304     _in[req-1] = this; // magic cookie for assertion check
314   _cnt = _max = req;
324 Node::Node(uint req)
325   : _idx(IDX_INIT(req))
327   assert( req < (uint)(MaxNodeLimit - NodeLimitFudgeFactor), "Input limit exceeded" );
330   if (req == 0) {
334     assert( _in[req-1] == this, "Must pass arg count to 'new'" );
336     for(uint i = 0; i < req; i++) {
566   _cnt = _max;  // forget req/prec distinction
719     _in[i] = in(_cnt);          // Move prec over, making space for req edge
804       if (i < req())
820   uint cnt = req();
828   if( (req() != len()) && (in(req()) != NULL) ) {
873     if (p == NULL || p->req() != 2) {
1142     } else if (sub == up && sub->is_Region() && sub->req() != 3) {
1180       for (uint i = 1; i < sub->req(); i++) {
1243           for (uint j = 1; j < use->req(); j++) {
1266       for (uint i=0; i < dead->req(); i++) {
1342   if( req() < 2 || (_flags & Flag_needs_anti_dependence_check) == 0 )
1503   for (uint i = 0; i < n->req(); i++) {
1641   for (uint i = 0; i < req(); i++) {    // For all required inputs
1658   for (uint i = req(); i < len(); i++) {       // For all precedence inputs
1773       assert(i >= req() || i == 0 || is_Region() || is_Phi(), "only regions or phis have null data edges");
1947     for (uint i = 1; i < req(); i++) {
1950         for (uint j = 1; j < n->req(); j++) {
1965   if (req() >= 2) {
1971             use->req() == req()) {
1973           for (j = 0; j < use->req(); j++) {
1978           if (j == use->req()) {