| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Transforms/Utils/ |
| CodeExtractor.cpp | 50 SmallVector<BasicBlock *, 3> Candidates;
53 Candidates.push_back(&BB);
55 Candidates.push_back(&BB);
59 Candidates.insert(Candidates.begin(), &Func->getEntryBlock());
62 CodeExtractor CE(Candidates, &DT);
|
| /external/webrtc/webrtc/p2p/base/ |
| stunport_unittest.cc | 159 EXPECT_EQ(0U, port()->Candidates().size());
167 ASSERT_EQ(1U, port()->Candidates().size());
168 EXPECT_TRUE(kLocalAddr.EqualIPs(port()->Candidates()[0].address()));
180 EXPECT_EQ(0U, port()->Candidates().size());
188 ASSERT_EQ(1U, port()->Candidates().size());
189 EXPECT_TRUE(kLocalAddr.EqualIPs(port()->Candidates()[0].address()));
190 EXPECT_EQ(kStunCandidatePriority, port()->Candidates()[0].priority());
199 EXPECT_EQ(0U, port()->Candidates().size());
209 ASSERT_EQ(1U, port()->Candidates().size());
210 EXPECT_TRUE(kLocalAddr.EqualIPs(port()->Candidates()[0].address()))
[all...] |
| turnport_unittest.cc | 338 ASSERT_EQ(1U, turn_port_->Candidates().size());
340 turn_port_->Candidates()[0].address().ipaddr());
341 EXPECT_NE(0, turn_port_->Candidates()[0].address().port());
372 ASSERT_EQ(0U, turn_port_->Candidates().size());
395 ASSERT_EQ(0U, turn_port_->Candidates().size());
404 turn_port_->Candidates()[0], Port::ORIGIN_MESSAGE);
414 udp_port_->Candidates()[0], Port::ORIGIN_MESSAGE);
434 Connection* conn1 = udp_port_->CreateConnection(turn_port_->Candidates()[0],
436 Connection* conn2 = turn_port_->CreateConnection(udp_port_->Candidates()[0],
460 conn2 = turn_port_->CreateConnection(udp_port_->Candidates()[0]
[all...] |
| transportdescription.h | 72 typedef std::vector<Candidate> Candidates;
85 const Candidates& candidates)
92 candidates(candidates) {}
106 candidates(from.candidates) {}
121 candidates = from.candidates;
149 Candidates candidates member in struct:cricket::TransportDescription
[all...] |
| port_unittest.cc | 76 assert(port->Candidates().size() >= 1);
77 return port->Candidates()[0];
[all...] |
| portinterface.h | 79 virtual const std::vector<Candidate>& Candidates() const = 0;
|
| transport_unittest.cc | 18 using cricket::Candidates;
160 cricket::CONNECTIONROLE_NONE, NULL, cricket::Candidates());
181 cricket::CONNECTIONROLE_ACTPASS, NULL, cricket::Candidates());
210 cricket::CONNECTIONROLE_NONE, NULL, cricket::Candidates());
|
| transportcontroller.h | 71 // Start gathering candidates for any new transports, or transports doing an
75 const Candidates& candidates,
107 // (transport_name, candidates)
108 sigslot::signal2<const std::string&, const Candidates&>
177 const Candidates& candidates,
|
| transportcontroller_unittest.cc | 33 using cricket::Candidates;
116 cricket::CONNECTIONROLE_ACTPASS, nullptr, Candidates());
171 const Candidates& candidates) {
176 candidates.begin(), candidates.end());
187 // transport_name => candidates
188 std::map<std::string, Candidates> candidates_;
327 cricket::CONNECTIONROLE_ACTPASS, nullptr, Candidates());
335 // candidates
358 Candidates candidates; local
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopLoadElimination.cpp | 13 // distance of one between stores and loads. These form the candidates for the
141 std::forward_list<StoreToLoadForwardingCandidate> Candidates;
145 return Candidates;
185 Candidates.emplace_front(Load, Store);
189 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &C) {
193 return Candidates;
203 /// \brief If a load has multiple candidates associated (i.e. different
205 /// depending on control flow. Remove these candidates.
223 std::forward_list<StoreToLoadForwardingCandidate> &Candidates) {
230 for (const auto &Cand : Candidates) {
[all...] |
| StraightLineStrengthReduce.cpp | 18 // reduction candidates in the following forms:
25 // candidates S1 and S2 in the same form and S1 dominates S2, we may rewrite S2
107 // can correspond to multiple candidates depending on how you associate the
158 // to Candidates, and tries to find the immediate basis for each of them.
160 // Allocate candidates and find bases for Add instructions.
166 // Allocate candidates and find bases for Mul instructions.
172 // Allocate candidates and find bases for GetElementPtr instructions.
179 // Adds the given form <CT, B, Idx, S> to Candidates, and finds its immediate
203 ilist<Candidate> Candidates;
294 // the number of existing candidates. However, we could do better by usin
[all...] |
| /external/clang/include/clang/Sema/ |
| TemplateDeduction.h | 243 /// For now, assume that the candidates are non-matching specializations.
268 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
273 SmallVector<TemplateSpecCandidate, 16> Candidates;
275 // Stores whether we're taking the address of these candidates. This helps us
293 /// \brief Clear out all of the candidates.
298 iterator begin() { return Candidates.begin(); }
299 iterator end() { return Candidates.end(); }
301 size_t size() const { return Candidates.size(); }
302 bool empty() const { return Candidates.empty(); }
307 Candidates.emplace_back()
[all...] |
| Overload.h | 43 OR_Ambiguous, ///< Ambiguous candidates found.
48 /// Requests that all candidates be shown. Viable candidates will
52 /// Requests that only viable candidates be shown.
699 /// OverloadCandidateSet - A set of overload candidates, used in C++
706 /// Lookup for candidates for a call using operator syntax. Candidates
714 SmallVector<OverloadCandidate, 16> Candidates;
747 /// \brief Clear out all of the candidates.
751 iterator begin() { return Candidates.begin();
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| RegisterScavenging.cpp | 267 BitVector &Candidates,
270 int Survivor = Candidates.find_first();
271 assert(Survivor > 0 && "No candidates for scavenging");
286 // Remove any candidates touched by instruction.
298 Candidates.reset(MO.getReg());
300 Candidates.reset(*R);
311 if (Candidates.test(Survivor))
314 // All candidates gone?
315 if (Candidates.none())
318 Survivor = Candidates.find_first()
[all...] |
| MachineLICM.cpp | 148 /// CandidateInfo - Keep track of information about hoisting candidates.
170 SmallVector<CandidateInfo, 32> &Candidates);
388 SmallVector<CandidateInfo, 32> &Candidates) {
457 Candidates.push_back(CandidateInfo(MI, Def, FI));
468 SmallVector<CandidateInfo, 32> Candidates;
472 // collect potential LICM candidates.
497 ProcessMI(MI, PhysRegDefs, StoredFIs, Candidates);
501 // Now evaluate whether the potential candidates qualify.
506 for (unsigned i = 0, e = Candidates.size(); i != e; ++i) {
507 if (Candidates[i].FI != INT_MIN &
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| MachineOutliner.h | 116 /// candidates overlap. The true benefit is stored in the OutlinedFunction
128 /// Used to ensure that \p Candidates are outlined in an order that
129 /// preserves the start and end indices of other \p Candidates.
162 /// The number of candidates for this \p OutlinedFunction.
166 std::vector<std::shared_ptr<Candidate>> Candidates;
189 /// Return the number of candidates for this \p OutlinedFunction.
204 for (std::shared_ptr<Candidate> &C : Candidates)
228 Candidates.push_back(std::make_shared<outliner::Candidate>(C));
231 for (std::shared_ptr<Candidate> &C : Candidates)
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| LoopLoadElimination.cpp | 13 // distance of one between stores and loads. These form the candidates for the
172 std::forward_list<StoreToLoadForwardingCandidate> Candidates;
176 return Candidates;
215 Candidates.emplace_front(Load, Store);
219 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &C) {
223 return Candidates;
233 /// If a load has multiple candidates associated (i.e. different
235 /// depending on control flow. Remove these candidates.
253 std::forward_list<StoreToLoadForwardingCandidate> &Candidates) {
260 for (const auto &Cand : Candidates) {
[all...] |
| StraightLineStrengthReduce.cpp | 18 // reduction candidates in the following forms:
25 // candidates S1 and S2 in the same form and S1 dominates S2, we may rewrite S2
128 // can correspond to multiple candidates depending on how you associate the
182 // to Candidates, and tries to find the immediate basis for each of them.
185 // Allocate candidates and find bases for Add instructions.
192 // Allocate candidates and find bases for Mul instructions.
200 // Allocate candidates and find bases for GetElementPtr instructions.
209 // Adds the given form <CT, B, Idx, S> to Candidates, and finds its immediate
236 std::list<Candidate> Candidates;
330 // the number of existing candidates. However, we could do better by usin
[all...] |
| /external/google-fruit/extras/scripts/ |
| find_unused_types.sh | 7 echo Candidates:
20 echo Strong candidates:
|
| /external/llvm/lib/CodeGen/ |
| RegisterScavenging.cpp | 277 BitVector &Candidates,
280 int Survivor = Candidates.find_first();
281 assert(Survivor > 0 && "No candidates for scavenging");
296 // Remove any candidates touched by instruction.
299 Candidates.clearBitsNotInMask(MO.getRegMask());
310 Candidates.reset(*AI);
321 if (Candidates.test(Survivor))
324 // All candidates gone?
325 if (Candidates.none())
328 Survivor = Candidates.find_first()
[all...] |
| /external/v8/src/compiler/ |
| js-inlining-heuristic.h | 32 // Processes the list of candidates gathered while the reducer was running,
57 // Comparator for candidates.
62 // Candidates are kept in a sorted set of unique candidates.
63 typedef ZoneSet<Candidate, CandidateCompare> Candidates;
65 // Dumps candidates to console.
88 Candidates candidates_;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/ARM/ |
| ARMParallelDSP.cpp | 87 // instructions that are candidates for parallel execution.
105 OpChainList MACCandidates; // The MAC candidates associated with
122 PMACPairList CreateParallelMACPairs(OpChainList &Candidates);
325 ARMParallelDSP::CreateParallelMACPairs(OpChainList &Candidates) {
326 const unsigned Elems = Candidates.size();
336 BinOpChain *PMul0 = static_cast<BinOpChain*>(Candidates[i].get());
337 BinOpChain *PMul1 = static_cast<BinOpChain*>(Candidates[i+1].get());
449 static void AddMACCandidate(OpChainList &Candidates,
459 Candidates.push_back(make_unique<BinOpChain>(Mul, LHS, RHS));
464 OpChainList &Candidates) {
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| RegisterScavenging.h | 160 BitVector &Candidates,
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| RegisterScavenging.cpp | 308 BitVector &Candidates,
311 int Survivor = Candidates.find_first();
312 assert(Survivor > 0 && "No candidates for scavenging");
327 // Remove any candidates touched by instruction.
330 Candidates.clearBitsNotInMask(MO.getRegMask());
341 Candidates.reset(*AI);
352 if (Candidates.test(Survivor))
355 // All candidates gone?
356 if (Candidates.none())
359 Survivor = Candidates.find_first()
[all...] |
| MIRCanonicalizerPass.cpp | 360 /// Here we find our candidates. What makes an interesting candidate?
367 std::vector<MachineInstr *> Candidates;
390 Candidates.push_back(MI);
393 return Candidates;
536 // 10 registers so that the candidates are more likely to start at the
678 std::vector<MachineInstr *> Candidates = populateCandidates(MBB);
680 std::copy(Candidates.begin(), Candidates.end(),
684 for (auto candidate : Candidates) {
690 // The root nodes are the original candidates (stores normally)
[all...] |
