HomeSort by relevance Sort by last modified time
    Searched refs:succ (Results 26 - 50 of 121) sorted by null

12 3 4 5

  /build/tools/releasetools/
add_img_to_target_files.py 148 succ = build_image.BuildImage(os.path.join(input_dir, what),
150 assert succ, "build " + what + ".img image failed"
184 succ = build_image.BuildImage(user_dir, image_props, img.name)
185 assert succ, "build userdata.img image failed"
221 succ = build_image.BuildImage(user_dir, image_props, img.name)
222 assert succ, "build cache.img image failed"
  /external/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 106 const ExplodedNode *succ = *(node->succ_begin()); local
107 if (succ->pred_size() != 1)
152 const ProgramPoint SuccLoc = succ->getLocation();
171 ExplodedNode *succ = *(node->succ_begin()); local
172 pred->replaceSuccessor(succ);
173 succ->replacePredecessor(pred);
  /external/v8/src/compiler/
scheduler.cc 208 void TraceConnect(Node* node, BasicBlock* block, BasicBlock* succ) {
210 if (succ == NULL) {
215 block->id(), succ->id());
956 BasicBlock* succ = frame->block->SuccessorAt(frame->index++); local
999 BasicBlock* succ = NULL; local
    [all...]
verifier.cc 335 BasicBlock* succ = block->SuccessorAt(s); local
336 if (!marked[succ->id()]) {
337 marked[succ->id()] = true;
338 queue.push(succ);
377 BasicBlock* succ = block->SuccessorAt(s); local
378 BitVector* succ_doms = dominators[succ->id()];
385 dominators[succ->id()] = succ_doms;
386 queue.push(succ);
391 if (succ_doms->IntersectIsChanged(*block_doms)) queue.push(succ);
schedule.h 229 void AddGoto(BasicBlock* block, BasicBlock* succ) {
232 AddSuccessor(block, succ);
273 void AddSuccessor(BasicBlock* block, BasicBlock* succ) {
274 succ->AppendInput(zone_, block);
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/classes/tests/
test_digraph.py 198 self.K3.adj = self.K3.succ = self.K3.edge = self.k3adj
204 self.P3.succ=self.P3.adj
219 assert_equal(sorted(G.succ.items()),[(1, {2: {}}), (2, {1: {}})])
226 assert_equal(G.succ,{0: {1: {}}, 1: {}})
231 assert_equal(G.succ,{0: {1: {}}, 1: {}})
238 assert_equal(G.succ,{0: {1: {'data':2}, 2: {'data':3}}, 1: {}, 2: {}})
248 assert_equal(G.succ,{0:{2:{}},1:{0:{},2:{}},2:{0:{},1:{}}})
255 assert_equal(G.succ,{0:{2:{}},1:{0:{},2:{}},2:{0:{},1:{}}})
  /external/deqp/modules/gles2/functional/
es2fFboCompletenessTests.cpp 303 bool succ = false; local
322 succ = tryCombination(comb);
323 if (succ)
329 if (succ)
  /dalvik/dx/src/com/android/dx/command/dump/
BlockDumper.java 249 int succ = successors.get(j); local
250 parsed(bytes, end, 0, "next " + Hex.u2(succ));
333 int succ = successors.get(i); local
335 sb.append(Hex.u2(succ));
337 if ((ssz != 1) && (succ == primary)) {
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
LinkedHashMultimap.java 128 private static <K, V> void succeedsInValueSet(ValueSetLink<K, V> pred, ValueSetLink<K, V> succ) {
129 pred.setSuccessorInValueSet(succ);
130 succ.setPredecessorInValueSet(pred);
134 ValueEntry<K, V> pred, ValueEntry<K, V> succ) {
135 pred.setSuccessorInMultimap(succ);
136 succ.setPredecessorInMultimap(pred);
TreeMultiset.java 366 node = node.succ;
369 node = header.succ;
421 if (current.succ == header) {
424 current = current.succ;
527 private AvlNode<E> succ;
553 successor(this, right, succ);
779 successor(pred, succ);
793 AvlNode<E> newTop = succ;
934 a.succ = b;
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/
directed.py 186 for succ in G.successors(target):
187 G.add_edge(source,succ)
  /external/llvm/bindings/ocaml/target/
llvm_target.ml 93 external succ : t -> t option = "llvm_target_succ"
105 | Some target -> step (succ target) (target :: lst)
  /external/llvm/include/llvm/Analysis/
RegionIterator.h 73 NodeType *succ; local
74 succ = getNode()->getParent()->getNode(BB);
75 assert(succ && "BB not in Region or entered subregion!");
76 return succ;
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/components/
weakly_connected.py 110 Gsucc = G.succ
  /external/libpcap/
gencode.h 244 struct block *succ; member in struct:edge
355 #define JT(b) ((b)->et.succ)
356 #define JF(b) ((b)->ef.succ)
optimize.c 266 if (ep->succ) {
267 SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords);
268 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords);
1246 * Return true if any register that is used on exit from 'succ', has
1251 use_conflict(struct block *b, struct block *succ)
1254 atomset use = succ->out_use;
1261 if (b->val[atom] != succ->val[atom])
1324 if (JT(ep->succ) == 0)
1327 if (JT(ep->succ) == JF(ep->succ)) {
    [all...]
  /external/llvm/lib/CodeGen/
UnreachableBlockElim.cpp 145 MachineBasicBlock* succ = *BB->succ_begin(); local
147 MachineBasicBlock::iterator start = succ->begin();
148 while (start != succ->end() && start->isPHI()) {
  /external/llvm/lib/Transforms/Scalar/
Sink.cpp 206 Loop *succ = LI->getLoopFor(SuccToSinkTo);
208 if (succ != nullptr && succ != cur)
  /art/compiler/dex/
ssa_transformation.cc 71 ScopedArenaVector<BasicBlock*> succ(allocator.Adapter());
72 succ.reserve(GetNumBlocks());
74 succ.push_back(block);
75 while (!succ.empty()) {
76 BasicBlock* curr = succ.back();
80 succ.push_back(next_successor);
87 succ.pop_back();
  /cts/tests/tests/hardware/src/android/hardware/camera2/cts/helpers/
CameraErrorCollector.java 456 boolean succ = true;
462 succ = false;
467 succ = false;
473 return succ;
584 boolean succ = true;
585 succ = expectTrue(formattedMsg + tooLarge,
586 actualValue <= (expectedValue * (1.0f + errorPercent))) && succ;
587 succ = expectTrue(formattedMsg + tooSmall,
588 actualValue >= (expectedValue * (1.0f - errorPercent))) && succ;
590 return succ;
    [all...]
  /external/guava/guava/src/com/google/common/collect/
LinkedHashMultimap.java 132 private static <K, V> void succeedsInValueSet(ValueSetLink<K, V> pred, ValueSetLink<K, V> succ) {
133 pred.setSuccessorInValueSet(succ);
134 succ.setPredecessorInValueSet(pred);
138 ValueEntry<K, V> pred, ValueEntry<K, V> succ) {
139 pred.setSuccessorInMultimap(succ);
140 succ.setPredecessorInMultimap(pred);
TreeMultiset.java 370 node = node.succ;
373 node = header.succ;
425 if (current.succ == header) {
428 current = current.succ;
531 private AvlNode<E> succ;
557 successor(this, right, succ);
783 successor(pred, succ);
797 AvlNode<E> newTop = succ;
938 a.succ = b;
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
util.rb 156 range.exclude_end? ? last.succ >= range.last : last >= range.last
  /external/v8/src/
hydrogen-load-elimination.cc 144 HLoadEliminationTable* Copy(HBasicBlock* succ, HBasicBlock* from_block,
153 TRACE((" copy-to B%d\n", succ->block_id()));
160 HLoadEliminationTable* Merge(HBasicBlock* succ, HLoadEliminationTable* that,
188 TRACE((" merge-to B%d\n", succ->block_id()));
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentLinkedDeque.java 226 * - all live nodes are reachable from the first node via succ()
695 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedDeque
794 for (Node<E> p = first(); p != null; p = succ(p)) {
    [all...]

Completed in 915 milliseconds

12 3 4 5