Home
last modified time | relevance | path

Searched refs:Num (Results 1 – 25 of 132) sorted by relevance

123456

/external/llvm/unittests/Support/
DArrayRecyclerTest.cpp20 int Num; member
57 A1[0].Num = 21; in TEST()
58 A1[7].Num = 17; in TEST()
61 A2[0].Num = 121; in TEST()
62 A2[7].Num = 117; in TEST()
65 A3[0].Num = 221; in TEST()
66 A3[7].Num = 217; in TEST()
68 EXPECT_EQ(21, A1[0].Num); in TEST()
69 EXPECT_EQ(17, A1[7].Num); in TEST()
70 EXPECT_EQ(121, A2[0].Num); in TEST()
[all …]
/external/bison/src/
Dstate.h122 #define TRANSITION_SYMBOL(Transitions, Num) \ argument
123 (Transitions->states[Num]->accessing_symbol)
127 #define TRANSITION_IS_SHIFT(Transitions, Num) \ argument
128 (ISTOKEN (TRANSITION_SYMBOL (Transitions, Num)))
132 #define TRANSITION_IS_GOTO(Transitions, Num) \ argument
133 (!TRANSITION_IS_SHIFT (Transitions, Num))
137 #define TRANSITION_IS_ERROR(Transitions, Num) \ argument
138 (TRANSITION_SYMBOL (Transitions, Num) == errtoken->number)
143 #define TRANSITION_DISABLE(Transitions, Num) \ argument
144 (Transitions->states[Num] = NULL)
[all …]
/external/clang/test/CXX/temp/temp.decls/temp.friend/
Dp1.cpp4 template <typename T> struct Num { struct
8 Num(T value) : value_(value) {} in Num() argument
15 friend Num operator*(const Num &a, const Rep &n) { in operator *() argument
16 Num x = 0; in operator *()
23 friend Num operator+(const Num &a, const Num &b) { in operator +()
27 Num& operator+=(const Num& b) { in operator +=() argument
46 Num<int> left = -1; in calc1()
47 Num<int> right = 1; in calc1()
48 Num<int> result = left + right; in calc1()
53 Num<int> x = 3; in calc2()
[all …]
/external/llvm/lib/Support/
DBranchProbability.cpp66 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) { in scale() argument
73 if (!Num || D == N) in scale()
74 return Num; in scale()
77 uint64_t ProductHigh = (Num >> 32) * N; in scale()
78 uint64_t ProductLow = (Num & UINT32_MAX) * N; in scale()
108 uint64_t BranchProbability::scale(uint64_t Num) const { in scale()
109 return ::scale<D>(Num, N, D); in scale()
112 uint64_t BranchProbability::scaleByInverse(uint64_t Num) const { in scaleByInverse()
113 return ::scale<0>(Num, D, N); in scaleByInverse()
DYAMLTraits.cpp771 uint32_t Num = Val; in output() local
772 Out << Num; in output()
833 int32_t Num = Val; in output() local
834 Out << Num; in output()
917 uint8_t Num = Val; in output() local
918 Out << format("0x%02X", Num); in output()
932 uint16_t Num = Val; in output() local
933 Out << format("0x%04X", Num); in output()
947 uint32_t Num = Val; in output() local
948 Out << format("0x%08X", Num); in output()
[all …]
/external/llvm/test/Transforms/Reassociate/
Dlooptest.ll3 ; void test(unsigned Num, int *Array) {
6 ; for (i = 0; i != Num; ++i)
7 ; for (j = 0; j != Num; ++j)
8 ; for (k = 0; k != Num; ++k)
22 define void @test(i32 %Num, i32* %Array) {
24 %cond221 = icmp eq i32 0, %Num ; <i1> [#uses=3]
39 %cond224 = icmp ne i32 %reg118, %Num ; <i1> [#uses=1]
43 %cond225 = icmp ne i32 %reg119, %Num ; <i1> [#uses=1]
47 %cond226 = icmp ne i32 %reg120, %Num ; <i1> [#uses=1]
/external/llvm/include/llvm/ProfileData/
DSampleProf.h216 sampleprof_error addTotalSamples(uint64_t Num, uint64_t Weight = 1) {
219 Num = SaturatingMultiply(Num, Weight, &Overflowed);
223 TotalSamples = SaturatingAdd(TotalSamples, Num, &Overflowed);
229 sampleprof_error addHeadSamples(uint64_t Num, uint64_t Weight = 1) {
232 Num = SaturatingMultiply(Num, Weight, &Overflowed);
236 TotalHeadSamples = SaturatingAdd(TotalHeadSamples, Num, &Overflowed);
243 uint64_t Num, uint64_t Weight = 1) {
245 Num, Weight);
249 std::string FName, uint64_t Num,
252 FName, Num, Weight);
/external/llvm/test/CodeGen/Generic/
Dfwdtwice.ll15 define i32 @SumArray(i32 %Num) {
16 %Num.upgrd.1 = alloca i32 ; <i32*> [#uses=2]
20 store i32 %Num, i32* %Num.upgrd.1
21 %reg108 = load i32, i32* %Num.upgrd.1 ; <i32> [#uses=1]
/external/llvm/test/tools/llvm-readobj/
Delf-gnuhash.test22 I386-NEXT: Num Buckets: 3
24 I386-NEXT: Num Mask Words: 1
33 X86_64-NEXT: Num Buckets: 3
35 X86_64-NEXT: Num Mask Words: 1
44 PPC-NEXT: Num Buckets: 3
46 PPC-NEXT: Num Mask Words: 1
55 PPC64-NEXT: Num Buckets: 3
57 PPC64-NEXT: Num Mask Words: 1
/external/llvm/lib/Target/SystemZ/AsmParser/
DSystemZAsmParser.cpp88 unsigned Num; member
146 createReg(RegisterKind Kind, unsigned Num, SMLoc StartLoc, SMLoc EndLoc) { in createReg() argument
149 Op->Reg.Num = Num; in createReg()
153 createAccessReg(unsigned Num, SMLoc StartLoc, SMLoc EndLoc) { in createAccessReg() argument
155 Op->AccessReg = Num; in createAccessReg()
204 return Reg.Num; in getReg()
361 unsigned Num; member
514 if (Name.substr(1).getAsInteger(10, Reg.Num)) in parseRegister()
518 if (Prefix == 'r' && Reg.Num < 16) in parseRegister()
520 else if (Prefix == 'f' && Reg.Num < 16) in parseRegister()
[all …]
/external/llvm/test/CodeGen/X86/
Dstackmap-liveness.ll12 ; Num Functions
14 ; Num LargeConstants
16 ; Num Callsites
34 ; Num LiveOut Entries: 0
45 ; Num LiveOut Entries: 1
65 ; Num LiveOut Entries: 0
76 ; Num LiveOut Entries: 5
109 ; Num LiveOut Entries: 0
120 ; Num LiveOut Entries: 2
146 ; Num LiveOut Entries: 0
[all …]
/external/llvm/utils/TableGen/
DInstrInfoEmitter.cpp55 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
76 unsigned Num, raw_ostream &OS) { in PrintDefList() argument
77 OS << "static const MCPhysReg ImplicitList" << Num << "[] = { "; in PrintDefList()
387 unsigned Num = 0; in run() local
392 emitRecord(*Inst, Num++, InstrInfo, EmittedLists, OperandInfoIDs, OS); in run()
403 Num = 0; in run()
406 if (Num % 8 == 0) in run()
409 ++Num; in run()
462 void InstrInfoEmitter::emitRecord(const CodeGenInstruction &Inst, unsigned Num, in emitRecord() argument
474 OS << Num << ",\t" << MinOperands << ",\t" in emitRecord()
[all …]
/external/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h53 size_t Num = Vector.size();
54 Pair.first->second = Num;
56 return Vector[Num].second;
65 size_t Num = Vector.size(); in insert() local
66 Pair.first->second = Num; in insert()
68 return std::make_pair(Vector.begin() + Num, true); in insert()
/external/llvm/lib/Fuzzer/test/
DCounterTest.cpp6 int Num = 0; in LLVMFuzzerTestOneInput() local
9 Num++; in LLVMFuzzerTestOneInput()
10 if (Num >= 4) { in LLVMFuzzerTestOneInput()
/external/clang/test/Profile/Inputs/
Dmax-function-count.proftext4 # Num Counters:
13 # Num Counters:
21 # Num Counters:
/external/llvm/lib/CodeGen/
DSplitKit.h111 SlotIndex computeLastSplitPoint(unsigned Num);
141 SlotIndex getLastSplitPoint(unsigned Num) { in getLastSplitPoint() argument
143 if (LastSplitPoint[Num].first.isValid() && in getLastSplitPoint()
144 !LastSplitPoint[Num].second.isValid()) in getLastSplitPoint()
145 return LastSplitPoint[Num].first; in getLastSplitPoint()
146 return computeLastSplitPoint(Num); in getLastSplitPoint()
/external/llvm/test/tools/llvm-profdata/Inputs/
Dvp-truncate.proftext4 # Num Counters:
13 # Num Counters:
22 # Num Counters:
Dvp-malform.proftext4 # Num Counters:
13 # Num Counters:
22 # Num Counters:
/external/llvm/test/CodeGen/AArch64/
Dstackmap-liveness.ll11 ; Num Functions
13 ; Num LargeConstants
15 ; Num Callsites
29 ; Num LiveOut Entries: 1
/external/llvm/lib/Target/PowerPC/
DPPCMachineFunctionInfo.h184 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } in setVarArgsNumGPR() argument
187 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } in setVarArgsNumFPR() argument
/external/llvm/test/Object/
Dstackmap-dump.test4 CHECK-NEXT: Num Functions: 1
6 CHECK-NEXT: Num Constants: 1
8 CHECK-NEXT: Num Records: 1
/external/e2fsprogs/resize/
Dtest_extent.in10 # Num=3, Size=10, Cursor=0, Sorted=1
17 # Num=3, Size=10, Cursor=0, Sorted=1
53 # Num=5, Size=10, Cursor=0, Sorted=1
/external/llvm/lib/Target/NVPTX/
DNVPTXAsmPrinter.h110 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) { in addBytes() argument
111 assert((curpos + Num) <= size); in addBytes()
113 for (int i = 0; i < Num; ++i) { in addBytes()
117 for (int i = Num; i < Bytes; ++i) { in addBytes()
123 unsigned addZeros(int Num) { in addZeros() argument
124 assert((curpos + Num) <= size); in addZeros()
125 for (int i = 0; i < Num; ++i) { in addZeros()
/external/llvm/include/llvm/ADT/
DDenseMap.h354 void setNumEntries(unsigned Num) { in setNumEntries() argument
355 static_cast<DerivedT *>(this)->setNumEntries(Num); in setNumEntries()
366 void setNumTombstones(unsigned Num) { in setNumTombstones() argument
367 static_cast<DerivedT *>(this)->setNumTombstones(Num); in setNumTombstones()
659 void setNumEntries(unsigned Num) { in setNumEntries() argument
660 NumEntries = Num; in setNumEntries()
666 void setNumTombstones(unsigned Num) { in setNumTombstones() argument
667 NumTombstones = Num; in setNumTombstones()
678 bool allocateBuckets(unsigned Num) { in allocateBuckets() argument
679 NumBuckets = Num; in allocateBuckets()
[all …]
/external/llvm/lib/Target/AArch64/
DAArch64BranchRelaxation.cpp124 unsigned Num = MBB.getNumber(); in verify() local
125 assert(BlockInfo[Num].Offset % (1u << Align) == 0); in verify()
126 assert(!Num || BlockInfo[PrevNum].postOffset() <= BlockInfo[Num].Offset); in verify()
127 PrevNum = Num; in verify()
206 unsigned Num = MBB.getNumber(); in adjustBlockOffsets() local
207 if (!Num) // block zero is never changed from offset zero. in adjustBlockOffsets()
212 BlockInfo[Num].Offset = BlockInfo[PrevNum].postOffset(LogAlign); in adjustBlockOffsets()
213 PrevNum = Num; in adjustBlockOffsets()

123456