File: Size.xs

package info (click to toggle)
libdevel-size-perl 0.71-1
  • links: PTS, VCS
  • area: main
  • in suites: squeeze
  • size: 172 kB
  • ctags: 93
  • sloc: perl: 1,198; makefile: 15
file content (846 lines) | stat: -rw-r--r-- 25,087 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"

static int regex_whine;
static int fm_whine;

#if 0 && defined(DEBUGGING)
#define dbg_printf(x) printf x
#else
#define dbg_printf(x)
#endif

#define carp puts
UV thing_size(SV *, HV *);
typedef enum {
    OPc_NULL,	/* 0 */
    OPc_BASEOP,	/* 1 */
    OPc_UNOP,	/* 2 */
    OPc_BINOP,	/* 3 */
    OPc_LOGOP,	/* 4 */
    OPc_LISTOP,	/* 5 */
    OPc_PMOP,	/* 6 */
    OPc_SVOP,	/* 7 */
    OPc_PADOP,	/* 8 */
    OPc_PVOP,	/* 9 */
    OPc_LOOP,	/* 10 */
    OPc_COP	/* 11 */
} opclass;

static opclass
cc_opclass(OP *o)
{
    if (!o)
	return OPc_NULL;

    if (o->op_type == 0)
	return (o->op_flags & OPf_KIDS) ? OPc_UNOP : OPc_BASEOP;

    if (o->op_type == OP_SASSIGN)
	return ((o->op_private & OPpASSIGN_BACKWARDS) ? OPc_UNOP : OPc_BINOP);

#ifdef USE_ITHREADS
    if (o->op_type == OP_GV || o->op_type == OP_GVSV || o->op_type == OP_AELEMFAST)
	return OPc_PADOP;
#endif

    if ((o->op_type = OP_TRANS)) {
      return OPc_BASEOP;
    }

    switch (PL_opargs[o->op_type] & OA_CLASS_MASK) {
    case OA_BASEOP:
	return OPc_BASEOP;

    case OA_UNOP:
	return OPc_UNOP;

    case OA_BINOP:
	return OPc_BINOP;

    case OA_LOGOP:
	return OPc_LOGOP;

    case OA_LISTOP:
	return OPc_LISTOP;

    case OA_PMOP:
	return OPc_PMOP;

    case OA_SVOP:
	return OPc_SVOP;

    case OA_PADOP:
	return OPc_PADOP;

    case OA_PVOP_OR_SVOP:
        /*
         * Character translations (tr///) are usually a PVOP, keeping a 
         * pointer to a table of shorts used to look up translations.
         * Under utf8, however, a simple table isn't practical; instead,
         * the OP is an SVOP, and the SV is a reference to a swash
         * (i.e., an RV pointing to an HV).
         */
	return (o->op_private & (OPpTRANS_TO_UTF|OPpTRANS_FROM_UTF))
		? OPc_SVOP : OPc_PVOP;

    case OA_LOOP:
	return OPc_LOOP;

    case OA_COP:
	return OPc_COP;

    case OA_BASEOP_OR_UNOP:
	/*
	 * UNI(OP_foo) in toke.c returns token UNI or FUNC1 depending on
	 * whether parens were seen. perly.y uses OPf_SPECIAL to
	 * signal whether a BASEOP had empty parens or none.
	 * Some other UNOPs are created later, though, so the best
	 * test is OPf_KIDS, which is set in newUNOP.
	 */
	return (o->op_flags & OPf_KIDS) ? OPc_UNOP : OPc_BASEOP;

    case OA_FILESTATOP:
	/*
	 * The file stat OPs are created via UNI(OP_foo) in toke.c but use
	 * the OPf_REF flag to distinguish between OP types instead of the
	 * usual OPf_SPECIAL flag. As usual, if OPf_KIDS is set, then we
	 * return OPc_UNOP so that walkoptree can find our children. If
	 * OPf_KIDS is not set then we check OPf_REF. Without OPf_REF set
	 * (no argument to the operator) it's an OP; with OPf_REF set it's
	 * an SVOP (and op_sv is the GV for the filehandle argument).
	 */
	return ((o->op_flags & OPf_KIDS) ? OPc_UNOP :
#ifdef USE_ITHREADS
		(o->op_flags & OPf_REF) ? OPc_PADOP : OPc_BASEOP);
#else
		(o->op_flags & OPf_REF) ? OPc_SVOP : OPc_BASEOP);
#endif
    case OA_LOOPEXOP:
	/*
	 * next, last, redo, dump and goto use OPf_SPECIAL to indicate that a
	 * label was omitted (in which case it's a BASEOP) or else a term was
	 * seen. In this last case, all except goto are definitely PVOP but
	 * goto is either a PVOP (with an ordinary constant label), an UNOP
	 * with OPf_STACKED (with a non-constant non-sub) or an UNOP for
	 * OP_REFGEN (with goto &sub) in which case OPf_STACKED also seems to
	 * get set.
	 */
	if (o->op_flags & OPf_STACKED)
	    return OPc_UNOP;
	else if (o->op_flags & OPf_SPECIAL)
	    return OPc_BASEOP;
	else
	    return OPc_PVOP;
    }
    warn("can't determine class of operator %s, assuming BASEOP\n",
	 PL_op_name[o->op_type]);
    return OPc_BASEOP;
}


