Searched refs:Num (Results 1 - 25 of 134) sorted by relevance

123456

/external/llvm/lib/Fuzzer/test/
H A DCounterTest.cpp9 int Num = 0; local
12 Num++;
13 if (Num >= 4) {
/external/llvm/unittests/Support/
H A DArrayRecyclerTest.cpp20 int Num; member in struct:__anon13802::Object
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/bison/src/
H A Dstate.h119 TRANSITIONS->states[Num]? Can be a token (amongst which the error
122 #define TRANSITION_SYMBOL(Transitions, Num) \
123 (Transitions->states[Num]->accessing_symbol)
125 /* Is the TRANSITIONS->states[Num] a shift? (as opposed to gotos). */
127 #define TRANSITION_IS_SHIFT(Transitions, Num) \
128 (ISTOKEN (TRANSITION_SYMBOL (Transitions, Num)))
130 /* Is the TRANSITIONS->states[Num] a goto?. */
132 #define TRANSITION_IS_GOTO(Transitions, Num) \
133 (!TRANSITION_IS_SHIFT (Transitions, Num))
135 /* Is the TRANSITIONS->states[Num] labelle
[all...]
/external/llvm/lib/Support/
H A DBranchProbability.cpp66 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) { argument
73 if (!Num || D == N)
74 return Num;
76 // Split Num into upper and lower parts to multiply, then recombine.
77 uint64_t ProductHigh = (Num >> 32) * N;
78 uint64_t ProductLow = (Num & UINT32_MAX) * N;
108 uint64_t BranchProbability::scale(uint64_t Num) const {
109 return ::scale<D>(Num, N, D);
112 uint64_t BranchProbability::scaleByInverse(uint64_t Num) const {
113 return ::scale<0>(Num,
[all...]
/external/clang/test/CXX/temp/temp.decls/temp.friend/
H A Dp1.cpp4 template <typename T> struct Num { struct in namespace:test0
8 Num(T value) : value_(value) {} function in struct:test0::Num
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
[all...]
/external/swiftshader/third_party/LLVM/lib/Target/PowerPC/
H A DPPCMachineFunctionInfo.h123 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } argument
126 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } argument
/external/llvm/lib/DebugInfo/CodeView/
H A DRecordSerialization.cpp34 std::error_code llvm::codeview::consume(ArrayRef<uint8_t> &Data, APSInt &Num) { argument
42 Num = APSInt(APInt(/*numBits=*/16, Short, /*isSigned=*/false),
50 Num = APSInt(APInt(/*numBits=*/8,
59 Num = APSInt(APInt(/*numBits=*/16,
68 Num = APSInt(APInt(/*numBits=*/16,
77 Num = APSInt(APInt(/*numBits=*/32,
86 Num = APSInt(APInt(/*numBits=*/32,
95 Num = APSInt(APInt(/*numBits=*/64,
104 Num = APSInt(APInt(/*numBits=*/64,
114 std::error_code llvm::codeview::consume(StringRef &Data, APSInt &Num) { argument
122 consume_numeric(ArrayRef<uint8_t> &Data, uint64_t &Num) argument
[all...]
/external/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h53 size_t Num = Vector.size(); local
54 Pair.first->second = Num;
56 return Vector[Num].second;
65 size_t Num = Vector.size(); local
66 Pair.first->second = Num;
68 return std::make_pair(Vector.begin() + Num, true);
/external/swiftshader/third_party/LLVM/include/llvm/Support/
H A DAllocator.h42 T *Allocate(size_t Num) { argument
43 return static_cast<T*>(malloc(sizeof(T)*Num));
162 T *Allocate(size_t Num) { argument
163 return static_cast<T*>(Allocate(Num * sizeof(T), AlignOf<T>::Alignment));
169 T *Allocate(size_t Num, size_t Alignment) { argument
172 return static_cast<T*>(Allocate(Num * EltSize, Alignment));
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DSplitKit.h110 SlotIndex computeLastSplitPoint(unsigned Num);
139 /// in the basic block numbered Num.
140 SlotIndex getLastSplitPoint(unsigned Num) { argument
142 if (LastSplitPoint[Num].first.isValid() &&
143 !LastSplitPoint[Num].second.isValid())
144 return LastSplitPoint[Num].first;
145 return computeLastSplitPoint(Num);
/external/llvm/lib/Target/PowerPC/
H A DPPCMachineFunctionInfo.h189 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } argument
192 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } argument
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
H A DGCMetadata.h72 int Num; //< Usually a frame index. member in struct:llvm::GCRoot
76 GCRoot(int N, const Constant *MD) : Num(N), StackOffset(-1), Metadata(MD) {}
117 /// addStackRoot - Registers a root that lives on the stack. Num is the
120 void addStackRoot(int Num, const Constant *Metadata) { argument
121 Roots.push_back(GCRoot(Num, Metadata));
124 /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
/external/llvm/include/llvm/ProfileData/
H A DSampleProf.h186 sampleprof_error addTotalSamples(uint64_t Num, uint64_t Weight = 1) { argument
189 SaturatingMultiplyAdd(Num, Weight, TotalSamples, &Overflowed);
193 sampleprof_error addHeadSamples(uint64_t Num, uint64_t Weight = 1) { argument
196 SaturatingMultiplyAdd(Num, Weight, TotalHeadSamples, &Overflowed);
201 uint64_t Num, uint64_t Weight = 1) {
203 Num, Weight);
208 uint64_t Num, uint64_t Weight = 1) {
210 FName, Num, Weight);
200 addBodySamples(uint32_t LineOffset, uint32_t Discriminator, uint64_t Num, uint64_t Weight = 1) argument
205 addCalledTargetSamples(uint32_t LineOffset, uint32_t Discriminator, const std::string &FName, uint64_t Num, uint64_t Weight = 1) argument
/external/llvm/lib/Analysis/
H A DInstCount.cpp32 STATISTIC(Num ## OPCODE ## Inst, "Number of " #OPCODE " insts");
45 void visit##OPCODE(CLASS &) { ++Num##OPCODE##Inst; ++TotalInsts; }
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DInstCount.cpp31 STATISTIC(Num ## OPCODE ## Inst, "Number of " #OPCODE " insts");
44 void visit##OPCODE(CLASS &) { ++Num##OPCODE##Inst; ++TotalInsts; }
/external/llvm/lib/Target/SystemZ/AsmParser/
H A DSystemZAsmParser.cpp77 // LLVM register Num, which has kind Kind. In some ways it might be
88 unsigned Num; member in struct:__anon13274::SystemZOperand::RegOp
146 createReg(RegisterKind Kind, unsigned Num, SMLoc StartLoc, SMLoc EndLoc) { argument
149 Op->Reg.Num = Num;
153 createAccessReg(unsigned Num, SMLoc StartLoc, SMLoc EndLoc) { argument
155 Op->AccessReg = Num;
204 return Reg.Num;
361 unsigned Num; member in struct:__anon13274::SystemZAsmParser::Register
517 if (Name.substr(1).getAsInteger(10, Reg.Num))
[all...]
/external/llvm/utils/TableGen/
H A DInstrInfoEmitter.cpp55 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
76 unsigned Num, raw_ostream &OS) {
77 OS << "static const MCPhysReg ImplicitList" << Num << "[] = { "; local
385 unsigned Num = 0; local
390 emitRecord(*Inst, Num++, InstrInfo, EmittedLists, OperandInfoIDs, OS);
401 Num = 0;
404 if (Num % 8 == 0)
407 ++Num;
460 void InstrInfoEmitter::emitRecord(const CodeGenInstruction &Inst, unsigned Num, argument
472 OS << Num << ",\
75 PrintDefList(const std::vector<Record*> &Uses, unsigned Num, raw_ostream &OS) argument
580 unsigned Num = 0; local
583 OS << " INSTRUCTION_LIST_END = " << Num << "\\n"; local
590 OS << " SCHED_LIST_END = " << Num << "\\n"; local
[all...]
/external/clang/test/CodeGen/
H A D2002-07-14-MiscTests3.c32 char PtrFunc2(FuncPtr FuncTab[30], int Num) { argument
33 return FuncTab[Num]('b');
111 int SumArray(int Array[], int Num) { argument
113 for (i = 0; i < Num; ++i)
/external/llvm/include/llvm/CodeGen/
H A DGCMetadata.h64 int Num; ///< Usually a frame index. member in struct:llvm::GCRoot
69 GCRoot(int N, const Constant *MD) : Num(N), StackOffset(-1), Metadata(MD) {}
109 /// addStackRoot - Registers a root that lives on the stack. Num is the
112 void addStackRoot(int Num, const Constant *Metadata) { argument
113 Roots.push_back(GCRoot(Num, Metadata));
121 /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
/external/swiftshader/third_party/LLVM/utils/TableGen/
H A DInstrInfoEmitter.h45 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
/external/llvm/include/llvm/DebugInfo/CodeView/
H A DStreamWriter.h39 template <typename T> Error writeEnum(T Num) { argument
41 static_cast<typename std::underlying_type<T>::type>(Num));
/external/llvm/lib/CodeGen/
H A DSplitKit.h62 unsigned Num = MBB.getNumber(); local
64 if (LastInsertPoint[Num].first.isValid() &&
65 !LastInsertPoint[Num].second.isValid())
66 return LastInsertPoint[Num].first;
215 SlotIndex getLastSplitPoint(unsigned Num) { argument
216 return IPA.getLastInsertPoint(*CurLI, *MF.getBlockNumbered(Num));
/external/llvm/lib/Target/NVPTX/
H A DNVPTXAsmPrinter.h110 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) { argument
111 assert((curpos + Num) <= size);
113 for (int i = 0; i < Num; ++i) {
117 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) {
/external/llvm/lib/Target/AArch64/
H A DAArch64BranchRelaxation.cpp124 unsigned Num = MBB.getNumber(); local
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(); local
207 if (!Num) // block zero is never changed from offset zero.
212 BlockInfo[Num].Offset = BlockInfo[PrevNum].postOffset(LogAlign);
213 PrevNum = Num;
/external/eigen/unsupported/Eigen/src/EulerAngles/
H A DEulerSystem.h22 template <int Num, bool IsPositive = (Num > 0)>
25 enum { value = Num };
28 template <int Num>
29 struct Abs<Num, false>
31 enum { value = -Num };

Completed in 720 milliseconds

123456