Lines Matching defs:idx
383 void del_req( uint idx ); // Delete required edge & compact
907 virtual uint match_edge(uint idx) const;
990 Node* find(int idx) const; // Search the graph for the given idx.
991 Node* find_ctrl(int idx) const; // Search control ancestors for the given idx.
1009 void dump_in_regmask(int idx) { in_RegMask(idx).dump(); }
1469 Node* find(uint idx) const;
1527 int idx, bool can_grow) {
1528 assert(idx >= 0, "oob");
1529 int block_idx = (idx >> _log2_node_notes_block_size);
1536 return arr->at(block_idx) + (idx & (_node_notes_block_size-1));
1540 Compile::set_node_notes_at(int idx, Node_Notes* value) {
1543 Node_Notes* loc = locate_node_notes(_node_note_array, idx, true);