second attempt to fix [perl #24914] freeing a CV reference that was
[p5sagit/p5-mst-13.2.git] / t / op / ref.t
CommitLineData
79072805 1#!./perl
2
20274adc 3BEGIN {
4 chdir 't' if -d 't';
b5fe401b 5 @INC = qw(. ../lib);
20274adc 6}
7
23bb1b96 8print "1..68\n";
b2ce0fda 9
10require 'test.pl';
79072805 11
12# Test glob operations.
13
14$bar = "ok 1\n";
15$foo = "ok 2\n";
16{
17 local(*foo) = *bar;
18 print $foo;
19}
20print $foo;
21
22$baz = "ok 3\n";
23$foo = "ok 4\n";
24{
25 local(*foo) = 'baz';
26 print $foo;
27}
28print $foo;
29
30$foo = "ok 6\n";
31{
32 local(*foo);
33 print $foo;
34 $foo = "ok 5\n";
35 print $foo;
36}
37print $foo;
38
39# Test fake references.
40
41$baz = "ok 7\n";
42$bar = 'baz';
43$foo = 'bar';
44print $$$foo;
45
46# Test real references.
47
48$FOO = \$BAR;
49$BAR = \$BAZ;
50$BAZ = "ok 8\n";
51print $$$FOO;
52
53# Test references to real arrays.
54
55@ary = (9,10,11,12);
56$ref[0] = \@a;
57$ref[1] = \@b;
58$ref[2] = \@c;
59$ref[3] = \@d;
60for $i (3,1,2,0) {
61 push(@{$ref[$i]}, "ok $ary[$i]\n");
62}
63print @a;
64print ${$ref[1]}[0];
65print @{$ref[2]}[0];
66print @{'d'};
67
68# Test references to references.
69
70$refref = \\$x;
71$x = "ok 13\n";
72print $$$refref;
73
74# Test nested anonymous lists.
75
76$ref = [[],2,[3,4,5,]];
77print scalar @$ref == 3 ? "ok 14\n" : "not ok 14\n";
78print $$ref[1] == 2 ? "ok 15\n" : "not ok 15\n";
79print ${$$ref[2]}[2] == 5 ? "ok 16\n" : "not ok 16\n";
80print scalar @{$$ref[0]} == 0 ? "ok 17\n" : "not ok 17\n";
81
82print $ref->[1] == 2 ? "ok 18\n" : "not ok 18\n";
a0d0e21e 83print $ref->[2]->[0] == 3 ? "ok 19\n" : "not ok 19\n";
79072805 84
85# Test references to hashes of references.
86
87$refref = \%whatever;
88$refref->{"key"} = $ref;
89print $refref->{"key"}->[2]->[0] == 3 ? "ok 20\n" : "not ok 20\n";
90
93a17b20 91# Test to see if anonymous subarrays spring into existence.
79072805 92
93$spring[5]->[0] = 123;
94$spring[5]->[1] = 456;
95push(@{$spring[5]}, 789);
96print join(':',@{$spring[5]}) eq "123:456:789" ? "ok 21\n" : "not ok 21\n";
97
93a17b20 98# Test to see if anonymous subhashes spring into existence.
79072805 99
100@{$spring2{"foo"}} = (1,2,3);
101$spring2{"foo"}->[3] = 4;
102print join(':',@{$spring2{"foo"}}) eq "1:2:3:4" ? "ok 22\n" : "not ok 22\n";
103
104# Test references to subroutines.
105
106sub mysub { print "ok 23\n" }
107$subref = \&mysub;
108&$subref;
109
110$subrefref = \\&mysub2;
6da72b64 111$$subrefref->("ok 24\n");
79072805 112sub mysub2 { print shift }
113
114# Test the ref operator.
115
116print ref $subref eq CODE ? "ok 25\n" : "not ok 25\n";
117print ref $ref eq ARRAY ? "ok 26\n" : "not ok 26\n";
118print ref $refref eq HASH ? "ok 27\n" : "not ok 27\n";
119
120# Test anonymous hash syntax.
121
122$anonhash = {};
123print ref $anonhash eq HASH ? "ok 28\n" : "not ok 28\n";
124$anonhash2 = {FOO => BAR, ABC => XYZ,};
125print join('', sort values %$anonhash2) eq BARXYZ ? "ok 29\n" : "not ok 29\n";
126
127# Test bless operator.
128
129package MYHASH;
130
131$object = bless $main'anonhash2;
132print ref $object eq MYHASH ? "ok 30\n" : "not ok 30\n";
133print $object->{ABC} eq XYZ ? "ok 31\n" : "not ok 31\n";
134
135$object2 = bless {};
136print ref $object2 eq MYHASH ? "ok 32\n" : "not ok 32\n";
137
138# Test ordinary call on object method.
139
140&mymethod($object,33);
141
142sub mymethod {
143 local($THIS, @ARGS) = @_;
ed6116ce 144 die 'Got a "' . ref($THIS). '" instead of a MYHASH'
145 unless ref $THIS eq MYHASH;
79072805 146 print $THIS->{FOO} eq BAR ? "ok $ARGS[0]\n" : "not ok $ARGS[0]\n";
147}
148
149# Test automatic destructor call.
150
151$string = "not ok 34\n";
152$object = "foo";
153$string = "ok 34\n";
154$main'anonhash2 = "foo";
8990e307 155$string = "";
79072805 156
ed6116ce 157DESTROY {
8990e307 158 return unless $string;
79072805 159 print $string;
160
a0d0e21e 161 # Test that the object has not already been "cursed".
162 print ref shift ne HASH ? "ok 35\n" : "not ok 35\n";
79072805 163}
164
165# Now test inheritance of methods.
166
167package OBJ;
168
169@ISA = (BASEOBJ);
170
171$main'object = bless {FOO => foo, BAR => bar};
172
173package main;
174
175# Test arrow-style method invocation.
176
177print $object->doit("BAR") eq bar ? "ok 36\n" : "not ok 36\n";
178
179# Test indirect-object-style method invocation.
180
181$foo = doit $object "FOO";
182print $foo eq foo ? "ok 37\n" : "not ok 37\n";
183
184sub BASEOBJ'doit {
185 local $ref = shift;
186 die "Not an OBJ" unless ref $ref eq OBJ;
748a9306 187 $ref->{shift()};
79072805 188}
8990e307 189
a0d0e21e 190package UNIVERSAL;
191@ISA = 'LASTCHANCE';
192
193package LASTCHANCE;
194sub foo { print $_[1] }
195
196package WHATEVER;
197foo WHATEVER "ok 38\n";
198
58e0a6ae 199#
200# test the \(@foo) construct
201#
202package main;
fb53bbb2 203@foo = \(1..3);
58e0a6ae 204@bar = \(@foo);
205@baz = \(1,@foo,@bar);
206print @bar == 3 ? "ok 39\n" : "not ok 39\n";
207print grep(ref($_), @bar) == 3 ? "ok 40\n" : "not ok 40\n";
208print @baz == 3 ? "ok 41\n" : "not ok 41\n";
209
fb53bbb2 210my(@fuu) = \(1..2,3);
58e0a6ae 211my(@baa) = \(@fuu);
212my(@bzz) = \(1,@fuu,@baa);
213print @baa == 3 ? "ok 42\n" : "not ok 42\n";
214print grep(ref($_), @baa) == 3 ? "ok 43\n" : "not ok 43\n";
215print @bzz == 3 ? "ok 44\n" : "not ok 44\n";
216
75ea820e 217# also, it can't be an lvalue
218eval '\\($x, $y) = (1, 2);';
219print $@ =~ /Can\'t modify.*ref.*in.*assignment/ ? "ok 45\n" : "not ok 45\n";
220
bc44cdaf 221# test for proper destruction of lexical objects
222
75ea820e 223sub larry::DESTROY { print "# larry\nok 46\n"; }
224sub curly::DESTROY { print "# curly\nok 47\n"; }
225sub moe::DESTROY { print "# moe\nok 48\n"; }
bc44cdaf 226
227{
228 my ($joe, @curly, %larry);
229 my $moe = bless \$joe, 'moe';
230 my $curly = bless \@curly, 'curly';
231 my $larry = bless \%larry, 'larry';
232 print "# leaving block\n";
233}
234
235print "# left block\n";
236
fb73857a 237# another glob test
238
75ea820e 239$foo = "not ok 49";
fb73857a 240{ local(*bar) = "foo" }
75ea820e 241$bar = "ok 49";
fb73857a 242local(*bar) = *bar;
243print "$bar\n";
244
75ea820e 245$var = "ok 50";
d4010388 246$_ = \$var;
247print $$_,"\n";
248
4e8e7886 249# test if reblessing during destruction results in more destruction
250
251{
252 package A;
253 sub new { bless {}, shift }
75ea820e 254 DESTROY { print "# destroying 'A'\nok 52\n" }
8bac7e00 255 package _B;
4e8e7886 256 sub new { bless {}, shift }
75ea820e 257 DESTROY { print "# destroying '_B'\nok 51\n"; bless shift, 'A' }
4e8e7886 258 package main;
8bac7e00 259 my $b = _B->new;
4e8e7886 260}
261
262# test if $_[0] is properly protected in DESTROY()
263
264{
265 my $i = 0;
266 local $SIG{'__DIE__'} = sub {
267 my $m = shift;
268 if ($i++ > 4) {
75ea820e 269 print "# infinite recursion, bailing\nnot ok 53\n";
4e8e7886 270 exit 1;
271 }
272 print "# $m";
75ea820e 273 if ($m =~ /^Modification of a read-only/) { print "ok 53\n" }
4e8e7886 274 };
275 package C;
276 sub new { bless {}, shift }
277 DESTROY { $_[0] = 'foo' }
278 {
279 print "# should generate an error...\n";
280 my $c = C->new;
281 }
282 print "# good, didn't recurse\n";
283}
284
0dd88869 285# test if refgen behaves with autoviv magic
286
287{
288 my @a;
75ea820e 289 $a[1] = "ok 54\n";
0dd88869 290 print ${\$_} for @a;
291}
292
840a7b70 293# This test is the reason for postponed destruction in sv_unref
294$a = [1,2,3];
295$a = $a->[1];
296print "not " unless $a == 2;
75ea820e 297print "ok 55\n";
840a7b70 298
04ca4930 299# This test used to coredump. The BEGIN block is important as it causes the
300# op that created the constant reference to be freed. Hence the only
301# reference to the constant string "pass" is in $a. The hack that made
302# sure $a = $a->[1] would work didn't work with references to constants.
303
304my $test = 56;
305
306foreach my $lexical ('', 'my $a; ') {
307 my $expect = "pass\n";
308 my $result = runperl (switches => ['-wl'], stderr => 1,
309 prog => $lexical . 'BEGIN {$a = \q{pass}}; $a = $$a; print $a');
310
311 if ($? == 0 and $result eq $expect) {
312 print "ok $test\n";
313 } else {
314 print "not ok $test # \$? = $?\n";
315 print "# expected ", _qq ($expect), ", got ", _qq ($result), "\n";
840a7b70 316 }
04ca4930 317 $test++;
840a7b70 318}
319
04ca4930 320sub x::DESTROY {print "ok ", $test + shift->[0], "\n"}
321{ my $a1 = bless [3],"x";
322 my $a2 = bless [2],"x";
323 { my $a3 = bless [1],"x";
324 my $a4 = bless [0],"x";
325 567;
326 }
327}
328$test+=4;
840a7b70 329
b2ce0fda 330my $result = runperl (switches=>['-l'],
331 prog=> 'print 1; print qq-*$\*-;print 1;');
332my $expect = "1\n*\n*\n1\n";
333if ($result eq $expect) {
04ca4930 334 print "ok $test\n";
b2ce0fda 335} else {
04ca4930 336 print "not ok $test\n";
b2ce0fda 337 foreach ($expect, $result) {
338 s/\n/\\n/gs;
339 }
340 print "# expected \"$expect\", got \"$result\"\n";
341}
342
39cff0d9 343# bug #21347
344
345runperl(prog => 'sub UNIVERSAL::AUTOLOAD { qr// } a->p' );
346if ($? != 0) { print "not " };
347print "ok ",++$test," - UNIVERSAL::AUTOLOAD called when freeing qr//\n";
348
7b102d90 349runperl(prog => 'sub UNIVERSAL::DESTROY { warn } bless \$a, A', stderr => 1);
350if ($? != 0) { print "not " };
351print "ok ",++$test," - warn called inside UNIVERSAL::DESTROY\n";
352
23bb1b96 353
354# bug #22719
355
356runperl(prog => 'sub f { my $x = shift; *z = $x; } f({}); f();');
357if ($? != 0) { print "not " };
358print "ok ",++$test," - coredump on typeglob = (SvRV && !SvROK)\n";
359
360
4e8e7886 361# test global destruction
362
04ca4930 363++$test;
840a7b70 364my $test1 = $test + 1;
365my $test2 = $test + 2;
366
8990e307 367package FINALE;
368
369{
840a7b70 370 $ref3 = bless ["ok $test2\n"]; # package destruction
371 my $ref2 = bless ["ok $test1\n"]; # lexical destruction
372 local $ref1 = bless ["ok $test\n"]; # dynamic destruction
8990e307 373 1; # flush any temp values on stack
374}
375
376DESTROY {
377 print $_[0][0];
378}