line |
true |
false |
branch |
17
|
0 |
1607 |
if (Matrix == NULL) return &PL_sv_undef; |
20
|
0 |
1607 |
if (Matrix->values == NULL) { free(Matrix); return NULL; } |
38
|
1607 |
0 |
gf2_matrix_t *m=(gf2_matrix_t*)SvIV(SvRV(Self)); |
39
|
1607 |
0 |
if (m->alloc_bits & 1) |
41
|
1607 |
0 |
if (m->alloc_bits & 2) |
47
|
4136 |
0 |
return ((gf2_matrix_t*)SvIV(SvRV(Self)))->rows; |
51
|
14793 |
0 |
return ((gf2_matrix_t*)SvIV(SvRV(Self)))->cols; |
55
|
5272 |
0 |
return ((gf2_matrix_t*)SvIV(SvRV(Self)))->width; |
59
|
2614 |
0 |
return ((gf2_matrix_t*)SvIV(SvRV(Self)))->organisation; |
63
|
41070 |
0 |
gf2_matrix_t *m=(gf2_matrix_t*)SvIV(SvRV(Self)); |
72
|
41070 |
0 |
if ((row < 0) || (row >= m->rows)) { |
|
0 |
41070 |
if ((row < 0) || (row >= m->rows)) { |
76
|
41070 |
0 |
if ((col < 0) || (col >= m->cols)) { |
|
0 |
41070 |
if ((col < 0) || (col >= m->cols)) { |
98
|
30436 |
0 |
gf2_matrix_t *m=(gf2_matrix_t*)SvIV(SvRV(Self)); |
107
|
30436 |
0 |
if ((row < 0) || (row >= m->rows)) { |
|
0 |
30436 |
if ((row < 0) || (row >= m->rows)) { |
112
|
30436 |
0 |
if ((col < 0) || (col >= m->cols)) { |
|
0 |
30436 |
if ((col < 0) || (col >= m->cols)) { |
150
|
14 |
0 |
gf2_matrix_t *self = (gf2_matrix_t*) SvIV(SvRV(Self)); |
151
|
14 |
0 |
gf2_matrix_t *xform = (gf2_matrix_t*) SvIV(SvRV(Transform)); |
152
|
14 |
0 |
gf2_matrix_t *result = (gf2_matrix_t*) SvIV(SvRV(Result)); |
171
|
16 |
2 |
for (r=0, |
176
|
128 |
16 |
for (c=0, |
181
|
896 |
128 |
for (v=0, |
203
|
28 |
6 |
for (r=0, |
208
|
144 |
28 |
for (c=0, |
213
|
688 |
144 |
for (v=0, |
226
|
28 |
6 |
for (r=0, |
231
|
144 |
28 |
for (c=0, |
236
|
688 |
144 |
for (v=0, |
257
|
470 |
0 |
gf2_matrix_t *this = (gf2_matrix_t*) SvIV(SvRV(This)); |
258
|
470 |
0 |
gf2_matrix_t *that = (gf2_matrix_t*) SvIV(SvRV(That)); |
267
|
465 |
5 |
if (this->organisation == that->organisation) { |
269
|
5321 |
255 |
for (i=this->rows * this->cols * this->width; |
272
|
210 |
5111 |
if (*thisp != *thatp) return 0; |
280
|
18 |
4 |
for (i=0; |
285
|
68 |
17 |
for (j=0; |
292
|
0 |
0 |
if (*thisp++ != *thatp++) return 0; |
293
|
0 |
0 |
if (*thisp++ != *thatp++) return 0; |
295
|
0 |
60 |
if (*thisp++ != *thatp++) return 0; |
297
|
1 |
67 |
if (*thisp++ != *thatp++) return 0; |
307
|
2226 |
0 |
gf2_matrix_t *self = (gf2_matrix_t*) SvIV(SvRV(Self)); |
319
|
127 |
2099 |
if ( (width > 1) && byteorder && |
|
12 |
115 |
if ( (width > 1) && byteorder && |
|
5 |
7 |
if ( (width > 1) && byteorder && |
322
|
5 |
0 |
to_start=SvPV(Str,len) + width - 1; |
323
|
14 |
5 |
for (i=width ; i-- ; --to_start, ++from_start) { |
325
|
18 |
14 |
for (j=words; j--; to += width, from += width) { |
339
|
2228 |
0 |
gf2_matrix_t *self = (gf2_matrix_t*) SvIV(SvRV(Self)); |
350
|
127 |
2101 |
if ( (width > 1) && byteorder && |
|
12 |
115 |
if ( (width > 1) && byteorder && |
|
6 |
6 |
if ( (width > 1) && byteorder && |
352
|
6 |
0 |
from_start=SvPV(Str,len) + width - 1; |
353
|
16 |
6 |
for (i=width ; i-- ; --from_start, ++to_start) { |
355
|
24 |
16 |
for (j=words; j--; to += width, from += width) { |
360
|
2222 |
0 |
from_start=SvPV(Str,len); |