Home
last modified time | relevance | path

Searched refs:Num (Results 1 – 25 of 162) sorted by relevance

1234567

/freebsd-13.1/contrib/llvm-project/llvm/lib/TextAPI/
H A DPackedVersion.cpp35 unsigned long long Num; in parse32() local
39 if (Num > UINT16_MAX) in parse32()
42 Version = Num << 16; in parse32()
48 if (Num > UINT8_MAX) in parse32()
74 if (Num > 0xFFFFFFULL) in parse64()
77 if (Num > 0xFFFFULL) { in parse64()
78 Num = 0xFFFFULL; in parse64()
81 Version = Num << 16; in parse64()
88 if (Num > 0x3FFULL) in parse64()
91 if (Num > 0xFFULL) { in parse64()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp115 for (auto I = RQ.begin(); Num; --Num) { in findMax()
136 if (Num == 1) break; in pickCandidate()
140 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
141 if (Num == 1) break; in pickCandidate()
145 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
152 if (Num == 1) break; in pickCandidate()
156 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
163 if (Num == 1) break; in pickCandidate()
165 Num = Num ? Num : RQ.size(); in pickCandidate()
169 << Num << '\n'); in pickCandidate()
[all …]
H A DAMDGPUCodeGenPrepare.cpp168 Value *Num, Value *Den,
173 Value *Num, Value *Den,
182 Value *Num, Value *Den) const;
687 return Builder.CreateFMul(Num, Recip); in optimizeWithRcp()
722 return Builder.CreateCall(Decl, { Num, Den }); in optimizeWithFDivFast()
770 Value *Num = FDiv.getOperand(0); in visitFDiv() local
900 Num = Builder.CreateTrunc(Num, I32Ty); in expandDivRem24Impl()
909 JQ = Builder.CreateXor(Num, Den); in expandDivRem24Impl()
919 Value *IA = Num; in expandDivRem24Impl()
974 Res = Builder.CreateSub(Num, Rem); in expandDivRem24Impl()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZSchedule.td39 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;
52 def "FPU"#Num : SchedWrite;
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DRecordSerialization.cpp54 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
108 auto EC = consume(SR, Num); in consume()
115 uint64_t &Num) { in consume_numeric() argument
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Support/
H A DBranchProbability.cpp69 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 DThreading.cpp99 llvm::get_threadpool_strategy(StringRef Num, ThreadPoolStrategy Default) { in get_threadpool_strategy() argument
100 if (Num == "all") in get_threadpool_strategy()
102 if (Num.empty()) in get_threadpool_strategy()
105 if (Num.getAsInteger(10, V)) in get_threadpool_strategy()
H A DCachePruning.cpp57 uint64_t Num; in parseDuration() local
58 if (NumStr.getAsInteger(0, Num)) in parseDuration()
64 return std::chrono::seconds(Num); in parseDuration()
66 return std::chrono::minutes(Num); in parseDuration()
68 return std::chrono::hours(Num); in parseDuration()
/freebsd-13.1/contrib/llvm-project/clang/lib/Sema/
H A DParsedAttr.cpp223 unsigned Num, unsigned Diag, in checkAttributeNumArgsImpl() argument
225 if (Comp(getNumAttributeArgs(AL), Num)) { in checkAttributeNumArgsImpl()
226 S.Diag(AL.getLoc(), Diag) << AL << Num; in checkAttributeNumArgsImpl()
232 bool ParsedAttr::checkExactlyNumArgs(Sema &S, unsigned Num) const { in checkExactlyNumArgs()
233 return checkAttributeNumArgsImpl(S, *this, Num, in checkExactlyNumArgs()
237 bool ParsedAttr::checkAtLeastNumArgs(Sema &S, unsigned Num) const { in checkAtLeastNumArgs()
238 return checkAttributeNumArgsImpl(S, *this, Num, in checkAtLeastNumArgs()
242 bool ParsedAttr::checkAtMostNumArgs(Sema &S, unsigned Num) const { in checkAtMostNumArgs()
243 return checkAttributeNumArgsImpl(S, *this, Num, in checkAtMostNumArgs()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h59 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()
/freebsd-13.1/contrib/llvm-project/llvm/utils/TableGen/
H A DInstrInfoEmitter.cpp758 unsigned Num = 0; in run() local
774 Num = 0; in run()
777 if (Num % 8 == 0) in run()
780 ++Num; in run()
792 Num = 0; in run()
794 if (Num % 8 == 0) in run()
802 ++Num; in run()
814 Num = 0; in run()
823 ++Num; in run()
1043 unsigned Num = 0; in emitEnums() local
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/SystemZ/AsmParser/
H A DSystemZAsmParser.cpp107 unsigned Num; member
172 Op->Reg.Num = Num; in createReg()
227 return Reg.Num; in getReg()
404 unsigned Num; member
880 if (Regs[Reg.Num] == 0) { in parseRegister()
922 if (Reg.Num > 15) { in parseAnyRegister()
980 Reg.Num = (unsigned)Value; in parseIntegerRegister()
1125 Base = Regs[Reg1.Num]; in parseAddress()
1149 Base = Regs[Reg2.Num]; in parseAddress()
1157 Base = Regs[Reg2.Num]; in parseAddress()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/
H A DAllocatorBase.h68 template <typename T> T *Allocate(size_t Num = 1) {
69 return static_cast<T *>(Allocate(Num * sizeof(T), alignof(T)));
75 Deallocate(T *Ptr, size_t Num = 1) {
76 Deallocate(static_cast<const void *>(Ptr), Num * sizeof(T), alignof(T));
H A DGenericDomTreeConstruction.h364 unsigned Num = 1; in FindRoots() local
382 Num = SNCA.runDFS(N, Num, AlwaysDescend, 1); in FindRoots()
398 if (Total + 1 != Num) { in FindRoots()
455 SNCA.runDFS<true>(I, Num, AlwaysDescend, Num, &*SuccOrder); in FindRoots()
464 for (unsigned i = NewNum; i > Num; --i) { in FindRoots()
471 const unsigned PrevNum = Num; in FindRoots()
473 Num = SNCA.runDFS(FurthestAway, Num, AlwaysDescend, 1); in FindRoots()
474 for (unsigned i = PrevNum + 1; i <= Num; ++i) in FindRoots()
526 for (unsigned x = 2; x <= Num; ++x) { in RemoveRedundantRoots()
556 unsigned Num = 1; in doFullDFSWalk() local
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DSplitKit.h70 unsigned Num = MBB.getNumber(); in getLastInsertPoint() local
72 if (LastInsertPoint[Num].first.isValid() && in getLastInsertPoint()
73 !LastInsertPoint[Num].second.isValid()) in getLastInsertPoint()
74 return LastInsertPoint[Num].first; in getLastInsertPoint()
238 SlotIndex getLastSplitPoint(unsigned Num) { in getLastSplitPoint() argument
239 return IPA.getLastInsertPoint(*CurLI, *MF.getBlockNumbered(Num)); in getLastSplitPoint()
250 SlotIndex getFirstSplitPoint(unsigned Num) { in getFirstSplitPoint() argument
251 return IPA.getFirstInsertPoint(*MF.getBlockNumbered(Num)); in getFirstSplitPoint()
H A DBranchRelaxation.cpp128 const unsigned Num = MBB.getNumber(); in INITIALIZE_PASS() local
129 assert(!Num || BlockInfo[PrevNum].postOffset(MBB) <= BlockInfo[Num].Offset); in INITIALIZE_PASS()
130 assert(BlockInfo[Num].Size == computeBlockSize(MBB)); in INITIALIZE_PASS()
131 PrevNum = Num; in INITIALIZE_PASS()
196 unsigned Num = MBB.getNumber(); in adjustBlockOffsets() local
199 BlockInfo[Num].Offset = BlockInfo[PrevNum].postOffset(MBB); in adjustBlockOffsets()
201 PrevNum = Num; in adjustBlockOffsets()
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dstring_utils.cpp71 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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXAsmPrinter.h109 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) { in addBytes() argument
110 assert((curpos + Num) <= size); in addBytes()
112 for (int i = 0; i < Num; ++i) { in addBytes()
116 for (int i = Num; i < Bytes; ++i) { in addBytes()
123 unsigned addZeros(int Num) { in addZeros() argument
124 assert((curpos + Num) <= size); in addZeros()
125 for (int i = 0; i < Num; ++i) { in addZeros()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DStringExtras.h248 template <typename N> bool to_integer(StringRef S, N &Num, unsigned Base = 0) {
249 return !S.getAsInteger(Base, Num);
254 inline bool to_float(const Twine &T, N &Num, N (*StrTo)(const char *, char **)) { in to_float() argument
261 Num = Temp; in to_float()
266 inline bool to_float(const Twine &T, float &Num) { in to_float() argument
267 return detail::to_float(T, Num, strtof); in to_float()
270 inline bool to_float(const Twine &T, double &Num) { in to_float() argument
271 return detail::to_float(T, Num, strtod); in to_float()
274 inline bool to_float(const Twine &T, long double &Num) { in to_float() argument
275 return detail::to_float(T, Num, strtold); in to_float()
H A DDenseMap.h488 void setNumEntries(unsigned Num) { in setNumEntries() argument
504 void setNumTombstones(unsigned Num) { in setNumTombstones() argument
844 void setNumEntries(unsigned Num) { in setNumEntries() argument
845 NumEntries = Num; in setNumEntries()
853 NumTombstones = Num; in setNumTombstones()
864 bool allocateBuckets(unsigned Num) { in allocateBuckets() argument
865 NumBuckets = Num; in allocateBuckets()
1120 void setNumEntries(unsigned Num) { in setNumEntries() argument
1123 NumEntries = Num; in setNumEntries()
1131 NumTombstones = Num; in setNumTombstones()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DGCMetadata.h67 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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAGHVX.cpp135 return (Pos < Num/2) ? Pos + Num/2 : Pos - Num/2; in conj()
441 if (I < Num/2) in route()
447 ElemType U = (S == Pass) ? I : (I < Num/2 ? I+Num/2 : I-Num/2); in route()
448 if (U < Num/2) in route()
459 P[J] -= Num/2; in route()
531 P[J] -= Num/2; in route()
567 unsigned CI = (I < Num/2) ? I+Num/2 : I-Num/2; in route()
569 if (I < Num/2) in route()
576 if (I < Num/2) in route()
597 P[J+Num/2] = QC; in route()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/M68k/MCTargetDesc/
H A DM68kMCCodeEmitter.cpp81 unsigned Num = 0; in encodeBits() local
84 Num = 1; in encodeBits()
87 Num = 2; in encodeBits()
90 Num = 3; in encodeBits()
93 Num = 4; in encodeBits()
99 << " Num: " << Num << " Val: 0x"); in encodeBits()
104 return Num; in encodeBits()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCMachineFunctionInfo.h226 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } in setVarArgsNumGPR() argument
240 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } in setVarArgsNumFPR() argument
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVN.cpp622 NumberingPhi.erase(Num); in erase()
2020 return Num; in phiTranslateImpl()
2027 return Num; in phiTranslateImpl()
2029 if (Num >= ExprIdx.size() || ExprIdx[Num] == 0) in phiTranslateImpl()
2030 return Num; in phiTranslateImpl()
2058 return areCallValsEqual(Num, NewNum, Pred, PhiBlock, Gvn) ? NewNum : Num; in phiTranslateImpl()
2061 return Num; in phiTranslateImpl()
2263 if (Num < NextNum) { in propagateEquality()
2396 unsigned Num = VN.lookupOrAdd(I); in processInstruction() local
2408 if (Num >= NextNum) { in processInstruction()
[all …]

1234567