Commit | Line | Data |
---|---|---|
67218854 TT |
1 | // Copyright (C) 2016 Free Software Foundation, Inc. |
2 | ||
3 | // This program is free software; you can redistribute it and/or modify | |
4 | // it under the terms of the GNU General Public License as published by | |
5 | // the Free Software Foundation; either version 3 of the License, or | |
6 | // (at your option) any later version. | |
7 | // | |
8 | // This program is distributed in the hope that it will be useful, | |
9 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
11 | // GNU General Public License for more details. | |
12 | // | |
13 | // You should have received a copy of the GNU General Public License | |
14 | // along with this program. If not, see <http://www.gnu.org/licenses/>. | |
15 | ||
16 | #![allow(dead_code)] | |
17 | #![allow(unused_variables)] | |
18 | #![allow(unused_assignments)] | |
19 | ||
20 | ||
21 | pub struct HiBob { | |
22 | pub field1: i32, | |
23 | field2: u64, | |
24 | } | |
25 | ||
26 | struct ByeBob(i32, u64); | |
27 | ||
28 | enum Something { | |
29 | One, | |
30 | Two, | |
31 | Three | |
32 | } | |
33 | ||
34 | enum MoreComplicated { | |
35 | One, | |
36 | Two(i32), | |
37 | Three(HiBob), | |
38 | Four{this: bool, is: u8, a: char, struct_: u64, variant: u32}, | |
39 | } | |
40 | ||
fccb08f8 MG |
41 | // tests the nonzero optimization, but fields are reversed |
42 | enum NonZeroOptimized { | |
43 | Empty, | |
44 | Value(String), | |
45 | } | |
46 | ||
67218854 TT |
47 | fn diff2(x: i32, y: i32) -> i32 { |
48 | x - y | |
49 | } | |
50 | ||
921d8f54 MG |
51 | // Empty function, should not have "void" |
52 | // or "()" in its return type | |
53 | fn empty() { | |
54 | ||
55 | } | |
56 | ||
67218854 TT |
57 | pub struct Unit; |
58 | ||
59 | // This triggers the non-zero optimization that yields a different | |
60 | // enum representation in the debug info. | |
61 | enum SpaceSaver { | |
62 | Thebox(u8, Box<i32>), | |
63 | Nothing, | |
64 | } | |
65 | ||
66 | fn main () { | |
67 | let a = (); | |
68 | let b : [i32; 0] = []; | |
69 | ||
70 | let mut c = 27; | |
71 | let d = c = 99; | |
72 | ||
73 | let e = MoreComplicated::Two(73); | |
74 | let e2 = MoreComplicated::Four {this: true, is: 8, a: 'm', | |
75 | struct_: 100, variant: 10}; | |
76 | ||
77 | let f = "hi bob"; | |
78 | let g = b"hi bob"; | |
79 | let h = b'9'; | |
80 | ||
81 | let i = ["whatever"; 8]; | |
82 | ||
83 | let j = Unit; | |
84 | ||
85 | let k = SpaceSaver::Nothing; | |
86 | let l = SpaceSaver::Thebox(9, Box::new(1729)); | |
87 | ||
88 | let v = Something::Three; | |
89 | let w = [1,2,3,4]; | |
42d94011 | 90 | let w_ptr = &w[0]; |
67218854 TT |
91 | let x = (23, 25.5); |
92 | let y = HiBob {field1: 7, field2: 8}; | |
93 | let z = ByeBob(7, 8); | |
94 | ||
95 | let slice = &w[2..3]; | |
96 | let fromslice = slice[0]; | |
97 | let slice2 = &slice[0..1]; | |
98 | ||
99 | let all1 = &w[..]; | |
100 | let all2 = &slice[..]; | |
101 | ||
102 | let from1 = &w[1..]; | |
103 | let from2 = &slice[1..]; | |
104 | ||
105 | let to1 = &w[..3]; | |
106 | let to2 = &slice[..1]; | |
107 | ||
fccb08f8 MG |
108 | // tests for enum optimizations |
109 | ||
110 | let str_some = Some("hi".to_string()); | |
111 | let str_none = None::<String>; | |
112 | let box_some = Some(Box::new(1u8)); | |
113 | let box_none = None::<Box<u8>>; | |
114 | let int_some = Some(1u8); | |
115 | let int_none = None::<u8>; | |
116 | let custom_some = NonZeroOptimized::Value("hi".into()); | |
117 | let custom_none = NonZeroOptimized::Empty; | |
118 | ||
67218854 TT |
119 | println!("{}, {}", x.0, x.1); // set breakpoint here |
120 | println!("{}", diff2(92, 45)); | |
921d8f54 | 121 | empty(); |
67218854 | 122 | } |