HomeSort by relevance Sort by last modified time
    Searched defs:Num (Results 1 - 25 of 40) sorted by null

1 2

  /external/llvm/lib/Fuzzer/test/
CounterTest.cpp 6 int Num = 0;
9 Num++;
10 if (Num >= 4) {
  /external/llvm/unittests/Support/
ArrayRecyclerTest.cpp 20 int Num;
57 A1[0].Num = 21;
58 A1[7].Num = 17;
61 A2[0].Num = 121;
62 A2[7].Num = 117;
65 A3[0].Num = 221;
66 A3[7].Num = 217;
68 EXPECT_EQ(21, A1[0].Num);
69 EXPECT_EQ(17, A1[7].Num);
70 EXPECT_EQ(121, A2[0].Num);
    [all...]
  /external/llvm/lib/Transforms/ObjCARC/
BlotMapVector.h 53 size_t Num = Vector.size();
54 Pair.first->second = Num;
56 return Vector[Num].second;
65 size_t Num = Vector.size();
66 Pair.first->second = Num;
68 return std::make_pair(Vector.begin() + Num, true);
  /external/llvm/lib/Transforms/Scalar/
Sink.cpp 89 unsigned Num = PHINode::getIncomingValueNumForOperand(U.getOperandNo());
90 UseBlock = PN->getIncomingBlock(Num);
  /external/llvm/lib/CodeGen/
SpillPlacement.cpp 191 unsigned Num = I.getNumber();
192 BlockFrequencies[Num] = MBFI->getBlockFreq(&I);
LiveVariables.cpp 724 unsigned Num = MBB.getNumber();
727 if (AliveBlocks.test(Num))
MachineFunction.cpp 277 MachineFunction::allocateMemRefsArray(unsigned long Num) {
278 return Allocator.Allocate<MachineMemOperand *>(Num);
285 unsigned Num = 0;
288 ++Num;
291 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
310 return std::make_pair(Result, Result + Num);
317 unsigned Num = 0;
320 ++Num;
323 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
342 return std::make_pair(Result, Result + Num);
    [all...]
  /external/clang/test/CXX/temp/temp.decls/temp.friend/
p1.cpp 4 template <typename T> struct Num {
8 Num(T value) : value_(value) {}
15 friend Num operator*(const Num &a, const Rep &n) {
16 Num x = 0;
23 friend Num operator+(const Num &a, const Num &b) {
27 Num& operator+=(const Num& b)
    [all...]
  /external/llvm/include/llvm/CodeGen/
GCMetadata.h 63 int Num; ///< Usually a frame index.
68 GCRoot(int N, const Constant *MD) : Num(N), StackOffset(-1), Metadata(MD) {}
108 /// addStackRoot - Registers a root that lives on the stack. Num is the
111 void addStackRoot(int Num, const Constant *Metadata) {
112 Roots.push_back(GCRoot(Num, Metadata));
120 /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
BasicTTIImpl.h 317 unsigned Num = Ty->getVectorNumElements();
323 return getScalarizationOverhead(Ty, true, true) + Num * Cost;
408 unsigned Num = Dst->getVectorNumElements();
414 return getScalarizationOverhead(Dst, true, true) + Num * Cost;
458 unsigned Num = ValTy->getVectorNumElements();
467 return getScalarizationOverhead(ValTy, true, false) + Num * Cost;
  /external/llvm/lib/Target/AArch64/
AArch64BranchRelaxation.cpp 124 unsigned Num = MBB.getNumber();
125 assert(BlockInfo[Num].Offset % (1u << Align) == 0);
126 assert(!Num || BlockInfo[PrevNum].postOffset() <= BlockInfo[Num].Offset);
127 PrevNum = Num;
206 unsigned Num = MBB.getNumber();
207 if (!Num) // block zero is never changed from offset zero.
212 BlockInfo[Num].Offset = BlockInfo[PrevNum].postOffset(LogAlign);
213 PrevNum = Num;
  /external/llvm/utils/TableGen/
InstrInfoEmitter.cpp 55 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
76 unsigned Num, raw_ostream &OS) {
77 OS << "static const MCPhysReg ImplicitList" << Num << "[] = { ";
387 unsigned Num = 0;
392 emitRecord(*Inst, Num++, InstrInfo, EmittedLists, OperandInfoIDs, OS);
403 Num = 0;
406 if (Num % 8 == 0)
409 ++Num;
462 void InstrInfoEmitter::emitRecord(const CodeGenInstruction &Inst, unsigned Num,
474 OS << Num << ",\t" << MinOperands << ",\t
    [all...]
  /external/mesa3d/src/gallium/drivers/radeon/
AMDGPUISelLowering.cpp 186 SDValue Num = Op.getOperand(0);
223 // Quotient = mulhu(Tmp0, Num)
224 SDValue Quotient = DAG.getNode(ISD::MULHU, DL, VT, Tmp0, Num);
229 // Remainder = Num - Num_S_Remainder
230 SDValue Remainder = DAG.getNode(ISD::SUB, DL, VT, Num, Num_S_Remainder);
  /cts/tools/dasm/src/dasm/
sym.java 84 static final int Num = 71;
  /external/llvm/lib/Support/
YAMLTraits.cpp 771 uint32_t Num = Val;
772 Out << Num;
833 int32_t Num = Val;
834 Out << Num;
917 uint8_t Num = Val;
918 Out << format("0x%02X", Num);
932 uint16_t Num = Val;
933 Out << format("0x%04X", Num);
947 uint32_t Num = Val;
948 Out << format("0x%08X", Num);
    [all...]
  /external/mesa3d/src/mesa/program/
prog_optimize.c 850 GLuint Num;
858 list->Intervals[list->Num++] = *inv;
867 GLint i = list->Num - 1;
873 list->Num++;
878 for (i = 0; i + 1 < list->Num; i++) {
892 for (k = 0; k < list->Num; k++) {
897 while (k < list->Num - 1) {
901 list->Num--;
927 qsort(list->Intervals, list->Num, sizeof(struct interval), compare_start);
931 for (i = 0; i + 1 < list->Num; i++)
    [all...]
  /external/clang/lib/AST/
ItaniumMangle.cpp     [all...]
  /external/jhead/
exif.c 440 int Num,Den;
441 Num = Get32s(ValuePtr);
446 Value = (double)Num/Den;
    [all...]
  /external/llvm/lib/Object/
MachOObjectFile.cpp 588 uint32_t Num;
591 Num = Sect.nreloc;
594 Num = Sect.nreloc;
599 Ret.d.b = Num;
    [all...]
  /external/llvm/lib/Target/AMDGPU/
AMDILCFGStructurizer.cpp     [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonCommonGEP.cpp     [all...]
  /external/llvm/lib/Target/SystemZ/AsmParser/
SystemZAsmParser.cpp 77 // LLVM register Num, which has kind Kind. In some ways it might be
88 unsigned Num;
146 createReg(RegisterKind Kind, unsigned Num, SMLoc StartLoc, SMLoc EndLoc) {
149 Op->Reg.Num = Num;
153 createAccessReg(unsigned Num, SMLoc StartLoc, SMLoc EndLoc) {
155 Op->AccessReg = Num;
204 return Reg.Num;
361 unsigned Num;
514 if (Name.substr(1).getAsInteger(10, Reg.Num))
    [all...]
  /prebuilts/gdb/darwin-x86/include/python2.7/
Python-ast.h 277 } Num;
492 #define Num(a0, a1, a2, a3) _Py_Num(a0, a1, a2, a3)
  /prebuilts/gdb/linux-x86/include/python2.7/
Python-ast.h 277 } Num;
492 #define Num(a0, a1, a2, a3) _Py_Num(a0, a1, a2, a3)
  /prebuilts/python/darwin-x86/2.7.5/include/python2.7/
Python-ast.h 277 } Num;
492 #define Num(a0, a1, a2, a3) _Py_Num(a0, a1, a2, a3)

Completed in 556 milliseconds

1 2