#if !defined(NV)
#define NV double
#endif

static int go_yell = 1;

/* Checks to see if thing is in the hash. Returns true or false, and
   notes thing in the hash.

   This code does one Evil Thing. Since we're tracking pointers, we
   tell perl that the string key is the address in the pointer. We do this by
   passing in the address of the address, along with the size of a
   pointer as the length. Perl then uses the four (or eight, on
   64-bit machines) bytes of the address as the string we're using as
   the key */
IV check_new(HV *tracking_hash, const void *thing) {
  if (NULL == thing || NULL == tracking_hash) {
    return FALSE;
  }
  if (hv_exists(tracking_hash, (char *)&thing, sizeof(void *))) {
    return FALSE;
  }
  hv_store(tracking_hash, (char *)&thing, sizeof(void *), &PL_sv_yes, 0);
  return TRUE;
}

/* Figure out how much magic is attached to the SV and return the
   size */
IV magic_size(SV *thing, HV *tracking_hash) {
  IV total_size = 0;
  MAGIC *magic_pointer;

  /* Is there any? */
  if (!SvMAGIC(thing)) {
    /* No, bail */
    return 0;
  }

  /* Get the base magic pointer */
  magic_pointer = SvMAGIC(thing);

  /* Have we seen the magic pointer? */
  while (magic_pointer && check_new(tracking_hash, magic_pointer)) {
    total_size += sizeof(MAGIC);

    /* Have we seen the magic vtable? */
    if (magic_pointer->mg_virtual &&
	check_new(tracking_hash, magic_pointer->mg_virtual)) {
      total_size += sizeof(MGVTBL);
    }

    /* Get the next in the chain */
    magic_pointer = magic_pointer->mg_moremagic;
  }

  return total_size;
}

UV regex_size(REGEXP *baseregex, HV *tracking_hash) {
  UV total_size = 0;

  total_size += sizeof(REGEXP);
#if (PERL_VERSION < 11) 	
  /* Note the size of the paren offset thing */
  total_size += sizeof(I32) * baseregex->nparens * 2;
  total_size += strlen(baseregex->precomp);
#else
  total_size += sizeof(struct regexp);
  total_size += sizeof(I32) * SvANY(baseregex)->nparens * 2;
  /*total_size += strlen(SvANY(baseregex)->subbeg);*/
#endif
  if (go_yell && !regex_whine) {
    carp("Devel::Size: Calculated sizes for compiled regexes are incompatible, and probably always will be");
    regex_whine = 1;
  }

  return total_size;
}

