| /openbsd-src/gnu/llvm/llvm/lib/TextAPI/ |
| H A D | PackedVersion.cpp | 34 unsigned long long Num; in parse32() local 35 if (getAsUnsignedInteger(Parts[0], 10, Num)) in parse32() 38 if (Num > UINT16_MAX) in parse32() 41 Version = Num << 16; in parse32() 44 if (getAsUnsignedInteger(Parts[i], 10, Num)) in parse32() 47 if (Num > UINT8_MAX) in parse32() 50 Version |= (Num << ShiftNum); in parse32() 69 unsigned long long Num; in parse64() local 70 if (getAsUnsignedInteger(Parts[0], 10, Num)) in parse64() 73 if (Num > 0xFFFFFFULL) in parse64() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| H A D | GCNMinRegStrategy.cpp | 66 unsigned findMax(unsigned Num, Calc C); 108 unsigned GCNMinRegScheduler::findMax(unsigned Num, Calc C) { in findMax() argument 109 assert(!RQ.empty() && Num <= RQ.size()); in findMax() 115 for (auto I = RQ.begin(); Num; --Num) { in findMax() 135 unsigned Num = RQ.size(); in pickCandidate() local 136 if (Num == 1) break; in pickCandidate() 138 LLVM_DEBUG(dbgs() << "\nSelecting max priority candidates among " << Num in pickCandidate() 140 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate() 141 if (Num == 1) break; in pickCandidate() 144 << Num << '\n'); in pickCandidate() [all …]
|
| H A D | AMDGPUCodeGenPrepare.cpp | 170 Value *Num, Value *Den) const; 172 Value *Num, Value *Den, 177 Value *Num, Value *Den, 181 Value *Num, Value *Den, unsigned NumBits, 186 Value *Num, Value *Den) const; 189 Value *Num, Value *Den) const; 662 static Value *optimizeWithRcp(Value *Num, Value *Den, bool AllowInaccurateRcp, in optimizeWithRcp() argument 670 if (const ConstantFP *CLHS = dyn_cast<ConstantFP>(Num)) { in optimizeWithRcp() 709 return Builder.CreateFMul(Num, Recip); in optimizeWithRcp() 721 static Value *optimizeWithFDivFast(Value *Num, Value *Den, float ReqdAccuracy, in optimizeWithFDivFast() argument [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/SystemZ/ |
| H A D | SystemZSchedule.td | 37 foreach Num = ["", "2", "3", "4", "5", "6"] in { 39 def "FXa"#Num : SchedWrite; 40 def "FXb"#Num : SchedWrite; 41 def "FXU"#Num : SchedWrite; 43 def "LSU"#Num : SchedWrite; 45 def "VecBF"#Num : SchedWrite; 46 def "VecDF"#Num : SchedWrite; 47 def "VecDFX"#Num : SchedWrite; 48 def "VecMul"#Num : SchedWrite; 49 def "VecStr"#Num : SchedWrite; [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/DebugInfo/CodeView/ |
| H A D | RecordSerialization.cpp | 36 Error llvm::codeview::consume(BinaryStreamReader &Reader, APSInt &Num) { in consume() argument 44 Num = APSInt(APInt(/*numBits=*/16, Short, /*isSigned=*/false), in consume() 54 Num = APSInt(APInt(8, N, true), false); in consume() 61 Num = APSInt(APInt(16, N, true), false); in consume() 68 Num = APSInt(APInt(16, N, false), true); in consume() 75 Num = APSInt(APInt(32, N, true), false); in consume() 82 Num = APSInt(APInt(32, N, FalseVal), true); in consume() 89 Num = APSInt(APInt(64, N, true), false); in consume() 96 Num = APSInt(APInt(64, N, false), true); in consume() 104 Error llvm::codeview::consume(StringRef &Data, APSInt &Num) { in consume() argument [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Support/ |
| H A D | BranchProbability.cpp | 69 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) { in scale() argument 76 if (!Num || D == N) in scale() 77 return Num; in scale() 80 uint64_t ProductHigh = (Num >> 32) * N; in scale() 81 uint64_t ProductLow = (Num & UINT32_MAX) * N; in scale() 107 uint64_t BranchProbability::scale(uint64_t Num) const { in scale() 108 return ::scale<D>(Num, N, D); in scale() 111 uint64_t BranchProbability::scaleByInverse(uint64_t Num) const { in scaleByInverse() 112 return ::scale<0>(Num, D, N); in scaleByInverse()
|
| H A D | Threading.cpp | 94 llvm::get_threadpool_strategy(StringRef Num, ThreadPoolStrategy Default) { in get_threadpool_strategy() argument 95 if (Num == "all") in get_threadpool_strategy() 97 if (Num.empty()) in get_threadpool_strategy() 100 if (Num.getAsInteger(10, V)) in get_threadpool_strategy()
|
| /openbsd-src/gnu/llvm/clang/lib/Sema/ |
| H A D | ParsedAttr.cpp | 277 unsigned Num, unsigned Diag, in checkAttributeNumArgsImpl() argument 279 if (Comp(getNumAttributeArgs(AL), Num)) { in checkAttributeNumArgsImpl() 280 S.Diag(AL.getLoc(), Diag) << AL << Num; in checkAttributeNumArgsImpl() 286 bool ParsedAttr::checkExactlyNumArgs(Sema &S, unsigned Num) const { in checkExactlyNumArgs() 287 return checkAttributeNumArgsImpl(S, *this, Num, in checkExactlyNumArgs() 291 bool ParsedAttr::checkAtLeastNumArgs(Sema &S, unsigned Num) const { in checkAtLeastNumArgs() 292 return checkAttributeNumArgsImpl(S, *this, Num, in checkAtLeastNumArgs() 296 bool ParsedAttr::checkAtMostNumArgs(Sema &S, unsigned Num) const { in checkAtMostNumArgs() 297 return checkAttributeNumArgsImpl(S, *this, Num, in checkAtMostNumArgs()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/ObjCARC/ |
| H A D | BlotMapVector.h | 59 size_t Num = Vector.size(); 60 Pair.first->second = Num; 62 return Vector[Num].second; 71 size_t Num = Vector.size(); in insert() local 72 Pair.first->second = Num; in insert() 74 return std::make_pair(Vector.begin() + Num, true); in insert()
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-profgen/ |
| H A D | ErrorHandling.h | 49 inline void emitWarningSummary(uint64_t Num, uint64_t Total, StringRef Msg) { in emitWarningSummary() argument 50 if (!Total || !Num) in emitWarningSummary() 52 WithColor::warning() << format("%.2f", static_cast<double>(Num) * 100 / Total) in emitWarningSummary() 53 << "%(" << Num << "/" << Total << ") " << Msg << "\n"; in emitWarningSummary()
|
| /openbsd-src/gnu/usr.bin/perl/cpan/Math-BigInt/t/ |
| H A D | new_overloaded.t | 13 package Overloaded::Num; 28 my $overloaded_num = Overloaded::Num->new(2.23); 29 is($overloaded_num, 2.23, 'Overloaded::Num->new(2.23)'); 34 my $bigint = Math::BigInt->new(Overloaded::Num->new(3));
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/SystemZ/AsmParser/ |
| H A D | SystemZAsmParser.cpp | 111 unsigned Num; member 173 createReg(RegisterKind Kind, unsigned Num, SMLoc StartLoc, SMLoc EndLoc) { in createReg() argument 176 Op->Reg.Num = Num; in createReg() 231 return Reg.Num; in getReg() 408 unsigned Num; member 788 if (Name.substr(1).getAsInteger(10, Reg.Num)) { in parseRegister() 795 if (Prefix == 'r' && Reg.Num < 16) in parseRegister() 797 else if (Prefix == 'f' && Reg.Num < 16) in parseRegister() 799 else if (Prefix == 'v' && Reg.Num < 32) in parseRegister() 801 else if (Prefix == 'a' && Reg.Num < 16) in parseRegister() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/NVPTX/ |
| H A D | NVPTXAsmPrinter.h | 115 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) { in addBytes() argument 116 assert((curpos + Num) <= size); in addBytes() 118 for (int i = 0; i < Num; ++i) { in addBytes() 122 for (int i = Num; i < Bytes; ++i) { in addBytes() 129 unsigned addZeros(int Num) { in addZeros() argument 130 assert((curpos + Num) <= size); in addZeros() 131 for (int i = 0; i < Num; ++i) { in addZeros()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | SplitKit.h | 69 unsigned Num = MBB.getNumber(); in getLastInsertPoint() local 71 if (LastInsertPoint[Num].first.isValid() && in getLastInsertPoint() 72 !LastInsertPoint[Num].second.isValid()) in getLastInsertPoint() 73 return LastInsertPoint[Num].first; in getLastInsertPoint() 229 SlotIndex getLastSplitPoint(unsigned Num) { in getLastSplitPoint() argument 230 return IPA.getLastInsertPoint(*CurLI, *MF.getBlockNumbered(Num)); in getLastSplitPoint() 241 SlotIndex getFirstSplitPoint(unsigned Num) { in getFirstSplitPoint() argument 242 return IPA.getFirstInsertPoint(*MF.getBlockNumbered(Num)); in getFirstSplitPoint()
|
| H A D | BranchRelaxation.cpp | 130 const unsigned Num = MBB.getNumber(); in INITIALIZE_PASS() local 131 assert(!Num || BlockInfo[PrevNum].postOffset(MBB) <= BlockInfo[Num].Offset); in INITIALIZE_PASS() 132 assert(BlockInfo[Num].Size == computeBlockSize(MBB)); in INITIALIZE_PASS() 133 PrevNum = Num; in INITIALIZE_PASS() 198 unsigned Num = MBB.getNumber(); in adjustBlockOffsets() local 201 BlockInfo[Num].Offset = BlockInfo[PrevNum].postOffset(MBB); in adjustBlockOffsets() 203 PrevNum = Num; in adjustBlockOffsets()
|
| H A D | MacroFusion.cpp | 47 unsigned Num = 1; in hasLessThanNumFused() local 49 while ((CurrentSU = getPredClusterSU(*CurrentSU)) && Num < FuseLimit) Num ++; in hasLessThanNumFused() 50 return Num < FuseLimit; in hasLessThanNumFused()
|
| /openbsd-src/gnu/llvm/llvm/utils/TableGen/ |
| H A D | InstrInfoEmitter.cpp | 87 void emitRecord(const CodeGenInstruction &Inst, unsigned Num, 118 unsigned Num, raw_ostream &OS) { in PrintDefList() argument 119 OS << "static const MCPhysReg ImplicitList" << Num << "[] = { "; in PrintDefList() 934 unsigned Num = NumberedInstructions.size(); in run() local 939 emitRecord(*Inst, --Num, InstrInfo, EmittedLists, OperandInfoIDs, OS); in run() 950 Num = 0; in run() 953 if (Num % 8 == 0) in run() 956 ++Num; in run() 968 Num = 0; in run() 970 if (Num % 8 == 0) in run() [all …]
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/scudo/standalone/ |
| H A D | string_utils.cpp | 71 static int appendUnsigned(char **Buffer, const char *BufferEnd, u64 Num, in appendUnsigned() argument 74 return appendNumber(Buffer, BufferEnd, Num, Base, MinNumberLength, in appendUnsigned() 78 static int appendSignedDecimal(char **Buffer, const char *BufferEnd, s64 Num, in appendSignedDecimal() argument 80 const bool Negative = (Num < 0); in appendSignedDecimal() 81 const u64 UnsignedNum = (Num == INT64_MIN) in appendSignedDecimal() 83 : static_cast<u64>(Negative ? -Num : Num); in appendSignedDecimal()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Support/ |
| H A D | AllocatorBase.h | 69 template <typename T> T *Allocate(size_t Num = 1) { 70 return static_cast<T *>(Allocate(Num * sizeof(T), alignof(T))); 76 Deallocate(T *Ptr, size_t Num = 1) { 77 Deallocate(static_cast<const void *>(Ptr), Num * sizeof(T), alignof(T));
|
| H A D | GenericDomTreeConstruction.h | 365 unsigned Num = 1; in FindRoots() local 383 Num = SNCA.runDFS(N, Num, AlwaysDescend, 1); in FindRoots() 387 << BlockNamePrinter(SNCA.NumToNode[Num]) << "\n"); in FindRoots() 399 if (Total + 1 != Num) { in FindRoots() 455 SNCA.runDFS<true>(I, Num, AlwaysDescend, Num, &*SuccOrder); in FindRoots() 461 LLVM_DEBUG(dbgs() << "\t\t\tPrev DFSNum: " << Num << ", new DFSNum: " in FindRoots() 463 for (unsigned i = NewNum; i > Num; --i) { in FindRoots() 470 const unsigned PrevNum = Num; in FindRoots() 472 Num = SNCA.runDFS(FurthestAway, Num, AlwaysDescend, 1); in FindRoots() 473 for (unsigned i = PrevNum + 1; i <= Num; ++i) in FindRoots() [all …]
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | GCMetadata.h | 67 int Num; ///< Usually a frame index. member 72 GCRoot(int N, const Constant *MD) : Num(N), Metadata(MD) {} in GCRoot() 113 void addStackRoot(int Num, const Constant *Metadata) { in addStackRoot() argument 114 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | StringExtras.h | 266 template <typename N> bool to_integer(StringRef S, N &Num, unsigned Base = 0) { 267 return !S.getAsInteger(Base, Num); 272 inline bool to_float(const Twine &T, N &Num, N (*StrTo)(const char *, char **)) { in to_float() argument 279 Num = Temp; in to_float() 284 inline bool to_float(const Twine &T, float &Num) { in to_float() argument 285 return detail::to_float(T, Num, strtof); in to_float() 288 inline bool to_float(const Twine &T, double &Num) { in to_float() argument 289 return detail::to_float(T, Num, strtod); in to_float() 292 inline bool to_float(const Twine &T, long double &Num) { in to_float() argument 293 return detail::to_float(T, Num, strtold); in to_float()
|
| H A D | DenseMap.h | 488 void setNumEntries(unsigned Num) { in setNumEntries() argument 489 static_cast<DerivedT *>(this)->setNumEntries(Num); in setNumEntries() 504 void setNumTombstones(unsigned Num) { in setNumTombstones() argument 505 static_cast<DerivedT *>(this)->setNumTombstones(Num); in setNumTombstones() 844 void setNumEntries(unsigned Num) { in setNumEntries() argument 845 NumEntries = Num; in setNumEntries() 852 void setNumTombstones(unsigned Num) { in setNumTombstones() argument 853 NumTombstones = Num; in setNumTombstones() 864 bool allocateBuckets(unsigned Num) { in allocateBuckets() argument 865 NumBuckets = Num; in allocateBuckets() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/PowerPC/ |
| H A D | PPCMachineFunctionInfo.h | 231 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } in setVarArgsNumGPR() argument 245 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } in setVarArgsNumFPR() argument
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | GVN.cpp | 701 uint32_t Num = valueNumbering.lookup(V); in erase() local 705 NumberingPhi.erase(Num); in erase() 2078 bool GVNPass::ValueTable::areAllValsInBB(uint32_t Num, const BasicBlock *BB, in areAllValsInBB() argument 2080 LeaderTableEntry *Vals = &Gvn.LeaderTable[Num]; in areAllValsInBB() 2089 uint32_t Num, GVNPass &Gvn) { in phiTranslate() argument 2090 auto FindRes = PhiTranslateTable.find({Num, Pred}); in phiTranslate() 2093 uint32_t NewNum = phiTranslateImpl(Pred, PhiBlock, Num, Gvn); in phiTranslate() 2094 PhiTranslateTable.insert({{Num, Pred}, NewNum}); in phiTranslate() 2100 bool GVNPass::ValueTable::areCallValsEqual(uint32_t Num, uint32_t NewNum, in areCallValsEqual() argument 2105 LeaderTableEntry *Vals = &Gvn.LeaderTable[Num]; in areCallValsEqual() [all …]
|