Home
last modified time | relevance | path

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

12345678

/freebsd-src/contrib/llvm-project/llvm/lib/TextAPI/
H A DPackedVersion.cpp34 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 …]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp66 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 DAMDGPUCodeGenPrepare.cpp243 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, Valu
901 optimizeWithRsq(IRBuilder<> & Builder,Value * Num,Value * Den,const FastMathFlags DivFMF,const FastMathFlags SqrtFMF,const Instruction * CtxI) const optimizeWithRsq() argument
943 optimizeWithRcp(IRBuilder<> & Builder,Value * Num,Value * Den,FastMathFlags FMF,const Instruction * CtxI) const optimizeWithRcp() argument
1007 optimizeWithFDivFast(IRBuilder<> & Builder,Value * Num,Value * Den,float ReqdAccuracy) const optimizeWithFDivFast() argument
1032 visitFDivElement(IRBuilder<> & Builder,Value * Num,Value * Den,FastMathFlags DivFMF,FastMathFlags SqrtFMF,Value * RsqOp,const Instruction * FDivInst,float ReqdDivAccuracy) const visitFDivElement() argument
1089 Value *Num = FDiv.getOperand(0); visitFDiv() local
1191 getDivNumBits(BinaryOperator & I,Value * Num,Value * Den,unsigned AtLeast,bool IsSigned) const getDivNumBits() argument
1213 expandDivRem24(IRBuilder<> & Builder,BinaryOperator & I,Value * Num,Value * Den,bool IsDiv,bool IsSigned) const expandDivRem24() argument
1223 expandDivRem24Impl(IRBuilder<> & Builder,BinaryOperator & I,Value * Num,Value * Den,unsigned DivBits,bool IsDiv,bool IsSigned) const expandDivRem24Impl() argument
1325 divHasSpecialOptimization(BinaryOperator & I,Value * Num,Value * Den) const divHasSpecialOptimization() argument
1493 shrinkDivRem64(IRBuilder<> & Builder,BinaryOperator & I,Value * Num,Value * Den) const shrinkDivRem64() argument
1562 Value *Num = I.getOperand(0); visitBinaryOperator() local
[all...]
H A DGCNPreRALongBranchReg.cpp97 uint64_t Num = MBB.getNumber(); in generateBlockInfo() local
99 BlockInfo[Num].Offset = BlockInfo[PrevNum].Offset + BlockInfo[PrevNum].Size; in generateBlockInfo()
100 PrevNum = Num; in generateBlockInfo()
/freebsd-src/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZSchedule.td37 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 …]
/freebsd-src/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DRecordSerialization.cpp36 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 …]
/freebsd-src/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.cpp110 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()
H A DCachePruning.cpp58 uint64_t Num; in parseDuration() local
59 if (NumStr.getAsInteger(0, Num)) in parseDuration()
65 return std::chrono::seconds(Num); in parseDuration()
67 return std::chrono::minutes(Num); in parseDuration()
69 return std::chrono::hours(Num); in parseDuration()
/freebsd-src/contrib/llvm-project/clang/lib/Sema/
H A DParsedAttr.cpp289 unsigned Num, unsigned Diag, in checkAttributeNumArgsImpl()
291 if (Comp(getNumAttributeArgs(AL), Num)) {
292 S.Diag(AL.getLoc(), Diag) << AL << Num; in checkExactlyNumArgs()
298 bool ParsedAttr::checkExactlyNumArgs(Sema &S, unsigned Num) const { in checkAtLeastNumArgs()
299 return checkAttributeNumArgsImpl(S, *this, Num, in checkAtLeastNumArgs()
303 bool ParsedAttr::checkAtLeastNumArgs(Sema &S, unsigned Num) const { in checkAtMostNumArgs()
304 return checkAttributeNumArgsImpl(S, *this, Num, in checkAtMostNumArgs()
308 bool ParsedAttr::checkAtMostNumArgs(Sema &S, unsigned Num) const { in takeAndConcatenateAttrs()
309 return checkAttributeNumArgsImpl(S, *this, Num, in takeAndConcatenateAttrs()
283 checkAttributeNumArgsImpl(Sema & S,const ParsedAttr & AL,unsigned Num,unsigned Diag,Compare Comp) checkAttributeNumArgsImpl() argument
/freebsd-src/contrib/llvm-project/llvm/lib/Target/SystemZ/AsmParser/
H A DSystemZAsmParser.cpp101 // LLVM register Num, which has kind Kind. In some ways it might be
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 < 1 in parseRegister()
[all...]
/freebsd-src/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-src/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXAsmPrinter.h114 // Copy Num bytes from Ptr.
115 // if Bytes > Num, zero fill up to Bytes. in addBytes() argument
116 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) { in addBytes()
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()
131 assert((curpos + Num) <= size); in addZeros()
132 for (int i = 0; i < Num; ++i) { in addZeros()
129 addZeros(int Num) addZeros() argument
/freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/
H A DSplitKit.h69 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()
/freebsd-src/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dstring_utils.cpp61 void ScopedString::appendUnsigned(u64 Num, u8 Base, u8 MinNumberLength, in appendNumber()
63 appendNumber(Num, Base, MinNumberLength, PadWithZero, /*Negative=*/false, in appendNumber()
67 void ScopedString::appendSignedDecimal(s64 Num, u8 MinNumberLength, in appendNumber()
69 const bool Negative = (Num < 0); in appendNumber()
70 const u64 UnsignedNum = (Num == INT64_MIN)
72 : static_cast<u64>(Negative ? -Num : Num); in appendUnsigned()
71 appendUnsigned(char ** Buffer,const char * BufferEnd,u64 Num,u8 Base,u8 MinNumberLength,bool PadWithZero,bool Upper) appendUnsigned() argument
78 appendSignedDecimal(char ** Buffer,const char * BufferEnd,s64 Num,u8 MinNumberLength,bool PadWithZero) appendSignedDecimal() argument
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Support/
H A DAllocatorBase.h75 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 DGenericDomTreeConstruction.h350 unsigned Num = 1; in FindRoots()
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()
361 unsigned Num = 1; FindRoots() local
518 const unsigned Num = SNCA.runDFS<true>(Root, 0, AlwaysDescend, 0); RemoveRedundantRoots() local
551 unsigned Num = 1; doFullDFSWalk() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/utils/TableGen/
H A DInstrInfoEmitter.cpp90 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
985 unsigned Num = NumberedInstructions.size(); in run()
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 in run()
987 unsigned Num = NumberedInstructions.size(); run() local
1177 emitRecord(const CodeGenInstruction & Inst,unsigned Num,Record * InstrInfo,std::map<std::vector<Record * >,unsigned> & EmittedLists,const OperandInfoMapTy & OperandInfoMap,raw_ostream & OS) emitRecord() argument
1285 unsigned Num = 0; emitEnums() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DStringExtras.h279 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, strtol in to_float()
[all...]
H A DDenseMap.h531 void setNumEntries(unsigned Num) { in setNumTombstones() argument
532 static_cast<DerivedT *>(this)->setNumEntries(Num); in setNumTombstones()
547 void setNumTombstones(unsigned Num) { in getBuckets()
548 static_cast<DerivedT *>(this)->setNumTombstones(Num); in getBuckets()
887 void setNumEntries(unsigned Num) { in getNumBuckets()
888 NumEntries = Num; in getNumBuckets()
895 void setNumTombstones(unsigned Num) { in allocateBuckets()
896 NumTombstones = Num; in allocateBuckets()
907 bool allocateBuckets(unsigned Num) {
908 NumBuckets = Num;
515 setNumEntries(unsigned Num) setNumEntries() argument
871 setNumEntries(unsigned Num) setNumEntries() argument
879 setNumTombstones(unsigned Num) setNumTombstones() argument
891 allocateBuckets(unsigned Num) allocateBuckets() argument
1149 setNumEntries(unsigned Num) setNumEntries() argument
1159 setNumTombstones(unsigned Num) setNumTombstones() argument
1210 allocateBuckets(unsigned Num) allocateBuckets() argument
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCMachineFunctionInfo.h243 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; }
257 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; }
231 setVarArgsNumGPR(unsigned Num) setVarArgsNumGPR() argument
245 setVarArgsNumFPR(unsigned Num) setVarArgsNumFPR() argument
/freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DGCMetadata.h68 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()
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVN.cpp714 uint32_t Num = valueNumbering.lookup(V); in erase()
718 NumberingPhi.erase(Num); in erase()
2268 bool GVNPass::ValueTable::areAllValsInBB(uint32_t Num, const BasicBlock *BB, in phiTranslateImpl()
2271 Gvn.LeaderTable.getLeaders(Num), in phiTranslateImpl()
2278 uint32_t Num, GVNPass &Gvn) { in phiTranslateImpl()
2279 auto FindRes = PhiTranslateTable.find({Num, Pred}); in phiTranslateImpl()
2282 uint32_t NewNum = phiTranslateImpl(Pred, PhiBlock, Num, Gvn); in phiTranslateImpl()
2283 PhiTranslateTable.insert({{Num, Pred}, NewNum}); in phiTranslateImpl()
2287 // Return true if the value number \p Num and NewNum have equal value. in phiTranslateImpl()
2289 bool GVNPass::ValueTable::areCallValsEqual(uint32_t Num, uint32_ in phiTranslateImpl()
713 uint32_t Num = valueNumbering.lookup(V); erase() local
2202 areAllValsInBB(uint32_t Num,const BasicBlock * BB,GVNPass & Gvn) areAllValsInBB() argument
2213 phiTranslate(const BasicBlock * Pred,const BasicBlock * PhiBlock,uint32_t Num,GVNPass & Gvn) phiTranslate() argument
2224 areCallValsEqual(uint32_t Num,uint32_t NewNum,const BasicBlock * Pred,const BasicBlock * PhiBlock,GVNPass & Gvn) areCallValsEqual() argument
2262 phiTranslateImpl(const BasicBlock * Pred,const BasicBlock * PhiBlock,uint32_t Num,GVNPass & Gvn) phiTranslateImpl() argument
2316 eraseTranslateCacheEntry(uint32_t Num,const BasicBlock & CurrBlock) eraseTranslateCacheEntry() argument
2510 uint32_t Num = VN.lookupOrAddCmp(Cmp->getOpcode(), NotPred, Op0, Op1); propagateEquality() local
2582 unsigned Num = VN.lookupOrAdd(Load); processInstruction() local
2646 unsigned Num = VN.lookupOrAdd(I); processInstruction() local
2858 unsigned Num = VN.lookupOrAdd(Instr); performScalarPREInsertion() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DBuildLibCalls.h249 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,
/freebsd-src/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_dense_map.h356 void setNumEntries(unsigned Num) { in setNumEntries() argument
357 static_cast<DerivedT *>(this)->setNumEntries(Num); in setNumEntries()
368 void setNumTombstones(unsigned Num) { in setNumTombstones() argument
369 static_cast<DerivedT *>(this)->setNumTombstones(Num); in setNumTombstones()
664 void setNumEntries(unsigned Num) { NumEntries = Num; } in setNumEntries() argument
668 void setNumTombstones(unsigned Num) { NumTombstones = Num; } in setNumTombstones() argument
674 bool allocateBuckets(unsigned Num) { in allocateBuckets() argument
675 NumBuckets = Num; in allocateBuckets()

12345678