Home
last modified time | relevance | path

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

123456789

/freebsd/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 > in parse64()
[all...]
/freebsd/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.cpp256 Value *Num, Value *Den) const;
257 unsigned getDivNumBits(BinaryOperator &I, Value *Num, Value *Den,
262 Value *Num, Value *Den,
266 Value *Num, Value *Den, unsigned NumBits,
271 Value *Num, Value *Den) const;
274 Value *Num, Value *Den) const;
293 Value *optimizeWithRsq(IRBuilder<> &Builder, Value *Num, Value *Den,
297 Value *optimizeWithRcp(IRBuilder<> &Builder, Value *Num, Value *Den,
299 Value *optimizeWithFDivFast(IRBuilder<> &Builder, Value *Num, Value *Den,
302 Value *visitFDivElement(IRBuilder<> &Builder, Value *Num, Value *Den,
[all …]
/freebsd/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/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
115 consume_numeric(BinaryStreamReader & Reader,uint64_t & Num) consume_numeric() argument
[all...]
/freebsd/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 DDebugCounter.cpp50 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 DThreading.cpp108 llvm::get_threadpool_strategy(StringRef Num, ThreadPoolStrategy Default) { in get_threadpool_strategy() argument
109 if (Num == "all") in get_threadpool_strategy()
111 if (Num.empty()) in get_threadpool_strategy()
114 if (Num.getAsInteger(10, V)) in get_threadpool_strategy()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/
H A DVecUtils.cpp13 unsigned VecUtils::getFloorPowerOf2(unsigned Num) { in getFloorPowerOf2() argument
14 if (Num == 0) in getFloorPowerOf2()
15 return Num; in getFloorPowerOf2()
16 unsigned Mask = Num; in getFloorPowerOf2()
18 for (unsigned ShiftBy = 1; ShiftBy < sizeof(Num) * 8; ShiftBy <<= 1) in getFloorPowerOf2()
20 return Num & ~Mask; in getFloorPowerOf2()
/freebsd/contrib/llvm-project/llvm/lib/SandboxIR/
H A DBasicBlock.cpp23 unsigned Num = NextI.getNumOfIRInstrs(); in operator ++() local
24 assert(Num > 0 && "Bad getNumOfIRInstrs()"); in operator ++()
25 It = std::next(It, Num - 1); in operator ++()
36 unsigned Num = CurrI.getNumOfIRInstrs(); in operator --() local
37 assert(Num > 0 && "Bad getNumOfIRInstrs()"); in operator --()
38 assert(std::prev(It, Num - 1) != BB->begin() && "Already at begin!"); in operator --()
39 It = std::prev(It, Num); in operator --()
85 unsigned Num = I->getNumOfIRInstrs(); in begin() local
86 assert(Num >= 1u && "Bad getNumOfIRInstrs()"); in begin()
87 It = std::next(It, Num - 1); in begin()
H A DUser.cpp39 OperandUseIterator OperandUseIterator::operator+(unsigned Num) const { in operator +()
41 Use.getOperandNo() + Num, /*Verify=*/true); in operator +()
45 OperandUseIterator OperandUseIterator::operator-(unsigned Num) const { in operator -()
46 assert(Use.getOperandNo() >= Num && "Out of bounds!"); in operator -()
48 Use.getOperandNo() - Num, /*Verify=*/true); in operator -()
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/AsmParser/
H A DSystemZAsmParser.cpp117 unsigned Num; member
179 createReg(RegisterKind Kind, unsigned Num, SMLoc StartLoc, SMLoc EndLoc) { in createReg() argument
182 Op->Reg.Num = Num; in createReg()
237 return Reg.Num; in getReg()
429 unsigned Num; member
808 if (Name.substr(1).getAsInteger(10, Reg.Num)) { in parseRegister()
815 if (Prefix == 'r' && Reg.Num < 16) in parseRegister()
817 else if (Prefix == 'f' && Reg.Num < 16) in parseRegister()
819 else if (Prefix == 'v' && Reg.Num < 32) in parseRegister()
821 else if (Prefix == 'a' && Reg.Num < 16) in parseRegister()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaM68k.cpp44 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 DParsedAttr.cpp279 unsigned Num, unsigned Diag, in checkAttributeNumArgsImpl() argument
281 if (Comp(getNumAttributeArgs(AL), Num)) { in checkAttributeNumArgsImpl()
282 S.Diag(AL.getLoc(), Diag) << AL << Num; in checkAttributeNumArgsImpl()
288 bool ParsedAttr::checkExactlyNumArgs(Sema &S, unsigned Num) const { in checkExactlyNumArgs()
289 return checkAttributeNumArgsImpl(S, *this, Num, in checkExactlyNumArgs()
293 bool ParsedAttr::checkAtLeastNumArgs(Sema &S, unsigned Num) const { in checkAtLeastNumArgs()
294 return checkAttributeNumArgsImpl(S, *this, Num, in checkAtLeastNumArgs()
298 bool ParsedAttr::checkAtMostNumArgs(Sema &S, unsigned Num) const { in checkAtMostNumArgs()
299 return checkAttributeNumArgsImpl(S, *this, Num, in checkAtMostNumArgs()
H A DSemaMSP430.cpp65 unsigned Num = NumParams->getLimitedValue(255); in handleInterruptAttr() local
66 if (Num > 63) { in handleInterruptAttr()
74 MSP430InterruptAttr(getASTContext(), AL, Num)); in handleInterruptAttr()
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dstring_utils.cpp61 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()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h58 size_t Num = Vector.size();
59 Pair.first->second = Num;
61 return Vector[Num].second;
70 size_t Num = Vector.size(); in insert() local
71 Pair.first->second = Num; in insert()
73 return std::make_pair(Vector.begin() + Num, true); in insert()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DThreading.h153 get_threadpool_strategy(StringRef Num, ThreadPoolStrategy Default = {});
173 inline ThreadPoolStrategy heavyweight_hardware_concurrency(StringRef Num) { in heavyweight_hardware_concurrency() argument
175 get_threadpool_strategy(Num, heavyweight_hardware_concurrency()); in heavyweight_hardware_concurrency()
195 inline ThreadPoolStrategy hardware_concurrency(StringRef Num) { in hardware_concurrency() argument
197 get_threadpool_strategy(Num, hardware_concurrency()); in hardware_concurrency()
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.h366 unsigned Num = 1; in FindRoots() local
384 Num = SNCA.runDFS(N, Num, AlwaysDescend, 1); in FindRoots()
388 << BlockNamePrinter(SNCA.NumToNode[Num]) << "\n"); in FindRoots()
400 if (Total + 1 != Num) { in FindRoots()
456 SNCA.runDFS<true>(I, Num, AlwaysDescend, Num, &*SuccOrder); in FindRoots()
462 LLVM_DEBUG(dbgs() << "\t\t\tPrev DFSNum: " << Num << ", new DFSNum: " 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()
[all …]
/freebsd/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/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXAsmPrinter.h114 void addBytes(const unsigned char *Ptr, unsigned Num, unsigned Bytes) { in addBytes() argument
115 for (unsigned I : llvm::seq(Num)) in addBytes()
117 if (Bytes > Num) in addBytes()
118 addZeros(Bytes - Num); in addBytes()
127 void addZeros(unsigned Num) { in addZeros() argument
128 for ([[maybe_unused]] unsigned _ : llvm::seq(Num)) { in addZeros()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DBuildLibCalls.h277 LLVM_ABI Value *emitMalloc(Value *Num, IRBuilderBase &B, const DataLayout &DL,
281 LLVM_ABI Value *emitCalloc(Value *Num, Value *Size, IRBuilderBase &B,
285 LLVM_ABI Value *emitHotColdNew(Value *Num, IRBuilderBase &B,
288 LLVM_ABI Value *emitHotColdNewNoThrow(Value *Num, Value *NoThrow,
292 LLVM_ABI Value *emitHotColdNewAligned(Value *Num, Value *Align,
296 LLVM_ABI Value *emitHotColdNewAlignedNoThrow(Value *Num, Value *Align,
301 LLVM_ABI Value *emitHotColdSizeReturningNew(Value *Num, IRBuilderBase &B,
305 emitHotColdSizeReturningNewAligned(Value *Num, Value *Align, IRBuilderBase &B,
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVN.cpp471 void GVNPass::ValueTable::add(Value *V, uint32_t Num) { in add() argument
472 ValueNumbering.insert(std::make_pair(V, Num)); in add()
474 NumberingPhi[Num] = PN; in add()
773 uint32_t Num = ValueNumbering.lookup(V); in erase() local
777 NumberingPhi.erase(Num); in erase()
779 NumberingBB.erase(Num); in erase()
942 for (const auto &[Num, Exp] : Map) { in dump()
943 errs() << Num << "\n"; in dump()
2308 bool GVNPass::ValueTable::areAllValsInBB(uint32_t Num, const BasicBlock *BB, in areAllValsInBB() argument
2311 GVN.LeaderTable.getLeaders(Num), in areAllValsInBB()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCMachineFunctionInfo.h243 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } in setVarArgsNumGPR() argument
257 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } in setVarArgsNumFPR() argument

123456789