Home
last modified time | relevance | path

Searched refs:predecessor (Results 1 – 25 of 104) sorted by relevance

12345

/external/libchrome/base/task_scheduler/
Dscheduler_lock_unittest.cc120 SchedulerLock predecessor; in TEST() local
121 SchedulerLock lock(&predecessor); in TEST()
122 predecessor.Acquire(); in TEST()
125 predecessor.Release(); in TEST()
129 SchedulerLock predecessor; in TEST() local
130 SchedulerLock lock(&predecessor); in TEST()
133 predecessor.Acquire(); in TEST()
199 SchedulerLock predecessor; in TEST() local
200 SchedulerLock lock(&predecessor); in TEST()
201 predecessor.Acquire(); in TEST()
[all …]
Dscheduler_lock_impl.cc28 const SchedulerLockImpl* const predecessor) { in RegisterLock() argument
29 DCHECK_NE(lock, predecessor) << "Reentrant locks are unsupported."; in RegisterLock()
31 allowed_predecessor_map_[lock] = predecessor; in RegisterLock()
77 for (const SchedulerLockImpl* predecessor = in AssertSafePredecessor() local
79 predecessor != nullptr; in AssertSafePredecessor()
80 predecessor = allowed_predecessor_map_.at(predecessor)) { in AssertSafePredecessor()
81 DCHECK_NE(predecessor, lock) << in AssertSafePredecessor()
117 SchedulerLockImpl::SchedulerLockImpl(const SchedulerLockImpl* predecessor) { in SchedulerLockImpl() argument
118 g_safe_acquisition_tracker.Get().RegisterLock(this, predecessor); in SchedulerLockImpl()
Dscheduler_lock.h52 explicit SchedulerLock(const SchedulerLock* predecessor) in SchedulerLock() argument
53 : SchedulerLockImpl(predecessor) {} in SchedulerLock()
Dscheduler_lock_impl.h27 explicit SchedulerLockImpl(const SchedulerLockImpl* predecessor);
/external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/
DInstruction.java30 private Instruction predecessor; field in Instruction
69 public void setPredecessor(final Instruction predecessor) { in setPredecessor() argument
70 this.predecessor = predecessor; in setPredecessor()
71 predecessor.addBranch(); in setPredecessor()
82 i = i.predecessor; in setCovered()
/external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/flow/
DInstructionTest.java57 final Instruction predecessor = new Instruction( in testSetPredecessor() local
59 instruction.setPredecessor(predecessor); in testSetPredecessor()
60 assertEquals(1, predecessor.getBranches()); in testSetPredecessor()
65 final Instruction predecessor = new Instruction( in testSetCovered() local
67 instruction.setPredecessor(predecessor); in testSetCovered()
70 assertEquals(1, predecessor.getCoveredBranches()); in testSetCovered()
74 assertEquals(1, predecessor.getCoveredBranches()); in testSetCovered()
/external/bison/src/
DAnnotationList.c230 state **predecessor; in AnnotationList__computePredecessorAnnotations() local
231 for (predecessor = predecessors[s->number]; *predecessor; ++predecessor) in AnnotationList__computePredecessorAnnotations()
252 Sbitset__new_on_obstack ((*predecessor)->nitems, in AnnotationList__computePredecessorAnnotations()
284 *predecessor, in AnnotationList__computePredecessorAnnotations()
299 items, (*predecessor)->nitems); in AnnotationList__computePredecessorAnnotations()
311 predecessor_item < (*predecessor)->nitems; in AnnotationList__computePredecessorAnnotations()
313 if ((*predecessor)->items[predecessor_item] in AnnotationList__computePredecessorAnnotations()
316 aver (predecessor_item != (*predecessor)->nitems); in AnnotationList__computePredecessorAnnotations()
317 if (ielr_item_has_lookahead (*predecessor, 0, in AnnotationList__computePredecessorAnnotations()
332 (*predecessor)->nitems, biter, i) in AnnotationList__computePredecessorAnnotations()
[all …]
Dielr.c426 state **predecessor; in ielr_item_has_lookahead() local
428 for (predecessor = predecessors[s->number]; in ielr_item_has_lookahead()
429 *predecessor; in ielr_item_has_lookahead()
430 ++predecessor) in ielr_item_has_lookahead()
433 goto_follows[map_goto ((*predecessor)->number, in ielr_item_has_lookahead()
440 state **predecessor; in ielr_item_has_lookahead() local
441 for (predecessor = predecessors[s->number]; in ielr_item_has_lookahead()
442 *predecessor; in ielr_item_has_lookahead()
443 ++predecessor) in ielr_item_has_lookahead()
447 predecessor_item < (*predecessor)->nitems; in ielr_item_has_lookahead()
[all …]
/external/v8/src/crankshaft/
Dhydrogen-mark-unreachable.cc24 HBasicBlock* predecessor = it.Current(); in MarkUnreachableBlocks() local
29 if (predecessor->IsReachable() && !predecessor->IsDeoptimizing()) { in MarkUnreachableBlocks()
32 predecessor->end()->KnownSuccessorBlock(&pred_succ); in MarkUnreachableBlocks()
/external/mesa3d/src/mesa/drivers/dri/i965/
Dbrw_cfg.cpp334 foreach_list_typed_safe (bblock_link, predecessor, link, &block->parents) { in remove_block()
337 &predecessor->block->children) { in remove_block()
346 if (!successor->block->is_successor_of(predecessor->block)) { in remove_block()
347 predecessor->block->children.push_tail(link(mem_ctx, in remove_block()
355 foreach_list_typed_safe (bblock_link, predecessor, link, in remove_block()
357 if (block == predecessor->block) { in remove_block()
358 predecessor->link.remove(); in remove_block()
359 ralloc_free(predecessor); in remove_block()
364 foreach_list_typed (bblock_link, predecessor, link, &block->parents) { in remove_block()
365 if (!predecessor->block->is_predecessor_of(successor->block)) { in remove_block()
[all …]
/external/testng/src/main/java/org/testng/internal/
DGraph.java48 public void addPredecessor(T tm, T predecessor) { in addPredecessor() argument
54 node.addPredecessor(predecessor); in addPredecessor()
55 addNeighbor(tm, predecessor); in addPredecessor()
58 m_independentNodes.remove(predecessor); in addPredecessor()
60 ppp(" REMOVED " + predecessor + " FROM INDEPENDENT OBJECTS"); in addPredecessor()
64 private void addNeighbor(T tm, T predecessor) { in addNeighbor() argument
65 findNode(tm).addNeighbor(findNode(predecessor)); in addNeighbor()
/external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/
DPreInstructionRegisterInfoMethodItem.java158 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) { in addMergeRegs()
160 predecessor, registerNum); in addMergeRegs()
182 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) { in writeFullMerge()
184 predecessor, registerNum); in writeFullMerge()
190 if (predecessor.getInstructionIndex() == -1) { in writeFullMerge()
195 writer.printUnsignedLongAsHex(methodAnalyzer.getInstructionAddress(predecessor)); in writeFullMerge()
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/
DAnalyzedInstruction.java130 …public RegisterType getPredecessorRegisterType(@Nonnull AnalyzedInstruction predecessor, int regis… in getPredecessorRegisterType() argument
133 new PredecessorOverrideKey(predecessor, registerNumber)); in getPredecessorRegisterType()
138 return predecessor.postRegisterMap[registerNumber]; in getPredecessorRegisterType()
141 protected boolean addPredecessor(AnalyzedInstruction predecessor) { in addPredecessor() argument
142 return predecessors.add(predecessor); in addPredecessor()
244 for (AnalyzedInstruction predecessor: predecessors) {
245 … RegisterType predecessorRegisterType = getPredecessorRegisterType(predecessor, registerNumber);
291 …protected boolean overridePredecessorRegisterType(@Nonnull AnalyzedInstruction predecessor, int re…
296 …predecessorRegisterOverrides.put(new PredecessorOverrideKey(predecessor, registerNumber), register…
DMethodAnalyzer.java117 @Override protected boolean addPredecessor(AnalyzedInstruction predecessor) { in MethodAnalyzer()
122 …public RegisterType getPredecessorRegisterType(@Nonnull AnalyzedInstruction predecessor, int regis… in MethodAnalyzer()
354 … @Nonnull AnalyzedInstruction analyzedInstruction, @Nonnull AnalyzedInstruction predecessor,
360 predecessor, registerNumber, registerType, analyzedState)) {
369 …overridePredecessorRegisterTypeAndPropagateChanges(analyzedInstruction, predecessor, registerNumbe…
373 …overridePredecessorRegisterTypeAndPropagateChanges(analyzedInstruction, predecessor, registerNumbe…
548 private void addPredecessorSuccessor(@Nonnull AnalyzedInstruction predecessor,
552 … addPredecessorSuccessor(predecessor, successor, exceptionHandlers, instructionsToProcess, false);
555 private void addPredecessorSuccessor(@Nonnull AnalyzedInstruction predecessor,
561 …throw new AnalysisException("Execution can pass from the " + predecessor.instruction.getOpcode().n…
[all …]
/external/webrtc/webrtc/libjingle/xmllite/
Dxmlelement.cc331 void XmlElement::InsertChildAfter(XmlChild* predecessor, XmlChild* next) { in InsertChildAfter() argument
332 if (predecessor == NULL) { in InsertChildAfter()
337 next->next_child_ = predecessor->next_child_; in InsertChildAfter()
338 predecessor->next_child_ = next; in InsertChildAfter()
342 void XmlElement::RemoveChildAfter(XmlChild* predecessor) { in RemoveChildAfter() argument
345 if (predecessor == NULL) { in RemoveChildAfter()
350 next = predecessor->next_child_; in RemoveChildAfter()
351 predecessor->next_child_ = next->next_child_; in RemoveChildAfter()
355 last_child_ = predecessor; in RemoveChildAfter()
/external/parameter-framework/upstream/parameter/
DTypeElement.cpp146 std::string CTypeElement::getFormattedMapping(const CTypeElement *predecessor) const in getFormattedMapping()
153 if (predecessor) { in getFormattedMapping()
154 mapping = predecessor->getFormattedMapping(); in getFormattedMapping()
/external/v8/src/compiler/
Dschedule.cc48 void BasicBlock::AddPredecessor(BasicBlock* predecessor) { in AddPredecessor() argument
49 predecessors_.push_back(predecessor); in AddPredecessor()
432 for (BasicBlock*& predecessor : successor->predecessors()) { in MoveSuccessors()
433 if (predecessor == from) predecessor = to; in MoveSuccessors()
465 for (BasicBlock const* predecessor : block->predecessors()) { in operator <<()
468 if (predecessor->rpo_number() == -1) { in operator <<()
469 os << "id:" << predecessor->id().ToInt(); in operator <<()
471 os << "B" << predecessor->rpo_number(); in operator <<()
/external/swiftshader/third_party/LLVM/runtime/libprofile/
DGCDAProfiling.c133 void llvm_gcda_increment_indirect_counter(uint32_t *predecessor, in llvm_gcda_increment_indirect_counter() argument
138 pred = *predecessor; in llvm_gcda_increment_indirect_counter()
150 state_table_row, *predecessor); in llvm_gcda_increment_indirect_counter()
/external/icu/icu4c/source/i18n/
Dnfrule.h50 const NFRule* predecessor,
91 …const NFRuleSet* ruleSet, const UnicodeString &ruleText, const NFRule* predecessor, UErrorCode& st…
92 …NFSubstitution* extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, UErrorCod…
Dnfrule.cpp109 const NFRule *predecessor, in makeRules() argument
141 rule1->extractSubstitutions(owner, description, predecessor, status); in makeRules()
201 rule2->extractSubstitutions(owner, sbuf, predecessor, status); in makeRules()
212 rule1->extractSubstitutions(owner, sbuf, predecessor, status); in makeRules()
414 const NFRule* predecessor, in extractSubstitutions() argument
421 sub1 = extractSubstitution(ruleSet, predecessor, status); in extractSubstitutions()
427 sub2 = extractSubstitution(ruleSet, predecessor, status); in extractSubstitutions()
468 const NFRule* predecessor, in extractSubstitution() argument
516 result = NFSubstitution::makeSubstitution(subStart, this, predecessor, ruleSet, in extractSubstitution()
/external/icu/android_icu4j/src/main/java/android/icu/text/
DNFRule.java134 NFRule predecessor, in makeRules() argument
159 rule1.extractSubstitutions(owner, description, predecessor); in makeRules()
213 rule2.extractSubstitutions(owner, sbuf.toString(), predecessor); in makeRules()
225 rule1.extractSubstitutions(owner, sbuf.toString(), predecessor); in makeRules()
417 NFRule predecessor) { in extractSubstitutions() argument
419 sub1 = extractSubstitution(owner, predecessor); in extractSubstitutions()
425 sub2 = extractSubstitution(owner, predecessor); in extractSubstitutions()
463 NFRule predecessor) { in extractSubstitution() argument
508 result = NFSubstitution.makeSubstitution(subStart, this, predecessor, owner, in extractSubstitution()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DNFRule.java133 NFRule predecessor, in makeRules() argument
158 rule1.extractSubstitutions(owner, description, predecessor); in makeRules()
212 rule2.extractSubstitutions(owner, sbuf.toString(), predecessor); in makeRules()
224 rule1.extractSubstitutions(owner, sbuf.toString(), predecessor); in makeRules()
416 NFRule predecessor) { in extractSubstitutions() argument
418 sub1 = extractSubstitution(owner, predecessor); in extractSubstitutions()
424 sub2 = extractSubstitution(owner, predecessor); in extractSubstitutions()
462 NFRule predecessor) { in extractSubstitution() argument
507 result = NFSubstitution.makeSubstitution(subStart, this, predecessor, owner, in extractSubstitution()
/external/llvm/test/Transforms/EarlyCSE/
Dconditional.ll43 ; Check specifically for a case where we have a unique predecessor, but
44 ; not a single predecessor. We can not know the value of the condition here.
95 ; Another single predecessor test, but for dominated use
/external/mesa3d/src/gallium/drivers/vc4/
Dvc4_qir.c631 qir_link_blocks(struct qblock *predecessor, struct qblock *successor) in qir_link_blocks() argument
633 _mesa_set_add(successor->predecessors, predecessor); in qir_link_blocks()
634 if (predecessor->successors[0]) { in qir_link_blocks()
635 assert(!predecessor->successors[1]); in qir_link_blocks()
636 predecessor->successors[1] = successor; in qir_link_blocks()
638 predecessor->successors[0] = successor; in qir_link_blocks()
/external/compiler-rt/lib/profile/
DGCDAProfiling.c325 void llvm_gcda_increment_indirect_counter(uint32_t *predecessor, in llvm_gcda_increment_indirect_counter() argument
330 pred = *predecessor; in llvm_gcda_increment_indirect_counter()
343 *counter, *predecessor); in llvm_gcda_increment_indirect_counter()

12345