| /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)) {
|
| /build/tools/releasetools/ |
| add_img_to_target_files | 184 succ = build_image.BuildImage(os.path.join(input_dir, what),
186 assert succ, "build " + what + ".img image failed"
240 succ = build_image.BuildImage(user_dir, image_props, img.name)
241 assert succ, "build userdata.img image failed"
281 succ = build_image.BuildImage(user_dir, image_props, img.name)
282 assert succ, "build cache.img image failed"
|
| add_img_to_target_files.py | 184 succ = build_image.BuildImage(os.path.join(input_dir, what),
186 assert succ, "build " + what + ".img image failed"
240 succ = build_image.BuildImage(user_dir, image_props, img.name)
241 assert succ, "build userdata.img image failed"
281 succ = build_image.BuildImage(user_dir, image_props, img.name)
282 assert succ, "build cache.img image failed"
|
| /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;
|
| /external/v8/src/compiler/ |
| scheduler.cc | 537 void TraceConnect(Node* node, BasicBlock* block, BasicBlock* succ) {
539 if (succ == nullptr) {
544 node->op()->mnemonic(), block->id().ToInt(), succ->id().ToInt());
758 BasicBlock* succ = frame->block->SuccessorAt(frame->index++); local
759 if (succ->rpo_number() == kBlockVisited1) continue;
760 if (succ->rpo_number() == kBlockOnStack) {
763 if (!HasLoopNumber(succ)) {
765 SetLoopNumber(succ, num_loops++);
769 DCHECK(succ->rpo_number() == kBlockUnvisited1);
770 stack_depth = Push(stack_, stack_depth, succ, kBlockUnvisited1)
799 BasicBlock* succ = nullptr; local
[all...] |
| schedule.cc | 196 void Schedule::AddGoto(BasicBlock* block, BasicBlock* succ) {
199 AddSuccessor(block, succ);
423 void Schedule::AddSuccessor(BasicBlock* block, BasicBlock* succ) {
424 block->AddSuccessor(succ);
425 succ->AddPredecessor(block);
|
| /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;
|
| /external/libpcap/ |
| gencode.h | 242 struct block *succ; member in struct:edge
362 #define JT(b) ((b)->et.succ)
363 #define JF(b) ((b)->ef.succ)
|
| optimize.c | 262 if (ep->succ) {
263 SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords);
264 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords);
1256 * Return true if any register that is used on exit from 'succ', has
1261 use_conflict(struct block *b, struct block *succ)
1264 atomset use = succ->out_use;
1271 if (b->val[atom] != succ->val[atom])
1334 if (JT(ep->succ) == 0)
1337 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 | 219 Loop *succ = LI->getLoopFor(SuccToSinkTo);
221 if (succ != nullptr && succ != cur)
|
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| StampedLock.java | 1323 WNode succ, pp; \/\/ find valid successor local
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 183 * - all live nodes are reachable from head via succ()
197 * - the last node is always reachable from tail via succ()
256 * as sentinel for succ(), below.
269 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedQueue
426 for (Node<E> p = first(); p != null; p = succ(p)) {
454 next = succ(p);
460 next = succ(p);
709 for (Node<E> p = succ(pred), q;; p = q) {
717 if ((q = succ(p)) != null)
746 for (Node<E> p = first(); p != null; p = succ(p))
[all...] |
| ConcurrentLinkedDeque.java | 226 * - all live nodes are reachable from the first node via succ()
691 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedDeque
[all...] |
| /cts/tests/camera/src/android/hardware/camera2/cts/helpers/ |
| CameraErrorCollector.java | 456 boolean succ = true;
462 succ = false;
467 succ = false;
473 return succ;
576 boolean succ = true;
577 succ = expectTrue(formattedMsg + tooLarge,
578 actualValue <= (expectedValue * (1.0f + errorPercent))) && succ;
579 succ = expectTrue(formattedMsg + tooSmall,
580 actualValue >= (expectedValue * (1.0f - errorPercent))) && succ;
582 return succ;
[all...] |
| /frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/helpers/ |
| CameraErrorCollector.java | 460 boolean succ = true;
466 succ = false;
471 succ = false;
477 return succ;
588 boolean succ = true;
589 succ = expectTrue(formattedMsg + tooLarge,
590 actualValue <= (expectedValue * (1.0f + errorPercent))) && succ;
591 succ = expectTrue(formattedMsg + tooSmall,
592 actualValue >= (expectedValue * (1.0f - errorPercent))) && succ;
594 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/crankshaft/ |
| hydrogen-load-elimination.cc | 145 HLoadEliminationTable* Copy(HBasicBlock* succ, HBasicBlock* from_block,
154 TRACE((" copy-to B%d\n", succ->block_id()));
161 HLoadEliminationTable* Merge(HBasicBlock* succ, HLoadEliminationTable* that,
189 TRACE((" merge-to B%d\n", succ->block_id()));
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| RopTranslator.java | 263 int succ = block.getPrimarySuccessor(); local
271 if ((succ >= 0) && (succ != nextLabel)) {
286 output.reverseBranch(1, addresses.getStart(succ));
295 addresses.getStart(succ));
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| RopTranslator.java | 269 int succ = block.getPrimarySuccessor(); local
277 if ((succ >= 0) && (succ != nextLabel)) {
292 output.reverseBranch(1, addresses.getStart(succ));
301 addresses.getStart(succ));
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| RopTranslator.java | 270 int succ = block.getPrimarySuccessor(); local
278 if ((succ >= 0) && (succ != nextLabel)) {
293 output.reverseBranch(1, addresses.getStart(succ));
302 addresses.getStart(succ));
|
