diff options
author | Tom Tromey <tromey@adacore.com> | 2022-02-22 09:48:25 -0700 |
---|---|---|
committer | Tom Tromey <tromey@adacore.com> | 2022-04-04 12:46:09 -0600 |
commit | 1e237aba2216f89b9a4b3235ad8d09d1b1b8f039 (patch) | |
tree | 088adb7b45abf2f494d139e2a4865355d8cef3bf /binutils/po/ca.po | |
parent | 28c4b1ffaa41b17af11984c0383a8a37ea00eef4 (diff) | |
download | gdb-1e237aba2216f89b9a4b3235ad8d09d1b1b8f039.zip gdb-1e237aba2216f89b9a4b3235ad8d09d1b1b8f039.tar.gz gdb-1e237aba2216f89b9a4b3235ad8d09d1b1b8f039.tar.bz2 |
Refactor expression completion
This refactors the gdb expression completion code to make it easier to
add more types of completers.
In the old approach, just two kinds of completers were supported:
field names for some sub-expression, or tag names (like "enum
something"). The data for each kind was combined in single structure,
"expr_completion_state", and handled explicitly by
complete_expression.
In the new approach, the parser state just holds an object that is
responsible for implementing completion. This way, new completion
types can be added by subclassing this base object.
The structop completer is moved into structop_base_operation, and new
objects are defined for use by the completion code. This moves much
of the logic of expression completion out of completer.c as well.
Diffstat (limited to 'binutils/po/ca.po')
0 files changed, 0 insertions, 0 deletions