| /src/external/apache2/llvm/dist/llvm/lib/TextAPI/ |
| PackedVersion.cpp | 35 unsigned long long Num;
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;
71 if (getAsUnsignedInteger(Parts[0], 10, Num))
74 if (Num > 0xFFFFFFULL
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/ |
| RecordSerialization.cpp | 36 Error llvm::codeview::consume(BinaryStreamReader &Reader, APSInt &Num) {
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) {
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| BranchProbability.cpp | 68 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) {
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, D, N)
[all...] |
| Threading.cpp | 136 llvm::get_threadpool_strategy(StringRef Num, ThreadPoolStrategy Default) {
137 if (Num == "all")
139 if (Num.empty())
142 if (Num.getAsInteger(10, V))
143 return None; // malformed 'Num' value
|
| CachePruning.cpp | 57 uint64_t Num;
58 if (NumStr.getAsInteger(0, Num))
64 return std::chrono::seconds(Num);
66 return std::chrono::minutes(Num);
68 return std::chrono::hours(Num);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNMinRegStrategy.cpp | 66 unsigned findMax(unsigned Num, Calc C);
108 unsigned GCNMinRegScheduler::findMax(unsigned Num, Calc C) {
109 assert(!RQ.empty() && Num <= RQ.size());
115 for (auto I = RQ.begin(); Num; --Num) {
135 unsigned Num = RQ.size();
136 if (Num == 1) break;
138 LLVM_DEBUG(dbgs() << "\nSelecting max priority candidates among " << Num
140 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; })
[all...] |
| AMDGPUCodeGenPrepare.cpp | 165 Value *Num, Value *Den) const;
167 Value *Num, Value *Den,
172 Value *Num, Value *Den,
176 Value *Num, Value *Den, unsigned NumBits,
181 Value *Num, Value *Den) const;
184 Value *Num, Value *Den) const;
638 static Value *optimizeWithRcp(Value *Num, Value *Den, bool AllowInaccurateRcp,
646 if (const ConstantFP *CLHS = dyn_cast<ConstantFP>(Num)) {
685 return Builder.CreateFMul(Num, Recip);
697 static Value *optimizeWithFDivFast(Value *Num, Value *Den, float ReqdAccuracy
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| AllocatorBase.h | 68 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));
|
| Threading.h | 179 /// Build a strategy from a number of threads as a string provided in \p Num.
180 /// When Num is above the max number of threads specified by the \p Default
185 get_threadpool_strategy(StringRef Num, ThreadPoolStrategy Default = {});
203 /// If \p Num is invalid, returns a default strategy where one thread per
205 inline ThreadPoolStrategy heavyweight_hardware_concurrency(StringRef Num) {
207 get_threadpool_strategy(Num, heavyweight_hardware_concurrency());
|
| /src/external/gpl2/diffutils/dist/lib/ |
| xalloc.h | 76 /* Return a pointer to a malloc'ed copy of the array SRC of NUM elements. */
77 # define CCLONE(Src, Num) \
78 (memcpy (xmalloc (sizeof (*Src) * (Num)), (Src), sizeof (*Src) * (Num)))
|
| /src/external/gpl2/grep/dist/lib/ |
| xalloc.h | 81 /* Return a pointer to a malloc'ed copy of the array SRC of NUM elements. */
82 # define CCLONE(Src, Num) \
83 (memcpy (xmalloc (sizeof (*Src) * (Num)), (Src), sizeof (*Src) * (Num)))
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/ |
| BlotMapVector.h | 59 size_t Num = Vector.size();
60 Pair.first->second = Num;
62 return Vector[Num].second;
71 size_t Num = Vector.size();
72 Pair.first->second = Num;
74 return std::make_pair(Vector.begin() + Num, true);
|
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| ParsedAttr.cpp | 223 unsigned Num, unsigned Diag,
225 if (Comp(getNumAttributeArgs(AL), Num)) {
226 S.Diag(AL.getLoc(), Diag) << AL << Num;
232 bool ParsedAttr::checkExactlyNumArgs(Sema &S, unsigned Num) const {
233 return checkAttributeNumArgsImpl(S, *this, Num,
237 bool ParsedAttr::checkAtLeastNumArgs(Sema &S, unsigned Num) const {
238 return checkAttributeNumArgsImpl(S, *this, Num,
242 bool ParsedAttr::checkAtMostNumArgs(Sema &S, unsigned Num) const {
243 return checkAttributeNumArgsImpl(S, *this, Num,
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| InstCount.cpp | 32 STATISTIC(Num##OPCODE##Inst, "Number of " #OPCODE " insts");
45 ++Num##OPCODE##Inst; \
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/NVPTX/ |
| NVPTXAsmPrinter.h | 109 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) {
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) {
124 assert((curpos + Num) <= size);
125 for (int i = 0; i < Num; ++i) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| GCMetadata.h | 67 int Num; ///< Usually a frame index.
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) {
114 Roots.push_back(GCRoot(Num, Metadata));
122 /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCMachineFunctionInfo.h | 225 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; }
235 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; }
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| SplitKit.h | 70 unsigned Num = MBB.getNumber();
72 if (LastInsertPoint[Num].first.isValid() &&
73 !LastInsertPoint[Num].second.isValid())
74 return LastInsertPoint[Num].first;
238 SlotIndex getLastSplitPoint(unsigned Num) {
239 return IPA.getLastInsertPoint(*CurLI, *MF.getBlockNumbered(Num));
250 SlotIndex getFirstSplitPoint(unsigned Num) {
251 return IPA.getFirstInsertPoint(*MF.getBlockNumbered(Num));
|
| BranchRelaxation.cpp | 128 const unsigned Num = MBB.getNumber();
129 assert(!Num || BlockInfo[PrevNum].postOffset(MBB) <= BlockInfo[Num].Offset);
130 assert(BlockInfo[Num].Size == computeBlockSize(MBB));
131 PrevNum = Num;
196 unsigned Num = MBB.getNumber();
199 BlockInfo[Num].Offset = BlockInfo[PrevNum].postOffset(MBB);
201 PrevNum = Num;
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/ |
| unload.exp | 66 "Num Type\[ \]+Disp Enb Address\[ \]+What\r?
79 "Num Type\[ \]+Disp Enb Address\[ \]+What\r?
102 "Num Type\[ \]+Disp Enb Address\[ \]+What\r?
120 "Num Type\[ \]+Disp Enb Address\[ \]+What\r?
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/ |
| unload.exp | 66 "Num Type\[ \]+Disp Enb Address\[ \]+What\r?
79 "Num Type\[ \]+Disp Enb Address\[ \]+What\r?
102 "Num Type\[ \]+Disp Enb Address\[ \]+What\r?
120 "Num Type\[ \]+Disp Enb Address\[ \]+What\r?
|
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| InstrInfoEmitter.cpp | 76 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
107 unsigned Num, raw_ostream &OS) {
108 OS << "static const MCPhysReg ImplicitList" << Num << "[] = { ";
758 unsigned Num = 0;
763 emitRecord(*Inst, Num++, InstrInfo, EmittedLists, OperandInfoIDs, OS);
774 Num = 0;
777 if (Num % 8 == 0)
780 ++Num;
792 Num = 0;
794 if (Num % 8 == 0
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| StringExtras.h | 247 template <typename N> bool to_integer(StringRef S, N &Num, unsigned Base = 0) {
248 return !S.getAsInteger(Base, Num);
253 inline bool to_float(const Twine &T, N &Num, N (*StrTo)(const char *, char **)) {
260 Num = Temp;
265 inline bool to_float(const Twine &T, float &Num) {
266 return detail::to_float(T, Num, strtof);
269 inline bool to_float(const Twine &T, double &Num) {
270 return detail::to_float(T, Num, strtod);
273 inline bool to_float(const Twine &T, long double &Num) {
274 return detail::to_float(T, Num, strtold)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/M68k/MCTargetDesc/ |
| M68kMCCodeEmitter.cpp | 81 unsigned Num = 0;
84 Num = 1;
87 Num = 2;
90 Num = 3;
93 Num = 4;
99 << " Num: " << Num << " Val: 0x");
104 return Num;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/AsmParser/ |
| SystemZAsmParser.cpp | 96 // LLVM register Num, which has kind Kind. In some ways it might be
107 unsigned Num;
169 createReg(RegisterKind Kind, unsigned Num, SMLoc StartLoc, SMLoc EndLoc) {
172 Op->Reg.Num = Num;
227 return Reg.Num;
404 unsigned Num;
774 if (Name.substr(1).getAsInteger(10, Reg.Num)) {
781 if (Prefix == 'r' && Reg.Num < 16)
783 else if (Prefix == 'f' && Reg.Num < 16
[all...] |
