| 1 |
|
| #ifdef __cplusplus |
| 2 |
|
| extern "C" { |
| 3 |
|
| #endif |
| 4 |
|
| #include "EXTERN.h" |
| 5 |
|
| #include "perl.h" |
| 6 |
|
| #include "XSUB.h" |
| 7 |
|
| #ifdef __cplusplus |
| 8 |
|
| } |
| 9 |
|
| #endif |
| 10 |
|
| |
| 11 |
|
| #include "darts.h" |
| 12 |
|
| #define MAX_NMATCH 1024 |
| 13 |
|
| |
| 14 |
0 |
| static IV da_make(AV *av){ |
| 15 |
0 |
▶ | Darts::DoubleArray *dp = new Darts::DoubleArray; |
Branch: 1 branch
| Branch | True | False | Total |
| Darts::DoubleArray *dp = new Darts::DoubleArray; |
0 |
0 |
0 |
|
| 16 |
0 |
| std::vector <const Darts::DoubleArray::key_type *> keys; |
| 17 |
|
| int i, l; |
| 18 |
0 |
▶ | for (i = 0, l = av_len(av)+1; i < l; i++){ |
Branch: 2 branches
| Branch | True | False | Total |
| for (i = 0, l = av_len(av)+1; i < l; i++){ |
0 |
0 |
0 |
| for (i = 0, l = av_len(av)+1; i < l; i++){ |
0 |
0 |
0 |
|
| 19 |
0 |
▶ | keys.push_back(SvPV_nolen(AvARRAY(av)[i])); |
Branch: 1 branch
| Branch | True | False | Total |
| keys.push_back(SvPV_nolen(AvARRAY(av)[i])); |
0 |
0 |
0 |
|
| 20 |
|
| } |
| 21 |
0 |
▶ | dp->build(keys.size(), &keys[0], 0, 0); |
Branch: 1 branch
| Branch | True | False | Total |
| dp->build(keys.size(), &keys[0], 0, 0); |
0 |
0 |
0 |
|
| 22 |
0 |
| return PTR2IV(dp); |
| 23 |
0 |
| } |
| 24 |
|
| |
| 25 |
0 |
| static int da_free(IV dpi){ |
| 26 |
0 |
▶ | delete INT2PTR(Darts::DoubleArray *, dpi); |
Branch: 1 branch
| Branch | True | False | Total |
| delete INT2PTR(Darts::DoubleArray *, dpi); |
0 |
0 |
0 |
|
| 27 |
0 |
| return 0; |
| 28 |
|
| } |
| 29 |
|
| |
| 30 |
0 |
| static IV da_open(char *filename){ |
| 31 |
0 |
| Darts::DoubleArray *dp = new Darts::DoubleArray; |
| 32 |
0 |
▶ | if (dp->open(filename) == -1){ |
Branch: 1 branch
| Branch | True | False | Total |
| if (dp->open(filename) == -1){ |
0 |
0 |
0 |
|
| 33 |
0 |
▶ | delete dp; |
Branch: 1 branch
| Branch | True | False | Total |
| delete dp; |
0 |
0 |
0 |
|
| 34 |
0 |
| return 0; |
| 35 |
|
| } |
| 36 |
0 |
| return PTR2IV(dp); |
| 37 |
|
| } |
| 38 |
|
| |
| 39 |
0 |
| static size_t da_search(IV dpi, char *str){ |
| 40 |
0 |
| Darts::DoubleArray *dp = INT2PTR(Darts::DoubleArray *, dpi); |
| 41 |
|
| Darts::DoubleArray::result_pair_type result_pair [MAX_NMATCH]; |
| 42 |
0 |
▶ | size_t num = dp->commonPrefixSearch(str, result_pair, sizeof(result_pair)); |
Branch: 1 branch
| Branch | True | False | Total |
| size_t num = dp->commonPrefixSearch(str, result_pair, sizeof(result_pair)); |
0 |
0 |
0 |
|
| 43 |
0 |
| return num; |
| 44 |
|
| } |
| 45 |
|
| |
| 46 |
|
| |
| 47 |
0 |
| static SV *do_callback(SV *callback, SV *s){ |
| 48 |
0 |
| dSP; |
| 49 |
|
| int argc; |
| 50 |
|
| SV *retval; |
| 51 |
0 |
| ENTER; |
| 52 |
0 |
| SAVETMPS; |
| 53 |
0 |
▶ | PUSHMARK(sp); |
Branch: 1 branch
| Branch | True | False | Total |
| PUSHMARK(sp); |
0 |
0 |
0 |
|
| 54 |
0 |
▶ | XPUSHs(s); |
Branch: 1 branch
| Branch | True | False | Total |
| XPUSHs(s); |
0 |
0 |
0 |
|
| 55 |
0 |
| PUTBACK; |
| 56 |
0 |
| argc = call_sv(callback, G_SCALAR); |
| 57 |
0 |
| SPAGAIN; |
| 58 |
0 |
▶ | if (argc != 1){ |
Branch: 1 branch
| Branch | True | False | Total |
| if (argc != 1){ |
0 |
0 |
0 |
|
| 59 |
0 |
| croak("fallback sub must return scalar!"); |
| 60 |
|
| } |
| 61 |
0 |
| retval = newSVsv(POPs); |
| 62 |
0 |
| PUTBACK; |
| 63 |
0 |
▶ | FREETMPS; |
Branch: 1 branch
| Branch | True | False | Total |
| FREETMPS; |
0 |
0 |
0 |
|
| 64 |
0 |
| LEAVE; |
| 65 |
0 |
| return retval; |
| 66 |
|
| } |
| 67 |
|
| |
| 68 |
0 |
| static SV *do_hvlookup(SV *hashref, char *str, size_t len){ |
| 69 |
0 |
| SV **val = hv_fetch((HV *)SvRV(hashref), str, len, 0 ); |
| 70 |
0 |
▶ | return val && *val ? *val : &PL_sv_undef; |
Branch: 2 branches
| Branch | True | False | Total |
| return val && *val ? *val : &PL_sv_undef; |
0 |
0 |
0 |
| return val && *val ? *val : &PL_sv_undef; |
0 |
0 |
0 |
|
| 71 |
|
| } |
| 72 |
|
| |
| 73 |
|
| |
| 74 |
0 |
| static SV *da_gsub(IV dpi, SV *src, SV *rep){ |
| 75 |
0 |
▶ | SV *result = newSV(SvCUR(src)); |
Branch: 1 branch
| Branch | True | False | Total |
| SV *result = newSV(SvCUR(src)); |
0 |
0 |
0 |
|
| 76 |
0 |
| Darts::DoubleArray *dp = INT2PTR(Darts::DoubleArray *, dpi); |
| 77 |
|
| Darts::DoubleArray::result_pair_type result_pair[MAX_NMATCH]; |
| 78 |
|
| |
| 79 |
0 |
| char *head = SvPV_nolen(src); |
| 80 |
0 |
| char *tail = head + SvCUR(src); |
| 81 |
|
| |
| 82 |
0 |
▶ | while (head < tail) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (head < tail) { |
0 |
0 |
0 |
|
| 83 |
0 |
| char *ohead = head; |
| 84 |
0 |
| size_t size, rlen = 0; |
| 85 |
0 |
▶ | while(head < tail){ |
Branch: 1 branch
| Branch | True | False | Total |
| while(head < tail){ |
0 |
0 |
0 |
|
| 86 |
|
| size = |
| 87 |
0 |
▶ | dp->commonPrefixSearch(head,result_pair, sizeof(result_pair)); |
Branch: 1 branch
| Branch | True | False | Total |
| dp->commonPrefixSearch(head,result_pair, sizeof(result_pair)); |
0 |
0 |
0 |
|
| 88 |
0 |
▶ | if (size) break; |
Branch: 1 branch
| Branch | True | False | Total |
| if (size) break; |
0 |
0 |
0 |
|
| 89 |
0 |
| head++; |
| 90 |
|
| } |
| 91 |
0 |
▶ | if (head != ohead){ |
Branch: 1 branch
| Branch | True | False | Total |
| if (head != ohead){ |
0 |
0 |
0 |
|
| 92 |
0 |
| size_t d = (head - ohead); |
| 93 |
0 |
| rlen += d; |
| 94 |
0 |
▶ | if (rlen > SvCUR(result)) SvGROW(result, SvCUR(result)*2); |
Branch: 4 branches
| Branch | True | False | Total |
| if (rlen > SvCUR(result)) SvGROW(result, SvCUR(result)*2); |
0 |
0 |
0 |
| if (rlen > SvCUR(result)) SvGROW(result, SvCUR(result)*2); |
0 |
0 |
0 |
| if (rlen > SvCUR(result)) SvGROW(result, SvCUR(result)*2); |
0 |
0 |
0 |
| if (rlen > SvCUR(result)) SvGROW(result, SvCUR(result)*2); |
0 |
0 |
0 |
|
| 95 |
0 |
▶ | sv_catpvn(result, ohead, d); |
Branch: 1 branch
| Branch | True | False | Total |
| sv_catpvn(result, ohead, d); |
0 |
0 |
0 |
|
| 96 |
|
| } |
| 97 |
0 |
▶ | if (size) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (size) { |
0 |
0 |
0 |
|
| 98 |
0 |
| size_t seekto = 0; |
| 99 |
0 |
▶ | for (size_t i = 0; i < size; ++i) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (size_t i = 0; i < size; ++i) { |
0 |
0 |
0 |
|
| 100 |
0 |
▶ | if (seekto < result_pair[i].length) |
Branch: 1 branch
| Branch | True | False | Total |
| if (seekto < result_pair[i].length) |
0 |
0 |
0 |
|
| 101 |
0 |
| seekto = result_pair[i].length; |
| 102 |
|
| } |
| 103 |
0 |
▶ | if (seekto) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (seekto) { |
0 |
0 |
0 |
|
| 104 |
0 |
| SV *ret = SvTYPE(SvRV(rep)) == SVt_PVCV |
| 105 |
0 |
▶ | ? do_callback(rep, newSVpvn(head, seekto)) |
Branch: 3 branches
| Branch | True | False | Total |
| ? do_callback(rep, newSVpvn(head, seekto)) |
0 |
0 |
0 |
| ? do_callback(rep, newSVpvn(head, seekto)) |
0 |
0 |
0 |
| ? do_callback(rep, newSVpvn(head, seekto)) |
0 |
0 |
0 |
|
| 106 |
0 |
▶ | : do_hvlookup(rep, head, seekto); |
Branch: 1 branch
| Branch | True | False | Total |
| : do_hvlookup(rep, head, seekto); |
0 |
0 |
0 |
|
| 107 |
0 |
| rlen += SvCUR(ret); |
| 108 |
0 |
▶ | if (rlen > SvCUR(result)) SvGROW(result, SvCUR(result)*2); |
Branch: 4 branches
| Branch | True | False | Total |
| if (rlen > SvCUR(result)) SvGROW(result, SvCUR(result)*2); |
0 |
0 |
0 |
| if (rlen > SvCUR(result)) SvGROW(result, SvCUR(result)*2); |
0 |
0 |
0 |
| if (rlen > SvCUR(result)) SvGROW(result, SvCUR(result)*2); |
0 |
0 |
0 |
| if (rlen > SvCUR(result)) SvGROW(result, SvCUR(result)*2); |
0 |
0 |
0 |
|
| 109 |
0 |
▶ | sv_catpvn(result, SvPVX(ret), SvCUR(ret)); |
Branch: 1 branch
| Branch | True | False | Total |
| sv_catpvn(result, SvPVX(ret), SvCUR(ret)); |
0 |
0 |
0 |
|
| 110 |
0 |
| head += seekto; |
| 111 |
|
| } |
| 112 |
|
| } |
| 113 |
|
| } |
| 114 |
0 |
| return result; |
| 115 |
|
| } |
| 116 |
|
| |
| 117 |
|
| MODULE = Text::Darts PACKAGE = Text::Darts |
| 118 |
|
| |
| 119 |
|
| IV |
| 120 |
|
| xs_make(av) |
| 121 |
|
| AV *av |
| 122 |
|
| CODE: |
| 123 |
0 |
▶ | RETVAL = da_make(av); |
Branch: 1 branch
| Branch | True | False | Total |
| RETVAL = da_make(av); |
0 |
0 |
0 |
|
| 124 |
|
| OUTPUT: |
| 125 |
|
| RETVAL |
| 126 |
|
| |
| 127 |
|
| int |
| 128 |
|
| xs_free(dpi) |
| 129 |
|
| IV dpi; |
| 130 |
|
| CODE: |
| 131 |
0 |
| RETVAL = da_free(dpi); |
| 132 |
|
| OUTPUT: |
| 133 |
|
| RETVAL |
| 134 |
|
| |
| 135 |
|
| IV |
| 136 |
|
| xs_open(filename) |
| 137 |
|
| char *filename |
| 138 |
|
| CODE: |
| 139 |
0 |
▶ | RETVAL = da_open(filename); |
Branch: 1 branch
| Branch | True | False | Total |
| RETVAL = da_open(filename); |
0 |
0 |
0 |
|
| 140 |
|
| OUTPUT: |
| 141 |
|
| RETVAL |
| 142 |
|
| |
| 143 |
|
| SV * |
| 144 |
|
| xs_gsub(dpi, src, rep) |
| 145 |
|
| IV dpi; |
| 146 |
|
| SV *src; |
| 147 |
|
| SV *rep; |
| 148 |
|
| CODE: |
| 149 |
0 |
| RETVAL = da_gsub(dpi, src, rep); |
| 150 |
|
| OUTPUT: |
| 151 |
|
| RETVAL |
| 152 |
|
| |
| 153 |
|
| size_t |
| 154 |
|
| xs_search(dpi, str) |
| 155 |
|
| IV dpi; |
| 156 |
|
| char *str; |
| 157 |
|
| CODE: |
| 158 |
0 |
▶ | RETVAL = da_search(dpi, str); |
Branch: 1 branch
| Branch | True | False | Total |
| RETVAL = da_search(dpi, str); |
0 |
0 |
0 |
|
| 159 |
|
| OUTPUT: |
| 160 |
|
| RETVAL |
| 161 |
|
| |
| 162 |
|
| char * |
| 163 |
|
| DARTS_VERSION() |
| 164 |
|
| CODE: |
| 165 |
0 |
| RETVAL = DARTS_VERSION; |
| 166 |
|
| OUTPUT: |
| 167 |
|
| RETVAL |