| /dports/net/kea/kea-2.0.1/src/lib/dns/tests/ |
| H A D | labelsequence_unittest.cc | 99 EXPECT_TRUE(ls1.equals(ls1, true)); in TEST_F()
142 EXPECT_TRUE(ls1.equals(ls1)); in TEST_F()
192 EXPECT_TRUE(ls1 == ls1); // self equivalence in TEST_F()
466 ls1.stripLeft(0); in TEST_F()
469 ls1.stripLeft(1); in TEST_F()
472 ls1.stripLeft(1); in TEST_F()
512 ls1.stripLeft(0); in TEST_F()
514 ls1.stripLeft(1); in TEST_F()
722 EXPECT_EQ(ls1.getHash(true), ls1.getHash(true)); in TEST_F()
739 oss << ls1; in TEST_F()
[all …]
|
| H A D | messagerenderer_unittest.cc | 178 LabelSequence ls1(n1); in TEST_F() local
181 renderer.writeName(ls1); in TEST_F()
183 ls1.stripLeft(1); in TEST_F()
186 renderer.writeName(ls1); in TEST_F()
196 LabelSequence ls1(n1); in TEST_F() local
198 ls1.stripRight(1); in TEST_F()
201 renderer.writeName(ls1); in TEST_F()
211 LabelSequence ls1(n1); in TEST_F() local
216 ls1.stripRight(1); in TEST_F()
221 ls1.stripRight(1); in TEST_F()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/geometry/test/algorithms/within/ |
| H A D | within_linear_linear.cpp | 26 typedef bg::model::linestring<P1> ls1; in test_l_l() typedef
27 typedef bg::model::multi_linestring<ls1> mls1; in test_l_l()
31 test_geometry<ls1, ls2>("LINESTRING(0 0, 2 2, 3 2)", "LINESTRING(0 0, 2 2, 3 2)", true); in test_l_l()
38 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 2)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
39 test_geometry<ls1, ls2>("LINESTRING(3 2, 2 2, 1 1)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
40 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 2)", "LINESTRING(4 2, 2 2, 0 0)", true); in test_l_l()
41 test_geometry<ls1, ls2>("LINESTRING(3 2, 2 2, 1 1)", "LINESTRING(4 2, 2 2, 0 0)", true); in test_l_l()
43 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 3)", "LINESTRING(0 0, 2 2, 4 2)", false); in test_l_l()
45 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 1)", "LINESTRING(0 0, 2 2, 4 2)", false); in test_l_l()
54 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 2 2)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/geometry/test/algorithms/within/ |
| H A D | within_linear_linear.cpp | 26 typedef bg::model::linestring<P1> ls1; in test_l_l() typedef
27 typedef bg::model::multi_linestring<ls1> mls1; in test_l_l()
31 test_geometry<ls1, ls2>("LINESTRING(0 0, 2 2, 3 2)", "LINESTRING(0 0, 2 2, 3 2)", true); in test_l_l()
38 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 2)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
39 test_geometry<ls1, ls2>("LINESTRING(3 2, 2 2, 1 1)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
40 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 2)", "LINESTRING(4 2, 2 2, 0 0)", true); in test_l_l()
41 test_geometry<ls1, ls2>("LINESTRING(3 2, 2 2, 1 1)", "LINESTRING(4 2, 2 2, 0 0)", true); in test_l_l()
43 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 3)", "LINESTRING(0 0, 2 2, 4 2)", false); in test_l_l()
45 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 1)", "LINESTRING(0 0, 2 2, 4 2)", false); in test_l_l()
54 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 2 2)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/geometry/test/algorithms/within/ |
| H A D | within_linear_linear.cpp | 26 typedef bg::model::linestring<P1> ls1; in test_l_l() typedef
27 typedef bg::model::multi_linestring<ls1> mls1; in test_l_l()
31 test_geometry<ls1, ls2>("LINESTRING(0 0, 2 2, 3 2)", "LINESTRING(0 0, 2 2, 3 2)", true); in test_l_l()
38 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 2)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
39 test_geometry<ls1, ls2>("LINESTRING(3 2, 2 2, 1 1)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
40 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 2)", "LINESTRING(4 2, 2 2, 0 0)", true); in test_l_l()
41 test_geometry<ls1, ls2>("LINESTRING(3 2, 2 2, 1 1)", "LINESTRING(4 2, 2 2, 0 0)", true); in test_l_l()
43 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 3)", "LINESTRING(0 0, 2 2, 4 2)", false); in test_l_l()
45 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 1)", "LINESTRING(0 0, 2 2, 4 2)", false); in test_l_l()
54 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 2 2)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/geometry/test/algorithms/within/ |
| H A D | within_linear_linear.cpp | 26 typedef bg::model::linestring<P1> ls1; in test_l_l() typedef
27 typedef bg::model::multi_linestring<ls1> mls1; in test_l_l()
31 test_geometry<ls1, ls2>("LINESTRING(0 0, 2 2, 3 2)", "LINESTRING(0 0, 2 2, 3 2)", true); in test_l_l()
38 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 2)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
39 test_geometry<ls1, ls2>("LINESTRING(3 2, 2 2, 1 1)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
40 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 2)", "LINESTRING(4 2, 2 2, 0 0)", true); in test_l_l()
41 test_geometry<ls1, ls2>("LINESTRING(3 2, 2 2, 1 1)", "LINESTRING(4 2, 2 2, 0 0)", true); in test_l_l()
43 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 3)", "LINESTRING(0 0, 2 2, 4 2)", false); in test_l_l()
45 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 3 1)", "LINESTRING(0 0, 2 2, 4 2)", false); in test_l_l()
54 test_geometry<ls1, ls2>("LINESTRING(1 1, 2 2, 2 2)", "LINESTRING(0 0, 2 2, 4 2)", true); in test_l_l()
[all …]
|
| /dports/math/py-sympy/sympy-1.9/sympy/parsing/tests/ |
| H A D | test_fortran_parser.py | 32 ls1 = expr3.return_expr()
38 assert ls1[0] == Declaration(
45 assert ls1[1] == Declaration(
52 assert ls1[2] == Declaration(
59 assert ls1[3] == Declaration(
110 ls1 = expr1.return_expr()
144 ls1 = expr1.return_expr()
171 ls1 = expr1.return_expr()
198 ls1 = expr1.return_expr()
226 ls1 = expr1.return_expr()
[all …]
|
| /dports/databases/sfcgal/SFCGAL-815d5097f684dbc48b22041bf2047beab36df0a1/test/unit/SFCGAL/algorithm/ |
| H A D | DifferenceTest.cpp | 66 std::unique_ptr<Geometry> ls1 = io::readWkt( "LINESTRING(0 0,1 0)" ); in BOOST_AUTO_TEST_CASE() local
68 std::unique_ptr<Geometry> diff = algorithm::difference( *ls1, *ls2 ); in BOOST_AUTO_TEST_CASE()
73 std::unique_ptr<Geometry> ls1 = io::readWkt( "LINESTRING(0 0,1 0)" ); in BOOST_AUTO_TEST_CASE() local
75 std::unique_ptr<Geometry> diff = algorithm::difference( *ls1, *ls2 ); in BOOST_AUTO_TEST_CASE()
82 std::unique_ptr<Geometry> diff = algorithm::difference( *ls1, *ls2 ); in BOOST_AUTO_TEST_CASE()
83 BOOST_CHECK( *diff == *ls1 ); in BOOST_AUTO_TEST_CASE()
87 std::unique_ptr<Geometry> ls1 = io::readWkt( "LINESTRING(0 0,1 0)" ); in BOOST_AUTO_TEST_CASE() local
89 std::unique_ptr<Geometry> diff = algorithm::difference( *ls1, *ls2 ); in BOOST_AUTO_TEST_CASE()
104 BOOST_CHECK( *diff == *ls1 ); in BOOST_AUTO_TEST_CASE()
162 std::unique_ptr<Geometry> ls1 = io::readWkt( in BOOST_AUTO_TEST_CASE() local
[all …]
|
| /dports/lang/chibi-scheme/chibi-scheme-0.10/lib/srfi/95/ |
| H A D | sort.scm | 41 (define (merge! ls1 ls2 less . o)
46 (if (null? (cdr ls1))
47 (set-cdr! ls1 ls2)
48 (lp ls1 (cdr ls1) ls2 (key (car (cdr ls1))) b less key)))
52 (set-cdr! ls2 ls1)
55 ((null? ls1) ls2)
56 ((null? ls2) ls1)
58 (let ((a (key (car ls1)))
62 (if (null? (cdr ls1))
64 (lp ls1 (cdr ls1) ls2 (key (car (cdr ls1))) b less key))
[all …]
|
| /dports/devel/spatialindex/spatialindex-src-1.8.5/test/geometry/ |
| H A D | Intersection.cc | 35 LineSegment ls1 = LineSegment(p1, p2); in main() local
39 if (!ls1.intersectsShape(ls2)) { in main()
41 cerr << ls1 << ", " << ls2 << endl; in main()
45 if (ls1.intersectsShape(ls3)) { in main()
47 cerr << ls1 << ", " << ls3 << endl; in main()
56 if (!r1.intersectsShape(ls1) || !ls1.intersectsShape(r1)) { in main()
58 cerr << r1 << ", " << ls1 << endl; in main()
62 if (r2.intersectsShape(ls1) || ls1.intersectsShape(r2)) { in main()
64 cerr << r2 << ", " << ls1 << endl; in main()
69 if (!r3.intersectsShape(ls1) || !ls1.intersectsShape(r3)) { in main()
[all …]
|
| /dports/lang/chibi-scheme/chibi-scheme-0.10/ |
| H A D | simplify.c | 13 sexp ls1, ls2, p1, p2, sv; in simplify() local
30 for (ls1=sexp_cdr(res); sexp_pairp(ls1); ls1=sexp_cdr(ls1)) { in simplify()
32 if (sexp_pairp(app)) sexp_pair_source(app) = sexp_pair_source(ls1); in simplify()
40 for (check=1, ls1=sexp_cdr(app); sexp_pairp(ls1); ls1=sexp_cdr(ls1)) { in simplify()
41 if (sexp_pointerp(sexp_car(ls1)) && ! sexp_litp(sexp_car(ls1))) { in simplify()
64 ls1 = app; in simplify()
80 sexp_cdr(ls1) = sexp_cdr(ls2); in simplify()
87 ls1 = ls2; in simplify()
124 for (ls1=substs; sexp_pairp(ls1); ls1=sexp_cdr(ls1)) in simplify()
125 if ((sexp_caar(ls1) == tmp) && (sexp_cadar(ls1) == sexp_ref_loc(res))) { in simplify()
[all …]
|
| /dports/mail/filtermail/filtermail-0.8.6/doc/api/rtf/ |
| H A D | dir_68267d1309a1af8e8297ef4c3efbcdba.rtf | 95 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
97 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
99 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
101 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
103 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
105 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
107 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
109 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
111 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
113 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
[all …]
|
| H A D | refman.rtf | 281 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
283 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
285 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
287 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
289 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
291 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
293 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
295 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
297 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
299 …80\fi-360\li360\widctlpar\jclisttab\tx360{\*\pn \pnlvlbody\ilvl0\ls1\pnrnot0\pndec }\ls1\adjustrig…
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/src/ChezScheme/c/ |
| H A D | sort.h | 29 type merge(type ls1, type ls2) {\
32 if (ls1 == nil) { *pp = ls2; break; }\
33 if (ls2 == nil) { *pp = ls1; break; }\
34 if (lt(ls2, ls1))\
37 { *pp = ls1; pp = &cdr(ls1); ls1 = cdr(ls1); }\
|
| /dports/lang/racket/racket-8.3/src/ChezScheme/c/ |
| H A D | sort.h | 29 type merge(type ls1, type ls2) {\
32 if (ls1 == nil) { *pp = ls2; break; }\
33 if (ls2 == nil) { *pp = ls1; break; }\
34 if (lt(ls2, ls1))\
37 { *pp = ls1; pp = &cdr(ls1); ls1 = cdr(ls1); }\
|
| /dports/lang/chez-scheme/ChezScheme-9.5.4/c/ |
| H A D | sort.h | 29 type merge(type ls1, type ls2) {\
32 if (ls1 == nil) { *pp = ls2; break; }\
33 if (ls2 == nil) { *pp = ls1; break; }\
34 if (lt(ls2, ls1))\
37 { *pp = ls1; pp = &cdr(ls1); ls1 = cdr(ls1); }\
|
| /dports/editors/ted/Ted-2.23/appUtil/ |
| H A D | geoLineFitter.c | 228 ls1.lsX0= 0; ls1.lsY0= 0;
229 ls1.lsX1= 8; ls1.lsY1= 2;
234 ls2= ls1;
244 geoAddToLineFitter( &lf, ls1.lsX0, ls1.lsY0 );
245 geoAddToLineFitter( &lf, ls1.lsX1, ls1.lsY1 );
256 l= AT2_X( ls1.lsX0, ls1.lsY0, &at );
259 l= AT2_X( ls1.lsX1, ls1.lsY1, &at );
296 geoAddToLineFitter( &lf, ls1.lsX0, ls1.lsY0 );
297 geoAddToLineFitter( &lf, ls1.lsX1, ls1.lsY1 );
310 l= AT2_X( ls1.lsX0, ls1.lsY0, &at );
[all …]
|
| /dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/2geom/src/2geom/ |
| H A D | line.cpp | 358 OptCrossing intersection_impl( LineSegment const& ls1, in intersection_impl() argument
365 intersection_impl(ls1.finalPoint() - ls1.initialPoint(), in intersection_impl()
366 ls1.initialPoint(), in intersection_impl()
382 if (are_near(ls1.initialPoint(), l2)) { in intersection_impl()
396 Point direction = ls1.finalPoint() - ls1.initialPoint(); in intersection_impl()
399 ls1.initialPoint(), in intersection_impl()
417 if ( are_near(r2.origin(), ls1) ) { in intersection_impl()
434 } else if ( are_near(ls1.initialPoint(), r2) ) { in intersection_impl()
501 Point direction1 = ls1.finalPoint() - ls1.initialPoint(); in intersection()
526 if ( are_near(ls2.initialPoint(), ls1) ) in intersection()
[all …]
|
| /dports/math/lib2geom/lib2geom-1.1/src/2geom/ |
| H A D | line.cpp | 358 OptCrossing intersection_impl( LineSegment const& ls1, in intersection_impl() argument
365 intersection_impl(ls1.finalPoint() - ls1.initialPoint(), in intersection_impl()
366 ls1.initialPoint(), in intersection_impl()
382 if (are_near(ls1.initialPoint(), l2)) { in intersection_impl()
396 Point direction = ls1.finalPoint() - ls1.initialPoint(); in intersection_impl()
399 ls1.initialPoint(), in intersection_impl()
417 if ( are_near(r2.origin(), ls1) ) { in intersection_impl()
434 } else if ( are_near(ls1.initialPoint(), r2) ) { in intersection_impl()
501 Point direction1 = ls1.finalPoint() - ls1.initialPoint(); in intersection()
526 if ( are_near(ls2.initialPoint(), ls1) ) in intersection()
[all …]
|
| /dports/biology/bowtie/bowtie-1.3.1/scripts/ |
| H A D | reconcile_alignments_pe.pl | 261 my @ls1 = split(/\//, $name1);
265 $ls1[0] eq $ls2[0] || die "Different names for paired alignments: $ls1[0], $ls2[0]";
266 my $name = $ls1[0];
307 my @ls1 = split(/\//, $name1);
310 $ls1[0] eq $ls2[0] || die "Different names for paired alignments: $ls1[0], $ls2[0]";
311 my $name = $ls1[0];
357 $ls1[0] eq $ls2[0] || die "Different names for paired alignments: $ls1[0], $ls2[0]";
358 my $name = $ls1[0];
393 my @ls1 = split(/\//, $name1);
396 $ls1[0] eq $ls2[0] || die "Different names for paired alignments: $ls1[0], $ls2[0]";
[all …]
|
| /dports/science/InsightToolkit/ITK-5.0.1/Modules/IO/XML/src/ |
| H A D | itkStringTools.cxx | 173 std::string ls1 = s1; in MatchWith() local
174 ToLowerCase( ls1 ); in MatchWith()
179 if ( ls1 == ls2 ) in MatchWith()
208 std::string ls1 = s1; in StartWith() local
209 ToLowerCase( ls1 ); in StartWith()
214 if ( ls1.find(ls2) == 0 ) in StartWith()
245 std::string ls1 = s1; in EndWith() local
246 ToLowerCase( ls1 ); in EndWith()
251 if ( ls1.rfind(ls2) == pos ) in EndWith()
280 std::string ls1 = s1; in ContainSub() local
[all …]
|
| /dports/science/dftbplus/dftbplus-19.1/external/xmlf90/ |
| H A D | strings.f90 | 243 ls1 = len(s1)
251 do i=1,ls1
256 s1%len = ls1 + ls2
259 do i=ls1,1,-1
265 s1%len = ls1 + ls2
323 ls1 = len(s1)
329 do i=1,ls1
332 do i=ls1+1,ls1+ls2
338 s1%len = ls1 + ls2
341 do i=ls1+1,ls1+ls2
[all …]
|
| /dports/lang/chibi-scheme/chibi-scheme-0.10/lib/srfi/18/ |
| H A D | threads.c | 131 if (ls1) sexp_cdr(ls1) = sexp_cdr(ls2); in sexp_delete_list()
164 sexp ls1=SEXP_NULL, ls2; in sexp_insert_timed() local
205 if (ls1 == SEXP_NULL) in sexp_insert_timed()
264 sexp ls1, ls2; in sexp_mutex_unlock() local
273 if (ls1==SEXP_NULL) in sexp_mutex_unlock()
302 if (ls1==SEXP_NULL) in sexp_condition_variable_signal()
493 ls1 = ls2; in sexp_scheduler()
525 ls1 = ls2; in sexp_scheduler()
534 ls1 = SEXP_NULL; in sexp_scheduler()
539 ls1 = ls2; in sexp_scheduler()
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/test/Transforms/LoopVersioning/ |
| H A D | lcssa.ll | 4 define void @fill(i8** %ls1.20, i8** %ls2.21, i8* %cse3.22) {
8 %ls1.20.promoted = load i8*, i8** %ls1.20
14 %_tmp281 = phi i8* [ %ls1.20.promoted, %bb1.ph ], [ %_tmp28, %bb1 ]
28 store i8* %_tmp28.lcssa, i8** %ls1.20
37 define void @fill_no_null_opt(i8** %ls1.20, i8** %ls2.21, i8* %cse3.22) #0 {
43 %ls1.20.promoted = load i8*, i8** %ls1.20
49 %_tmp281 = phi i8* [ %ls1.20.promoted, %bb1.ph ], [ %_tmp28, %bb1 ]
63 store i8* %_tmp28.lcssa, i8** %ls1.20
|
| /dports/devel/llvm11/llvm-11.0.1.src/test/Transforms/LoopVersioning/ |
| H A D | lcssa.ll | 4 define void @fill(i8** %ls1.20, i8** %ls2.21, i8* %cse3.22) {
8 %ls1.20.promoted = load i8*, i8** %ls1.20
14 %_tmp281 = phi i8* [ %ls1.20.promoted, %bb1.ph ], [ %_tmp28, %bb1 ]
28 store i8* %_tmp28.lcssa, i8** %ls1.20
37 define void @fill_no_null_opt(i8** %ls1.20, i8** %ls2.21, i8* %cse3.22) #0 {
43 %ls1.20.promoted = load i8*, i8** %ls1.20
49 %_tmp281 = phi i8* [ %ls1.20.promoted, %bb1.ph ], [ %_tmp28, %bb1 ]
63 store i8* %_tmp28.lcssa, i8** %ls1.20
|