| /external/llvm-project/clang/test/Profile/Inputs/ |
| D | cxx-hash-v2.proftext | 4 # Num Counters:
13 # Num Counters:
22 # Num Counters:
31 # Num Counters:
40 # Num Counters:
50 # Num Counters:
62 # Num Counters:
74 # Num Counters:
83 # Num Counters:
93 # Num Counters:
[all …]
|
| /external/llvm-project/llvm/lib/TextAPI/MachO/ |
| D | PackedVersion.cpp | 35 unsigned long long Num; in parse32() local
36 if (getAsUnsignedInteger(Parts[0], 10, Num)) in parse32()
39 if (Num > UINT16_MAX) in parse32()
42 Version = Num << 16; in parse32()
45 if (getAsUnsignedInteger(Parts[i], 10, Num)) in parse32()
48 if (Num > UINT8_MAX) in parse32()
51 Version |= (Num << ShiftNum); in parse32()
70 unsigned long long Num; in parse64() local
71 if (getAsUnsignedInteger(Parts[0], 10, Num)) in parse64()
74 if (Num > 0xFFFFFFULL) in parse64()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/TextAPI/MachO/ |
| D | PackedVersion.cpp | 35 unsigned long long Num; in parse32() local
36 if (getAsUnsignedInteger(Parts[0], 10, Num)) in parse32()
39 if (Num > UINT16_MAX) in parse32()
42 Version = Num << 16; in parse32()
45 if (getAsUnsignedInteger(Parts[i], 10, Num)) in parse32()
48 if (Num > UINT8_MAX) in parse32()
51 Version |= (Num << ShiftNum); in parse32()
70 unsigned long long Num; in parse64() local
71 if (getAsUnsignedInteger(Parts[0], 10, Num)) in parse64()
74 if (Num > 0xFFFFFFULL) in parse64()
[all …]
|
| /external/llvm-project/llvm/test/tools/dsymutil/X86/ |
| D | remarks-linking-bundle.test | 15 CHECK: <Remark Num
16 CHECK: <Remark Num
17 CHECK: <Remark Num
18 CHECK: <Remark Num
19 CHECK: <Remark Num
20 CHECK: <Remark Num
21 CHECK: <Remark Num
22 CHECK: <Remark Num
23 CHECK: <Remark Num
24 CHECK: <Remark Num
[all …]
|
| D | remarks-linking-archive.text | 15 CHECK: <Remark Num
16 CHECK: <Remark Num
17 CHECK: <Remark Num
18 CHECK: <Remark Num
19 CHECK: <Remark Num
20 CHECK: <Remark Num
21 CHECK: <Remark Num
22 CHECK: <Remark Num
23 CHECK: <Remark Num
24 CHECK: <Remark Num
[all …]
|
| /external/llvm-project/llvm/test/Transforms/PGOProfile/Inputs/ |
| D | cspgo.proftext | 6 # Num Counters:
15 # Num Counters:
24 # Num Counters:
32 # Num Counters:
40 # Num Counters:
49 # Num Counters:
58 # Num Counters:
75 # Num Counters:
84 # Num Counters:
96 # Num Counters:
[all …]
|
| D | thinlto_cs.proftext | 6 # Num Counters:
14 # Num Counters:
23 # Num Counters:
32 # Num Counters:
41 # Num Counters:
49 # Num Counters:
57 # Num Counters:
68 # Num Counters:
|
| /external/llvm-project/llvm/unittests/Support/ |
| D | ArrayRecyclerTest.cpp | 19 int Num; member
56 A1[0].Num = 21; in TEST()
57 A1[7].Num = 17; in TEST()
60 A2[0].Num = 121; in TEST()
61 A2[7].Num = 117; in TEST()
64 A3[0].Num = 221; in TEST()
65 A3[7].Num = 217; in TEST()
67 EXPECT_EQ(21, A1[0].Num); in TEST()
68 EXPECT_EQ(17, A1[7].Num); in TEST()
69 EXPECT_EQ(121, A2[0].Num); in TEST()
[all …]
|
| /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/llvm-project/llvm/lib/Target/AMDGPU/ |
| D | GCNMinRegStrategy.cpp | 79 unsigned findMax(unsigned Num, Calc C);
121 unsigned GCNMinRegScheduler::findMax(unsigned Num, Calc C) { in findMax() argument
122 assert(!RQ.empty() && Num <= RQ.size()); in findMax()
128 for (auto I = RQ.begin(); Num; --Num) { in findMax()
148 unsigned Num = RQ.size(); in pickCandidate() local
149 if (Num == 1) break; in pickCandidate()
151 LLVM_DEBUG(dbgs() << "\nSelecting max priority candidates among " << Num in pickCandidate()
153 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
154 if (Num == 1) break; in pickCandidate()
157 << Num << '\n'); in pickCandidate()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
| D | GCNMinRegStrategy.cpp | 72 unsigned findMax(unsigned Num, Calc C);
114 unsigned GCNMinRegScheduler::findMax(unsigned Num, Calc C) { in findMax() argument
115 assert(!RQ.empty() && Num <= RQ.size()); in findMax()
121 for (auto I = RQ.begin(); Num; --Num) { in findMax()
141 unsigned Num = RQ.size(); in pickCandidate() local
142 if (Num == 1) break; in pickCandidate()
144 LLVM_DEBUG(dbgs() << "\nSelecting max priority candidates among " << Num in pickCandidate()
146 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
147 if (Num == 1) break; in pickCandidate()
150 << Num << '\n'); in pickCandidate()
[all …]
|
| /external/llvm-project/llvm/test/tools/llvm-profdata/Inputs/ |
| D | multiple-profdata-merge.proftext | 6 # Num Counters:
17 # Num Counters:
30 # Num Counters:
40 # Num Counters:
53 # Num Counters:
61 # Num Counters:
69 # Num Counters:
77 # Num Counters:
85 # Num Counters:
93 # Num Counters:
[all …]
|
| /external/llvm-project/pstl/test/std/algorithms/alg.sorting/ |
| D | partial_sort.pass.cpp | 26 struct Num struct
30 Num() { ++count_val; } in Num() argument
31 Num(T v) : val(v) { ++count_val; } in Num() function
32 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() function
33 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() function
34 ~Num() { --count_val; } in ~Num() argument
35 Num<T>&
36 operator=(const Num<T>& v) in operator =() argument
43 operator<(const Num<T>& v) const in operator <() argument
138 test_partial_sort<Num<float32_t>>([](Num<float32_t> x, Num<float32_t> y) { return x < y; }); in main()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/ |
| D | SystemZSchedule.td | 37 foreach Num = ["", "2", "3", "4", "5", "6"] in {
39 def "FXa"#Num : SchedWrite;
40 def "FXb"#Num : SchedWrite;
41 def "FXU"#Num : SchedWrite;
43 def "LSU"#Num : SchedWrite;
45 def "VecBF"#Num : SchedWrite;
46 def "VecDF"#Num : SchedWrite;
47 def "VecDFX"#Num : SchedWrite;
48 def "VecMul"#Num : SchedWrite;
49 def "VecStr"#Num : SchedWrite;
[all …]
|
| /external/llvm-project/llvm/lib/Target/SystemZ/ |
| D | SystemZSchedule.td | 37 foreach Num = ["", "2", "3", "4", "5", "6"] in {
39 def "FXa"#Num : SchedWrite;
40 def "FXb"#Num : SchedWrite;
41 def "FXU"#Num : SchedWrite;
43 def "LSU"#Num : SchedWrite;
45 def "VecBF"#Num : SchedWrite;
46 def "VecDF"#Num : SchedWrite;
47 def "VecDFX"#Num : SchedWrite;
48 def "VecMul"#Num : SchedWrite;
49 def "VecStr"#Num : SchedWrite;
[all …]
|
| /external/llvm-project/openmp/libomptarget/src/ |
| D | MemoryManager.cpp | 46 size_t floorToPowerOfTwo(size_t Num) { in floorToPowerOfTwo() argument
47 Num |= Num >> 1; in floorToPowerOfTwo()
48 Num |= Num >> 2; in floorToPowerOfTwo()
49 Num |= Num >> 4; in floorToPowerOfTwo()
50 Num |= Num >> 8; in floorToPowerOfTwo()
51 Num |= Num >> 16; in floorToPowerOfTwo()
53 Num |= Num >> 32; in floorToPowerOfTwo()
59 Num += 1; in floorToPowerOfTwo()
60 return Num >> 1; in floorToPowerOfTwo()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/CodeView/ |
| D | RecordSerialization.cpp | 36 Error llvm::codeview::consume(BinaryStreamReader &Reader, APSInt &Num) { in consume() argument
44 Num = APSInt(APInt(/*numBits=*/16, Short, /*isSigned=*/false), in consume()
54 Num = APSInt(APInt(8, N, true), false); in consume()
61 Num = APSInt(APInt(16, N, true), false); in consume()
68 Num = APSInt(APInt(16, N, false), true); in consume()
75 Num = APSInt(APInt(32, N, true), false); in consume()
82 Num = APSInt(APInt(32, N, FalseVal), true); in consume()
89 Num = APSInt(APInt(64, N, true), false); in consume()
96 Num = APSInt(APInt(64, N, false), true); in consume()
104 Error llvm::codeview::consume(StringRef &Data, APSInt &Num) { in consume() argument
[all …]
|
| /external/llvm-project/llvm/lib/DebugInfo/CodeView/ |
| D | RecordSerialization.cpp | 36 Error llvm::codeview::consume(BinaryStreamReader &Reader, APSInt &Num) { in consume() argument
44 Num = APSInt(APInt(/*numBits=*/16, Short, /*isSigned=*/false), in consume()
54 Num = APSInt(APInt(8, N, true), false); in consume()
61 Num = APSInt(APInt(16, N, true), false); in consume()
68 Num = APSInt(APInt(16, N, false), true); in consume()
75 Num = APSInt(APInt(32, N, true), false); in consume()
82 Num = APSInt(APInt(32, N, FalseVal), true); in consume()
89 Num = APSInt(APInt(64, N, true), false); in consume()
96 Num = APSInt(APInt(64, N, false), true); in consume()
104 Error llvm::codeview::consume(StringRef &Data, APSInt &Num) { in consume() argument
[all …]
|
| /external/llvm-project/llvm/test/tools/llvm-cov/Inputs/ |
| D | name_whitelist.proftext | 4 # Num Counters:
12 # Num Counters:
20 # Num Counters:
28 # Num Counters:
36 # Num Counters:
44 # Num Counters:
52 # Num Counters:
|
| /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/perfetto/protos/perfetto/common/ |
| D | trace_stats.proto | 32 // Num. bytes written into the circular buffer, including chunk headers.
35 // Num. bytes overwritten before they have been read (i.e. loss of data).
54 // Num. bytes that were allocated as padding between chunks in the circular
58 // Num. of padding bytes that were removed from the circular buffer when
66 // Num. chunks (!= packets) written into the buffer.
69 // Num. chunks (!= packets) rewritten into the buffer. This means we rewrote
73 // Num. chunks overwritten before they have been read (i.e. loss of data).
76 // Num. chunks discarded (i.e. loss of data). Can be > 0 only when a buffer
80 // Num. chunks (!= packets) that were fully read from the circular buffer by
85 // Num. chunks that were committed out of order.
[all …]
|
| /external/grpc-grpc/src/csharp/Grpc.Examples/ |
| D | MathGrpc.cs | 33 …::Math.Num> __Marshaller_math_Num = grpc::Marshallers.Create((arg) => global::Google.Protobuf.Mess…
49 …hod<global::Math.FibArgs, global::Math.Num> __Method_Fib = new grpc::Method<global::Math.FibArgs, …
56 …donly grpc::Method<global::Math.Num, global::Math.Num> __Method_Sum = new grpc::Method<global::Mat…
108 …k Fib(global::Math.FibArgs request, grpc::IServerStreamWriter<global::Math.Num> responseStream, gr… in Fib()
120 …l global::System.Threading.Tasks.Task<global::Math.Num> Sum(grpc::IAsyncStreamReader<global::Math.… in Sum()
234 …public virtual grpc::AsyncServerStreamingCall<global::Math.Num> Fib(global::Math.FibArgs request, … in Fib()
246 …public virtual grpc::AsyncServerStreamingCall<global::Math.Num> Fib(global::Math.FibArgs request, … in Fib()
258 …public virtual grpc::AsyncClientStreamingCall<global::Math.Num, global::Math.Num> Sum(grpc::Metada… in Sum()
268 …public virtual grpc::AsyncClientStreamingCall<global::Math.Num, global::Math.Num> Sum(grpc::CallOp… in Sum()
|
| /external/llvm/lib/Support/ |
| D | BranchProbability.cpp | 66 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()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | BranchProbability.cpp | 68 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) { in scale() argument
75 if (!Num || D == N) in scale()
76 return Num; in scale()
79 uint64_t ProductHigh = (Num >> 32) * N; in scale()
80 uint64_t ProductLow = (Num & UINT32_MAX) * N; in scale()
106 uint64_t BranchProbability::scale(uint64_t Num) const { in scale()
107 return ::scale<D>(Num, N, D); in scale()
110 uint64_t BranchProbability::scaleByInverse(uint64_t Num) const { in scaleByInverse()
111 return ::scale<0>(Num, D, N); in scaleByInverse()
|
| /external/llvm-project/llvm/lib/Support/ |
| D | BranchProbability.cpp | 68 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) { in scale() argument
75 if (!Num || D == N) in scale()
76 return Num; in scale()
79 uint64_t ProductHigh = (Num >> 32) * N; in scale()
80 uint64_t ProductLow = (Num & UINT32_MAX) * N; in scale()
106 uint64_t BranchProbability::scale(uint64_t Num) const { in scale()
107 return ::scale<D>(Num, N, D); in scale()
110 uint64_t BranchProbability::scaleByInverse(uint64_t Num) const { in scaleByInverse()
111 return ::scale<0>(Num, D, N); in scaleByInverse()
|