Skip to content

Commit 26dc5d8

Browse files
lucic71lucic71
committed
Update tests
1 parent 3444e8e commit 26dc5d8

13 files changed

Lines changed: 309 additions & 505 deletions

‎tests/unit/out/refcount/clone_vs_move.rs‎

Lines changed: 24 additions & 72 deletions
Original file line numberDiff line numberDiff line change
@@ -161,18 +161,20 @@ fn main_0() -> i32 {
161161
let mut i: i32 = 0;
162162
'loop_: while (i < N) {
163163
assert!(
164-
((*((m1.as_pointer() as Ptr<Vec<i32>>)
164+
((*m1
165+
.as_pointer()
166+
.decay()
165167
.offset((i as usize))
166-
.as_pointer() as Ptr<Vec<i32>>)
167168
.upgrade()
168169
.deref())
169170
.len()
170171
== 10_usize)
171172
);
172173
assert!(
173-
((*((m2.as_pointer() as Ptr<Vec<i32>>)
174+
((*m2
175+
.as_pointer()
176+
.decay()
174177
.offset((i as usize))
175-
.as_pointer() as Ptr<Vec<i32>>)
176178
.upgrade()
177179
.deref())
178180
.len()
@@ -181,20 +183,10 @@ fn main_0() -> i32 {
181183
let mut j: i32 = 0;
182184
'loop_: while (j < 10) {
183185
assert!(
184-
((index!(
185-
elem!((m1.as_pointer() as Ptr<Vec<i32>>), (i as usize)),
186-
(j as usize)
187-
)
188-
.read())
189-
== 0)
186+
((index!(elem!(m1.as_pointer().decay(), (i as usize)), (j as usize)).read()) == 0)
190187
);
191188
assert!(
192-
((index!(
193-
elem!((m2.as_pointer() as Ptr<Vec<i32>>), (i as usize)),
194-
(j as usize)
195-
)
196-
.read())
197-
== 0)
189+
((index!(elem!(m2.as_pointer().decay(), (i as usize)), (j as usize)).read()) == 0)
198190
);
199191
j.prefix_inc();
200192
}
@@ -204,30 +196,29 @@ fn main_0() -> i32 {
204196
'loop_: while (i < N) {
205197
let mut j: i32 = 0;
206198
'loop_: while (j < 10) {
207-
index!(
208-
elem!((m2.as_pointer() as Ptr<Vec<i32>>), (i as usize)),
209-
(j as usize)
210-
)
211-
.with_mut(|__v| __v.postfix_inc());
199+
index!(elem!(m2.as_pointer().decay(), (i as usize)), (j as usize))
200+
.with_mut(|__v| __v.postfix_inc());
212201
j.prefix_inc();
213202
}
214203
i.prefix_inc();
215204
}
216205
let mut i: i32 = 0;
217206
'loop_: while (i < N) {
218207
assert!(
219-
((*((m1.as_pointer() as Ptr<Vec<i32>>)
208+
((*m1
209+
.as_pointer()
210+
.decay()
220211
.offset((i as usize))
221-
.as_pointer() as Ptr<Vec<i32>>)
222212
.upgrade()
223213
.deref())
224214
.len()
225215
== 10_usize)
226216
);
227217
assert!(
228-
((*((m2.as_pointer() as Ptr<Vec<i32>>)
218+
((*m2
219+
.as_pointer()
220+
.decay()
229221
.offset((i as usize))
230-
.as_pointer() as Ptr<Vec<i32>>)
231222
.upgrade()
232223
.deref())
233224
.len()
@@ -236,20 +227,10 @@ fn main_0() -> i32 {
236227
let mut j: i32 = 0;
237228
'loop_: while (j < 10) {
238229
assert!(
239-
((index!(
240-
elem!((m1.as_pointer() as Ptr<Vec<i32>>), (i as usize)),
241-
(j as usize)
242-
)
243-
.read())
244-
== 0)
230+
((index!(elem!(m1.as_pointer().decay(), (i as usize)), (j as usize)).read()) == 0)
245231
);
246232
assert!(
247-
((index!(
248-
elem!((m2.as_pointer() as Ptr<Vec<i32>>), (i as usize)),
249-
(j as usize)
250-
)
251-
.read())
252-
== 1)
233+
((index!(elem!(m2.as_pointer().decay(), (i as usize)), (j as usize)).read()) == 1)
253234
);
254235
j.prefix_inc();
255236
}
@@ -259,50 +240,21 @@ fn main_0() -> i32 {
259240
let mut i: i32 = 0;
260241
'loop_: while (i < N) {
261242
let __rhs = i;
262-
Map::subscript(
263-
(map1.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<i32>)>>),
264-
&i,
265-
)
266-
.write(__rhs);
243+
Map::subscript(map1.as_pointer(), &i).write(__rhs);
267244
i.prefix_inc();
268245
}
269246
let map2: Value<Map<i32, (Value<i32>, Value<i32>)>> =
270247
Rc::new(RefCell::new((*map1.borrow()).clone()));
271248
let mut i: i32 = 0;
272249
'loop_: while (i < N) {
273-
assert!(
274-
((Map::subscript(
275-
(map2.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<i32>)>>),
276-
&i
277-
)
278-
.read())
279-
== i)
280-
);
281-
Map::subscript(
282-
(map2.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<i32>)>>),
283-
&i,
284-
)
285-
.with_mut(|__v| __v.prefix_inc());
250+
assert!(((Map::subscript(map2.as_pointer(), &i).read()) == i));
251+
Map::subscript(map2.as_pointer(), &i).with_mut(|__v| __v.prefix_inc());
286252
i.prefix_inc();
287253
}
288254
let mut i: i32 = 0;
289255
'loop_: while (i < N) {
290-
assert!(
291-
((Map::subscript(
292-
(map1.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<i32>)>>),
293-
&i
294-
)
295-
.read())
296-
== i)
297-
);
298-
assert!(
299-
((Map::subscript(
300-
(map2.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<i32>)>>),
301-
&i
302-
)
303-
.read())
304-
== (i + 1))
305-
);
256+
assert!(((Map::subscript(map1.as_pointer(), &i).read()) == i));
257+
assert!(((Map::subscript(map2.as_pointer(), &i).read()) == (i + 1)));
306258
i.prefix_inc();
307259
}
308260
let pair1: Value<(Value<i32>, Value<i32>)> = Rc::new(RefCell::new((
@@ -364,7 +316,7 @@ fn main_0() -> i32 {
364316
assert!((b1.w == 1));
365317
assert!((b2.w == 2));
366318
let v4: Value<Vec<i32>> = Rc::new(RefCell::new(Vec::new()));
367-
(v4.as_pointer() as Ptr<Vec<i32>>).write((v2).clone());
319+
v4.as_pointer().write((v2).clone());
368320
let mut i: i32 = 0;
369321
'loop_: while (i < N) {
370322
assert!(({ (*v4.borrow())[(i as usize)] } == (i + 1)));

‎tests/unit/out/refcount/find.rs‎

Lines changed: 20 additions & 24 deletions
Original file line numberDiff line numberDiff line change
@@ -25,90 +25,86 @@ fn main_0() -> i32 {
2525
(*v.borrow_mut()).push(__a1)
2626
};
2727
let v_begin: Value<RandomAccessIterator<i32>> =
28-
Rc::new(RefCell::new((v.as_pointer() as Ptr<i32>).begin()));
28+
Rc::new(RefCell::new(v.as_pointer().decay().begin()));
2929
let v_end: Value<RandomAccessIterator<i32>> =
30-
Rc::new(RefCell::new((v.as_pointer() as Ptr<i32>).end()));
30+
Rc::new(RefCell::new(v.as_pointer().decay().end()));
3131
let it: Value<RandomAccessIterator<i32>> = Rc::new(RefCell::new({
3232
let mut __it = (*v_begin.borrow()).clone();
3333
while __it != (*v_end.borrow()).clone() && __it.iter_deref().with(|__v| *__v != 2) {
3434
__it.iter_inc();
3535
}
3636
__it
3737
}));
38-
let mut v_result_true: bool = (*it.borrow()) != (v.as_pointer() as Ptr<i32>).end();
38+
let mut v_result_true: bool = (*it.borrow()) != v.as_pointer().decay().end();
3939
let m: Value<Map<i32, (Value<i32>, Value<f64>)>> = Rc::new(RefCell::new(Map::new()));
4040
Map::subscript_move(
41-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>),
41+
m.as_pointer(),
4242
Rc::new(RefCell::new(1)).as_pointer(),
4343
|__k| cpp_move!(__k),
4444
)
4545
.write(1_f64);
4646
Map::subscript_move(
47-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>),
47+
m.as_pointer(),
4848
Rc::new(RefCell::new(2)).as_pointer(),
4949
|__k| cpp_move!(__k),
5050
)
5151
.write(2_f64);
5252
Map::subscript_move(
53-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>),
53+
m.as_pointer(),
5454
Rc::new(RefCell::new(3)).as_pointer(),
5555
|__k| cpp_move!(__k),
5656
)
5757
.write(3_f64);
5858
let m_begin: Value<BidirectionalIterator<(Value<i32>, Value<f64>)>> = Rc::new(RefCell::new(
59-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>)
59+
m.as_pointer()
6060
.with(|__m: &Map<i32, (Value<i32>, Value<f64>)>| __m.begin()),
6161
));
6262
let m_end: Value<BidirectionalIterator<(Value<i32>, Value<f64>)>> = Rc::new(RefCell::new(
63-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>)
63+
m.as_pointer()
6464
.with(|__m: &Map<i32, (Value<i32>, Value<f64>)>| __m.end()),
6565
));
6666
let mut m_result_true: bool = (*m_begin.borrow()) != (*m_end.borrow());
6767
assert!(
6868
((v_result_true) && (m_result_true))
6969
&& ({
70-
let mut __it = (v.as_pointer() as Ptr<i32>).begin();
71-
while __it != (v.as_pointer() as Ptr<i32>).begin()
70+
let mut __it = v.as_pointer().decay().begin();
71+
while __it != v.as_pointer().decay().begin()
7272
&& __it.iter_deref().with(|__v| *__v != 2)
7373
{
7474
__it.iter_inc();
7575
}
7676
__it
77-
} == (v.as_pointer() as Ptr<i32>).begin())
77+
} == v.as_pointer().decay().begin())
7878
);
7979
let w: Value<Vec<i32>> = Rc::new(RefCell::new(Vec::from([1, 2, 3, 4, 5])));
8080
assert!(
8181
{
82-
let mut __it = (w.as_pointer() as Ptr<i32>).begin().iter_add(2_isize);
83-
while __it != (w.as_pointer() as Ptr<i32>).end()
84-
&& __it.iter_deref().with(|__v| *__v != 4)
85-
{
82+
let mut __it = w.as_pointer().decay().begin().iter_add(2_isize);
83+
while __it != w.as_pointer().decay().end() && __it.iter_deref().with(|__v| *__v != 4) {
8684
__it.iter_inc();
8785
}
8886
__it
89-
} == (w.as_pointer() as Ptr<i32>).begin().iter_add(3_isize)
87+
} == w.as_pointer().decay().begin().iter_add(3_isize)
9088
);
9189
assert!(
9290
{
93-
let mut __it = (w.as_pointer() as Ptr<i32>).begin().iter_add(2_isize);
94-
while __it != (w.as_pointer() as Ptr<i32>).end()
95-
&& __it.iter_deref().with(|__v| *__v != 1)
96-
{
91+
let mut __it = w.as_pointer().decay().begin().iter_add(2_isize);
92+
while __it != w.as_pointer().decay().end() && __it.iter_deref().with(|__v| *__v != 1) {
9793
__it.iter_inc();
9894
}
9995
__it
100-
} == (w.as_pointer() as Ptr<i32>).end()
96+
} == w.as_pointer().decay().end()
10197
);
10298
assert!(
10399
{
104-
let mut __it = (w.as_pointer() as Ptr<i32>).begin().iter_add(2_isize);
105-
while __it != (w.as_pointer() as Ptr<i32>).begin().iter_add(4_isize)
100+
let mut __it = w.as_pointer().decay().begin().iter_add(2_isize);
101+
while __it != w.as_pointer().decay().begin().iter_add(4_isize)
106102
&& __it.iter_deref().with(|__v| *__v != 5)
107103
{
108104
__it.iter_inc();
109105
}
110106
__it
111-
} == (w.as_pointer() as Ptr<i32>).begin().iter_add(4_isize)
107+
} == w.as_pointer().decay().begin().iter_add(4_isize)
112108
);
113109
return 0;
114110
}

