| /external/v8/src/compiler/ |
| js-inlining-heuristic.h | 29 // Processes the list of candidates gathered while the reducer was running,
50 // Comparator for candidates.
55 // Candidates are kept in a sorted set of unique candidates.
56 typedef ZoneSet<Candidate, CandidateCompare> Candidates;
58 // Dumps candidates to console.
69 Candidates candidates_;
|
| /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/webrtc/webrtc/p2p/base/ |
| 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...] |
| transport.h | 46 typedef std::vector<Candidate> Candidates;
223 // Tells channels to start gathering candidates if necessary.
237 // Called when one or more candidates are ready from the remote peer.
238 bool AddRemoteCandidates(const std::vector<Candidate>& candidates,
|
| /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...] |
| /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/llvm/lib/Target/Mips/ |
| Mips16InstrInfo.cpp | 335 BitVector Candidates =
343 Candidates.reset(MO.getReg());
347 // it will not be in the list of candidates.
364 Available &= Candidates;
375 Reg = Candidates.find_first();
376 Candidates.reset(Reg);
390 SpReg = Candidates.find_first();
391 // Candidates.reset(SpReg); // not really needed
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Sema/ |
| TemplateDeduction.h | 241 /// For now, assume that the candidates are non-matching specializations.
266 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
271 SmallVector<TemplateSpecCandidate, 16> Candidates;
273 // Stores whether we're taking the address of these candidates. This helps us
291 /// \brief Clear out all of the candidates.
296 iterator begin() { return Candidates.begin(); }
297 iterator end() { return Candidates.end(); }
299 size_t size() const { return Candidates.size(); }
300 bool empty() const { return Candidates.empty(); }
305 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/Sema/ |
| TemplateDeduction.h | 241 /// For now, assume that the candidates are non-matching specializations.
266 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
271 SmallVector<TemplateSpecCandidate, 16> Candidates;
273 // Stores whether we're taking the address of these candidates. This helps us
291 /// \brief Clear out all of the candidates.
296 iterator begin() { return Candidates.begin(); }
297 iterator end() { return Candidates.end(); }
299 size_t size() const { return Candidates.size(); }
300 bool empty() const { return Candidates.empty(); }
305 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/clang/Sema/ |
| TemplateDeduction.h | 241 /// For now, assume that the candidates are non-matching specializations.
266 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
271 SmallVector<TemplateSpecCandidate, 16> Candidates;
273 // Stores whether we're taking the address of these candidates. This helps us
291 /// \brief Clear out all of the candidates.
296 iterator begin() { return Candidates.begin(); }
297 iterator end() { return Candidates.end(); }
299 size_t size() const { return Candidates.size(); }
300 bool empty() const { return Candidates.empty(); }
305 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/Sema/ |
| TemplateDeduction.h | 247 /// For now, assume that the candidates are non-matching specializations.
272 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
277 SmallVector<TemplateSpecCandidate, 16> Candidates;
279 // Stores whether we're taking the address of these candidates. This helps us
297 /// \brief Clear out all of the candidates.
302 iterator begin() { return Candidates.begin(); }
303 iterator end() { return Candidates.end(); }
305 size_t size() const { return Candidates.size(); }
306 bool empty() const { return Candidates.empty(); }
311 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/Sema/ |
| TemplateDeduction.h | 247 /// For now, assume that the candidates are non-matching specializations.
272 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
277 SmallVector<TemplateSpecCandidate, 16> Candidates;
279 // Stores whether we're taking the address of these candidates. This helps us
297 /// \brief Clear out all of the candidates.
302 iterator begin() { return Candidates.begin(); }
303 iterator end() { return Candidates.end(); }
305 size_t size() const { return Candidates.size(); }
306 bool empty() const { return Candidates.empty(); }
311 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/Sema/ |
| TemplateDeduction.h | 247 /// For now, assume that the candidates are non-matching specializations.
272 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
277 SmallVector<TemplateSpecCandidate, 16> Candidates;
279 // Stores whether we're taking the address of these candidates. This helps us
297 /// \brief Clear out all of the candidates.
302 iterator begin() { return Candidates.begin(); }
303 iterator end() { return Candidates.end(); }
305 size_t size() const { return Candidates.size(); }
306 bool empty() const { return Candidates.empty(); }
311 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/clang/Sema/ |
| TemplateDeduction.h | 247 /// For now, assume that the candidates are non-matching specializations.
272 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
277 SmallVector<TemplateSpecCandidate, 16> Candidates;
279 // Stores whether we're taking the address of these candidates. This helps us
297 /// \brief Clear out all of the candidates.
302 iterator begin() { return Candidates.begin(); }
303 iterator end() { return Candidates.end(); }
305 size_t size() const { return Candidates.size(); }
306 bool empty() const { return Candidates.empty(); }
311 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Sema/ |
| TemplateDeduction.h | 241 /// For now, assume that the candidates are non-matching specializations.
266 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
271 SmallVector<TemplateSpecCandidate, 16> Candidates;
273 // Stores whether we're taking the address of these candidates. This helps us
291 /// \brief Clear out all of the candidates.
296 iterator begin() { return Candidates.begin(); }
297 iterator end() { return Candidates.end(); }
299 size_t size() const { return Candidates.size(); }
300 bool empty() const { return Candidates.empty(); }
305 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/Sema/ |
| TemplateDeduction.h | 241 /// For now, assume that the candidates are non-matching specializations.
266 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
271 SmallVector<TemplateSpecCandidate, 16> Candidates;
273 // Stores whether we're taking the address of these candidates. This helps us
291 /// \brief Clear out all of the candidates.
296 iterator begin() { return Candidates.begin(); }
297 iterator end() { return Candidates.end(); }
299 size_t size() const { return Candidates.size(); }
300 bool empty() const { return Candidates.empty(); }
305 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/clang/Sema/ |
| TemplateDeduction.h | 241 /// For now, assume that the candidates are non-matching specializations.
266 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
271 SmallVector<TemplateSpecCandidate, 16> Candidates;
273 // Stores whether we're taking the address of these candidates. This helps us
291 /// \brief Clear out all of the candidates.
296 iterator begin() { return Candidates.begin(); }
297 iterator end() { return Candidates.end(); }
299 size_t size() const { return Candidates.size(); }
300 bool empty() const { return Candidates.empty(); }
305 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/Sema/ |
| TemplateDeduction.h | 247 /// For now, assume that the candidates are non-matching specializations.
272 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
277 SmallVector<TemplateSpecCandidate, 16> Candidates;
279 // Stores whether we're taking the address of these candidates. This helps us
297 /// \brief Clear out all of the candidates.
302 iterator begin() { return Candidates.begin(); }
303 iterator end() { return Candidates.end(); }
305 size_t size() const { return Candidates.size(); }
306 bool empty() const { return Candidates.empty(); }
311 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/Sema/ |
| TemplateDeduction.h | 247 /// For now, assume that the candidates are non-matching specializations.
272 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
277 SmallVector<TemplateSpecCandidate, 16> Candidates;
279 // Stores whether we're taking the address of these candidates. This helps us
297 /// \brief Clear out all of the candidates.
302 iterator begin() { return Candidates.begin(); }
303 iterator end() { return Candidates.end(); }
305 size_t size() const { return Candidates.size(); }
306 bool empty() const { return Candidates.empty(); }
311 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/Sema/ |
| TemplateDeduction.h | 247 /// For now, assume that the candidates are non-matching specializations.
272 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
277 SmallVector<TemplateSpecCandidate, 16> Candidates;
279 // Stores whether we're taking the address of these candidates. This helps us
297 /// \brief Clear out all of the candidates.
302 iterator begin() { return Candidates.begin(); }
303 iterator end() { return Candidates.end(); }
305 size_t size() const { return Candidates.size(); }
306 bool empty() const { return Candidates.empty(); }
311 Candidates.emplace_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/Sema/ |
| TemplateDeduction.h | 247 /// For now, assume that the candidates are non-matching specializations.
272 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
277 SmallVector<TemplateSpecCandidate, 16> Candidates;
279 // Stores whether we're taking the address of these candidates. This helps us
297 /// \brief Clear out all of the candidates.
302 iterator begin() { return Candidates.begin(); }
303 iterator end() { return Candidates.end(); }
305 size_t size() const { return Candidates.size(); }
306 bool empty() const { return Candidates.empty(); }
311 Candidates.emplace_back()
[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/llvm/lib/Target/X86/AsmParser/ |
| X86AsmInstrumentation.cpp | 160 static const MCPhysReg Candidates[] = { X86::RBP, X86::RAX, X86::RBX,
163 for (unsigned Reg : Candidates) {
[all...] |
