| /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/libchrome/base/task_scheduler/ |
| scheduler_lock.h | 25 // Default constructor, no predecessor lock.
29 // SchedulerLock(const SchedulerLock* predecessor)
30 // Constructor that specifies an allowed predecessor for that lock.
32 // On Construction if |predecessor| forms a predecessor lock cycle.
34 // |predecessor|. Okay if there was no previous lock acquired.
52 explicit SchedulerLock(const SchedulerLock* predecessor)
53 : SchedulerLockImpl(predecessor) {}
|
| 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...] |
| scheduler_lock_impl.h | 27 explicit SchedulerLockImpl(const SchedulerLockImpl* predecessor);
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| if_conversion.h | 46 // Returns the basic block for the |predecessor|'th index predecessor of
48 BasicBlock* GetIncomingBlock(Instruction* phi, uint32_t predecessor);
50 // Returns the instruction defining the |predecessor|'th index of |phi|.
51 Instruction* GetIncomingValue(Instruction* phi, uint32_t predecessor);
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| hlo_module_group_util.cc | 51 auto add_unique_predecessor = [&](HloInstruction* predecessor) {
52 if (unique.find(predecessor) != unique.end()) {
55 if (metadata_.IsCompanionInstruction(predecessor)) {
56 for (HloInstruction* instr : metadata_.Companions(predecessor)) {
63 if (predecessor->IsCrossModuleAllReduce()) {
65 metadata_.GetAllReduceGroup(*predecessor->all_reduce_id())) {
72 unique.insert(predecessor);
73 predecessors.push_back(predecessor);
101 // Send is a remote predecessor of RecvDone.
107 // Recv is a remote predecessor of Send
[all...] |
| hlo_reachability.cc | 100 for (HloInstruction* predecessor : hlo->control_predecessors()) {
101 add_input(predecessor);
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| if_conversion.h | 47 // Returns the basic block for the |predecessor|'th index predecessor of
49 BasicBlock* GetIncomingBlock(Instruction* phi, uint32_t predecessor);
51 // Returns the instruction defining the |predecessor|'th index of |phi|.
52 Instruction* GetIncomingValue(Instruction* phi, uint32_t predecessor);
|
| /external/parameter-framework/upstream/parameter/ |
| TypeElement.cpp | 146 std::string CTypeElement::getFormattedMapping(const CTypeElement *predecessor) const
151 // Try predecessor type first, then myself (in order to have higher-level
153 if (predecessor) {
154 mapping = predecessor->getFormattedMapping();
|
| TypeElement.h | 88 /** @Returns the mapping associated to the current type and its predecessor
90 * The meaning of predecessor depends on the TypeElement type: e.g. for a
91 * component instance, the predecessor is the ComponentType; for a
92 * ComponentType, the predecessor is its base type.
94 * The predecessor's mapping comes first, then the current type's mapping.
96 * @param[in] predecessor A pointer to the predecessor or NULL.
98 std::string getFormattedMapping(const CTypeElement *predecessor) const;
|
| /external/swiftshader/third_party/LLVM/runtime/libprofile/ |
| GCDAProfiling.c | 131 * where we're also given a pointer to n (predecessor).
133 void llvm_gcda_increment_indirect_counter(uint32_t *predecessor,
138 pred = *predecessor;
150 state_table_row, *predecessor);
|
| /art/compiler/optimizing/ |
| scheduler.cc | 458 for (const SchedulingNode* predecessor : node->GetDataPredecessors()) {
459 const HInstruction* predecessor_instruction = predecessor->GetInstruction();
461 << "[label=\"" << predecessor->GetLatency() << "\",dir=back]\n";
463 for (const SchedulingNode* predecessor : node->GetOtherPredecessors()) {
464 const HInstruction* predecessor_instruction = predecessor->GetInstruction();
655 for (SchedulingNode* predecessor : scheduling_node->GetDataPredecessors()) {
656 predecessor->MaybeUpdateCriticalPath(
657 path_to_node + predecessor->GetInternalLatency() + predecessor->GetLatency());
658 predecessor->DecrementNumberOfUnscheduledSuccessors()
[all...] |
| scheduler.h | 98 // edge from `A` to `B` in the program dependency graph. `A` is a predecessor of
102 // `B` will have a pointer to its predecessor `A`.
170 void AddDataPredecessor(SchedulingNode* predecessor) {
171 data_predecessors_.push_back(predecessor);
172 predecessor->num_unscheduled_successors_++;
179 void AddOtherPredecessor(SchedulingNode* predecessor) {
180 other_predecessors_.push_back(predecessor);
181 predecessor->num_unscheduled_successors_++;
|
| gvn.cc | 141 // Updates this set by intersecting with instructions in a predecessor's set.
142 void IntersectWith(ValueSet* predecessor) {
145 } else if (predecessor->IsEmpty()) {
150 DeleteAllImpureWhich([predecessor](Node* node) {
151 return !predecessor->Contains(node->GetInstruction());
461 for (HBasicBlock* predecessor : predecessors) {
462 set->IntersectWith(FindSetFor(predecessor));
|
| /external/mesa3d/src/intel/compiler/ |
| brw_cfg.cpp | 33 * blocks with successor/predecessor edges connecting them.
397 foreach_list_typed_safe (bblock_link, predecessor, link, &block->parents) {
400 &predecessor->block->children) {
409 if (!successor->block->is_successor_of(predecessor->block)) {
410 predecessor->block->children.push_tail(link(mem_ctx,
418 foreach_list_typed_safe (bblock_link, predecessor, link,
420 if (block == predecessor->block) {
421 predecessor->link.remove();
422 ralloc_free(predecessor);
426 /* Add removed-block's predecessors to its successors' predecessor lists. *
[all...] |
| /external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/ |
| PreInstructionRegisterInfoMethodItem.java | 149 //in the common case of an instruction that only has a single predecessor which is the previous
158 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) {
160 predecessor, registerNum);
182 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) {
184 predecessor, registerNum);
190 if (predecessor.getInstructionIndex() == -1) {
195 writer.printUnsignedLongAsHex(methodAnalyzer.getInstructionAddress(predecessor));
|
| /external/testng/src/main/java/org/testng/internal/ |
| Graph.java | 48 public void addPredecessor(T tm, T predecessor) {
54 node.addPredecessor(predecessor);
55 addNeighbor(tm, predecessor);
58 m_independentNodes.remove(predecessor);
60 ppp(" REMOVED " + predecessor + " FROM INDEPENDENT OBJECTS");
64 private void addNeighbor(T tm, T predecessor) {
65 findNode(tm).addNeighbor(findNode(predecessor));
294 * @return true if this predecessor was found and removed
326 ppp(" ADDING PREDECESSOR FOR " + m_object + " ==> " + tm);
|
| /external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/ |
| AnalyzedInstruction.java | 130 public RegisterType getPredecessorRegisterType(@Nonnull AnalyzedInstruction predecessor, int registerNumber) {
133 new PredecessorOverrideKey(predecessor, registerNumber));
138 return predecessor.postRegisterMap[registerNumber];
141 protected boolean addPredecessor(AnalyzedInstruction predecessor) {
142 return predecessors.add(predecessor);
182 * To determine this, we simply check if the first predecessor is the fake "StartOfMethod" instruction, which has
235 * given register. Any dead, unreachable, or odexed predecessor is ignored. This takes into account any overridden
236 * predecessor register types
244 for (AnalyzedInstruction predecessor: predecessors) {
245 RegisterType predecessorRegisterType = getPredecessorRegisterType(predecessor, registerNumber)
[all...] |
| /external/webrtc/webrtc/libjingle/xmllite/ |
| xmlelement.cc | 331 void XmlElement::InsertChildAfter(XmlChild* predecessor, XmlChild* next) {
332 if (predecessor == NULL) {
337 next->next_child_ = predecessor->next_child_;
338 predecessor->next_child_ = next;
342 void XmlElement::RemoveChildAfter(XmlChild* predecessor) {
345 if (predecessor == NULL) {
350 next = predecessor->next_child_;
351 predecessor->next_child_ = next->next_child_;
355 last_child_ = predecessor;
|
| /external/icu/icu4c/source/i18n/ |
| nfrule.h | 49 const NFRule* predecessor,
91 void extractSubstitutions(const NFRuleSet* ruleSet, const UnicodeString &ruleText, const NFRule* predecessor, UErrorCode& status);
92 NFSubstitution* extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, UErrorCode& status);
|
| /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/tools/class2greylist/src/com/android/class2greylist/ |
| MemberDumpingVisitor.java | 44 (JavaClass) mDescendingVisitor.predecessor(), member,
|
| AnnotationVisitor.java | 78 (JavaClass) mDescendingVisitor.predecessor(), member,
|
| /external/v8/src/compiler/ |
| schedule.cc | 51 void BasicBlock::AddPredecessor(BasicBlock* predecessor) {
52 predecessors_.push_back(predecessor);
106 // Print predecessor blocks for better debugging.
361 // Ensure that useless phi nodes in blocks that only have a single predecessor
383 // Found a predecessor block with multiple successors.
488 for (BasicBlock*& predecessor : successor->predecessors()) {
489 if (predecessor == from) predecessor = to;
521 for (BasicBlock const* predecessor : block->predecessors()) {
524 if (predecessor->rpo_number() == -1)
[all...] |
