1 // 2 // Copyright (C) 2015 LunarG, Inc. 3 // 4 // All rights reserved. 5 // 6 // Redistribution and use in source and binary forms, with or without 7 // modification, are permitted provided that the following conditions 8 // are met: 9 // 10 // Redistributions of source code must retain the above copyright 11 // notice, this list of conditions and the following disclaimer. 12 // 13 // Redistributions in binary form must reproduce the above 14 // copyright notice, this list of conditions and the following 15 // disclaimer in the documentation and/or other materials provided 16 // with the distribution. 17 // 18 // Neither the name of 3Dlabs Inc. Ltd. nor the names of its 19 // contributors may be used to endorse or promote products derived 20 // from this software without specific prior written permission. 21 // 22 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 23 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 24 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 25 // FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 26 // COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 27 // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 28 // BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 29 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 30 // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 32 // ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 33 // POSSIBILITY OF SUCH DAMAGE. 34 // 35 36 #ifndef SPIRVREMAPPER_H 37 #define SPIRVREMAPPER_H 38 39 #include <string> 40 #include <vector> 41 #include <cstdlib> 42 43 namespace spv { 44 45 // MSVC defines __cplusplus as an older value, even when it supports almost all of 11. 46 // We handle that here by making our own symbol. 47 #if __cplusplus >= 201103L || _MSC_VER >= 1700 48 # define use_cpp11 1 49 #endif 50 51 class spirvbin_base_t 52 { 53 public: 54 enum Options { 55 NONE = 0, 56 STRIP = (1<<0), 57 MAP_TYPES = (1<<1), 58 MAP_NAMES = (1<<2), 59 MAP_FUNCS = (1<<3), 60 DCE_FUNCS = (1<<4), 61 DCE_VARS = (1<<5), 62 DCE_TYPES = (1<<6), 63 OPT_LOADSTORE = (1<<7), 64 OPT_FWD_LS = (1<<8), // EXPERIMENTAL: PRODUCES INVALID SCHEMA-0 SPIRV 65 MAP_ALL = (MAP_TYPES | MAP_NAMES | MAP_FUNCS), 66 DCE_ALL = (DCE_FUNCS | DCE_VARS | DCE_TYPES), 67 OPT_ALL = (OPT_LOADSTORE), 68 69 ALL_BUT_STRIP = (MAP_ALL | DCE_ALL | OPT_ALL), 70 DO_EVERYTHING = (STRIP | ALL_BUT_STRIP) 71 }; 72 }; 73 74 } // namespace SPV 75 76 #if !defined (use_cpp11) 77 #include <cstdio> 78 #include <cstdint> 79 80 namespace spv { 81 class spirvbin_t : public spirvbin_base_t 82 { 83 public: 84 spirvbin_t(int /*verbose = 0*/) { } 85 86 void remap(std::vector<std::uint32_t>& /*spv*/, unsigned int /*opts = 0*/) 87 { 88 printf("Tool not compiled for C++11, which is required for SPIR-V remapping.\n"); 89 exit(5); 90 } 91 }; 92 93 } // namespace SPV 94 95 #else // defined (use_cpp11) 96 97 #include <functional> 98 #include <cstdint> 99 #include <unordered_map> 100 #include <unordered_set> 101 #include <map> 102 #include <set> 103 #include <cassert> 104 105 #include "spirv.hpp" 106 #include "spvIR.h" 107 108 namespace spv { 109 110 // class to hold SPIR-V binary data for remapping, DCE, and debug stripping 111 class spirvbin_t : public spirvbin_base_t 112 { 113 public: 114 spirvbin_t(int verbose = 0) : entryPoint(spv::NoResult), largestNewId(0), verbose(verbose) { } 115 virtual ~spirvbin_t() { } 116 117 // remap on an existing binary in memory 118 void remap(std::vector<std::uint32_t>& spv, std::uint32_t opts = DO_EVERYTHING); 119 120 // Type for error/log handler functions 121 typedef std::function<void(const std::string&)> errorfn_t; 122 typedef std::function<void(const std::string&)> logfn_t; 123 124 // Register error/log handling functions (can be lambda fn / functor / etc) 125 static void registerErrorHandler(errorfn_t handler) { errorHandler = handler; } 126 static void registerLogHandler(logfn_t handler) { logHandler = handler; } 127 128 protected: 129 // This can be overridden to provide other message behavior if needed 130 virtual void msg(int minVerbosity, int indent, const std::string& txt) const; 131 132 private: 133 // Local to global, or global to local ID map 134 typedef std::unordered_map<spv::Id, spv::Id> idmap_t; 135 typedef std::unordered_set<spv::Id> idset_t; 136 typedef std::unordered_map<spv::Id, int> blockmap_t; 137 138 void remap(std::uint32_t opts = DO_EVERYTHING); 139 140 // Map of names to IDs 141 typedef std::unordered_map<std::string, spv::Id> namemap_t; 142 143 typedef std::uint32_t spirword_t; 144 145 typedef std::pair<unsigned, unsigned> range_t; 146 typedef std::function<void(spv::Id&)> idfn_t; 147 typedef std::function<bool(spv::Op, unsigned start)> instfn_t; 148 149 // Special Values for ID map: 150 static const spv::Id unmapped; // unchanged from default value 151 static const spv::Id unused; // unused ID 152 static const int header_size; // SPIR header = 5 words 153 154 class id_iterator_t; 155 156 // For mapping type entries between different shaders 157 typedef std::vector<spirword_t> typeentry_t; 158 typedef std::map<spv::Id, typeentry_t> globaltypes_t; 159 160 // A set that preserves position order, and a reverse map 161 typedef std::set<int> posmap_t; 162 typedef std::unordered_map<spv::Id, int> posmap_rev_t; 163 164 // Maps and ID to the size of its base type, if known. 165 typedef std::unordered_map<spv::Id, unsigned> typesize_map_t; 166 167 // handle error 168 void error(const std::string& txt) const { errorHandler(txt); } 169 170 bool isConstOp(spv::Op opCode) const; 171 bool isTypeOp(spv::Op opCode) const; 172 bool isStripOp(spv::Op opCode) const; 173 bool isFlowCtrl(spv::Op opCode) const; 174 range_t literalRange(spv::Op opCode) const; 175 range_t typeRange(spv::Op opCode) const; 176 range_t constRange(spv::Op opCode) const; 177 unsigned typeSizeInWords(spv::Id id) const; 178 unsigned idTypeSizeInWords(spv::Id id) const; 179 180 spv::Id& asId(unsigned word) { return spv[word]; } 181 const spv::Id& asId(unsigned word) const { return spv[word]; } 182 spv::Op asOpCode(unsigned word) const { return opOpCode(spv[word]); } 183 std::uint32_t asOpCodeHash(unsigned word); 184 spv::Decoration asDecoration(unsigned word) const { return spv::Decoration(spv[word]); } 185 unsigned asWordCount(unsigned word) const { return opWordCount(spv[word]); } 186 spv::Id asTypeConstId(unsigned word) const { return asId(word + (isTypeOp(asOpCode(word)) ? 1 : 2)); } 187 unsigned idPos(spv::Id id) const; 188 189 static unsigned opWordCount(spirword_t data) { return data >> spv::WordCountShift; } 190 static spv::Op opOpCode(spirword_t data) { return spv::Op(data & spv::OpCodeMask); } 191 192 // Header access & set methods 193 spirword_t magic() const { return spv[0]; } // return magic number 194 spirword_t bound() const { return spv[3]; } // return Id bound from header 195 spirword_t bound(spirword_t b) { return spv[3] = b; }; 196 spirword_t genmagic() const { return spv[2]; } // generator magic 197 spirword_t genmagic(spirword_t m) { return spv[2] = m; } 198 spirword_t schemaNum() const { return spv[4]; } // schema number from header 199 200 // Mapping fns: get 201 spv::Id localId(spv::Id id) const { return idMapL[id]; } 202 203 // Mapping fns: set 204 inline spv::Id localId(spv::Id id, spv::Id newId); 205 void countIds(spv::Id id); 206 207 // Return next unused new local ID. 208 // NOTE: boost::dynamic_bitset would be more efficient due to find_next(), 209 // which std::vector<bool> doens't have. 210 inline spv::Id nextUnusedId(spv::Id id); 211 212 void buildLocalMaps(); 213 std::string literalString(unsigned word) const; // Return literal as a std::string 214 int literalStringWords(const std::string& str) const { return (int(str.size())+4)/4; } 215 216 bool isNewIdMapped(spv::Id newId) const { return isMapped(newId); } 217 bool isOldIdUnmapped(spv::Id oldId) const { return localId(oldId) == unmapped; } 218 bool isOldIdUnused(spv::Id oldId) const { return localId(oldId) == unused; } 219 bool isOldIdMapped(spv::Id oldId) const { return !isOldIdUnused(oldId) && !isOldIdUnmapped(oldId); } 220 bool isFunction(spv::Id oldId) const { return fnPos.find(oldId) != fnPos.end(); } 221 222 // bool matchType(const globaltypes_t& globalTypes, spv::Id lt, spv::Id gt) const; 223 // spv::Id findType(const globaltypes_t& globalTypes, spv::Id lt) const; 224 std::uint32_t hashType(unsigned typeStart) const; 225 226 spirvbin_t& process(instfn_t, idfn_t, unsigned begin = 0, unsigned end = 0); 227 int processInstruction(unsigned word, instfn_t, idfn_t); 228 229 void validate() const; 230 void mapTypeConst(); 231 void mapFnBodies(); 232 void optLoadStore(); 233 void dceFuncs(); 234 void dceVars(); 235 void dceTypes(); 236 void mapNames(); 237 void foldIds(); // fold IDs to smallest space 238 void forwardLoadStores(); // load store forwarding (EXPERIMENTAL) 239 void offsetIds(); // create relative offset IDs 240 241 void applyMap(); // remap per local name map 242 void mapRemainder(); // map any IDs we haven't touched yet 243 void stripDebug(); // strip all debug info 244 void stripDeadRefs(); // strips debug info for now-dead references after DCE 245 void strip(); // remove debug symbols 246 247 std::vector<spirword_t> spv; // SPIR words 248 249 namemap_t nameMap; // ID names from OpName 250 251 // Since we want to also do binary ops, we can't use std::vector<bool>. we could use 252 // boost::dynamic_bitset, but we're trying to avoid a boost dependency. 253 typedef std::uint64_t bits_t; 254 std::vector<bits_t> mapped; // which new IDs have been mapped 255 static const int mBits = sizeof(bits_t) * 4; 256 257 bool isMapped(spv::Id id) const { return id < maxMappedId() && ((mapped[id/mBits] & (1LL<<(id%mBits))) != 0); } 258 void setMapped(spv::Id id) { resizeMapped(id); mapped[id/mBits] |= (1LL<<(id%mBits)); } 259 void resizeMapped(spv::Id id) { if (id >= maxMappedId()) mapped.resize(id/mBits+1, 0); } 260 size_t maxMappedId() const { return mapped.size() * mBits; } 261 262 // Add a strip range for a given instruction starting at 'start' 263 // Note: avoiding brace initializers to please older versions os MSVC. 264 void stripInst(unsigned start) { stripRange.push_back(range_t(start, start + asWordCount(start))); } 265 266 // Function start and end. use unordered_map because we'll have 267 // many fewer functions than IDs. 268 std::unordered_map<spv::Id, range_t> fnPos; 269 270 // Which functions are called, anywhere in the module, with a call count 271 std::unordered_map<spv::Id, int> fnCalls; 272 273 posmap_t typeConstPos; // word positions that define types & consts (ordered) 274 posmap_rev_t idPosR; // reverse map from IDs to positions 275 typesize_map_t idTypeSizeMap; // maps each ID to its type size, if known. 276 277 std::vector<spv::Id> idMapL; // ID {M}ap from {L}ocal to {G}lobal IDs 278 279 spv::Id entryPoint; // module entry point 280 spv::Id largestNewId; // biggest new ID we have mapped anything to 281 282 // Sections of the binary to strip, given as [begin,end) 283 std::vector<range_t> stripRange; 284 285 // processing options: 286 std::uint32_t options; 287 int verbose; // verbosity level 288 289 static errorfn_t errorHandler; 290 static logfn_t logHandler; 291 }; 292 293 } // namespace SPV 294 295 #endif // defined (use_cpp11) 296 #endif // SPIRVREMAPPER_H 297
