Home
last modified time | relevance | path

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

12345678910>>...18

/llvm-project/llvm/test/tools/llvm-cov/Inputs/
H A Dmcdc-const-folding.proftext4 # Num Counters:
10 # Num Bitmap Bytes:
19 # Num Counters:
25 # Num Bitmap Bytes:
34 # Num Counters:
40 # Num Bitmap Bytes:
49 # Num Counters:
55 # Num Bitmap Bytes:
64 # Num Counters:
70 # Num Bitmap Bytes:
[all …]
H A Dbranch-c-general.proftext4 # Num Counters:
28 # Num Counters:
49 # Num Counters:
69 # Num Counters:
78 # Num Counters:
88 # Num Counters:
108 # Num Counters:
119 # Num Counters:
135 # Num Counters:
164 # Num Counters:
[all …]
H A Dname_whitelist.proftext4 # Num Counters:
12 # Num Counters:
20 # Num Counters:
28 # Num Counters:
36 # Num Counters:
44 # Num Counters:
52 # Num Counters:
H A Dname_allowlist.proftext4 # Num Counters:
12 # Num Counters:
20 # Num Counters:
28 # Num Counters:
36 # Num Counters:
44 # Num Counters:
52 # Num Counters:
/llvm-project/clang/test/Profile/Inputs/
H A Dcxx-hash-v2.proftext4 # 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 …]
/llvm-project/llvm/lib/TextAPI/
H A DPackedVersion.cpp34 unsigned long long Num; in parse32() local
35 if (getAsUnsignedInteger(Parts[0], 10, Num)) in parse32()
38 if (Num > UINT16_MAX) in parse32()
41 Version = Num << 16; in parse32()
44 if (getAsUnsignedInteger(Parts[i], 10, Num)) in parse32()
47 if (Num > UINT8_MAX) in parse32()
50 Version |= (Num << ShiftNum); in parse32()
69 unsigned long long Num; in parse64() local
70 if (getAsUnsignedInteger(Parts[0], 10, Num)) in parse64()
73 if (Num > 0xFFFFFFULL) in parse64()
[all …]
/llvm-project/llvm/test/Transforms/PGOProfile/Inputs/
H A Dcspgo.proftext6 # 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 …]
H A Dthinlto_cs.proftext6 # Num Counters:
14 # Num Counters:
23 # Num Counters:
32 # Num Counters:
41 # Num Counters:
49 # Num Counters:
57 # Num Counters:
68 # Num Counters:
H A Dmemprof_pgo.proftext6 # Num Counters:
14 # Num Counters:
22 # Num Counters:
30 # Num Counters:
38 # Num Counters:
47 # Num Counters:
/llvm-project/llvm/unittests/Support/
H A DArrayRecyclerTest.cpp19 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 …]
/llvm-project/llvm/test/tools/dsymutil/X86/
H A Dremarks-linking-bundle.test23 CHECK: <Remark Num
24 CHECK: <Remark Num
25 CHECK: <Remark Num
26 CHECK: <Remark Num
27 CHECK: <Remark Num
28 CHECK: <Remark Num
29 CHECK: <Remark Num
30 CHECK: <Remark Num
31 CHECK: <Remark Num
32 CHECK: <Remark Num
[all …]
H A Dremarks-linking-archive.text22 CHECK: <Remark Num
23 CHECK: <Remark Num
24 CHECK: <Remark Num
25 CHECK: <Remark Num
26 CHECK: <Remark Num
27 CHECK: <Remark Num
28 CHECK: <Remark Num
29 CHECK: <Remark Num
30 CHECK: <Remark Num
31 CHECK: <Remark Num
[all...]
/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp66 unsigned findMax(unsigned Num, Calc C);
108 unsigned GCNMinRegScheduler::findMax(unsigned Num, Calc C) { in findMax() argument
109 assert(!RQ.empty() && Num <= RQ.size()); in findMax()
115 for (auto I = RQ.begin(); Num; --Num) { in findMax()
135 unsigned Num = RQ.size(); in pickCandidate() local
136 if (Num == 1) break; in pickCandidate()
138 LLVM_DEBUG(dbgs() << "\nSelecting max priority candidates among " << Num in pickCandidate()
140 Num = findMax(Num, [ in pickCandidate()
[all...]
/llvm-project/llvm/test/tools/llvm-profdata/Inputs/
H A Dmultiple-profdata-merge.proftext6 # 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 …]
H A Dvtable-value-prof.proftext6 # Num Counters:
15 # Num Counters:
23 # Num Counters:
31 # Num Counters:
36 # Num Value Kinds:
62 # Num Counters:
70 # Num Counters:
/llvm-project/pstl/test/std/algorithms/alg.sorting/
H A Dpartial_sort.pass.cpp26 struct Num struct
30 Num() { ++count_val; } in Num() function
31 Num(T v) : val(v) { ++count_val; } in Num() argument
32 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument
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()
H A Dpartial_sort_copy.pass.cpp24 struct Num struct
28 Num() : val(0) {} in Num() function
29 Num(T v) : val(v) {} in Num() argument
30 Num(const Num<T>& v) : val(v.val) {} in Num() argument
31 Num(Num<T>&& v) : val(v.val) {} in Num() argument
32 Num<T>&
33 operator=(const Num<T>& v) in operator =() argument
40 operator<(const Num<T>& v) const in operator <() argument
184 … test_partial_sort_copy<Num<float32_t>>([](Num<float32_t> x, Num<float32_t> y) { return x < y; }); in main()
/llvm-project/llvm/test/tools/llvm-profdata/
H A Dmcdc-bitmap.test11 MCDC: # Num Bitmap Bytes:
15 MCDC: # Num Bitmap Bytes:
28 MCDC2: # Num Bitmap Bytes:
61 # Num Counters:
68 # Num Bitmask Bytes:
76 # Num Counters:
83 # Num Bitmask Bytes:
92 # Num Counters:
101 # Num Bitmask Bytes:
110 # Num Counters:
[all …]
/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZSchedule.td37 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 …]
/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DRecordSerialization.cpp36 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 …]
/llvm-project/clang/test/CXX/temp/temp.decls/temp.friend/
H A Dp1.cpp4 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 …]
/llvm-project/offload/plugins-nextgen/common/include/
H A DMemoryManager.h55 static size_t floorToPowerOfTwo(size_t Num) { in floorToPowerOfTwo() argument
56 Num |= Num >> 1; in floorToPowerOfTwo()
57 Num |= Num >> 2; in floorToPowerOfTwo()
58 Num |= Num >> 4; in floorToPowerOfTwo()
59 Num |= Num >> 8; in floorToPowerOfTwo()
60 Num | in floorToPowerOfTwo()
[all...]
/llvm-project/llvm/lib/Support/
H A DBranchProbability.cpp69 static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) { in scale() argument
76 if (!Num || D == N) in scale()
77 return Num; in scale()
80 uint64_t ProductHigh = (Num >> 32) * N; in scale()
81 uint64_t ProductLow = (Num & UINT32_MAX) * N; in scale()
107 uint64_t BranchProbability::scale(uint64_t Num) const { in scale()
108 return ::scale<D>(Num, N, D); in scale()
111 uint64_t BranchProbability::scaleByInverse(uint64_t Num) const { in scaleByInverse()
112 return ::scale<0>(Num, D, N); in scaleByInverse()
/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.set.operations/
H A Dincludes.pass.cpp24 struct Num struct
27 explicit Num(const T& v) : val(v) {} in Num() argument
32 operator<(const Num<T1>& v1) const in operator <() argument
39 operator Num<T1>() const in operator Num<T1>() argument
41 return Num<T1>((T1)val); in operator Num<T1>()
102 …test_includes<Num<int64_t>, Num<int32_t>>([](const Num<int64_t>& x, const Num<int32_t>& y) { retur… in main()
/llvm-project/mlir/lib/Dialect/SparseTensor/IR/Detail/
H A DVar.h64 using Num = unsigned;
75 static constexpr Num kMaxNum =
76 static_cast<Num>(std::numeric_limits<Storage>::max() >> 3);
83 [[nodiscard]] static constexpr bool isWF_Num(Num n) { return n <= kMaxNum; } in isWF_Num()
94 constexpr Impl(VarKind vk, Num n) in Impl()
103 constexpr Num getNum() const { return static_cast<Num>(data >> 2); } in getNum()
115 constexpr Var(VarKind vk, Num n) : impl(Impl(vk, n)) {} in Var()
125 constexpr Num getNum() const { return impl.getNum(); } in getNum()
148 constexpr SymVar(Num sym) : Var(Kind, sym) {} in SymVar()
160 constexpr DimVar(Num dim) : Var(Kind, dim) {} in DimVar()
[all …]

12345678910>>...18