Sort ABI lists by name so that changes don't generate big diffs

llvm-svn: 284198
2016-10-14 05:04:00 +00:00 · 2016-10-14 05:04:00 +00:00 · 505233b966
parent d4327e95dd
commit 505233b966
5 changed files with 5342 additions and 5342 deletions
--- a/libcxx/lib/abi/3.9/x86_64-apple-darwin16.0.abilist
+++ b/libcxx/lib/abi/3.9/x86_64-apple-darwin16.0.abilist
--- a/libcxx/lib/abi/3.9/x86_64-linux-gnu.abilist
+++ b/libcxx/lib/abi/3.9/x86_64-linux-gnu.abilist
--- a/libcxx/lib/abi/x86_64-apple-darwin16.0.abilist
+++ b/libcxx/lib/abi/x86_64-apple-darwin16.0.abilist
--- a/libcxx/lib/abi/x86_64-linux-gnu.abilist
+++ b/libcxx/lib/abi/x86_64-linux-gnu.abilist
--- a/libcxx/utils/sym_check/sym_check/util.py
+++ b/libcxx/utils/sym_check/sym_check/util.py
@ -79,9 +79,9 @@ def write_syms(sym_list, out=None, names_only=False):
    """
    out_str = ''
    out_list = sym_list
+    out_list.sort(key=lambda x: x['name'])
    if names_only:
        out_list = [sym['name'] for sym in sym_list]
-        out_list.sort()
    for sym in out_list:
        out_str += '%s\n' % sym
    if out is None: