mirror of
https://github.com/bminor/binutils-gdb.git
synced 2025-11-16 12:34:43 +00:00
5fe70629ce
This patch introduces a new macro, INIT_GDB_FILE. This is used to
replace the current "_initialize_" idiom when introducing a per-file
initialization function. That is, rather than write:
void _initialize_something ();
void
_initialize_something ()
{
...
}
... now you would write:
INIT_GDB_FILE (something)
{
...
}
The macro handles both the declaration and definition of the function.
The point of this approach is that it makes it harder to accidentally
cause an initializer to be omitted; see commit 2711e475 ("Ensure
cooked_index_entry self-tests are run"). Specifically, the regexp now
used by make-init-c seems harder to trick.
New in v2: un-did some erroneous changes made by the script.
The bulk of this patch was written by script.
Regression tested on x86-64 Fedora 41.
114 lines
2.7 KiB
C
114 lines
2.7 KiB
C
/* Self tests for mem ranges for GDB, the GNU debugger.
|
|
|
|
Copyright (C) 2017-2025 Free Software Foundation, Inc.
|
|
|
|
This file is part of GDB.
|
|
|
|
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/>. */
|
|
|
|
#include "gdbsupport/selftest.h"
|
|
#include "memrange.h"
|
|
|
|
namespace selftests {
|
|
namespace memrange_tests {
|
|
|
|
static void
|
|
normalize_mem_ranges_tests ()
|
|
{
|
|
/* Empty vector. */
|
|
{
|
|
std::vector<mem_range> ranges;
|
|
|
|
normalize_mem_ranges (&ranges);
|
|
|
|
SELF_CHECK (ranges.size () == 0);
|
|
}
|
|
|
|
/* With one range. */
|
|
{
|
|
std::vector<mem_range> ranges;
|
|
|
|
ranges.emplace_back (10, 20);
|
|
|
|
normalize_mem_ranges (&ranges);
|
|
|
|
SELF_CHECK (ranges.size () == 1);
|
|
SELF_CHECK (ranges[0] == mem_range (10, 20));
|
|
}
|
|
|
|
/* Completely disjoint ranges. */
|
|
{
|
|
std::vector<mem_range> ranges;
|
|
|
|
ranges.emplace_back (20, 1);
|
|
ranges.emplace_back (10, 1);
|
|
|
|
normalize_mem_ranges (&ranges);
|
|
|
|
SELF_CHECK (ranges.size () == 2);
|
|
SELF_CHECK (ranges[0] == mem_range (10, 1));
|
|
SELF_CHECK (ranges[1] == mem_range (20, 1));
|
|
}
|
|
|
|
/* Overlapping and contiguous ranges. */
|
|
{
|
|
std::vector<mem_range> ranges;
|
|
|
|
ranges.emplace_back (5, 10);
|
|
ranges.emplace_back (10, 10);
|
|
ranges.emplace_back (15, 10);
|
|
|
|
normalize_mem_ranges (&ranges);
|
|
|
|
SELF_CHECK (ranges.size () == 1);
|
|
SELF_CHECK (ranges[0] == mem_range (5, 20));
|
|
}
|
|
|
|
/* Duplicate ranges. */
|
|
{
|
|
std::vector<mem_range> ranges;
|
|
|
|
ranges.emplace_back (10, 10);
|
|
ranges.emplace_back (10, 10);
|
|
|
|
normalize_mem_ranges (&ranges);
|
|
|
|
SELF_CHECK (ranges.size () == 1);
|
|
SELF_CHECK (ranges[0] == mem_range (10, 10));
|
|
}
|
|
|
|
/* Range completely inside another. */
|
|
{
|
|
std::vector<mem_range> ranges;
|
|
|
|
ranges.emplace_back (14, 2);
|
|
ranges.emplace_back (10, 10);
|
|
|
|
normalize_mem_ranges (&ranges);
|
|
|
|
SELF_CHECK (ranges.size () == 1);
|
|
SELF_CHECK (ranges[0] == mem_range (10, 10));
|
|
}
|
|
}
|
|
|
|
} /* namespace memrange_tests */
|
|
} /* namespace selftests */
|
|
|
|
INIT_GDB_FILE (memrange_selftests)
|
|
{
|
|
selftests::register_test
|
|
("normalize_mem_ranges",
|
|
selftests::memrange_tests::normalize_mem_ranges_tests);
|
|
}
|