1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
/*
* Copyright (c) 2014-2017, NVIDIA CORPORATION. All rights reserved.
*
* NVIDIA CORPORATION and its licensors retain all intellectual property
* and proprietary rights in and to this software, related documentation
* and any modifications thereto. Any use, reproduction, disclosure or
* distribution of this software and related documentation without an express
* license agreement from NVIDIA CORPORATION is strictly prohibited.
*/
#pragma once
struct StrHeap
{
char* data;
unsigned int size;
unsigned int allocIdx;
};
StrHeap allocateStrHeap(const char** definitions, unsigned int numFunctions)
{
unsigned int count = 0u;
for (unsigned int functionIdx = 0u; functionIdx < numFunctions; functionIdx++)
{
count += (unsigned int)strlen(definitions[functionIdx]);
}
// offset count to cover null terminators
count += numFunctions * (2 * maxFunctionParams + 1 + 1);
StrHeap heap = {};
heap.data = (char*)malloc(count);
heap.size = count;
heap.allocIdx = 0u;
return heap;
}
void freeStrHeap(StrHeap* heap)
{
free(heap->data);
heap->data = nullptr;
heap->size = 0u;
heap->allocIdx = 0u;
}
inline bool isSpace(char c)
{
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == '\f' || c == '\v';
}
inline bool isAlphaNum(char c)
{
return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9') || (c == '_');
}
void skipSpace(unsigned int* readIdx, const char* definition)
{
while (definition[*readIdx] != '\0')
{
if (isSpace(definition[*readIdx]))
{
*readIdx = *readIdx + 1;
}
else
{
break;
}
}
}
void findChar(unsigned int* readIdx, const char* definition, char c)
{
while (definition[*readIdx] != '\0')
{
if (definition[*readIdx] == c)
{
break;
}
else
{
*readIdx = *readIdx + 1;
}
}
}
unsigned int findParamDelimiter(unsigned int readIdx, const char* definition)
{
while (definition[readIdx] != '\0')
{
if (definition[readIdx] == ',' || definition[readIdx] == ')')
{
return readIdx;
}
else
{
readIdx = readIdx + 1;
}
}
return readIdx;
}
unsigned int reverseFindAlphaNum(unsigned int maxReadIdx, const char* definition)
{
int readIdx = (int)maxReadIdx;
readIdx--;
bool hitAlphaNum = false;
while (readIdx >= 0)
{
if (isAlphaNum(definition[readIdx]))
{
hitAlphaNum = true;
readIdx--;
}
else if (definition[readIdx] == '(' || definition[readIdx] == ',')
{
if (hitAlphaNum)
{
return (unsigned int)(readIdx + 1);
}
else
{
return maxReadIdx;
};
}
else if (isSpace(definition[readIdx]))
{
if (hitAlphaNum)
{
return (unsigned int)(readIdx + 1);
}
else
{
readIdx--;
}
}
else
{
break;
}
}
return maxReadIdx;
}
void extractAlphaNum(StrHeap* heap, const char** dstPtr, unsigned int* readIdx, const char* definition)
{
skipSpace(readIdx, definition);
*dstPtr = heap->data + heap->allocIdx;
while (heap->allocIdx < heap->size)
{
if (isAlphaNum(definition[(*readIdx)]))
{
heap->data[heap->allocIdx++] = definition[(*readIdx)++];
}
else
{
break;
}
}
heap->data[heap->allocIdx++] = '\0';
}
void extractRegion(StrHeap* heap, const char** dstPtr, unsigned char readIdx, unsigned char maxReadIdx, const char* definition)
{
*dstPtr = heap->data + heap->allocIdx;
while (heap->allocIdx < heap->size)
{
if (readIdx < maxReadIdx)
{
heap->data[heap->allocIdx++] = definition[readIdx++];
}
else
{
break;
}
}
heap->data[heap->allocIdx++] = '\0';
}
Function genFunction(StrHeap* heap, const char* definition)
{
Function function = {};
unsigned int readIdx = 0u;
unsigned int tempReadIdx = 0u;
unsigned int paramStartReadIdx = readIdx;
findChar(¶mStartReadIdx, definition, '(');
unsigned int methodReadIdx = reverseFindAlphaNum(paramStartReadIdx, definition);
extractRegion(heap, &function.retType, readIdx, methodReadIdx, definition);
tempReadIdx = methodReadIdx;
extractAlphaNum(heap, &function.method, &tempReadIdx, definition);
readIdx = paramStartReadIdx;
function.numParams = 0;
while (function.numParams < maxFunctionParams)
{
unsigned int maxReadIdx = findParamDelimiter(readIdx, definition);
unsigned int instNameReadIdx = reverseFindAlphaNum(maxReadIdx, definition);
// break if no name found
if (instNameReadIdx == maxReadIdx)
{
break;
}
FunctionParams funcParams = {};
// extract type name, found on interval readIdx to instNameReadIdx
extractRegion(heap, &funcParams.typeName, readIdx + 1, instNameReadIdx, definition);
// extract inst name, found on interval instNameReadIdx to maxReadIdx
tempReadIdx = instNameReadIdx;
extractAlphaNum(heap, &funcParams.instName, &tempReadIdx, definition);
// advance read index
readIdx = maxReadIdx + 1;
function.params[function.numParams++] = funcParams;
}
return function;
}
|