| /external/llvm/lib/Transforms/Scalar/ |
| StraightLineStrengthReduce.cpp | 79 // SLSR candidate. Such a candidate must be in one of the forms described in
81 struct Candidate : public ilist_node<Candidate> {
89 Candidate()
92 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S,
98 // Note that Index and Stride of a GEP candidate do not necessarily have the
103 // The instruction this candidate corresponds to. It helps us to rewrite a
104 // candidate with respect to its immediate basis. Note that one instruction
118 // Points to the immediate basis of this candidate, or nullptr if we canno
[all...] |
| Sink.cpp | 183 assert(SuccToSinkTo && "Candidate sink target is null");
213 // dominated by the candidate
250 BasicBlock *Candidate = (*I)->getBlock();
252 IsAcceptableTarget(Inst, Candidate))
253 SuccToSinkTo = Candidate;
|
| /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/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/llvm/lib/Target/AArch64/ |
| AArch64CollectLOH.cpp | 570 // store are LOH candidate iff the end of the chain is used as
581 // candidate for simplificaton in non-ADRPMode.
678 /// Check whether the given instruction is a LOH candidate.
681 /// \pre UseToDefs contains only on def per use, i.e., obvious non candidate are
786 // If no definition is available, this is a non candidate.
812 // A potential candidate becomes a candidate, if its current immediate
817 for (const MachineInstr *Candidate : PotentialCandidates) {
818 // Get the definition of the candidate i.e., ADD or LDR.
819 const MachineInstr *Def = *UseToDefs.find(Candidate)->second.begin()
[all...] |
| /external/clang/lib/Sema/ |
| Scope.cpp | 119 if (VarDecl *Candidate = NRVO.getPointer()) {
120 if (isDeclScope(Candidate))
121 Candidate->setNRVOVariable(true);
223 OS << "NRVO candidate : (clang::VarDecl*)" << NRVO.getPointer() << '\n';
|
| SemaOverload.cpp | 542 /// to the form used in overload-candidate information.
[all...] |
| SemaLookup.cpp | [all...] |
| SemaCodeComplete.cpp | [all...] |
| SemaDeclCXX.cpp | [all...] |
| SemaOpenMP.cpp | 644 bool ValidateCandidate(const TypoCorrection &Candidate) override {
645 NamedDecl *ND = Candidate.getCorrectionDecl();
[all...] |
| /frameworks/minikin/include/minikin/ |
| LineBreaker.h | 189 // A single candidate break
190 struct Candidate {
206 void addCandidate(Candidate cand);
237 std::vector<Candidate> mCandidates;
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 392 /// If this queue only has one ready candidate, return it. As a side effect,
471 SchedCandidate &Candidate,
530 /// Pick the best candidate from the top queue.
537 SchedCandidate &Candidate) {
543 // BestSU remains NULL if no top candidates beat the best existing candidate.
551 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false);
553 // Initialize the candidate if needed.
554 if (!Candidate.SU) {
555 Candidate.SU = *I;
556 Candidate.RPDelta = RPDelta
[all...] |
| HexagonMachineScheduler.h | 114 // The best SUnit candidate.
117 // Register pressure values for the best candidate.
229 SUnit *SU, SchedCandidate &Candidate,
234 SchedCandidate &Candidate);
|
| /external/llvm/lib/Target/Mips/ |
| MipsDelaySlotFiller.cpp | 151 /// disqualify the delay slot candidate between V and values in Uses and
206 /// This function checks if it is valid to move Candidate to the delay slot
209 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
247 bool terminateSearch(const MachineInstr &Candidate) const;
844 bool Filler::delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
846 bool HasHazard = (Candidate.isImplicitDef() || Candidate.isKill());
848 HasHazard |= IM.hasHazard(Candidate);
849 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands())
[all...] |
| /frameworks/minikin/libs/minikin/ |
| LineBreaker.cpp | 76 Candidate cand = {0, 0, 0.0, 0.0, 0.0, 0.0, 0, 0};
129 // This method finds the candidate word breaks (using the ICU break iterator) and sends them
235 Candidate cand;
273 void LineBreaker::addCandidate(Candidate cand) {
383 // non-negative, widthScore will increase monotonically as successive candidate
|
| /external/llvm/utils/release/ |
| test-release.sh | 11 # Download, build, and test the release candidate for an LLVM release.
48 echo " -rc NUM The pre-release candidate number."
49 echo " -final The final release candidate."
153 echo "error: no release candidate number specified"
233 echo "$proj $Release release candidate $RC doesn't exist!"
389 for Candidate in `find $InstallPath/{bin,lib} -type f`; do
390 if file $Candidate | grep ELF | egrep 'executable|shared object' > /dev/null 2>&1 ; then
391 rpath=`objdump -x $Candidate | grep 'RPATH' | sed -e's/^ *RPATH *//'`
394 chrpath -r $newrpath $Candidate 2>&1 > /dev/null 2>&1
|
| /external/clang/lib/Parse/ |
| ParseTentative.cpp | [all...] |
| /external/clang/include/clang/Sema/ |
| SemaInternal.h | 281 /// \brief Find any visible decls for the given typo correction candidate.
284 bool resolveCorrection(TypoCorrection &Candidate);
287 /// candidates and add the nested name specifier changes to each candidate if
288 /// a lookup succeeds (at which point the candidate will be returned to the
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 755 /// Policy for scheduling the next instruction in the candidate's zone.
788 // The best SUnit candidate.
791 // The reason for this candidate.
797 // Register pressure values for the best candidate.
800 // Critical resource consumption of the best candidate.
808 // Copy the status of another candidate without changing policy.
810 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
894 SchedCandidate &Candidate);
|
| /external/v8/src/heap/ |
| mark-compact.cc | 782 class Candidate {
784 Candidate() : fragmentation_(0), page_(NULL) {}
785 Candidate(int f, Page* p) : fragmentation_(f), page_(p) {}
823 "evacuation candidate limit: %d\n",
831 Candidate candidates[kMaxMaxEvacuationCandidates];
838 Candidate* least = NULL;
889 candidates[count++] = Candidate(fragmentation, p);
900 *least = Candidate(fragmentation, p);
1030 JSFunction* candidate = jsfunction_candidates_head_; local
1032 while (candidate != NULL)
1074 SharedFunctionInfo* candidate = shared_function_info_candidates_head_; local
1161 SharedFunctionInfo* candidate = shared_function_info_candidates_head_; local
1198 JSFunction* candidate = jsfunction_candidates_head_; local
1259 JSFunction* candidate = jsfunction_candidates_head_; local
1271 SharedFunctionInfo* candidate = shared_function_info_candidates_head_; local
1298 JSFunction* candidate = jsfunction_candidates_head_; local
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | [all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.help_3.5.0.v20100524.jar | |
| /prebuilts/gradle-plugin/com/android/tools/lint/lint-checks/22.2.0/ |
| lint-checks-22.2.0.jar | |
| /prebuilts/gradle-plugin/com/android/tools/lint/lint-checks/22.4.0/ |
| lint-checks-22.4.0.jar | |
