| /openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/ |
| H A D | InputBlock.java | 44 private Set<InputBlock> successors; field in class:InputBlock
54 successors = new HashSet<InputBlock>();
61 if (successors.contains(b)) {
62 successors.remove(b);
101 return Collections.unmodifiableSet(successors);
127 if (!successors.contains(b)) {
128 successors.add(b);
|
| /openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/org/objectweb/asm/ |
| H A D | Label.java | 191 * of this basic block. Each node also stores the list of its successors in
252 * The successors of this node in the control flow graph. These successors
256 Edge successors; field in class:Label
513 // adds JSR to the successors of this block, if it is a RET block
518 e.successor = JSR.successors.successor;
519 e.next = successors;
520 successors = e;
532 Edge e = successors;
534 // if this block is a JSR block, then 'successors
[all...] |
| H A D | MethodWriter.java | 373 * stores the list of its successors in the graph, as a linked list of Edge
912 * has at least two successors in the control flow graph:
1130 // adds current block successors
1140 // adds current block successors
1256 // adds it to the successors of 'l'
1257 b.next = l.successors;
1258 l.successors = b;
1275 * successors (which can be changed in the process).
1296 // updates the successors of the current basic block
1297 Edge e = l.successors;
[all...] |
| /openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/widgets/ |
| H A D | LineWidget.java | 69 private List<LineWidget> successors; field in class:LineWidget
83 this.successors = new ArrayList<LineWidget>();
134 this.successors.add(widget);
174 boolean sameTo = successors.size() == 0;
175 for (LineWidget w : successors) {
242 for (LineWidget s : successors) {
260 for (LineWidget s : successors) {
|
| H A D | FigureWidget.java | 288 JMenu successors = new JMenu("Successors");
289 addFigureToSubMenu(successors, getFigure(), true, DEPTH);
293 m.add(successors);
|
| /openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/ |
| H A D | Figure.java | 57 private List<Figure> successors; field in class:Figure
101 successors = new ArrayList<Figure>(6);
142 return Collections.unmodifiableList(successors);
150 this.successors.add(f);
159 assert successors.contains(f);
160 successors.remove(f);
|
| /openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Filter/src/com/sun/hotspot/igv/filter/ |
| H A D | CombineFilter.java | 65 List<Figure> successors = new ArrayList<Figure>(f.getSuccessors());
67 if (successors.size() == 1) {
68 Figure succ = successors.get(0);
103 for (Figure succ : successors) {
|
| /openjdk7/hotspot/src/share/vm/ci/ |
| H A D | bcEscapeAnalyzer.cpp | 349 void BCEscapeAnalyzer::iterate_one_block(ciBlock *blk, StateInfo &state, GrowableArray<ciBlock *> &successors) { argument
725 successors.push(_methodBlocks->block_containing(dest_bci));
740 successors.push(_methodBlocks->block_containing(dest_bci));
751 successors.push(_methodBlocks->block_containing(dest_bci));
759 successors.push(_methodBlocks->block_containing(dest_bci));
769 successors.push(_methodBlocks->block_containing(dest_bci));
791 successors.push(_methodBlocks->block_containing(dest_bci));
795 successors.push(_methodBlocks->block_containing(dest_bci));
809 successors.push(_methodBlocks->block_containing(dest_bci));
813 successors
[all...] |
| H A D | bcEscapeAnalyzer.hpp | 93 void iterate_one_block(ciBlock *blk, StateInfo &state, GrowableArray<ciBlock *> &successors);
|
| H A D | ciTypeFlow.cpp | 1540 int succ_ct = _pred->successors()->length();
1544 _succ = _pred->successors()->at(next);
1566 int succ_ct = _pred->successors()->length();
1568 _pred->successors()->at_put(_index, succ);
1621 // ciTypeFlow::Block::successors
1623 // Get the successors for this Block.
1625 ciTypeFlow::Block::successors(ciBytecodeStream* str, function in class:ciTypeFlow::Block
1630 tty->print(">> Computing successors for block ");
1643 // No successors
1660 // the current bytecode to find our successors
2125 flow_successors(GrowableArray<ciTypeFlow::Block*>* successors, ciTypeFlow::StateVector* state) argument
2364 GrowableArray<Block*>* successors = NULL; local
[all...] |
| H A D | ciTypeFlow.hpp | 522 bool is_normal_ctrl() { return index() < _pred->successors()->length(); }
564 // Compute the exceptional successors and types for this Block.
611 // Get the successors for this Block.
612 GrowableArray<Block*>* successors(ciBytecodeStream* str,
615 GrowableArray<Block*>* successors() { function in class:ciTypeFlow::Block
620 // Get the exceptional successors for this Block.
629 // exceptional successors for this Block.
795 // Standard indexes of successors, for various bytecodes.
803 // Unlike in other blocks, the successors of a switch are listed uniquely.
822 // Clone lp's head and replace tail's successors wit
[all...] |
| /openjdk7/hotspot/src/share/vm/shark/ |
| H A D | sharkTopLevelBlock.hpp | 98 return ciblock()->successors()->length();
101 return function()->block(ciblock()->successors()->at(index)->pre_order());
|
| H A D | sharkTopLevelBlock.cpp | 313 ciTypeFlow::Block *successor = ciblock()->successors()->at(i);
|
| /openjdk7/hotspot/src/share/vm/c1/ |
| H A D | c1_InstructionPrinter.cpp | 595 // print block successors
617 // print predecessors and successors
618 if (x->successors()->length() > 0) {
620 for (int i = 0; i < x->successors()->length(); i ++) {
621 output()->print(" B%d", x->successors()->at(i)->block_id());
|
| H A D | c1_Instruction.cpp | 529 // Now reset successors list based on BlockEnd
540 // Must make the predecessors/successors match up with the
546 // disconnect this block from it's current successors
588 // modify predecessors before substituting successors
935 sux = begin->successors();
|
| H A D | c1_Instruction.hpp | 1536 BlockList _successors; // the successors of this block
1614 BlockList* successors() { return &_successors; }
1661 // successors and predecessors
1762 // successors
1866 assert(number_of_sux() == 2, "wrong number of successors");
1925 assert(number_of_sux() == 2, "wrong number of successors");
2451 inline void BlockBegin::add_successor(BlockBegin* sux) { assert(_end == NULL, "Would create mismatch with successors of BlockEnd"); _successors.append(sux); }
|
| /openjdk7/jdk/src/share/native/common/ |
| H A D | check_code.c | 1173 saved_operand[0] = keys + 1; /* number of successors */
2862 int buffer[2]; /* default value for successors */
2863 int *successors = buffer; /* table of successors */ local
2926 successors = this_idata->operand2.ip; /* use this instead */
2927 successors_count = *successors++;
2934 successors = this_idata->operand.ip; /* use this instead */
2935 successors_count = *successors++;
2946 jio_fprintf(stdout, "%d ", successors[i]);
2986 int target = successors[
[all...] |
| /openjdk7/hotspot/src/share/vm/opto/ |
| H A D | parse1.cpp | 1147 GrowableArray<ciTypeFlow::Block*>* tfs = flow()->successors();
1168 // A block's successors must be distinguishable by BCI.
1174 assert(block1->start() != block2->start(), "successors have unique bcis");
1347 tty->print("Parsing block #%d at bci [%d,%d), successors: ",
1389 // to produce successors for trapping blocks.
|