├── .gitignore ├── LICENSE ├── README.md ├── analysis ├── dataset.js ├── haruspex.js ├── package.json └── public │ ├── chipview.js │ ├── grid.html │ ├── gridview.js │ ├── index.html │ ├── list.html │ ├── listview.js │ ├── logo.svg │ └── stylesheet.css ├── kernel ├── decoder_test.cpp └── ia32.hpp └── raw-data ├── isa-6850k.zip ├── isa-9750h.zip └── isa-9980xe.zip /.gitignore: -------------------------------------------------------------------------------- 1 | node_modules/ 2 | raw-data/*.cache* 3 | package-lock.json 4 | raw-data/*.json 5 | .vscode/ 6 | *.ai 7 | 8 | analysis/public/dataset*.json 9 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 |

2 | 3 |

Haruspex

4 |

/həˈrʌspeks/

5 |
A religious official in ancient Rome who predicted the future or interpreted the meaning of events by examining the insides of birds or animals that had been sacrificed.
6 |

7 | Exploration of x86-64 ISA using speculative execution. 8 |

9 |

10 |

11 | 12 | Haruspex is a project attempting to explore and audit the x86-64 instruction set by (ab)using speculative execution and certain low-level performance counters Intel CPUs provide mainly for the identification of undocumented opcodes and deducing the pipeline properties of each instruction. You can find the article explaining the methodology [here](https://blog.can.ac/2021/03/22/speculating-x86-64-isa-with-one-weird-trick/). 13 | 14 | - `/analysis` contains the Node.js server responsible for reducing the dataset and serving it as an interactive table, which you can find live at [haruspex.can.ac](https://haruspex.can.ac) 15 | . 16 | - `/kernel` contains the code responsible for producing this data, note that it is essentially "pseudo-code" due to some of the dependencies and parts of the toolchain I used to build it I cannot share, but should be pretty easy to translate it to work in your OS. 17 | - `/raw-data` contains the raw data from certain processors. 18 | 19 | # Thanks to 20 | 21 | - @JustasMasiulis for helping with the web components. 22 | - @H4vC for the name. 23 | 24 | # License 25 | 26 | Haruspex is licensed under the GNU General Public License v3. 27 | -------------------------------------------------------------------------------- /analysis/dataset.js: -------------------------------------------------------------------------------- 1 | const fs = require("fs"); 2 | const crypto = require("crypto"); 3 | 4 | const prefixList = [ 5 | "2e", 6 | "36", 7 | "3e", 8 | "26", 9 | "40", 10 | "41", 11 | "42", 12 | "43", 13 | "44", 14 | "45", 15 | "46", 16 | "47", 17 | "48", 18 | "49", 19 | "4a", 20 | "4b", 21 | "4c", 22 | "4d", 23 | "4e", 24 | "4f", 25 | "64", 26 | "65", 27 | "66", 28 | "67", 29 | "9b", 30 | "f0", 31 | "f2", 32 | "f3", 33 | ]; 34 | 35 | function hexb(v) { 36 | return v <= 0xf ? "0" + v.toString(16) : v.toString(16); 37 | } 38 | 39 | function parse(rawData) { 40 | // Read and parse the JSON. 41 | // 42 | const { nopBaseline, brand, faultBaseline, data, nopUops } = JSON.parse(rawData); 43 | 44 | // Parse the entries slightly. 45 | // 46 | const instructions = {}; 47 | for (const entry of data) { 48 | entry.opcode = Buffer.from(entry.opcode).toString("hex"); 49 | entry.mits = entry.uops[0] - faultBaseline.mits; 50 | entry.ms = entry.uops[2] - faultBaseline.ms; 51 | delete entry.uops; 52 | 53 | if ( 54 | entry.ms < 0 || 55 | entry.mits < 0 || 56 | entry.category.includes("_BR") || 57 | entry.category.includes("CALL_") 58 | ) { 59 | entry.branch = true; 60 | entry.serializing = null; 61 | entry.ms = 0; 62 | entry.mits = 0; 63 | } else { 64 | entry.branch = false; 65 | entry.serializing = entry.mits == 0; 66 | } 67 | entry.speculationFence = entry.outOfOrder < 4; 68 | instructions[entry.opcode] = entry; 69 | } 70 | 71 | const propertyMatch = (i1, i2) => { 72 | return ( 73 | i2.ms == i1.ms && 74 | i2.iclass == i1.iclass && 75 | i2.category == i1.category && 76 | i2.extension == i1.extension && 77 | i2.cpl == i1.cpl && 78 | i2.valid == i1.valid 79 | ); 80 | }; 81 | 82 | // Purge redundant suffixes. 83 | // 84 | let suffixPurgeCounter = 0; 85 | const keysSorted = Object.keys(instructions).sort(function (a, b) { 86 | return a.length - b.length; 87 | }); 88 | for (const key of keysSorted) { 89 | const evaluate = (k1, ki1) => { 90 | const i1 = instructions[ki1]; 91 | if (!i1) { 92 | return; 93 | } 94 | 95 | let matches = []; 96 | for (let n = 0; n <= 0xff; n++) { 97 | const k2 = k1 + hexb(n); 98 | const i2 = instructions[k2]; 99 | if (i2 && propertyMatch(i1, i2)) { 100 | matches.push(k2); 101 | } 102 | } 103 | 104 | if (matches.length < 256) { 105 | return false; 106 | } 107 | 108 | let success = false; 109 | for (const k2 of matches) { 110 | if (k2 != ki1) { 111 | delete instructions[k2]; 112 | suffixPurgeCounter++; 113 | success = true; 114 | } 115 | } 116 | return success; 117 | }; 118 | if (evaluate(key, key) || key.length > 2) { 119 | evaluate(key.substr(0, key.length - 2), key); 120 | } 121 | } 122 | 123 | // Purge redundant prefixes. 124 | // 125 | let prefixPurgeCounter = 0; 126 | for (const k1 of Object.keys(instructions)) { 127 | // Skip if already deleted. 128 | // 129 | const i1 = instructions[k1]; 130 | if (!i1) { 131 | continue; 132 | } 133 | 134 | // Iterate each prefix (apart from 0f): 135 | // 136 | for (const pfx of prefixList) { 137 | // If the instruction exists: 138 | // 139 | const k2 = pfx + k1; 140 | if (k2 in instructions) { 141 | // If the instruction has matching properties as the derived from parent, delete the entry. 142 | // 143 | const i2 = instructions[k2]; 144 | if (propertyMatch(i1, i2)) { 145 | // MITS#1 == MITS#2 can indicate same instruction if instruction halts. 146 | // Otherwise MITS#1 has to be one more than MITS#2 since it should execute one more NOP. 147 | // 148 | if (i1.mits != i2.mits) { 149 | if (i1.mits != i2.mits + nopUops) { 150 | continue; 151 | } 152 | } else if (i1.mits > faultBaseline.mits) { 153 | continue; 154 | } 155 | 156 | prefixPurgeCounter++; 157 | delete instructions[k2]; 158 | } 159 | } 160 | } 161 | } 162 | 163 | // Return the parsed entry. 164 | // 165 | return { 166 | brand, 167 | instructions, 168 | prefixPurgeCounter, 169 | suffixPurgeCounter, 170 | nopUops, 171 | }; 172 | } 173 | 174 | function load(path, noCache = false) { 175 | // Skip the body if no-caching is requested. 176 | // 177 | if (noCache) { 178 | return parse(fs.readFileSync(path)); 179 | } 180 | 181 | // Read the data and weakly hash the input. 182 | // 183 | const data = fs.readFileSync(path); 184 | const sha256 = crypto.createHash("sha256"); 185 | sha256.update(data); 186 | const hash = sha256.digest().toString("hex").substr(0, 8); 187 | 188 | // See if there is a cached instance, if so return without parsing. 189 | // 190 | const cacheName = path + ".cache" + hash; 191 | if (fs.existsSync(cacheName)) { 192 | try { 193 | return JSON.parse(fs.readFileSync(cacheName)); 194 | } catch (ex) { 195 | console.warn(`Error parsing cache entry ${cacheName}`); 196 | } 197 | } 198 | 199 | // Parse the data, write the cache entry, return the result. 200 | // 201 | const parsed = parse(data); 202 | fs.writeFileSync(cacheName, JSON.stringify(parsed)); 203 | return parsed; 204 | } 205 | 206 | module.exports = { 207 | parse, 208 | load, 209 | }; 210 | -------------------------------------------------------------------------------- /analysis/haruspex.js: -------------------------------------------------------------------------------- 1 | const dataset = require("./dataset"); 2 | const yargs = require("yargs"); 3 | const compression = require("compression"); 4 | const path = require("path"); 5 | const express = require("express"); 6 | const fs = require("fs"); 7 | const staticPath = __dirname + "/public"; 8 | 9 | // Parse the arguments. 10 | // 11 | const argv = yargs 12 | .command("process", "Produces a reduced data-set given raw data.", { 13 | dataset: { 14 | description: "path to the dataset, will be written over with the processed dataset", 15 | alias: "f", 16 | type: "string", 17 | }, 18 | }) 19 | .command("start", "Starts the interactive server.", { 20 | dataset: { 21 | description: "path to the dataset directory", 22 | alias: "f", 23 | type: "string", 24 | }, 25 | port: { 26 | description: "port number, defaults to 80", 27 | alias: "p", 28 | type: "number", 29 | }, 30 | }) 31 | .help() 32 | .alias("help", "h").argv; 33 | 34 | // If requested to process a dataset: 35 | // 36 | if (argv._.includes("process")) { 37 | fs.writeFileSync(argv.file, JSON.stringify(dataset.load(argv.dataset, true))); 38 | } 39 | 40 | // If not requested to start the server, return. 41 | // 42 | if (!argv._.includes("start")) { 43 | return; 44 | } 45 | 46 | // Discover all datasets. 47 | // 48 | const datasetdir = argv.dataset || __dirname + "/../raw-data/"; 49 | const datasetEntries = fs 50 | .readdirSync(datasetdir) 51 | .filter((k) => k.startsWith("isa-") && k.endsWith(".json")) 52 | .map((e) => ({ name: e.substr(4, e.length - 9), path: path.join(datasetdir, e) })); 53 | 54 | // Process and save all datasets to the static data path. 55 | // 56 | const datasetList = []; 57 | for (const { name, path } of datasetEntries) { 58 | const data = dataset.load(path); 59 | fs.writeFileSync(staticPath + `/dataset-${name}.json`, JSON.stringify(data)); 60 | datasetList.push({ id: name, brand: data.brand }); 61 | } 62 | 63 | // Declare the endpoints. 64 | // 65 | const app = express(); 66 | app.use(compression()); 67 | app.use("/static", express.static(staticPath)); 68 | app.get("/", (req, res) => { 69 | res.sendFile(staticPath + "/index.html"); 70 | }); 71 | app.get("/datasets.json", (req, res) => { 72 | res.send(JSON.stringify(datasetList)); 73 | }); 74 | app.get("/chip/:chip", (req, res) => { 75 | res.redirect("/chip/" + req.params.chip + "/grid/"); 76 | }); 77 | app.get("/chip/:chip/list", (req, res) => { 78 | res.sendFile(staticPath + "/list.html"); 79 | }); 80 | app.get("/chip/:chip/grid/:sub?", (req, res) => { 81 | res.sendFile(staticPath + "/grid.html"); 82 | }); 83 | app.get("*", function (req, res) { 84 | res.redirect("/"); 85 | }); 86 | 87 | // Start listening. 88 | // 89 | const port = argv.port || 80; 90 | app.listen(port, () => { 91 | console.log(`Listening at http://localhost:${port}`); 92 | }); 93 | -------------------------------------------------------------------------------- /analysis/package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "haruspex", 3 | "version": "1.0.0", 4 | "description": "Analysis server for the Haruspex project for exploration of x86-64 ISA.", 5 | "main": "haruspex.js", 6 | "repository": { 7 | "type": "git", 8 | "url": "git+https://github.com/can1357/haruspex.git" 9 | }, 10 | "author": "Can Bölük", 11 | "license": "GPL-3.0-or-later", 12 | "bugs": { 13 | "url": "https://github.com/can1357/haruspex/issues" 14 | }, 15 | "homepage": "https://github.com/can1357/haruspex#readme", 16 | "dependencies": { 17 | "compression": "^1.7.4", 18 | "express": "^4.17.1", 19 | "yargs": "^16.2.0" 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /analysis/public/chipview.js: -------------------------------------------------------------------------------- 1 | // Write the chip table. 2 | // 3 | async function writeTable() { 4 | const datasets = await (await fetch(`/datasets.json`)).json(); 5 | console.log(datasets); 6 | 7 | const el = document.getElementById("chip-table"); 8 | for (const { id, brand } of datasets) { 9 | el.innerHTML += `${brand}`; 10 | } 11 | } 12 | writeTable(); 13 | -------------------------------------------------------------------------------- /analysis/public/grid.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 9 | 13 | 14 | 15 | Haruspex 16 | 17 | 18 |
19 |
20 | 21 | 22 | 23 |
24 |
25 | Grid 26 |
27 |
28 | List 29 |
30 |
31 | Github 32 |
33 |
34 | 35 |
36 |
37 | Click on cells to see information about instruction or the next instruction group. 38 |
39 | 40 | 43 | 44 | 45 | 46 |
47 |
48 | 49 | 50 | 51 | 52 | -------------------------------------------------------------------------------- /analysis/public/gridview.js: -------------------------------------------------------------------------------- 1 | // Find the chip we're browsing from the URL, adjust the nav-bar and define the dataset getter. 2 | // 3 | const { chip, opcode } = window.location.href.match( 4 | /.*\/chip\/(?.*?)\/grid[\/]?(?.*)/m 5 | ).groups; 6 | document.getElementById("grid-link").href = `/chip/${chip}/grid`; 7 | document.getElementById("list-link").href = `/chip/${chip}/list`; 8 | let dataset = null; 9 | async function getDataset() { 10 | if (dataset) { 11 | return dataset; 12 | } 13 | dataset = await (await fetch(`/static/dataset-${chip}.json`)).json(); 14 | return dataset; 15 | } 16 | 17 | //prettier-ignore 18 | const data_schema = [ 19 | { key: "opcode", title: "Opcode", detail: "Sample byte array" }, 20 | { key: "decLength", title: "Length", detail: "Full instruction length according to XED" }, 21 | { key: "decoding", title: "Decoding", detail: "Disassembly of the sample according to XED" }, 22 | { key: "valid", title: "Recognized", detail: "Expected to execute on the processor or not" }, 23 | { key: "iclass", title: "Class", detail: "Instruction class according to XED" }, 24 | { key: "category", title: "Category", detail: "Instruction category according to XED" }, 25 | { key: "extension", title: "Extension", detail: "Extension set according to XED" }, 26 | { key: "cpl", title: "CPL", detail: "Privilege level this instruction runs at according to XED" }, 27 | { key: "outOfOrder", title: "Div cycles", detail: "Cycles spent during out-of-order execution of the division." }, 28 | { key: "mits", title: "µOps (MITE)", detail: "# of µOps decoded by the micro-instruction translation engine" }, 29 | { key: "ms", title: "µOps (MS)", detail: "# of µOps decoded by the microcode sequencer" }, 30 | { key: "serializing", title: "Serializing", detail: "Enforces ordering of the pipeline, if not also a speculative fence, means only applicable to the memory accesses" }, 31 | { key: "speculationFence", title: "Speculation Fence", detail: "Halts speculative execution" }, 32 | ]; 33 | 34 | // Prefix list. 35 | // 36 | const prefixList = [ 37 | "2e", 38 | "36", 39 | "3e", 40 | "26", 41 | "64", 42 | "65", 43 | "66", 44 | "67", 45 | //"9b", 46 | "f0", 47 | "f2", 48 | "f3", 49 | ]; 50 | 51 | // %02x-like hex byte conversion. 52 | // 53 | function hexb(v) { 54 | return v <= 0xf ? "0" + v.toString(16) : v.toString(16); 55 | } 56 | 57 | // Build the opcode table. 58 | // 59 | const tbl = document.getElementById("opcode-table"); 60 | const opcodes = []; 61 | for (let n = 0; n <= 0xf; n++) { 62 | // Create the row entry. 63 | // 64 | const row = document.createElement("tr"); 65 | row.id = "row-" + n; 66 | row.classList = "op-tr"; 67 | 68 | // Create the actual items: 69 | // 70 | for (let i = 0; i <= 0xf; i++) { 71 | const opcode = i | (n << 4); 72 | const opcodeHex = hexb(opcode); 73 | 74 | // Create and push the element. 75 | // 76 | const item = document.createElement("td"); 77 | item.id = "op-" + opcodeHex; 78 | opcodes.push(item); 79 | row.appendChild(item); 80 | } 81 | tbl.appendChild(row); 82 | } 83 | 84 | function eventIntersects(event, elem) { 85 | if (!elem) return false; 86 | 87 | const rect = elem.getBoundingClientRect(); 88 | return ( 89 | event.clientX >= rect.left && 90 | event.clientX < rect.right && 91 | event.clientY >= rect.top && 92 | event.clientY < rect.bottom 93 | ); 94 | } 95 | 96 | let activePopover; 97 | function checkPopoverForClose(event) { 98 | if ( 99 | !event || 100 | (activePopover && 101 | !eventIntersects(event, activePopover) && 102 | !eventIntersects(event, activePopover.getElementsByClassName("Popover-message")[0])) 103 | ) { 104 | const popovers = document.getElementsByClassName("Popover"); 105 | for (let i = 0; i < popovers.length; i += 1) 106 | popovers[i].parentNode.removeChild(popovers[i]); 107 | } 108 | } 109 | 110 | async function visitTable(hexBase) { 111 | const { instructions } = await getDataset(); 112 | 113 | window.history.replaceState( 114 | null, 115 | "Haruspex - " + hexBase, 116 | `/chip/${chip}/grid/${hexBase}` 117 | ); 118 | 119 | const header = document.getElementById("crumbs"); 120 | if (hexBase.length) { 121 | header.innerHTML = ""; 122 | 123 | for (let i = 0; i < hexBase.length; i += 2) { 124 | header.insertAdjacentHTML( 125 | "beforeend", 126 | `` 127 | ); 128 | 129 | header.lastChild.onclick = () => { 130 | visitTable(hexBase.substr(0, i)); 131 | }; 132 | } 133 | } else { 134 | header.innerHTML = `/`; 135 | } 136 | 137 | // Iterate every opcode. 138 | // 139 | const optbl = Object.keys(instructions).filter((k) => k.startsWith(hexBase)); 140 | for (let i = 0; i <= 0xff; i++) { 141 | // Convert the full and partial opcode to hex. 142 | // 143 | const subHex = hexb(i); 144 | 145 | // Filter the table by the opcode. 146 | // 147 | const list = optbl.filter( 148 | (k) => k[hexBase.length] === subHex[0] && k[hexBase.length + 1] === subHex[1] 149 | ); 150 | const udList = list.filter((k) => !instructions[k].valid); 151 | 152 | // Reset the table entry. 153 | // 154 | const item = opcodes[i]; 155 | item.classList = "border op-td align-middle text-center"; 156 | while (item.firstChild) { 157 | item.removeChild(item.firstChild); 158 | } 159 | 160 | // Add the opcode text. 161 | // 162 | const div = document.createElement("div"); 163 | div.id = "op-text-" + subHex; 164 | div.classList = "op-text"; 165 | div.innerText = subHex; 166 | item.appendChild(div); 167 | 168 | // Add the counter / opcode. 169 | // 170 | if (list.length == 1) { 171 | let decoding = instructions[list[0]].decoding; 172 | const space = decoding.indexOf(" "); 173 | if (space != -1) { 174 | decoding = decoding.substr(0, space); 175 | } 176 | if (decoding.length > 8) { 177 | decoding = decoding.substr(0, 6) + ".."; 178 | } 179 | 180 | item.innerHTML += "
" + decoding.toUpperCase() + "
"; 181 | } else { 182 | item.innerHTML += "
" + list.length + "
"; 183 | } 184 | 185 | // Set the classes. 186 | // 187 | if (udList.length !== 0) { 188 | item.classList += " op-undocumented"; 189 | } 190 | 191 | if (list.length !== 0) { 192 | if (hexBase === "" && prefixList.includes(hexb(i))) { 193 | item.classList += " color-text-link"; 194 | } else { 195 | item.classList += 196 | list.length == 1 ? " color-text-primary" : " color-text-warning"; 197 | } 198 | 199 | item.classList += " op-button"; 200 | item.onclick = () => { 201 | checkPopoverForClose(); 202 | 203 | if (list.length > 1) { 204 | activePopover = null; 205 | visitTable(hexBase + subHex); 206 | } else { 207 | const instr = instructions[list[0]]; 208 | const items = data_schema 209 | .map( 210 | ({ key, title, desc }) => 211 | `
  • ${title} = ${instr[key]}
  • ` 212 | ) 213 | .join(""); 214 | 215 | item.insertAdjacentHTML( 216 | "beforeend", 217 | `
    218 |
    219 |

    220 | Instruction details 221 | 224 |

    225 |
      226 | ${items} 227 |
    228 | 229 |
    230 |
    ` 231 | ); 232 | 233 | activePopover = item; 234 | document.getElementById(instr.opcode).addEventListener("click", (event) => { 235 | checkPopoverForClose(); 236 | event.stopPropagation(); 237 | }); 238 | } 239 | }; 240 | } else { 241 | item.classList += " color-text-tertiary color-bg-tertiary"; 242 | item.onclick = () => {}; 243 | } 244 | } 245 | } 246 | 247 | document.addEventListener("click", (event) => { 248 | checkPopoverForClose(event); 249 | }); 250 | 251 | // Build the table with the original location. 252 | // 253 | visitTable(opcode); 254 | -------------------------------------------------------------------------------- /analysis/public/index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 9 | 13 | 14 | 15 | Haruspex 16 | 17 | 18 |
    19 |
    20 | 21 | 22 | 23 |
    24 |
    25 | Github 26 |
    27 |
    28 | 29 |
    30 |
    31 | Choose a chip below to browse the data. 32 |
    33 | 34 | 36 | 37 | 38 |
    39 | 40 | 41 | 42 | -------------------------------------------------------------------------------- /analysis/public/list.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 9 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | Haruspex 21 | 22 | 68 | 69 | 70 |
    71 |
    72 | 73 | 74 | 75 |
    76 |
    77 | Grid 78 |
    79 |
    80 | List 81 |
    82 |
    83 | Github 84 |
    85 |
    86 | 87 | 88 | 89 | 90 | 91 | -------------------------------------------------------------------------------- /analysis/public/listview.js: -------------------------------------------------------------------------------- 1 | // Find the chip we're browsing from the URL, adjust the nav-bar and define the dataset getter. 2 | // 3 | const { chip, opcode } = window.location.href.match( 4 | /.*\/chip\/(?.*?)\/list[\/]?(?.*)/m 5 | ).groups; 6 | document.getElementById("grid-link").href = `/chip/${chip}/grid`; 7 | document.getElementById("list-link").href = `/chip/${chip}/list`; 8 | let dataset = null; 9 | async function getDataset() { 10 | if (dataset) { 11 | return dataset; 12 | } 13 | dataset = await (await fetch(`/static/dataset-${chip}.json`)).json(); 14 | return dataset; 15 | } 16 | 17 | //prettier-ignore 18 | const header = [ 19 | { key: "opcode", title: "Opcode", detail: "Sample byte array" }, 20 | { key: "decLength", title: "Length", detail: "Full instruction length according to XED" }, 21 | { key: "decoding", title: "Decoding", detail: "Disassembly of the sample according to XED" }, 22 | { key: "valid", title: "Recognized", detail: "Expected to execute on the processor or not" }, 23 | { key: "iclass", title: "Class", detail: "Instruction class according to XED" }, 24 | { key: "category", title: "Category", detail: "Instruction category according to XED" }, 25 | { key: "extension", title: "Extension", detail: "Extension set according to XED" }, 26 | { key: "cpl", title: "CPL", detail: "Privilege level this instruction runs at according to XED" }, 27 | { key: "outOfOrder", title: "Div cycles", detail: "Cycles spent during out-of-order execution of the division." }, 28 | { key: "mits", title: "µOps (MITE)", detail: "# of µOps decoded by the micro-instruction translation engine" }, 29 | { key: "ms", title: "µOps (MS)", detail: "# of µOps decoded by the microcode sequencer" }, 30 | { key: "serializing", title: "Serializing", detail: "Enforces ordering of the pipeline, if not also a speculative fence, means only applicable to the memory accesses" }, 31 | { key: "speculationFence", title: "Speculation Fence", detail: "Halts speculative execution" }, 32 | ]; 33 | 34 | document.addEventListener("WebComponentsReady", async () => { 35 | const el = document.getElementsByTagName("perspective-viewer")[0]; 36 | const worker = perspective.worker(); 37 | 38 | const data = await getDataset(); 39 | const transformedData = []; 40 | for (const op of Object.keys(data.instructions)) { 41 | const instruction = data.instructions[op]; 42 | const transformed = {}; 43 | for (const { key, title } of header) { 44 | transformed[title] = instruction[key]; 45 | } 46 | transformedData.push(transformed); 47 | } 48 | 49 | const table = worker.table(transformedData, { index: "Opcode" }); 50 | await el.load(table); 51 | el.toggleConfig(); 52 | }); 53 | -------------------------------------------------------------------------------- /analysis/public/logo.svg: -------------------------------------------------------------------------------- 1 | 2 | 3 | 5 | 21 | 22 | 24 | 27 | 28 | 29 | 30 | 31 | 32 | 34 | 35 | 36 | 38 | 42 | 43 | 44 | 45 | 46 | 47 | 49 | 50 | 63 | 64 | 65 | 67 | 80 | 83 | 84 | 85 | 86 | 89 | 93 | 94 | 95 | 96 | 97 | 98 | 100 | 101 | 102 | 104 | 107 | 108 | 109 | 110 | 111 | 112 | 114 | 115 | 116 | 117 | 119 | 121 | 122 | 129 | 130 | 132 | 134 | 135 | 136 | 138 | 140 | 142 | 143 | 146 | 147 | 149 | 151 | 152 | 153 | 154 | 155 | 156 | 157 | 158 | 162 | 167 | 168 | 169 | 170 | 171 | 172 | -------------------------------------------------------------------------------- /analysis/public/stylesheet.css: -------------------------------------------------------------------------------- 1 | html { 2 | height: 100%; 3 | margin: 0px; 4 | } 5 | 6 | body { 7 | min-height: 100%; 8 | margin: 0px; 9 | } 10 | 11 | main { 12 | height: 100%; 13 | } 14 | 15 | .grid-main { 16 | max-width: 1024px; 17 | } 18 | 19 | td { 20 | width: 64px; 21 | height: 64px; 22 | padding: 0 !important; 23 | position: relative; 24 | } 25 | 26 | .op-undocumented { 27 | border-bottom-color: red !important; 28 | } 29 | 30 | .op-counter { 31 | color: var(--color-text-primary); 32 | font-size: x-small; 33 | } 34 | 35 | .op-entry { 36 | color: var(--color-text-primary); 37 | font-size: x-small; 38 | } 39 | 40 | .op-button:hover { 41 | cursor: pointer; 42 | } 43 | 44 | .Popover-message { 45 | cursor: initial; 46 | } 47 | -------------------------------------------------------------------------------- /kernel/decoder_test.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | This file is not complete due to some of the dependencies I had that I cannot share, 3 | but should serve as a pretty "accurate" pseudocode for the implementation. 4 | */ 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include "ia32.hpp" 11 | 12 | // Test pad implementation. 13 | // 14 | #define PADDING_OPCODE 0x90 15 | #define FAULTING_OPCODE 0xCE 16 | 17 | static uint8_t test_pad_temp[ 256 ] = {}; 18 | [[gnu::noinline, gnu::naked, no_split, code_alignment( 64 )]] static uint32_t test_pad() 19 | { 20 | __asm 21 | { 22 | // Save the low 32-bits of the counter. 23 | // 24 | mov r9d, eax 25 | 26 | // Enter the shadow of the call. 27 | // 28 | call x 29 | __emit PADDING_OPCODE // 15 byte padding for the instruction. 30 | __emit PADDING_OPCODE // 31 | __emit PADDING_OPCODE // 32 | __emit PADDING_OPCODE // 33 | __emit PADDING_OPCODE // 34 | __emit PADDING_OPCODE // 35 | __emit PADDING_OPCODE // 36 | __emit PADDING_OPCODE // 37 | __emit PADDING_OPCODE // 38 | __emit PADDING_OPCODE // 39 | __emit PADDING_OPCODE // 40 | __emit PADDING_OPCODE // 41 | __emit PADDING_OPCODE // 42 | __emit PADDING_OPCODE // 43 | __emit PADDING_OPCODE // 44 | 45 | __emit PADDING_OPCODE // 3 byte tail. 46 | __emit PADDING_OPCODE // 47 | __emit PADDING_OPCODE // 48 | 49 | __emit FAULTING_OPCODE // Terminator. 50 | x: 51 | 52 | // Waste some cycles. 53 | // 54 | vmovups ymm0, [ test_pad_temp ] 55 | vmovups ymm1, [ test_pad_temp ] 56 | vmovups ymm2, [ test_pad_temp ] 57 | vmovups ymm3, [ test_pad_temp ] 58 | 59 | vzeroupper 60 | addps xmm0, xmm1 61 | 62 | vaddps ymm0, ymm1, [ test_pad_temp ] 63 | vaddps ymm1, ymm2, [ test_pad_temp ] 64 | vaddps ymm2, ymm3, [ test_pad_temp ] 65 | vaddps ymm3, ymm0, [ test_pad_temp ] 66 | vsqrtpd ymm0, ymm0 67 | vsqrtpd ymm1, ymm1 68 | vsqrtpd ymm2, ymm2 69 | vsqrtpd ymm3, ymm3 70 | 71 | vaddps ymm0, ymm1, [ test_pad_temp ] 72 | vaddps ymm1, ymm2, [ test_pad_temp ] 73 | vaddps ymm2, ymm3, [ test_pad_temp ] 74 | vaddps ymm3, ymm0, [ test_pad_temp ] 75 | vsqrtpd ymm0, ymm0 76 | vsqrtpd ymm1, ymm1 77 | vsqrtpd ymm2, ymm2 78 | vsqrtpd ymm3, ymm3 79 | 80 | vaddps ymm0, ymm1, [ test_pad_temp ] 81 | vaddps ymm1, ymm2, [ test_pad_temp ] 82 | vaddps ymm2, ymm3, [ test_pad_temp ] 83 | vaddps ymm3, ymm0, [ test_pad_temp ] 84 | vsqrtpd ymm0, ymm0 85 | vsqrtpd ymm1, ymm1 86 | vsqrtpd ymm2, ymm2 87 | vsqrtpd ymm3, ymm3 88 | 89 | vaddps ymm0, ymm1, [ test_pad_temp ] 90 | vaddps ymm1, ymm2, [ test_pad_temp ] 91 | vaddps ymm2, ymm3, [ test_pad_temp ] 92 | vaddps ymm3, ymm0, [ test_pad_temp ] 93 | vsqrtpd ymm0, ymm0 94 | vsqrtpd ymm1, ymm1 95 | vsqrtpd ymm2, ymm2 96 | vsqrtpd ymm3, ymm3 97 | 98 | vaddps ymm0, ymm1, [ test_pad_temp ] 99 | vaddps ymm1, ymm2, [ test_pad_temp ] 100 | vaddps ymm2, ymm3, [ test_pad_temp ] 101 | vaddps ymm3, ymm0, [ test_pad_temp ] 102 | vsqrtpd ymm0, ymm0 103 | vsqrtpd ymm1, ymm1 104 | vsqrtpd ymm2, ymm2 105 | vsqrtpd ymm3, ymm3 106 | 107 | vaddps ymm0, ymm1, [ test_pad_temp ] 108 | vaddps ymm1, ymm2, [ test_pad_temp ] 109 | vaddps ymm2, ymm3, [ test_pad_temp ] 110 | vaddps ymm3, ymm0, [ test_pad_temp ] 111 | vsqrtpd ymm0, ymm0 112 | vsqrtpd ymm1, ymm1 113 | vsqrtpd ymm2, ymm2 114 | vsqrtpd ymm3, ymm3 115 | 116 | vaddps ymm0, ymm1, [ test_pad_temp ] 117 | vaddps ymm1, ymm2, [ test_pad_temp ] 118 | vaddps ymm2, ymm3, [ test_pad_temp ] 119 | vaddps ymm3, ymm0, [ test_pad_temp ] 120 | vsqrtpd ymm0, ymm0 121 | vsqrtpd ymm1, ymm1 122 | vsqrtpd ymm2, ymm2 123 | vsqrtpd ymm3, ymm3 124 | 125 | vaddps ymm0, ymm1, [ test_pad_temp ] 126 | vaddps ymm1, ymm2, [ test_pad_temp ] 127 | vaddps ymm2, ymm3, [ test_pad_temp ] 128 | vaddps ymm3, ymm0, [ test_pad_temp ] 129 | vsqrtpd ymm0, ymm0 130 | vsqrtpd ymm1, ymm1 131 | vsqrtpd ymm2, ymm2 132 | vsqrtpd ymm3, ymm3 133 | 134 | lea rax, [rip+z] 135 | xchg [rsp], rax 136 | ret 137 | z: 138 | 139 | // Serialize and read counter again; return the difference. 140 | // 141 | lfence 142 | rdpmc 143 | sub eax, r9d 144 | ret 145 | } 146 | } 147 | [[gnu::noinline, gnu::naked, no_split]] static uint32_t test_pad_trampoline( uint32_t, uint32_t, const void* dest ) 148 | { 149 | __asm 150 | { 151 | // Get ecx ready for the counter, serialize and read the counter. 152 | // 153 | xor ecx, ecx 154 | movaps xmm0, [r8] 155 | movaps [r8], xmm0 156 | sfence 157 | lfence 158 | rdpmc 159 | 160 | // Jump to the real handler. 161 | // 162 | jmp r8 163 | } 164 | } 165 | 166 | // Test pad details. 167 | // 168 | static constexpr size_t test_pad_padding_size = 15; 169 | static constexpr size_t test_pad_tail_size = 3; 170 | static const auto test_pad_location = [ ] () 171 | { 172 | auto r = ( uint8_t* ) &test_pad; 173 | constexpr auto not_pad = [ ] ( auto b ) { return b != PADDING_OPCODE; }; 174 | while ( std::find_if( r, r + test_pad_padding_size, not_pad ) != ( r + test_pad_padding_size ) ) 175 | r++; 176 | return r; 177 | }( ); 178 | 179 | // Runs the test given the instruction, the tail and the result set. 180 | // 181 | static void run_test( xstd::range instruction, 182 | xstd::range tail, 183 | xstd::range results, 184 | const ia32::perfmon::event_selector& evt ) 185 | { 186 | // Write the instruction and pad it with nops. 187 | // 188 | auto* it = test_pad_location; 189 | it = std::copy( instruction.begin(), instruction.end(), it ); 190 | std::fill( it, test_pad_location + test_pad_padding_size, PADDING_OPCODE ); 191 | 192 | // Write the trailing code. 193 | // 194 | it = test_pad_location + test_pad_padding_size; 195 | it = std::copy( tail.begin(), tail.end(), it ); 196 | *it = FAULTING_OPCODE; 197 | 198 | // Setup the processor state. 199 | // 200 | ia32::disable(); 201 | ia32::perfmon::dynamic_set_state( 202 | 0, 203 | evt, 204 | ia32::perfmon::ctr_enable | ia32::perfmon::ctr_supervisor, 205 | true 206 | ); 207 | 208 | // Run the experiment. 209 | // 210 | for ( uint32_t& res : results ) 211 | { 212 | // Flush the iCache for the testpad. 213 | // 214 | constexpr auto invalidate = [ ] ( xstd::any_ptr ip, size_t length ) 215 | { 216 | std::copy_n( ( volatile uint8_t* ) ip, length, ( volatile uint8_t* ) ip ); 217 | ia32::sfence(); 218 | for ( size_t n = 0; n < length; n += 64 ) 219 | ia32::clflush( ip + n ); 220 | }; 221 | invalidate( &test_pad, 512 ); 222 | invalidate( &test_pad_trampoline, 128 ); 223 | 224 | // Repeat until we execute the test with no SMIs delivered. 225 | // 226 | while ( true ) 227 | { 228 | // Reset the counter as a naive protection from overflow. 229 | // 230 | ia32::perfmon::dynamic_set_value( 0, 0 ); 231 | 232 | // Read the SMI counter. 233 | // 234 | auto smi_ctr = ia32::read_msr( IA32_MSR_SMI_COUNT ); 235 | 236 | // Run through the testpad. 237 | // 238 | uint32_t lres = test_pad_trampoline( 0, 0, &test_pad ); 239 | 240 | // If the SMI counter did not change, save the result and break. 241 | // 242 | if ( ia32::read_msr( IA32_MSR_SMI_COUNT ) == smi_ctr ) 243 | { 244 | res = lres; 245 | break; 246 | } 247 | } 248 | } 249 | 250 | // Revert the changes and return. 251 | // 252 | ia32::enable(); 253 | } 254 | 255 | // Test helpers. 256 | // 257 | inline uint32_t test_out_of_order( xstd::range op ) 258 | { 259 | uint32_t results[ 8 ]; 260 | run_test( op, std::initializer_list{ 0x0F, 0x5E, 0xE5 }, results, { .event_select = 0x14, .unit_mask = 1 } /*divisor cycles*/ ); 261 | return *xstd::max_element( results ); 262 | } 263 | static double test_decode( xstd::range op, uint8_t unit_mask ) 264 | { 265 | ia32::perfmon::event_selector evt = { .event_select = 0x79, .unit_mask = unit_mask }; /*decoder details*/ 266 | 267 | // If DSB, we're just testing for validity, don't waste too much time. 268 | // 269 | if ( path == decode_path::dsb ) 270 | { 271 | uint32_t results[ 1 ]; 272 | run_test( op, std::initializer_list{}, results, evt ); 273 | return results[ 0 ]; 274 | } 275 | 276 | uint32_t results[ 64 ]; 277 | run_test( op, std::initializer_list{}, results, evt ); 278 | return xstd::mode( xstd::sorted_clone( results ) ); 279 | } 280 | static std::array test_decode( xstd::range op ) 281 | { 282 | return { 283 | test_decode( op, 0x4 ), // MITE 284 | test_decode( op, 0x8 ), // DSB 285 | test_decode( op, 0x30 ) // MS 286 | }; 287 | } 288 | 289 | // Write the basic data collection logic. 290 | // 291 | struct result_entry 292 | { 293 | std::vector opcode = {}; 294 | uint32_t length = 0; 295 | 296 | std::array uops = { 0 }; 297 | uint32_t oo_cycles = 0; 298 | 299 | std::string decoding = {}; 300 | bool cpl0 = true; 301 | bool valid = false; 302 | bool compat_mode = false; 303 | std::string_view iclass = {}; 304 | std::string_view category = {}; 305 | std::string_view extension = {}; 306 | 307 | // Conversion to json. 308 | // 309 | std::string to_json() const 310 | { 311 | std::string res = {}; 312 | 313 | // Add the opcode. 314 | // 315 | res += "{ \"opcode\": ["; 316 | for ( size_t n = 0; n != opcode.size(); n++ ) 317 | { 318 | if ( ( n + 1 ) == opcode.size() ) 319 | res += std::to_string( opcode[ n ] ) + "],"; 320 | else 321 | res += std::to_string( opcode[ n ] ) + ","; 322 | } 323 | 324 | // Add the decoding. 325 | // 326 | res += "\"decoding\": \"" + decoding + "\","; 327 | 328 | // Add the results and decoding details, finish the entry. 329 | // 330 | res += "\"uops\": ["; 331 | for ( size_t n = 0; n != uops.size(); n++ ) 332 | { 333 | if ( ( n + 1 ) == uops.size() ) 334 | res += std::to_string( uops[ n ] ) + "],"; 335 | else 336 | res += std::to_string( uops[ n ] ) + ","; 337 | } 338 | 339 | res += "\"outOfOrder\": " + std::to_string( oo_cycles ) + ","; 340 | res += "\"compatMode\": " + ( compat_mode ? "true"s : "false"s ) + ","; 341 | res += "\"valid\": " + ( valid ? "true"s : "false"s ) + ","; 342 | res += "\"decLength\": " + std::to_string( length ) + ","; 343 | 344 | res += "\"iclass\": \""s + std::string{ iclass } + "\","; 345 | res += "\"category\": \""s + std::string{ category } + "\","; 346 | res += "\"extension\": \""s + std::string{ extension } + "\","; 347 | res += "\"cpl\": " + ( cpl0 ? "0"s : "3"s ) + " }"; 348 | return res; 349 | } 350 | }; 351 | 352 | [[entry_point, init_discardable]] uint64_t entry_point() 353 | { 354 | // Calculate and verify the basline. 355 | // 356 | auto baseline = test_decode( std::initializer_list{ 0x90 } ); 357 | auto baseline_ft = test_decode( std::initializer_list{ 0xCE } ); 358 | auto baseline_ft2 = test_decode( std::initializer_list{ 0x90, 0xCE } ); 359 | auto baseline_div = test_out_of_order( std::initializer_list{ 0xCE } ); 360 | uint64_t nop_uops = baseline_ft2[ 0 ] - baseline_ft[ 0 ]; 361 | 362 | xstd::log( "Baseline : %s\n", baseline ); 363 | xstd::log( "Faulting Baseline : %s\n", baseline_ft ); 364 | xstd::log( "Nop uOps : %llu\n", nop_uops ); 365 | xstd::log( "Div baseline : %llu\n", baseline_div ); 366 | 367 | if ( !nop_uops || // nop did not dispatch through MITE 368 | baseline_ft2[ 2 ] != baseline_ft[ 2 ] || // nop dispatched through MS 369 | baseline_ft[ 1 ] != 0 || // DBS dispatched instructions 370 | baseline[ 1 ] != 0 || // 371 | baseline_ft2[ 1 ] != 0 || // 372 | ( baseline[ 0 ] - baseline_ft[ 0 ] ) != ( 15 * nop_uops ) ) // nop count is unexpected 373 | { 374 | xstd::log( "Aborting, invalid.\n" ); 375 | return 0; 376 | } 377 | 378 | // Declare the logic for singular testing instructions, and then enter the test loop. 379 | // 380 | std::vector results; 381 | auto test_instruction = [ & ] ( std::initializer_list opc ) 382 | { 383 | result_entry result = { .opcode = { opc } }; 384 | 385 | // Pad the opcode. 386 | // 387 | std::array ins; 388 | std::copy_n( opc.begin(), opc.size(), ins.begin() ); 389 | std::fill_n( ins.begin() + opc.size(), ins.size() - opc.size(), PADDING_OPCODE ); 390 | 391 | // Try decoding. 392 | // 393 | auto dec = xed::decode64( ins ); 394 | if ( !dec ) 395 | { 396 | dec = xed::decode32( ins ); 397 | if ( dec ) 398 | result.compat_mode = true; 399 | } 400 | if ( dec ) 401 | { 402 | result.length = dec->length(); 403 | result.iclass = xed_iclass_enum_t2str( dec->get_class() ); 404 | result.extension = xed_extension_enum_t2str( xed_decoded_inst_get_extension( &*dec ) ); 405 | result.category = xed_category_enum_t2str( xed_decoded_inst_get_category( &*dec ) ); 406 | result.valid = xed_decoded_inst_valid_for_chip( &*dec, XED_CHIP_SKYLAKE ); 407 | result.cpl0 = xed_decoded_inst_get_attribute( &*dec, XED_ATTRIBUTE_RING0 ); 408 | result.decoding = dec->to_string(); 409 | result.opcode.resize( std::min( result.opcode.size(), dec->length() ) ); 410 | } 411 | 412 | // Try making the CPU decode, skip on failure. 413 | // 414 | result.uops = test_decode( opc ); 415 | if ( result.uops[ 0 ] <= baseline_ft[ 0 ] && result.uops[ 2 ] <= baseline_ft[ 2 ] ) 416 | return; 417 | 418 | // Do the out-of-order execution measurement and append to the list. 419 | // 420 | result.oo_cycles = std::max( test_out_of_order( opc ) - baseline_div, 0ll ); 421 | results.emplace_back( result ); 422 | }; 423 | 424 | static constexpr uint8_t full_prefix_list[] = { 425 | 0x2e, 0x36, 0x3e, 0x26, 426 | 0x40, 0x41, 0x42, 0x43, 427 | 0x44, 0x45, 0x46, 0x47, 428 | 0x48, 0x49, 0x4A, 0x4B, 429 | 0x4C, 0x4D, 0x4E, 0x4F, 430 | 0x64, 0x65, 0x66, 0x67, 431 | 0x9b, 0xf0, 0xf2, 0xf3, 432 | }; 433 | 434 | // Prefixes that in some cases change the instruction semantics. 435 | // 436 | for ( uint8_t pfx : { 0x0, 0x66, 0x9B, 0xF2, 0xF3 } ) 437 | { 438 | // 2-byte opcode prefix. 439 | // 440 | for ( uint8_t pfx2 : { 0x0, 0xF } ) 441 | { 442 | // Every possible opcode. 443 | // 444 | for ( size_t op = 0; op <= 0xFF; ++op ) 445 | { 446 | // Skip prefixes. 447 | // 448 | if ( xstd::contains( full_prefix_list, op ) ) 449 | continue; 450 | 451 | // Extension byte in case it is relevant. 452 | // 453 | for ( size_t mreg = 0; mreg <= 0xFF; ++mreg ) 454 | { 455 | uint8_t suf = uint8_t( 0x90 ^ mreg ); 456 | 457 | if ( pfx && pfx2 ) 458 | test_instruction( { pfx, pfx2, uint8_t( op ), suf } ); 459 | else if ( pfx ) 460 | test_instruction( { pfx, uint8_t( op ), suf } ); 461 | else if ( pfx2 ) 462 | test_instruction( { pfx2, uint8_t( op ), suf } ); 463 | else 464 | test_instruction( { uint8_t( op ), suf } ); 465 | } 466 | } 467 | } 468 | } 469 | xstd::log( "Experiment complete!\n" ); 470 | 471 | // Get the CPU brand. 472 | // 473 | std::array cpu_brand = { 0 }; 474 | std::copy_n( ia32::query_cpuid( 0x80000002 ).data(), 4, cpu_brand.data() ); 475 | std::copy_n( ia32::query_cpuid( 0x80000003 ).data(), 4, cpu_brand.data() + 4 ); 476 | std::copy_n( ia32::query_cpuid( 0x80000004 ).data(), 4, cpu_brand.data() + 8 ); 477 | 478 | // Dump the results into JSON format. 479 | // 480 | std::string json_result = xstd::fmt::str( 481 | "{ " 482 | "\"brand\": \"%s\", " 483 | "\"nopBaseline\": { \"mits\": %f, \"ms\": %f }, " 484 | "\"faultBaseline\": { \"mits\": %f, \"ms\": %f }, " 485 | "\"nopUops\": %llu," 486 | "\"data\": [", 487 | ( const char* ) cpu_brand.data(), 488 | baseline[ 0 ], baseline[ 2 ], 489 | baseline_ft[ 0 ], baseline_ft[ 2 ], 490 | nop_uops 491 | ); 492 | for ( auto& result : results ) 493 | json_result += result.to_json() + ","; 494 | json_result.pop_back(); 495 | json_result += "] }"; 496 | 497 | /* write the JSON? */ 498 | return 0; 499 | } -------------------------------------------------------------------------------- /raw-data/isa-6850k.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/can1357/haruspex/b36716436699d8c6d3f3e8f0a130298c641b7790/raw-data/isa-6850k.zip -------------------------------------------------------------------------------- /raw-data/isa-9750h.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/can1357/haruspex/b36716436699d8c6d3f3e8f0a130298c641b7790/raw-data/isa-9750h.zip -------------------------------------------------------------------------------- /raw-data/isa-9980xe.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/can1357/haruspex/b36716436699d8c6d3f3e8f0a130298c641b7790/raw-data/isa-9980xe.zip --------------------------------------------------------------------------------