Fix skip.exp test failure observed with gcc-9.2.0
[deliverable/binutils-gdb.git] / gdb / testsuite / gdb.base / examine-backward.c
CommitLineData
bb556f1f
TK
1/* This testcase is part of GDB, the GNU debugger.
2
42a4f53d 3 Copyright 2015-2019 Free Software Foundation, Inc.
bb556f1f
TK
4
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 3 of the License, or
8 (at your option) any later version.
9
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>. */
17
18/*
19Define TestStrings, TestStringsH, and TestStringsW to test utf8, utf16,
20and utf32 strings respectively.
21To avoid compile errors due to old compiler mode, we don't use string
22literals. The content of each array is the same as followings:
23
24 const char TestStrings[] = {
25 "ABCD"
26 "EFGHIJKLMNOPQRSTUVWXYZ\0"
27 "\0"
28 "\0"
29 "\u307B\u3052\u307B\u3052\0"
30 "012345678901234567890123456789\0"
31 "!!!!!!\0"
32 };
33*/
34
59a56148
AA
35/* This is here just to ensure we have a null character before
36 TestStrings, to avoid showing garbage when we look for strings
37 backwards from TestStrings. */
38
39const char Barrier[] = {
40 0x00,
41};
42
bb556f1f
TK
43const char TestStrings[] = {
44 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48,
45 0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f, 0x50,
46 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, 0x58,
47 0x59, 0x5a, 0x00, 0x00, 0x00, 0xe3, 0x81, 0xbb,
48 0xe3, 0x81, 0x92, 0xe3, 0x81, 0xbb, 0xe3, 0x81,
49 0x92, 0x00, 0x30, 0x31, 0x32, 0x33, 0x34, 0x35,
50 0x36, 0x37, 0x38, 0x39, 0x30, 0x31, 0x32, 0x33,
51 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x30, 0x31,
52 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39,
53 0x00, 0x21, 0x21, 0x21, 0x21, 0x21, 0x21, 0x00,
54 0x00
55};
56
57const short TestStringsH[] = {
58 0x0041, 0x0042, 0x0043, 0x0044, 0x0045, 0x0046, 0x0047, 0x0048,
59 0x0049, 0x004a, 0x004b, 0x004c, 0x004d, 0x004e, 0x004f, 0x0050,
60 0x0051, 0x0052, 0x0053, 0x0054, 0x0055, 0x0056, 0x0057, 0x0058,
61 0x0059, 0x005a, 0x0000, 0x0000, 0x0000, 0x307b, 0x3052, 0x307b,
62 0x3052, 0x0000, 0x0030, 0x0031, 0x0032, 0x0033, 0x0034, 0x0035,
63 0x0036, 0x0037, 0x0038, 0x0039, 0x0030, 0x0031, 0x0032, 0x0033,
64 0x0034, 0x0035, 0x0036, 0x0037, 0x0038, 0x0039, 0x0030, 0x0031,
65 0x0032, 0x0033, 0x0034, 0x0035, 0x0036, 0x0037, 0x0038, 0x0039,
66 0x0000, 0x0021, 0x0021, 0x0021, 0x0021, 0x0021, 0x0021, 0x0000,
67 0x0000
68};
69
70const int TestStringsW[] = {
71 0x00000041, 0x00000042, 0x00000043, 0x00000044,
72 0x00000045, 0x00000046, 0x00000047, 0x00000048,
73 0x00000049, 0x0000004a, 0x0000004b, 0x0000004c,
74 0x0000004d, 0x0000004e, 0x0000004f, 0x00000050,
75 0x00000051, 0x00000052, 0x00000053, 0x00000054,
76 0x00000055, 0x00000056, 0x00000057, 0x00000058,
77 0x00000059, 0x0000005a, 0x00000000, 0x00000000,
78 0x00000000, 0x0000307b, 0x00003052, 0x0000307b,
79 0x00003052, 0x00000000, 0x00000030, 0x00000031,
80 0x00000032, 0x00000033, 0x00000034, 0x00000035,
81 0x00000036, 0x00000037, 0x00000038, 0x00000039,
82 0x00000030, 0x00000031, 0x00000032, 0x00000033,
83 0x00000034, 0x00000035, 0x00000036, 0x00000037,
84 0x00000038, 0x00000039, 0x00000030, 0x00000031,
85 0x00000032, 0x00000033, 0x00000034, 0x00000035,
86 0x00000036, 0x00000037, 0x00000038, 0x00000039,
87 0x00000000, 0x00000021, 0x00000021, 0x00000021,
88 0x00000021, 0x00000021, 0x00000021, 0x00000000,
89 0x00000000
90};
91
92int
93main (void)
94{
95 /* Backward disassemble test requires at least 20 instructions in
96 this function. Adding a simple bubble sort. */
97 int i, j;
98 int n[] = {3, 1, 4, 1, 5, 9};
99 int len = sizeof (n) / sizeof (n[0]);
100
101 for (i = 0; i < len - 1; ++i)
102 {
103 for (j = i; j < len; ++j)
104 {
105 if (n[j] < n[i])
106 {
107 int tmp = n[i];
108 n[i] = n[j];
109 n[j] = tmp;
110 }
111 }
112 }
113 return 42;
114}
This page took 0.416984 seconds and 4 git commands to generate.