Home
last modified time | relevance | path

Searched refs:N (Results 1 – 25 of 4027) sorted by relevance

12345678910>>...162

/llvm-project-15.0.7/flang/test/Semantics/OpenMP/
H A Domp-combined-constructs.f905 integer :: N variable
8 N = 256
12 do i = 1, N
18 do i = 1, N
25 do i = 1, N
31 do i = 1, N
38 do i = 1, N
45 do i = 1, N
51 do i = 1, N
59 do i = 1, N
[all …]
H A Domp-clause-validity01.f9021 N = 1024
35 do i = 1, N
41 do i = 1, N
47 do i = 1, N
53 do i = 1, N
59 do i = 1, N
65 do i = 1, N
71 do i = 1, N
77 do i = 1, N
84 do i = 1, N
[all …]
H A Domp-device-constructs.f907 integer :: N variable
11 N = 256
14 do i = 1, N
20 do i = 1, N
27 do i = 1, N
34 do i = 1, N
40 do i = 1, N
47 do i = 1, N
54 do i = 1, N
60 do i = 1, N
[all …]
H A Domp-nested-simd.f908 DO I = 1,N
13 DO J = 1,N
22 DO I = 1,N
25 DO J = 1,N
38 DO I = 1,N
41 DO J = 1,N
57 DO I = 1,N
75 DO J = 1,N
90 DO I = 1,N
124 DO I = 1,N
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.h210 SDNode *AnalyzeNewNode(SDNode *N);
338 SDValue PromoteIntRes_SHL(SDNode *N);
344 SDValue PromoteIntRes_SRA(SDNode *N);
345 SDValue PromoteIntRes_SRL(SDNode *N);
360 SDValue PromoteIntRes_ABS(SDNode *N);
400 SDValue PromoteIntOp_FIX(SDNode *N);
487 SDValue ExpandIntOp_BR_CC(SDNode *N);
489 SDValue ExpandIntOp_SETCC(SDNode *N);
491 SDValue ExpandIntOp_Shift(SDNode *N);
948 SDValue WidenVecRes_LOAD(SDNode* N);
[all …]
H A DLegalizeFloatTypes.cpp327 SDLoc dl(N); in SoftenFloatRes_FCOPYSIGN()
1192 if (CustomLowerNode(N, N->getValueType(ResNo), true)) in ExpandFloatResult()
1913 ReplaceValueWith(SDValue(N, 1), N->getOperand(0)); in ExpandFloatOp_FP_ROUND()
2150 return DAG.getNode(N->getOpcode(), SDLoc(N), N->getValueType(0), in PromoteFloatOp_FCOPYSIGN()
2157 return DAG.getNode(N->getOpcode(), SDLoc(N), N->getValueType(0), Op); in PromoteFloatOp_FP_TO_XINT()
2163 return DAG.getNode(N->getOpcode(), SDLoc(N), N->getValueType(0), Op, in PromoteFloatOp_FP_TO_XINT_SAT()
2446 return DAG.getNode(N->getOpcode(), SDLoc(N), NVT, Op0, Op1, N->getFlags()); in PromoteFloatRes_BinOp()
2955 return DAG.getNode(N->getOpcode(), dl, N->getValueType(0), N->getOperand(0), in SoftPromoteHalfOp_FCOPYSIGN()
3019 N->getOperand(2), N->getOperand(3), N->getOperand(4)); in SoftPromoteHalfOp_SELECT_CC()
3058 DAG.getNode(N->getOpcode(), SDLoc(N), N->getVTList(), NewOps); in SoftPromoteHalfOp_STACKMAP()
[all …]
H A DLegalizeIntegerTypes.cpp341 N->getChain(), N->getBasePtr(), N->getOperand(2), N->getOperand(3), in PromoteIntRes_AtomicCmpSwap()
369 N->getOpcode(), SDLoc(N), N->getMemoryVT(), VTs, N->getChain(), in PromoteIntRes_AtomicCmpSwap()
812 SDValue Ops[] = {N->getChain(), ExtPassThru, N->getMask(), N->getBasePtr(), in PromoteIntRes_MGATHER()
1830 return DAG.getAtomic(N->getOpcode(), SDLoc(N), N->getMemoryVT(), in PromoteIntOp_ATOMIC_STORE()
1941 return DAG.getNode(N->getOpcode(), SDLoc(N), N->getValueType(0), in PromoteIntOp_SELECT()
1988 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), N->getOperand(1), in PromoteIntOp_FunnelShift()
2044 return DAG.getMaskedStore(N->getChain(), SDLoc(N), DataOp, N->getBasePtr(), in PromoteIntOp_MSTORE()
2167 DAG.UpdateNodeOperands(N, N->getOperand(0), N->getOperand(1), Op2), 0); in PromoteIntOp_FIX()
2470 N->getOperand(0), N->getOperand(1), N->getOperand(2), N->getOperand(3), in ExpandIntegerResult()
3971 Res = earlyExpandDIVFIX(N, N->getOperand(0), N->getOperand(1), in ExpandIntRes_DIVFIX()
[all …]
H A DLegalizeVectorTypes.cpp202 return DAG.getNode(N->getOpcode(), SDLoc(N), in ScalarizeVecRes_BinOp()
371 N->getValueType(0).getVectorElementType(), SDLoc(N), N->getChain(), in ScalarizeVecRes_LOAD()
374 N->getOriginalAlign(), N->getMemOperand()->getFlags(), N->getAAInfo()); in ScalarizeVecRes_LOAD()
402 return DAG.getNode(N->getOpcode(), SDLoc(N), DestVT, Op, N->getFlags()); in ScalarizeVecRes_UnaryOp()
3178 N->getAAInfo(), N->getRanges()); in SplitVecOp_VP_STORE()
3254 N->getAAInfo(), N->getRanges()); in SplitVecOp_MSTORE()
4934 WidenVT, dl, N->getChain(), N->getBasePtr(), N->getOffset(), Mask, in WidenVecRes_MLOAD()
5043 N = N.getOperand(0); in isSETCCorConvertedSETCC()
5048 N = N.getOperand(0); in isSETCCorConvertedSETCC()
5052 N = N.getOperand(0); in isSETCCorConvertedSETCC()
[all …]
/llvm-project-15.0.7/libc/AOR_v20.02/math/
H A Dexp2f_data.c18 #if N == 8
21 #elif N == 16
26 #elif N == 32
35 #elif N == 64
56 #if N == 8
58 #elif N == 16
69 #if N == 8
70 0x1.c6a00335106e2p-5/N/N/N, 0x1.ec0c313449f55p-3/N/N, 0x1.62e431111f69fp-1/N,
72 0x1.c6ac6aa313963p-5/N/N/N, 0x1.ebfff4532d9bap-3/N/N, 0x1.62e43001bc49fp-1/N,
74 0x1.c6af84b912394p-5/N/N/N, 0x1.ebfce50fac4f3p-3/N/N, 0x1.62e42ff0c52d6p-1/N,
[all …]
/llvm-project-15.0.7/libc/src/math/generic/
H A Dexp_utils.cpp20 #if N == 8
29 #elif N == 16
86 #if N == 8
109 as_double(0x3fac6a00335106e2) / N / N / N,
110 as_double(0x3fcec0c313449f55) / N / N,
113 as_double(0x3fac6ac6aa313963) / N / N / N,
114 as_double(0x3fcebfff4532d9ba) / N / N,
117 as_double(0x3fac6af84b912394) / N / N / N,
118 as_double(0x3fcebfce50fac4f3) / N / N,
121 as_double(0x3fac6b04b4221b2a) / N / N / N,
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/cloog/
H A Dsor1d.st1 …N] -> { S2[i0, i1, 1 + i1, 99 + 100i1, i4] : i4 >= 3 and i4 >= -193 - 200i1 and i4 >= -194 + 100i0…
3 context: "[M, N] -> { [] : M >= 0 and N >= 0 }"
6 options: "[M, N] -> { atomic[i0] }"
9 - filter: "[M, N] -> { S2[i0, i1, i2, i3, i4]; S3[i0, i1, i2, i3, i4]; S1[i0, i1, i2, i3] }"
12 options: "[M, N] -> { atomic[i0] }"
15 - filter: "[M, N] -> { S3[i0, i1, i2, i3, i4] }"
18 options: "[M, N] -> { atomic[i0] }"
19 - filter: "[M, N] -> { S1[i0, i1, i2, i3] }"
20 - filter: "[M, N] -> { S2[i0, i1, i2, i3, i4] }"
23 options: "[M, N] -> { atomic[i0] }"
[all …]
H A Dlevenshtein-1-2-3.st1 …N] -> { S5[i0, i1] : 2i1 = -N + i0 and i0 >= 2 + N and i0 <= -2 + 2M - N and N >= 1; S3[i0, i0] : …
3 context: "[M, N] -> { [] : N <= -2 + M and N >= 1 }"
6 options: "[M, N] -> { separate[i0] }"
9 - filter: "[M, N] -> { S1[i0, i1] }"
10 - filter: "[M, N] -> { S2[i0, i1] }"
11 - filter: "[M, N] -> { S3[i0, i1] }"
12 - filter: "[M, N] -> { S4[i0, i1] }"
13 - filter: "[M, N] -> { S5[i0, i1] }"
14 - filter: "[M, N] -> { S6[i0, i1] }"
15 - filter: "[M, N] -> { S7[i0, i1] }"
[all …]
/llvm-project-15.0.7/flang/test/Semantics/OpenACC/
H A Dacc-kernels-loop.f9023 real(8), dimension(N, N) :: aa, bb, cc
33 do i = 1, N
38 do i = 1, N
43 do i = 1, N
48 do i = 1, N
53 do i = 1, N
58 do i = 1, N
63 do i = 1, N
68 do i = 1, N
73 do i = 1, N
[all …]
H A Dacc-loop.f9023 real(8), dimension(N, N) :: aa, bb, cc
32 do i = 1, N
39 do i = 1, N
46 do i = 1, N
53 do i = 1, N
60 do i = 1, N
68 do i = 1, N
75 do i = 1, N
82 do i = 1, N
89 do i = 1, N
[all …]
H A Dacc-branch.f9015 do i = 1, N
24 do i = 1, N
82 do i = 1, N
93 do i = 1, N
102 do i = 1, N
110 do i = 1, N
119 do i = 1, N
128 do i = 1, N
136 do i = 1, N
146 do i = 1, N
[all …]
/llvm-project-15.0.7/clang/test/Parser/
H A Dcxx1z-fold-expressions.cpp15 template<int ...N> void bad1() { (N + ... + N); } // expected-error {{unexpanded parameter packs in… in bad1()
17 template<int ...N> void bad2() { (2 * N + ... + 1); } // expected-error {{expression not permitted … in bad2()
19 template<int ...N, int ...M> void bad4(int (&...x)[N]) { (N + M * ... * 1); } // expected-error {{e… in bad4() argument
20 template<int ...N, int ...M> void fixed4(int (&...x)[N]) { ((N + M) * ... * 1); } in fixed4() argument
24 template<int ...N> void bad4d() { (A(0)(A(0)) + ... + A(0)[A(N)]); } in bad4d()
27 template<int ...N> void bad5() { N + ...; } // expected-error {{expected expression}} expected-erro… in bad5()
28 template<int ...N> void bad6() { ... + N; } // expected-error {{expected expression}} in bad6()
29 template<int ...N> void bad7() { N + ... + N; } // expected-error {{expected expression}} expected-… in bad7()
36 template<int ...N> int bad12() { return (... N); } // expected-error {{expected expression}} in bad12()
48 template <int... N> constexpr bool greaterThan() { return (N > ...); } in greaterThan()
[all …]
/llvm-project-15.0.7/clang-tools-extra/clangd/
H A DConfigYAML.cpp63 Dict.handle("If", [&](Node &N) { parse(F.If, N); }); in parse() argument
65 Dict.handle("Index", [&](Node &N) { parse(F.Index, N); }); in parse() argument
66 Dict.handle("Style", [&](Node &N) { parse(F.Style, N); }); in parse() argument
69 Dict.handle("Hover", [&](Node &N) { parse(F.Hover, N); }); in parse() argument
71 Dict.parse(N); in parse()
90 Dict.parse(N); in parse()
110 Dict.parse(N); in parse()
119 Dict.parse(N); in parse()
133 Dict.parse(N); in parse()
155 Dict.parse(N); in parse()
[all …]
/llvm-project-15.0.7/clang/test/SemaTemplate/
H A Dclass-template-spec.cpp56 namespace N{ namespace
60 namespace N { namespace
67 namespace N { namespace
79 namespace N { namespace
129 template <int N> struct S<N, sizeof(T)> {};
135 template <int N> struct S<N, sizeof(T) + N> {}; // ok (dr1315)
178 typedef integer_sequence<T, N..., sizeof...(N) + N..., Extra...> type;
186 …template<T N, typename Dummy> struct make<N, 1, Dummy> : __make_integer_sequence_impl<make_integer…
205 template<int N> struct A<X, N> {};
206 template<typename T, T N> struct A<Y<T>, N> {};
[all …]
H A Dcxx1z-fold-expressions.cpp28 template<int ...N> void empty() { in empty()
30 static_assert((N && ...) == true); in empty()
31 (N, ...); in empty()
61 void ((k = ... = N)); in empty_with_base()
62 (void) (k = ... = N); in empty_with_base()
107 namespace N { namespace
112 void operator+(N::S, N::S) {} in operator +()
116 void g() { T::f<N::S, N::S>(); } in g()
122 int test_h1 = h<N::S>(1, 2, 3);
123 N::S test_h2 = h<N::S>(N::S(), N::S(), N::S());
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DBranchProbability.h92 assert(N != UnknownN && RHS.N != UnknownN &&
95 N = (uint64_t(N) + RHS.N > D) ? D : N + RHS.N;
100 assert(N != UnknownN && RHS.N != UnknownN &&
103 N = N < RHS.N ? 0 : N - RHS.N;
108 assert(N != UnknownN && RHS.N != UnknownN &&
110 N = (static_cast<uint64_t>(N) * RHS.N + D / 2) / D;
117 N = (uint64_t(N) * RHS > D) ? D : N * RHS;
122 assert(N != UnknownN && RHS.N != UnknownN &&
124 N = (static_cast<uint64_t>(N) * D + RHS.N / 2) / RHS.N;
176 assert(N != UnknownN && RHS.N != UnknownN &&
[all …]
/llvm-project-15.0.7/libcxx/test/std/utilities/memory/specialized.algorithms/uninitialized.move/
H A Dranges_uninitialized_move.pass.cpp98 constexpr int N = 5; in main() local
120 constexpr int N = 5; in main() local
144 constexpr int N = 3; in main() local
156 assert(std::equal(in, in + N, out.begin(), out.begin() + N)); in main()
167 constexpr int N = 3; in main() local
179 assert(std::equal(in, in + N, out.begin(), out.begin() + N)); in main()
190 constexpr int N = 3; in main() local
205 assert(std::equal(out.begin(), out.begin() + N, expected, expected + N)); in main()
219 assert(!std::equal(in, in + N, out, out + N)); in main()
225 std::ranges::uninitialized_move(in, in + N, out, out + N); in main()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAG.h93 void SelectLoad(SDNode *N);
96 void SelectStore(SDNode *N);
97 void SelectSHL(SDNode *N);
106 void SelectVAlign(SDNode *N);
109 void SelectP2D(SDNode *N);
110 void SelectD2P(SDNode *N);
111 void SelectQ2V(SDNode *N);
112 void SelectV2Q(SDNode *N);
130 void SelectHvxRor(SDNode *N);
151 int getWeight(SDNode *N);
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/
H A Dstable_sort.pass.cpp84 assert(N != 0); in test_larger_sorts()
87 int* array = new int[N]; in test_larger_sorts()
110 std::swap_ranges(array, array+N/2, array+N/2); in test_larger_sorts()
115 std::swap_ranges(array, array+N/2, array+N/2); in test_larger_sorts()
122 test_larger_sorts(int N) in test_larger_sorts() argument
127 test_larger_sorts(N, N/2-1); in test_larger_sorts()
128 test_larger_sorts(N, N/2); in test_larger_sorts()
129 test_larger_sorts(N, N/2+1); in test_larger_sorts()
130 test_larger_sorts(N, N-2); in test_larger_sorts()
131 test_larger_sorts(N, N-1); in test_larger_sorts()
[all …]
/llvm-project-15.0.7/libcxx/test/std/utilities/memory/specialized.algorithms/uninitialized.copy/
H A Dranges_uninitialized_copy.pass.cpp99 constexpr int N = 5; in main() local
122 constexpr int N = 5; in main() local
146 constexpr int N = 3; in main() local
158 assert(std::equal(in, in + N, out.begin(), out.begin() + N)); in main()
169 constexpr int N = 3; in main() local
181 assert(std::equal(in, in + N, out.begin(), out.begin() + N)); in main()
207 assert(std::equal(out.begin(), out.begin() + N, expected, expected + N)); in main()
221 assert(!std::equal(in, in + N, out, out + N)); in main()
227 std::ranges::uninitialized_copy(in, in + N, out, out + N); in main()
228 assert(std::equal(in, in + N, out, out + N)); in main()
[all …]
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/modernize/
H A Dloop-convert-const.cpp35 const int N = 10; variable
36 Str Array[N], OtherStr;
38 int Ints[N], OtherInt;
42 for (int I = 0; I < N; ++I) { in memberFunctionsAndOperators()
49 for (int I = 0; I < N; ++I) { in memberFunctionsAndOperators()
172 if (Ints[I] < N) in primitiveTypes()
180 if (N == Ints[I]) in primitiveTypes()
313 const int Ints[N]{}; in testContainerOfConstIents()
333 const static int N = 10; member in TestInsideConstFunction
334 int Ints[N];
[all …]

12345678910>>...162