Home
last modified time | relevance | path

Searched refs:rr (Results 1 – 25 of 135) sorted by relevance

123456

/llvm-project-15.0.7/clang/test/CodeGen/
H A D2002-09-18-UnionProblem.c14 DWunion rr; in __udivmodhi4() local
18 rr.s.high = n1; in __udivmodhi4()
22 rr.s.high = bm; in __udivmodhi4()
25 return rr.ll; in __udivmodhi4()
/llvm-project-15.0.7/llvm/test/Analysis/DependenceAnalysis/
H A DInvariant.ll7 ; float foo (float g, float* rr[40]) {
11 ; float add = rr[j][j] + rr[i][j];
23 define float @foo(float %g, [40 x float]* %rr) nounwind {
35 %arrayidx4 = getelementptr inbounds [40 x float], [40 x float]* %rr, i32 %j.02, i32 %j.02
37 %arrayidx6 = getelementptr inbounds [40 x float], [40 x float]* %rr, i32 %i.04, i32 %j.02
/llvm-project-15.0.7/flang/test/Lower/Intrinsics/
H A Drandom.f9010 real rr, aa(5) local
23 call random_number(rr)
24 print*, rr
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86SchedIceLake.td638 def: InstRW<[ICXWriteResGroup1], (instregex "KAND(B|D|Q|W)rr",
639 "KANDN(B|D|Q|W)rr",
641 "KNOT(B|D|Q|W)rr",
642 "KOR(B|D|Q|W)rr",
643 "KXNOR(B|D|Q|W)rr",
644 "KXOR(B|D|Q|W)rr",
647 "MMX_PADDS(B|W)rr",
649 "MMX_PAVG(B|W)rr",
654 "MMX_PSUBS(B|W)rr",
705 def: InstRW<[ICXWriteResGroup8], (instregex "ANDN(32|64)rr")>;
[all …]
H A DX86SchedSkylakeServer.td630 def: InstRW<[SKXWriteResGroup1], (instregex "KAND(B|D|Q|W)rr",
631 "KANDN(B|D|Q|W)rr",
633 "KNOT(B|D|Q|W)rr",
634 "KOR(B|D|Q|W)rr",
635 "KXNOR(B|D|Q|W)rr",
636 "KXOR(B|D|Q|W)rr",
639 "MMX_PADDS(B|W)rr",
641 "MMX_PAVG(B|W)rr",
646 "MMX_PSUBS(B|W)rr",
688 def: InstRW<[SKXWriteResGroup8], (instregex "ANDN(32|64)rr")>;
[all …]
/llvm-project-15.0.7/libclc/generic/lib/math/
H A Dsincos_helpers.h28 _CLC_DECL int __clc_argReductionS(float *r, float *rr, float x);
34 _CLC_DECL void __clc_remainder_piby2_medium(double x, double *r, double *rr, int *regn);
35 _CLC_DECL void __clc_remainder_piby2_large(double x, double *r, double *rr, int *regn);
H A Dclc_tan.cl55 double r, rr;
59 __clc_remainder_piby2_medium(y, &r, &rr, &regn);
61 __clc_remainder_piby2_large(y, &r, &rr, &regn);
63 double2 tt = __clc_tan_piby4(r, rr);
H A Dcos.cl58 double r, rr;
62 __clc_remainder_piby2_medium(x, &r, &rr, &regn);
64 __clc_remainder_piby2_large(x, &r, &rr, &regn);
66 double2 sc = __clc_sincos_piby4(r, rr);
H A Dsin.cl61 double r, rr;
65 __clc_remainder_piby2_medium(y, &r, &rr, &regn);
67 __clc_remainder_piby2_large(y, &r, &rr, &regn);
69 double2 sc = __clc_sincos_piby4(r, rr);
/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A D2009-04-09-RegScavengerAsm.ll6 %rr = alloca i32 ; <i32*> [#uses=2]
7 %0 = load i32, i32* %rr ; <i32> [#uses=1]
9 store i32 %1, i32* %rr
/llvm-project-15.0.7/llvm/lib/Target/AVR/
H A DAVRInstrInfo.td381 : $rr),
400 : $rr),
416 : $rr),
474 : $rr),
493 : $rr),
525 : $rr),
862 : $rr),
1028 : $rr),
1053 : $rr),
1439 : $rr),
[all …]
/llvm-project-15.0.7/flang/test/Lower/
H A Dentry-statement.f9048 print*, rr(22)
113 rr = 200.0
114 rr = rr + n2
/llvm-project-15.0.7/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.nav/
H A Dminus.pass.cpp25 std::reverse_iterator<It> rr = r - n; in test() local
26 assert(rr.base() == x); in test()
H A Dplus.pass.cpp25 std::reverse_iterator<It> rr = r + n; in test() local
26 assert(rr.base() == x); in test()
H A Dpredecrement.pass.cpp24 std::reverse_iterator<It>& rr = --r; in test() local
26 assert(&rr == &r); in test()
H A Dpreincrement.pass.cpp24 std::reverse_iterator<It>& rr = ++r; in test() local
26 assert(&rr == &r); in test()
H A Dpostdecrement.pass.cpp24 std::reverse_iterator<It> rr = r--; in test() local
26 assert(rr.base() == i); in test()
H A Dincrement-assign.pass.cpp25 std::reverse_iterator<It>& rr = r += n; in test() local
27 assert(&rr == &r); in test()
H A Ddecrement-assign.pass.cpp25 std::reverse_iterator<It>& rr = r -= n; in test() local
27 assert(&rr == &r); in test()
/llvm-project-15.0.7/libcxx/test/libcxx/iterators/predef.iterators/__unconstrained_reverse_iterator/reverse.iter.nav/
H A Dplus.pass.cpp25 std::__unconstrained_reverse_iterator<It> rr = r + n; in test() local
26 assert(rr.base() == x); in test()
H A Dminus.pass.cpp25 std::__unconstrained_reverse_iterator<It> rr = r - n; in test() local
26 assert(rr.base() == x); in test()
H A Dpredecrement.pass.cpp24 std::__unconstrained_reverse_iterator<It>& rr = --r; in test() local
26 assert(&rr == &r); in test()
H A Dpreincrement.pass.cpp24 std::__unconstrained_reverse_iterator<It>& rr = ++r; in test() local
26 assert(&rr == &r); in test()
H A Dpostincrement.pass.cpp24 std::__unconstrained_reverse_iterator<It> rr = r++; in test() local
26 assert(rr.base() == i); in test()
/llvm-project-15.0.7/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.nonmember/
H A Dplus.pass.cpp25 std::reverse_iterator<It> rr = n + r; in test() local
26 assert(rr.base() == x); in test()

123456