/* av.c
*
* Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
- * 2000, 2001, 2002, 2003, 2004, 2005 by Larry Wall and others
+ * 2000, 2001, 2002, 2003, 2004, 2005, 2006, by Larry Wall and others
*
* You may distribute under the terms of either the GNU General Public
* License or the Artistic License, as specified in the README file.
void
Perl_av_reify(pTHX_ AV *av)
{
+ dVAR;
I32 key;
+ assert(av);
+
if (AvREAL(av))
return;
#ifdef DEBUGGING
SV * const sv = AvARRAY(av)[--key];
assert(sv);
if (sv != &PL_sv_undef)
- (void)SvREFCNT_inc(sv);
+ SvREFCNT_inc_void_NN(sv);
}
key = AvARRAY(av) - AvALLOC(av);
while (key)
void
Perl_av_extend(pTHX_ AV *av, I32 key)
{
- MAGIC * const mg = SvTIED_mg((SV*)av, PERL_MAGIC_tied);
+ dVAR;
+ MAGIC *mg;
+
+ assert(av);
+
+ mg = SvTIED_mg((SV*)av, PERL_MAGIC_tied);
if (mg) {
dSP;
ENTER;
SV**
Perl_av_fetch(pTHX_ register AV *av, I32 key, I32 lval)
{
+ dVAR;
SV *sv;
- if (!av)
- return 0;
+ assert(av);
if (SvRMAGICAL(av)) {
const MAGIC * const tied_magic = mg_find((SV*)av, PERL_MAGIC_tied);
if (key > AvFILLp(av)) {
if (!lval)
return 0;
- sv = NEWSV(5,0);
+ sv = newSV(0);
return av_store(av,key,sv);
}
if (AvARRAY(av)[key] == &PL_sv_undef) {
emptyness:
if (lval) {
- sv = NEWSV(6,0);
+ sv = newSV(0);
return av_store(av,key,sv);
}
return 0;
SV**
Perl_av_store(pTHX_ register AV *av, I32 key, SV *val)
{
+ dVAR;
SV** ary;
- if (!av)
- return 0;
+ assert(av);
+
+ /* S_regclass relies on being able to pass in a NULL sv
+ (unicode_alternate may be NULL).
+ */
+
if (!val)
val = &PL_sv_undef;
ary[key] = val;
if (SvSMAGICAL(av)) {
if (val != &PL_sv_undef) {
- MAGIC* mg = SvMAGIC(av);
+ const MAGIC* const mg = SvMAGIC(av);
sv_magic(val, (SV*)av, toLOWER(mg->mg_type), 0, key);
}
mg_set((SV*)av);
AV *
Perl_newAV(pTHX)
{
- register AV * const av = (AV*)NEWSV(3,0);
+ register AV * const av = (AV*)newSV(0);
sv_upgrade((SV *)av, SVt_PVAV);
/* sv_upgrade does AvREAL_only() */
AvALLOC(av) = 0;
- SvPV_set(av, (char*)0);
+ SvPV_set(av, NULL);
AvMAX(av) = AvFILLp(av) = -1;
return av;
}
AV *
Perl_av_make(pTHX_ register I32 size, register SV **strp)
{
- register AV * const av = (AV*)NEWSV(8,0);
+ register AV * const av = (AV*)newSV(0);
sv_upgrade((SV *) av,SVt_PVAV);
/* sv_upgrade does AvREAL_only() */
AvMAX(av) = size - 1;
for (i = 0; i < size; i++) {
assert (*strp);
- ary[i] = NEWSV(7,0);
+ ary[i] = newSV(0);
sv_setsv(ary[i], *strp);
strp++;
}
void
Perl_av_clear(pTHX_ register AV *av)
{
+ dVAR;
register I32 key;
+ assert(av);
#ifdef DEBUGGING
if (SvREFCNT(av) == 0 && ckWARN_d(WARN_DEBUGGING)) {
Perl_warner(aTHX_ packWARN(WARN_DEBUGGING), "Attempt to clear deleted array");
}
#endif
- if (!av)
- return;
if (SvREADONLY(av))
Perl_croak(aTHX_ PL_no_modify);
void
Perl_av_undef(pTHX_ register AV *av)
{
- if (!av)
- return;
+ assert(av);
/* Give any tie a chance to cleanup first */
if (SvTIED_mg((SV*)av, PERL_MAGIC_tied))
}
Safefree(AvALLOC(av));
AvALLOC(av) = 0;
- SvPV_set(av, (char*)0);
+ SvPV_set(av, NULL);
AvMAX(av) = AvFILLp(av) = -1;
}
{
dVAR;
MAGIC *mg;
- if (!av)
- return;
+ assert(av);
+
if (SvREADONLY(av))
Perl_croak(aTHX_ PL_no_modify);
SV *retval;
MAGIC* mg;
- if (!av)
- return &PL_sv_undef;
+ assert(av);
+
if (SvREADONLY(av))
Perl_croak(aTHX_ PL_no_modify);
if ((mg = SvTIED_mg((SV*)av, PERL_MAGIC_tied))) {
register I32 i;
MAGIC* mg;
- if (!av)
- return;
+ assert(av);
+
if (SvREADONLY(av))
Perl_croak(aTHX_ PL_no_modify);
SV *retval;
MAGIC* mg;
- if (!av)
- return &PL_sv_undef;
+ assert(av);
+
if (SvREADONLY(av))
Perl_croak(aTHX_ PL_no_modify);
if ((mg = SvTIED_mg((SV*)av, PERL_MAGIC_tied))) {
I32
Perl_av_len(pTHX_ register const AV *av)
{
+ assert(av);
return AvFILL(av);
}
{
dVAR;
MAGIC *mg;
- if (!av)
- Perl_croak(aTHX_ "panic: null array");
+
+ assert(av);
+
if (fill < 0)
fill = -1;
if ((mg = SvTIED_mg((SV*)av, PERL_MAGIC_tied))) {
}
if (fill <= AvMAX(av)) {
I32 key = AvFILLp(av);
- SV** ary = AvARRAY(av);
+ SV** const ary = AvARRAY(av);
if (AvREAL(av)) {
while (key > fill) {
SV *
Perl_av_delete(pTHX_ AV *av, I32 key, I32 flags)
{
+ dVAR;
SV *sv;
- if (!av)
- return Nullsv;
+ assert(av);
+
if (SvREADONLY(av))
Perl_croak(aTHX_ PL_no_modify);
if (adjust_index) {
key += AvFILL(av) + 1;
if (key < 0)
- return Nullsv;
+ return NULL;
}
}
svp = av_fetch(av, key, TRUE);
sv_unmagic(sv, PERL_MAGIC_tiedelem); /* No longer an element */
return sv;
}
- return Nullsv;
+ return NULL;
}
}
}
if (key < 0) {
key += AvFILL(av) + 1;
if (key < 0)
- return Nullsv;
+ return NULL;
}
if (key > AvFILLp(av))
- return Nullsv;
+ return NULL;
else {
if (!AvREAL(av) && AvREIFY(av))
av_reify(av);
}
if (flags & G_DISCARD) {
SvREFCNT_dec(sv);
- sv = Nullsv;
+ sv = NULL;
}
else if (AvREAL(av))
sv = sv_2mortal(sv);
bool
Perl_av_exists(pTHX_ AV *av, I32 key)
{
- if (!av)
- return FALSE;
-
+ dVAR;
+ assert(av);
if (SvRMAGICAL(av)) {
const MAGIC * const tied_magic = mg_find((SV*)av, PERL_MAGIC_tied);
if (tied_magic || mg_find((SV*)av, PERL_MAGIC_regdata)) {
- SV *sv = sv_newmortal();
+ SV * const sv = sv_newmortal();
MAGIC *mg;
/* Handle negative array indices 20020222 MJD */
if (key < 0) {
SV **
Perl_av_arylen_p(pTHX_ AV *av) {
dVAR;
- MAGIC *mg = mg_find((SV*)av, PERL_MAGIC_arylen_p);
+ MAGIC *mg;
+
+ assert(av);
+
+ mg = mg_find((SV*)av, PERL_MAGIC_arylen_p);
if (!mg) {
mg = sv_magicext((SV*)av, 0, PERL_MAGIC_arylen_p, &PL_vtbl_arylen_p,
0, 0);
-
- if (!mg) {
- Perl_die(aTHX_ "panic: av_arylen_p");
- }
+ assert(mg);
/* sv_magicext won't set this for us because we pass in a NULL obj */
mg->mg_flags |= MGf_REFCOUNTED;
}