Searched refs:node (Results 501 - 510 of 510) sorted by relevance

<<21

/openjdk7/hotspot/src/share/vm/opto/
H A Dblock.cpp407 // node and in's index from stack's top
410 Node *np = nstack.node();
411 // idx > 0, except for the first node (_root) pushed on stack
459 // will be added when <p,i> is pulled off the node stack
472 nstack.pop(); // remove node from stack
473 // Check if it the fist node pushed on stack at the beginning.
517 // add a goto node
518 Node* gto = _goto->clone(); // get a new goto node
569 Node* gto = _goto->clone(); // get a new goto node
770 // be projections (in any order), the 3rd last node mus
[all...]
H A Dloopnode.cpp42 // Determine if a node is Counted loop induction variable.
43 // The method is declared in node.hpp.
56 // Dump special per-node info
144 // Move node up the dominator tree as high as legal while still beneficial
146 assert(n->in(0) && n->is_expensive(), "expensive node with control input here");
164 // Moving the node out of a loop on the projection of a If
168 // move the node further up.
198 // control). If so, we can try to move the node above the
214 assert(parent_ctl->is_Start() || parent_ctl->is_MemBar() || parent_ctl->is_Call(), "unexpected node");
518 // Replace condition in original predicate but preserve Opaque node
[all...]
H A Dgcm.cpp65 // Insert node n into block b. Look for projections of n and make sure they
98 assert(!n->pinned() || n->is_MachConstantBase(), "only pinned MachConstantBase node is expected here");
124 // Allocate node stack of size C->unique()+8 to avoid frequent realloc
129 if( !visited.test_set(n->_idx) ) { // Test node and flag it as visited
170 tty->print("Failing node: ");
218 // Get parent node and next input's index from stack's top.
251 nstack.push(n, i); // Save parent node and next input's index.
275 // Process next node on the worklist 'roots'.
278 // Get saved parent node and next input's index.
279 nstack_top_n = nstack.node();
[all...]
H A DphaseX.cpp50 // _sentinel must be in the current node space
65 // _sentinel must be in the current node space
75 // nh->_sentinel must be in the current node space
82 // nh->_sentinel must be in the current node space
147 debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
176 debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
212 debug_only(n->enter_hash_lock()); // Lock down the node while in the table.
245 debug_only(((Node*)n)->exit_hash_lock()); // Unlock the node upon removal from table.
288 debug_only(m->exit_hash_lock()); // Unlock the node upon removal from old table.
320 debug_only(n->exit_hash_lock()); // Unlock the node whe
[all...]
H A Dcfgnode.cpp308 // Find if the Region node is reachable from the root.
313 // region's phis references itself directly or through a data node.
329 // Check when phi references itself directly or through an other node.
337 // Unsafe case - check if the Region node is reachable from root.
355 return false; // We reached the Region node - it is not dead.
363 return true; // The Region node is unreachable - it is dead.
410 // Return a node which is more "ideal" than the current node. Must preserve
510 // Loop node may have only one input because entry path
512 assert(!this->is_Loop() || cnt_orig <= 3, "Loop node shoul
[all...]
H A Dmacro.cpp37 #include "opto/node.hpp"
85 new_in = transform_later(new_in); // Register new node.
209 assert(false, "unexpected projection from allocation node.");
237 // It could be only one user, URShift node, in Object.clone() instrinsic
245 // Take Region node before eliminating post barrier since it also
246 // eliminates CastP2X node when it has only one user.
355 // We are looking for stored value, return Initialize node
356 // or memory edge from Allocate node.
368 assert(false, "Object is not scalar replaceable if a LoadStore node access its field");
449 assert(false, "Object is not scalar replaceable if a LoadStore node acces
[all...]
H A Dcompile.cpp50 #include "opto/node.hpp"
87 // Constant table base node singleton.
336 // If 'top' is cached, declare it useful to preserve cached node
359 // If node with index node_idx is not in useful set,
360 // mark it as dead in dead node list.
394 // Only need to remove this out-edge to the useless node
411 // Remove useless expensive node
790 // After parsing, node notes are no longer automagic.
1123 // Install the cached top node, and make sure Node::is_top works correctly.
1138 // Get useful node lis
[all...]
H A Descape.cpp126 // only once per ideal node since ideal_nodes is Unique_Node list.
152 // escape status of the associated Allocate node some of them
313 return; // No need to redefine PointsTo node during first iteration.
479 // Verify a raw address for a store captured by Initialize node.
565 "node should be registered already");
590 continue; // ignore top or inputs which go back this node
592 assert(ptn != NULL, "node should be registered");
621 continue; // ignore top or inputs which go back this node
623 assert(ptn != NULL, "node should be registered");
663 assert(adr_type != NULL, "dead node shoul
[all...]
/openjdk7/jdk/src/share/classes/com/sun/media/sound/
H A DSoftSynthesizer.java856 Preferences prefs = prefroot.node(notePath);
/openjdk7/hotspot/src/os/linux/vm/
H A Dos_linux.cpp2862 typedef long (*vgetcpu_t)(unsigned int *cpu, unsigned int *node, unsigned long *tcache);
2914 // Create a cpu -> node mapping
2924 // rebuild_cpu_to_node_map() constructs a table mapping cpud id to node id.
4572 // There's only one node(they start from 0), disable NUMA.

Completed in 87 milliseconds

<<21