Lines Matching +full:xml +full:- +full:name +full:- +full:validator

1 // Copyright (c) 2015-2022 The Khronos Group Inc.
9 //     http://www.apache.org/licenses/LICENSE-2.0
30 #include "spirv-tools/libspirv.h"
38 #include "core.insts-unified1.inc"
43 // Represents a vendor tool entry in the SPIR-V XML Registry.
63   if (where != std::end(vendor_tools)) return where->vendor_tool;  in spvGeneratorStr()
93                                       const char* name,  in spvOpcodeTableNameLookup()  argument
95   if (!name || !pEntry) return SPV_ERROR_INVALID_POINTER;  in spvOpcodeTableNameLookup()
99   // preferable but the table requires sorting on the Opcode name, but it's  in spvOpcodeTableNameLookup()
101   const size_t nameLength = strlen(name);  in spvOpcodeTableNameLookup()
103   for (uint64_t opcodeIndex = 0; opcodeIndex < table->count; ++opcodeIndex) {  in spvOpcodeTableNameLookup()
104     const spv_opcode_desc_t& entry = table->entries[opcodeIndex];  in spvOpcodeTableNameLookup()
111     // is indeed requested in the SPIR-V code; checking that should be  in spvOpcodeTableNameLookup()
112     // validator's work.  in spvOpcodeTableNameLookup()
115         nameLength == strlen(entry.name) &&  in spvOpcodeTableNameLookup()
116         !strncmp(name, entry.name, nameLength)) {  in spvOpcodeTableNameLookup()
133   const auto beg = table->entries;  in spvOpcodeTableValueLookup()
134   const auto end = table->entries + table->count;  in spvOpcodeTableValueLookup()
150        it != end && it->opcode == opcode; ++it) {  in spvOpcodeTableValueLookup()
157     // is indeed requested in the SPIR-V code; checking that should be  in spvOpcodeTableValueLookup()
158     // validator's work.  in spvOpcodeTableValueLookup()
159     if ((version >= it->minVersion && version <= it->lastVersion) ||  in spvOpcodeTableValueLookup()
160         it->numExtensions > 0u || it->numCapabilities > 0u) {  in spvOpcodeTableValueLookup()
172   pInst->opcode = opcode;  in spvInstructionCopy()
173   pInst->words.resize(wordCount);  in spvInstructionCopy()
175     pInst->words[wordIndex] = spvFixWord(words[wordIndex], endian);  in spvInstructionCopy()
179       spvOpcodeSplit(pInst->words[wordIndex], &thisWordCount, &thisOpcode);  in spvInstructionCopy()
199   if (it != end && it->opcode == spv::Op(opcode)) {  in spvOpcodeString()
200     return it->name;  in spvOpcodeString()