/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | InstructionSimplify.cpp | 154 const SimplifyQuery &Q, unsigned MaxRecurse, in simplifyCmpSelCase() 171 const SimplifyQuery &Q, in simplifyCmpSelTrueCase() 180 const SimplifyQuery &Q, in simplifyCmpSelFalseCase() 190 const SimplifyQuery &Q, in handleOtherCmpSelSimplifications() 240 const SimplifyQuery &Q, unsigned MaxRecurse) { in expandBinOp() 275 const SimplifyQuery &Q, in expandCommutativeBinOp() 292 const SimplifyQuery &Q, in simplifyAssociativeBinOp() 307 Value *C = RHS; in simplifyAssociativeBinOp() local 327 Value *C = Op1->getOperand(1); in simplifyAssociativeBinOp() local 351 Value *C = RHS; in simplifyAssociativeBinOp() local [all …]
|
H A D | ValueTracking.cpp | 155 const SimplifyQuery &Q) { in computeKnownBits() 335 const SimplifyQuery &Q) { in ComputeNumSignBits() 362 unsigned Depth, const SimplifyQuery &Q) { in computeKnownBitsAddSub() 377 const SimplifyQuery &Q) { in computeKnownBitsMul() 557 const APInt *C; in cmpExcludesZero() local 578 static bool isKnownNonZeroFromAssume(const Value *V, const SimplifyQuery &Q) { in isKnownNonZeroFromAssume() 627 const SimplifyQuery &Q) { in computeKnownBitsFromCmp() 655 const APInt *Mask, *C; in computeKnownBitsFromCmp() local 779 unsigned Depth, const SimplifyQuery &Q) { in computeKnownBitsFromContext() 884 KnownBits &Known2, unsigned Depth, const SimplifyQuery &Q, in computeKnownBitsFromShiftOperator() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonLoopIdiomRecognition.cpp | 209 std::deque<Value *> Q; member 260 const Simplifier::Context &C; member 288 WorkListType Q; in INITIALIZE_PASS_DEPENDENCY() local 334 WorkListType Q; in initialize() local 402 WorkListType Q; in subst() local 435 WorkListType Q; in replace() local 496 WorkListType Q; in find() local 535 Value *Simplifier::simplify(Context &C) { in simplify() 536 WorkListType Q; in simplify() local 613 Value *Q = nullptr; member [all …]
|
H A D | HexagonISelDAGToDAG.cpp | 282 SDNode *C = Ch.getNode(); in tryLoadOfLoadIntrinsic() local 595 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Mul_1)) { in SelectSHL() local 793 SDNode *C = CurDAG->getMachineNode(OpcCarry, SDLoc(N), N->getVTList(), in SelectAddSubCarry() local 818 SDNode *C; in SelectVAlign() local 892 SDValue C = CurDAG->getTargetConstant(-1, dl, MVT::i32); in SelectV2Q() local 905 SDValue C = CurDAG->getTargetConstant(-1, dl, MVT::i32); in SelectQ2V() local 922 SDValue C = CurDAG->getTargetConstant(0x3f800000, dl, MVT::i32); in FDiv() local 973 SDValue C = CurDAG->getTargetConstant(0x3f800000, dl, MVT::i32); in FastFDiv() local 1188 SDValue C = T1.getOperand(1); in ppAddrReorderAddShl() local 1692 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Val.getOperand(0))) { in keepsLowBits() local [all …]
|
H A D | HexagonISelDAGToDAGHVX.cpp | 185 Node C = conj(I); in build() local 198 SetVector<Node> Q; in color() local 248 Node C = conj(N); color() local 299 __anon9fc097470302(ColorKind C) dump() argument 312 for (auto C : Colors) dump() local 356 unsigned C = ctl(I, StartAt+L) == Switch; getControls() local 493 ColorKind C = M.at(I); route() local 565 ColorKind C = M.at(I); route() local 1612 OpRef C = contracting(SM, Va, Vb, Results); shuffs2() local 2006 __anon9fc097471502(unsigned &Q) getPerfectCompletions() argument 2041 uint32_t C = Comps[I]; completeToPerfect() local 2385 __anon9fc097471802(const CycleType &C) perfect() argument 2403 const CycleType &C = *Cs.begin(); perfect() local 2427 CycleType C; perfect() local 2468 for (const CycleType &C : Cycles) { perfect() local 2566 for (uint8_t C : Data) getVectorConstant() local [all...] |
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineCompares.cpp | 81 static bool isSignTest(ICmpInst::Predicate &Pred, const APInt &C) { in isSignTest() 215 Constant *C = ConstantFoldCompareInstOperands(ICI.getPredicate(), Elt, in foldCmpLoadFromIndexedGlobal() local 912 Instruction *InstCombinerImpl::foldICmpAddOpConst(Value *X, const APInt &C, in foldICmpAddOpConst() 1180 Constant *C; in foldSignBitTest() local 1253 const SimplifyQuery Q = SQ.getWithInstruction(&Cmp); in foldICmpWithZero() local 1306 Constant *C = dyn_cast<Constant>(Op1); in foldICmpWithConstant() local 1338 const APInt *C; in foldICmpWithDominatingICmp() local 1412 const APInt &C) { in foldICmpTruncConstant() 1498 const SimplifyQuery &Q) { in foldICmpTruncWithTruncOrExt() 1558 const APInt &C) { in foldICmpXorConstant() [all …]
|
H A D | InstCombineShifts.cpp | 190 const SimplifyQuery &Q, in dropRedundantMaskingOfLeftShiftInput() 441 Constant *C, *C1; in commonShiftTransforms() local 691 if (Constant *C = dyn_cast<Constant>(V)) { in getShiftedValue() local 862 const APInt *C; in FoldShiftByConstant() local 879 const APInt *C; in FoldShiftByConstant() local 966 static bool setShiftFlags(BinaryOperator &I, const SimplifyQuery &Q) { in setShiftFlags() 1020 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitShl() local 1039 const APInt *C; in visitShl() local 1270 const APInt *C; in visitLShr() local 1575 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitLShr() local [all …]
|
H A D | InstCombineSimplifyDemanded.cpp | 43 const APInt *C; in ShrinkDemandedConstant() local 92 const SimplifyQuery &Q) { in SimplifyDemandedBits() 161 const SimplifyQuery &Q) { in SimplifyDemandedUseBits() 334 const APInt *C; in SimplifyDemandedUseBits() local 423 const APInt *C; in SimplifyDemandedUseBits() local 553 const APInt *C; in SimplifyDemandedUseBits() local 612 const APInt *C; in SimplifyDemandedUseBits() local 673 Constant *C; in SimplifyDemandedUseBits() local 754 Constant *C; in SimplifyDemandedUseBits() local 1074 const APInt *C; in SimplifyDemandedUseBits() local [all …]
|
H A D | InstCombineAndOrXor.cpp | 118 static unsigned getMaskedICmpType(Value *A, Value *B, Value *C, in getMaskedICmpType() 199 Value *&A, Value *&B, Value *&C, Value *&D, Value *&E, ICmpInst *LHS, in getMaskedTypeForICmpPair() 329 ICmpInst *LHS, ICmpInst *RHS, bool IsAnd, Value *A, Value *B, Value *C, in foldLogOpOfMaskedICmps_NotAllZeros_BMask_Mixed() 451 ICmpInst *LHS, ICmpInst *RHS, bool IsAnd, Value *A, Value *B, Value *C, in foldLogOpOfMaskedICmpsAsymmetric() 486 Value *A = nullptr, *B = nullptr, *C = nullptr, *D = nullptr, *E = nullptr; in foldLogOpOfMaskedICmps() local 711 const SimplifyQuery &Q) { in foldAndOrOfICmpsWithPow2AndWithZero() 1043 Value *A = nullptr, *B = nullptr, *C = nullptr, *D = nullptr, *E = nullptr; in foldPowerOf2AndShiftedMask() local 1073 const SimplifyQuery &Q, in foldUnsignedUnderflowCheck() 1159 const APInt *C; in foldEqOfParts() local 1224 const SimplifyQuery &Q) { in foldAndOrOfICmpsWithConstEq() [all …]
|
H A D | InstructionCombining.cpp | 283 static bool maintainNoSignedWrap(BinaryOperator &I, Value *B, Value *C) { in maintainNoSignedWrap() 448 Value *C = I.getOperand(1); in SimplifyAssociativeOrCommutative() local 481 Value *C = Op1->getOperand(1); in SimplifyAssociativeOrCommutative() local 509 Value *C = I.getOperand(1); in SimplifyAssociativeOrCommutative() local 529 Value *C = Op1->getOperand(1); in SimplifyAssociativeOrCommutative() local 644 Constant *C; in getBinOpsForFactorization() local 669 Value *B, Value *C, Value *D) { in tryFactorization() 804 Constant *C; in tryFoldInstWithCtpopWithNot() local 1050 Constant *C; in foldBinOpOfSelectAndCastOfSelectCondition() local 1087 Value *A, *B, *C, *D; in tryFactorizationFolds() local [all …]
|
H A D | InstCombineAddSub.cpp | 65 void set(short C) { in set() 229 void FAddendCoef::set(const APFloat& C) { in set() 393 if (ConstantFP *C = dyn_cast<ConstantFP>(V0)) { in drillValueDownOneStep() local 398 if (ConstantFP *C = dyn_cast<ConstantFP>(V1)) { in drillValueDownOneStep() local 901 const APInt *C; in foldAddWithConstant() local 1001 const SimplifyQuery Q = SQ.getWithInstruction(&Add); in foldAddWithConstant() local 1076 static bool MatchMul(Value *E, Value *&Op, APInt &C) { in MatchMul() 1094 static bool MatchRem(Value *E, Value *&Op, APInt &C, bool &IsSigned) { in MatchRem() 1116 static bool MatchDiv(Value *E, Value *&Op, APInt &C, bool IsSigned) { in MatchDiv() 1245 const APInt *C, *NotC; in foldToUnsignedSaturatedAdd() local [all …]
|
H A D | InstCombineSelect.cpp | 60 Constant *C; in foldSelectBinOpIdentity() local 183 Constant *C = ConstantInt::get(SelType, TC); in foldSelectICmpAnd() local 190 Constant *C = ConstantInt::get(SelType, FC); in foldSelectICmpAnd() local 537 Constant *C = ConstantExpr::getBinOpIdentity( in foldSelectIntoOp() local 825 const APInt *NotC, *C; in foldSetClearBits() local 947 const APInt *C; in canonicalizeSaturatedSubtract() local 980 const APInt *C, *CmpC; in canonicalizeSaturatedAdd() local 1612 auto MatchesSelectValue = [SelVal0, SelVal1](Constant *C) { in tryToReuseConstantFromSelectInComparison() 1695 const APInt *C; in foldSelectInstWithICmpConst() local 1888 const APInt *Y, *C; in foldSelectInstWithICmp() local [all …]
|
/freebsd/contrib/arm-optimized-routines/math/ |
H A D | erf.c | 15 #define C 0x1.b0ac16p-1 macro 87 double Q = r1d + x4 * r2d + x8 * r3d; in erf() local 107 double Q = r1d + a2 * r2d + a4 * r3d + a6 * r4d; in erf() local
|
/freebsd/contrib/llvm-project/llvm/lib/Demangle/ |
H A D | MicrosoftDemangleNodes.cpp | 31 char C = OB.back(); in outputSpaceIfNecessary() local 36 static void outputSingleQualifier(OutputBuffer &OB, Qualifiers Q) { in outputSingleQualifier() 52 static bool outputQualifierIfPresent(OutputBuffer &OB, Qualifiers Q, in outputQualifierIfPresent() 64 static void outputQualifiers(OutputBuffer &OB, Qualifiers Q, bool SpaceBefore, in outputQualifiers()
|
/freebsd/contrib/llvm-project/clang/lib/Index/ |
H A D | IndexBody.cpp | 380 DataRecursionQueue *Q = nullptr) { in TraverseCXXOperatorCallExpr() 404 bool TraverseLambdaCapture(LambdaExpr *LE, const LambdaCapture *C, in TraverseLambdaCapture() 423 bool TraverseInitListExpr(InitListExpr *S, DataRecursionQueue *Q = nullptr) { in TraverseInitListExpr() 503 bool TraverseTypeConstraint(const TypeConstraint *C) { in TraverseTypeConstraint()
|
/freebsd/contrib/llvm-project/llvm/tools/llvm-nm/ |
H A D | llvm-nm.cpp | 173 static void error(llvm::Error E, StringRef FileName, const Archive::Child &C, in error() 1405 const char *Q = ExportsNameBuffer.c_str(); in dumpSymbolsFromDLInfoMachO() local 1458 const char *Q = BindsNameBuffer.c_str(); in dumpSymbolsFromDLInfoMachO() local 1517 const char *Q = LazysNameBuffer.c_str(); in dumpSymbolsFromDLInfoMachO() local 1585 const char *Q = WeaksNameBuffer.c_str(); in dumpSymbolsFromDLInfoMachO() local 1673 const char *Q = FunctionStartsNameBuffer.c_str(); in dumpSymbolsFromDLInfoMachO() local 2048 Expected<Archive::Child> C = I.getMember(); in printArchiveMap() local 2087 for (auto &C : A->children(Err)) { in dumpArchive() local 2147 for (auto &C : A->children(Err)) { in dumpMachOUniversalBinaryMatchArchFlags() local 2210 for (auto &C : A->children(Err)) { in dumpMachOUniversalBinaryMatchHost() local [all …]
|
/freebsd/contrib/llvm-project/clang/lib/AST/ |
H A D | ComputeDependence.cpp | 710 for (auto *C : llvm::ArrayRef(E->getSubExprs(), E->getNumSubExprs())) in computeDependence() local 785 if (auto *Q = E->getQualifier()) in computeDependence() local 803 if (auto *Q = E->getQualifier()) in computeDependence() local 822 if (auto *Q = E->getQualifier()) in computeDependence() local 874 if (auto *Q = E->getQualifier()) in computeDependence() local
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | LoadStoreOpt.cpp | 441 bool LoadStoreOpt::processMergeCandidate(StoreMergeCandidate &C) { in processMergeCandidate() 502 StoreMergeCandidate &C) { in operationAliasesWithCandidate() 515 StoreMergeCandidate &C) { in addStoreToCandidate() 833 auto &C = LastStore.getMF()->getFunction().getContext(); in mergeTruncStore() local 968 LegalityQuery Q(TargetOpcode::G_STORE, StoreTys, MemDescrs); in initializeStoreMergeTargetInfo() local
|
/freebsd/contrib/llvm-project/compiler-rt/lib/xray/ |
H A D | xray_profile_collector.cpp | 105 void post(BufferQueue *Q, FunctionCallTrie &&T, in post() 188 for (const auto C : Node->Callees) in populateRecords() local
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | GCNSchedStrategy.cpp | 63 GCNSchedStrategy::GCNSchedStrategy(const MachineSchedContext *C) in GCNSchedStrategy() 300 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue() local 473 const MachineSchedContext *C) in GCNMaxOccupancySchedStrategy() 481 GCNMaxILPSchedStrategy::GCNMaxILPSchedStrategy(const MachineSchedContext *C) in GCNMaxILPSchedStrategy() 571 MachineSchedContext *C, std::unique_ptr<MachineSchedStrategy> S) in GCNScheduleDAGMILive() 1658 MachineSchedContext *C, std::unique_ptr<MachineSchedStrategy> S, in GCNPostScheduleDAGMILive()
|
/freebsd/contrib/llvm-project/clang/lib/Serialization/ |
H A D | ASTWriter.cpp | 186 std::queue<const Module *> Q; in GetAffectingModuleMaps() local 211 std::queue<const Module *> Q; in GetAffectingModuleMaps() local 2998 std::queue<Module *> Q; in WriteSubmodules() local 3124 for (const auto &C : Mod->Conflicts) { in WriteSubmodules() local 7085 void ASTRecordWriter::writeOMPClause(OMPClause *C) { in writeOMPClause() 7089 void OMPClauseWriter::writeClause(OMPClause *C) { in writeClause() 7096 void OMPClauseWriter::VisitOMPClauseWithPreInit(OMPClauseWithPreInit *C) { in VisitOMPClauseWithPreInit() 7101 void OMPClauseWriter::VisitOMPClauseWithPostUpdate(OMPClauseWithPostUpdate *C) { in VisitOMPClauseWithPostUpdate() 7106 void OMPClauseWriter::VisitOMPIfClause(OMPIfClause *C) { in VisitOMPIfClause() 7115 void OMPClauseWriter::VisitOMPFinalClause(OMPFinalClause *C) { in VisitOMPFinalClause() [all …]
|
/freebsd/contrib/llvm-project/lldb/source/Plugins/Instruction/ARM64/ |
H A D | EmulateInstructionARM64.h | 134 uint32_t N : 1, V : 1, C : 1, member 137 Q : 1, // AArch32 only – CSPR.Q bit member
|
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyTraverse.h | 263 R_SExpr reduceBranch(Branch &O, R_SExpr C, BasicBlock *B0, BasicBlock *B1) { in reduceBranch() 275 R_SExpr reduceIfThenElse(IfThenElse &Orig, R_SExpr C, R_SExpr T, R_SExpr E) { in reduceIfThenElse() 339 bool comparePointers(const void* P, const void* Q) { return P == Q; } in comparePointers() 373 bool comparePointers(const void *P, const void *Q) { return P == Q; } in comparePointers()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineScheduler.cpp | 323 static ScheduleDAGInstrs *useDefaultMachineSched(MachineSchedContext *C) { in useDefaultMachineSched() 1025 for (unsigned C = FirstCycle; C <= LastCycle; ++C) in dumpScheduleTraceTopDown() local 1038 unsigned C = FirstCycle; in dumpScheduleTraceTopDown() local 1107 for (int C = FirstCycle; C >= LastCycle; --C) in dumpScheduleTraceBottomUp() local 1120 int C = FirstCycle; in dumpScheduleTraceBottomUp() local 3649 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue() local 3852 ScheduleDAGMILive *llvm::createGenericSchedLive(MachineSchedContext *C) { in createGenericSchedLive() 3870 static ScheduleDAGInstrs *createConvergingSched(MachineSchedContext *C) { in createConvergingSched() 3980 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue() local 4142 ScheduleDAGMI *llvm::createGenericSchedPostRA(MachineSchedContext *C) { in createGenericSchedPostRA() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Passes/ |
H A D | StandardInstrumentations.cpp | 173 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) { in unwrapModule() local 216 void printIR(raw_ostream &OS, const LazyCallGraph::SCC *C) { in printIR() 245 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in getIRName() local 266 bool sccContainsFilterPrintFunc(const LazyCallGraph::SCC &C) { in sccContainsFilterPrintFunc() 281 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in shouldPrintIR() local 315 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) { in unwrapAndPrint() local 345 SR.take_until([](char C) { return C == '<' || C == '>'; }); in makeHTMLReady() 360 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in getModuleForComparison() local 607 auto HandleNewData = [&](std::vector<const T *> &Q) { in report() 765 } else if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) { in getIRFileDisplayName() local [all …]
|