Searched defs:preds (Results 1 - 5 of 5) sorted by relevance

/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java54 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 DHierarchicalLayoutManager.java104 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...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dcfgnode.cpp729 uint preds = r->req(); // Number of predecessor paths local
732 for (uint j = 1; j < preds; j++) {
H A Dsuperword.cpp589 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...]
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_IR.cpp985 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...]

Completed in 41 milliseconds