1 /* This file is part of the Scope::Upper Perl module.
2 * See http://search.cpan.org/dist/Scope-Upper/ */
4 #define PERL_NO_GET_CONTEXT
9 #define __PACKAGE__ "Scope::Upper"
15 /* --- Compatibility ------------------------------------------------------- */
17 #ifndef PERL_UNUSED_VAR
18 # define PERL_UNUSED_VAR(V)
22 # define STMT_START do
26 # define STMT_END while (0)
30 # define SU_D(X) STMT_START X STMT_END
36 # define Newx(v, n, c) New(0, v, n, c)
40 # define SvPV_const(S, L) SvPV(S, L)
43 #ifndef SvPV_nolen_const
44 # define SvPV_nolen_const(S) SvPV_nolen(S)
47 #ifndef SvREFCNT_inc_simple_void
48 # define SvREFCNT_inc_simple_void(sv) SvREFCNT_inc(sv)
52 # define HvNAME_get(H) HvNAME(H)
55 #ifndef gv_fetchpvn_flags
56 # define gv_fetchpvn_flags(A, B, C, D) gv_fetchpv((A), (C), (D))
59 #ifndef PERL_MAGIC_tied
60 # define PERL_MAGIC_tied 'P'
63 #ifndef PERL_MAGIC_env
64 # define PERL_MAGIC_env 'E'
67 #ifndef NEGATIVE_INDICES_VAR
68 # define NEGATIVE_INDICES_VAR "NEGATIVE_INDICES"
71 #define SU_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
73 /* --- Threads and multiplicity -------------------------------------------- */
83 #ifndef SU_MULTIPLICITY
84 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
85 # define SU_MULTIPLICITY 1
87 # define SU_MULTIPLICITY 0
90 #if SU_MULTIPLICITY && !defined(tTHX)
91 # define tTHX PerlInterpreter*
94 #if SU_MULTIPLICITY && defined(USE_ITHREADS) && defined(dMY_CXT) && defined(MY_CXT) && defined(START_MY_CXT) && defined(MY_CXT_INIT) && (defined(MY_CXT_CLONE) || defined(dMY_CXT_SV))
95 # define SU_THREADSAFE 1
97 # define MY_CXT_CLONE \
99 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
100 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
101 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
104 # define SU_THREADSAFE 0
106 # define dMY_CXT dNOOP
108 # define MY_CXT su_globaldata
110 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
112 # define MY_CXT_INIT NOOP
114 # define MY_CXT_CLONE NOOP
117 /* --- Stack manipulations ------------------------------------------------- */
119 #ifndef SvCANEXISTDELETE
120 # define SvCANEXISTDELETE(sv) \
122 || ((mg = mg_find((SV *) sv, PERL_MAGIC_tied)) \
123 && (stash = SvSTASH(SvRV(SvTIED_obj((SV *) sv, mg)))) \
124 && gv_fetchmethod_autoload(stash, "EXISTS", TRUE) \
125 && gv_fetchmethod_autoload(stash, "DELETE", TRUE) \
130 /* ... Saving array elements ............................................... */
132 STATIC I32 su_av_key2idx(pTHX_ AV *av, I32 key) {
133 #define su_av_key2idx(A, K) su_av_key2idx(aTHX_ (A), (K))
139 /* Added by MJD in perl-5.8.1 with 6f12eb6d2a1dfaf441504d869b27d2e40ef4966a */
140 #if SU_HAS_PERL(5, 8, 1)
141 if (SvRMAGICAL(av)) {
142 const MAGIC * const tied_magic = mg_find((SV *) av, PERL_MAGIC_tied);
144 SV * const * const negative_indices_glob =
145 hv_fetch(SvSTASH(SvRV(SvTIED_obj((SV *) (av), tied_magic))),
146 NEGATIVE_INDICES_VAR, 16, 0);
147 if (negative_indices_glob && SvTRUE(GvSV(*negative_indices_glob)))
153 idx = key + av_len(av) + 1;
167 STATIC void su_adelete(pTHX_ void *ud_) {
168 su_ud_adelete *ud = (su_ud_adelete *) ud_;
170 av_delete(ud->av, ud->idx, G_DISCARD);
171 SvREFCNT_dec(ud->av);
176 STATIC void su_save_adelete(pTHX_ AV *av, I32 idx) {
177 #define su_save_adelete(A, K) su_save_adelete(aTHX_ (A), (K))
180 Newx(ud, 1, su_ud_adelete);
183 SvREFCNT_inc_simple_void(av);
185 SAVEDESTRUCTOR_X(su_adelete, ud);
188 #define SAVEADELETE(A, K) su_save_adelete((A), (K))
190 #endif /* SAVEADELETE */
192 STATIC void su_save_aelem(pTHX_ AV *av, SV *key, SV *val) {
193 #define su_save_aelem(A, K, V) su_save_aelem(aTHX_ (A), (K), (V))
200 idx = su_av_key2idx(av, SvIV(key));
202 if (SvCANEXISTDELETE(av))
203 preeminent = av_exists(av, idx);
205 svp = av_fetch(av, idx, 1);
206 if (!svp || *svp == &PL_sv_undef) croak(PL_no_aelem, idx);
209 save_aelem(av, idx, svp);
211 SAVEADELETE(av, idx);
213 if (val) { /* local $x[$idx] = $val; */
214 SvSetMagicSV(*svp, val);
215 } else { /* local $x[$idx]; delete $x[$idx]; */
216 av_delete(av, idx, G_DISCARD);
220 /* ... Saving hash elements ................................................ */
222 STATIC void su_save_helem(pTHX_ HV *hv, SV *keysv, SV *val) {
223 #define su_save_helem(H, K, V) su_save_helem(aTHX_ (H), (K), (V))
230 if (SvCANEXISTDELETE(hv) || mg_find((SV *) hv, PERL_MAGIC_env))
231 preeminent = hv_exists_ent(hv, keysv, 0);
233 he = hv_fetch_ent(hv, keysv, 1, 0);
234 svp = he ? &HeVAL(he) : NULL;
235 if (!svp || *svp == &PL_sv_undef) croak("Modification of non-creatable hash value attempted, subscript \"%s\"", SvPV_nolen_const(*svp));
237 if (HvNAME_get(hv) && isGV(*svp)) {
238 save_gp((GV *) *svp, 0);
243 save_helem(hv, keysv, svp);
246 const char * const key = SvPV_const(keysv, keylen);
247 SAVEDELETE(hv, savepvn(key, keylen),
248 SvUTF8(keysv) ? -(I32)keylen : (I32)keylen);
251 if (val) { /* local $x{$keysv} = $val; */
252 SvSetMagicSV(*svp, val);
253 } else { /* local $x{$keysv}; delete $x{$keysv}; */
254 (void)hv_delete_ent(hv, keysv, G_DISCARD, HeHASH(he));
258 /* --- Actions ------------------------------------------------------------- */
263 void (*handler)(pTHX_ void *);
266 #define SU_UD_DEPTH(U) (((su_ud_common *) (U))->depth)
267 #define SU_UD_ORIGIN(U) (((su_ud_common *) (U))->origin)
268 #define SU_UD_HANDLER(U) (((su_ud_common *) (U))->handler)
270 #define SU_UD_FREE(U) STMT_START { \
271 if (SU_UD_ORIGIN(U)) Safefree(SU_UD_ORIGIN(U)); \
275 /* ... Reap ................................................................ */
282 STATIC void su_call(pTHX_ void *ud_) {
283 su_ud_reap *ud = (su_ud_reap *) ud_;
284 #if SU_HAS_PERL(5, 9, 5)
285 PERL_CONTEXT saved_cx;
292 PerlIO_printf(Perl_debug_log,
293 "%p: @@@ call\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
294 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
303 /* If the recently popped context isn't saved there, it will be overwritten by
304 * the sub scope from call_sv, although it's still needed in our caller. */
306 #if SU_HAS_PERL(5, 9, 5)
307 if (cxstack_ix < cxstack_max)
308 cxix = cxstack_ix + 1;
310 cxix = Perl_cxinc(aTHX);
311 saved_cx = cxstack[cxix];
314 call_sv(ud->cb, G_VOID);
316 #if SU_HAS_PERL(5, 9, 5)
317 cxstack[cxix] = saved_cx;
325 SvREFCNT_dec(ud->cb);
329 STATIC void su_reap(pTHX_ void *ud) {
330 #define su_reap(U) su_reap(aTHX_ (U))
332 PerlIO_printf(Perl_debug_log,
333 "%p: === reap\n%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
334 ud, ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
337 SAVEDESTRUCTOR_X(su_call, ud);
340 /* ... Localize & localize array/hash element .............................. */
350 STATIC void su_ud_localize_init(pTHX_ su_ud_localize *ud, SV *sv, SV *val, SV *elem) {
351 #define su_ud_localize_init(UD, S, V, E) su_ud_localize_init(aTHX_ (UD), (S), (V), (E))
355 SvREFCNT_inc_simple_void(sv);
357 if (SvTYPE(sv) >= SVt_PVGV) {
358 if (!val || !SvROK(val)) { /* local *x; or local *x = $val; */
360 } else { /* local *x = \$val; */
361 t = SvTYPE(SvRV(val));
366 const char *p = SvPV_const(sv, len), *s;
367 for (s = p, l = len; l > 0 && isSPACE(*s); ++s, --l) { }
373 case '$': t = SVt_PV; break;
374 case '@': t = SVt_PVAV; break;
375 case '%': t = SVt_PVHV; break;
376 case '&': t = SVt_PVCV; break;
377 case '*': t = SVt_PVGV; break;
382 } else if (val) { /* t == SVt_NULL, type can't be inferred from the sigil */
383 if (SvROK(val) && !sv_isobject(val)) {
384 t = SvTYPE(SvRV(val));
403 /* When deref is set, val isn't NULL */
406 ud->val = val ? newSVsv(deref ? SvRV(val) : val) : NULL;
407 ud->elem = SvREFCNT_inc(elem);
411 STATIC void su_localize(pTHX_ void *ud_) {
412 #define su_localize(U) su_localize(aTHX_ (U))
413 su_ud_localize *ud = (su_ud_localize *) ud_;
420 if (SvTYPE(sv) >= SVt_PVGV) {
424 gv = gv_fetchsv(sv, GV_ADDMULTI, t);
427 const char *name = SvPV_const(sv, len);
428 gv = gv_fetchpvn_flags(name, len, GV_ADDMULTI, t);
435 PerlIO_printf(Perl_debug_log, "%p: === localize a %s\n",ud, sv_reftype(z, 0));
436 PerlIO_printf(Perl_debug_log,
437 "%p: depth=%2d scope_ix=%2d save_ix=%2d\n",
438 ud, SU_UD_DEPTH(ud), PL_scopestack_ix, PL_savestack_ix);
442 /* Inspired from Alias.pm */
446 su_save_aelem(GvAV(gv), elem, val);
453 su_save_helem(GvHV(gv), elem, val);
459 save_gp(gv, 1); /* hide previous entry in symtab */
466 gv = (GV *) save_scalar(gv);
471 SvSetMagicSV((SV *) gv, val);
474 SvREFCNT_dec(ud->elem);
475 SvREFCNT_dec(ud->val);
476 SvREFCNT_dec(ud->sv);
480 /* --- Pop a context back -------------------------------------------------- */
484 # define SU_CXNAME PL_block_type[CxTYPE(&cxstack[cxstack_ix])]
486 # define SU_CXNAME "XXX"
490 STATIC void su_pop(pTHX_ void *ud) {
491 #define su_pop(U) su_pop(aTHX_ (U))
492 I32 depth, base, mark, *origin;
493 depth = SU_UD_DEPTH(ud);
496 PerlIO_printf(Perl_debug_log,
498 "%p: leave scope at depth=%2d scope_ix=%2d cur_top=%2d cur_base=%2d\n",
500 ud, depth, PL_scopestack_ix,PL_savestack_ix,PL_scopestack[PL_scopestack_ix])
503 origin = SU_UD_ORIGIN(ud);
504 mark = origin[depth];
505 base = origin[depth - 1];
507 SU_D(PerlIO_printf(Perl_debug_log,
508 "%p: original scope was %*c top=%2d base=%2d\n",
509 ud, 24, ' ', mark, base));
512 SU_D(PerlIO_printf(Perl_debug_log, "%p: clear leftovers\n", ud));
513 PL_savestack_ix = mark;
516 PL_savestack_ix = base;
518 SU_UD_DEPTH(ud) = --depth;
523 SAVEDESTRUCTOR_X(su_pop, ud);
525 /* Skip depths corresponding to scopes for which leave_scope() might not be
527 while (depth > 1 && PL_scopestack_ix >= i) {
528 I32 j = PL_scopestack[PL_scopestack_ix - i];
530 if (j < PL_savestack_ix)
533 SU_D(PerlIO_printf(Perl_debug_log,
534 "%p: skip scope%*cat depth=%2d scope_ix=%2d new_top=%2d >= cur_base=%2d\n",
535 ud, 6, ' ', depth, PL_scopestack_ix - i, j, PL_savestack_ix));
537 SU_UD_DEPTH(ud) = --depth;
542 SU_D(PerlIO_printf(Perl_debug_log,
543 "%p: set destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
544 ud, depth, PL_scopestack_ix, PL_savestack_ix));
546 SU_UD_HANDLER(ud)(aTHX_ ud);
549 SU_D(PerlIO_printf(Perl_debug_log,
550 "%p: --- end pop: cur_top=%2d == cur_base=%2d\n",
551 ud, PL_savestack_ix, PL_scopestack[PL_scopestack_ix]));
554 /* --- Global data --------------------------------------------------------- */
556 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
559 int stack_placeholder;
568 /* --- Initialize the stack and the action userdata ------------------------ */
570 STATIC I32 su_init(pTHX_ I32 cxix, void *ud, I32 size) {
571 #define su_init(L, U, S) su_init(aTHX_ (L), (U), (S))
572 I32 i, depth = 1, *origin;
574 SU_D(PerlIO_printf(Perl_debug_log, "%p: ### init for cx %d\n", ud, cxix));
576 for (i = cxstack_ix; i > cxix; --i) {
577 PERL_CONTEXT *cx = cxstack + i;
578 switch (CxTYPE(cx)) {
579 #if SU_HAS_PERL(5, 10, 0)
581 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is block\n", ud, i));
582 /* Given and when blocks are actually followed by a simple block, so skip
584 if (cxix > 0) { /* Implies i > 0 */
585 PERL_CONTEXT *next = cx - 1;
586 if (CxTYPE(next) == CXt_GIVEN || CxTYPE(next) == CXt_WHEN)
592 #if SU_HAS_PERL(5, 11, 0)
595 case CXt_LOOP_LAZYSV:
596 case CXt_LOOP_LAZYIV:
600 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is loop\n", ud, i));
604 SU_D(PerlIO_printf(Perl_debug_log, "%p: cx %d is other\n", ud, i));
609 SU_D(PerlIO_printf(Perl_debug_log, "%p: depth is %d\n", ud, depth));
611 Newx(origin, depth + 1, I32);
612 origin[0] = PL_scopestack[PL_scopestack_ix - depth];
613 PL_scopestack[PL_scopestack_ix - depth] += size;
614 for (i = depth - 1; i >= 1; --i) {
615 I32 j = PL_scopestack_ix - i;
616 origin[depth - i] = PL_scopestack[j];
617 PL_scopestack[j] += 3;
619 origin[depth] = PL_savestack_ix;
621 SU_UD_ORIGIN(ud) = origin;
622 SU_UD_DEPTH(ud) = depth;
624 SU_D(PerlIO_printf(Perl_debug_log,
625 "%p: set original destructor at depth=%2d scope_ix=%2d save_ix=%2d\n",
626 ud, depth, PL_scopestack_ix - 1, PL_savestack_ix));
628 /* Make sure the first destructor fires by pushing enough fake slots on the
630 if (PL_savestack_ix + 3 <= PL_scopestack[PL_scopestack_ix - 1]) {
633 save_int(&MY_CXT.stack_placeholder);
634 } while (PL_savestack_ix + 3 <= PL_scopestack[PL_scopestack_ix - 1]);
637 SAVEDESTRUCTOR_X(su_pop, ud);
640 for (i = 0; i <= depth; ++i) {
641 I32 j = PL_scopestack_ix - i;
642 PerlIO_printf(Perl_debug_log,
643 "%p: depth=%2d scope_ix=%2d saved_floor=%2d new_floor=%2d\n",
644 ud, i, j, origin[depth - i],
645 i == 0 ? PL_savestack_ix : PL_scopestack[j]);
652 /* --- Unwind stack -------------------------------------------------------- */
654 STATIC void su_unwind(pTHX_ void *ud_) {
656 I32 cxix = MY_CXT.cxix;
657 I32 items = MY_CXT.items - 1;
658 SV **savesp = MY_CXT.savesp;
661 PERL_UNUSED_VAR(ud_);
664 PL_stack_sp = savesp;
666 if (cxstack_ix > cxix)
673 mark = PL_markstack[cxstack[cxix].blk_oldmarksp];
674 *PL_markstack_ptr = PL_stack_sp - PL_stack_base - items;
678 PerlIO_printf(Perl_debug_log,
679 "%p: cx=%d gimme=%s items=%d sp=%d oldmark=%d mark=%d\n",
681 gimme == G_VOID ? "void" : gimme == G_ARRAY ? "list" : "scalar",
682 items, PL_stack_sp - PL_stack_base, *PL_markstack_ptr, mark);
685 PL_op = PL_ppaddr[OP_RETURN](aTHX);
686 *PL_markstack_ptr = mark;
688 MY_CXT.fakeop.op_next = PL_op;
689 PL_op = &(MY_CXT.fakeop);
692 /* --- XS ------------------------------------------------------------------ */
694 #if SU_HAS_PERL(5, 8, 9)
695 # define SU_SKIP_DB_MAX 2
697 # define SU_SKIP_DB_MAX 3
700 /* Skip context sequences of 1 to SU_SKIP_DB_MAX (included) block contexts
701 * followed by a DB sub */
703 #define SU_SKIP_DB(C) \
706 PERL_CONTEXT *base = cxstack; \
707 PERL_CONTEXT *cx = base + (C); \
708 while (cx >= base && (C) > skipped && CxTYPE(cx) == CXt_BLOCK) \
710 if (cx >= base && (C) > skipped) { \
711 switch (CxTYPE(cx)) { \
713 if (skipped <= SU_SKIP_DB_MAX && cx->blk_sub.cv == GvCV(PL_DBsub)) \
714 (C) -= skipped + 1; \
722 #define SU_GET_CONTEXT(A, B) \
731 else if (cxix > cxstack_ix) \
741 #define SU_GET_LEVEL(A, B) \
754 XS(XS_Scope__Upper_unwind); /* prototype to pass -Wmissing-prototypes */
756 XS(XS_Scope__Upper_unwind) {
765 PERL_UNUSED_VAR(cv); /* -W */
766 PERL_UNUSED_VAR(ax); /* -Wall */
768 SU_GET_CONTEXT(0, items - 1);
770 PERL_CONTEXT *cx = cxstack + cxix;
771 switch (CxTYPE(cx)) {
773 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
778 MY_CXT.items = items;
779 /* pp_entersub will want to sanitize the stack after returning from there
780 * Screw that, we're insane */
781 if (GIMME_V == G_SCALAR) {
782 MY_CXT.savesp = PL_stack_sp;
783 /* dXSARGS calls POPMARK, so we need to match PL_markstack_ptr[1] */
784 PL_stack_sp = PL_stack_base + PL_markstack_ptr[1] + 1;
786 MY_CXT.savesp = NULL;
788 SAVEDESTRUCTOR_X(su_unwind, NULL);
793 } while (--cxix >= 0);
794 croak("Can't return outside a subroutine");
797 MODULE = Scope::Upper PACKAGE = Scope::Upper
806 MY_CXT.stack_placeholder = 0;
808 stash = gv_stashpv(__PACKAGE__, 1);
809 newCONSTSUB(stash, "TOP", newSViv(0));
810 newCONSTSUB(stash, "SU_THREADSAFE", newSVuv(SU_THREADSAFE));
812 newXSproto("Scope::Upper::unwind", XS_Scope__Upper_unwind, file, NULL);
821 PERL_UNUSED_VAR(items);
826 #endif /* SU_THREADSAFE */
832 I32 cxix = cxstack_ix;
836 RETVAL = newSViv(cxix);
846 SU_GET_CONTEXT(0, 0);
851 RETVAL = newSViv(cxix);
861 SU_GET_CONTEXT(0, 0);
862 for (; cxix >= 0; --cxix) {
863 PERL_CONTEXT *cx = cxstack + cxix;
864 switch (CxTYPE(cx)) {
868 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
870 ST(0) = sv_2mortal(newSViv(cxix));
882 SU_GET_CONTEXT(0, 0);
883 for (; cxix >= 0; --cxix) {
884 PERL_CONTEXT *cx = cxstack + cxix;
885 switch (CxTYPE(cx)) {
889 ST(0) = sv_2mortal(newSViv(cxix));
916 ST(0) = sv_2mortal(newSViv(cxix));
926 for (cxix = cxstack_ix; cxix > 0; --cxix) {
927 PERL_CONTEXT *cx = cxstack + cxix;
928 switch (CxTYPE(cx)) {
930 if (PL_DBsub && cx->blk_sub.cv == GvCV(PL_DBsub))
940 ST(0) = sv_2mortal(newSViv(cxix));
949 SU_GET_CONTEXT(0, 0);
951 PERL_CONTEXT *cx = cxstack + cxix--;
952 switch (CxTYPE(cx)) {
956 I32 gimme = cx->blk_gimme;
958 case G_VOID: XSRETURN_UNDEF; break;
959 case G_SCALAR: XSRETURN_NO; break;
960 case G_ARRAY: XSRETURN_YES; break;
975 SU_GET_CONTEXT(1, 1);
976 Newx(ud, 1, su_ud_reap);
977 SU_UD_ORIGIN(ud) = NULL;
978 SU_UD_HANDLER(ud) = su_reap;
979 ud->cb = newSVsv(hook);
980 su_init(cxix, ud, 3);
983 localize(SV *sv, SV *val, ...)
990 SU_GET_CONTEXT(2, 2);
991 Newx(ud, 1, su_ud_localize);
992 SU_UD_ORIGIN(ud) = NULL;
993 SU_UD_HANDLER(ud) = su_localize;
994 su_ud_localize_init(ud, sv, val, NULL);
995 #if !SU_HAS_PERL(5, 8, 9)
996 if (ud->type >= SVt_PVGV)
999 su_init(cxix, ud, size);
1002 localize_elem(SV *sv, SV *elem, SV *val, ...)
1008 SU_GET_CONTEXT(3, 3);
1009 Newx(ud, 1, su_ud_localize);
1010 SU_UD_ORIGIN(ud) = NULL;
1011 SU_UD_HANDLER(ud) = su_localize;
1012 su_ud_localize_init(ud, sv, val, elem);
1013 su_init(cxix, ud, 4);
1016 localize_delete(SV *sv, SV *elem, ...)
1023 SU_GET_CONTEXT(2, 2);
1024 Newx(ud, 1, su_ud_localize);
1025 SU_UD_ORIGIN(ud) = NULL;
1026 SU_UD_HANDLER(ud) = su_localize;
1027 su_ud_localize_init(ud, sv, NULL, elem);
1028 #if !SU_HAS_PERL(5, 8, 9)
1029 if (ud->type >= SVt_PVGV)
1032 su_init(cxix, ud, size);