| /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/ |
| Instruction.java | 32 private Instruction predecessor; field in class:Instruction
66 * Sets the given instruction as a predecessor of this instruction and adds
67 * branch to the predecessor. Probes are inserted in a way that every
68 * instruction has at most one direct predecessor.
71 * @param predecessor
72 * predecessor instruction
74 * branch number in predecessor that should be marked as covered
77 public void setPredecessor(final Instruction predecessor,
79 this.predecessor = predecessor;
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-mark-unreachable.cc | 24 HBasicBlock* predecessor = it.Current(); local
29 if (predecessor->IsReachable() && !predecessor->IsDeoptimizing()) {
32 predecessor->end()->KnownSuccessorBlock(&pred_succ);
|
| hydrogen.cc | 444 HBasicBlock* predecessor = predecessors_[i]; local
445 DCHECK(predecessor->end()->IsGoto());
446 HSimulate* simulate = HSimulate::cast(predecessor->end()->previous());
448 (predecessor->last_environment()->closure().is_null() ||
449 predecessor->last_environment()->closure()->shared()
452 predecessor->last_environment()->set_ast_id(ast_id);
513 // Only loop header blocks can have a predecessor added after
538 // succeeding block in this list, the predecessor is before the successor.
580 // exceed the number of previously encountered predecessor edges, there is no
593 HBasicBlock* predecessor = it.Current() local
785 HBasicBlock* predecessor = block->predecessors()->at(k); local
[all...] |
| /external/libchrome/base/task_scheduler/ |
| scheduler_lock_impl.cc | 28 const SchedulerLockImpl* const predecessor) {
29 DCHECK_NE(lock, predecessor) << "Reentrant locks are unsupported.";
31 allowed_predecessor_map_[lock] = predecessor;
68 // predecessor.
76 // Asserts that |lock|'s registered predecessor is safe. Because
77 // SchedulerLocks are registered at construction time and any predecessor
79 // SchedulerLock in a potential chain must have a null predecessor and is thus
80 // cycle-free. Any subsequent SchedulerLock with a predecessor must come from
88 const SchedulerLockImpl* predecessor = allowed_predecessor_map_.at(lock); local
89 if (predecessor) {
[all...] |
| scheduler_lock_unittest.cc | 120 SchedulerLock predecessor; local
121 SchedulerLock lock(&predecessor);
122 predecessor.Acquire();
125 predecessor.Release();
129 SchedulerLock predecessor; local
130 SchedulerLock lock(&predecessor);
133 predecessor.Acquire();
193 // A lock and its predecessor may be safely acquired on different threads.
195 // predecessor.Acquire()
197 // predecessor.Release(
199 SchedulerLock predecessor; local
218 SchedulerLock predecessor; local
240 SchedulerLock predecessor; local
[all...] |
| /external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/flow/ |
| InstructionTest.java | 57 final Instruction predecessor = new Instruction( local
59 instruction.setPredecessor(predecessor, 0);
60 assertEquals(1, predecessor.getBranches());
|
| /art/compiler/optimizing/ |
| register_allocation_resolver.cc | 174 for (HBasicBlock* predecessor : block->GetPredecessors()) {
175 ConnectSplitSiblings(interval, predecessor, block);
189 HBasicBlock* predecessor = block->GetPredecessors()[i]; local
190 DCHECK_EQ(predecessor->GetNormalSuccessors().size(), 1u);
193 predecessor->GetLifetimeEnd() - 1);
195 InsertParallelMoveAtExitOf(predecessor, phi, source, destination);
|
| graph_checker.cc | 120 for (HBasicBlock* predecessor : block->GetPredecessors()) {
121 HInstruction* last_instruction = IsExitTryBoundaryIntoExitBlock(predecessor) ?
122 predecessor->GetSinglePredecessor()->GetLastInstruction() :
123 predecessor->GetLastInstruction();
226 for (HBasicBlock* predecessor : block->GetPredecessors()) {
227 const HTryBoundary* incoming_try_entry = predecessor->ComputeTryEntryOfSuccessors();
232 "from predecessor %d.",
236 predecessor->GetBlockId()));
239 "with %s:%d that follows from predecessor %d.",
245 predecessor->GetBlockId()))
615 HBasicBlock* predecessor = loop_header->GetPredecessors()[i]; local
792 HBasicBlock* predecessor = predecessors[i]; local
[all...] |
| nodes.cc | 350 // Use `InsertBetween` to ensure the predecessor index and successor index of
382 // Make sure that the first predecessor of a loop header is the incoming block.
389 HBasicBlock* predecessor = header->GetPredecessors()[pred]; local
390 if (!info->IsBackEdge(*predecessor)) {
392 header->predecessors_[0] = predecessor;
406 HBasicBlock* predecessor = header->GetPredecessors()[pred]; local
407 if (!loop_info->IsBackEdge(*predecessor) && predecessor != new_preheader) {
408 predecessor->ReplaceSuccessor(header, new_preheader);
461 HBasicBlock* predecessor = header->GetPredecessors()[pred] local
2307 HBasicBlock* predecessor = GetPredecessors()[0]; local
2506 HBasicBlock* predecessor = to->GetPredecessors()[pred]; local
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 123 * unique successor or unique predecessor.<p>
128 * predecessor. This ensures move statements can always be
163 * predecessor created for it
168 * predecessors needs a new predecessor node.
182 * unique move-exception block for each predecessor.
198 * one predecessor...
208 SsaBasicBlock predecessor = blocks.get(j); local
210 = predecessor.insertNewSuccessor(block);
261 * successor block has more than one predecessor.
264 * @param block predecessor nod
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Parser/ |
| spark.py | 460 def add(self, set, item, i=None, predecessor=None, causal=None):
461 if predecessor is None:
469 self.links[key].append((predecessor, causal))
584 def predecessor(self, key, causal):
member in class:GenericParser
637 item, k = self.predecessor(key, None)
646 item, k = self.predecessor(key, why)
|
| /external/python/cpython2/Parser/ |
| spark.py | 460 def add(self, set, item, i=None, predecessor=None, causal=None):
461 if predecessor is None:
469 self.links[key].append((predecessor, causal))
584 def predecessor(self, key, causal): member in class:GenericParser
637 item, k = self.predecessor(key, None)
646 item, k = self.predecessor(key, why)
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| NFRuleSet.java | 168 NFRule predecessor = null; local
186 this, predecessor, owner, tempRules); local
188 predecessor = tempRules.get(tempRules.size() - 1);
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| NFRuleSet.java | 167 NFRule predecessor = null; local
185 this, predecessor, owner, tempRules); local
187 predecessor = tempRules.get(tempRules.size() - 1);
[all...] |
| /frameworks/base/core/java/android/view/ |
| Choreographer.java | 1004 CallbackRecord predecessor = null; local
[all...] |
| ViewGroup.java | 2241 HoverTarget predecessor = null; local
2710 TouchTarget predecessor = null; local
2888 TouchTarget predecessor = null; local
2911 TouchTarget predecessor = null; local
[all...] |
| ViewRootImpl.java | 8421 View predecessor = getCommonPredecessor(mSource, source); local
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedSynchronizer.java | 308 * information about a thread in the predecessor of its node. A
310 * should block. A node is signalled when its predecessor
338 * predecessor. For explanation of similar mechanics in the case
344 * predecessor signals the next node to wake up by traversing
358 * a new predecessor, unless we can identify an uncancelled
359 * predecessor who will carry this responsibility.
435 * Link to predecessor node that current node/thread relies on
438 * cancellation of a predecessor, we short-circuit while
452 * assign next field of a predecessor until after attachment,
489 * Use when predecessor cannot be null. The null check coul
494 final Node predecessor() throws NullPointerException { method in class:AbstractQueuedSynchronizer.Node
[all...] |
| /frameworks/base/core/java/android/database/sqlite/ |
| SQLiteConnectionPool.java | 708 ConnectionWaiter predecessor = null; local
715 predecessor = successor;
718 if (predecessor != null) {
719 predecessor.mNext = waiter;
800 ConnectionWaiter predecessor = null; local
870 ConnectionWaiter predecessor = null; local
[all...] |
| /external/v8/src/compiler/ |
| effect-control-linearizer.cc | 87 BasicBlock* predecessor = block->PredecessorAt(static_cast<size_t>(i)); local
89 block_effects->For(predecessor, block);
114 BasicBlock* predecessor = block->PredecessorAt(static_cast<size_t>(i)); local
116 block_effects->For(predecessor, block);
158 // input graph as shown below and clones the Branch node for every predecessor
347 // because the back predecessor has not been handled yet. We just
[all...] |
| register-allocator.cc | 2509 const InstructionBlock* predecessor = local
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| TreeMap.java | 2200 static <K,V> TreeMapEntry<K,V> predecessor(TreeMapEntry<K,V> t) { method in class:TreeMap
[all...] |
| /prebuilts/tools/common/m2/repository/org/parboiled/parboiled-java/1.0.2/ |
| parboiled-java-1.0.2.jar | |
| /prebuilts/tools/common/m2/repository/com/github/kevinstern/software-and-algorithms/1.0/ |
| software-and-algorithms-1.0.jar | |
| /prebuilts/tools/common/m2/repository/org/jacoco/org.jacoco.core/0.7.1.201405082137/ |
| org.jacoco.core-0.7.1.201405082137.jar | |
