| /src/contrib/llvm-project/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 …]
|
| /src/contrib/llvm-project/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 | 243 Value *Num, Value *Den) const;
245 Value *Num, Value *Den,
250 Value *Num, Value *Den,
254 Value *Num, Value *Den, unsigned NumBits,
259 Value *Num, Value *Den) const;
262 Value *Num, Value *Den) const;
281 Value *optimizeWithRsq(IRBuilder<> &Builder, Value *Num, Value *Den,
285 Value *optimizeWithRcp(IRBuilder<> &Builder, Value *Num, Value *Den,
287 Value *optimizeWithFDivFast(IRBuilder<> &Builder, Value *Num, Value *Den,
290 Value *visitFDivElement(IRBuilder<> &Builder, Value *Num, Value *Den,
[all …]
|
| /src/contrib/llvm-project/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 …]
|
| /src/contrib/llvm-project/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 …]
|
| /src/contrib/llvm-project/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 | DebugCounter.cpp | 50 int64_t Num = ConsumeInt(); in parseChunks() local
51 if (Num == -1) in parseChunks()
53 if (!Chunks.empty() && Num <= Chunks[Chunks.size() - 1].End) { in parseChunks()
54 errs() << "Expected Chunks to be in increasing order " << Num in parseChunks()
63 if (Num >= Num2) { in parseChunks()
64 errs() << "Expected " << Num << " < " << Num2 << " in " << Num << "-" in parseChunks()
69 Chunks.push_back({Num, Num2}); in parseChunks()
71 Chunks.push_back({Num, Num}); in parseChunks()
|
| H A D | Threading.cpp | 110 llvm::get_threadpool_strategy(StringRef Num, ThreadPoolStrategy Default) { in get_threadpool_strategy() argument
111 if (Num == "all") in get_threadpool_strategy()
113 if (Num.empty()) in get_threadpool_strategy()
116 if (Num.getAsInteger(10, V)) in get_threadpool_strategy()
|
| /src/contrib/llvm-project/llvm/lib/Target/SystemZ/AsmParser/ |
| H A D | SystemZAsmParser.cpp | 112 unsigned Num; member
174 createReg(RegisterKind Kind, unsigned Num, SMLoc StartLoc, SMLoc EndLoc) { in createReg() argument
177 Op->Reg.Num = Num; in createReg()
232 return Reg.Num; in getReg()
408 unsigned Num; member
785 if (Name.substr(1).getAsInteger(10, Reg.Num)) { in parseRegister()
792 if (Prefix == 'r' && Reg.Num < 16) in parseRegister()
794 else if (Prefix == 'f' && Reg.Num < 16) in parseRegister()
796 else if (Prefix == 'v' && Reg.Num < 32) in parseRegister()
798 else if (Prefix == 'a' && Reg.Num < 16) in parseRegister()
[all …]
|
| /src/contrib/llvm-project/clang/lib/Sema/ |
| H A D | SemaM68k.cpp | 44 unsigned Num = MaybeNumParams->getLimitedValue(255); in handleInterruptAttr() local
45 if ((Num & 1) || Num > 30) { in handleInterruptAttr()
53 M68kInterruptAttr(getASTContext(), AL, Num)); in handleInterruptAttr()
|
| H A D | ParsedAttr.cpp | 289 unsigned Num, unsigned Diag, in checkAttributeNumArgsImpl() argument
291 if (Comp(getNumAttributeArgs(AL), Num)) { in checkAttributeNumArgsImpl()
292 S.Diag(AL.getLoc(), Diag) << AL << Num; in checkAttributeNumArgsImpl()
298 bool ParsedAttr::checkExactlyNumArgs(Sema &S, unsigned Num) const { in checkExactlyNumArgs()
299 return checkAttributeNumArgsImpl(S, *this, Num, in checkExactlyNumArgs()
303 bool ParsedAttr::checkAtLeastNumArgs(Sema &S, unsigned Num) const { in checkAtLeastNumArgs()
304 return checkAttributeNumArgsImpl(S, *this, Num, in checkAtLeastNumArgs()
308 bool ParsedAttr::checkAtMostNumArgs(Sema &S, unsigned Num) const { in checkAtMostNumArgs()
309 return checkAttributeNumArgsImpl(S, *this, Num, in checkAtMostNumArgs()
|
| H A D | SemaMSP430.cpp | 65 unsigned Num = NumParams->getLimitedValue(255); in handleInterruptAttr() local
66 if (Num > 63) { in handleInterruptAttr()
74 MSP430InterruptAttr(getASTContext(), AL, Num)); in handleInterruptAttr()
|
| /src/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
| H A D | string_utils.cpp | 61 void ScopedString::appendUnsigned(u64 Num, u8 Base, u8 MinNumberLength, in appendUnsigned() argument
63 appendNumber(Num, Base, MinNumberLength, PadWithZero, /*Negative=*/false, in appendUnsigned()
67 void ScopedString::appendSignedDecimal(s64 Num, u8 MinNumberLength, in appendSignedDecimal() argument
69 const bool Negative = (Num < 0); in appendSignedDecimal()
70 const u64 UnsignedNum = (Num == INT64_MIN) in appendSignedDecimal()
72 : static_cast<u64>(Negative ? -Num : Num); in appendSignedDecimal()
|
| /src/contrib/llvm-project/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()
|
| /src/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
| H A D | NVPTXAsmPrinter.h | 116 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) { in addBytes() argument
117 assert((curpos + Num) <= size); in addBytes()
119 for (int i = 0; i < Num; ++i) { in addBytes()
123 for (int i = Num; i < Bytes; ++i) { in addBytes()
130 unsigned addZeros(int Num) { in addZeros() argument
131 assert((curpos + Num) <= size); in addZeros()
132 for (int i = 0; i < Num; ++i) { in addZeros()
|
| /src/contrib/llvm-project/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()
235 SlotIndex getLastSplitPoint(unsigned Num) { in getLastSplitPoint() argument
236 return IPA.getLastInsertPoint(*CurLI, *MF.getBlockNumbered(Num)); in getLastSplitPoint()
247 SlotIndex getFirstSplitPoint(unsigned Num) { in getFirstSplitPoint() argument
248 return IPA.getFirstInsertPoint(*MF.getBlockNumbered(Num)); in getFirstSplitPoint()
|
| /src/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | AllocatorBase.h | 75 template <typename T> T *Allocate(size_t Num = 1) {
76 return static_cast<T *>(Allocate(Num * sizeof(T), alignof(T)));
82 Deallocate(T *Ptr, size_t Num = 1) {
83 Deallocate(static_cast<const void *>(Ptr), Num * sizeof(T), alignof(T));
|
| H A D | GenericDomTreeConstruction.h | 350 unsigned Num = 1; in FindRoots() local
368 Num = SNCA.runDFS(N, Num, AlwaysDescend, 1); in FindRoots()
372 << BlockNamePrinter(SNCA.NumToNode[Num]) << "\n"); in FindRoots()
384 if (Total + 1 != Num) { in FindRoots()
440 SNCA.runDFS<true>(I, Num, AlwaysDescend, Num, &*SuccOrder); in FindRoots()
446 LLVM_DEBUG(dbgs() << "\t\t\tPrev DFSNum: " << Num << ", new DFSNum: " in FindRoots()
448 for (unsigned i = NewNum; i > Num; --i) { in FindRoots()
455 const unsigned PrevNum = Num; in FindRoots()
457 Num = SNCA.runDFS(FurthestAway, Num, AlwaysDescend, 1); in FindRoots()
458 for (unsigned i = PrevNum + 1; i <= Num; ++i) in FindRoots()
[all …]
|
| /src/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | InstrInfoEmitter.cpp | 90 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
985 unsigned Num = NumberedInstructions.size(); in run() local
990 emitRecord(*Inst, --Num, InstrInfo, EmittedLists, OperandInfoMap, OS); in run()
1019 Num = 0; in run()
1022 if (Num % 8 == 0) in run()
1025 ++Num; in run()
1037 Num = 0; in run()
1039 if (Num % 8 == 0) in run()
1047 ++Num; in run()
1059 Num = 0; in run()
[all …]
|
| /src/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | StringExtras.h | 279 template <typename N> bool to_integer(StringRef S, N &Num, unsigned Base = 0) {
280 return !S.getAsInteger(Base, Num);
285 inline bool to_float(const Twine &T, N &Num, N (*StrTo)(const char *, char **)) { in to_float() argument
292 Num = Temp; in to_float()
297 inline bool to_float(const Twine &T, float &Num) { in to_float() argument
298 return detail::to_float(T, Num, strtof); in to_float()
301 inline bool to_float(const Twine &T, double &Num) { in to_float() argument
302 return detail::to_float(T, Num, strtod); in to_float()
305 inline bool to_float(const Twine &T, long double &Num) { in to_float() argument
306 return detail::to_float(T, Num, strtold); in to_float()
|
| H A D | DenseMap.h | 531 void setNumEntries(unsigned Num) { in setNumEntries() argument
532 static_cast<DerivedT *>(this)->setNumEntries(Num); in setNumEntries()
547 void setNumTombstones(unsigned Num) { in setNumTombstones() argument
548 static_cast<DerivedT *>(this)->setNumTombstones(Num); in setNumTombstones()
887 void setNumEntries(unsigned Num) { in setNumEntries() argument
888 NumEntries = Num; in setNumEntries()
895 void setNumTombstones(unsigned Num) { in setNumTombstones() argument
896 NumTombstones = Num; in setNumTombstones()
907 bool allocateBuckets(unsigned Num) { in allocateBuckets() argument
908 NumBuckets = Num; in allocateBuckets()
[all …]
|
| /src/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCMachineFunctionInfo.h | 243 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } in setVarArgsNumGPR() argument
257 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } in setVarArgsNumFPR() argument
|
| /src/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | GCMetadata.h | 68 int Num; ///< Usually a frame index. member
73 GCRoot(int N, const Constant *MD) : Num(N), Metadata(MD) {} in GCRoot()
118 void addStackRoot(int Num, const Constant *Metadata) { in addStackRoot() argument
119 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
|
| /src/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | GVN.cpp | 714 uint32_t Num = valueNumbering.lookup(V); in erase() local
718 NumberingPhi.erase(Num); in erase()
2268 bool GVNPass::ValueTable::areAllValsInBB(uint32_t Num, const BasicBlock *BB, in areAllValsInBB() argument
2271 Gvn.LeaderTable.getLeaders(Num), in areAllValsInBB()
2278 uint32_t Num, GVNPass &Gvn) { in phiTranslate() argument
2279 auto FindRes = PhiTranslateTable.find({Num, Pred}); in phiTranslate()
2282 uint32_t NewNum = phiTranslateImpl(Pred, PhiBlock, Num, Gvn); in phiTranslate()
2283 PhiTranslateTable.insert({{Num, Pred}, NewNum}); in phiTranslate()
2289 bool GVNPass::ValueTable::areCallValsEqual(uint32_t Num, uint32_t NewNum, in areCallValsEqual() argument
2294 auto Leaders = Gvn.LeaderTable.getLeaders(Num); in areCallValsEqual()
[all …]
|
| /src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | BuildLibCalls.h | 249 Value *emitMalloc(Value *Num, IRBuilderBase &B, const DataLayout &DL,
253 Value *emitCalloc(Value *Num, Value *Size, IRBuilderBase &B,
257 Value *emitHotColdNew(Value *Num, IRBuilderBase &B,
260 Value *emitHotColdNewNoThrow(Value *Num, Value *NoThrow, IRBuilderBase &B,
263 Value *emitHotColdNewAligned(Value *Num, Value *Align, IRBuilderBase &B,
266 Value *emitHotColdNewAlignedNoThrow(Value *Num, Value *Align, Value *NoThrow,
|