| 1 |
|
| #ifdef __cplusplus |
| 2 |
|
| extern "C" { |
| 3 |
|
| #endif |
| 4 |
|
| |
| 5 |
|
| #define PERL_NO_GET_CONTEXT /* we want efficiency */ |
| 6 |
|
| #include <EXTERN.h> |
| 7 |
|
| #include <perl.h> |
| 8 |
|
| #include <XSUB.h> |
| 9 |
|
| |
| 10 |
|
| #ifdef __cplusplus |
| 11 |
|
| } /* extern "C" */ |
| 12 |
|
| #endif |
| 13 |
|
| |
| 14 |
|
| #include "ppport.h" |
| 15 |
|
| |
| 16 |
|
| static char hextbl[256] = |
| 17 |
|
| /* 0 1 2 3 4 5 6 7 8 9 a b c d e f */ |
| 18 |
|
| { |
| 19 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0 */ |
| 20 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 1 */ |
| 21 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 2 */ |
| 22 |
|
| 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, /* 3 0-9 */ |
| 23 |
|
| 0,10,11,12,13,14,15, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 4 @,A-Z */ |
| 24 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 5 */ |
| 25 |
|
| 0,10,11,12,13,14,15, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 6 `,a-z */ |
| 26 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 7 */ |
| 27 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 8 */ |
| 28 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 9 */ |
| 29 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* a */ |
| 30 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* b */ |
| 31 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* c */ |
| 32 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* d */ |
| 33 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* e */ |
| 34 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* f */ |
| 35 |
|
| }; |
| 36 |
|
| |
| 37 |
|
| static |
| 38 |
|
| void |
| 39 |
61 |
| url_decode_key(const char *src, int src_len, char *d, int *key_len) { |
| 40 |
61 |
| int i, dlen=0; |
| 41 |
2300 |
▶ | for (i = 0; i < src_len; i++ ) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (i = 0; i < src_len; i++ ) { |
2239 |
61 |
2300 |
|
| 42 |
2239 |
▶ | if ((i + 2) < src_len && src[i] == '%' && isxdigit(src[i+1]) && isxdigit(src[i+2]) ) { |
Branch: 4 branches
| Branch | True | False | Total |
| if ((i + 2) < src_len && src[i] == '%' && isxdigit(src[i+1]) && isxdigit(src[i+2]) ) { |
2121 |
118 |
2239 |
| if ((i + 2) < src_len && src[i] == '%' && isxdigit(src[i+1]) && isxdigit(src[i+2]) ) { |
2 |
2119 |
2121 |
| if ((i + 2) < src_len && src[i] == '%' && isxdigit(src[i+1]) && isxdigit(src[i+2]) ) { |
2 |
0 |
2 |
| if ((i + 2) < src_len && src[i] == '%' && isxdigit(src[i+1]) && isxdigit(src[i+2]) ) { |
2 |
0 |
2 |
|
| 43 |
2 |
| d[dlen++] = hextbl[(U8)src[i+1]] * 16 + hextbl[(U8)src[i+2]]; |
| 44 |
2 |
| i += 2; |
| 45 |
|
| } |
| 46 |
|
| else { |
| 47 |
2237 |
| d[dlen++] = src[i]; |
| 48 |
|
| } |
| 49 |
|
| } |
| 50 |
61 |
| *key_len = dlen; |
| 51 |
61 |
| } |
| 52 |
|
| |
| 53 |
|
| static SV * |
| 54 |
66 |
| url_decode_val(pTHX_ const char *src, int src_len) { |
| 55 |
66 |
| int dlen = 0, i = 0; |
| 56 |
|
| char *d; |
| 57 |
|
| SV * dst; |
| 58 |
|
| |
| 59 |
|
| // Values can be quoted |
| 60 |
66 |
▶ | if (src_len > 1 && src[0] == '"' && src[src_len-1] == '"' ) { |
Branch: 3 branches
| Branch | True | False | Total |
| if (src_len > 1 && src[0] == '"' && src[src_len-1] == '"' ) { |
52 |
14 |
66 |
| if (src_len > 1 && src[0] == '"' && src[src_len-1] == '"' ) { |
5 |
47 |
52 |
| if (src_len > 1 && src[0] == '"' && src[src_len-1] == '"' ) { |
4 |
1 |
5 |
|
| 61 |
4 |
| src++; |
| 62 |
4 |
| src_len -= 2; |
| 63 |
|
| } |
| 64 |
|
| |
| 65 |
66 |
| dst = newSV(0); |
| 66 |
66 |
▶ | (void)SvUPGRADE(dst, SVt_PV); |
Branch: 1 branch
| Branch | True | False | Total |
| (void)SvUPGRADE(dst, SVt_PV); |
66 |
0 |
66 |
|
| 67 |
66 |
▶ | d = SvGROW(dst, src_len + 1); |
Branch: 2 branches
| Branch | True | False | Total |
| d = SvGROW(dst, src_len + 1); |
66 |
0 |
66 |
| d = SvGROW(dst, src_len + 1); |
66 |
0 |
66 |
|
| 68 |
|
| |
| 69 |
324 |
▶ | for (i = 0; i < src_len; i++ ) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (i = 0; i < src_len; i++ ) { |
258 |
66 |
324 |
|
| 70 |
258 |
▶ | if ( (i + 2) < src_len && src[i] == '%' && isxdigit(src[i+1]) && isxdigit(src[i+2]) ) { |
Branch: 4 branches
| Branch | True | False | Total |
| if ( (i + 2) < src_len && src[i] == '%' && isxdigit(src[i+1]) && isxdigit(src[i+2]) ) { |
151 |
107 |
258 |
| if ( (i + 2) < src_len && src[i] == '%' && isxdigit(src[i+1]) && isxdigit(src[i+2]) ) { |
18 |
133 |
151 |
| if ( (i + 2) < src_len && src[i] == '%' && isxdigit(src[i+1]) && isxdigit(src[i+2]) ) { |
18 |
0 |
18 |
| if ( (i + 2) < src_len && src[i] == '%' && isxdigit(src[i+1]) && isxdigit(src[i+2]) ) { |
18 |
0 |
18 |
|
| 71 |
18 |
| d[dlen++] = hextbl[(U8)src[i+1]] * 16 + hextbl[(U8)src[i+2]]; |
| 72 |
18 |
| i += 2; |
| 73 |
|
| } |
| 74 |
|
| else { |
| 75 |
240 |
| d[dlen++] = src[i]; |
| 76 |
|
| } |
| 77 |
|
| } |
| 78 |
|
| |
| 79 |
66 |
| SvCUR_set(dst, dlen); |
| 80 |
66 |
| *SvEND(dst) = '\0'; |
| 81 |
66 |
| SvPOK_only(dst); |
| 82 |
66 |
| return dst; |
| 83 |
|
| } |
| 84 |
|
| |
| 85 |
|
| |
| 86 |
|
| static |
| 87 |
|
| void |
| 88 |
61 |
| renewmem(pTHX_ char **d, int *cur, const int req) { |
| 89 |
61 |
▶ | if ( req > *cur ) { |
Branch: 1 branch
| Branch | True | False | Total |
| if ( req > *cur ) { |
2 |
59 |
61 |
|
| 90 |
2 |
| *cur = req; |
| 91 |
2 |
| Renew(*d, *cur, char); |
| 92 |
|
| } |
| 93 |
61 |
| } |
| 94 |
|
| |
| 95 |
|
| |
| 96 |
|
| MODULE = Cookie::Baker::XS PACKAGE = Cookie::Baker::XS |
| 97 |
|
| |
| 98 |
|
| PROTOTYPES: DISABLE |
| 99 |
|
| |
| 100 |
|
| SV * |
| 101 |
|
| xs_crush_cookie(cookie, raw_keys) |
| 102 |
|
| SV *cookie |
| 103 |
|
| SV *raw_keys |
| 104 |
|
| PREINIT: |
| 105 |
|
| char *key, *key_p, *val_p, *val_end_p; |
| 106 |
29 |
| int cur_len, key_len, val_len, key_size=64; |
| 107 |
|
| STRLEN len_left_from_orig; |
| 108 |
|
| HV *hv; |
| 109 |
|
| CODE: |
| 110 |
29 |
| hv = newHV(); |
| 111 |
29 |
▶ | if ( SvOK(cookie) ) { |
Branch: 1 branch
| Branch | True | False | Total |
| if ( SvOK(cookie) ) { |
28 |
1 |
29 |
|
| 112 |
28 |
| Newx(key, key_size, char); |
| 113 |
28 |
| key_p = (char *)SvPV(cookie, len_left_from_orig); |
| 114 |
|
| |
| 115 |
82 |
▶ | while(len_left_from_orig > 0) { |
Branch: 1 branch
| Branch | True | False | Total |
| while(len_left_from_orig > 0) { |
81 |
1 |
82 |
|
| 116 |
|
| /* strip starting spaces */ |
| 117 |
157 |
▶ | while(len_left_from_orig > 0 && (key_p[0] == ' ' || key_p[0] == ';')) { |
Branch: 3 branches
| Branch | True | False | Total |
| while(len_left_from_orig > 0 && (key_p[0] == ' ' || key_p[0] == ';')) { |
151 |
6 |
157 |
| while(len_left_from_orig > 0 && (key_p[0] == ' ' || key_p[0] == ';')) { |
69 |
82 |
151 |
| while(len_left_from_orig > 0 && (key_p[0] == ' ' || key_p[0] == ';')) { |
7 |
75 |
82 |
|
| 118 |
76 |
| key_p++; |
| 119 |
76 |
| len_left_from_orig--; |
| 120 |
|
| } |
| 121 |
|
| |
| 122 |
81 |
▶ | if (len_left_from_orig == 0) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (len_left_from_orig == 0) { |
6 |
75 |
81 |
|
| 123 |
6 |
| break; |
| 124 |
|
| } |
| 125 |
|
| |
| 126 |
75 |
| val_end_p = memchr(key_p, ';', len_left_from_orig); |
| 127 |
|
| |
| 128 |
|
| /* set cur_len to not count the ; */ |
| 129 |
75 |
▶ | if (val_end_p == NULL) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (val_end_p == NULL) { |
7 |
68 |
75 |
|
| 130 |
7 |
| cur_len = len_left_from_orig; |
| 131 |
7 |
| val_end_p = key_p + cur_len; |
| 132 |
7 |
| len_left_from_orig = 0; |
| 133 |
|
| } else { |
| 134 |
68 |
| cur_len = val_end_p - key_p; |
| 135 |
68 |
| len_left_from_orig -= cur_len + 1; |
| 136 |
|
| } |
| 137 |
|
| |
| 138 |
75 |
| val_p = memchr(key_p, '=', cur_len); |
| 139 |
75 |
▶ | if (val_p != NULL) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (val_p != NULL) { |
72 |
3 |
75 |
|
| 140 |
72 |
| key_len = val_p - key_p; |
| 141 |
|
| |
| 142 |
|
| /* drop trailing spaces from key */ |
| 143 |
72 |
▶ | while(key_len > 0 && key_p[key_len-1] == ' ') { |
Branch: 2 branches
| Branch | True | False | Total |
| while(key_len > 0 && key_p[key_len-1] == ' ') { |
72 |
0 |
72 |
| while(key_len > 0 && key_p[key_len-1] == ' ') { |
0 |
72 |
72 |
|
| 144 |
0 |
| key_len--; |
| 145 |
|
| } |
| 146 |
|
| |
| 147 |
|
| /* skip the = */ |
| 148 |
72 |
| val_p++; |
| 149 |
72 |
| val_len = val_end_p - val_p; |
| 150 |
|
| |
| 151 |
|
| /* skip starting spaces from value */ |
| 152 |
72 |
▶ | while(val_len > 0 && val_p[0] == ' ') { |
Branch: 2 branches
| Branch | True | False | Total |
| while(val_len > 0 && val_p[0] == ' ') { |
67 |
5 |
72 |
| while(val_len > 0 && val_p[0] == ' ') { |
0 |
67 |
67 |
|
| 153 |
0 |
| val_p++; |
| 154 |
0 |
| val_len--; |
| 155 |
|
| } |
| 156 |
|
| /* skip trailing spaces from value */ |
| 157 |
99 |
▶ | while(val_len > 0 && val_p[val_len-1] == ' ') { |
Branch: 2 branches
| Branch | True | False | Total |
| while(val_len > 0 && val_p[val_len-1] == ' ') { |
94 |
5 |
99 |
| while(val_len > 0 && val_p[val_len-1] == ' ') { |
27 |
67 |
94 |
|
| 158 |
27 |
| val_len--; |
| 159 |
|
| } |
| 160 |
|
| |
| 161 |
72 |
▶ | if (SvTRUE(raw_keys)) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (SvTRUE(raw_keys)) { |
11 |
61 |
72 |
|
| 162 |
11 |
▶ | if ( !hv_exists(hv, key_p, key_len) ) { |
Branch: 1 branch
| Branch | True | False | Total |
| if ( !hv_exists(hv, key_p, key_len) ) { |
9 |
2 |
11 |
|
| 163 |
9 |
| (void)hv_store(hv, key_p, key_len, |
| 164 |
|
| url_decode_val(aTHX_ val_p, val_len), 0); |
| 165 |
|
| } |
| 166 |
|
| } else { |
| 167 |
61 |
| renewmem(aTHX_ &key, &key_size, key_len); |
| 168 |
61 |
| url_decode_key(key_p, key_len, key, &key_len); |
| 169 |
61 |
▶ | if ( !hv_exists(hv, key, key_len) ) { |
Branch: 1 branch
| Branch | True | False | Total |
| if ( !hv_exists(hv, key, key_len) ) { |
57 |
4 |
61 |
|
| 170 |
57 |
| (void)hv_store(hv, key, key_len, |
| 171 |
|
| url_decode_val(aTHX_ val_p, val_len), 0); |
| 172 |
|
| } |
| 173 |
|
| } |
| 174 |
|
| } |
| 175 |
|
| |
| 176 |
75 |
▶ | if (len_left_from_orig == 0) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (len_left_from_orig == 0) { |
21 |
54 |
75 |
|
| 177 |
|
| /* bypass bogus ptr math below */ |
| 178 |
21 |
| break; |
| 179 |
|
| } |
| 180 |
|
| |
| 181 |
54 |
| key_p = val_end_p + 1; |
| 182 |
|
| } |
| 183 |
|
| |
| 184 |
28 |
| Safefree(key); |
| 185 |
|
| } |
| 186 |
29 |
| RETVAL = newRV_noinc((SV *)hv); |
| 187 |
|
| OUTPUT: |
| 188 |
|
| RETVAL |
| 189 |
|
| |