Lines Matching refs:use
373 // Instead, be sure we never again use the source table.
613 x = k; // use existing constant
684 assert( i->_idx >= k->_idx, "Idealize should return new nodes, use Identity to return old nodes" );
697 // use the cached Value instead of suffering with 'bottom_type'.
792 // roots during def-use info creation; hence they represent an invisible
793 // use. Clear them out.
998 // Register a new node with the optimizer. Update the types array, the def-use
1049 // Switched input to left side because this is the only use
1069 assert((i->_idx >= k->_idx) || i->is_top(), "Idealize should return new nodes, use Identity to return old nodes");
1074 // Make users of old Node now use new.
1100 // use the cached Value instead of suffering with 'bottom_type'.
1233 // it reachable by adding use edges. So, we will NOT count Con nodes
1258 Node* use = old->last_out(i); // for each use...
1259 // use might need re-hashing (but it won't if it's a new node)
1260 bool is_in_table = _table.hash_delete( use );
1261 // Update use-def info as well
1262 // We remove all occurrences of old within use->in,
1266 for (uint jmax = use->len(), j = 0; j < jmax; j++) {
1267 if (use->in(j) == old) {
1268 use->set_req(j, nn);
1273 // If a duplicate, 'use' will be cleaned up when pulled off worklist
1275 hash_find_insert(use);
1282 temp->init_req(0,nn); // Add a use to nn to prevent him from dying
1309 Node* use = n->fast_out(i); // Get use
1311 if( use->is_Multi() || // Multi-definer? Push projs on worklist
1312 use->is_Store() ) // Enable store/load same address
1313 add_users_to_worklist0(use);
1319 if (use->is_CallDynamicJava() && n == use->in(TypeFunc::Parms)) {
1320 Node* p = use->as_CallDynamicJava()->proj_out(TypeFunc::Control);
1326 if( use->is_Cmp() ) { // Enable CMP/BOOL optimization
1327 add_users_to_worklist(use); // Put Bool on worklist
1330 if (use->outcnt() > 0) {
1331 Node* bol = use->raw_out(0);
1348 uint use_op = use->Opcode();
1350 if( use->is_ConstraintCast() || use->is_CheckCastPP() ) {
1351 for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
1352 Node* u = use->fast_out(i2);
1359 for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
1360 Node* u = use->fast_out(i2);
1367 for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
1368 Node* u = use->fast_out(i2);
1375 InitializeNode* init = use->as_Allocate()->initialization();
1382 Node* imem = use->as_Initialize()->proj_out(TypeFunc::Memory);
1713 assert( is_not_dead(n), "can not use dead node");
1751 // Using def-use info, replace one node for another. Follow the def-use info
1756 Node* use = last_out(i);
1758 for (uint j = 0; j < use->len(); j++) {
1759 if (use->in(j) == this) {
1760 if (j < use->req())
1761 use->set_req(j, new_node);
1762 else use->set_prec(j, new_node);