US 11,995,441 B1
Instruction decoding using hash tables
Alexey Koryakin, Moscow (RU); and Nikolay Dobrovolskiy, Moscow (RU)
Assigned to Parallels International GmbH, Schaffhausen (CH)
Filed by PARALLELS INTERNATIONAL GmbH, Schaffhausen (CH)
Filed on Nov. 11, 2022, as Appl. No. 17/985,469.
Application 17/985,469 is a continuation of application No. 17/321,956, filed on May 17, 2021, granted, now 11,520,587.
Application 17/321,956 is a continuation of application No. 16/417,033, filed on May 20, 2019, granted, now 11,068,269, issued on Jul. 20, 2021.
Int. Cl. G06F 9/30 (2018.01); G06F 16/901 (2019.01)
CPC G06F 9/30167 (2013.01) [G06F 9/30036 (2013.01); G06F 16/9014 (2019.01); G06F 16/9027 (2019.01)] 15 Claims
OG exemplary drawing
 
1. A method, comprising:
constructing a hash table implementing a current level of a decoding tree representing a subset of a set of processor instructions which is indexed by one or more opcode bit positions;
determining whether an element of the constructed hash table references another hash table; and
executing a loop back process before repeating the steps of constructing and determining upon a positive determination; wherein
the hash table is indexed by one or more opcode bits identified by the one or more opcode bit positions.