ShaderProgramParser.cpp 25 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090
  1. // Copyright (C) 2009-2022, Panagiotis Christopoulos Charitos and contributors.
  2. // All rights reserved.
  3. // Code licensed under the BSD License.
  4. // http://www.anki3d.org/LICENSE
  5. #include <AnKi/ShaderCompiler/ShaderProgramParser.h>
  6. namespace anki {
  7. #define ANKI_PP_ERROR_MALFORMED() \
  8. ANKI_SHADER_COMPILER_LOGE("%s: Malformed expression: %s", fname.cstr(), line.cstr()); \
  9. return Error::kUserData
  10. #define ANKI_PP_ERROR_MALFORMED_MSG(msg_) \
  11. ANKI_SHADER_COMPILER_LOGE("%s: " msg_ ": %s", fname.cstr(), line.cstr()); \
  12. return Error::kUserData
  13. inline constexpr Array<CString, U32(ShaderType::kCount)> kShaderStageNames = {
  14. {"VERTEX", "TESSELLATION_CONTROL", "TESSELLATION_EVALUATION", "GEOMETRY", "FRAGMENT", "COMPUTE", "RAY_GEN",
  15. "ANY_HIT", "CLOSEST_HIT", "MISS", "INTERSECTION", "CALLABLE"}};
  16. inline constexpr char kShaderHeader[] = R"(#define ANKI_%s_SHADER 1
  17. #define ANKI_PLATFORM_MOBILE %d
  18. #define ANKI_FORCE_FULL_FP_PRECISION %d
  19. #define kMaxBindlessTextures %uu
  20. #define kMaxBindlessReadonlyTextureBuffers %uu
  21. )";
  22. static const U64 kShaderHeaderHash = computeHash(kShaderHeader, sizeof(kShaderHeader));
  23. ShaderProgramParser::ShaderProgramParser(CString fname, ShaderProgramFilesystemInterface* fsystem, BaseMemoryPool* pool,
  24. const ShaderCompilerOptions& compilerOptions)
  25. : m_pool(pool)
  26. , m_fname(pool, fname)
  27. , m_fsystem(fsystem)
  28. , m_compilerOptions(compilerOptions)
  29. {
  30. }
  31. ShaderProgramParser::~ShaderProgramParser()
  32. {
  33. }
  34. void ShaderProgramParser::tokenizeLine(CString line, DynamicArrayRaii<StringRaii>& tokens) const
  35. {
  36. ANKI_ASSERT(line.getLength() > 0);
  37. StringRaii l(m_pool, line);
  38. // Replace all tabs with spaces
  39. for(char& c : l)
  40. {
  41. if(c == '\t')
  42. {
  43. c = ' ';
  44. }
  45. }
  46. // Split
  47. StringListRaii spaceTokens(m_pool);
  48. spaceTokens.splitString(l, ' ', false);
  49. // Create the array
  50. for(const String& s : spaceTokens)
  51. {
  52. tokens.emplaceBack(m_pool, s);
  53. }
  54. }
  55. Error ShaderProgramParser::parsePragmaStart(const StringRaii* begin, const StringRaii* end, CString line, CString fname)
  56. {
  57. ANKI_ASSERT(begin && end);
  58. if(begin >= end)
  59. {
  60. ANKI_PP_ERROR_MALFORMED();
  61. }
  62. ShaderType shaderType = ShaderType::kCount;
  63. if(*begin == "vert")
  64. {
  65. shaderType = ShaderType::kVertex;
  66. }
  67. else if(*begin == "tessc")
  68. {
  69. shaderType = ShaderType::kTessellationControl;
  70. }
  71. else if(*begin == "tesse")
  72. {
  73. }
  74. else if(*begin == "geom")
  75. {
  76. shaderType = ShaderType::kGeometry;
  77. }
  78. else if(*begin == "frag")
  79. {
  80. shaderType = ShaderType::kFragment;
  81. }
  82. else if(*begin == "comp")
  83. {
  84. shaderType = ShaderType::kCompute;
  85. }
  86. else if(*begin == "rgen")
  87. {
  88. shaderType = ShaderType::kRayGen;
  89. }
  90. else if(*begin == "ahit")
  91. {
  92. shaderType = ShaderType::kAnyHit;
  93. }
  94. else if(*begin == "chit")
  95. {
  96. shaderType = ShaderType::kClosestHit;
  97. }
  98. else if(*begin == "miss")
  99. {
  100. shaderType = ShaderType::kMiss;
  101. }
  102. else if(*begin == "int")
  103. {
  104. shaderType = ShaderType::kIntersection;
  105. }
  106. else if(*begin == "call")
  107. {
  108. shaderType = ShaderType::kCallable;
  109. }
  110. else
  111. {
  112. ANKI_PP_ERROR_MALFORMED();
  113. }
  114. m_codeLines.pushBackSprintf("#ifdef ANKI_%s_SHADER", kShaderStageNames[shaderType].cstr());
  115. ++begin;
  116. if(begin != end)
  117. {
  118. // Should be the last token
  119. ANKI_PP_ERROR_MALFORMED();
  120. }
  121. // Set the mask
  122. const ShaderTypeBit mask = ShaderTypeBit(1 << shaderType);
  123. if(!!(mask & m_shaderTypes))
  124. {
  125. ANKI_PP_ERROR_MALFORMED_MSG("Can't have #pragma start <shader> appearing more than once");
  126. }
  127. m_shaderTypes |= mask;
  128. // Check bounds
  129. if(m_insideShader)
  130. {
  131. ANKI_PP_ERROR_MALFORMED_MSG("Can't have #pragma start before you close the previous pragma start");
  132. }
  133. m_insideShader = true;
  134. return Error::kNone;
  135. }
  136. Error ShaderProgramParser::parsePragmaEnd(const StringRaii* begin, const StringRaii* end, CString line, CString fname)
  137. {
  138. ANKI_ASSERT(begin && end);
  139. // Check tokens
  140. if(begin != end)
  141. {
  142. ANKI_PP_ERROR_MALFORMED();
  143. }
  144. // Check bounds
  145. if(!m_insideShader)
  146. {
  147. ANKI_PP_ERROR_MALFORMED_MSG("Can't have #pragma end before you open with a pragma start");
  148. }
  149. m_insideShader = false;
  150. // Write code
  151. m_codeLines.pushBack("#endif // Shader guard");
  152. return Error::kNone;
  153. }
  154. Error ShaderProgramParser::parsePragmaMutator(const StringRaii* begin, const StringRaii* end, CString line,
  155. CString fname)
  156. {
  157. ANKI_ASSERT(begin && end);
  158. if(begin >= end)
  159. {
  160. ANKI_PP_ERROR_MALFORMED();
  161. }
  162. m_mutators.emplaceBack(m_pool);
  163. Mutator& mutator = m_mutators.getBack();
  164. // Name
  165. {
  166. if(begin >= end)
  167. {
  168. // Need to have a name
  169. ANKI_PP_ERROR_MALFORMED();
  170. }
  171. // Check for duplicate mutators
  172. for(U32 i = 0; i < m_mutators.getSize() - 1; ++i)
  173. {
  174. if(m_mutators[i].m_name == *begin)
  175. {
  176. ANKI_PP_ERROR_MALFORMED_MSG("Duplicate mutator");
  177. }
  178. }
  179. if(begin->getLength() > kMaxShaderBinaryNameLength)
  180. {
  181. ANKI_PP_ERROR_MALFORMED_MSG("Too big name");
  182. }
  183. mutator.m_name.create(begin->toCString());
  184. ++begin;
  185. }
  186. // Values
  187. {
  188. // Gather them
  189. for(; begin < end; ++begin)
  190. {
  191. MutatorValue value = 0;
  192. if(tokenIsComment(begin->toCString()))
  193. {
  194. break;
  195. }
  196. if(begin->toNumber(value))
  197. {
  198. ANKI_PP_ERROR_MALFORMED();
  199. }
  200. mutator.m_values.emplaceBack(value);
  201. }
  202. std::sort(mutator.m_values.getBegin(), mutator.m_values.getEnd());
  203. // Check for duplicates
  204. for(U32 i = 1; i < mutator.m_values.getSize(); ++i)
  205. {
  206. if(mutator.m_values[i - 1] == mutator.m_values[i])
  207. {
  208. ANKI_PP_ERROR_MALFORMED_MSG("Same value appeared more than once");
  209. }
  210. }
  211. }
  212. return Error::kNone;
  213. }
  214. Error ShaderProgramParser::parsePragmaLibraryName(const StringRaii* begin, const StringRaii* end, CString line,
  215. CString fname)
  216. {
  217. ANKI_ASSERT(begin && end);
  218. if(begin >= end)
  219. {
  220. ANKI_PP_ERROR_MALFORMED();
  221. }
  222. if(m_libName.getLength() > 0)
  223. {
  224. ANKI_PP_ERROR_MALFORMED_MSG("Library name already set");
  225. }
  226. m_libName = *begin;
  227. return Error::kNone;
  228. }
  229. Error ShaderProgramParser::parsePragmaRayType(const StringRaii* begin, const StringRaii* end, CString line,
  230. CString fname)
  231. {
  232. ANKI_ASSERT(begin && end);
  233. if(begin >= end)
  234. {
  235. ANKI_PP_ERROR_MALFORMED();
  236. }
  237. if(m_rayType != kMaxU32)
  238. {
  239. ANKI_PP_ERROR_MALFORMED_MSG("Ray type already set");
  240. }
  241. ANKI_CHECK(begin->toNumber(m_rayType));
  242. if(m_rayType > 128)
  243. {
  244. ANKI_PP_ERROR_MALFORMED_MSG("Ray type has a very large value");
  245. }
  246. return Error::kNone;
  247. }
  248. Error ShaderProgramParser::parsePragmaReflect(const StringRaii* begin, const StringRaii* end, CString line,
  249. CString fname)
  250. {
  251. ANKI_ASSERT(begin && end);
  252. if(begin >= end)
  253. {
  254. ANKI_PP_ERROR_MALFORMED();
  255. }
  256. m_symbolsToReflect.pushBack(*begin);
  257. return Error::kNone;
  258. }
  259. Error ShaderProgramParser::parsePragmaSkipMutation(const StringRaii* begin, const StringRaii* end, CString line,
  260. CString fname)
  261. {
  262. ANKI_ASSERT(begin && end);
  263. // Some basic sanity checks
  264. const U tokenCount = U(end - begin);
  265. // One pair doesn't make sence so it's: mutator_name_0 + mutator_value_0 + mutator_name_1 + mutator_value_1
  266. constexpr U minTokenCount = 2 + 2;
  267. if(tokenCount < minTokenCount || (tokenCount % 2) != 0)
  268. {
  269. ANKI_PP_ERROR_MALFORMED();
  270. }
  271. PartialMutationSkip& skip = *m_skipMutations.emplaceBack(m_pool);
  272. skip.m_partialMutation.create(m_mutators.getSize(), std::numeric_limits<MutatorValue>::max());
  273. do
  274. {
  275. // Get mutator name
  276. const CString mutatorName = *begin;
  277. U32 mutatorIndex = kMaxU32;
  278. for(U32 i = 0; i < m_mutators.getSize(); ++i)
  279. {
  280. if(m_mutators[i].m_name == mutatorName)
  281. {
  282. mutatorIndex = i;
  283. break;
  284. }
  285. }
  286. if(mutatorIndex == kMaxU32)
  287. {
  288. ANKI_PP_ERROR_MALFORMED_MSG("Mutator not found");
  289. }
  290. // Get mutator value
  291. ++begin;
  292. const CString valueStr = *begin;
  293. MutatorValue value;
  294. if(valueStr.toNumber(value))
  295. {
  296. ANKI_PP_ERROR_MALFORMED_MSG("Malformed mutator value");
  297. }
  298. if(!mutatorHasValue(m_mutators[mutatorIndex], value))
  299. {
  300. ANKI_PP_ERROR_MALFORMED_MSG("Mutator value incorrect");
  301. }
  302. skip.m_partialMutation[mutatorIndex] = value;
  303. ++begin;
  304. } while(begin < end && !tokenIsComment(*begin));
  305. return Error::kNone;
  306. }
  307. Error ShaderProgramParser::parseInclude(const StringRaii* begin, const StringRaii* end, CString line, CString fname,
  308. U32 depth)
  309. {
  310. // Gather the path
  311. StringRaii path(m_pool);
  312. for(; begin < end; ++begin)
  313. {
  314. path.append(*begin);
  315. }
  316. if(path.isEmpty())
  317. {
  318. ANKI_PP_ERROR_MALFORMED();
  319. }
  320. // Check
  321. const char firstChar = path[0];
  322. const char lastChar = path[path.getLength() - 1];
  323. if((firstChar == '\"' && lastChar == '\"') || (firstChar == '<' && lastChar == '>'))
  324. {
  325. StringRaii fname2(m_pool);
  326. fname2.create(path.begin() + 1, path.begin() + path.getLength() - 1);
  327. const Bool dontIgnore =
  328. fname2.find("AnKi/Shaders/") != String::kNpos || fname2.find("ThirdParty/") != String::kNpos;
  329. if(!dontIgnore)
  330. {
  331. // The shaders can't include C++ files. Ignore the include
  332. return Error::kNone;
  333. }
  334. if(parseFile(fname2, depth + 1))
  335. {
  336. ANKI_PP_ERROR_MALFORMED_MSG("Error parsing include. See previous errors");
  337. }
  338. }
  339. else
  340. {
  341. ANKI_PP_ERROR_MALFORMED();
  342. }
  343. return Error::kNone;
  344. }
  345. Error ShaderProgramParser::parseLine(CString line, CString fname, Bool& foundPragmaOnce, U32 depth, U32 lineNumber)
  346. {
  347. // Tokenize
  348. DynamicArrayRaii<StringRaii> tokens(m_pool);
  349. tokenizeLine(line, tokens);
  350. ANKI_ASSERT(tokens.getSize() > 0);
  351. const StringRaii* token = tokens.getBegin();
  352. const StringRaii* end = tokens.getEnd();
  353. // Skip the hash
  354. Bool foundAloneHash = false;
  355. if(*token == "#")
  356. {
  357. ++token;
  358. foundAloneHash = true;
  359. }
  360. if((token < end) && ((foundAloneHash && *token == "include") || *token == "#include"))
  361. {
  362. // We _must_ have an #include
  363. ANKI_CHECK(parseInclude(token + 1, end, line, fname, depth));
  364. m_codeLines.pushBackSprintf("#line %u \"%s\"", lineNumber + 2, fname.cstr());
  365. }
  366. else if((token < end) && ((foundAloneHash && *token == "pragma") || *token == "#pragma"))
  367. {
  368. // We may have a #pragma once or a #pragma anki or something else
  369. ++token;
  370. if(*token == "once")
  371. {
  372. // Pragma once
  373. if(foundPragmaOnce)
  374. {
  375. ANKI_PP_ERROR_MALFORMED_MSG("Can't have more than one #pragma once per file");
  376. }
  377. if(token + 1 != end)
  378. {
  379. ANKI_PP_ERROR_MALFORMED();
  380. }
  381. // Add the guard unique for this file
  382. foundPragmaOnce = true;
  383. const U64 hash = fname.computeHash();
  384. m_codeLines.pushBackSprintf("#ifndef _ANKI_INCL_GUARD_%" PRIu64 "\n"
  385. "#define _ANKI_INCL_GUARD_%" PRIu64,
  386. hash, hash);
  387. }
  388. else if(*token == "anki")
  389. {
  390. // Must be a #pragma anki
  391. ++token;
  392. if(*token == "mutator")
  393. {
  394. ANKI_CHECK(checkNoActiveStruct());
  395. ANKI_CHECK(parsePragmaMutator(token + 1, end, line, fname));
  396. }
  397. else if(*token == "start")
  398. {
  399. ANKI_CHECK(checkNoActiveStruct());
  400. ANKI_CHECK(parsePragmaStart(token + 1, end, line, fname));
  401. }
  402. else if(*token == "end")
  403. {
  404. ANKI_CHECK(checkNoActiveStruct());
  405. ANKI_CHECK(parsePragmaEnd(token + 1, end, line, fname));
  406. }
  407. else if(*token == "skip_mutation")
  408. {
  409. ANKI_CHECK(checkNoActiveStruct());
  410. ANKI_CHECK(parsePragmaSkipMutation(token + 1, end, line, fname));
  411. }
  412. else if(*token == "library")
  413. {
  414. ANKI_CHECK(checkNoActiveStruct());
  415. ANKI_CHECK(parsePragmaLibraryName(token + 1, end, line, fname));
  416. }
  417. else if(*token == "ray_type")
  418. {
  419. ANKI_CHECK(checkNoActiveStruct());
  420. ANKI_CHECK(parsePragmaRayType(token + 1, end, line, fname));
  421. }
  422. else if(*token == "reflect")
  423. {
  424. ANKI_CHECK(checkNoActiveStruct());
  425. ANKI_CHECK(parsePragmaReflect(token + 1, end, line, fname));
  426. }
  427. else if(*token == "struct")
  428. {
  429. if(*(token + 1) == "end")
  430. {
  431. ANKI_CHECK(checkActiveStruct());
  432. ANKI_CHECK(parsePragmaStructEnd(token + 1, end, line, fname));
  433. m_codeLines.pushBackSprintf("#line %u \"%s\"", lineNumber, fname.cstr());
  434. }
  435. else
  436. {
  437. ANKI_CHECK(checkNoActiveStruct());
  438. ANKI_CHECK(parsePragmaStructBegin(token + 1, end, line, fname));
  439. }
  440. }
  441. else if(*token == "member")
  442. {
  443. ANKI_CHECK(checkActiveStruct());
  444. ANKI_CHECK(parsePragmaMember(token + 1, end, line, fname));
  445. }
  446. else if(*token == "hlsl")
  447. {
  448. ANKI_CHECK(parsePragmaHlsl(token + 1, end, line, fname));
  449. }
  450. else
  451. {
  452. ANKI_PP_ERROR_MALFORMED();
  453. }
  454. // Add the line as a comment because of hashing of the source
  455. m_codeLines.pushBackSprintf("//%s", line.cstr());
  456. }
  457. else
  458. {
  459. // Some other pragma, ignore
  460. m_codeLines.pushBack(line);
  461. }
  462. }
  463. else
  464. {
  465. // Ignore
  466. m_codeLines.pushBack(line);
  467. }
  468. return Error::kNone;
  469. }
  470. Error ShaderProgramParser::parsePragmaStructBegin(const StringRaii* begin, const StringRaii* end, CString line,
  471. CString fname)
  472. {
  473. const U tokenCount = U(end - begin);
  474. if(tokenCount != 1)
  475. {
  476. ANKI_PP_ERROR_MALFORMED();
  477. }
  478. GhostStruct& gstruct = *m_ghostStructs.emplaceBack(m_pool);
  479. gstruct.m_name.create(*begin);
  480. // Add a '_' to the struct name.
  481. //
  482. // Scenario:
  483. // - The shader may have a "pragma reflect" of the struct
  484. // - The SPIRV also contains the struct
  485. //
  486. // What happens:
  487. // - The struct is in SPIRV and it will be reflected
  488. // - The struct is also in ghost structs and it will be reflected
  489. //
  490. // This is undesirable because it will complicates reflection. So eliminate the struct from SPIRV by renaming it
  491. m_codeLines.pushBackSprintf("struct %s_ {", begin->cstr());
  492. ANKI_ASSERT(!m_insideStruct);
  493. m_insideStruct = true;
  494. return Error::kNone;
  495. }
  496. Error ShaderProgramParser::parsePragmaMember(const StringRaii* begin, const StringRaii* end, CString line,
  497. CString fname)
  498. {
  499. ANKI_ASSERT(m_insideStruct);
  500. const U tokenCount = U(end - begin);
  501. if(tokenCount == 0)
  502. {
  503. ANKI_PP_ERROR_MALFORMED();
  504. }
  505. Member& member = *m_ghostStructs.getBack().m_members.emplaceBack(m_pool);
  506. // Relaxed
  507. Bool relaxed = false;
  508. if(*begin == "ANKI_RP")
  509. {
  510. relaxed = true;
  511. ++begin;
  512. }
  513. // Type
  514. if(begin == end)
  515. {
  516. ANKI_PP_ERROR_MALFORMED();
  517. }
  518. const CString typeStr = *begin;
  519. member.m_type = ShaderVariableDataType::kNone;
  520. if(typeStr == "F32" || typeStr == "RF32")
  521. {
  522. member.m_type = ShaderVariableDataType::kF32;
  523. }
  524. else if(typeStr == "Vec2" || typeStr == "RVec2")
  525. {
  526. member.m_type = ShaderVariableDataType::kVec2;
  527. }
  528. else if(typeStr == "Vec3" || typeStr == "RVec3")
  529. {
  530. member.m_type = ShaderVariableDataType::kVec3;
  531. }
  532. else if(typeStr == "Vec4" || typeStr == "RVec4")
  533. {
  534. member.m_type = ShaderVariableDataType::kVec4;
  535. }
  536. else if(typeStr == "U32")
  537. {
  538. member.m_type = ShaderVariableDataType::kU32;
  539. }
  540. if(member.m_type == ShaderVariableDataType::kNone)
  541. {
  542. ANKI_PP_ERROR_MALFORMED_MSG("Unrecognized type");
  543. }
  544. ++begin;
  545. // Name
  546. if(begin == end)
  547. {
  548. ANKI_PP_ERROR_MALFORMED();
  549. }
  550. member.m_name.create(*begin);
  551. ++begin;
  552. // if MUTATOR_NAME is MUTATOR_VALUE
  553. if(begin != end)
  554. {
  555. // "if"
  556. if(*begin != "if")
  557. {
  558. ANKI_PP_ERROR_MALFORMED();
  559. }
  560. ++begin;
  561. // MUTATOR_NAME
  562. if(begin == end)
  563. {
  564. ANKI_PP_ERROR_MALFORMED();
  565. }
  566. const CString mutatorName = *begin;
  567. for(U32 i = 0; i < m_mutators.getSize(); ++i)
  568. {
  569. if(m_mutators[i].m_name == mutatorName)
  570. {
  571. member.m_dependentMutator = i;
  572. break;
  573. }
  574. }
  575. if(member.m_dependentMutator == kMaxU32)
  576. {
  577. ANKI_PP_ERROR_MALFORMED_MSG("Mutator not found");
  578. }
  579. ++begin;
  580. // "is"
  581. if(begin == end)
  582. {
  583. ANKI_PP_ERROR_MALFORMED();
  584. }
  585. if(*begin != "is")
  586. {
  587. ANKI_PP_ERROR_MALFORMED();
  588. }
  589. ++begin;
  590. // MUTATOR_VALUE
  591. if(begin == end)
  592. {
  593. ANKI_PP_ERROR_MALFORMED();
  594. }
  595. ANKI_CHECK(begin->toNumber(member.m_mutatorValue));
  596. if(!mutatorHasValue(m_mutators[member.m_dependentMutator], member.m_mutatorValue))
  597. {
  598. ANKI_PP_ERROR_MALFORMED_MSG("Wrong mutator value");
  599. }
  600. ++begin;
  601. }
  602. if(begin != end)
  603. {
  604. ANKI_PP_ERROR_MALFORMED();
  605. }
  606. // Code
  607. if(member.m_dependentMutator != kMaxU32)
  608. {
  609. m_codeLines.pushBackSprintf("#if %s == %d", m_mutators[member.m_dependentMutator].m_name.cstr(),
  610. member.m_mutatorValue);
  611. }
  612. m_codeLines.pushBackSprintf("#\tdefine %s_%s_DEFINED 1", m_ghostStructs.getBack().m_name.cstr(),
  613. member.m_name.cstr());
  614. m_codeLines.pushBackSprintf("\t%s %s %s;", (relaxed) ? "ANKI_RP" : "", typeStr.cstr(), member.m_name.cstr());
  615. if(member.m_dependentMutator != kMaxU32)
  616. {
  617. m_codeLines.pushBack("#endif");
  618. }
  619. return Error::kNone;
  620. }
  621. Error ShaderProgramParser::parsePragmaStructEnd(const StringRaii* begin, const StringRaii* end, CString line,
  622. CString fname)
  623. {
  624. ANKI_ASSERT(m_insideStruct);
  625. const U tokenCount = U(end - begin);
  626. if(tokenCount != 1)
  627. {
  628. ANKI_PP_ERROR_MALFORMED();
  629. }
  630. GhostStruct& gstruct = m_ghostStructs.getBack();
  631. const CString structName = gstruct.m_name;
  632. if(gstruct.m_members.isEmpty())
  633. {
  634. ANKI_PP_ERROR_MALFORMED_MSG("The struct doesn't have any members");
  635. }
  636. m_codeLines.pushBack("};");
  637. for(U32 i = 0; i < gstruct.m_members.getSize(); ++i)
  638. {
  639. const Member& m = gstruct.m_members[i];
  640. // #define XXX_OFFSETOF
  641. if(i == 0)
  642. {
  643. m_codeLines.pushBackSprintf("#define %s_%s_OFFSETOF 0u", gstruct.m_name.cstr(), m.m_name.cstr());
  644. }
  645. else
  646. {
  647. const Member& prev = gstruct.m_members[i - 1];
  648. m_codeLines.pushBackSprintf("#define %s_%s_OFFSETOF (%s_%s_OFFSETOF + %s_%s_SIZEOF)", structName.cstr(),
  649. m.m_name.cstr(), structName.cstr(), prev.m_name.cstr(), structName.cstr(),
  650. prev.m_name.cstr());
  651. }
  652. // #if XXX_DEFINED
  653. m_codeLines.pushBackSprintf("#if defined(%s_%s_DEFINED)", structName.cstr(), m.m_name.cstr());
  654. // # define XXX_SIZEOF
  655. m_codeLines.pushBackSprintf("#\tdefine %s_%s_SIZEOF %uu", structName.cstr(), m.m_name.cstr(),
  656. getShaderVariableDataTypeInfo(m.m_type).m_size / 4);
  657. // # define XXX_LOAD()
  658. const Bool isIntegral = getShaderVariableDataTypeInfo(m.m_type).m_isIntegral;
  659. const U32 componentCount = getShaderVariableDataTypeInfo(m.m_type).m_size / sizeof(U32);
  660. StringRaii values(m_pool);
  661. for(U32 j = 0; j < componentCount; ++j)
  662. {
  663. StringRaii tmp(m_pool);
  664. tmp.sprintf("%s(ssbo[%s_%s_OFFSETOF + offset + %uu])%s", (isIntegral) ? "" : "asfloat", structName.cstr(),
  665. m.m_name.cstr(), j, (j != componentCount - 1) ? "," : "");
  666. values.append(tmp);
  667. }
  668. m_codeLines.pushBackSprintf("#\tdefine %s_%s_LOAD(ssbo, offset) %s(%s)%s", structName.cstr(), m.m_name.cstr(),
  669. getShaderVariableDataTypeInfo(m.m_type).m_name, values.cstr(),
  670. (i != gstruct.m_members.getSize() - 1) ? "," : "");
  671. // #else
  672. m_codeLines.pushBack("#else");
  673. // # define XXX_SIZEOF 0
  674. m_codeLines.pushBackSprintf("#\tdefine %s_%s_SIZEOF 0u", structName.cstr(), m.m_name.cstr());
  675. // # define XXX_LOAD()
  676. m_codeLines.pushBackSprintf("#\tdefine %s_%s_LOAD(ssbo, offset)", structName.cstr(), m.m_name.cstr());
  677. // #endif
  678. m_codeLines.pushBack("#endif");
  679. }
  680. // Now define the structure LOAD in GLSL
  681. m_codeLines.pushBack("#if ANKI_GLSL");
  682. m_codeLines.pushBackSprintf("#define load%s(ssbo, offset) %s( \\", structName.cstr(), structName.cstr());
  683. for(U32 i = 0; i < gstruct.m_members.getSize(); ++i)
  684. {
  685. const Member& m = gstruct.m_members[i];
  686. m_codeLines.pushBackSprintf("\t%s_%s_LOAD(ssbo, offset) \\", structName.cstr(), m.m_name.cstr());
  687. }
  688. m_codeLines.pushBack(")");
  689. // Now define the structure LOAD in HLSL
  690. m_codeLines.pushBack("#else");
  691. m_codeLines.pushBackSprintf("#define load%s(ssbo, offset) { \\", structName.cstr());
  692. for(U32 i = 0; i < gstruct.m_members.getSize(); ++i)
  693. {
  694. const Member& m = gstruct.m_members[i];
  695. m_codeLines.pushBackSprintf("\t%s_%s_LOAD(ssbo, offset) \\", structName.cstr(), m.m_name.cstr());
  696. }
  697. m_codeLines.pushBack("}");
  698. m_codeLines.pushBack("#endif");
  699. // Define the actual struct
  700. m_codeLines.pushBackSprintf("#define %s %s_", structName.cstr(), structName.cstr());
  701. m_insideStruct = false;
  702. return Error::kNone;
  703. }
  704. Error ShaderProgramParser::parsePragmaHlsl(const StringRaii* begin, const StringRaii* end, CString line, CString fname)
  705. {
  706. ANKI_ASSERT(begin && end);
  707. // Check tokens
  708. if(begin != end)
  709. {
  710. ANKI_PP_ERROR_MALFORMED();
  711. }
  712. m_hlsl = true;
  713. return Error::kNone;
  714. }
  715. Error ShaderProgramParser::parseFile(CString fname, U32 depth)
  716. {
  717. // First check the depth
  718. if(depth > kMaxIncludeDepth)
  719. {
  720. ANKI_SHADER_COMPILER_LOGE("The include depth is too high. Probably circular includance");
  721. }
  722. Bool foundPragmaOnce = false;
  723. // Load file in lines
  724. StringRaii txt(m_pool);
  725. ANKI_CHECK(m_fsystem->readAllText(fname, txt));
  726. StringListRaii lines(m_pool);
  727. lines.splitString(txt.toCString(), '\n', true);
  728. if(lines.getSize() < 1)
  729. {
  730. ANKI_SHADER_COMPILER_LOGE("Source is empty");
  731. }
  732. m_codeLines.pushBackSprintf("#line 0 \"%s\"", fname.cstr());
  733. // Parse lines
  734. U32 lineCount = 0;
  735. for(const String& line : lines)
  736. {
  737. if(line.isEmpty())
  738. {
  739. m_codeLines.pushBack(" ");
  740. }
  741. else if(line.find("pragma") != String::kNpos || line.find("include") != String::kNpos)
  742. {
  743. // Possibly a preprocessor directive we care
  744. ANKI_CHECK(parseLine(line.toCString(), fname, foundPragmaOnce, depth, lineCount));
  745. }
  746. else
  747. {
  748. // Just append the line
  749. m_codeLines.pushBack(line.toCString());
  750. }
  751. ++lineCount;
  752. }
  753. if(foundPragmaOnce)
  754. {
  755. // Append the guard
  756. m_codeLines.pushBack("#endif // Include guard");
  757. }
  758. return Error::kNone;
  759. }
  760. Error ShaderProgramParser::parse()
  761. {
  762. ANKI_ASSERT(!m_fname.isEmpty());
  763. ANKI_ASSERT(m_codeLines.isEmpty());
  764. const CString fname = m_fname;
  765. // Parse recursively
  766. ANKI_CHECK(parseFile(fname, 0));
  767. // Checks
  768. {
  769. if(!m_shaderTypes)
  770. {
  771. ANKI_SHADER_COMPILER_LOGE("Haven't found any shader types");
  772. return Error::kUserData;
  773. }
  774. if(!!(m_shaderTypes & ShaderTypeBit::kCompute))
  775. {
  776. if(m_shaderTypes != ShaderTypeBit::kCompute)
  777. {
  778. ANKI_SHADER_COMPILER_LOGE("Can't combine compute shader with other types of shaders");
  779. return Error::kUserData;
  780. }
  781. }
  782. else if(!!(m_shaderTypes & ShaderTypeBit::kAllGraphics))
  783. {
  784. if(!(m_shaderTypes & ShaderTypeBit::kVertex))
  785. {
  786. ANKI_SHADER_COMPILER_LOGE("Missing vertex shader");
  787. return Error::kUserData;
  788. }
  789. if(!(m_shaderTypes & ShaderTypeBit::kFragment))
  790. {
  791. ANKI_SHADER_COMPILER_LOGE("Missing fragment shader");
  792. return Error::kUserData;
  793. }
  794. }
  795. if(m_insideShader)
  796. {
  797. ANKI_SHADER_COMPILER_LOGE("Forgot a \"pragma anki end\"");
  798. return Error::kUserData;
  799. }
  800. }
  801. if(!m_hlsl)
  802. {
  803. m_codeLines.pushFront(StringRaii(m_pool, "#extension GL_GOOGLE_cpp_style_line_directive : enable"));
  804. }
  805. // Create the code lines
  806. if(m_codeLines.getSize())
  807. {
  808. m_codeLines.join("\n", m_codeSource);
  809. m_codeLines.destroy();
  810. }
  811. // Create the hash
  812. {
  813. if(m_codeSource.getLength())
  814. {
  815. m_codeSourceHash = appendHash(m_codeSource.getBegin(), m_codeSource.getLength(), kShaderHeaderHash);
  816. }
  817. if(m_libName.getLength() > 0)
  818. {
  819. m_codeSourceHash = appendHash(m_libName.getBegin(), m_libName.getLength(), m_codeSourceHash);
  820. }
  821. m_codeSourceHash = appendHash(&m_rayType, sizeof(m_rayType), m_codeSourceHash);
  822. }
  823. return Error::kNone;
  824. }
  825. void ShaderProgramParser::generateAnkiShaderHeader(ShaderType shaderType, const ShaderCompilerOptions& compilerOptions,
  826. StringRaii& header)
  827. {
  828. header.sprintf(kShaderHeader, kShaderStageNames[shaderType].cstr(), compilerOptions.m_mobilePlatform,
  829. compilerOptions.m_forceFullFloatingPointPrecision, kMaxBindlessTextures,
  830. kMaxBindlessReadonlyTextureBuffers);
  831. }
  832. Error ShaderProgramParser::generateVariant(ConstWeakArray<MutatorValue> mutation,
  833. ShaderProgramParserVariant& variant) const
  834. {
  835. // Sanity checks
  836. ANKI_ASSERT(m_codeSource.getLength() > 0);
  837. ANKI_ASSERT(mutation.getSize() == m_mutators.getSize());
  838. for(U32 i = 0; i < mutation.getSize(); ++i)
  839. {
  840. ANKI_ASSERT(mutatorHasValue(m_mutators[i], mutation[i]) && "Value not found");
  841. }
  842. // Init variant
  843. ::new(&variant) ShaderProgramParserVariant();
  844. variant.m_pool = m_pool;
  845. // Create the mutator defines
  846. StringRaii mutatorDefines(m_pool);
  847. for(U32 i = 0; i < mutation.getSize(); ++i)
  848. {
  849. mutatorDefines.append(StringRaii(m_pool).sprintf("#define %s %d\n", m_mutators[i].m_name.cstr(), mutation[i]));
  850. }
  851. // Generate souce per stage
  852. for(ShaderType shaderType : EnumIterable<ShaderType>())
  853. {
  854. if(!(ShaderTypeBit(1u << shaderType) & m_shaderTypes))
  855. {
  856. continue;
  857. }
  858. // Create the header
  859. StringRaii header(m_pool);
  860. generateAnkiShaderHeader(shaderType, m_compilerOptions, header);
  861. // Create the final source without the bindings
  862. StringRaii finalSource(m_pool);
  863. finalSource.append(header);
  864. finalSource.append(mutatorDefines);
  865. finalSource.append(m_codeSource);
  866. // Move the source
  867. variant.m_sources[shaderType] = std::move(finalSource);
  868. }
  869. return Error::kNone;
  870. }
  871. Bool ShaderProgramParser::mutatorHasValue(const ShaderProgramParserMutator& mutator, MutatorValue value)
  872. {
  873. for(MutatorValue v : mutator.m_values)
  874. {
  875. if(value == v)
  876. {
  877. return true;
  878. }
  879. }
  880. return false;
  881. }
  882. Bool ShaderProgramParser::skipMutation(ConstWeakArray<MutatorValue> mutation) const
  883. {
  884. ANKI_ASSERT(mutation.getSize() == m_mutators.getSize());
  885. for(const PartialMutationSkip& skip : m_skipMutations)
  886. {
  887. Bool doSkip = true;
  888. for(U32 i = 0; i < m_mutators.getSize(); ++i)
  889. {
  890. if(skip.m_partialMutation[i] == std::numeric_limits<MutatorValue>::max())
  891. {
  892. // Don't care
  893. continue;
  894. }
  895. if(skip.m_partialMutation[i] != mutation[i])
  896. {
  897. doSkip = false;
  898. break;
  899. }
  900. }
  901. if(doSkip)
  902. {
  903. return true;
  904. }
  905. }
  906. return false;
  907. }
  908. } // end namespace anki