]>
Commit | Line | Data |
---|---|---|
1a4d82fc JJ |
1 | // Copyright 2013-2014 The Rust Project Developers. See the COPYRIGHT |
2 | // file at the top-level directory of this distribution and at | |
3 | // http://rust-lang.org/COPYRIGHT. | |
4 | // | |
5 | // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or | |
6 | // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license | |
7 | // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your | |
8 | // option. This file may not be copied, modified, or distributed | |
9 | // except according to those terms. | |
10 | ||
11 | // ignore-tidy-linelength | |
a1dfa0c6 XL |
12 | |
13 | // Require LLVM with DW_TAG_variant_part and a gdb and lldb that can | |
14 | // read it. | |
15 | // min-system-llvm-version: 7.0 | |
16 | // min-gdb-version: 8.2 | |
17 | // rust-lldb | |
1a4d82fc JJ |
18 | |
19 | // compile-flags:-g | |
20 | ||
21 | // === GDB TESTS =================================================================================== | |
22 | ||
23 | // gdb-command:set print union on | |
24 | // gdb-command:run | |
25 | ||
26 | // gdb-command:print case1 | |
c30ab7b3 | 27 | // gdbr-check:$1 = tuple_style_enum::Regular::Case1(0, 31868, 31868, 31868, 31868) |
1a4d82fc JJ |
28 | |
29 | // gdb-command:print case2 | |
c30ab7b3 | 30 | // gdbr-check:$2 = tuple_style_enum::Regular::Case2(0, 286331153, 286331153) |
1a4d82fc JJ |
31 | |
32 | // gdb-command:print case3 | |
c30ab7b3 | 33 | // gdbr-check:$3 = tuple_style_enum::Regular::Case3(0, 6438275382588823897) |
1a4d82fc JJ |
34 | |
35 | // gdb-command:print univariant | |
c30ab7b3 | 36 | // gdbr-check:$4 = tuple_style_enum::Univariant::TheOnlyCase(-1) |
1a4d82fc JJ |
37 | |
38 | ||
39 | // === LLDB TESTS ================================================================================== | |
40 | ||
41 | // lldb-command:run | |
42 | ||
43 | // lldb-command:print case1 | |
0bf4aa26 | 44 | // lldbr-check:(tuple_style_enum::Regular::Case1) case1 = { = 0 = 31868 = 31868 = 31868 = 31868 } |
1a4d82fc JJ |
45 | |
46 | // lldb-command:print case2 | |
a1dfa0c6 | 47 | // lldbr-check:(tuple_style_enum::Regular::Case2) case2 = Case2 { Case1: 0, Case2: 286331153, Case3: 286331153 } |
1a4d82fc JJ |
48 | |
49 | // lldb-command:print case3 | |
a1dfa0c6 | 50 | // lldbr-check:(tuple_style_enum::Regular::Case3) case3 = Case3 { Case1: 0, Case2: 6438275382588823897 } |
1a4d82fc JJ |
51 | |
52 | // lldb-command:print univariant | |
a1dfa0c6 | 53 | // lldbr-check:(tuple_style_enum::Univariant) univariant = { TheOnlyCase = { = -1 } } |
1a4d82fc JJ |
54 | |
55 | #![allow(unused_variables)] | |
b039eaaf | 56 | #![feature(omit_gdb_pretty_printer_section)] |
1a4d82fc JJ |
57 | #![omit_gdb_pretty_printer_section] |
58 | ||
59 | use self::Regular::{Case1, Case2, Case3}; | |
60 | use self::Univariant::TheOnlyCase; | |
61 | ||
62 | // The first element is to ensure proper alignment, irrespective of the machines word size. Since | |
63 | // the size of the discriminant value is machine dependent, this has be taken into account when | |
64 | // datatype layout should be predictable as in this case. | |
65 | enum Regular { | |
66 | Case1(u64, u16, u16, u16, u16), | |
67 | Case2(u64, u32, u32), | |
68 | Case3(u64, u64) | |
69 | } | |
70 | ||
71 | enum Univariant { | |
72 | TheOnlyCase(i64) | |
73 | } | |
74 | ||
75 | fn main() { | |
76 | ||
c34b1796 | 77 | // In order to avoid endianness trouble all of the following test values consist of a single |
1a4d82fc JJ |
78 | // repeated byte. This way each interpretation of the union should look the same, no matter if |
79 | // this is a big or little endian machine. | |
80 | ||
81 | // 0b0111110001111100011111000111110001111100011111000111110001111100 = 8970181431921507452 | |
82 | // 0b01111100011111000111110001111100 = 2088533116 | |
83 | // 0b0111110001111100 = 31868 | |
84 | // 0b01111100 = 124 | |
85 | let case1 = Case1(0, 31868, 31868, 31868, 31868); | |
86 | ||
87 | // 0b0001000100010001000100010001000100010001000100010001000100010001 = 1229782938247303441 | |
88 | // 0b00010001000100010001000100010001 = 286331153 | |
89 | // 0b0001000100010001 = 4369 | |
90 | // 0b00010001 = 17 | |
91 | let case2 = Case2(0, 286331153, 286331153); | |
92 | ||
93 | // 0b0101100101011001010110010101100101011001010110010101100101011001 = 6438275382588823897 | |
94 | // 0b01011001010110010101100101011001 = 1499027801 | |
95 | // 0b0101100101011001 = 22873 | |
96 | // 0b01011001 = 89 | |
97 | let case3 = Case3(0, 6438275382588823897); | |
98 | ||
99 | let univariant = TheOnlyCase(-1); | |
100 | ||
101 | zzz(); // #break | |
102 | } | |
103 | ||
104 | fn zzz() {()} |