‎tests/unit/out/refcount/foreach_map.rs‎

Lines changed: 9 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -15,30 +15,26 @@ fn main_0() -> i32 {
1515
let mut i: i32 = 0;
1616
let mut k: i32 = 100;
1717
'loop_: while (i < 100) {
18-
Map::subscript(
19-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>),
20-
&i,
21-
)
22-
.write(((k as f64) / 2_f64));
18+
Map::subscript(m.as_pointer(), &i).write(((k as f64) / 2_f64));
2319
{
2420
i.prefix_inc();
2521
k.prefix_dec()
2622
};
2723
}
2824
let mut sum: f64 = 0_f64;
2925
'loop_: for i in IterRange::new(
30-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>)
26+
m.as_pointer()
3127
.with(|__m: &Map<i32, (Value<i32>, Value<f64>)>| __m.begin()),
32-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>)
28+
m.as_pointer()
3329
.with(|__m: &Map<i32, (Value<i32>, Value<f64>)>| __m.end()),
3430
) {
3531
let i: Ptr<(Value<i32>, Value<f64>)> = i.iter_deref();
3632
sum += (*(*i.upgrade().deref()).1.borrow());
3733
}
3834
'loop_: for i in IterRange::new(
39-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>)
35+
m.as_pointer()
4036
.with(|__m: &Map<i32, (Value<i32>, Value<f64>)>| __m.begin()),
41-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>)
37+
m.as_pointer()
4238
.with(|__m: &Map<i32, (Value<i32>, Value<f64>)>| __m.end()),
4339
) {
4440
let i: Value<(Value<i32>, Value<f64>)> = Rc::new(RefCell::new((
@@ -53,9 +49,9 @@ fn main_0() -> i32 {
5349
}
5450
assert!((sum == 7475_f64));
5551
'loop_: for i in IterRange::new(
56-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>)
52+
m.as_pointer()
5753
.with(|__m: &Map<i32, (Value<i32>, Value<f64>)>| __m.begin()),
58-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>)
54+
m.as_pointer()
5955
.with(|__m: &Map<i32, (Value<i32>, Value<f64>)>| __m.end()),
6056
) {
6157
let i: Value<(Value<i32>, Value<f64>)> = Rc::new(RefCell::new((
@@ -70,9 +66,9 @@ fn main_0() -> i32 {
7066
assert!(((*(*i.borrow()).1.borrow()) == (-1_i32 as f64)));
7167
}
7268
'loop_: for i in IterRange::new(
73-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>)
69+
m.as_pointer()
7470
.with(|__m: &Map<i32, (Value<i32>, Value<f64>)>| __m.begin()),
75-
(m.as_pointer() as Ptr<Map<i32, (Value<i32>, Value<f64>)>>)
71+
m.as_pointer()
7672
.with(|__m: &Map<i32, (Value<i32>, Value<f64>)>| __m.end()),
7773
) {
7874
let i: Ptr<(Value<i32>, Value<f64>)> = i.iter_deref();

0 commit comments

Comments
 (0)