mirror of
https://github.com/bminor/binutils-gdb.git
synced 2025-12-26 01:07:52 +00:00
25902bd0ba
Commits: commitaaad5a3254Author: Tom de Vries <tdevries@suse.de> Date: Fri Sep 5 15:36:23 2025 +0200 [gdb/testsuite] Fix clean_restart <absolute filename> in gdb.base, part 3 commit2e61486fceAuthor: Tom de Vries <tdevries@suse.de> Date: Fri Sep 5 15:36:23 2025 +0200 [gdb/testsuite] Fix clean_restart <absolute filename> in gdb.base, part 2 commit202beb3feeAuthor: Tom de Vries <tdevries@suse.de> Date: Fri Sep 5 15:36:23 2025 +0200 [gdb/testsuite] Fix clean_restart <absolute filename> in gdb.base, part 1 were made to work around the changes to clean_restart in commit: commitcba778b944Date: Sun Sep 7 11:53:30 2025 +0200 [gdb/testsuite] Error out on clean_restart <absolute filename> These commits added a lot of calls to gdb_load which can be removed in many cases by passing $testfile to clean_restart, or by switching to use prepare_for_testing to compile the test executable. In this commit I've gone through the gdb.base/ directory and removed as many of the gdb_load calls as possible. I was only looking for places where the gdb_load call immediately follows the call to clean_restart. And I did skip a few where it was not as simple as just passing $testfile. Where possible I've updated tests to use calls to prepare_for_testing, and simply removed the clean_restart call altogether (this is done as part of prepare_for_testing). This is, I think, the best solution. In other cases I've removed the gdb_load call, and passed $testfile to clean_restart. I've preferred $::testfile to adding a 'global' declaration, and in some cases switching to testfile has allowed me to remove the 'global binfile' as an additional cleanup. I ran the complete set of tests that I touched and I didn't see any regressions, so I don't believe I broke anything. I know that there are probably gdb_load calls that can be cleaned up in other testsuite sub-directories, if/when this patch is merged I'll take a look at those too. Reviewed-By: Tom de Vries <tdevries@suse.de>
113 lines
2.9 KiB
Plaintext
113 lines
2.9 KiB
Plaintext
# This testcase is part of GDB, the GNU debugger.
|
|
|
|
# Copyright 1998-2025 Free Software Foundation, Inc.
|
|
|
|
# This program is free software; you can redistribute it and/or modify
|
|
# it under the terms of the GNU General Public License as published by
|
|
# the Free Software Foundation; either version 3 of the License, or
|
|
# (at your option) any later version.
|
|
#
|
|
# This program is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU General Public License for more details.
|
|
#
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
# This file was written by Elena Zannoni (ezannoni@cygnus.com)
|
|
|
|
# Tests for correctenss of logical operators, associativity and
|
|
# precedence with integer type variables
|
|
|
|
|
|
#
|
|
# test running programs
|
|
#
|
|
|
|
standard_testfile int-type.c
|
|
|
|
if { [prepare_for_testing "prepare" $testfile $srcfile { debug nowarnings }] != 0 } {
|
|
return
|
|
}
|
|
|
|
#
|
|
# set it up at a breakpoint so we can play with the variable values
|
|
#
|
|
|
|
if {![runto_main]} {
|
|
return
|
|
}
|
|
|
|
proc evaluate { vars ops } {
|
|
for {set vari 0} {$vari < [llength $vars]} {incr vari} {
|
|
set var [lindex $vars $vari]
|
|
for {set opi 0} {$opi < [llength $ops]} {incr opi} {
|
|
set op [lindex [lindex $ops $opi] 0]
|
|
set val [lindex [lindex $ops $opi] [expr {$vari + 1}]]
|
|
gdb_test "print $var, $op" " = $val" "evaluate $op; variables $var; expecting $val"
|
|
}
|
|
}
|
|
}
|
|
|
|
# Unary
|
|
|
|
evaluate {
|
|
{x = 0} {x = 1}
|
|
} {
|
|
{ {x} 0 1 }
|
|
{ {!x} 1 0 }
|
|
{ {!!x} 0 1 }
|
|
}
|
|
|
|
# Binary (with unary)
|
|
|
|
evaluate {
|
|
{x = 0, y = 0} {x = 0, y = 1} {x = 1, y = 0} {x = 1, y = 1}
|
|
} {
|
|
{ {x && y} 0 0 0 1 }
|
|
{ {!x && y} 0 1 0 0 }
|
|
{ {x && !y} 0 0 1 0 }
|
|
{ {!x && !y} 1 0 0 0 }
|
|
|
|
{ {x || y} 0 1 1 1 }
|
|
{ {!x || y} 1 1 0 1 }
|
|
{ {x || !y} 1 0 1 1 }
|
|
{ {!x || !y} 1 1 1 0 }
|
|
|
|
{ {x < y} 0 1 0 0 }
|
|
{ {x <= y} 1 1 0 1 }
|
|
{ {x == y} 1 0 0 1 }
|
|
{ {x != y} 0 1 1 0 }
|
|
{ {x >= y} 1 0 1 1 }
|
|
{ {x > y} 0 0 1 0 }
|
|
}
|
|
|
|
# Full table of &&, || combinations, followed by random mix of unary ops
|
|
|
|
evaluate {
|
|
{x = 0, y = 0, z = 0} {x = 0, y = 0, z = 1} {x = 0, y = 1, z = 0} {x = 0, y = 1, z = 1}
|
|
{x = 1, y = 0, z = 0} {x = 1, y = 0, z = 1} {x = 1, y = 1, z = 0} {x = 1, y = 1, z = 1}
|
|
} {
|
|
{ {x && y && z} 0 0 0 0 0 0 0 1 }
|
|
{ {x || y && z} 0 0 0 1 1 1 1 1 }
|
|
{ {x && y || z} 0 1 0 1 0 1 1 1 }
|
|
{ {x || y || z} 0 1 1 1 1 1 1 1 }
|
|
|
|
{ {x || !y && z} 0 1 0 0 1 1 1 1 }
|
|
{ {!x || y && z} 1 1 1 1 0 0 0 1 }
|
|
{ {!x || y && !z} 1 1 1 1 0 0 1 0 }
|
|
}
|
|
|
|
# More complex operations
|
|
|
|
evaluate {
|
|
{x = 1, y = 2, w = 3, z = 3}
|
|
{x = 1, y = 2, w = 1, z = 3}
|
|
{x = 2, y = 2, w = 2, z = 3}
|
|
} {
|
|
{ {x > y || w == z} 1 0 0 }
|
|
{ {x >= y && w != z} 0 0 1 }
|
|
{ {! x > y || w + z} 1 1 1 }
|
|
}
|