HomeSort by relevance Sort by last modified time
    Searched refs:succs (Results 1 - 13 of 13) sorted by null

  /art/compiler/sea_ir/ir/
regions_test.cc 39 std::vector<sea_ir::Region*>* succs = root->GetSuccessors(); local
40 EXPECT_EQ(1U, succs->size());
41 EXPECT_EQ(then_region, succs->at(0));
47 succs = root->GetSuccessors();
48 EXPECT_EQ(2U, succs->size());
49 EXPECT_TRUE(std::find(succs->begin(), succs->end(), then_region) != succs->end());
50 EXPECT_TRUE(std::find(succs->begin(), succs->end(), else_region) != succs->end())
    [all...]
sea.cc 63 std::vector<sea_ir::Region*>* succs = current_region->GetSuccessors(); local
64 for (std::vector<sea_ir::Region*>::iterator succ_it = succs->begin();
65 succ_it != succs->end(); ++succ_it) {
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_generators.py 1141 # solve() will set up succs[i] to be a list of square #i's
1143 succs = self.succs = []
1159 for i in succs[i0]:
1160 s = succs[i]
1172 for i in succs[i0]:
1173 succs[i].append(i0)
1194 assert len(succs[corner]) == 2
1195 assert self.coords2index(1, 2) in succs[corner
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_generators.py 1141 # solve() will set up succs[i] to be a list of square #i's
1143 succs = self.succs = []
1159 for i in succs[i0]:
1160 s = succs[i]
1172 for i in succs[i0]:
1173 succs[i].append(i0)
1194 assert len(succs[corner]) == 2
1195 assert self.coords2index(1, 2) in succs[corner
    [all...]
  /dalvik/dx/src/com/android/dx/ssa/
SsaMethod.java 378 BitSet succs = block.getSuccessors(); local
379 for (int i = succs.nextSetBit(0); i >= 0;
380 i = succs.nextSetBit(i + 1)) {
851 BitSet succs = block.getSuccessors(); local
852 for (int i = succs.nextSetBit(0); i >= 0;
853 i = succs.nextSetBit(i + 1)) {
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
SsaMethod.java 379 BitSet succs = block.getSuccessors(); local
380 for (int i = succs.nextSetBit(0); i >= 0;
381 i = succs.nextSetBit(i + 1)) {
852 BitSet succs = block.getSuccessors(); local
853 for (int i = succs.nextSetBit(0); i >= 0;
854 i = succs.nextSetBit(i + 1)) {
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
basic-block.h 133 VEC(edge,gc) *succs;
530 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
536 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i))
543 return EDGE_COUNT (bb->succs) == 1;
706 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
basic-block.h 133 VEC(edge,gc) *succs;
530 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
536 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i))
543 return EDGE_COUNT (bb->succs) == 1;
706 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
basic-block.h 133 VEC(edge,gc) *succs;
530 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
536 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i))
543 return EDGE_COUNT (bb->succs) == 1;
706 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
basic-block.h 133 VEC(edge,gc) *succs;
530 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
536 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i))
543 return EDGE_COUNT (bb->succs) == 1;
706 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
  /external/valgrind/main/helgrind/
hg_main.c 3629 WordSetID succs; local
3775 WordSetID preds, succs; local
    [all...]
  /prebuilts/tools/common/m2/internal/com/google/code/findbugs/bcel/2.0.1/
bcel-2.0.1.jar 
  /prebuilts/tools/common/m2/internal/xalan/xalan/2.6.0/
xalan-2.6.0.jar 

Completed in 300 milliseconds