aboutsummaryrefslogtreecommitdiff
path: root/buildtools/codegen/CodegenLookupTable.hpp
diff options
context:
space:
mode:
authorrtk0c <[email protected]>2022-05-28 20:52:42 -0700
committerrtk0c <[email protected]>2022-05-28 20:52:42 -0700
commit1a6f1ea3b76c3ed4cad5aba5502af390ce50a2c0 (patch)
tree40627f5cdfd931b8c28f0b3a5ec78ef0d0f2b9f0 /buildtools/codegen/CodegenLookupTable.hpp
parent6c3007295a6a8c6803933392834c974ec5f56aa0 (diff)
Changeset: 42 Change codegen input parsing to lookahead based; lookup table infra; input/output decl infra
Diffstat (limited to 'buildtools/codegen/CodegenLookupTable.hpp')
-rw-r--r--buildtools/codegen/CodegenLookupTable.hpp50
1 files changed, 50 insertions, 0 deletions
diff --git a/buildtools/codegen/CodegenLookupTable.hpp b/buildtools/codegen/CodegenLookupTable.hpp
new file mode 100644
index 0000000..2b6a993
--- /dev/null
+++ b/buildtools/codegen/CodegenLookupTable.hpp
@@ -0,0 +1,50 @@
+#pragma once
+
+// BIDI stands for bi-directional
+#define BIDI_LUT_DECL(name, aType, aCount, bType, bCount) \
+ int gLut_##name##_A2B[aCount]; \
+ int gLut_##name##_B2A[bCount]; \
+ using name##AType = aType; \
+ using name##BType = bType; \
+ void InitializeLut##name()
+#define BIDI_LUT_MAP_FOR(name) \
+ int* lutMappingA2B = gLut_##name##_A2B; \
+ int* lutMappingB2A = gLut_##name##_B2A
+#define BIDI_LUT_MAP(from, to) \
+ lutMappingA2B[from] = to; \
+ lutMappingB2A[to] = from
+#define BIDI_LUT_INIT(name) InitializeLut##name()
+#define BIDI_LUT_A2B_LOOKUP(name, from) (name##BType)(gLut_##name##_A2B[from])
+#define BIDI_LUT_B2A_LOOKUP(name, to) (name##AType)(gLut_##name##_B2A[to])
+
+#define STR_LUT_DECL(name, enumMinValue, enumMaxValue) \
+ constexpr int kLutMinVal_##name = enumMinValue; \
+ const char* gLut_##name[(int)enumMaxValue - (int)enumMinValue]; \
+ void InitializeLut##name()
+#define STR_LUT_MAP_FOR(name) \
+ const char** lutMapping = gLut_##name; \
+ int lutMappingMinValue = kLutMinVal_##name
+#define STR_LUT_MAP(value, text) lutMapping[value - lutMappingMinValue] = text
+#define STR_LUT_MAP_ENUM(enumValue) STR_LUT_MAP(enumValue, #enumValue)
+#define STR_LUT_LOOKUP(name, enumValue) gLut_##name[enumValue - kLutMinVal_##name]
+#define STR_LUT_INIT(name) InitializeLut##name()
+
+// BSTR stands for bi-directional string
+#define BSTR_LUT_DECL(name, enumMinValue, enumMaxValue) \
+ constexpr int kLutMinVal_##name = enumMinValue; \
+ const char* gLut_##name##_V2S[(int)enumMaxValue - (int)enumMinValue]; \
+ robin_hood::unordered_flat_map<std::string_view, decltype(enumMaxValue)> gLut_##name##_S2V; \
+ void InitializeLut##name()
+#define BSTR_LUT_MAP_FOR(name) \
+ const char** lutMappingV2S = gLut_##name##_V2S; \
+ auto& lutMappingS2V = gLut_##name##_S2V; \
+ int lutMappingMinValue = kLutMinVal_##name
+#define BSTR_LUT_MAP(value, text) \
+ lutMappingV2S[value - lutMappingMinValue] = text; \
+ lutMappingS2V.insert_or_assign(std::string_view(text), value);
+#define BSTR_LUT_MAP_ENUM(enumValue) BSTR_LUT_MAP(enumValue, #enumValue)
+#define BSTR_LUT_V2S(name) gLut_##name##_V2S
+#define BSTR_LUT_S2V(name) gLut_##name##_S2V
+#define BSTR_LUT_V2S_LOOKUP(name, enumValue) gLut_##name##_V2S[enumValue - kLutMinVal_##name]
+#define BSTR_LUT_S2V_LOOKUP(name, string) gLut_##name##_S2V.find(std::string_view(text))
+#define BSTR_LUT_INIT(name) InitializeLut##name()