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

  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
Waymarking.h 135 // Add a new tag, calculated from Count and Stop, to the Vals pack, while
137 template <unsigned Len, bool Stop, unsigned Count, uint8_t... Vals>
141 template <unsigned Len, unsigned Count, uint8_t... Vals> struct GenTag {
143 typename AddTag<Len, (Count <= MARK_MASK), Count, Vals...>::Xdata Xdata;
149 template <unsigned Len, uint8_t... Vals> struct GenOffset {
150 typedef typename GenTag<Len, sizeof...(Vals), Vals...>::Xdata Xdata;
154 template <unsigned Len, unsigned Count, uint8_t... Vals>
155 struct AddTag<Len, false, Count, Vals...> {
156 typedef typename GenTag<Len - 1, (Count >> MARK_SIZE), Vals...
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
CGProfile.cpp 38 Metadata *Vals[] = {ValueAsMetadata::get(E.first.first),
42 Nodes.push_back(MDNode::get(Context, Vals));
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGLoopInfo.cpp 64 Metadata *Vals[] = {
68 Args.push_back(MDNode::get(Ctx, Vals));
119 Metadata *Vals[] = {MDString::get(Ctx, "llvm.loop.unroll.count"),
122 Args.push_back(MDNode::get(Ctx, Vals));
127 Metadata *Vals[] = {MDString::get(Ctx, "llvm.loop.unroll.enable")};
128 Args.push_back(MDNode::get(Ctx, Vals));
181 Metadata *Vals[] = {
185 Args.push_back(MDNode::get(Ctx, Vals));
189 Metadata *Vals[] = {MDString::get(Ctx, "llvm.loop.unroll_and_jam.enable")};
190 Args.push_back(MDNode::get(Ctx, Vals));
    [all...]
CGExprComplex.cpp 230 ComplexPairTy Vals = Visit(E->getSubExpr());
233 Scope.ForceCleanup({&Vals.first, &Vals.second});
234 return Vals;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
Format.h 91 std::tuple<Ts...> Vals;
97 return _snprintf(Buffer, BufferSize, Fmt, std::get<Is>(Vals)...);
99 return snprintf(Buffer, BufferSize, Fmt, std::get<Is>(Vals)...);
104 format_object(const char *fmt, const Ts &... vals)
105 : format_object_base(fmt), Vals(vals...) {
124 inline format_object<Ts...> format(const char *Fmt, const Ts &... Vals) {
125 return format_object<Ts...>(Fmt, Vals...);
  /src/external/apache2/llvm/dist/llvm/lib/IR/
MDBuilder.cpp 45 SmallVector<Metadata *, 4> Vals(Weights.size() + 1);
46 Vals[0] = createString("branch_weights");
50 Vals[i + 1] = createConstant(ConstantInt::get(Int32Ty, Weights[i]));
52 return MDNode::get(Context, Vals);
198 SmallVector<Metadata *, 4> Vals(Fields.size() * 3);
201 Vals[i * 3 + 0] = createConstant(ConstantInt::get(Int64, Fields[i].Offset));
202 Vals[i * 3 + 1] = createConstant(ConstantInt::get(Int64, Fields[i].Size));
203 Vals[i * 3 + 2] = Fields[i].Type;
205 return MDNode::get(Context, Vals);
302 Metadata *Vals[] =
    [all...]
Instructions.cpp 581 SmallVector<Metadata *, 3> Vals;
582 Vals.push_back(ProfileData->getOperand(0));
591 Vals.push_back(MDB.createConstant(
597 Vals.push_back(ProfileData->getOperand(i));
604 Vals.push_back(ProfileData->getOperand(i + 1));
610 Vals.push_back(MDB.createConstant(
614 setMetadata(LLVMContext::MD_prof, MDNode::get(getContext(), Vals));
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
LegalizeTypesGeneric.cpp 123 SmallVector<SDValue, 8> Vals;
125 Vals.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ElemVT,
130 for (unsigned e = Vals.size(); e - Slot > 2; Slot += 2, e += 1) {
133 SDValue LHS = Vals[Slot];
134 SDValue RHS = Vals[Slot + 1];
139 Vals.push_back(DAG.getNode(
144 Lo = Vals[Slot++];
145 Hi = Vals[Slot++];
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
TailDuplicator.cpp 338 AvailableValsTy Vals;
339 Vals.push_back(std::make_pair(BB, NewReg));
340 SSAUpdateVals.insert(std::make_pair(OrigReg, Vals));
RegisterCoalescer.cpp 649 LiveInterval::iterator ValS =
651 if (ValS == IntB.end())
657 LIS->getInstructionFromIndex(ValS->end.getPrevSlot());
661 // Okay, we now know that ValS ends in the same block that the CopyMI
664 if (ValS+1 != BS) return false;
668 SlotIndex FillerStart = ValS->end, FillerEnd = BS->start;
675 // [ValS.end, BS.begin) of either value number, then we merge the
680 if (BValNo != ValS->valno)
681 IntB.MergeValueNumberInto(BValNo, ValS->valno);
2418 SmallVector<Val, 8> Vals;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/
InstrProf.cpp 976 SmallVector<Metadata *, 3> Vals;
978 Vals.push_back(MDHelper.createString("VP"));
980 Vals.push_back(MDHelper.createConstant(
983 Vals.push_back(
989 Vals.push_back(MDHelper.createConstant(
991 Vals.push_back(MDHelper.createConstant(
996 Inst.setMetadata(LLVMContext::MD_prof, MDNode::get(Ctx, Vals));
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
RegionStore.cpp 1046 const RegionStoreManager::SValListTy &Vals = RM.getInterestingValues(*LCS);
1048 for (RegionStoreManager::SValListTy::const_iterator I = Vals.begin(),
1049 E = Vals.end();
1304 const SValListTy &Vals = getInterestingValues(*LCS);
1306 for (SValListTy::const_iterator I = Vals.begin(),
1307 E = Vals.end(); I != E; ++I) {
2551 const RegionStoreManager::SValListTy &Vals = RM.getInterestingValues(*LCS);
2553 for (RegionStoreManager::SValListTy::const_iterator I = Vals.begin(),
2554 E = Vals.end();
  /src/external/apache2/llvm/dist/llvm/lib/TableGen/
TGParser.cpp 2169 SmallVector<Init*, 16> Vals;
2172 ParseValueList(Vals, CurRec);
2173 if (Vals.empty()) return nullptr;
2185 for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
2190 if (BitsInit *BI = dyn_cast<BitsInit>(Vals[i])) {
2196 if (VarInit *VI = dyn_cast<VarInit>(Vals[i])) {
2205 Init *Bit = Vals[i]->getCastTo(BitRecTy::get());
2207 Error(BraceLoc, "Element #" + Twine(i) + " (" + Vals[i]->getAsString() +
2218 SmallVector<Init*, 16> Vals;
2234 ParseValueList(Vals, CurRec
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/
MipsSEISelLowering.cpp 1283 SDValue Vals[] = { Lo, Hi };
1284 return DAG.getMergeValues(Vals, DL);
1356 SDValue Vals[] = { Out, SDValue(Val.getNode(), 1) };
1357 return DAG.getMergeValues(Vals, DL);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
GVN.cpp 1957 LeaderTableEntry *Vals = &Gvn.LeaderTable[Num];
1958 while (Vals && Vals->BB == BB)
1959 Vals = Vals->Next;
1960 return !Vals;
1981 LeaderTableEntry *Vals = &Gvn.LeaderTable[Num];
1982 while (Vals) {
1983 Call = dyn_cast<CallInst>(Vals->Val);
1986 Vals = Vals->Next
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Bitcode/Writer/
BitcodeWriter.cpp 386 SmallVectorImpl<unsigned> &Vals);
389 SmallVectorImpl<unsigned> &Vals);
391 SmallVectorImpl<uint64_t> &Vals);
393 SmallVectorImpl<unsigned> &Vals);
598 SmallVector<unsigned, 64> Vals;
604 Vals.push_back(Str[i]);
608 Stream.EmitRecord(Code, Vals, AbbrevToUse);
1155 SmallVector<unsigned, 64> Vals;
1158 Vals.push_back(addToStrtab(C->getName()));
1159 Vals.push_back(C->getName().size())
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp 488 SmallVector<ConstantInt *, 8> Vals;
513 /// populates the array Vals with the set of values that match (or do not
583 Vals.push_back(C);
584 Vals.push_back(
606 Vals.push_back(C);
607 Vals.push_back(ConstantInt::get(C->getContext(),
619 Vals.push_back(C);
652 Vals.push_back(ConstantInt::get(I->getContext(), Tmp));
660 /// the value being compared, and stick the list constants into the Vals
4202 SmallVectorImpl<ConstantInt *> &Values = ConstantCompare.Vals;
    [all...]

Completed in 64 milliseconds