mirror of
https://sourceware.org/git/binutils-gdb.git
synced 2024-12-27 04:52:05 +08:00
d0ce17d853
While experimenting with GDB on DWARF 5 with split debug (dwo files), I discovered that GDB was not reading the rnglist index properly (it needed to be reprocessed in the same way the loclist index does), and that there was no code for reading rnglists out of dwo files at all. Also, the rnglist address reading function (dwarf2_rnglists_process) was adding the base address to all rnglist entries, when it's only supposed to add it to the DW_RLE_offset_pair entries (http://dwarfstd.org/doc/DWARF5.pdf, p. 53), and was not handling several entry types. - Added 'reprocessing' for reading rnglist index (as is done for loclist index). - Added code for reading rnglists out of .dwo files. - Added several missing rnglist forms to dwarf2_rnglists_process. - Fixed bug that was alwayas adding base address for rnglists (only one form needs that). - Updated dwarf2_rnglists_process to read rnglist out of dwo file when appropriate. - Added new functions cu_debug_rnglist_section & read_rnglist_index. - Added new testcase, dw5-rnglist-test.{cc,exp} Special note about the new testcase: In order for the test case to test anything meaningful, it must be compiled with clang, not GCC. The way to do this is as follows: $ make check RUNTESTFLAGS="CC_FOR_TARGET=/path/to/clang CXX_FOR_TARGET=/path/to/clang++ dw5-rnglist-test.exp" This following version of clang was used for this testing: clang version 9.0.1-11 Target: x86_64-pc-linux-gnu Thread model: posix InstalledDir: /usr/bin Change-Id: I3053c5ddc345720b8ed81e23a88fe537ab38748d
98 lines
2.1 KiB
C++
98 lines
2.1 KiB
C++
/* This testcase is part of GDB, the GNU debugger.
|
|
|
|
Copyright 2020 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/>. */
|
|
|
|
#include <iostream>
|
|
#include <vector>
|
|
|
|
struct node {
|
|
int id;
|
|
node *left;
|
|
node *right;
|
|
bool visited;
|
|
};
|
|
|
|
node node_array[50];
|
|
unsigned int CUR_IDX = 0;
|
|
|
|
node *
|
|
make_node (int val)
|
|
{
|
|
node *new_node = &(node_array[CUR_IDX++]);
|
|
new_node->left = NULL;
|
|
new_node->right = NULL;
|
|
new_node->id = val;
|
|
new_node->visited = false;
|
|
|
|
return new_node;
|
|
}
|
|
|
|
void
|
|
tree_insert (node *root, int val)
|
|
{
|
|
if (val < root->id)
|
|
{
|
|
if (root->left)
|
|
tree_insert (root->left, val);
|
|
else
|
|
root->left = make_node(val);
|
|
}
|
|
else if (val > root->id)
|
|
{
|
|
if (root->right)
|
|
tree_insert (root->right, val);
|
|
else
|
|
root->right = make_node(val);
|
|
}
|
|
}
|
|
|
|
void
|
|
inorder (node *root)
|
|
{
|
|
std::vector<node *> todo;
|
|
todo.push_back (root);
|
|
while (!todo.empty())
|
|
{
|
|
node *curr = todo.back();
|
|
todo.pop_back(); /* break-here */
|
|
if (curr->visited)
|
|
std::cout << curr->id << " ";
|
|
else
|
|
{
|
|
curr->visited = true;
|
|
if (curr->right)
|
|
todo.push_back (curr->right);
|
|
todo.push_back (curr);
|
|
if (curr->left)
|
|
todo.push_back (curr->left);
|
|
}
|
|
}
|
|
}
|
|
|
|
int
|
|
main (int argc, char **argv)
|
|
{
|
|
node *root = make_node (35);
|
|
|
|
tree_insert (root, 28);
|
|
tree_insert (root, 20);
|
|
tree_insert (root, 60);
|
|
|
|
inorder (root);
|
|
|
|
return 0;
|
|
}
|