HomeSort by: relevance | last modified time | path
    Searched defs:Num (Results 1 - 25 of 53) sorted by relevancy

1 2 3

  /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/Target/AMDGPU/
GCNRegPressure.cpp 28 unsigned Num = 0;
44 ++Num;
48 ++Num;
51 if (!Num) dbgs() << " <none>\n";
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...]
  /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/llvm/lib/Target/RISCV/
RISCVMCInstLower.cpp 224 unsigned Num;
227 .getAsInteger(10, Num))
229 AP.emitNops(Num);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MacroFusion.cpp 48 unsigned Num = 1;
50 while ((CurrentSU = getPredClusterSU(*CurrentSU)) && Num < FuseLimit) Num ++;
51 return Num < FuseLimit;
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;
SpillPlacement.cpp 208 unsigned Num = I.getNumber();
209 BlockFrequencies[Num] = MBFI->getBlockFreq(&I);
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));
LiveVariables.cpp 717 unsigned Num = MBB.getNumber();
720 if (AliveBlocks.test(Num))
MIRPrinter.cpp 796 if (auto Num = MI.peekDebugInstrNum()) {
799 OS << " debug-instr-number " << Num;
SplitKit.cpp 66 unsigned Num = MBB.getNumber();
67 std::pair<SlotIndex, SlotIndex> &LIP = LastInsertPoint[Num];
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
Sink.cpp 144 unsigned Num = PHINode::getIncomingValueNumForOperand(U.getOperandNo());
145 UseBlock = PN->getIncomingBlock(Num);
  /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/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/DebugInfo/DWARF/
DWARFGdbIndex.cpp 186 uint32_t Num = Data.getU32(&Offset);
187 for (uint32_t j = 0; j < Num; ++j)
  /src/external/apache2/llvm/dist/llvm/lib/Support/
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);
YAMLTraits.cpp 919 uint32_t Num = Val;
920 Out << Num;
981 int32_t Num = Val;
982 Out << Num;
1105 unsigned long long Num;
1106 if (getAsUnsignedInteger(Scalar, 0, Num))
1108 Val = Num;
  /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/AMDGPU/Utils/
AMDGPUPALMetadata.cpp 274 unsigned Num;
632 for (; Entry->Num && Entry->Num != RegNum; ++Entry)
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonISelDAGToDAGHVX.cpp 134 Node Num = Order.size();
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/2 ? I+Num/2 : I-Num/2)
    [all...]
HexagonISelLoweringHVX.cpp 663 unsigned Num = i % Scale;
665 Mask[BlockLen*Num + Off] = i;
  /src/external/apache2/llvm/dist/llvm/tools/llc/
llc.cpp 460 unsigned Num;
461 if (V.consumeInteger(10, Num) || Num == 0 ||
463 (V.consume_front(".") && !V.consumeInteger(10, Num) && V.empty()))) {
  /src/external/lgpl3/mpfr/dist/src/
strtofr.c 513 We compute pstr_size = 1 + ceil(ysize_bits * Num / Den)
514 where 1/log2(base) <= Num/Den <= 1
517 let Num = RedInvLog2Table[pstr->base-2][0]
520 then ysize_bits * Num/Den = a*Num + (b * Num)/Den,
521 thus ceil(ysize_bits * Num/Den) = a*Num + floor(b * Num + Den - 1)/Den
536 unsigned int Num = RedInvLog2Table[pstr->base-2][0]
    [all...]
  /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...]

Completed in 59 milliseconds

1 2 3