lib/Bijection/XS.xs

filter: Statementstmt 100% 60 / 60 Branchbran 92.1% 35 / 38 Conditioncond n/a MC/DCmcdc n/a Subroutinesub n/a Podpod n/a totaltotal 96.9% 95 / 98 CC 0 SCAR 0
CC
0
Cov
0%
CRAP 0
↑ Summary blib/lib/Bijection/XS.pm »
1 #define PERL_NO_GET_CONTEXT // we'll define thread context if necessary (faster)
2 #include "EXTERN.h" // globals/constant import locations
3 #include "perl.h" // Perl symbols, structures and constants definition
4 #include "XSUB.h" // xsubpp functions and macros
5 #include <math.h>
6  
7 char * ALPHA[256];
8 int INDEX[256];
9 int OFFSET;
10 int COUNT;
11  
12 5010 void reverse(char *s) {
13 5010 size_t len = strlen(s);
14 5010 char *a = s;
15 5010 char *b = &s[(int)len - 1];
16 char tmp;
17 10021 ▶ for (; a < b; ++a, --b) {
Branch: 1 branch
BranchTrueFalseTotal
for (; a < b; ++a, --b) { 5011 5010 10021
18 5011 tmp = *a;
19 5011 *a = *b;
20 5011 *b = tmp;
21 }
22 5010 }
23  
24 5010 static char * _biject (int id) {
25 dTHX;
26 5010 id = id + OFFSET;
27 5010 char * outs = (char*) calloc(100, sizeof(char*));;
28 17382 ▶ while (id > 0) {
Branch: 1 branch
BranchTrueFalseTotal
while (id > 0) { 12372 5010 17382
29 12372 strncat(outs, ALPHA[id % COUNT], 1);
30 12372 id = floor(id / COUNT);
31 }
32 5010 reverse(outs);
33 5010 return outs;
34 }
35  
36 5006 static int _inverse (char * id) {
37 dTHX;
38 5006 int out = 0, i = 0;
39 17367 ▶ for (i = 0; i < strlen(id); i++) {
Branch: 1 branch
BranchTrueFalseTotal
for (i = 0; i < strlen(id); i++) { 12361 5006 17367
40 12361 out = out * COUNT + INDEX[(int)id[i]];
41 }
42 5006 return out - OFFSET;
43 }
44  
45  
46 MODULE = Bijection::XS PACKAGE = Bijection::XS
47 PROTOTYPES: ENABLE
48  
49 void
50 import(...)
51 PROTOTYPE: DISABLE
52 CODE:
53 17 HV * tags = get_hv("Bijection::XS::EXPORT_TAGS", 0);
54 17 AV * args = (AV *)sv_2mortal((SV *)newAV());
55 SSize_t i, top;
56 53 ▶ for (i = 0; i < items; i++) {
Branch: 1 branch
BranchTrueFalseTotal
for (i = 0; i < items; i++) { 36 17 53
57 36 SV * arg = ST(i);
58 STRLEN len;
59 const char * name;
60 36 ▶ if (i > 0 && tags && SvOK(arg) && !SvROK(arg)) {
Branch: 4 branches
BranchTrueFalseTotal
if (i > 0 && tags && SvOK(arg) && !SvROK(arg)) { 19 17 36
if (i > 0 && tags && SvOK(arg) && !SvROK(arg)) { 18 1 19
if (i > 0 && tags && SvOK(arg) && !SvROK(arg)) { 17 1 18
if (i > 0 && tags && SvOK(arg) && !SvROK(arg)) { 15 2 17
61 15 name = SvPV_const(arg, len);
62 15 ▶ if (len && isIDFIRST(name[0]) && hv_exists(tags, name, len)) {
Branch: 3 branches
BranchTrueFalseTotal
if (len && isIDFIRST(name[0]) && hv_exists(tags, name, len)) { 14 1 15
if (len && isIDFIRST(name[0]) && hv_exists(tags, name, len)) { 11 3 14
if (len && isIDFIRST(name[0]) && hv_exists(tags, name, len)) { 5 6 11
63 5 arg = newSVpvs_flags(":", SVs_TEMP);
64 5 sv_catpvn(arg, name, len);
65 }
66 }
67 36 av_push(args, SvREFCNT_inc_simple_NN(arg));
68 }
69 17 top = av_len(args);
70 17 SP = MARK;
71 17 ▶ PUSHMARK(SP);
Branch: 1 branch
BranchTrueFalseTotal
PUSHMARK(SP); 0 17 17
72 17 ▶ EXTEND(SP, top + 1);
Branch: 2 branches
BranchTrueFalseTotal
EXTEND(SP, top + 1); 17 0 17
EXTEND(SP, top + 1); 0 17 17
73 53 ▶ for (i = 0; i <= top; i++)
Branch: 1 branch
BranchTrueFalseTotal
for (i = 0; i <= top; i++) 36 17 53
74 36 PUSHs(*av_fetch(args, i, 0));
75 17 PUTBACK;
76 17 call_pv("Ex::Op::import", G_VOID | G_DISCARD);
77 12 XSRETURN_EMPTY;
78  
79 SV *
80 bijection_set(...)
81 CODE:
82 12 AV * args = av_make(items, MARK+1);
83 12 SV * first = *av_fetch(args, 0, 0);
84 12 int i = 0;
85
86 12 ▶ if (SvTYPE(first) == SVt_IV && SvIV(first) > 0) {
Branch: 2 branches
BranchTrueFalseTotal
if (SvTYPE(first) == SVt_IV && SvIV(first) > 0) { 4 8 12
if (SvTYPE(first) == SVt_IV && SvIV(first) > 0) { 2 2 4
87 2 OFFSET = SvIV(first);
88 2 av_shift(args);
89 } else {
90 10 OFFSET = av_len(args) + 1;
91 }
92  
93 12 COUNT = av_len(args) + 1;
94 440 ▶ for (i = 0; i < COUNT; i++) {
Branch: 1 branch
BranchTrueFalseTotal
for (i = 0; i < COUNT; i++) { 428 12 440
95 STRLEN retlen;
96 428 char * key = SvPV(*av_fetch(args, i, 0), retlen);
97 428 ALPHA[i] = key;
98 428 INDEX[(int)key[0]] = i;
99 }
100  
101 12 RETVAL = newSViv(OFFSET);
102 OUTPUT:
103 RETVAL
104  
105 void
106 offset_set(offset)
107 SV * offset
108 CODE:
109 3 OFFSET = SvIV(offset);
110  
111  
112 SV *
113 biject(id)
114 SV * id
115 CODE:
116 5012 ▶ if (SvIV(id) < 0) {
Branch: 1 branch
BranchTrueFalseTotal
if (SvIV(id) < 0) { 2 5010 5012
117 2 croak("id to encode must be an integer and non-negative");
118 }
119 5010 char * str = _biject(SvIV(id));
120 5010 RETVAL = newSVpv(str, strlen(str));
121 OUTPUT:
122 RETVAL
123  
124 SV *
125 inverse(str)
126 SV * str
127 CODE:
128 STRLEN retlen;
129 5006 RETVAL = newSViv(_inverse(SvPV(str, retlen)));
130 OUTPUT:
131 RETVAL
132  
↑ Summary blib/lib/Bijection/XS.pm »