Searched refs:preds (Results 1 - 8 of 8) sorted by relevance
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/ |
H A D | ServerCompilerScheduler.java | 54 public List<Node> preds = new ArrayList<Node>(); field in class:ServerCompilerScheduler.Node 90 if (proj.isBlockProjection && proj.preds.size() > 0) { 91 parent = proj.preds.get(0); 110 if (p.preds.size() == 0 || p.preds.get(0) == null) { 114 p = p.preds.get(0); 122 for (Node n : p.preds) { 125 n = n.preds.get(0); 149 int num_preds = p.preds.size(); 157 if (p.preds [all...] |
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | HierarchicalLayoutManager.java | 104 public List<LayoutEdge> preds = new ArrayList<LayoutEdge>(); field in class:HierarchicalLayoutManager.LayoutNode 229 e.to.preds.remove(e); 275 for (LayoutEdge e : n.preds) { 288 while (cur.vertex == null && cur.preds.size() != 0) { 297 assert cur.preds.size() == 1; 298 curEdge = cur.preds.get(0); 312 if (cur.vertex == null && cur.preds.size() == 0) { 500 public HashSet<Segment> preds = new HashSet<Segment>(); field in class:HierarchicalLayoutManager.Segment 516 public HashSet<Region> preds = new HashSet<Region>(4); field in class:HierarchicalLayoutManager.Region 539 return n1.preds [all...] |
H A D | OldHierarchicalLayoutManager.java | 829 ArrayList<Node<NodeData, EdgeData>> preds = new ArrayList<Node<NodeData, EdgeData>>(n.getPredecessors()); 831 if (preds.size() > 0) { 833 Collections.sort(preds, new Comparator<Node<NodeData, EdgeData>>() { 840 if (preds.size() % 2 == 0) { 841 assert preds.size() >= 2; 842 pos = (preds.get(preds.size() / 2).getData().getCoordinate() - calcRelativeCoordinate(preds.get(preds.size() / 2), n) + preds [all...] |
/openjdk7/hotspot/src/share/vm/c1/ |
H A D | c1_IR.cpp | 985 tty->print(" preds: "); 1196 BlockList* preds = _predecessors->at(block->block_id()); local 1197 if (preds == NULL) { 1209 preds->sort(cmp); 1211 int length = MIN2(preds->length(), block->number_of_preds()); 1213 assert(preds->at(j) == pred_copy->at(j), "must match"); 1216 assert(preds->length() == block->number_of_preds(), "should be the same"); 1229 BlockList* preds = _predecessors->at_grow(sux->block_id(), NULL); local 1230 if (preds == NULL) { 1231 preds 1242 BlockList* preds = _predecessors->at_grow(sux->block_id(), NULL); local [all...] |
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentSkipListMap.java | 1465 ArrayList<Index<K,V>> preds = new ArrayList<Index<K,V>>(); 1469 preds.add(null); 1472 preds.set(i, q); 1496 if (i < preds.size()) { 1497 preds.get(i).right = idx; 1498 preds.set(i, idx); 1500 preds.add(idx); 1554 ArrayList<Index<K,V>> preds = new ArrayList<Index<K,V>>(); 1556 preds.add(null); 1559 preds [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | superword.cpp | 589 void SuperWord::mem_slice_preds(Node* start, Node* stop, GrowableArray<Node*> &preds) { argument 590 assert(preds.length() == 0, "start empty"); 599 preds.push(out); 617 preds.push(n); 724 for (DepPreds preds(deep, _dg); !preds.done(); preds.next()) { 725 Node* pred = preds.current(); 1753 for (DepPreds preds(n, _dg); !preds [all...] |
H A D | superword.hpp | 330 void mem_slice_preds(Node* start, Node* stop, GrowableArray<Node*> &preds);
|
H A D | cfgnode.cpp | 729 uint preds = r->req(); // Number of predecessor paths local 732 for (uint j = 1; j < preds; j++) {
|
Completed in 78 milliseconds