Searched refs:_nodes (Results 1 - 25 of 33) sorted by relevance

12

/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DArrayNodeListIterator.java34 private int _nodes[]; field in class:ArrayNodeListIterator
39 _nodes = nodes;
43 return _pos < _nodes.length ? _nodes[_pos++] : END;
52 return _nodes.length;
68 if (node == END) _nodes = EMPTY;
81 return new ArrayNodeListIterator(_nodes);
88 return _nodes[position - 1];
H A DKeyIndex.java69 private IntegerArray _nodes = null; field in class:KeyIndex
116 * Merge the current value's nodeset set by lookupKey() with _nodes.
122 if (other._nodes != null) {
123 if (_nodes == null) {
124 _nodes = (IntegerArray)other._nodes.clone();
127 _nodes.merge(other._nodes);
141 // Clear _nodes array
142 _nodes
506 private IntegerArray _nodes; field in class:KeyIndex.KeyIndexIterator
547 private IntegerArray _nodes; field in class:KeyIndex.KeyIndexIterator.KeyIndexHeapNode
[all...]
H A DDupFilterIterator.java48 private IntegerArray _nodes = new IntegerArray(); field in class:DupFilterIterator
51 * Index in _nodes array to current node.
56 * Cardinality of _nodes array.
101 _nodes.clear();
103 _nodes.add(node);
109 _nodes.sort();
111 _nodesSize = _nodes.cardinality();
122 final int next = _nodes.at(_current++);
134 clone._nodes = (IntegerArray) _nodes
[all...]
H A DCurrentNodeListIterator.java65 private IntegerArray _nodes = new IntegerArray(); field in class:CurrentNodeListIterator
68 * Index in _nodes of the next node to filter.
120 clone._nodes = (IntegerArray) _nodes.clone();
138 final int last = _nodes.cardinality();
144 final int node = _nodes.at(index++); // note increment
159 _nodes.clear();
161 _nodes.add(node);
185 final int last = _nodes.cardinality();
192 int nodeIndex = _nodes
[all...]
H A DCachedNodeListIterator.java42 private IntegerArray _nodes = new IntegerArray(); field in class:CachedNodeListIterator
81 return _nodes.at(index);
86 _nodes.add(node);
/openjdk7/hotspot/src/share/vm/opto/
H A Dlcm.cpp78 if (_nodes[_nodes.size()-1] == proj) {
82 assert(_nodes[_nodes.size()-2] == proj, "proj is one or the other");
96 for (uint i1 = 0; i1 < null_block->_nodes.size(); i1++) {
97 Node* nn = null_block->_nodes[i1];
281 for( k = 1; k < b->_nodes.size(); k++ ) {
282 Node *n = b->_nodes[k];
287 if( k < b->_nodes.size() )
344 if (best->in(0) && best->in(0) == old_block->_nodes[
[all...]
H A Dblock.cpp123 uint last_inst = _nodes.size();
125 uint inst_size = _nodes[j]->size(ra);
143 for( uint i = 0; i < _nodes.size(); i++ ) {
144 if( _nodes[i] == n )
153 _nodes.remove(find_node(n));
167 int end_idx = _nodes.size()-1;
170 if ((end_idx > 0) && (_nodes[end_idx]->is_MachGoto())) {
183 while ((end_idx > 0) && !_nodes[end_idx]->is_Mach()) {
356 uint cnt = _nodes.size();
358 _nodes[
[all...]
H A Doutput.cpp62 assert( _cfg->_broot->_nodes.size() == 0, "" );
76 const StartNode *start = entry->_nodes[0]->as_Start();
80 entry->_nodes.map( 0, prolog );
147 for (uint j = 0; j < bb->_nodes.size(); j++) {
148 Node *n = bb->_nodes[j];
225 for ( uint j = 0; j < b->_nodes.size(); ++j ) {
226 Node *n = b->_nodes[j];
255 b->_nodes.insert( j, zap );
383 uint last_inst = b->_nodes.size();
386 Node* nj = b->_nodes[
[all...]
H A Dcoalesce.cpp141 Node *con_next = bcon->_nodes[cindex+1];
148 b->_nodes.insert( idx, kills );
208 uint cnt = b->_nodes.size();
210 Node *n = b->_nodes[j];
310 Node *n = b->_nodes[i];
328 Node *n = b->_nodes[i];
349 b->_nodes.insert(kill_src_idx,tmp);
355 b->_nodes.insert(last_use_idx+1,copy);
385 for( uint l = 1; l<b->_nodes.size(); l++ ) {
386 Node *n = b->_nodes[
[all...]
H A Dlive.cpp92 for( i=b->_nodes.size(); i>1; i-- ) {
93 Node *n = b->_nodes[i-1];
117 uint r = _names[b->_nodes[k-1]->_idx];
129 add_liveout( p, _names[b->_nodes[k-1]->in(l)->_idx], first_pass );
268 uint cnt = b->_nodes.size();
270 tty->print("L%d/", _names[b->_nodes[i]->_idx] );
271 b->_nodes[i]->dump();
284 Node *n = b->_nodes[j-1];
H A Dreg_split.cpp115 while( i < b->_nodes.size() &&
116 (b->_nodes[i]->is_Proj() ||
117 b->_nodes[i]->is_Phi() ) )
121 if( b->_nodes[i]->is_Catch() ) {
125 const CatchProjNode *cp = b->_nodes[++i]->as_CatchProj();
134 b->_nodes.insert(i,spill); // Insert node in block
163 if( be->is_MachNullCheck() && be->in(1) == def && def == b->_nodes[loc] ) {
165 b = b->_succs[b->_nodes[b->end_idx()+1]->Opcode() == Op_IfTrue];
440 Node *n = b->_nodes[i];
631 n1 = b->_nodes[insid
[all...]
H A Dmatcher.hpp98 // Accessors for the inherited field PhaseTransform::_nodes:
100 _nodes.map(idx_limit-1, NULL);
103 return _nodes.at(n->_idx) != NULL;
107 return _nodes.at(n->_idx);
111 _nodes.map(n->_idx, nn);
H A Dblock.hpp111 Node_List _nodes; member in class:Block
117 Node *head() const { return _nodes[0]; }
242 _nodes(a),
257 _nodes.push(headnode);
265 int last_idx = _nodes.size() - 1;
266 Node *last = _nodes[last_idx];
267 assert(last->is_block_proj() == last || last->is_block_proj() == _nodes[last_idx - _num_succs], "");
274 Node *end() const { return _nodes[end_idx()]; }
278 void add_inst( Node *n ) { _nodes.insert(end_idx(),n); }
456 b->_nodes
[all...]
H A Difg.cpp344 Node *n = b->_nodes[j-1];
490 if( !b->_nodes[first_inst]->is_Phi() )
496 Node *ex = b->_nodes[insidx];
502 b->_nodes.remove(insidx);
503 b->_nodes.insert(first_inst, ex);
556 Node *n = b->_nodes[j - 1];
574 b->_nodes.remove(j - 1);
645 for( uint i = j; i <= last_inst && m->is_SpillCopy(); ++i ) { m = b->_nodes[i]; }
816 if( j < b->_nodes.size() && j < b->end_idx()+1 ) {
817 Node *cur = b->_nodes[
[all...]
H A Dnode.cpp1886 _a->Afree(_nodes,_max*sizeof(Node*));
1888 _nodes = NULL;
1893 // Clear all entries in _nodes to NULL but keep storage
1895 Copy::zero_to_bytes( _nodes, _max*sizeof(Node*) );
1902 _nodes = (Node**)_a->Amalloc( _max * sizeof(Node*) );
1903 _nodes[0] = NULL;
1907 _nodes = (Node**)_a->Arealloc( _nodes, old*sizeof(Node*),_max*sizeof(Node*));
1908 Copy::zero_to_bytes( &_nodes[old], (_max-old)*sizeof(Node*) );
1913 if( _nodes[_ma
[all...]
H A DbuildOopMap.cpp126 for( uint i=0; i<_b->_nodes.size(); i++ ) {
127 Node *n = _b->_nodes[i];
456 for( int k=b->_nodes.size()-1; k>=0; k-- ) {
457 Node *n = b->_nodes[k];
551 for( j=1; j<b->_nodes.size(); j++ )
552 if( b->_nodes[j]->jvms() &&
553 (*safehash)[b->_nodes[j]] == NULL )
555 if( j<b->_nodes.size() ) break;
H A Dloopnode.hpp562 bool has_ctrl( Node *n ) const { return ((intptr_t)_nodes[n->_idx]) & 1; }
606 bool has_node( Node* n ) const { return _nodes[n->_idx] != NULL; }
617 _nodes.map( n->_idx, (Node*)((intptr_t)ctrl + 1) );
637 _nodes.map( i->_idx, (Node*)((intptr_t)n + 1) );
657 Node *n = (Node*)(((intptr_t)_nodes[i->_idx]) & ~1);
661 n = (Node*)(((intptr_t)_nodes[n->_idx]) & ~1);
676 _nodes.map(n->_idx, (Node*)loop);
688 _nodes.map( old_node->_idx, (Node*)((intptr_t)new_node + 1) );
728 n = (Node*)(((intptr_t)_nodes[n->_idx]) & ~1);
819 return (IdealLoopTree*)_nodes[
[all...]
H A DphaseX.cpp426 _nodes(_arena),
442 _nodes(arena),
459 _nodes(pt->_nodes),
501 _nodes.dump();
505 for( uint i=0; i<_nodes.Size(); i++ )
506 if( _nodes[i] && _nodes[i]->_idx == nidx ) {
507 _nodes[i]->dump();
1398 // Clear out _nodes fro
[all...]
H A Dgcm.cpp104 uint max = pb->_nodes.size();
109 if( pb->_nodes[j] == in0 )
1018 uint start_latency = _node_latency->at_grow(LCA->_nodes[0]->_idx);
1019 uint end_latency = _node_latency->at_grow(LCA->_nodes[LCA->end_idx()]->_idx);
1041 LCA->_nodes[0]->_idx,
1043 LCA->_nodes[LCA->end_idx()]->_idx,
1064 uint start_lat = _node_latency->at_grow(LCA->_nodes[0]->_idx);
1066 uint end_lat = _node_latency->at_grow(LCA->_nodes[end_idx]->_idx);
1071 LCA->_pre_order, LCA->_nodes[0]->_idx, start_lat, end_idx, end_lat, LCA_freq);
1690 Node *n = _nodes[eid
[all...]
H A Dnode.hpp1302 Node **_nodes; member in class:Node_Array
1306 _nodes = NEW_ARENA_ARRAY( a, Node *, OptoNodeListSize );
1308 _nodes[i] = NULL;
1312 Node_Array(Node_Array *na) : _a(na->_a), _max(na->_max), _nodes(na->_nodes) {}
1314 { return (i<_max) ? _nodes[i] : (Node*)NULL; }
1315 Node *at( uint i ) const { assert(i<_max,"oob"); return _nodes[i]; }
1316 Node **adr() { return _nodes; }
1318 void map( uint i, Node *n ) { if( i>=_max ) grow(i); _nodes[i] = n; }
1344 Node *pop() { return _nodes[
[all...]
H A Descape.hpp327 GrowableArray<PointsToNode*> _nodes; // Map from ideal nodes to member in class:ConnectionGraph
348 // Address of an element in _nodes. Used when the element is to be modified
352 return _nodes.at(idx);
354 uint nodes_size() const { return _nodes.length(); }
371 _nodes.at_put(n->_idx, ptn);
H A Dpostaloc.cpp419 for( phi_dex = 1; phi_dex < b->_nodes.size(); phi_dex++ ) {
420 Node *phi = b->_nodes[phi_dex];
434 elide_copy( b->_nodes[k], j, b, *blk2value[pb->_pre_order], *blk2regnd[pb->_pre_order], false );
501 Node *phi = b->_nodes[j];
513 b->_nodes.remove(j--); phi_dex--;
542 for( j = phi_dex; j < b->_nodes.size(); j++ ) {
543 Node *n = b->_nodes[j];
H A DidealGraphPrinter.cpp642 for (uint s = 0; s < b->_nodes.size(); s++) {
643 nodeStack.push(b->_nodes[s]);
716 for (uint s = 0; s < b->_nodes.size(); s++) {
718 print_attr(NODE_ID_PROPERTY, get_node_id(b->_nodes[s]));
H A Dchaitin.cpp533 uint cnt = b->_nodes.size();
537 Node *n = b->_nodes[j];
562 for( uint j = 1; j < b->_nodes.size(); j++ ) {
563 Node *n = b->_nodes[j];
1460 Node *n = b->_nodes[j];
1497 b->_nodes.map(j,cisc); // Insert into basic block
1555 startb->_nodes.insert(startb->find_node(C->top()), base );
1601 Node *phi = b->_nodes[i];
1603 b->_nodes.insert( i, base ); // Must insert created Phi here as base
1646 Node *n = b->_nodes[
[all...]
/openjdk7/hotspot/src/os/windows/vm/
H A Dchaitin_windows.cpp63 Node *block_end = block->_nodes[block->_nodes.size()-1];

Completed in 117 milliseconds

12