Kenneth Benzie (Benie) | 83e5a29 | 2015-05-22 18:26:19 +0100 | [diff] [blame] | 1 | // Copyright (c) 2015 The Khronos Group Inc. |
| 2 | // |
| 3 | // Permission is hereby granted, free of charge, to any person obtaining a |
| 4 | // copy of this software and/or associated documentation files (the |
| 5 | // "Materials"), to deal in the Materials without restriction, including |
| 6 | // without limitation the rights to use, copy, modify, merge, publish, |
| 7 | // distribute, sublicense, and/or sell copies of the Materials, and to |
| 8 | // permit persons to whom the Materials are furnished to do so, subject to |
| 9 | // the following conditions: |
| 10 | // |
| 11 | // The above copyright notice and this permission notice shall be included |
| 12 | // in all copies or substantial portions of the Materials. |
| 13 | // |
| 14 | // MODIFICATIONS TO THIS FILE MAY MEAN IT NO LONGER ACCURATELY REFLECTS |
| 15 | // KHRONOS STANDARDS. THE UNMODIFIED, NORMATIVE VERSIONS OF KHRONOS |
| 16 | // SPECIFICATIONS AND HEADER INFORMATION ARE LOCATED AT |
| 17 | // https://www.khronos.org/registry/ |
| 18 | // |
| 19 | // THE MATERIALS ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, |
| 20 | // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
| 21 | // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. |
| 22 | // IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY |
| 23 | // CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, |
| 24 | // TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE |
| 25 | // MATERIALS OR THE USE OR OTHER DEALINGS IN THE MATERIALS. |
| 26 | |
| 27 | #ifndef _LIBSPIRV_UTIL_BINARY_H_ |
| 28 | #define _LIBSPIRV_UTIL_BINARY_H_ |
| 29 | |
| 30 | #include <libspirv/libspirv.h> |
David Neto | 78c3b43 | 2015-08-27 13:03:52 -0400 | [diff] [blame] | 31 | #include "operand.h" |
Kenneth Benzie (Benie) | 83e5a29 | 2015-05-22 18:26:19 +0100 | [diff] [blame] | 32 | #include "print.h" |
| 33 | |
| 34 | // Functions |
| 35 | |
| 36 | /// @brief Fix the endianness of a word |
| 37 | /// |
| 38 | /// @param[in] word whos endianness should be fixed |
| 39 | /// @param[in] endian the desired endianness |
| 40 | /// |
| 41 | /// @return word with host endianness correction |
| 42 | uint32_t spvFixWord(const uint32_t word, const spv_endianness_t endian); |
| 43 | |
Lei Zhang | b41d150 | 2015-09-14 15:22:23 -0400 | [diff] [blame] | 44 | /// @brief Fix the endianness of a double word |
| 45 | /// |
| 46 | /// @param[in] low the lower 32-bit of the double word |
| 47 | /// @param[in] high the higher 32-bit of the double word |
| 48 | /// @param[in] endian the desired endianness |
| 49 | /// |
| 50 | /// @return word with host endianness correction |
| 51 | uint64_t spvFixDoubleWord(const uint32_t low, const uint32_t high, |
| 52 | const spv_endianness_t endian); |
| 53 | |
Kenneth Benzie (Benie) | 83e5a29 | 2015-05-22 18:26:19 +0100 | [diff] [blame] | 54 | /// @brief Determine the endianness of the SPV binary |
| 55 | /// |
| 56 | /// Gets the endianness of the SPV source. Returns SPV_ENDIANNESS_UNKNOWN if |
| 57 | /// the |
| 58 | /// SPV magic number is invalid, otherwise the determined endianness. |
| 59 | /// |
| 60 | /// @param[in] binary the binary module |
| 61 | /// @param[out] pEndian return the endianness of the SPV module |
| 62 | /// |
| 63 | /// @return result code |
| 64 | spv_result_t spvBinaryEndianness(const spv_binary binary, |
| 65 | spv_endianness_t *pEndian); |
| 66 | |
| 67 | /// @brief Grab the header from the SPV module |
| 68 | /// |
| 69 | /// @param[in] binary the binary module |
| 70 | /// @param[in] endian the endianness of the module |
| 71 | /// @param[out] pHeader the returned header |
| 72 | /// |
| 73 | /// @return result code |
| 74 | spv_result_t spvBinaryHeaderGet(const spv_binary binary, |
| 75 | const spv_endianness_t endian, |
| 76 | spv_header_t *pHeader); |
| 77 | |
| 78 | /// @brief Populate a binary stream with this generators header |
| 79 | /// |
| 80 | /// @param[in,out] binary the binary stream |
| 81 | /// @param[in] bound the upper ID bound |
| 82 | /// |
| 83 | /// @return result code |
| 84 | spv_result_t spvBinaryHeaderSet(spv_binary binary, const uint32_t bound); |
| 85 | |
Kenneth Benzie (Benie) | 83e5a29 | 2015-05-22 18:26:19 +0100 | [diff] [blame] | 86 | /// @brief Determine the type of the desired operand |
| 87 | /// |
| 88 | /// @param[in] word the operand value |
| 89 | /// @param[in] index the word index in the instruction |
| 90 | /// @param[in] opcodeEntry table of specified Opcodes |
| 91 | /// @param[in] operandTable table of specified operands |
| 92 | /// @param[in,out] pOperandEntry the entry in the operand table |
| 93 | /// |
| 94 | /// @return type returned |
| 95 | spv_operand_type_t spvBinaryOperandInfo(const uint32_t word, |
| 96 | const uint16_t index, |
| 97 | const spv_opcode_desc opcodeEntry, |
| 98 | const spv_operand_table operandTable, |
| 99 | spv_operand_desc *pOperandEntry); |
| 100 | |
| 101 | /// @brief Translate a binary operand to the textual form |
| 102 | /// |
| 103 | /// @param[in] opcode of the current instruction |
| 104 | /// @param[in] type type of the operand to decode |
| 105 | /// @param[in] words the binary stream of words |
| 106 | /// @param[in] endian the endianness of the stream |
| 107 | /// @param[in] options bitfield of spv_binary_to_text_options_t values |
| 108 | /// @param[in] operandTable table of specified operands |
David Neto | 78c3b43 | 2015-08-27 13:03:52 -0400 | [diff] [blame] | 109 | /// @param[in,out] pExpectedOperands the expected operand types |
Kenneth Benzie (Benie) | 83e5a29 | 2015-05-22 18:26:19 +0100 | [diff] [blame] | 110 | /// @param[in,out] pExtInstType type of extended instruction library |
| 111 | /// @param[in,out] stream the text output stream |
| 112 | /// @param[in,out] position position in the binary stream |
| 113 | /// @param[out] pDiag return diagnostic on error |
| 114 | /// |
| 115 | /// @return result code |
| 116 | spv_result_t spvBinaryDecodeOperand( |
| 117 | const Op opcode, const spv_operand_type_t type, const uint32_t *words, |
Lei Zhang | b41d150 | 2015-09-14 15:22:23 -0400 | [diff] [blame] | 118 | uint16_t numWords, const spv_endianness_t endian, const uint32_t options, |
Kenneth Benzie (Benie) | 83e5a29 | 2015-05-22 18:26:19 +0100 | [diff] [blame] | 119 | const spv_operand_table operandTable, const spv_ext_inst_table extInstTable, |
David Neto | 78c3b43 | 2015-08-27 13:03:52 -0400 | [diff] [blame] | 120 | spv_operand_pattern_t *pExpectedOperands, spv_ext_inst_type_t *pExtInstType, |
| 121 | out_stream &stream, spv_position position, spv_diagnostic *pDiagnostic); |
Kenneth Benzie (Benie) | 83e5a29 | 2015-05-22 18:26:19 +0100 | [diff] [blame] | 122 | |
| 123 | /// @brief Translate binary Opcode stream to textual form |
| 124 | /// |
| 125 | /// @param[in] pInst the Opcode instruction stream |
| 126 | /// @param[in] endian the endianness of the stream |
| 127 | /// @param[in] options bitfield of spv_binary_to_text_options_t values |
| 128 | /// @param[in] opcodeTable table of specified Opcodes |
| 129 | /// @param[in] operandTable table of specified operands |
Lei Zhang | 29e667e | 2015-09-11 11:01:59 -0400 | [diff] [blame] | 130 | /// @param[in] format the assembly syntax format to decode into |
Kenneth Benzie (Benie) | 83e5a29 | 2015-05-22 18:26:19 +0100 | [diff] [blame] | 131 | /// @param[out] stream output text stream |
| 132 | /// @param[in,out] position position in the stream |
| 133 | /// @param[out] pDiag return diagnostic on error |
| 134 | /// |
| 135 | /// @return result code |
| 136 | spv_result_t spvBinaryDecodeOpcode( |
| 137 | spv_instruction_t *pInst, const spv_endianness_t endian, |
| 138 | const uint32_t options, const spv_opcode_table opcodeTable, |
| 139 | const spv_operand_table operandTable, const spv_ext_inst_table extInstTable, |
Lei Zhang | 29e667e | 2015-09-11 11:01:59 -0400 | [diff] [blame] | 140 | spv_assembly_syntax_format_t format, out_stream &stream, |
| 141 | spv_position position, spv_diagnostic *pDiag); |
Kenneth Benzie (Benie) | 83e5a29 | 2015-05-22 18:26:19 +0100 | [diff] [blame] | 142 | |
| 143 | #endif |