<html><head><meta http-equiv="Content-Type" content="text/html; charset=us-ascii"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">Looking through the commands, AFAICT going to uint32_t should be safe except for GIM_CheckLiteralInt, GIR_AddImm which will need some changes to store their 64-bit immediates as two 32-bit halves.<div class=""><br class=""></div><div class="">For testing, making sure llvm-lit and test-suite don't change behaviour will be the main one but there's a couple other things that can make you fairly confident without that:</div><div class=""><ul class="MailOutline"><li class="">Continue using uint64_t in TableGen and convert to 32-bit at the last moment. Then assert that there was no loss of information in the cast</li><li class="">Diff the state machine table before and after. Labels and JumpTargets aside it should be almost identical with just the changes to GIM_CheckLiteralInt GIR_AddImm. The Labels and JumpTargets will be thrown out by the extra elements but it's possible to script the corrections to end up with matching tables. For example, in vim I'd probably use macros to find and increment all the Labels/JumpTargets following a GIM_CheckLiteralInt/GIR_AddImm</li></ul><div class=""><div><br class=""><blockquote type="cite" class=""><div class="">On Dec 16, 2020, at 06:50, Paul C. Anagnostopoulos <<a href="mailto:paul@windfall.com" class="">paul@windfall.com</a>> wrote:</div><br class="Apple-interchange-newline"><div class=""><div class="">Indeed, this is certainly a complication. If we go to uint32_t, then we could use table indexes for those commands, correct? Surely no table will ever have more than 4 billion entries.<br class=""><br class="">In anticipation of working on this, can you tell me what is the easiest way to test such changes? I haven't gotten my head around the testing procedures yet.<br class=""><br class=""><br class="">At 12/15/2020 10:44 PM, Daniel Sanders wrote:<br class=""><blockquote type="cite" class="">Most of the reasons boil down to not having the time needed to implement something better. There is one bit I'm aware of that snowballs a bit when using uint32_t or smaller. Labels and JumpTargets are currently absolute which allows them to be recorded in a simple lookup table during the first pass to encode on the second. JumpTargets will need to become relative (and know where they are in the table) to cope with a large ruleset and reduced range but that also means you have to start measuring distances between two points in the table. For fixed-sized commands that's not too bad but if the range drops below the minimum then you also have to go to variable length commands (or waste space on padding). That in turn means that you need to determine the encoded size of commands on the first pass (including JumpTargets which have unknown encoding until the label is seen later) so that the labels know their position for the second pass when we encode the table. We'll have to go from the two-pass approach to a relaxation one.<br class=""></blockquote><br class=""></div></div></blockquote></div><br class=""></div></div></body></html>