diff options
| author |   Masahiro Yamada <yamada.masahiro@socionext.com> | 2019-11-24 01:04:32 +0900 |
|---|---|---|
| committer | Masahiro Yamada <yamada.masahiro@socionext.com> | 2019-11-25 21:02:18 +0900 |
| commit | f34ea0291029781810ca4c213713dc6b4a686322 (patch) | |
| tree | b6b9c48fd1a5e5f7f2048b9e3b1459175174b571 /security | |
| parent | scripts/kallsyms: shrink table before sorting it (diff) | |
| download | linux-dev-f34ea0291029781810ca4c213713dc6b4a686322.tar.xz linux-dev-f34ea0291029781810ca4c213713dc6b4a686322.zip | |
scripts/kallsyms: set relative_base more effectively
Currently, record_relative_base() iterates over the entire table to
find the minimum address, but it is not efficient because we sort
the table anyway.
After sort_symbol(), the table is sorted by address. (kallsyms parses
the 'nm -n' output, so the data is already sorted by address, but this
commit does not rely on it.)
Move record_relative_base() after sort_symbols(), and take the first
non-absolute symbol value.
Signed-off-by: Masahiro Yamada <yamada.masahiro@socionext.com>
Diffstat (limited to 'security')
0 files changed, 0 insertions, 0 deletions