| /external/llvm/unittests/Support/ |
| D | ArrayRecyclerTest.cpp | 20 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/ |
| D | state.h | 122 #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/llvm/lib/Support/ |
| D | BranchProbability.cpp | 28 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) { in scale() argument
32 if (!Num || D == N) in scale()
33 return Num; in scale()
36 uint64_t ProductHigh = (Num >> 32) * N; in scale()
37 uint64_t ProductLow = (Num & UINT32_MAX) * N; in scale()
67 uint64_t BranchProbability::scale(uint64_t Num) const { in scale()
68 return ::scale(Num, N, D); in scale()
71 uint64_t BranchProbability::scaleByInverse(uint64_t Num) const { in scaleByInverse()
72 return ::scale(Num, D, N); in scaleByInverse()
|
| D | YAMLTraits.cpp | 705 uint32_t Num = Val; in output() local
706 Out << Num; in output()
767 int32_t Num = Val; in output() local
768 Out << Num; in output()
851 uint8_t Num = Val; in output() local
852 Out << format("0x%02X", Num); in output()
866 uint16_t Num = Val; in output() local
867 Out << format("0x%04X", Num); in output()
881 uint32_t Num = Val; in output() local
882 Out << format("0x%08X", Num); in output()
[all …]
|
| /external/clang/test/CXX/temp/temp.decls/temp.friend/ |
| D | p1.cpp | 4 template <typename T> struct Num { struct
8 Num(T value) : value_(value) {} in Num() function
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/include/llvm/ProfileData/ |
| D | SampleProf.h | 171 void addTotalSamples(unsigned Num) { TotalSamples += Num; }
172 void addHeadSamples(unsigned Num) { TotalHeadSamples += Num; }
173 void addBodySamples(int LineOffset, unsigned Discriminator, unsigned Num) {
179 if (Num == 0)
180 Num = 1;
181 BodySamples[LineLocation(LineOffset, Discriminator)].addSamples(Num);
184 std::string FName, unsigned Num) {
187 Num);
|
| /external/llvm/test/Transforms/Reassociate/ |
| D | looptest.ll | 3 ; 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/test/CodeGen/Generic/ |
| D | fwdtwice.ll | 15 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/CodeGen/X86/ |
| D | stackmap-liveness.ll | 12 ; 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 …]
|
| D | patchpoint-invoke.ll | 51 ; Num Functions
53 ; Num LargeConstants
55 ; Num Callsites
|
| /external/llvm/lib/Target/SystemZ/AsmParser/ |
| D | SystemZAsmParser.cpp | 84 unsigned Num; member
142 createReg(RegisterKind Kind, unsigned Num, SMLoc StartLoc, SMLoc EndLoc) { in createReg() argument
145 Op->Reg.Num = Num; in createReg()
149 createAccessReg(unsigned Num, SMLoc StartLoc, SMLoc EndLoc) { in createAccessReg() argument
151 Op->AccessReg = Num; in createAccessReg()
199 return Reg.Num; in getReg()
336 unsigned Num; member
474 if (Name.substr(1).getAsInteger(10, Reg.Num)) in parseRegister()
478 if (Prefix == 'r' && Reg.Num < 16) in parseRegister()
480 else if (Prefix == 'f' && Reg.Num < 16) in parseRegister()
[all …]
|
| /external/llvm/utils/TableGen/ |
| D | InstrInfoEmitter.cpp | 55 void emitRecord(const CodeGenInstruction &Inst, unsigned Num,
76 unsigned Num, raw_ostream &OS) { in PrintDefList() argument
77 OS << "static const uint16_t ImplicitList" << Num << "[] = { "; in PrintDefList()
388 unsigned Num = 0; in run() local
393 emitRecord(*Inst, Num++, InstrInfo, EmittedLists, OperandInfoIDs, OS); in run()
404 Num = 0; in run()
407 if (Num % 8 == 0) in run()
410 ++Num; in run()
464 void InstrInfoEmitter::emitRecord(const CodeGenInstruction &Inst, unsigned Num, in emitRecord() argument
476 OS << Num << ",\t" << MinOperands << ",\t" in emitRecord()
[all …]
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | BlotMapVector.h | 53 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/ |
| D | CounterTest.cpp | 6 int Num = 0; in TestOneInput() local
9 Num++; in TestOneInput()
10 if (Num >= 4) { in TestOneInput()
|
| /external/llvm/lib/CodeGen/ |
| D | SplitKit.h | 111 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/CodeGen/AArch64/ |
| D | stackmap-liveness.ll | 11 ; Num Functions
13 ; Num LargeConstants
15 ; Num Callsites
29 ; Num LiveOut Entries: 1
|
| /external/llvm/lib/Target/PowerPC/ |
| D | PPCMachineFunctionInfo.h | 184 void setVarArgsNumGPR(unsigned Num) { VarArgsNumGPR = Num; } in setVarArgsNumGPR() argument
187 void setVarArgsNumFPR(unsigned Num) { VarArgsNumFPR = Num; } in setVarArgsNumFPR() argument
|
| /external/e2fsprogs/resize/ |
| D | test_extent.in | 10 # 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/AArch64/ |
| D | AArch64BranchRelaxation.cpp | 113 unsigned Num = MBB.getNumber(); in verify() local
114 assert(BlockInfo[Num].Offset % (1u << Align) == 0); in verify()
115 assert(!Num || BlockInfo[PrevNum].postOffset() <= BlockInfo[Num].Offset); in verify()
116 PrevNum = Num; in verify()
195 unsigned Num = MBB.getNumber(); in adjustBlockOffsets() local
196 if (!Num) // block zero is never changed from offset zero. in adjustBlockOffsets()
201 BlockInfo[Num].Offset = BlockInfo[PrevNum].postOffset(LogAlign); in adjustBlockOffsets()
202 PrevNum = Num; in adjustBlockOffsets()
|
| /external/llvm/lib/Target/NVPTX/ |
| D | NVPTXAsmPrinter.h | 101 unsigned addBytes(unsigned char *Ptr, int Num, int Bytes) { in addBytes() argument
102 assert((curpos + Num) <= size); in addBytes()
104 for (int i = 0; i < Num; ++i) { in addBytes()
108 for (int i = Num; i < Bytes; ++i) { in addBytes()
114 unsigned addZeros(int Num) { in addZeros() argument
115 assert((curpos + Num) <= size); in addZeros()
116 for (int i = 0; i < Num; ++i) { in addZeros()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonRegisterInfo.td | 18 field bits<5> Num;
26 field bits<5> Num;
35 let Num = num;
40 let Num = num;
47 let Num = num;
53 let Num = num;
60 let Num = num;
67 let Num = num;
73 let Num = !cast<bits<5>>(num);
|
| /external/llvm/include/llvm/ADT/ |
| D | DenseMap.h | 364 void setNumEntries(unsigned Num) { in setNumEntries() argument
365 static_cast<DerivedT *>(this)->setNumEntries(Num); in setNumEntries()
376 void setNumTombstones(unsigned Num) { in setNumTombstones() argument
377 static_cast<DerivedT *>(this)->setNumTombstones(Num); in setNumTombstones()
669 void setNumEntries(unsigned Num) { in setNumEntries() argument
670 NumEntries = Num; in setNumEntries()
676 void setNumTombstones(unsigned Num) { in setNumTombstones() argument
677 NumTombstones = Num; in setNumTombstones()
688 bool allocateBuckets(unsigned Num) { in allocateBuckets() argument
689 NumBuckets = Num; in allocateBuckets()
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | GCMetadata.h | 63 int Num; ///< Usually a frame index. member
68 GCRoot(int N, const Constant *MD) : Num(N), StackOffset(-1), Metadata(MD) {} in GCRoot()
111 void addStackRoot(int Num, const Constant *Metadata) { in addStackRoot() argument
112 Roots.push_back(GCRoot(Num, Metadata)); in addStackRoot()
|
| /external/clang/test/CodeGen/ |
| D | 2002-07-14-MiscTests3.c | 32 char PtrFunc2(FuncPtr FuncTab[30], int Num) { in PtrFunc2() argument
33 return FuncTab[Num]('b'); in PtrFunc2()
111 int SumArray(int Array[], int Num) { in SumArray() argument
113 for (i = 0; i < Num; ++i) in SumArray()
|
| /external/mesa3d/src/mesa/program/ |
| D | prog_optimize.c | 850 GLuint Num; member
858 list->Intervals[list->Num++] = *inv; in append_interval()
867 GLint i = list->Num - 1; in insert_interval_by_end()
873 list->Num++; in insert_interval_by_end()
878 for (i = 0; i + 1 < list->Num; i++) { in insert_interval_by_end()
892 for (k = 0; k < list->Num; k++) { in remove_interval()
897 while (k < list->Num - 1) { in remove_interval()
901 list->Num--; in remove_interval()
927 qsort(list->Intervals, list->Num, sizeof(struct interval), compare_start); in sort_interval_list_by_start()
931 for (i = 0; i + 1 < list->Num; i++) { in sort_interval_list_by_start()
[all …]
|