HomeSort by: relevance | last modified time | path
    Searched defs:Candidates (Results 1 - 21 of 21) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/Driver/ToolChains/
NetBSD.cpp 434 const std::string Candidates[] = {
443 for (const auto &IncludePath : Candidates) {
Cuda.cpp 131 SmallVector<Candidate, 4> Candidates;
138 Candidates.emplace_back(
142 Candidates.emplace_back(
162 Candidates.emplace_back(
168 Candidates.emplace_back(D.SysRoot + "/usr/local/cuda");
170 Candidates.emplace_back(D.SysRoot + "/usr/local/cuda-" + Ver);
176 Candidates.emplace_back(D.SysRoot + "/usr/lib/cuda");
181 for (const auto &Candidate : Candidates) {
Gnu.cpp 1095 // Sort candidates. Toolchain that best meets the directories tree goes first.
1097 MultilibSet *Candidates[] = {&CSMipsMultilibs, &DebianMipsMultilibs};
1099 std::iter_swap(Candidates, Candidates + 1);
1100 for (const MultilibSet *Candidate : Candidates) {
  /src/external/apache2/llvm/dist/llvm/lib/Target/BPF/
BPFAdjustOpt.cpp 251 SmallVector<PassThroughInfo, 4> Candidates;
288 Candidates.push_back(Info);
301 Candidates.push_back(Info);
305 if (!isCandidate || Candidates.empty())
308 llvm::append_range(PassThroughs, Candidates);
  /src/external/apache2/llvm/dist/clang/include/clang/Sema/
TemplateDeduction.h 287 /// For now, assume that the candidates are non-matching specializations.
312 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
317 SmallVector<TemplateSpecCandidate, 16> Candidates;
320 // Stores whether we're taking the address of these candidates. This helps us
337 /// Clear out all of the candidates.
343 iterator begin() { return Candidates.begin(); }
344 iterator end() { return Candidates.end(); }
346 size_t size() const { return Candidates.size(); }
347 bool empty() const { return Candidates.empty(); }
352 Candidates.emplace_back()
    [all...]
Overload.h 58 /// Ambiguous candidates found.
66 /// Requests that all candidates be shown. Viable candidates will
70 /// Requests that only viable candidates be shown.
73 /// Requests that only tied-for-best candidates be shown.
87 /// The kinds of rewrite we perform on overload candidates. Note that the
823 /// candidates such that all elements of the ambiguity kernel are better
824 /// than all viable candidates not in the ambiguity kernel.
914 /// OverloadCandidateSet - A set of overload candidates, used in C++
923 /// Lookup of operator function candidates in a call using operato
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachineOutliner.h 117 /// candidates overlap. The true benefit is stored in the OutlinedFunction
129 /// Used to ensure that \p Candidates are outlined in an order that
130 /// preserves the start and end indices of other \p Candidates.
167 std::vector<Candidate> Candidates;
183 /// Return the number of candidates for this \p OutlinedFunction.
184 unsigned getOccurrenceCount() const { return Candidates.size(); }
190 for (const Candidate &C : Candidates)
210 unsigned getNumInstrs() const { return Candidates[0].getLength(); }
212 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize,
214 : Candidates(Candidates), SequenceSize(SequenceSize)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/
Mips16InstrInfo.cpp 350 BitVector Candidates =
358 Candidates.reset(MO.getReg());
362 // it will not be in the list of candidates.
379 Available &= Candidates;
390 Reg = Candidates.find_first();
391 Candidates.reset(Reg);
405 SpReg = Candidates.find_first();
406 // Candidates.reset(SpReg); // not really needed
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VPlanSLP.cpp 247 SmallPtrSetImpl<VPValue *> &Candidates,
254 LLVM_DEBUG(dbgs() << " Candidates for "
256 for (auto *Candidate : Candidates) {
299 Candidates.erase(Best);
323 SmallPtrSet<VPValue *, 4> Candidates;
324 LLVM_DEBUG(dbgs() << " Candidates ");
329 Candidates.insert(Ops.second[Lane]);
340 getBest(Mode[Op], Last, Candidates, IAI);
  /src/external/apache2/llvm/dist/clang/lib/Tooling/
InterpolatingCompilationDatabase.cpp 33 // - We only consider compile commands for c-family languages as candidates.
35 // we prefer candidates from the same language.
37 // - For .h files, candidates from any c-family language are acceptable.
327 // when scoring the candidates.
356 // Candidates with extensions matching PreferLanguage will be chosen over
357 // others (unless it's TY_INVALID, or all candidates are bad).
362 auto Candidates = scoreCandidates(Filename);
364 pickWinner(Candidates, Filename, PreferLanguage);
404 DenseMap<size_t, int> Candidates; // Index -> score.
407 Candidates[Entry.second] += Points
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RegisterScavenging.cpp 288 BitVector &Candidates,
291 int Survivor = Candidates.find_first();
292 assert(Survivor > 0 && "No candidates for scavenging");
307 // Remove any candidates touched by instruction.
310 Candidates.clearBitsNotInMask(MO.getRegMask());
321 Candidates.reset(*AI);
332 if (Candidates.test(Survivor))
335 // All candidates gone?
336 if (Candidates.none())
339 Survivor = Candidates.find_first()
    [all...]
InterleavedLoadCombinePass.cpp 72 /// Scan the function for interleaved load candidates and execute the
96 /// Replace interleaved load candidates. It does additional
102 /// Given a set of VectorInfo containing candidates for a given interleave
104 bool findPattern(std::list<VectorInfo> &Candidates,
1054 std::list<VectorInfo> &Candidates, std::list<VectorInfo> &InterleavedLoad,
1056 for (auto C0 = Candidates.begin(), E0 = Candidates.end(); C0 != E0; ++C0) {
1061 // List containing iterators pointing to the VectorInfos of the candidates
1062 std::vector<std::list<VectorInfo>::iterator> Res(Factor, Candidates.end());
1064 for (auto C = Candidates.begin(), E = Candidates.end(); C != E; C++)
    [all...]
MachineSink.cpp 234 SmallVectorImpl<MachineInstr *> &Candidates);
380 SmallVectorImpl<MachineInstr *> &Candidates) {
411 Candidates.push_back(&MI);
472 SmallVector<MachineInstr *, 8> Candidates;
473 FindLoopSinkCandidates(L, Preheader, Candidates);
475 // Walk the candidates in reverse order so that we start with the use
477 // TODO: Sort the candidates using a cost-model.
479 for (auto It = Candidates.rbegin(); It != Candidates.rend(); ++It) {
MachineLICM.cpp 193 /// Keep track of information about hoisting candidates.
209 SmallVectorImpl<CandidateInfo> &Candidates);
425 SmallVectorImpl<CandidateInfo> &Candidates) {
506 Candidates.push_back(CandidateInfo(MI, Def, FI));
521 SmallVector<CandidateInfo, 32> Candidates;
525 // collect potential LICM candidates.
542 ProcessMI(&MI, PhysRegDefs, PhysRegClobbers, StoredFIs, Candidates);
560 // Now evaluate whether the potential candidates qualify.
568 for (CandidateInfo &Candidate : Candidates) {
  /src/external/apache2/llvm/dist/llvm/lib/Option/
OptTable.cpp 220 SmallVector<StringRef, 8> Candidates;
221 StringRef(In.Values).split(Candidates, ",", -1, false);
224 for (StringRef Val : Candidates)
265 // We can eliminate some option prefix/name pairs as candidates right away:
266 // * Ignore option candidates with empty names, such as "--", or names
279 // * Ignore positional argument option candidates (which do not
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
StraightLineStrengthReduce.cpp 17 // reduction candidates in the following forms:
24 // candidates S1 and S2 in the same form and S1 dominates S2, we may rewrite S2
160 // can correspond to multiple candidates depending on how you associate the
195 // to Candidates, and tries to find the immediate basis for each of them.
198 // Allocate candidates and find bases for Add instructions.
205 // Allocate candidates and find bases for Mul instructions.
213 // Allocate candidates and find bases for GetElementPtr instructions.
222 // Adds the given form <CT, B, Idx, S> to Candidates, and finds its immediate
249 std::list<Candidate> Candidates;
341 // the number of existing candidates. However, we could do better by usin
    [all...]
ConstantHoisting.cpp 219 // Candidates includes any block 'BB' in set 'BBs' that is not strictly
222 SmallPtrSet<BasicBlock *, 16> Candidates;
231 // The "Path" is a candidate path to be added into Candidates set.
235 if (Node == Entry || Candidates.count(Node)) {
249 // Add nodes on the Path into Candidates.
250 Candidates.insert(Path.begin(), Path.end());
253 // Sort the nodes in Candidates in top-down order and save the nodes
261 if (Candidates.count(ChildDomNode->getBlock()))
503 // So it's safe for us to collect constant candidates from all
656 /// Finds and combines constant candidates that can be easil
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenTarget.cpp 346 std::vector<CodeGenRegisterClass *> Candidates;
367 Candidates.push_back(SubClassWithSubReg);
371 if (Candidates.empty())
375 llvm::stable_sort(Candidates, [&](const CodeGenRegisterClass *A,
387 return Candidates[0];
  /src/external/apache2/llvm/dist/llvm/lib/Target/AVR/
AVRExpandPseudoInsts.cpp 910 BitVector Candidates =
918 Candidates.reset(MO.getReg());
922 Available &= Candidates;
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMLoadStoreOptimizer.cpp 164 SmallVector<const MergeCandidate*,4> Candidates;
1001 /// Find candidates for load/store multiple merge in list of MemOpQueueEntries.
1112 Candidates.push_back(Candidate);
1881 assert(Candidates.size() == 0);
1970 // If we are here then the chain is broken; Extract candidates for a merge.
1983 // Sort candidates so they get processed from end to begin of the basic
1988 llvm::sort(Candidates, LessThan);
1990 // Go through list of candidates and merge.
1992 for (const MergeCandidate *Candidate : Candidates) {
2015 Candidates.clear()
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaTemplate.cpp 8961 UnresolvedSet<8> Candidates;
9026 // take target attributes into account, we reject candidates
9041 Candidates.addDecl(Specialization, I.getAccess());
9047 // non-template) candidates.
9048 if (QualifiedFriend && Candidates.empty()) {
9052 // candidates at once, to get proper sorting and limiting.
9063 Candidates.begin(), Candidates.end(), FailedCandidates, FD->getLocation(),
9069 if (Result == Candidates.end())
10199 // target attributes into account, we reject candidates here tha
    [all...]

Completed in 70 milliseconds