Searched refs:successors (Results 1 - 10 of 10) sorted by relevance

/macosx-10.9.5/BerkeleyDB-21/db/java/src/com/sleepycat/asm/
H A DLabel.java82 * stores the list of it successors in the graph, as a linked list of Edge
102 * The successors of this node in the control flow graph. These successors
106 Edge successors; field in class:Label
H A DMethodWriter.java214 * stores the list of its successors in the graph, as a linked list of Edge
935 // ends current block (with many new successors)
966 // ends current block (with many new successors)
1077 * successors of this block, and push these successors onto the
1095 // analyses the successors of the block
1096 Edge b = l.successors;
1177 b.next = currentBlock.successors;
1178 currentBlock.successors = b;
/macosx-10.9.5/llvmCore-3425.0.33/lib/CodeGen/
H A DShrinkWrapping.cpp17 // placed in the loop exit nodes (the successors of loop _exiting_ nodes).
199 /// successors.
205 SmallVector<MachineBasicBlock*, 4> successors; local
210 successors.push_back(SUCC);
213 unsigned i = 0, e = successors.size();
216 MachineBasicBlock* SUCC = successors[i];
220 SUCC = successors[i];
292 // anticipated at successors of MBB.
353 /// 3. all CSRs are used in all immediate successors of the entry block.
482 << ": all CSRs used in imm successors o
745 SmallVector<MachineBasicBlock*, 4> successors; local
[all...]
/macosx-10.9.5/CPANInternal-140/Graph-0.94/lib/
H A DGraph.pm860 sub successors { subroutine
888 for my $s ($g->successors($t)) {
1091 $g->successors( @_ ) == 0 && $g->predecessors( @_ ) > 0;
1097 $g->predecessors( @_ ) == 0 && $g->successors( @_ ) > 0;
1103 $g->successors( @_ ) == 0;
1115 $g->successors( @_ ) > 0;
1127 $g->predecessors( @_ ) == 0 && $g->successors( @_ ) == 0;
1134 my $s = $g->successors( @_ );
1145 $g->predecessors( @_ ) == 0 || $g->successors( @_ ) == 0;
1151 for my $s ( $g->successors(
[all...]
/macosx-10.9.5/CPANInternal-140/Graph/lib/
H A DGraph.pm862 sub successors { subroutine
1003 $g->successors( @_ ) == 0 && $g->predecessors( @_ ) > 0;
1009 $g->predecessors( @_ ) == 0 && $g->successors( @_ ) > 0;
1015 $g->successors( @_ ) == 0;
1027 $g->successors( @_ ) > 0;
1039 $g->predecessors( @_ ) == 0 && $g->successors( @_ ) == 0;
1046 my $s = $g->successors( @_ );
1057 $g->predecessors( @_ ) == 0 || $g->successors( @_ ) == 0;
1063 for my $s ( $g->successors( @_ ) ) {
2130 my @S = $g->successors(
[all...]
/macosx-10.9.5/llvmCore-3425.0.33/lib/Support/Windows/
H A DPath.inc75 // If there is a null character, it and all its successors are ignored.
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp392 if (int successors = TI->getNumSuccessors()) {
393 for (int i = 0; i != successors; ++i) {
531 // All edges with successors that aren't branches are "complex", because it
/macosx-10.9.5/tcl-102/tcl/tcl/library/
H A Dclock.tcl2121 # The 'successors' dictionary will contain, for each string that
2127 set successors [dict create {} {}]
2138 dict set successors $oldPrefix $char {}
2141 # Put the prefixes in the 'prefixMapping' and 'successors'
2145 if { ![dict exists $successors $prefix] } {
2146 dict set successors $prefix {}
2167 [MakeUniquePrefixRegexp $successors $uniquePrefixMapping {}] \
2179 # successors - Dictionary whose keys are all prefixes
2196 proc ::tcl::clock::MakeUniquePrefixRegexp { successors
2202 set schars [lsort -ascii [dict keys [dict get $successors
[all...]
/macosx-10.9.5/CPANInternal-140/Graph/lib/Graph/
H A DTraversal.pm285 @next = $self->{ graph }->successors( $current );
/macosx-10.9.5/CPANInternal-140/Graph-0.94/lib/Graph/
H A DTraversal.pm285 @next = $self->{ graph }->successors( $current );

Completed in 218 milliseconds