| /external/clang/lib/Analysis/ |
| ThreadSafetyTIL.cpp | 210 BasicBlock *Candidate = nullptr;
215 // If we don't yet have a candidate for dominator yet, take this one.
216 if (Candidate == nullptr) {
217 Candidate = Pred;
220 // Walk the alternate and current candidate back to find a common ancestor.
222 while (Alternate != Candidate) {
223 if (Candidate->BlockID > Alternate->BlockID)
224 Candidate = Candidate->DominatorNode.Parent;
229 DominatorNode.Parent = Candidate;
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 98 assert(SuccToSinkTo && "Candidate sink target is null");
133 // dominated by the candidate
171 BasicBlock *Candidate = (*I)->getBlock();
173 IsAcceptableTarget(Inst, Candidate, DT, LI))
174 SuccToSinkTo = Candidate;
|
| NaryReassociate.cpp | 244 // ensures that all bases of a candidate are in Candidates when we process it.
393 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP);
394 if (Candidate == nullptr)
398 // Candidate does not necessarily have the same pointer type as GEP. Use
401 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType());
402 assert(Candidate->getType() == GEP->getType());
404 // NewGEP = (char *)Candidate + RHS * sizeof(IndexedType)
425 // NewGEP = &Candidate[RHS * (sizeof(IndexedType) / sizeof(Candidate[0])))
[all...] |
| StraightLineStrengthReduce.cpp | 81 // SLSR candidate. Such a candidate must be in one of the forms described in
83 struct Candidate : public ilist_node<Candidate> {
91 Candidate()
94 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S,
100 // Note that Index and Stride of a GEP candidate do not necessarily have the
105 // The instruction this candidate corresponds to. It helps us to rewrite a
106 // candidate with respect to its immediate basis. Note that one instruction
120 // Points to the immediate basis of this candidate, or nullptr if we canno
[all...] |
| SeparateConstOffsetFromGEP.cpp | [all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/SystemZ/ |
| SystemZMachineScheduler.cpp | 175 Candidate Best;
178 // SU is the next candidate to be compared against current Best.
179 Candidate c(SU, *HazardRec);
181 // Remeber which SU is the best candidate.
200 SystemZPostRASchedStrategy::Candidate::
201 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec) : Candidate() {
213 bool SystemZPostRASchedStrategy::Candidate::
214 operator<(const Candidate &other) {
244 Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";)
[all...] |
| SystemZMachineScheduler.h | 41 /// A candidate during instruction evaluation.
42 struct Candidate {
51 Candidate() = default;
52 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec);
55 bool operator<(const Candidate &other);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 98 assert(SuccToSinkTo && "Candidate sink target is null");
133 // dominated by the candidate
171 BasicBlock *Candidate = (*I)->getBlock();
174 if (IsAcceptableTarget(Inst, Candidate, DT, LI))
175 SuccToSinkTo = Candidate;
|
| NaryReassociate.cpp | 232 // tree. This order ensures that all bases of a candidate are in Candidates
390 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP);
391 if (Candidate == nullptr)
395 // Candidate does not necessarily have the same pointer type as GEP. Use
398 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType());
399 assert(Candidate->getType() == GEP->getType());
401 // NewGEP = (char *)Candidate + RHS * sizeof(IndexedType)
422 // NewGEP = &Candidate[RHS * (sizeof(IndexedType) / sizeof(Candidate[0])))
[all...] |
| StraightLineStrengthReduce.cpp | 100 // SLSR candidate. Such a candidate must be in one of the forms described in
102 struct Candidate {
110 Candidate() = default;
111 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S,
119 // Note that Index and Stride of a GEP candidate do not necessarily have the
126 // The instruction this candidate corresponds to. It helps us to rewrite a
127 // candidate with respect to its immediate basis. Note that one instruction
142 // Points to the immediate basis of this candidate, or nullptr if we cannot
143 // find any basis for this candidate
[all...] |
| SeparateConstOffsetFromGEP.cpp | [all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/ |
| GCNMinRegStrategy.cpp | 31 struct Candidate : ilist_node<Candidate> {
35 Candidate(const SUnit *SU_, int Priority_ = 0)
39 SpecificBumpPtrAllocator<Candidate> Alloc;
40 using Queue = simple_ilist<Candidate>;
75 Candidate* pickCandidate();
140 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() {
147 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; });
150 LLVM_DEBUG(dbgs() << "\nSelecting min non-ready producing candidate among "
152 Num = findMax(Num, [=](const Candidate &C)
[all...] |
| GCNILPSched.cpp | 23 struct Candidate : ilist_node<Candidate> {
26 Candidate(SUnit *SU_)
30 SpecificBumpPtrAllocator<Candidate> Alloc;
31 typedef simple_ilist<Candidate> Queue;
44 Candidate* pickCandidate();
241 GCNILPScheduler::Candidate* GCNILPScheduler::pickCandidate() {
286 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU));
309 *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU)));
319 [=](const Candidate& C1, const Candidate& C2)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/AggressiveInstCombine/ |
| AggressiveInstCombine.cpp | 104 Value *Candidate;
106 if (!match(V, m_LShr(m_Value(Candidate), m_ConstantInt(BitIndex))))
107 Candidate = V;
111 MOps.Root = Candidate;
119 return MOps.Root == Candidate;
|
| /external/v8/src/compiler/ |
| js-inlining-heuristic.h | 41 struct Candidate {
59 bool operator()(const Candidate& left, const Candidate& right) const;
63 typedef ZoneSet<Candidate, CandidateCompare> Candidates;
67 Reduction InlineCandidate(Candidate const& candidate, bool small_function);
69 Candidate const& candidate, Node** if_successes,
71 bool TryReuseDispatch(Node* node, Node* callee, Candidate const& candidate,
[all...] |
| /external/clang/unittests/Tooling/ |
| TestVisitor.h | 204 : Candidate(Name, LineNumber, ColumnNumber), Found(false) {}
207 if (Candidate.Matches(Name, Location)) {
210 } else if (!Found && Candidate.PartiallyMatches(Name, Location)) {
219 << "Expected \"" << Candidate.ExpectedName
220 << "\" at " << Candidate.LineNumber
221 << ":" << Candidate.ColumnNumber << PartialMatches;
224 MatchCandidate Candidate;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| MachineOutliner.h | 38 struct Candidate {
40 /// The start index of this \p Candidate in the instruction list.
43 /// The number of instructions in this \p Candidate.
46 // The first instruction in this \p Candidate.
49 // The last instruction in this \p Candidate.
52 // The basic block that contains this Candidate.
60 /// The index of this \p Candidate's \p OutlinedFunction in the list of
64 /// Set to false if the candidate overlapped with another candidate.
72 /// this \p Candidate
[all...] |
| /external/webrtc/webrtc/p2p/base/ |
| candidate.h | 30 // Candidate for ICE based connection discovery.
32 class Candidate {
35 // candidate-attribute syntax. http://tools.ietf.org/html/rfc5245#section-15.1
36 Candidate()
43 Candidate(int component,
161 // Determines whether this candidate is equivalent to the given one.
162 bool IsEquivalent(const Candidate& c) const {
239 // and back. This is primarily for converting old G-ICE candidate
240 // signalling to new ICE candidate classes.
|
| /external/brotli/research/ |
| durchschlag.cc | 29 typedef struct Candidate {
32 } Candidate;
35 bool operator()(const Candidate& a, const Candidate& b) const {
42 bool operator()(const Candidate& a, const Candidate& b) const {
80 static Score buildCandidatesList(std::vector<Candidate>* candidates,
498 TextIdx candidate = 0; local
501 candidate = candidates[maxScore];
502 candidates[maxScore] = next[candidate];
603 TextIdx candidate = candidates[0].position; local
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64CollectLOH.cpp | 585 // store are LOH candidate iff the end of the chain is used as
596 // candidate for simplificaton in non-ADRPMode.
690 /// Check whether the given instruction is a LOH candidate.
693 /// \pre UseToDefs contains only on def per use, i.e., obvious non candidate are
794 // If no definition is available, this is a non candidate.
820 // A potential candidate becomes a candidate, if its current immediate
825 for (const MachineInstr *Candidate : PotentialCandidates) {
826 // Get the definition of the candidate i.e., ADD or LDR
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| non_max_suppression_op.cc | 165 // Data structure for selection candidate in NMS.
166 struct Candidate {
171 auto cmp = [](const Candidate bs_i, const Candidate bs_j) {
174 std::priority_queue<Candidate, std::deque<Candidate>, decltype(cmp)>
178 candidate_priority_queue.emplace(Candidate({i, scores_data[i]}));
184 Candidate next_candidate;
297 // Do NMS, get the candidate indices of form vector<int>
298 // Data structure for selection candidate in NMS
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMLoadStoreOptimizer.cpp | [all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| RegAllocLinearScan.cpp | 794 // as a spill candidate since spilling bh doesn't make ebx available.
861 // Calculate the number of conflicts of each candidate.
868 unsigned Candidate = Candidates[j].first;
869 if (tri_->regsOverlap(PhysReg, Candidate)) {
883 unsigned Candidate = Candidates[j].first;
884 if (tri_->regsOverlap(PhysReg, Candidate)) {
892 // Which is the best candidate?
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/ARM/ |
| ARMLoadStoreOptimizer.cpp | [all...] |
| /external/webp/src/mux/ |
| anim_encode.c | 778 // Struct representing a candidate encoded frame including its metadata.
783 int evaluate_; // True if this candidate should be evaluated.
784 } Candidate;
786 // Generates a candidate encoded frame given a picture and metadata.
791 Candidate* const candidate) {
794 assert(candidate != NULL);
795 memset(candidate, 0, sizeof(*candidate));
798 candidate->rect_ = *rect
[all...] |
