aboutsummaryrefslogtreecommitdiff
path: root/gdb/guile/scm-iterator.c
diff options
context:
space:
mode:
authorMichael Matz <matz@suse.de>2022-11-10 16:06:20 +0100
committerMichael Matz <matz@suse.de>2022-11-28 16:30:18 +0100
commitaf31506c31a59a6edbb13498d6075fa704b801cd (patch)
treeef51c9ca7ae6683c3a2fc134e3b4074245df4dc0 /gdb/guile/scm-iterator.c
parent049522cae9798e51dd0c58566a9a2c61ba9100a9 (diff)
downloadgdb-af31506c31a59a6edbb13498d6075fa704b801cd.zip
gdb-af31506c31a59a6edbb13498d6075fa704b801cd.tar.gz
gdb-af31506c31a59a6edbb13498d6075fa704b801cd.tar.bz2
Only use wild_sort_fast
there's no reason why the tree-based variant can't always be used when sorting is required, it merely needs to also support filename sorting and have a fast path for insertion at end (aka rightmost tree leaf). The filename sorting isn't tested anywhere and the only scripttempl that uses it is avr (for 'SORT(*)(.ctors)'), and I believe even there it was a mistake. Either way, this adds a testcase for filename sorting as well. Then the non-BST based sorting can be simplified to only support the fast case of no sorting required at all (at the same time renaming the two variants to _sort and _nosort).
Diffstat (limited to 'gdb/guile/scm-iterator.c')
0 files changed, 0 insertions, 0 deletions