|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/APFloat.h 621 APFloat &getFirst() { return Floats[0]; }
622 const APFloat &getFirst() const { return Floats[0]; }
623 APFloat &getSecond() { return Floats[1]; }
624 const APFloat &getSecond() const { return Floats[1]; }
include/llvm/BinaryFormat/MsgPackDocument.h 365 memcpy(&Strings.back()[0], S.data(), S.size());
366 return StringRef(&Strings.back()[0], S.size());
include/llvm/CodeGen/MachineRegisterInfo.h 113 return PhysRegUseDefLists[RegNo.id()];
119 return PhysRegUseDefLists[RegNo.id()];
include/llvm/CodeGen/PBQP/Math.h 69 return Data[Index];
76 return Data[Index];
include/llvm/CodeGen/RegAllocPBQP.h 64 UnsafeRows[i - 1] = true;
65 UnsafeCols[j - 1] = true;
105 unsigned operator[](size_t I) const { return Opts[I]; }
192 std::copy(&Other.OptUnsafeEdges[0], &Other.OptUnsafeEdges[NumOpts],
192 std::copy(&Other.OptUnsafeEdges[0], &Other.OptUnsafeEdges[NumOpts],
193 &OptUnsafeEdges[0]);
231 OptUnsafeEdges[i] += UnsafeOpts[i];
239 OptUnsafeEdges[i] -= UnsafeOpts[i];
244 (std::find(&OptUnsafeEdges[0], &OptUnsafeEdges[NumOpts], 0) !=
244 (std::find(&OptUnsafeEdges[0], &OptUnsafeEdges[NumOpts], 0) !=
245 &OptUnsafeEdges[NumOpts]);
include/llvm/CodeGen/RegisterClassInfo.h 74 const RCInfo &RCI = RegClass[RC->getID()];
138 if (!PSetLimits[Idx])
139 PSetLimits[Idx] = computePSetLimit(Idx);
140 return PSetLimits[Idx];
include/llvm/ExecutionEngine/Orc/OrcRemoteTargetServer.h 178 ArgV[0] = "<jit process>";
180 ArgV[Idx++] = Arg.c_str();
181 ArgV[ArgC] = 0;
183 llvm::dbgs() << "Arg " << Idx << ": " << ArgV[Idx] << "\n";
lib/Analysis/DependenceAnalysis.cpp 265 return DV[Level - 1].Direction;
272 return DV[Level - 1].Distance;
281 return DV[Level - 1].Scalar;
289 return DV[Level - 1].PeelFirst;
297 return DV[Level - 1].PeelLast;
304 return DV[Level - 1].Splitable;
1198 Result.DV[Level].Distance = SE->getConstant(Distance);
1201 Result.DV[Level].Direction &= Dependence::DVEntry::LT;
1203 Result.DV[Level].Direction &= Dependence::DVEntry::GT;
1205 Result.DV[Level].Direction &= Dependence::DVEntry::EQ;
1210 Result.DV[Level].Distance = Delta;
1212 Result.DV[Level].Direction &= Dependence::DVEntry::EQ;
1218 Result.DV[Level].Distance = Delta; // since X/1 == X
1246 if (NewDirection < Result.DV[Level].Direction)
1248 Result.DV[Level].Direction &= NewDirection;
1298 Result.DV[Level].Direction &= unsigned(~Dependence::DVEntry::LT);
1299 Result.DV[Level].Direction &= unsigned(~Dependence::DVEntry::GT);
1301 if (!Result.DV[Level].Direction) {
1305 Result.DV[Level].Distance = Delta; // = 0
1312 Result.DV[Level].Splitable = true;
1358 Result.DV[Level].Direction &= unsigned(~Dependence::DVEntry::LT);
1359 Result.DV[Level].Direction &= unsigned(~Dependence::DVEntry::GT);
1361 if (!Result.DV[Level].Direction) {
1365 Result.DV[Level].Splitable = false;
1366 Result.DV[Level].Distance = SE->getZero(Delta->getType());
1392 Result.DV[Level].Direction &= unsigned(~Dependence::DVEntry::EQ);
1653 Result.DV[Level].Direction &= NewDirection;
1654 if (Result.DV[Level].Direction == Dependence::DVEntry::NONE)
1656 return Result.DV[Level].Direction == Dependence::DVEntry::NONE;
1725 Result.DV[Level].Direction &= Dependence::DVEntry::GE;
1726 Result.DV[Level].PeelFirst = true;
1753 Result.DV[Level].Direction &= Dependence::DVEntry::LE;
1754 Result.DV[Level].PeelLast = true;
1834 Result.DV[Level].Direction &= Dependence::DVEntry::LE;
1835 Result.DV[Level].PeelFirst = true;
1862 Result.DV[Level].Direction &= Dependence::DVEntry::GE;
1863 Result.DV[Level].PeelLast = true;
2487 Result.DV[Level - 1].Direction &= unsigned(~Dependence::DVEntry::EQ);
2578 unsigned Old = Result.DV[K - 1].Direction;
2579 Result.DV[K - 1].Direction = Old & Bound[K].DirSet;
2580 Improved |= Old != Result.DV[K - 1].Direction;
2581 if (!Result.DV[K - 1].Direction) {
3740 updateDirection(Result.DV[SJ - 1], Constraints[SJ]);
3741 if (Result.DV[SJ - 1].Direction == Dependence::DVEntry::NONE)
3753 Result.DV[II - 1].Scalar = false;
lib/AsmParser/LLParser.cpp 5234 if (ID.ConstantStructElts[i]->getType() != ST->getElementType(i))
lib/CodeGen/AsmPrinter/WinException.cpp 1170 EndSymbolMap[FuncletState] = EndSymbol;
1278 MCSymbol *EndSym = EndSymbolMap[Clause.State];
lib/CodeGen/GlobalISel/RegBankSelect.cpp 228 NewInstrs[Idx++] = CurMI;
lib/CodeGen/GlobalISel/RegisterBankInfo.cpp 350 Res[Idx] = *ValMap;
lib/CodeGen/LiveRegMatrix.cpp 179 LiveIntervalUnion::Query &Q = Queries[RegUnit];
lib/CodeGen/RegisterClassInfo.cpp 82 std::fill(&PSetLimits[0], &PSetLimits[NumPSets], 0);
82 std::fill(&PSetLimits[0], &PSetLimits[NumPSets], 0);
92 RCInfo &RCI = RegClass[RC->getID()];
125 RCI.Order[N++] = PhysReg;
138 RCI.Order[N++] = PhysReg;
158 dbgs() << ' ' << printReg(RCI.Order[I], TRI);
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 563 SUnit *RegDef = LiveRegDefs[Pred.getReg()]; (void)RegDef;
566 LiveRegDefs[Pred.getReg()] = Pred.getSUnit();
567 if (!LiveRegGens[Pred.getReg()]) {
569 LiveRegGens[Pred.getReg()] = SU;
578 if (!LiveRegDefs[CallResource])
591 LiveRegDefs[CallResource] = Def;
592 LiveRegGens[CallResource] = SU;
772 if (Succ.isAssignedRegDep() && LiveRegDefs[Succ.getReg()] == SU) {
775 LiveRegDefs[Succ.getReg()] = nullptr;
776 LiveRegGens[Succ.getReg()] = nullptr;
783 if (LiveRegDefs[CallResource] == SU)
790 LiveRegDefs[CallResource] = nullptr;
791 LiveRegGens[CallResource] = nullptr;
841 if (Pred.isAssignedRegDep() && SU == LiveRegGens[Pred.getReg()]){
843 assert(LiveRegDefs[Pred.getReg()] == Pred.getSUnit() &&
846 LiveRegDefs[Pred.getReg()] = nullptr;
847 LiveRegGens[Pred.getReg()] = nullptr;
861 assert(!LiveRegDefs[CallResource]);
862 assert(!LiveRegGens[CallResource]);
864 LiveRegDefs[CallResource] = SU;
865 LiveRegGens[CallResource] = SeqEnd;
871 if (LiveRegGens[CallResource] == SU)
877 assert(LiveRegDefs[CallResource]);
878 assert(LiveRegGens[CallResource]);
880 LiveRegDefs[CallResource] = nullptr;
881 LiveRegGens[CallResource] = nullptr;
889 if (!LiveRegDefs[Reg])
893 LiveRegDefs[Reg] = SU;
897 if (!LiveRegGens[Reg]) {
899 LiveRegGens[Reg] = Succ.getSUnit();
902 Succ2.getSUnit()->getHeight() < LiveRegGens[Reg]->getHeight())
903 LiveRegGens[Reg] = Succ2.getSUnit();
1356 if (Pred.isAssignedRegDep() && LiveRegDefs[Pred.getReg()] != SU)
1398 if (LiveRegDefs[CallResource]) {
1399 SDNode *Gen = LiveRegGens[CallResource]->getNode();
1508 if (LiveRegGens[Reg]->getHeight() < LiveCycle) {
1509 BtSU = LiveRegGens[Reg];
1555 SUnit *LRDef = LiveRegDefs[Reg];
1586 LiveRegDefs[Reg] = NewDef;
lib/DebugInfo/DWARF/DWARFUnitIndex.cpp 64 Rows[i].Signature = IndexData.getU64(&Offset);
71 Rows[i].Index = this;
72 Rows[i].Contributions =
74 Contribs[Index - 1] = Rows[i].Contributions.get();
74 Contribs[Index - 1] = Rows[i].Contributions.get();
79 ColumnKinds[i] = static_cast<DWARFSectionKind>(IndexData.getU32(&Offset));
80 if (ColumnKinds[i] == InfoColumnKind) {
92 auto *Contrib = Contribs[i];
99 auto *Contrib = Contribs[i];
131 OS << ' ' << left_justify(getColumnHeader(ColumnKinds[i]), 24);
137 auto &Row = Rows[i];
154 if (Index->ColumnKinds[i] == Sec)
155 return &Contributions[i];
161 return &Contributions[Index->InfoColumn];
168 if (Rows[i].Contributions)
169 OffsetLookup.push_back(&Rows[i]);
171 return E1->Contributions[InfoColumn].Offset <
172 E2->Contributions[InfoColumn].Offset;
176 return E2->Contributions[InfoColumn].Offset <= Offset;
182 const auto &InfoContrib = E->Contributions[InfoColumn];
193 while (Rows[H].getSignature() != S && Rows[H].getSignature() != 0)
193 while (Rows[H].getSignature() != S && Rows[H].getSignature() != 0)
196 if (Rows[H].getSignature() != S)
199 return &Rows[H];
lib/ExecutionEngine/ExecutionEngine.cpp 355 Dest[Size-1] = 0;
359 (GenericValue*)(&Array[i*PtrSize]), SBytePtr);
365 (GenericValue*)(&Array[InputArgv.size()*PtrSize]),
lib/ProfileData/InstrProf.cpp 495 KindSum += VD[V].Count;
lib/ProfileData/InstrProfWriter.cpp 428 OS << Symtab.getFuncNameOrExternalSymbol(VD[I].Value) << ":"
429 << VD[I].Count << "\n";
431 OS << VD[I].Value << ":" << VD[I].Count << "\n";
431 OS << VD[I].Value << ":" << VD[I].Count << "\n";
lib/Support/APFloat.cpp 3917 assert(&Floats[0].getSemantics() == &semIEEEdouble);
3918 assert(&Floats[1].getSemantics() == &semIEEEdouble);
3923 Floats(RHS.Floats ? new APFloat[2]{APFloat(RHS.Floats[0]),
3924 APFloat(RHS.Floats[1])}
3937 Floats[0] = RHS.Floats[0];
3937 Floats[0] = RHS.Floats[0];
3938 Floats[1] = RHS.Floats[1];
3938 Floats[1] = RHS.Floats[1];
3957 Floats[0] = std::move(z);
3958 Floats[1].makeZero(/* Neg = */ false);
3975 Floats[0] = std::move(z);
3976 Floats[1].makeZero(/* Neg = */ false);
3979 Floats[0] = z;
3984 Floats[1] = a;
3985 Status |= Floats[1].subtract(z, RM);
3986 Status |= Floats[1].add(c, RM);
3987 Status |= Floats[1].add(zz, RM);
3990 Floats[1] = c;
3991 Status |= Floats[1].subtract(z, RM);
3992 Status |= Floats[1].add(a, RM);
3993 Status |= Floats[1].add(zz, RM);
4011 Floats[0] = std::move(z);
4012 Floats[1].makeZero(/* Neg = */ false);
4015 Floats[0] = z;
4016 Status |= Floats[0].add(zz, RM);
4017 if (!Floats[0].isFinite()) {
4018 Floats[1].makeZero(/* Neg = */ false);
4021 Floats[1] = std::move(z);
4022 Status |= Floats[1].subtract(Floats[0], RM);
4022 Status |= Floats[1].subtract(Floats[0], RM);
4023 Status |= Floats[1].add(zz, RM);
4063 APFloat A(LHS.Floats[0]), AA(LHS.Floats[1]), C(RHS.Floats[0]),
4063 APFloat A(LHS.Floats[0]), AA(LHS.Floats[1]), C(RHS.Floats[0]),
4063 APFloat A(LHS.Floats[0]), AA(LHS.Floats[1]), C(RHS.Floats[0]),
4064 CC(RHS.Floats[1]);
4069 assert(&Out.Floats[0].getSemantics() == &semIEEEdouble);
4070 assert(&Out.Floats[1].getSemantics() == &semIEEEdouble);
4131 APFloat A = Floats[0], B = Floats[1], C = RHS.Floats[0], D = RHS.Floats[1];
4131 APFloat A = Floats[0], B = Floats[1], C = RHS.Floats[0], D = RHS.Floats[1];
4131 APFloat A = Floats[0], B = Floats[1], C = RHS.Floats[0], D = RHS.Floats[1];
4131 APFloat A = Floats[0], B = Floats[1], C = RHS.Floats[0], D = RHS.Floats[1];
4136 Floats[0] = T;
4137 Floats[1].makeZero(/* Neg = */ false);
4161 Floats[0] = U;
4163 Floats[1].makeZero(/* Neg = */ false);
4168 Floats[1] = T;
4222 Floats[0].changeSign();
4223 Floats[1].changeSign();
4228 auto Result = Floats[0].compareAbsoluteValue(RHS.Floats[0]);
4228 auto Result = Floats[0].compareAbsoluteValue(RHS.Floats[0]);
4231 Result = Floats[1].compareAbsoluteValue(RHS.Floats[1]);
4231 Result = Floats[1].compareAbsoluteValue(RHS.Floats[1]);
4233 auto Against = Floats[0].isNegative() ^ Floats[1].isNegative();
4233 auto Against = Floats[0].isNegative() ^ Floats[1].isNegative();
4234 auto RHSAgainst = RHS.Floats[0].isNegative() ^ RHS.Floats[1].isNegative();
4234 auto RHSAgainst = RHS.Floats[0].isNegative() ^ RHS.Floats[1].isNegative();
4248 return Floats[0].getCategory();
4251 bool DoubleAPFloat::isNegative() const { return Floats[0].isNegative(); }
4254 Floats[0].makeInf(Neg);
4255 Floats[1].makeZero(/* Neg = */ false);
4259 Floats[0].makeZero(Neg);
4260 Floats[1].makeZero(/* Neg = */ false);
4265 Floats[0] = APFloat(semIEEEdouble, APInt(64, 0x7fefffffffffffffull));
4266 Floats[1] = APFloat(semIEEEdouble, APInt(64, 0x7c8ffffffffffffeull));
4273 Floats[0].makeSmallest(Neg);
4274 Floats[1].makeZero(/* Neg = */ false);
4279 Floats[0] = APFloat(semIEEEdouble, APInt(64, 0x0360000000000000ull));
4281 Floats[0].changeSign();
4282 Floats[1].makeZero(/* Neg = */ false);
4286 Floats[0].makeNaN(SNaN, Neg, fill);
4287 Floats[1].makeZero(/* Neg = */ false);
4291 auto Result = Floats[0].compare(RHS.Floats[0]);
4291 auto Result = Floats[0].compare(RHS.Floats[0]);
4294 return Floats[1].compare(RHS.Floats[1]);
4294 return Floats[1].compare(RHS.Floats[1]);
4299 return Floats[0].bitwiseIsEqual(RHS.Floats[0]) &&
4299 return Floats[0].bitwiseIsEqual(RHS.Floats[0]) &&
4300 Floats[1].bitwiseIsEqual(RHS.Floats[1]);
4300 Floats[1].bitwiseIsEqual(RHS.Floats[1]);
4305 return hash_combine(hash_value(Arg.Floats[0]), hash_value(Arg.Floats[1]));
4305 return hash_combine(hash_value(Arg.Floats[0]), hash_value(Arg.Floats[1]));
4312 Floats[0].bitcastToAPInt().getRawData()[0],
4313 Floats[1].bitcastToAPInt().getRawData()[0],
4387 (Floats[0].isDenormal() || Floats[1].isDenormal() ||
4387 (Floats[0].isDenormal() || Floats[1].isDenormal() ||
4389 Floats[0].compare(Floats[0] + Floats[1]) != cmpEqual);
4389 Floats[0].compare(Floats[0] + Floats[1]) != cmpEqual);
4389 Floats[0].compare(Floats[0] + Floats[1]) != cmpEqual);
4410 return Floats[0].isInteger() && Floats[1].isInteger();
4410 return Floats[0].isInteger() && Floats[1].isInteger();
4435 return DoubleAPFloat(semPPCDoubleDouble, scalbn(Arg.Floats[0], Exp, RM),
4436 scalbn(Arg.Floats[1], Exp, RM));
4442 APFloat First = frexp(Arg.Floats[0], Exp, RM);
4443 APFloat Second = Arg.Floats[1];
lib/Transforms/Vectorize/SLPVectorizer.cpp 4601 return &(ScheduleDataChunks.back()[ChunkPos++]);
tools/clang/include/clang/Lex/Preprocessor.h 1476 TokCopy[0] = Tok;
tools/clang/lib/Frontend/PrintPreprocessedOutput.cpp 679 Toks[0] = PragmaTok;
tools/clang/lib/FrontendTool/ExecuteCompilerInvocation.cpp 233 Args[0] = "clang (LLVM option parsing)";
235 Args[i + 1] = Clang->getFrontendOpts().LLVMArgs[i].c_str();
236 Args[NumArgs + 1] = nullptr;
tools/clang/lib/Lex/PPDirectives.cpp 1063 Toks[0] = SavedHash;
1064 Toks[1] = Result;
1069 Toks[1].setKind(tok::unknown);
1552 Tok[0].startToken();
1553 Tok[0].setKind(Kind);
1554 Tok[0].setLocation(Range.getBegin());
1555 Tok[0].setAnnotationEndLoc(Range.getEnd());
1556 Tok[0].setAnnotationValue(AnnotationVal);
tools/clang/lib/Lex/PPMacroExpansion.cpp 808 Toks[0] = Tok;
tools/clang/lib/Lex/Pragma.cpp 147 Toks[Tokens.size() - 1] = Tok;
tools/clang/lib/Parse/ParseCXXInlineMethods.cpp 991 Buffer[Toks.size() - 1] = Self.Tok;
tools/clang/lib/Parse/ParsePragma.cpp 1625 Toks[0].startToken();
1626 Toks[0].setKind(tok::annot_pragma_vis);
1627 Toks[0].setLocation(VisLoc);
1628 Toks[0].setAnnotationEndLoc(EndLoc);
1629 Toks[0].setAnnotationValue(
3002 TokenArray[0].startToken();
3003 TokenArray[0].setKind(tok::annot_pragma_loop_hint);
3004 TokenArray[0].setLocation(PragmaName.getLocation());
3005 TokenArray[0].setAnnotationEndLoc(PragmaName.getLocation());
3006 TokenArray[0].setAnnotationValue(static_cast<void *>(Info));
3274 TokenArray[0].startToken();
3275 TokenArray[0].setKind(tok::annot_pragma_attribute);
3276 TokenArray[0].setLocation(FirstToken.getLocation());
3277 TokenArray[0].setAnnotationEndLoc(FirstToken.getLocation());
3278 TokenArray[0].setAnnotationValue(static_cast<void *>(Info));
tools/clang/lib/Tooling/ASTDiff/ASTDiff.cpp 43 SrcToDst[Src] = Dst, DstToSrc[Dst] = Src;
43 SrcToDst[Src] = Dst, DstToSrc[Dst] = Src;
46 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; }
47 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; }
573 TreeDist[I] = std::make_unique<double[]>(size_t(S2.getSize()) + 1);
574 ForestDist[I] = std::make_unique<double[]>(size_t(S2.getSize()) + 1);
607 ForestDist[Row - 1][Col] + 1 == ForestDist[Row][Col]) {
607 ForestDist[Row - 1][Col] + 1 == ForestDist[Row][Col]) {
607 ForestDist[Row - 1][Col] + 1 == ForestDist[Row][Col]) {
607 ForestDist[Row - 1][Col] + 1 == ForestDist[Row][Col]) {
610 ForestDist[Row][Col - 1] + 1 == ForestDist[Row][Col]) {
610 ForestDist[Row][Col - 1] + 1 == ForestDist[Row][Col]) {
610 ForestDist[Row][Col - 1] + 1 == ForestDist[Row][Col]) {
610 ForestDist[Row][Col - 1] + 1 == ForestDist[Row][Col]) {
661 ForestDist[LMD1][LMD2] = 0;
661 ForestDist[LMD1][LMD2] = 0;
663 ForestDist[D1][LMD2] = ForestDist[D1 - 1][LMD2] + DeletionCost;
663 ForestDist[D1][LMD2] = ForestDist[D1 - 1][LMD2] + DeletionCost;
663 ForestDist[D1][LMD2] = ForestDist[D1 - 1][LMD2] + DeletionCost;
663 ForestDist[D1][LMD2] = ForestDist[D1 - 1][LMD2] + DeletionCost;
665 ForestDist[LMD1][D2] = ForestDist[LMD1][D2 - 1] + InsertionCost;
665 ForestDist[LMD1][D2] = ForestDist[LMD1][D2 - 1] + InsertionCost;
665 ForestDist[LMD1][D2] = ForestDist[LMD1][D2 - 1] + InsertionCost;
665 ForestDist[LMD1][D2] = ForestDist[LMD1][D2 - 1] + InsertionCost;
670 ForestDist[D1][D2] =
670 ForestDist[D1][D2] =
671 std::min({ForestDist[D1 - 1][D2] + DeletionCost,
671 std::min({ForestDist[D1 - 1][D2] + DeletionCost,
672 ForestDist[D1][D2 - 1] + InsertionCost,
672 ForestDist[D1][D2 - 1] + InsertionCost,
673 ForestDist[D1 - 1][D2 - 1] + UpdateCost});
673 ForestDist[D1 - 1][D2 - 1] + UpdateCost});
674 TreeDist[D1][D2] = ForestDist[D1][D2];
674 TreeDist[D1][D2] = ForestDist[D1][D2];
674 TreeDist[D1][D2] = ForestDist[D1][D2];
674 TreeDist[D1][D2] = ForestDist[D1][D2];
676 ForestDist[D1][D2] =
676 ForestDist[D1][D2] =
677 std::min({ForestDist[D1 - 1][D2] + DeletionCost,
677 std::min({ForestDist[D1 - 1][D2] + DeletionCost,
678 ForestDist[D1][D2 - 1] + InsertionCost,
678 ForestDist[D1][D2 - 1] + InsertionCost,
679 ForestDist[DLMD1][DLMD2] + TreeDist[D1][D2]});
679 ForestDist[DLMD1][DLMD2] + TreeDist[D1][D2]});
679 ForestDist[DLMD1][DLMD2] + TreeDist[D1][D2]});
679 ForestDist[DLMD1][DLMD2] + TreeDist[D1][D2]});
tools/clang/lib/Tooling/DependencyScanning/DependencyScanningFilesystem.cpp 119 CacheShard &Shard = CacheShards[llvm::hash_value(Key) % NumShards];
tools/clang/lib/Tooling/Refactoring/Rename/SymbolOccurrences.cpp 32 MultipleRanges[Loc.index()] = SourceRange(
tools/clang/tools/driver/cc1as_main.cpp 600 Args[0] = "clang (LLVM option parsing)";
602 Args[i + 1] = Asm.LLVMArgs[i].c_str();
603 Args[NumArgs + 1] = nullptr;
tools/lldb/source/Expression/IRInterpreter.cpp 1570 rawArgs[i].data_up[dataSize] = '\0';
tools/lldb/source/Utility/Args.cpp 165 ptr[size] = 0;
tools/lli/lli.cpp 940 std::copy(ChildExecPath.begin(), ChildExecPath.end(), &ChildPath[0]);
941 ChildPath[ChildExecPath.size()] = '\0';
944 std::copy(ChildInStr.begin(), ChildInStr.end(), &ChildIn[0]);
945 ChildIn[ChildInStr.size()] = '\0';
948 std::copy(ChildOutStr.begin(), ChildOutStr.end(), &ChildOut[0]);
949 ChildOut[ChildOutStr.size()] = '\0';
952 char * const args[] = { &ChildPath[0], &ChildIn[0], &ChildOut[0], nullptr };
952 char * const args[] = { &ChildPath[0], &ChildIn[0], &ChildOut[0], nullptr };
952 char * const args[] = { &ChildPath[0], &ChildIn[0], &ChildOut[0], nullptr };
tools/llvm-profdata/llvm-profdata.cpp 782 SiteSum += VD[V].Count;
789 OS << format("%4" PRIu64, VD[V].Value);
791 OS << Symtab->getFuncName(VD[V].Value);
792 OS << ", " << format("%10" PRId64, VD[V].Count) << " ] ("
793 << format("%.2f%%", (VD[V].Count * 100.0 / SiteSum)) << ")\n";
unittests/ADT/MakeUniqueTest.cpp 72 EXPECT_EQ(0, p1[0]);
73 EXPECT_EQ(0, p1[1]);
unittests/ProfileData/InstrProfTest.cpp 265 ASSERT_EQ(3U, VD[0].Count);
266 ASSERT_EQ(2U, VD[1].Count);
267 ASSERT_EQ(1U, VD[2].Count);
270 ASSERT_EQ(StringRef((const char *)VD[0].Value, 7), StringRef("callee3"));
271 ASSERT_EQ(StringRef((const char *)VD[1].Value, 7), StringRef("callee2"));
272 ASSERT_EQ(StringRef((const char *)VD[2].Value, 7), StringRef("callee1"));
404 ASSERT_EQ(30U, VD[0].Count);
405 ASSERT_EQ(20U, VD[1].Count);
406 ASSERT_EQ(10U, VD[2].Count);
409 ASSERT_EQ(StringRef((const char *)VD[0].Value, 7), StringRef("callee3"));
410 ASSERT_EQ(StringRef((const char *)VD[1].Value, 7), StringRef("callee2"));
411 ASSERT_EQ(StringRef((const char *)VD[2].Value, 7), StringRef("callee1"));
453 ASSERT_EQ(StringRef((const char *)VD[0].Value, 7), StringRef("callee3"));
454 ASSERT_EQ(StringRef((const char *)VD[1].Value, 7), StringRef("callee2"));
455 ASSERT_EQ(StringRef((const char *)VD[2].Value, 7), StringRef("callee1"));
531 ASSERT_EQ(StringRef((const char *)VD[0].Value, 7), StringRef("callee2"));
532 ASSERT_EQ(7U, VD[0].Count);
533 ASSERT_EQ(StringRef((const char *)VD[1].Value, 7), StringRef("callee3"));
534 ASSERT_EQ(6U, VD[1].Count);
535 ASSERT_EQ(StringRef((const char *)VD[2].Value, 7), StringRef("callee4"));
536 ASSERT_EQ(4U, VD[2].Count);
537 ASSERT_EQ(StringRef((const char *)VD[3].Value, 7), StringRef("callee1"));
538 ASSERT_EQ(1U, VD[3].Count);
542 ASSERT_EQ(StringRef((const char *)VD_2[0].Value, 7), StringRef("callee3"));
543 ASSERT_EQ(6U, VD_2[0].Count);
544 ASSERT_EQ(StringRef((const char *)VD_2[1].Value, 7), StringRef("callee4"));
545 ASSERT_EQ(4U, VD_2[1].Count);
546 ASSERT_EQ(StringRef((const char *)VD_2[2].Value, 7), StringRef("callee2"));
547 ASSERT_EQ(3U, VD_2[2].Count);
548 ASSERT_EQ(StringRef((const char *)VD_2[3].Value, 7), StringRef("callee1"));
549 ASSERT_EQ(1U, VD_2[3].Count);
553 ASSERT_EQ(StringRef((const char *)VD_3[0].Value, 7), StringRef("callee1"));
554 ASSERT_EQ(1U, VD_3[0].Count);
558 ASSERT_EQ(StringRef((const char *)VD_4[0].Value, 7), StringRef("callee3"));
559 ASSERT_EQ(6U, VD_4[0].Count);
560 ASSERT_EQ(StringRef((const char *)VD_4[1].Value, 7), StringRef("callee2"));
561 ASSERT_EQ(4U, VD_4[1].Count);
562 ASSERT_EQ(StringRef((const char *)VD_4[2].Value, 7), StringRef("callee1"));
563 ASSERT_EQ(2U, VD_4[2].Count);
618 ASSERT_EQ(StringRef("bar"), StringRef((const char *)VD[0].Value, 3));
619 ASSERT_EQ(Max, VD[0].Count);
666 ASSERT_EQ(VD[I].Value, 509 - I);
667 ASSERT_EQ(VD[I].Count, 1509 - I);
716 llvm::sort(&VD_0[0], &VD_0[5], Cmp);
716 llvm::sort(&VD_0[0], &VD_0[5], Cmp);
717 ASSERT_EQ(StringRef((const char *)VD_0[0].Value, 7), StringRef("callee2"));
718 ASSERT_EQ(1000U, VD_0[0].Count);
719 ASSERT_EQ(StringRef((const char *)VD_0[1].Value, 7), StringRef("callee3"));
720 ASSERT_EQ(500U, VD_0[1].Count);
721 ASSERT_EQ(StringRef((const char *)VD_0[2].Value, 7), StringRef("callee1"));
722 ASSERT_EQ(400U, VD_0[2].Count);
723 ASSERT_EQ(StringRef((const char *)VD_0[3].Value, 7), StringRef("callee4"));
724 ASSERT_EQ(300U, VD_0[3].Count);
725 ASSERT_EQ(StringRef((const char *)VD_0[4].Value, 7), StringRef("callee5"));
726 ASSERT_EQ(100U, VD_0[4].Count);
730 llvm::sort(&VD_1[0], &VD_1[4], Cmp);
730 llvm::sort(&VD_1[0], &VD_1[4], Cmp);
731 ASSERT_EQ(StringRef((const char *)VD_1[0].Value, 7), StringRef("callee2"));
732 ASSERT_EQ(2500U, VD_1[0].Count);
733 ASSERT_EQ(StringRef((const char *)VD_1[1].Value, 7), StringRef("callee1"));
734 ASSERT_EQ(1300U, VD_1[1].Count);
735 ASSERT_EQ(StringRef((const char *)VD_1[2].Value, 7), StringRef("callee3"));
736 ASSERT_EQ(1000U, VD_1[2].Count);
737 ASSERT_EQ(StringRef((const char *)VD_1[3].Value, 7), StringRef("callee5"));
738 ASSERT_EQ(800U, VD_1[3].Count);
742 llvm::sort(&VD_2[0], &VD_2[3], Cmp);
742 llvm::sort(&VD_2[0], &VD_2[3], Cmp);
743 ASSERT_EQ(StringRef((const char *)VD_2[0].Value, 7), StringRef("callee4"));
744 ASSERT_EQ(5500U, VD_2[0].Count);
745 ASSERT_EQ(StringRef((const char *)VD_2[1].Value, 7), StringRef("callee3"));
746 ASSERT_EQ(1000U, VD_2[1].Count);
747 ASSERT_EQ(StringRef((const char *)VD_2[2].Value, 7), StringRef("callee6"));
748 ASSERT_EQ(800U, VD_2[2].Count);
752 llvm::sort(&VD_3[0], &VD_3[2], Cmp);
752 llvm::sort(&VD_3[0], &VD_3[2], Cmp);
753 ASSERT_EQ(StringRef((const char *)VD_3[0].Value, 7), StringRef("callee3"));
754 ASSERT_EQ(2000U, VD_3[0].Count);
755 ASSERT_EQ(StringRef((const char *)VD_3[1].Value, 7), StringRef("callee2"));
756 ASSERT_EQ(1800U, VD_3[1].Count);
785 llvm::sort(&VD_0[0], &VD_0[5], Cmp);
785 llvm::sort(&VD_0[0], &VD_0[5], Cmp);
786 ASSERT_EQ(VD_0[0].Value, 0x2000ULL);
787 ASSERT_EQ(1000U, VD_0[0].Count);
788 ASSERT_EQ(VD_0[1].Value, 0x3000ULL);
789 ASSERT_EQ(500U, VD_0[1].Count);
790 ASSERT_EQ(VD_0[2].Value, 0x1000ULL);
791 ASSERT_EQ(400U, VD_0[2].Count);
794 ASSERT_EQ(VD_0[4].Value, 0ULL);
usr/include/c++/7.4.0/bits/regex_executor.h 200 if (_M_visited_states[__i])
202 _M_visited_states[__i] = true;