UV op_size(OP *baseop, HV *tracking_hash) {
  UV total_size = 0;

  if (check_new(tracking_hash, baseop->op_next)) {
    total_size += op_size(baseop->op_next, tracking_hash);
  }

  switch (cc_opclass(baseop)) {
  case OPc_BASEOP:
    total_size += sizeof(struct op);
    break;
  case OPc_UNOP:
    total_size += sizeof(struct unop);
    if (check_new(tracking_hash, cUNOPx(baseop)->op_first)) {
      total_size += op_size(cUNOPx(baseop)->op_first, tracking_hash);
    }
    break;
  case OPc_BINOP:
    total_size += sizeof(struct binop);
    if (check_new(tracking_hash, cBINOPx(baseop)->op_first)) {
      total_size += op_size(cBINOPx(baseop)->op_first, tracking_hash);
    }  
    if (check_new(tracking_hash, cBINOPx(baseop)->op_last)) {
      total_size += op_size(cBINOPx(baseop)->op_last, tracking_hash);
    }
    break;
  case OPc_LOGOP:
    total_size += sizeof(struct logop);
    if (check_new(tracking_hash, cLOGOPx(baseop)->op_first)) {
      total_size += op_size(cBINOPx(baseop)->op_first, tracking_hash);
    }  
    if (check_new(tracking_hash, cLOGOPx(baseop)->op_other)) {
      total_size += op_size(cLOGOPx(baseop)->op_other, tracking_hash);
    }
    break;
  case OPc_LISTOP:
    total_size += sizeof(struct listop);
    if (check_new(tracking_hash, cLISTOPx(baseop)->op_first)) {
      total_size += op_size(cLISTOPx(baseop)->op_first, tracking_hash);
    }  
    if (check_new(tracking_hash, cLISTOPx(baseop)->op_last)) {
      total_size += op_size(cLISTOPx(baseop)->op_last, tracking_hash);
    }
    break;
  case OPc_PMOP:
    total_size += sizeof(struct pmop);
    if (check_new(tracking_hash, cPMOPx(baseop)->op_first)) {
      total_size += op_size(cPMOPx(baseop)->op_first, tracking_hash);
    }  
    if (check_new(tracking_hash, cPMOPx(baseop)->op_last)) {
      total_size += op_size(cPMOPx(baseop)->op_last, tracking_hash);
    }
#if PERL_VERSION < 9 || (PERL_VERSION == 9 && PERL_SUBVERSION < 5)
    if (check_new(tracking_hash, cPMOPx(baseop)->op_pmreplroot)) {
      total_size += op_size(cPMOPx(baseop)->op_pmreplroot, tracking_hash);
    }
    if (check_new(tracking_hash, cPMOPx(baseop)->op_pmreplstart)) {
      total_size += op_size(cPMOPx(baseop)->op_pmreplstart, tracking_hash);
    }
    if (check_new(tracking_hash, cPMOPx(baseop)->op_pmnext)) {
      total_size += op_size((OP *)cPMOPx(baseop)->op_pmnext, tracking_hash);
    }
#endif
    /* This is defined away in perl 5.8.x, but it is in there for
       5.6.x */
#ifdef PM_GETRE
    if (check_new(tracking_hash, PM_GETRE((cPMOPx(baseop))))) {
      total_size += regex_size(PM_GETRE(cPMOPx(baseop)), tracking_hash);
    }
#else
    if (check_new(tracking_hash, cPMOPx(baseop)->op_pmregexp)) {
      total_size += regex_size(cPMOPx(baseop)->op_pmregexp, tracking_hash);
    }
#endif
    break;
  case OPc_SVOP:
    total_size += sizeof(struct pmop);
    if (check_new(tracking_hash, cSVOPx(baseop)->op_sv)) {
      total_size += thing_size(cSVOPx(baseop)->op_sv, tracking_hash);
    }
    break;
  case OPc_PADOP:
    total_size += sizeof(struct padop);
    break;
  case OPc_PVOP:
    if (check_new(tracking_hash, cPVOPx(baseop)->op_pv)) {
      total_size += strlen(cPVOPx(baseop)->op_pv);
    }
  case OPc_LOOP:
    total_size += sizeof(struct loop);
    if (check_new(tracking_hash, cLOOPx(baseop)->op_first)) {
      total_size += op_size(cLOOPx(baseop)->op_first, tracking_hash);
    }  
    if (check_new(tracking_hash, cLOOPx(baseop)->op_last)) {
      total_size += op_size(cLOOPx(baseop)->op_last, tracking_hash);
    }
    if (check_new(tracking_hash, cLOOPx(baseop)->op_redoop)) {
      total_size += op_size(cLOOPx(baseop)->op_redoop, tracking_hash);
    }  
    if (check_new(tracking_hash, cLOOPx(baseop)->op_nextop)) {
      total_size += op_size(cLOOPx(baseop)->op_nextop, tracking_hash);
    }
    /* Not working for some reason, but the code's here for later
       fixing 
    if (check_new(tracking_hash, cLOOPx(baseop)->op_lastop)) {
      total_size += op_size(cLOOPx(baseop)->op_lastop, tracking_hash);
    }  
    */
    break;
  case OPc_COP:
    {
      COP *basecop;
      basecop = (COP *)baseop;
      total_size += sizeof(struct cop);

      /* Change 33656 by nicholas@mouse-mill on 2008/04/07 11:29:51
      Eliminate cop_label from struct cop by storing a label as the first
      entry in the hints hash. Most statements don't have labels, so this
      will save memory. Not sure how much. 
      The check below will be incorrect fail on bleadperls
      before 5.11 @33656, but later than 5.10, producing slightly too
      small memory sizes on these Perls. */
#if (PERL_VERSION < 11)
      if (check_new(tracking_hash, basecop->cop_label)) {
	total_size += strlen(basecop->cop_label);
      }
#endif
#ifdef USE_ITHREADS
      if (check_new(tracking_hash, basecop->cop_file)) {
	total_size += strlen(basecop->cop_file);
      }
      if (check_new(tracking_hash, basecop->cop_stashpv)) {
	total_size += strlen(basecop->cop_stashpv);
      }
#else
      if (check_new(tracking_hash, basecop->cop_stash)) {
	total_size += thing_size((SV *)basecop->cop_stash, tracking_hash);
      }
      if (check_new(tracking_hash, basecop->cop_filegv)) {
	total_size += thing_size((SV *)basecop->cop_filegv, tracking_hash);
      }
#endif

    }
    break;
  default:
    break;
  }
  return total_size;
}

