/freebsd-11-stable/contrib/llvm-project/llvm/lib/TextAPI/MachO/ |
H A D | PackedVersion.cpp | 35 unsigned long long Num; local 36 if (getAsUnsignedInteger(Parts[0], 10, Num)) 39 if (Num > UINT16_MAX) 42 Version = Num << 16; 45 if (getAsUnsignedInteger(Parts[i], 10, Num)) 48 if (Num > UINT8_MAX) 51 Version |= (Num << ShiftNum); 70 unsigned long long Num; local 71 if (getAsUnsignedInteger(Parts[0], 10, Num)) 74 if (Num > [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | BranchProbability.cpp | 68 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) { argument 75 if (!Num || D == N) 76 return Num; 78 // Split Num into upper and lower parts to multiply, then recombine. 79 uint64_t ProductHigh = (Num >> 32) * N; 80 uint64_t ProductLow = (Num & UINT32_MAX) * N; 106 uint64_t BranchProbability::scale(uint64_t Num) const { 107 return ::scale<D>(Num, N, D); 110 uint64_t BranchProbability::scaleByInverse(uint64_t Num) const { 111 return ::scale<0>(Num, [all...] |
H A D | CachePruning.cpp | 57 uint64_t Num; local 58 if (NumStr.getAsInteger(0, Num)) 64 return std::chrono::seconds(Num); 66 return std::chrono::minutes(Num); 68 return std::chrono::hours(Num);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/ |
H A D | RecordSerialization.cpp | 36 Error llvm::codeview::consume(BinaryStreamReader &Reader, APSInt &Num) { argument 44 Num = APSInt(APInt(/*numBits=*/16, Short, /*isSigned=*/false), 54 Num = APSInt(APInt(8, N, true), false); 61 Num = APSInt(APInt(16, N, true), false); 68 Num = APSInt(APInt(16, N, false), true); 75 Num = APSInt(APInt(32, N, true), false); 82 Num = APSInt(APInt(32, N, FalseVal), true); 89 Num = APSInt(APInt(64, N, true), false); 96 Num = APSInt(APInt(64, N, false), true); 104 Error llvm::codeview::consume(StringRef &Data, APSInt &Num) { argument 114 consume_numeric(BinaryStreamReader &Reader, uint64_t &Num) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | GCNMinRegStrategy.cpp | 72 unsigned findMax(unsigned Num, Calc C); 114 unsigned GCNMinRegScheduler::findMax(unsigned Num, Calc C) { argument 115 assert(!RQ.empty() && Num <= RQ.size()); 121 for (auto I = RQ.begin(); Num; --Num) { 141 unsigned Num = RQ.size(); local 142 if (Num == 1) break; 144 LLVM_DEBUG(dbgs() << "\nSelecting max priority candidates among " << Num 146 Num = findMax(Num, [ [all...] |
H A D | AMDGPUCodeGenPrepare.cpp | 157 Value *Num, Value *Den, 162 Value *Num, Value *Den) const; 528 static bool shouldKeepFDivF32(Value *Num, bool UnsafeDiv, bool HasDenormals) { argument 529 const ConstantFP *CNum = dyn_cast<ConstantFP>(Num); 574 Value *Num = FDiv.getOperand(0); local 585 Value *NumEltI = Builder.CreateExtractElement(Num, I); 598 if (!shouldKeepFDivF32(Num, UnsafeDiv, HasFP32Denormals)) 599 NewFDiv = Builder.CreateCall(Decl, { Num, Den }); 638 Value *Num, Value *Den, 640 assert(Num 636 expandDivRem24(IRBuilder< &Builder, BinaryOperator &I, Value *Num, Value *Den, bool IsDiv, bool IsSigned) const argument 740 expandDivRem32(IRBuilder< &Builder, BinaryOperator &I, Value *Num, Value *Den) const argument 901 Value *Num = I.getOperand(0); local [all...] |
/freebsd-11-stable/gnu/usr.bin/grep/ |
H A D | xalloc.h | 80 # define CCLONE(Src, Num) \ 81 (memcpy (xmalloc (sizeof (*Src) * (Num)), (Src), sizeof (*Src) * (Num)))
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | BlotMapVector.h | 59 size_t Num = Vector.size(); local 60 Pair.first->second = Num; 62 return Vector[Num].second; 71 size_t Num = Vector.size(); local 72 Pair.first->second = Num; 74 return std::make_pair(Vector.begin() + Num, true);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCMachineFunctionInfo.h | 197 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } argument 200 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | SplitKit.h | 68 unsigned Num = MBB.getNumber(); local 70 if (LastInsertPoint[Num].first.isValid() && 71 !LastInsertPoint[Num].second.isValid()) 72 return LastInsertPoint[Num].first; 233 SlotIndex getLastSplitPoint(unsigned Num) { argument 234 return IPA.getLastInsertPoint(*CurLI, *MF.getBlockNumbered(Num)); 241 SlotIndex getFirstSplitPoint(unsigned Num) { argument 242 return IPA.getFirstInsertPoint(*MF.getBlockNumbered(Num));
|
H A D | BranchRelaxation.cpp | 131 const unsigned Num = MBB.getNumber(); local 132 assert(isAligned(MBB.getAlignment(), BlockInfo[Num].Offset)); 133 assert(!Num || BlockInfo[PrevNum].postOffset(MBB) <= BlockInfo[Num].Offset); 134 assert(BlockInfo[Num].Size == computeBlockSize(MBB)); 135 PrevNum = Num; 199 unsigned Num = MBB.getNumber(); local 200 if (!Num) // block zero is never changed from offset zero. 204 BlockInfo[Num].Offset = BlockInfo[PrevNum].postOffset(MBB); 206 PrevNum = Num; [all...] |
H A D | MacroFusion.cpp | 48 unsigned Num = 1; local 50 while ((CurrentSU = getPredClusterSU(*CurrentSU)) && Num < FuseLimit) Num ++; 51 return Num < FuseLimit;
|
H A D | GCMetadata.cpp | 116 OS << "\t" << RI->Num << "\t" << RI->StackOffset << "[sp]\n"; 128 OS << " " << RI->Num;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | InstCount.cpp | 31 STATISTIC(Num ## OPCODE ## Inst, "Number of " #OPCODE " insts"); 43 void visit##OPCODE(CLASS &) { ++Num##OPCODE##Inst; ++TotalInsts; }
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
H A D | NVPTXAsmPrinter.h | 109 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) { argument 110 assert((curpos + Num) <= size); 112 for (int i = 0; i < Num; ++i) { 116 for (int i = Num; i < Bytes; ++i) { 123 unsigned addZeros(int Num) { argument 124 assert((curpos + Num) <= size); 125 for (int i = 0; i < Num; ++i) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | InstrInfoEmitter.cpp | 74 void emitRecord(const CodeGenInstruction &Inst, unsigned Num, 98 unsigned Num, raw_ostream &OS) { 99 OS << "static const MCPhysReg ImplicitList" << Num << "[] = { "; local 561 unsigned Num = 0; local 566 emitRecord(*Inst, Num++, InstrInfo, EmittedLists, OperandInfoIDs, OS); 577 Num = 0; 580 if (Num % 8 == 0) 583 ++Num; 650 void InstrInfoEmitter::emitRecord(const CodeGenInstruction &Inst, unsigned Num, argument 662 OS << Num << ",\ 97 PrintDefList(const std::vector<Record*> &Uses, unsigned Num, raw_ostream &OS) argument 781 unsigned Num = 0; local 784 OS << " INSTRUCTION_LIST_END = " << Num << "\\n"; local 799 OS << " SCHED_LIST_END = " << Num << "\\n"; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | GCMetadata.h | 67 int Num; ///< Usually a frame index. member in struct:llvm::GCRoot 72 GCRoot(int N, const Constant *MD) : Num(N), Metadata(MD) {} 110 /// addStackRoot - Registers a root that lives on the stack. Num is the 113 void addStackRoot(int Num, const Constant *Metadata) { argument 114 Roots.push_back(GCRoot(Num, Metadata)); 122 /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
|
H A D | SlotIndexes.h | 453 getMBBRange(unsigned Num) const { 454 return MBBRanges[Num]; 464 SlotIndex getMBBStartIdx(unsigned Num) const { 465 return getMBBRange(Num).first; 474 SlotIndex getMBBEndIdx(unsigned Num) const { 475 return getMBBRange(Num).second;
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
H A D | string_utils.cpp | 71 static int appendUnsigned(char **Buffer, const char *BufferEnd, u64 Num, argument 74 return appendNumber(Buffer, BufferEnd, Num, Base, MinNumberLength, 78 static int appendSignedDecimal(char **Buffer, const char *BufferEnd, s64 Num, argument 80 const bool Negative = (Num < 0); 82 static_cast<u64>(Negative ? -Num : Num), 10,
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | StringExtras.h | 193 template <typename N> bool to_integer(StringRef S, N &Num, unsigned Base = 0) { argument 194 return !S.getAsInteger(Base, Num); 199 inline bool to_float(const Twine &T, N &Num, N (*StrTo)(const char *, char **)) { argument 206 Num = Temp; 211 inline bool to_float(const Twine &T, float &Num) { argument 212 return detail::to_float(T, Num, strtof); 215 inline bool to_float(const Twine &T, double &Num) { argument 216 return detail::to_float(T, Num, strtod); 219 inline bool to_float(const Twine &T, long double &Num) { argument 220 return detail::to_float(T, Num, strtol [all...] |
H A D | DenseMap.h | 458 void setNumEntries(unsigned Num) { argument 459 static_cast<DerivedT *>(this)->setNumEntries(Num); 474 void setNumTombstones(unsigned Num) { argument 475 static_cast<DerivedT *>(this)->setNumTombstones(Num); 814 void setNumEntries(unsigned Num) { argument 815 NumEntries = Num; 822 void setNumTombstones(unsigned Num) { argument 823 NumTombstones = Num; 834 bool allocateBuckets(unsigned Num) { argument 835 NumBuckets = Num; 1087 setNumEntries(unsigned Num) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/AsmParser/ |
H A D | SystemZAsmParser.cpp | 96 // LLVM register Num, which has kind Kind. In some ways it might be 107 unsigned Num; member in struct:__anon2401::SystemZOperand::RegOp 169 createReg(RegisterKind Kind, unsigned Num, SMLoc StartLoc, SMLoc EndLoc) { argument 172 Op->Reg.Num = Num; 227 return Reg.Num; 404 unsigned Num; member in struct:__anon2401::SystemZAsmParser::Register 713 if (Name.substr(1).getAsInteger(10, Reg.Num)) 717 if (Prefix == 'r' && Reg.Num < 16) 719 else if (Prefix == 'f' && Reg.Num < 1 [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAGHVX.cpp | 134 Node Num = Order.size(); local 135 return (Pos < Num/2) ? Pos + Num/2 : Pos - Num/2; 428 ElemType Num = Size; 434 for (ElemType J = 0; J != Num; ++J) { 441 if (I < Num/2) 442 S = (J < Num/2) ? Pass : Switch; 444 S = (J < Num/2) ? Switch : Pass; 447 ElemType U = (S == Pass) ? I : (I < Num/ [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | GVN.cpp | 593 uint32_t Num = valueNumbering.lookup(V); local 597 NumberingPhi.erase(Num); 1629 bool GVN::ValueTable::areAllValsInBB(uint32_t Num, const BasicBlock *BB, argument 1631 LeaderTableEntry *Vals = &Gvn.LeaderTable[Num]; 1639 const BasicBlock *PhiBlock, uint32_t Num, 1641 auto FindRes = PhiTranslateTable.find({Num, Pred}); 1644 uint32_t NewNum = phiTranslateImpl(Pred, PhiBlock, Num, Gvn); 1645 PhiTranslateTable.insert({{Num, Pred}, NewNum}); 1649 // Return true if the value number \p Num and NewNum have equal value. 1651 bool GVN::ValueTable::areCallValsEqual(uint32_t Num, uint32_ argument 1638 phiTranslate(const BasicBlock *Pred, const BasicBlock *PhiBlock, uint32_t Num, GVN &Gvn) argument 1686 phiTranslateImpl(const BasicBlock *Pred, const BasicBlock *PhiBlock, uint32_t Num, GVN &Gvn) argument 1740 eraseTranslateCacheEntry(uint32_t Num, const BasicBlock &CurrBlock) argument 1937 uint32_t Num = VN.lookupOrAddCmp(Cmp->getOpcode(), NotPred, Op0, Op1); local 2007 unsigned Num = VN.lookupOrAdd(LI); local 2071 unsigned Num = VN.lookupOrAdd(I); local 2266 unsigned Num = VN.lookupOrAdd(Instr); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | BinaryStreamWriter.h | 74 template <typename T> Error writeEnum(T Num) { argument 79 return writeInteger<U>(static_cast<U>(Num));
|