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

Lines Matching refs:use
132 // 7) The set of pack pairs is extended by following use->def and def->use links.
175 // following use->def and def->use links.  The align positions are
535       // If no dependency yet, use slice
629   // Do not use superword for non-primitives
674   // Do not use superword for non-primitives
756 // Extend packset by following use->def and def->use links from pack members.
856 // Is the use of d1 in u1 at the same operand position as d2 in u2?
1118         Node* use = def->fast_out(j);
1119         for (uint k = 0; k < use->req(); k++) {
1120           Node* n = use->in(k);
1122             if (!is_vector_use(use, k)) {
1153     Node* use = current->out(i);
1154     if (use->is_Mem()) {
1155       assert(use->in(MemNode::Memory) == current, "must be");
1156       if (use == prev) { // connect prev to my_mem
1157           _igvn.replace_input_of(use, MemNode::Memory, my_mem);
1159       } else if (sched_before.member(use)) {
1161           _igvn.replace_input_of(use, MemNode::Memory, uip);
1166           _igvn.replace_input_of(use, MemNode::Memory, lip);
1175   // all uses of insert_pt's memory state should use current's instead
1177     Node* use = insert_pt->out(i);
1178     if (use->is_Mem()) {
1179       assert(use->in(MemNode::Memory) == insert_pt, "must be");
1180       _igvn.replace_input_of(use, MemNode::Memory, current);
1182     } else if (!sched_up && use->is_Phi() && use->bottom_type() == Type::MEMORY) {
1184       for (pos=1; pos < use->req(); pos++) {
1185         if (use->in(pos) == insert_pt) break;
1187       _igvn.replace_input_of(use, pos, current);
1211 // To schedule a load pack, we use the memory state of either the first or the last load in
1226         Node* use = current->out(i);
1227         if (use->is_Mem() && use != previous)
1228           memops.push(use);
1264       Node* use = upper_insert_pt->out(i);
1265       if (!use->is_Store())
1266         memops.push(use);
1282           Node* use = current->out(i);
1283           if (use->is_Mem() && use != previous) {
1284             assert(use->in(MemNode::Memory) == current, "must be");
1285             if (schedule_before_pack.member(use)) {
1286               _igvn.replace_input_of(use, MemNode::Memory, upper_insert_pt);
1288               _igvn.replace_input_of(use, MemNode::Memory, lower_insert_pt);
1311     // we use the memory state of the last load. However, if any load could
1312     // not be moved down due to the dependence constraint, we use the memory
1510 // If a use of pack p is not a vector use, then replace the
1511 // use with an extract operation.
1516   // Inspect each use of each pack member.  For each use that is
1517   // not a vector use, replace the use with an extract operation.
1522       Node* use = def->fast_out(j);
1523       for (uint k = 0; k < use->req(); k++) {
1524         Node* n = use->in(k);
1526           if (!is_vector_use(use, k)) {
1527             _n_idx_list.push(use, k);
1535     Node* use = _n_idx_list.node();
1538     Node* def = use->in(idx);
1547     _igvn.replace_input_of(use, idx, ex);
1556 // Is use->in(u_idx) a vector use?
1557 bool SuperWord::is_vector_use(Node* use, int u_idx) {
1558   Node_List* u_pk = my_pack(use);
1560   Node* def = use->in(u_idx);
1593   // create a temporary map from node _idx to bb_idx for use
1665         Node *use = n->fast_out(i);
1666         if (in_bb(use) && !visited_test(use) &&
1668             (!use->is_Phi() || n == entry)) {
1669           _stk.push(use);
1809             Node *use = in->fast_out(k);
1810             if (!in_bb(use) || !same_velt_type(use, n)) {