lib/Algorithm/Line/Lerp.xs

filter: Statementstmt 0.0% 0 / 64 Branchbran 0.0% 0 / 44 Conditioncond n/a MC/DCmcdc n/a Subroutinesub n/a Podpod n/a totaltotal 0.0% 0 / 108 CC 0 SCAR 0
CC
0
Cov
0%
CRAP 0
« blib/lib/Algorithm/Line/Lerp/ConfigData.pm ↑ Summary blib/lib/Algorithm/Line/Lerp.pm »
1 #define PERL_NO_GET_CONTEXT
2  
3 #include "EXTERN.h"
4 #include "perl.h"
5 #include "XSUB.h"
6  
7 #include "ppport.h"
8  
9 #define XX 0
10 #define YY 1
11  
12 MODULE = Algorithm::Line::Lerp PACKAGE = Algorithm::Line::Lerp
13  
14 SV *
15 bline(SV* sp1, SV* sp2)
16 PROTOTYPE: $$
17 PREINIT:
18 AV* ap1;
19 AV* ap2;
20 AV* theline;
21 AV* point;
22 long x0, y0, x1, y1, dx, dy, sx, sy, err, e2;
23 CODE:
24 0 ▶ if (!(SvROK(sp1) && SvTYPE(SvRV(sp1)) == SVt_PVAV))
Branch: 2 branches
BranchTrueFalseTotal
if (!(SvROK(sp1) && SvTYPE(SvRV(sp1)) == SVt_PVAV)) 0 0 0
if (!(SvROK(sp1) && SvTYPE(SvRV(sp1)) == SVt_PVAV)) 0 0 0
25 0 croak("p1 must be array reference");
26 0 ap1 = (AV*)SvRV(sp1);
27 0 ▶ if (av_count(ap1) != 2) croak("p1 must only have two elements");
Branch: 1 branch
BranchTrueFalseTotal
if (av_count(ap1) != 2) croak("p1 must only have two elements"); 0 0 0
28  
29 0 ▶ if (!(SvROK(sp2) && SvTYPE(SvRV(sp2)) == SVt_PVAV))
Branch: 2 branches
BranchTrueFalseTotal
if (!(SvROK(sp2) && SvTYPE(SvRV(sp2)) == SVt_PVAV)) 0 0 0
if (!(SvROK(sp2) && SvTYPE(SvRV(sp2)) == SVt_PVAV)) 0 0 0
30 0 croak("p2 must be array reference");
31 0 ap2 = (AV*)SvRV(sp2);
32 0 ▶ if (av_count(ap2) != 2) croak("p2 must only have two elements");
Branch: 1 branch
BranchTrueFalseTotal
if (av_count(ap2) != 2) croak("p2 must only have two elements"); 0 0 0
33  
34 0 x0 = SvIV(*av_fetch(ap1, XX, 0));
35 0 y0 = SvIV(*av_fetch(ap1, YY, 0));
36 0 x1 = SvIV(*av_fetch(ap2, XX, 0));
37 0 y1 = SvIV(*av_fetch(ap2, YY, 0));
38  
39 0 dx = labs(x1 - x0);
40 0 dy = labs(y1 - y0);
41 0 ▶ sx = x0 < x1 ? 1 : -1;
Branch: 1 branch
BranchTrueFalseTotal
sx = x0 < x1 ? 1 : -1; 0 0 0
42 0 ▶ sy = y0 < y1 ? 1 : -1;
Branch: 1 branch
BranchTrueFalseTotal
sy = y0 < y1 ? 1 : -1; 0 0 0
43 0 ▶ err = (dx > dy ? dx : -dy) / 2;
Branch: 1 branch
BranchTrueFalseTotal
err = (dx > dy ? dx : -dy) / 2; 0 0 0
44  
45 0 theline = newAV();
46 while (1) {
47 0 point = newAV_alloc_x(2);
48 0 av_push(point, newSViv(x0));
49 0 av_push(point, newSViv(y0));
50 0 av_push(theline, newRV_noinc((SV*)point));
51 0 ▶ if (x0 == x1 && y0 == y1) break;
Branch: 2 branches
BranchTrueFalseTotal
if (x0 == x1 && y0 == y1) break; 0 0 0
if (x0 == x1 && y0 == y1) break; 0 0 0
52 0 e2 = err;
53 0 ▶ if (e2 > -dx) {
Branch: 1 branch
BranchTrueFalseTotal
if (e2 > -dx) { 0 0 0
54 0 err -= dy;
55 0 x0 += sx;
56 }
57 0 ▶ if (e2 < dy) {
Branch: 1 branch
BranchTrueFalseTotal
if (e2 < dy) { 0 0 0
58 0 err += dx;
59 0 y0 += sy;
60 }
61 }
62 0 RETVAL = newRV_noinc((SV*)theline);
63 OUTPUT:
64 RETVAL
65  
66 SV *
67 line(SV* sp1, SV* sp2)
68 PROTOTYPE: $$
69 PREINIT:
70 AV* ap1;
71 AV* ap2;
72 AV* theline;
73 AV* point;
74 long dx, dy, ix, iy, n, m, step;
75 double divn, xstep, ystep, x, y;
76 CODE:
77 0 ▶ if (!(SvROK(sp1) && SvTYPE(SvRV(sp1)) == SVt_PVAV))
Branch: 2 branches
BranchTrueFalseTotal
if (!(SvROK(sp1) && SvTYPE(SvRV(sp1)) == SVt_PVAV)) 0 0 0
if (!(SvROK(sp1) && SvTYPE(SvRV(sp1)) == SVt_PVAV)) 0 0 0
78 0 croak("p1 must be array reference");
79 0 ap1 = (AV*)SvRV(sp1);
80 0 ▶ if (av_count(ap1) != 2) croak("p1 must only have two elements");
Branch: 1 branch
BranchTrueFalseTotal
if (av_count(ap1) != 2) croak("p1 must only have two elements"); 0 0 0
81  
82 0 ▶ if (!(SvROK(sp2) && SvTYPE(SvRV(sp2)) == SVt_PVAV))
Branch: 2 branches
BranchTrueFalseTotal
if (!(SvROK(sp2) && SvTYPE(SvRV(sp2)) == SVt_PVAV)) 0 0 0
if (!(SvROK(sp2) && SvTYPE(SvRV(sp2)) == SVt_PVAV)) 0 0 0
83 0 croak("p2 must be array reference");
84 0 ap2 = (AV*)SvRV(sp2);
85 0 ▶ if (av_count(ap2) != 2) croak("p2 must only have two elements");
Branch: 1 branch
BranchTrueFalseTotal
if (av_count(ap2) != 2) croak("p2 must only have two elements"); 0 0 0
86  
87 0 ix = SvIV(*av_fetch(ap1, XX, 0));
88 0 iy = SvIV(*av_fetch(ap1, YY, 0));
89 0 dx = SvIV(*av_fetch(ap2, XX, 0)) - ix;
90 0 dy = SvIV(*av_fetch(ap2, YY, 0)) - iy;
91  
92 0 n = labs(dx); /* distance */
93 0 m = labs(dy);
94 0 ▶ if (m > n) n = m;
Branch: 1 branch
BranchTrueFalseTotal
if (m > n) n = m; 0 0 0
95  
96 0 ▶ if (!n) {
Branch: 1 branch
BranchTrueFalseTotal
if (!n) { 0 0 0
97 0 theline = newAV_alloc_x(1);
98 0 point = newAV_alloc_x(2);
99 0 av_store(point, XX, newSViv(ix));
100 0 av_store(point, YY, newSViv(iy));
101 0 av_store(theline, 0, newRV_noinc((SV*)point));
102 } else {
103 0 theline = newAV_alloc_x(n);
104 0 divn = 1.0 / n;
105 0 xstep = dx * divn;
106 0 ystep = dy * divn;
107 0 x = ix;
108 0 y = iy;
109 0 ▶ for (step = 0; step <= n; ++step, x += xstep, y += ystep) {
Branch: 1 branch
BranchTrueFalseTotal
for (step = 0; step <= n; ++step, x += xstep, y += ystep) { 0 0 0
110 0 point = newAV_alloc_x(2);
111 0 av_push(point, newSViv(lround(x)));
112 0 av_push(point, newSViv(lround(y)));
113 0 av_push(theline, newRV_noinc((SV*)point));
114 }
115 }
116 0 RETVAL = newRV_noinc((SV*)theline);
117 OUTPUT:
118 RETVAL
« blib/lib/Algorithm/Line/Lerp/ConfigData.pm ↑ Summary blib/lib/Algorithm/Line/Lerp.pm »