#if PERL_VERSION > 9 || (PERL_VERSION == 9 && PERL_SUBVERSION > 2)
#  define NEW_HEAD_LAYOUT
#endif

UV thing_size(SV *orig_thing, HV *tracking_hash) {
  SV *thing = orig_thing;
  UV total_size = sizeof(SV);

  switch (SvTYPE(thing)) {
    /* Is it undef? */
  case SVt_NULL:
    break;
    /* Just a plain integer. This will be differently sized depending
       on whether purify's been compiled in */
  case SVt_IV:
#ifndef NEW_HEAD_LAYOUT
#  ifdef PURIFY
    total_size += sizeof(sizeof(XPVIV));
#  else
    total_size += sizeof(IV);
#  endif
#endif
    break;
    /* Is it a float? Like the int, it depends on purify */
  case SVt_NV:
#ifdef PURIFY
    total_size += sizeof(sizeof(XPVNV));
#else
    total_size += sizeof(NV);
#endif
    break;
#if (PERL_VERSION < 11) 	
    /* Is it a reference? */
  case SVt_RV:
#ifndef NEW_HEAD_LAYOUT
    total_size += sizeof(XRV);
#endif
    break;
#endif
    /* How about a plain string? In which case we need to add in how
       much has been allocated */
  case SVt_PV:
    total_size += sizeof(XPV);
#if (PERL_VERSION < 11)
    total_size += SvROK(thing) ? thing_size( SvRV(thing), tracking_hash) : SvLEN(thing);
#else
    total_size += SvLEN(thing);
#endif
    break;
    /* A string with an integer part? */
  case SVt_PVIV:
    total_size += sizeof(XPVIV);
#if (PERL_VERSION < 11)
    total_size += SvROK(thing) ? thing_size( SvRV(thing), tracking_hash) : SvLEN(thing);
#else
    total_size += SvLEN(thing);
#endif
    if(SvOOK(thing)) {
        total_size += SvIVX(thing);
	}
    break;
    /* A scalar/string/reference with a float part? */
  case SVt_PVNV:
    total_size += sizeof(XPVNV);
#if (PERL_VERSION < 11)
    total_size += SvROK(thing) ? thing_size( SvRV(thing), tracking_hash) : SvLEN(thing);
#else
    total_size += SvLEN(thing);
#endif
    break;
  case SVt_PVMG:
    total_size += sizeof(XPVMG);
#if (PERL_VERSION < 11)
    total_size += SvROK(thing) ? thing_size( SvRV(thing), tracking_hash) : SvLEN(thing);
#else
    total_size += SvLEN(thing);
#endif
    total_size += magic_size(thing, tracking_hash);
    break;
#if PERL_VERSION <= 8
  case SVt_PVBM:
    total_size += sizeof(XPVBM);
#if (PERL_VERSION < 11)
    total_size += SvROK(thing) ? thing_size( SvRV(thing), tracking_hash) : SvLEN(thing);
#else
    total_size += SvLEN(thing);
#endif
    total_size += magic_size(thing, tracking_hash);
    break;
#endif
  case SVt_PVLV:
    total_size += sizeof(XPVLV);
#if (PERL_VERSION < 11)
    total_size += SvROK(thing) ? thing_size( SvRV(thing), tracking_hash) : SvLEN(thing);
#else
    total_size += SvLEN(thing);
#endif
    total_size += magic_size(thing, tracking_hash);
    break;
    /* How much space is dedicated to the array? Not counting the
       elements in the array, mind, just the array itself */
  case SVt_PVAV:
    total_size += sizeof(XPVAV);
    /* Is there anything in the array? */
    if (AvMAX(thing) != -1) {
      /* an array with 10 slots has AvMax() set to 9 - te 2007-04-22 */
      total_size += sizeof(SV *) * (AvMAX(thing) + 1);
      dbg_printf(("total_size: %li AvMAX: %li av_len: $i\n", total_size, AvMAX(thing), av_len((AV*)thing)));
    }
    /* Add in the bits on the other side of the beginning */

    dbg_printf(("total_size %li, sizeof(SV *) %li, AvARRAY(thing) %li, AvALLOC(thing)%li , sizeof(ptr) %li \n", 
	total_size, sizeof(SV*), AvARRAY(thing), AvALLOC(thing), sizeof( thing )));

    /* under Perl 5.8.8 64bit threading, AvARRAY(thing) was a pointer while AvALLOC was 0,
       resulting in grossly overstated sized for arrays. Technically, this shouldn't happen... */
    if (AvALLOC(thing) != 0) {
      total_size += (sizeof(SV *) * (AvARRAY(thing) - AvALLOC(thing)));
      }
    /* Is there something hanging off the arylen element? */
    if (AvARYLEN(thing)) {
      if (check_new(tracking_hash, AvARYLEN(thing))) {
	total_size += thing_size(AvARYLEN(thing), tracking_hash);
      }
    }
    total_size += magic_size(thing, tracking_hash);
    break;
  case SVt_PVHV:
    /* First the base struct */
    total_size += sizeof(XPVHV);
    /* Now the array of buckets */
    total_size += (sizeof(HE *) * (HvMAX(thing) + 1));
    /* Now walk the bucket chain */
    if (HvARRAY(thing)) {
      HE *cur_entry;
      IV cur_bucket = 0;
      for (cur_bucket = 0; cur_bucket <= HvMAX(thing); cur_bucket++) {
	cur_entry = *(HvARRAY(thing) + cur_bucket);
	while (cur_entry) {
	  total_size += sizeof(HE);
	  if (cur_entry->hent_hek) {
	    /* Hash keys can be shared. Have we seen this before? */
	    if (check_new(tracking_hash, cur_entry->hent_hek)) {
	      total_size += HEK_BASESIZE + cur_entry->hent_hek->hek_len + 2;
	    }
	  }
	  cur_entry = cur_entry->hent_next;
	}
      }
    }
    total_size += magic_size(thing, tracking_hash);
    break;
  case SVt_PVCV:
    total_size += sizeof(XPVCV);
    total_size += magic_size(thing, tracking_hash);

    total_size += ((XPVIO *) SvANY(thing))->xpv_len;
    if (check_new(tracking_hash, CvSTASH(thing))) {
      total_size += thing_size((SV *)CvSTASH(thing), tracking_hash);
    }
    if (check_new(tracking_hash, SvSTASH(thing))) {
      total_size += thing_size((SV *)SvSTASH(thing), tracking_hash);
    }
    if (check_new(tracking_hash, CvGV(thing))) {
      total_size += thing_size((SV *)CvGV(thing), tracking_hash);
    }
    if (check_new(tracking_hash, CvPADLIST(thing))) {
      total_size += thing_size((SV *)CvPADLIST(thing), tracking_hash);
    }
    if (check_new(tracking_hash, CvOUTSIDE(thing))) {
      total_size += thing_size((SV *)CvOUTSIDE(thing), tracking_hash);
    }

    if (check_new(tracking_hash, CvSTART(thing))) {
      total_size += op_size(CvSTART(thing), tracking_hash);
    }
    if (check_new(tracking_hash, CvROOT(thing))) {
      total_size += op_size(CvROOT(thing), tracking_hash);
    }

    break;
  case SVt_PVGV:
    total_size += magic_size(thing, tracking_hash);
    total_size += sizeof(XPVGV);
    total_size += GvNAMELEN(thing);
#ifdef GvFILE
    /* Is there a file? */
    if (GvFILE(thing)) {
      if (check_new(tracking_hash, GvFILE(thing))) {
	total_size += strlen(GvFILE(thing));
      }
    }
#endif
    /* Is there something hanging off the glob? */
    if (GvGP(thing)) {
      if (check_new(tracking_hash, GvGP(thing))) {
	total_size += sizeof(GP);
	{
	  SV *generic_thing;
	  if ((generic_thing = (SV *)(GvGP(thing)->gp_sv))) {
	    total_size += thing_size(generic_thing, tracking_hash);
	  }
	  if ((generic_thing = (SV *)(GvGP(thing)->gp_form))) {
	    total_size += thing_size(generic_thing, tracking_hash);
	  }
	  if ((generic_thing = (SV *)(GvGP(thing)->gp_av))) {
	    total_size += thing_size(generic_thing, tracking_hash);
	  }
	  if ((generic_thing = (SV *)(GvGP(thing)->gp_hv))) {
	    total_size += thing_size(generic_thing, tracking_hash);
	  }
	  if ((generic_thing = (SV *)(GvGP(thing)->gp_egv))) {
	    total_size += thing_size(generic_thing, tracking_hash);
	  }
	  if ((generic_thing = (SV *)(GvGP(thing)->gp_cv))) {
	    total_size += thing_size(generic_thing, tracking_hash);
	  }
	}
      }
    }
    break;
  case SVt_PVFM:
    total_size += sizeof(XPVFM);
    total_size += magic_size(thing, tracking_hash);
    total_size += ((XPVIO *) SvANY(thing))->xpv_len;
    if (check_new(tracking_hash, CvPADLIST(thing))) {
      total_size += thing_size((SV *)CvPADLIST(thing), tracking_hash);
    }
    if (check_new(tracking_hash, CvOUTSIDE(thing))) {
      total_size += thing_size((SV *)CvOUTSIDE(thing), tracking_hash);
    }

    if (go_yell && !fm_whine) {
      carp("Devel::Size: Calculated sizes for FMs are incomplete");
      fm_whine = 1;
    }
    break;
  case SVt_PVIO:
    total_size += sizeof(XPVIO);
    total_size += magic_size(thing, tracking_hash);
    if (check_new(tracking_hash, (SvPVX(thing)))) {
      total_size += ((XPVIO *) SvANY(thing))->xpv_cur;
    }
    /* Some embedded char pointers */
    if (check_new(tracking_hash, ((XPVIO *) SvANY(thing))->xio_top_name)) {
      total_size += strlen(((XPVIO *) SvANY(thing))->xio_top_name);
    }
    if (check_new(tracking_hash, ((XPVIO *) SvANY(thing))->xio_fmt_name)) {
      total_size += strlen(((XPVIO *) SvANY(thing))->xio_fmt_name);
    }
    if (check_new(tracking_hash, ((XPVIO *) SvANY(thing))->xio_bottom_name)) {
      total_size += strlen(((XPVIO *) SvANY(thing))->xio_bottom_name);
    }
    /* Throw the GVs on the list to be walked if they're not-null */
    if (((XPVIO *) SvANY(thing))->xio_top_gv) {
      total_size += thing_size((SV *)((XPVIO *) SvANY(thing))->xio_top_gv, 
			       tracking_hash);
    }
    if (((XPVIO *) SvANY(thing))->xio_bottom_gv) {
      total_size += thing_size((SV *)((XPVIO *) SvANY(thing))->xio_bottom_gv, 
			       tracking_hash);
    }
    if (((XPVIO *) SvANY(thing))->xio_fmt_gv) {
      total_size += thing_size((SV *)((XPVIO *) SvANY(thing))->xio_fmt_gv, 
			       tracking_hash);
    }

    /* Only go trotting through the IO structures if they're really
       trottable. If USE_PERLIO is defined we can do this. If
       not... we can't, so we don't even try */
#ifdef USE_PERLIO
    /* Dig into xio_ifp and xio_ofp here */
    croak("Devel::Size: Can't size up perlio layers yet");
#endif
    break;
  default:
    croak("Devel::Size: Unknown variable type");
  }
  return total_size;
}

