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

Lines Matching defs:idx
137   assert(_idx      <  node->_outcnt + (uint)at_end_ok, "idx in range");
290 static void init_node_notes(Compile* C, int idx, Node_Notes* nn) {
291   C->set_node_notes_at(idx, nn);
297   int idx = C->next_unique();
309   if (nn != NULL)  init_node_notes(C, idx, nn);
319   return idx;
765 void Node::del_req( uint idx ) {
766   assert( idx < _cnt, "oob");
770   Node *n = in(idx);
772   _in[idx] = in(--_cnt);  // Compact the array
778 void Node::ins_req( uint idx, Node *n ) {
781   assert( idx < _max, "Must have allocated enough space");
783   if(_cnt-idx-1 > 0) {
784     Copy::conjoint_words_to_higher((HeapWord*)&_in[idx], (HeapWord*)&_in[idx+1], ((_cnt-idx-1)*sizeof(Node*)));
786   _in[idx] = n;                            // Stuff over old required edge
1429 // If idx is negative, find its absolute value, following both _in and _out.
1430 static void find_recur(Compile* C,  Node* &result, Node *n, int idx, bool only_ctrl,
1432   int node_idx = (idx >= 0) ? idx : -idx;
1440       tty->print("find: " INTPTR_FORMAT " and " INTPTR_FORMAT " both have idx==%d\n",
1447     find_recur(C, result, n->in(i), idx, only_ctrl, old_space, new_space );
1450   if (idx < 0 && !only_ctrl) {
1452       find_recur(C, result, n->raw_out(j), idx, only_ctrl, old_space, new_space );
1461       find_recur(C, result, orig, idx, only_ctrl, old_space, new_space );
1469 Node* find_node(Node* n, int idx) {
1470   return n->find(idx);
1474 Node* Node::find(int idx) const {
1478   find_recur(Compile::current(), result, (Node*) this, idx, false, &old_space, &new_space );
1484 Node* Node::find_ctrl(int idx) const {
1488   find_recur(Compile::current(), result, (Node*) this, idx, true, &old_space, &new_space );
1748   uint i, j, idx;
1762       for (idx = 0; idx < n->_outcnt; idx++ ) {
1763         if (n->_out[idx] == (Node *)this)  cnt++;
1868 uint Node::match_edge(uint idx) const {
1869   return idx;                   // True for other than index 0 (control)
2072 Node* Node_Stack::find(uint idx) const {
2075     if (idx == index_at(i) )