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
|
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
// same as resource-cycle2, but be sure to give r multiple fields...
// Don't leak the unique pointers
struct U {
a: int,
b: int,
c: *int
}
struct R {
v: U,
w: int,
x: *int,
}
impl Drop for R {
fn finalize(&self) {
unsafe {
let _v2: ~int = cast::transmute(self.v.c);
// let _v3: ~int = cast::transmute_copy(self.x);
}
}
}
fn r(v: U, w: int, _x: *int) -> R {
unsafe {
R {
v: v,
w: w,
x: cast::transmute(0)
}
}
}
struct t(Node);
struct Node {
next: Option<@mut t>,
r: R
}
pub fn main() {
unsafe {
let i1 = ~0xA;
let i1p = cast::transmute_copy(&i1);
cast::forget(i1);
let i2 = ~0xA;
let i2p = cast::transmute_copy(&i2);
cast::forget(i2);
let u1 = U {a: 0xB, b: 0xC, c: i1p};
let u2 = U {a: 0xB, b: 0xC, c: i2p};
let x1 = @mut t(Node{
next: None,
r: r(u1, 42, i1p)
});
let x2 = @mut t(Node{
next: None,
r: r(u2, 42, i2p)
});
x1.next = Some(x2);
x2.next = Some(x1);
}
}
|
