Sort callback tables by id

This way the generated file is more deterministic, and hopefully less
irrelevant diff is produced (for example when switching from Python 2
to Python 3, or when adding more callbacks that cause rehashing the
dictionary).
This commit is contained in:
Giovanni Mascellani 2020-11-04 12:46:07 +01:00 committed by Andrew Eikum
parent 9566b93f25
commit 04af5e3d79
3 changed files with 516 additions and 516 deletions

View file

@ -1263,7 +1263,7 @@ cbsizefile = open("cb_getapi_sizes.dat", "w")
cbsizefile.write("#ifdef __i386__\n")
getapifile.write("#ifdef __i386__\n")
for cb in cb_table.keys():
for cb in sorted(cb_table.keys()):
cbsizefile.write("case %u: /* %s */\n" % (cb, cb_table[cb][1][0][1]))
cbsizefile.write(" return %u;\n" % cb_table[cb][0])
getapifile.write("case %u:\n" % cb)
@ -1277,7 +1277,7 @@ getapifile.write("#endif\n")
cbsizefile.write("#ifdef __x86_64__\n")
getapifile.write("#ifdef __x86_64__\n")
for cb in cb_table64.keys():
for cb in sorted(cb_table64.keys()):
cbsizefile.write("case %u: /* %s */\n" % (cb, cb_table64[cb][1][0][1]))
cbsizefile.write(" return %u;\n" % cb_table64[cb][0])
getapifile.write("case %u:\n" % cb)