1 #define PERL_IN_XS_APITEST
7 typedef PTR_TBL_t *XS__APItest__PtrTable;
11 #define MY_CXT_KEY "XS::APItest::_guts" XS_VERSION
20 /* indirect functions to test the [pa]MY_CXT macros */
23 my_cxt_getint_p(pMY_CXT)
29 my_cxt_setint_p(pMY_CXT_ int i)
35 my_cxt_getsv_interp_context(void)
38 dMY_CXT_INTERP(my_perl);
43 my_cxt_getsv_interp(void)
50 my_cxt_setsv_p(SV* sv _pMY_CXT)
56 /* from exception.c */
57 int apitest_exception(int);
59 /* from core_or_not.inc */
60 bool sv_setsv_cow_hashkey_core(void);
61 bool sv_setsv_cow_hashkey_notcore(void);
63 /* A routine to test hv_delayfree_ent
64 (which itself is tested by testing on hv_free_ent */
66 typedef void (freeent_function)(pTHX_ HV *, register HE *);
69 test_freeent(freeent_function *f) {
72 HV *test_hash = newHV();
79 victim = (HE*)safemalloc(sizeof(HE));
81 /* Storing then deleting something should ensure that a hash entry is
83 hv_store(test_hash, "", 0, &PL_sv_yes, 0);
84 hv_delete(test_hash, "", 0, 0);
86 /* We need to "inline" new_he here as it's static, and the functions we
87 test expect to be able to call del_HE on the HE */
88 if (!PL_body_roots[HE_SVSLOT])
89 croak("PL_he_root is 0");
90 victim = (HE*) PL_body_roots[HE_SVSLOT];
91 PL_body_roots[HE_SVSLOT] = HeNEXT(victim);
94 victim->hent_hek = Perl_share_hek(aTHX_ "", 0, 0);
96 test_scalar = newSV(0);
97 SvREFCNT_inc(test_scalar);
98 HeVAL(victim) = test_scalar;
100 /* Need this little game else we free the temps on the return stack. */
101 results[0] = SvREFCNT(test_scalar);
103 results[1] = SvREFCNT(test_scalar);
104 f(aTHX_ test_hash, victim);
105 results[2] = SvREFCNT(test_scalar);
107 results[3] = SvREFCNT(test_scalar);
112 } while (++i < sizeof(results)/sizeof(results[0]));
114 /* Goodbye to our extra reference. */
115 SvREFCNT_dec(test_scalar);
120 bitflip_key(pTHX_ IV action, SV *field) {
121 MAGIC *mg = mg_find(field, PERL_MAGIC_uvar);
123 if (mg && (keysv = mg->mg_obj)) {
125 const char *p = SvPV(keysv, len);
128 SV *newkey = newSV(len);
129 char *new_p = SvPVX(newkey);
132 const char *const end = p + len;
135 UV chr = utf8_to_uvuni((U8 *)p, &len);
136 new_p = (char *)uvuni_to_utf8((U8 *)new_p, chr ^ 32);
142 *new_p++ = *p++ ^ 32;
145 SvCUR_set(newkey, SvCUR(keysv));
155 rot13_key(pTHX_ IV action, SV *field) {
156 MAGIC *mg = mg_find(field, PERL_MAGIC_uvar);
158 if (mg && (keysv = mg->mg_obj)) {
160 const char *p = SvPV(keysv, len);
163 SV *newkey = newSV(len);
164 char *new_p = SvPVX(newkey);
166 /* There's a deliberate fencepost error here to loop len + 1 times
167 to copy the trailing \0 */
170 /* Try doing this cleanly and clearly in EBCDIC another way: */
172 case 'A': new_c = 'N'; break;
173 case 'B': new_c = 'O'; break;
174 case 'C': new_c = 'P'; break;
175 case 'D': new_c = 'Q'; break;
176 case 'E': new_c = 'R'; break;
177 case 'F': new_c = 'S'; break;
178 case 'G': new_c = 'T'; break;
179 case 'H': new_c = 'U'; break;
180 case 'I': new_c = 'V'; break;
181 case 'J': new_c = 'W'; break;
182 case 'K': new_c = 'X'; break;
183 case 'L': new_c = 'Y'; break;
184 case 'M': new_c = 'Z'; break;
185 case 'N': new_c = 'A'; break;
186 case 'O': new_c = 'B'; break;
187 case 'P': new_c = 'C'; break;
188 case 'Q': new_c = 'D'; break;
189 case 'R': new_c = 'E'; break;
190 case 'S': new_c = 'F'; break;
191 case 'T': new_c = 'G'; break;
192 case 'U': new_c = 'H'; break;
193 case 'V': new_c = 'I'; break;
194 case 'W': new_c = 'J'; break;
195 case 'X': new_c = 'K'; break;
196 case 'Y': new_c = 'L'; break;
197 case 'Z': new_c = 'M'; break;
198 case 'a': new_c = 'n'; break;
199 case 'b': new_c = 'o'; break;
200 case 'c': new_c = 'p'; break;
201 case 'd': new_c = 'q'; break;
202 case 'e': new_c = 'r'; break;
203 case 'f': new_c = 's'; break;
204 case 'g': new_c = 't'; break;
205 case 'h': new_c = 'u'; break;
206 case 'i': new_c = 'v'; break;
207 case 'j': new_c = 'w'; break;
208 case 'k': new_c = 'x'; break;
209 case 'l': new_c = 'y'; break;
210 case 'm': new_c = 'z'; break;
211 case 'n': new_c = 'a'; break;
212 case 'o': new_c = 'b'; break;
213 case 'p': new_c = 'c'; break;
214 case 'q': new_c = 'd'; break;
215 case 'r': new_c = 'e'; break;
216 case 's': new_c = 'f'; break;
217 case 't': new_c = 'g'; break;
218 case 'u': new_c = 'h'; break;
219 case 'v': new_c = 'i'; break;
220 case 'w': new_c = 'j'; break;
221 case 'x': new_c = 'k'; break;
222 case 'y': new_c = 'l'; break;
223 case 'z': new_c = 'm'; break;
227 SvCUR_set(newkey, SvCUR(keysv));
239 rmagical_a_dummy(pTHX_ IV idx, SV *sv) {
243 STATIC MGVTBL rmagical_b = { 0 };
245 #include "const-c.inc"
247 MODULE = XS::APItest:Hash PACKAGE = XS::APItest::Hash
249 INCLUDE: const-xs.inc
257 uf.uf_val = rot13_key;
261 sv_magic((SV*)hash, NULL, PERL_MAGIC_uvar, (char*)&uf, sizeof(uf));
270 uf.uf_val = bitflip_key;
274 sv_magic((SV*)hash, NULL, PERL_MAGIC_uvar, (char*)&uf, sizeof(uf));
277 #define UTF8KLEN(sv, len) (SvUTF8(sv) ? -(I32)len : (I32)len)
288 key = SvPV(key_sv, len);
289 RETVAL = hv_exists(hash, key, UTF8KLEN(key_sv, len));
294 exists_ent(hash, key_sv)
300 RETVAL = hv_exists_ent(hash, key_sv, 0);
305 delete(hash, key_sv, flags = 0)
314 key = SvPV(key_sv, len);
315 /* It's already mortal, so need to increase reference count. */
317 = SvREFCNT_inc(hv_delete(hash, key, UTF8KLEN(key_sv, len), flags));
322 delete_ent(hash, key_sv, flags = 0)
328 /* It's already mortal, so need to increase reference count. */
329 RETVAL = SvREFCNT_inc(hv_delete_ent(hash, key_sv, flags, 0));
334 store_ent(hash, key, value)
344 result = hv_store_ent(hash, key, copy, 0);
345 SvSetMagicSV(copy, value);
350 /* It's about to become mortal, so need to increase reference count.
352 RETVAL = SvREFCNT_inc(HeVAL(result));
357 store(hash, key_sv, value)
368 key = SvPV(key_sv, len);
370 result = hv_store(hash, key, UTF8KLEN(key_sv, len), copy, 0);
371 SvSetMagicSV(copy, value);
376 /* It's about to become mortal, so need to increase reference count.
378 RETVAL = SvREFCNT_inc(*result);
383 fetch_ent(hash, key_sv)
390 result = hv_fetch_ent(hash, key_sv, 0, 0);
395 RETVAL = newSVsv(HeVAL(result));
409 key = SvPV(key_sv, len);
410 result = hv_fetch(hash, key, UTF8KLEN(key_sv, len), 0);
415 RETVAL = newSVsv(*result);
419 #if defined (hv_common)
429 const char *key = NULL;
437 if ((svp = hv_fetchs(params, "hv", 0))) {
440 croak("common passed a non-reference for parameter hv");
443 if ((svp = hv_fetchs(params, "keysv", 0)))
445 if ((svp = hv_fetchs(params, "keypv", 0))) {
446 key = SvPV_const(*svp, klen);
450 if ((svp = hv_fetchs(params, "action", 0)))
452 if ((svp = hv_fetchs(params, "val", 0)))
454 if ((svp = hv_fetchs(params, "hash", 0)))
457 if ((svp = hv_fetchs(params, "hash_pv", 0))) {
458 PERL_HASH(hash, key, klen);
460 if ((svp = hv_fetchs(params, "hash_sv", 0))) {
462 const char *const p = SvPV(keysv, len);
463 PERL_HASH(hash, p, len);
466 result = (HE *)hv_common(hv, keysv, key, klen, flags, action, val, hash);
471 RETVAL = newSVsv(HeVAL(result));
480 test_freeent(&Perl_hv_free_ent);
484 test_hv_delayfree_ent()
486 test_freeent(&Perl_hv_delayfree_ent);
490 test_share_unshare_pvn(input)
499 pvx = SvPV(input, len);
500 PERL_HASH(hash, pvx, len);
501 p = sharepvn(pvx, len, hash);
502 RETVAL = newSVpvn(p, len);
503 unsharepvn(p, len, hash);
507 #if PERL_VERSION >= 9
510 refcounted_he_exists(key, level=0)
515 croak("level must be zero, not %"IVdf, level);
517 RETVAL = (Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash,
519 != &PL_sv_placeholder);
524 refcounted_he_fetch(key, level=0)
529 croak("level must be zero, not %"IVdf, level);
531 RETVAL = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash, key,
533 SvREFCNT_inc(RETVAL);
541 sub TIEHASH { bless {}, $_[0] }
542 sub STORE { $_[0]->{$_[1]} = $_[2] }
543 sub FETCH { $_[0]->{$_[1]} }
544 sub FIRSTKEY { my $a = scalar keys %{$_[0]}; each %{$_[0]} }
545 sub NEXTKEY { each %{$_[0]} }
546 sub EXISTS { exists $_[0]->{$_[1]} }
547 sub DELETE { delete $_[0]->{$_[1]} }
548 sub CLEAR { %{$_[0]} = () }
552 MODULE = XS::APItest::PtrTable PACKAGE = XS::APItest::PtrTable PREFIX = ptr_table_
555 ptr_table_new(classname)
556 const char * classname
558 PUSHs(sv_setref_pv(sv_newmortal(), classname, (void*)ptr_table_new()));
562 XS::APItest::PtrTable table
564 ptr_table_free(table);
567 ptr_table_store(table, from, to)
568 XS::APItest::PtrTable table
572 ptr_table_store(table, from, to);
575 ptr_table_fetch(table, from)
576 XS::APItest::PtrTable table
579 RETVAL = PTR2UV(ptr_table_fetch(table, from));
584 ptr_table_split(table)
585 XS::APItest::PtrTable table
588 ptr_table_clear(table)
589 XS::APItest::PtrTable table
591 MODULE = XS::APItest PACKAGE = XS::APItest
599 MY_CXT.sv = newSVpv("initial",0);
606 MY_CXT.sv = newSVpv("initial_clone",0);
612 printf("%5.3f\n",val);
617 #ifdef HAS_LONG_DOUBLE
628 #ifdef HAS_LONG_DOUBLE
629 # if defined(PERL_PRIfldbl) && (LONG_DOUBLESIZE > DOUBLESIZE)
630 long double val = 7.0;
631 printf("%5.3" PERL_PRIfldbl "\n",val);
634 printf("%5.3f\n",val);
654 printf("%5.3f\n",val);
731 call_sv(sv, flags, ...)
737 for (i=0; i<items-2; i++)
738 ST(i) = ST(i+2); /* pop first two args */
742 i = call_sv(sv, flags);
745 PUSHs(sv_2mortal(newSViv(i)));
748 call_pv(subname, flags, ...)
754 for (i=0; i<items-2; i++)
755 ST(i) = ST(i+2); /* pop first two args */
759 i = call_pv(subname, flags);
762 PUSHs(sv_2mortal(newSViv(i)));
765 call_method(methname, flags, ...)
771 for (i=0; i<items-2; i++)
772 ST(i) = ST(i+2); /* pop first two args */
776 i = call_method(methname, flags);
779 PUSHs(sv_2mortal(newSViv(i)));
789 i = eval_sv(sv, flags);
792 PUSHs(sv_2mortal(newSViv(i)));
795 eval_pv(p, croak_on_error)
801 PUSHs(eval_pv(p, croak_on_error));
811 apitest_exception(throw_e)
821 Perl_croak(aTHX_ "%s", SvPV_nolen(sv));
824 Perl_croak(aTHX_ NULL);
830 RETVAL = newRV_inc((SV*)PL_strtab);
838 RETVAL = my_cxt_getint_p(aMY_CXT);
847 my_cxt_setint_p(aMY_CXT_ i);
854 ST(0) = how ? my_cxt_getsv_interp_context() : my_cxt_getsv_interp();
862 SvREFCNT_dec(MY_CXT.sv);
863 my_cxt_setsv_p(sv _aMY_CXT);
867 sv_setsv_cow_hashkey_core()
870 sv_setsv_cow_hashkey_notcore()
873 rmagical_cast(sv, type)
879 if (!SvOK(sv) || !SvROK(sv) || !SvOK(type)) { XSRETURN_UNDEF; }
881 if (SvTYPE(sv) != SVt_PVHV) { XSRETURN_UNDEF; }
882 uf.uf_val = rmagical_a_dummy;
885 if (SvTRUE(type)) { /* b */
886 sv_magicext(sv, NULL, PERL_MAGIC_ext, &rmagical_b, NULL, 0);
888 sv_magic(sv, NULL, PERL_MAGIC_uvar, (char *) &uf, sizeof(uf));
896 if (!SvOK(sv) || !SvROK(sv)) { XSRETURN_UNDEF; }
899 mXPUSHu(SvFLAGS(sv) & SVs_GMG);
900 mXPUSHu(SvFLAGS(sv) & SVs_SMG);
901 mXPUSHu(SvFLAGS(sv) & SVs_RMG);
909 ST (0) = newSVpv (Perl_sv_peek (aTHX_ sv), 0);
915 sv_inc(get_sv("XS::APItest::BEGIN_called", GV_ADD|GV_ADDMULTI));
920 sv_inc(get_sv("XS::APItest::CHECK_called", GV_ADD|GV_ADDMULTI));
925 sv_inc(get_sv("XS::APItest::UNITCHECK_called", GV_ADD|GV_ADDMULTI));
930 sv_inc(get_sv("XS::APItest::INIT_called", GV_ADD|GV_ADDMULTI));
935 sv_inc(get_sv("XS::APItest::END_called", GV_ADD|GV_ADDMULTI));
938 utf16_to_utf8 (sv, ...)
941 utf16_to_utf8_reversed = 1
946 I32 got; /* Gah, badly thought out APIs */
948 source = (U8 *)SvPVbyte(sv, len);
949 /* Optionally only convert part of the buffer. */
953 /* Mortalise this right now, as we'll be testing croak()s */
954 dest = sv_2mortal(newSV(len * 3 / 2 + 1));
956 utf16_to_utf8_reversed(source, (U8 *)SvPVX(dest), len, &got);
958 utf16_to_utf8(source, (U8 *)SvPVX(dest), len, &got);
960 SvCUR_set(dest, got);
961 SvPVX(dest)[got] = '\0';
967 my_exit(int exitcode)
974 RETVAL = PL_sv_count;