MODULE = Devel::Size		PACKAGE = Devel::Size		

PROTOTYPES: DISABLE

IV
size(orig_thing)
     SV *orig_thing
CODE:
{
  SV *thing = orig_thing;
  /* Hash to track our seen pointers */
  HV *tracking_hash = newHV();
  SV *warn_flag;

  /* Check warning status */
  go_yell = 0;
  regex_whine = 0;
  fm_whine = 0;

  if (NULL != (warn_flag = perl_get_sv("Devel::Size::warn", FALSE))) {
    go_yell = SvIV(warn_flag);
  }
  
  /* If they passed us a reference then dereference it. This is the
     only way we can check the sizes of arrays and hashes */
#if (PERL_VERSION < 11)
  if (SvOK(thing) && SvROK(thing)) {
    thing = SvRV(thing);
  }
#else
  if (SvROK(thing)) {
    thing = SvRV(thing);
  }
#endif

  RETVAL = thing_size(thing, tracking_hash);
  /* Clean up after ourselves */
  SvREFCNT_dec(tracking_hash);
}
OUTPUT:
  RETVAL


IV
total_size(orig_thing)
       SV *orig_thing
CODE:
{
  SV *thing = orig_thing;
  /* Hash to track our seen pointers */
  HV *tracking_hash;
  /* Array with things we still need to do */
  AV *pending_array;
  IV size = 0;
  SV *warn_flag;

  /* Size starts at zero */
  RETVAL = 0;

  /* Check warning status */
  go_yell = 0;
  regex_whine = 0;
  fm_whine = 0;

  if (NULL != (warn_flag = perl_get_sv("Devel::Size::warn", FALSE))) {
    go_yell = SvIV(warn_flag);
  }

  /* init these after the go_yell above */
  tracking_hash = newHV();
  pending_array = newAV();

  /* We cannot push HV/AV directly, only the RV. So deref it
     later (see below for "*** dereference later") and adjust here for
     the miscalculation.
     This is the only way we can check the sizes of arrays and hashes. */
  if (SvROK(thing)) {
      RETVAL -= thing_size(thing, NULL);
  } 

  /* Put it on the pending array */
  av_push(pending_array, thing);

  /* Now just yank things off the end of the array until it's done */
  while (av_len(pending_array) >= 0) {
    thing = av_pop(pending_array);
    /* Process it if we've not seen it */
    if (check_new(tracking_hash, thing)) {
      dbg_printf(("# Found type %i at %p\n", SvTYPE(thing), thing));
      /* Is it valid? */
      if (thing) {
	/* Yes, it is. So let's check the type */
	switch (SvTYPE(thing)) {
	/* fix for bug #24846 (Does not correctly recurse into references in a PVNV-type scalar) */
	case SVt_PVNV:
	  if (SvROK(thing))
	    {
	    av_push(pending_array, SvRV(thing));
	    } 
	  break;

	/* this is the "*** dereference later" part - see above */
#if (PERL_VERSION < 11)
        case SVt_RV:
#else
        case SVt_IV:
#endif
             dbg_printf(("# Found RV\n"));
          if (SvROK(thing)) {
             dbg_printf(("# Found RV\n"));
             av_push(pending_array, SvRV(thing));
          }
          break;

	case SVt_PVAV:
	  {
	    dbg_printf(("# Found type AV\n"));
	    /* Quick alias to cut down on casting */
	    AV *tempAV = (AV *)thing;
	    SV **tempSV;
	    
	    /* Any elements? */
	    if (av_len(tempAV) != -1) {
	      IV index;
	      /* Run through them all */
	      for (index = 0; index <= av_len(tempAV); index++) {
		/* Did we get something? */
		if ((tempSV = av_fetch(tempAV, index, 0))) {
		  /* Was it undef? */
		  if (*tempSV != &PL_sv_undef) {
		    /* Apparently not. Save it for later */
		    av_push(pending_array, *tempSV);
		  }
		}
	      }
	    }
	  }
	  break;

	case SVt_PVHV:
	  dbg_printf(("# Found type HV\n"));
	  /* Is there anything in here? */
	  if (hv_iterinit((HV *)thing)) {
	    HE *temp_he;
	    while ((temp_he = hv_iternext((HV *)thing))) {
	      av_push(pending_array, hv_iterval((HV *)thing, temp_he));
	    }
	  }
	  break;
	 
	case SVt_PVGV:
	  dbg_printf(("# Found type GV\n"));
	  /* Run through all the pieces and push the ones with bits */
	  if (GvSV(thing)) {
	    av_push(pending_array, (SV *)GvSV(thing));
	  }
	  if (GvFORM(thing)) {
	    av_push(pending_array, (SV *)GvFORM(thing));
	  }
	  if (GvAV(thing)) {
	    av_push(pending_array, (SV *)GvAV(thing));
	  }
	  if (GvHV(thing)) {
	    av_push(pending_array, (SV *)GvHV(thing));
	  }
	  if (GvCV(thing)) {
	    av_push(pending_array, (SV *)GvCV(thing));
	  }
	  break;
	default:
	  break;
	}
      }

      
      size = thing_size(thing, tracking_hash);
      RETVAL += size;
    } else {
    /* check_new() returned false: */
#ifdef DEVEL_SIZE_DEBUGGING
       if (SvOK(sv)) printf("# Ignore ref copy 0x%x\n", sv);
       else printf("# Ignore non-sv 0x%x\n", sv);
#endif
    }
  } /* end while */
  
  /* Clean up after ourselves */
  SvREFCNT_dec(tracking_hash);
  SvREFCNT_dec(pending_array);
}
OUTPUT:
  RETVAL