HomeSort by: relevance | last modified time | path
    Searched refs:Values (Results 1 - 25 of 186) sorted by relevancy

1 2 3 4 5 6 7 8

  /src/external/apache2/llvm/dist/clang/lib/Basic/
XRayInstr.cpp 35 SmallVectorImpl<StringRef> &Values) {
37 Values.push_back("all");
42 Values.push_back("none");
47 Values.push_back("custom");
50 Values.push_back("typed");
54 Values.push_back("function");
56 Values.push_back("function-entry");
58 Values.push_back("function-exit");
Sanitizers.cpp 39 SmallVectorImpl<StringRef> &Values) {
42 Values.push_back(NAME);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
ProvenanceAnalysisEvaluator.cpp 49 static void insertIfNamed(SetVector<Value *> &Values, Value *V) {
52 Values.insert(V);
56 SetVector<Value *> Values;
59 insertIfNamed(Values, &Arg);
62 insertIfNamed(Values, &*I);
65 insertIfNamed(Values, Op);
71 for (Value *V1 : Values) {
73 for (Value *V2 : Values) {
  /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
LatencyBenchmarkRunner.cpp 33 static double computeVariance(const llvm::SmallVector<int64_t, 4> &Values) {
34 if (Values.empty())
36 double Sum = std::accumulate(Values.begin(), Values.end(), 0.0);
38 const double Mean = Sum / Values.size();
40 for (const auto &V : Values) {
44 return Ret / Values.size();
47 static int64_t findMin(const llvm::SmallVector<int64_t, 4> &Values) {
48 if (Values.empty())
50 return *std::min_element(Values.begin(), Values.end())
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Option/
Arg.cpp 29 Values.push_back(Value0);
36 Values.push_back(Value0);
37 Values.push_back(Value1);
42 for (unsigned i = 0, e = Values.size(); i != e; ++i)
43 delete[] Values[i];
55 O << " Values: [";
56 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
58 O << "'" << Values[i] << "'";
93 Output.append(Values.begin(), Values.end())
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Option/
Arg.h 33 /// derive the argument values efficiently.
55 /// Does this argument own its values?
58 /// The argument values, as C strings.
59 SmallVector<const char *, 2> Values;
111 unsigned getNumValues() const { return Values.size(); }
114 return Values[N];
117 SmallVectorImpl<const char *> &getValues() { return Values; }
118 const SmallVectorImpl<const char *> &getValues() const { return Values; }
122 if (Values[i] == Value)
133 /// The distinction is that some options only render their values
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Rewrite/
DeltaTree.cpp 23 /// than binary trees, because they store multiple keys/values in each node.
71 /// Values - This tracks the SourceDelta's currently in this node.
72 SourceDelta Values[2*WidthFactor-1];
74 /// NumValuesUsed - This tracks the number of values this node currently
82 /// FullDelta - This is the full delta of all the values in this node and
97 return Values[i];
102 return Values[i];
140 Values[0] = IR.Split;
173 NewFullDelta += Values[i].Delta;
201 Values[i].Delta += Delta
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VPlanSLP.cpp 162 static SmallVector<VPValue *, 4> getOperands(ArrayRef<VPValue *> Values,
165 for (VPValue *V : Values) {
173 static bool areCommutative(ArrayRef<VPValue *> Values) {
175 cast<VPInstruction>(Values[0])->getOpcode());
179 getOperands(ArrayRef<VPValue *> Values) {
181 auto *VPI = cast<VPInstruction>(Values[0]);
187 Result.push_back(getOperands(Values, 0));
191 Result.push_back(getOperands(Values, I));
198 /// Returns the opcode of Values or ~0 if they do not all agree.
199 static Optional<unsigned> getOpcode(ArrayRef<VPValue *> Values) {
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Basic/Targets/
BPF.cpp 41 void BPFTargetInfo::fillValidCPUList(SmallVectorImpl<StringRef> &Values) const {
42 Values.append(std::begin(ValidCPUNames), std::end(ValidCPUNames));
Lanai.cpp 43 SmallVectorImpl<StringRef> &Values) const {
44 Values.emplace_back("v11");
AVR.cpp 299 void AVRTargetInfo::fillValidCPUList(SmallVectorImpl<StringRef> &Values) const {
300 Values.append(std::begin(ValidFamilyNames), std::end(ValidFamilyNames));
302 Values.push_back(Info.Name);
RISCV.cpp 341 SmallVectorImpl<StringRef> &Values) const {
342 llvm::RISCV::fillValidCPUArchList(Values, false);
352 SmallVectorImpl<StringRef> &Values) const {
353 llvm::RISCV::fillValidTuneCPUArchList(Values, false);
362 SmallVectorImpl<StringRef> &Values) const {
363 llvm::RISCV::fillValidCPUArchList(Values, true);
373 SmallVectorImpl<StringRef> &Values) const {
374 llvm::RISCV::fillValidTuneCPUArchList(Values, true);
RISCV.h 133 void fillValidCPUList(SmallVectorImpl<StringRef> &Values) const override;
135 void fillValidTuneCPUList(SmallVectorImpl<StringRef> &Values) const override;
162 void fillValidCPUList(SmallVectorImpl<StringRef> &Values) const override;
164 void fillValidTuneCPUList(SmallVectorImpl<StringRef> &Values) const override;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/
DebugLocEntry.h 178 SmallVector<DbgValueLoc, 1> Values;
183 /// \param Vals One or more values describing (parts of) the variable.
196 if ((End == Next.Begin && Values == Next.Values)) {
205 ArrayRef<DbgValueLoc> getValues() const { return Values; }
207 Values.append(Vals.begin(), Vals.end());
209 assert((Values.size() == 1 || all_of(Values, [](DbgValueLoc V) {
217 llvm::sort(Values);
218 Values.erase(std::unique(Values.begin(), Values.end()
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
TargetParser.h 141 void fillValidArchListAMDGCN(SmallVectorImpl<StringRef> &Values);
142 void fillValidArchListR600(SmallVectorImpl<StringRef> &Values);
171 void fillValidCPUArchList(SmallVectorImpl<StringRef> &Values, bool IsRV64);
172 void fillValidTuneCPUArchList(SmallVectorImpl<StringRef> &Values, bool IsRV64);
X86TargetParser.h 140 void fillValidCPUArchList(SmallVectorImpl<StringRef> &Values,
143 void fillValidTuneCPUList(SmallVectorImpl<StringRef> &Values,
  /src/external/apache2/llvm/dist/llvm/lib/TextAPI/
TextStubCommon.cpp 45 void ScalarTraits<PlatformSet>::output(const PlatformSet &Values, void *IO,
52 if (Ctx && Ctx->FileKind == TBD_V3 && Values.count(PlatformKind::macOS) &&
53 Values.count(PlatformKind::macCatalyst)) {
58 assert(Values.size() == 1U);
59 switch (*Values.begin()) {
94 PlatformSet &Values) {
101 Values.insert(PlatformKind::macOS);
102 Values.insert(PlatformKind::macCatalyst);
125 Values.insert(Platform);
  /src/sys/external/bsd/compiler_rt/dist/lib/profile/
InstrProfiling.c 52 if (!DI->Values)
55 ValueProfNode **ValueCounters = (ValueProfNode **)DI->Values;
InstrProfilingValue.c 75 if (!COMPILER_RT_BOOL_CMPXCHG(&Data->Values, 0, Mem)) {
90 if (!PData->Values) {
95 ValueProfNode **ValueCounters = (ValueProfNode **)PData->Values;
156 if (initializeValueProfRuntimeRecord(&R, I->NumValueSites, I->Values))
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
LegacyPassNameParser.h 83 array_pod_sort(PNP->Values.begin(), PNP->Values.end(), ValCompare);
88 // ValCompare - Provide a sorting comparator for Values elements...
  /src/external/apache2/llvm/dist/clang/lib/AST/
ComparisonCategories.cpp 205 std::vector<CCR> Values;
206 Values.reserve(4);
208 Values.push_back(IsStrong ? CCR::Equal : CCR::Equivalent);
209 Values.push_back(CCR::Less);
210 Values.push_back(CCR::Greater);
212 Values.push_back(CCR::Unordered);
213 return Values;
  /src/external/apache2/llvm/dist/llvm/lib/Support/
TargetParser.cpp 176 void AMDGPU::fillValidArchListAMDGCN(SmallVectorImpl<StringRef> &Values) {
179 Values.push_back(C.Name);
182 void AMDGPU::fillValidArchListR600(SmallVectorImpl<StringRef> &Values) {
184 Values.push_back(C.Name);
298 void fillValidCPUArchList(SmallVectorImpl<StringRef> &Values, bool IsRV64) {
301 Values.emplace_back(C.Name);
305 void fillValidTuneCPUArchList(SmallVectorImpl<StringRef> &Values, bool IsRV64) {
308 Values.emplace_back(C.Name);
310 #define PROC_ALIAS(NAME, RV32, RV64) Values.emplace_back(StringRef(NAME));
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
StratifiedSets.h 92 : Values(std::move(Map)), Links(std::move(Links)) {}
95 auto Iter = Values.find(Elem);
96 if (Iter == Values.end())
107 DenseMap<T, StratifiedInfo> Values;
295 for (auto &Pair : Values) {
340 return StratifiedSets<T>(std::move(Values), std::move(StratLinks));
393 DenseMap<T, StratifiedInfo> Values;
399 auto Pair = Values.insert(std::make_pair(ToAdd, Info));
548 auto Result = Values.find(Val);
549 if (Result == Values.end()
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
ModuleUtils.h 80 /// Adds global values to the llvm.used list.
81 void appendToUsed(Module &M, ArrayRef<GlobalValue *> Values);
83 /// Adds global values to the llvm.compiler.used list.
84 void appendToCompilerUsed(Module &M, ArrayRef<GlobalValue *> Values);
  /src/external/apache2/llvm/dist/llvm/tools/verify-uselistorder/
verify-uselistorder.cpp 83 std::vector<const Value *> Values;
88 /// un-referencable values.
94 /// All constants that are referenced by other values are included in the
249 Values.push_back(V);
250 IDs[V] = Values.size();
255 dbgs() << "value-mapping (size = " << VM.Values.size() << "):\n";
256 for (unsigned I = 0, E = VM.Values.size(); I != E; ++I) {
258 VM.Values[I]->dump();
263 const Value *V = M.Values[I];
286 dbgs() << " - fail: map size: " << L.Values.size(
    [all...]

Completed in 72 milliseconds

1 2 3 4 5 6 7 8