/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaExpr.cpp | 10387 // Second note suggests (!x) < y 10586 SCS.Second = castKindToImplicitConversionKind(ICE->getCastKind());
|
H A D | TreeTransform.h | 2581 Expr *Second); 10455 ExprResult Second; 10457 Second = getDerived().TransformExpr(E->getArg(1)); 10458 if (Second.isInvalid()) 10465 (E->getNumArgs() != 2 || Second.get() == E->getArg(1))) 10475 Second.get()); 13496 Expr *Second) { 13498 bool isPostIncDec = Second && (Op == OO_PlusPlus || Op == OO_MinusMinus); 13504 First, Second); 13511 if (Second 13492 RebuildCXXOperatorCallExpr(OverloadedOperatorKind Op, SourceLocation OpLoc, Expr *OrigCallee, Expr *First, Expr *Second) argument [all...] |
H A D | SemaOverload.cpp | 190 Second = ICK_Identity; 211 if (GetConversionRank(Second) > Rank) 212 Rank = GetConversionRank(Second); 255 if (Second == ICK_Pointer_Conversion && FromType->isAnyPointerType()) 323 switch (Second) { 489 if (Second != ICK_Identity) { 493 OS << GetImplicitConversionName(Second); 522 if (Before.First || Before.Second || Before.Third) { 530 if (After.First || After.Second || After.Third) { 1369 ICS.Standard.Second [all...] |
H A D | SemaExprCXX.cpp | 3907 if (SCS.Second == ICK_Derived_To_Base) { 3988 switch (SCS.Second) { 4020 SCS.Second == ICK_Integral_Promotion &&
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | DAGCombiner.cpp | 14743 /// Check whether or not \p First and \p Second are next to each other 14745 /// by \p First and the bits loaded by \p Second. 14747 const LoadedSlice &Second) { 14748 assert(First.Origin == Second.Origin && First.Origin && 14751 assert((UsedBits & Second.getUsedBits()) == 0 && 14753 UsedBits |= Second.getUsedBits(); 14775 // First (resp. Second) is the first (resp. Second) potentially candidate 14778 const LoadedSlice *Second = nullptr; local 14781 First = Second) { 14746 areSlicesNextToEachOther(const LoadedSlice &First, const LoadedSlice &Second) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Driver/ToolChains/ |
H A D | Gnu.cpp | 1761 std::pair<StringRef, StringRef> Second = First.second.split('.'); local 1769 StringRef MinorStr = Second.first; 1770 if (Second.second.empty()) { 1791 StringRef PatchText = Second.second;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | Local.cpp | 751 static bool CanMergeValues(Value *First, Value *Second) { argument 752 return First == Second || isa<UndefValue>(First) || isa<UndefValue>(Second);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | SeparateConstOffsetFromGEP.cpp | 442 void swapGEPOperand(GetElementPtrInst *First, GetElementPtrInst *Second); 445 bool isLegalToSwapOperand(GetElementPtrInst *First, GetElementPtrInst *Second, 1293 GetElementPtrInst *Second) { 1295 Value *Offset2 = Second->getOperand(1); 1297 Second->setOperand(1, Offset1); 1310 Second->setIsInBounds(false); 1292 swapGEPOperand(GetElementPtrInst *First, GetElementPtrInst *Second) argument
|
H A D | NewGVN.cpp | 3120 // First to Second. 3123 const MemoryAccess *Second) const { 3124 if (First == Second) 3140 if (ChainDef == Second) 3157 Second);
|
H A D | MergeICmps.cpp | 423 const BCECmpBlock &Second) { 424 return First.Lhs().BaseId == Second.Lhs().BaseId && 425 First.Rhs().BaseId == Second.Rhs().BaseId && 426 First.Lhs().Offset + First.SizeBits() / 8 == Second.Lhs().Offset && 427 First.Rhs().Offset + First.SizeBits() / 8 == Second.Rhs().Offset; 422 IsContiguous(const BCECmpBlock &First, const BCECmpBlock &Second) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonLoopIdiomRecognition.cpp | 1170 ValueSeq &Second = IsE ? Early : Late; local 1171 Second.insert(Cycle[I]); 1176 Second.insert(V); 1429 // Second, the types of the shifted value and the shift amount
|
H A D | HexagonInstrInfo.h | 146 /// Second variant of isProfitableToIfCvt. This one 413 const MachineInstr &Second) const;
|
H A D | HexagonInstrInfo.cpp | 2953 const MachineInstr &Second) const { 2954 if (Second.mayStore() && First.getOpcode() == Hexagon::S2_allocframe) { 2955 const MachineOperand &Op = Second.getOperand(0); 2961 if (mayBeNewStore(Second)) { 2965 Second.getOperand(Second.getNumOperands() - 1);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/AsmParser/ |
H A D | HexagonAsmParser.cpp | 923 AsmToken const &Second = Lexer.getTok(); local 930 if (String.lower() == "vwhist256" && Second.is(AsmToken::Colon) && 937 assert(Second.is(AsmToken::Colon));
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | JSON.cpp | 480 uint16_t Second; local 481 if (!Parse4Hex(Second)) 484 if (LLVM_UNLIKELY(Second < 0xDC00 || Second >= 0xE000)) { 486 First = Second; // Second escape still needs to be processed. 490 encodeUtf8(0x10000 | ((First - 0xD800) << 10) | (Second - 0xDC00), Out);
|
H A D | ItaniumManglingCanonicalizer.cpp | 226 StringRef Second) { 281 std::tie(SecondNode, SecondIsNew) = Parse(Second); 225 addEquivalence(FragmentKind Kind, StringRef First, StringRef Second) argument
|
H A D | BinaryStreamReader.cpp | 174 BinaryStreamRef Second = First.drop_front(Off); local 177 BinaryStreamReader W2{Second};
|
H A D | APFloat.cpp | 3952 APFloat &&Second) 3954 Floats(new APFloat[2]{std::move(First), std::move(Second)}) { 4482 APFloat Second = Arg.Floats[1]; 4484 Second = scalbn(Second, -Exp, RM); 4485 return DoubleAPFloat(semPPCDoubleDouble, std::move(First), std::move(Second));
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | StackColoring.cpp | 1272 LiveInterval *Second = &*Intervals[SecondSlot]; local 1275 assert(!First->empty() && !Second->empty() && "Found an empty range"); 1280 !Second->isLiveAtIndexes(FirstS)) { 1282 First->MergeSegmentsInAsValue(*Second, First->getValNumInfo(0));
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LoopAccessAnalysis.cpp | 458 const auto &First = Check.first->Members, &Second = Check.second->Members; local 467 for (unsigned K = 0; K < Second.size(); ++K) 468 OS.indent(Depth + 2) << *Pointers[Second[K]].PointerValue << "\n"; 1396 // Second try: Is -Dist - (BackedgeTakenCount * Step) > 0 ? 2197 Second = expandBounds(Check.second, L, Loc, Exp, SE, PtrRtChecking); 2198 return std::make_pair(First, Second);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | GVNExpression.h | 163 void swapOperands(unsigned First, unsigned Second) { argument 164 std::swap(Operands[First], Operands[Second]);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | STLExtras.h | 1381 template<typename First, typename Second> 1383 size_t operator()(const std::pair<First, Second> &P) const { 1384 return std::hash<First>()(P.first) * 31 + std::hash<Second>()(P.second);
|
H A D | APFloat.h | 607 DoubleAPFloat(const fltSemantics &S, APFloat &&First, APFloat &&Second);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/Core/ |
H A D | Replacement.cpp | 347 // overlapping replacements from 'First' and 'Second' in mergeReplacements. 352 // whereas replacements from 'Second' refer to the text after applying 'First'. 355 // text, i.e. transforms elements from 'Second' to take into account what was 362 // * We always merge elements from 'First' into elements from 'Second' and vice 377 // from 'First' into 'Second' or vice versa, the MergedReplacement knows what 424 // Amount of characters that elements from 'Second' need to be shifted by in 448 auto &Second = ReplacesToMerge.Replaces; local 449 // Delta is the amount of characters that replacements from 'Second' need to 455 // Offset) from either 'First' or 'Second'. Merge that element with 458 for (auto FirstI = First.begin(), SecondI = Second [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/ |
H A D | ArgumentsAdjusters.cpp | 138 ArgumentsAdjuster Second) { 140 return Second; 141 if (!Second) 143 return [First, Second](const CommandLineArguments &Args, StringRef File) { 144 return Second(First(Args, File), File);
|