bb250602b25779c5e363461651e39b3502b05588
3 # Copyright © 2015 Intel Corporation
5 # Permission is hereby granted, free of charge, to any person obtaining a
6 # copy of this software and associated documentation files (the "Software"),
7 # to deal in the Software without restriction, including without limitation
8 # the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 # and/or sell copies of the Software, and to permit persons to whom the
10 # Software is furnished to do so, subject to the following conditions:
12 # The above copyright notice and this permission notice (including the next
13 # paragraph) shall be included in all copies or substantial portions of the
16 # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 # THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
21 # FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
25 import fileinput
, re
, sys
27 # Each function typedef in the vulkan.h header is all on one line and matches
28 # this regepx. We hope that won't change.
30 p
= re
.compile('typedef ([^ ]*) *\(VKAPI \*PFN_vk([^(]*)\)(.*);')
34 # We generate a static hash table for entry point lookup
35 # (vkGetProcAddress). We use a linear congruential generator for our hash
36 # function and a power-of-two size table. The prime numbers are determined
42 hash_mask
= hash_size
- 1
44 prime_factor
= 5024183
50 h
= (h
* prime_factor
+ ord(c
)) & u32_mask
57 if (sys
.argv
[1] == "header"):
60 elif (sys
.argv
[1] == "code"):
64 # Parse the entry points in the header
67 for line
in fileinput
.input():
70 if m
.group(2) == 'VoidFunction':
72 fullname
= "vk" + m
.group(2)
74 entrypoints
.append((m
.group(1), m
.group(2), m
.group(3), i
, h
))
77 # For outputting entrypoints.h we generate a anv_EntryPoint() prototype
81 print "/* This file generated from vk_gen.py, don't edit directly. */\n"
83 print "struct anv_dispatch_table {"
85 print " void *entrypoints[%d];" % len(entrypoints
)
88 for type, name
, args
, num
, h
in entrypoints
:
89 print " %s (*%s)%s;" % (type, name
, args
)
94 print "void anv_set_dispatch_devinfo(const struct brw_device_info *info);\n"
96 for type, name
, args
, num
, h
in entrypoints
:
97 print "%s anv_%s%s;" % (type, name
, args
)
98 print "%s gen7_%s%s;" % (type, name
, args
)
99 print "%s gen8_%s%s;" % (type, name
, args
)
100 print "%s anv_validate_%s%s;" % (type, name
, args
)
106 * Copyright © 2015 Intel Corporation
108 * Permission is hereby granted, free of charge, to any person obtaining a
109 * copy of this software and associated documentation files (the "Software"),
110 * to deal in the Software without restriction, including without limitation
111 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
112 * and/or sell copies of the Software, and to permit persons to whom the
113 * Software is furnished to do so, subject to the following conditions:
115 * The above copyright notice and this permission notice (including the next
116 * paragraph) shall be included in all copies or substantial portions of the
119 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
120 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
121 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
122 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
123 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
124 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
128 /* DO NOT EDIT! This is a generated file. */
130 #include "anv_private.h"
132 struct anv_entrypoint {
137 /* We use a big string constant to avoid lots of reloctions from the entry
138 * point table to lots of little strings. The entries in the entry point table
139 * store the index into this big string.
142 static const char strings[] ="""
146 for type, name
, args
, num
, h
in entrypoints
:
147 print " \"vk%s\\0\"" % name
149 i
+= 2 + len(name
) + 1
152 /* Weak aliases for all potential validate functions. These will resolve to
153 * NULL if they're not defined, which lets the resolve_entrypoint() function
154 * either pick a validate wrapper if available or just plug in the actual
159 # Now generate the table of all entry points and their validation functions
161 print "\nstatic const struct anv_entrypoint entrypoints[] = {"
162 for type, name
, args
, num
, h
in entrypoints
:
163 print " { %5d, 0x%08x }," % (offsets
[num
], h
)
166 for layer
in [ "anv", "validate", "gen7", "gen8" ]:
167 for type, name
, args
, num
, h
in entrypoints
:
168 print "%s %s_%s%s __attribute__ ((weak));" % (type, layer
, name
, args
)
169 print "\nconst struct anv_dispatch_table %s_layer = {" % layer
170 for type, name
, args
, num
, h
in entrypoints
:
171 print " .%s = %s_%s," % (name
, layer
, name
)
176 static bool enable_validate = true;
178 static bool enable_validate = false;
181 /* We can't use symbols that need resolving (like, oh, getenv) in the resolve
182 * function. This means that we have to determine whether or not to use the
183 * validation layer sometime before that. The constructor function attribute asks
184 * the dynamic linker to invoke determine_validate() at dlopen() time which
187 static void __attribute__ ((constructor))
188 determine_validate(void)
190 const char *s = getenv("ANV_VALIDATE");
193 enable_validate = atoi(s);
196 static const struct brw_device_info *dispatch_devinfo;
199 anv_set_dispatch_devinfo(const struct brw_device_info *devinfo)
201 dispatch_devinfo = devinfo;
204 void * __attribute__ ((noinline))
205 anv_resolve_entrypoint(uint32_t index)
207 if (enable_validate && validate_layer.entrypoints[index])
208 return validate_layer.entrypoints[index];
210 if (dispatch_devinfo == NULL) {
211 assert(anv_layer.entrypoints[index]);
212 return anv_layer.entrypoints[index];
215 switch (dispatch_devinfo->gen) {
217 if (gen8_layer.entrypoints[index])
218 return gen8_layer.entrypoints[index];
221 if (gen7_layer.entrypoints[index])
222 return gen7_layer.entrypoints[index];
225 return anv_layer.entrypoints[index];
227 unreachable("unsupported gen\\n");
232 # Now output ifuncs and their resolve helpers for all entry points. The
233 # resolve helper calls resolve_entrypoint() with the entry point index, which
234 # lets the resolver look it up in the table.
236 for type, name
, args
, num
, h
in entrypoints
:
237 print "static void *resolve_%s(void) { return anv_resolve_entrypoint(%d); }" % (name
, num
)
238 print "%s vk%s%s\n __attribute__ ((ifunc (\"resolve_%s\"), visibility (\"default\")));\n" % (type, name
, args
, name
)
241 # Now generate the hash table used for entry point look up. This is a
242 # uint16_t table of entry point indices. We use 0xffff to indicate an entry
243 # in the hash table is empty.
245 map = [none
for f
in xrange(hash_size
)]
246 collisions
= [0 for f
in xrange(10)]
247 for type, name
, args
, num
, h
in entrypoints
:
249 while map[h
& hash_mask
] != none
:
255 collisions
[level
] += 1
256 map[h
& hash_mask
] = num
258 print "/* Hash table stats:"
259 print " * size %d entries" % hash_size
260 print " * collisions entries"
267 print " * %2d%s %4d" % (i
, plus
, collisions
[i
])
270 print "#define none 0x%04x\n" % none
272 print "static const uint16_t map[] = {"
273 for i
in xrange(0, hash_size
, 8):
275 for j
in xrange(i
, i
+ 8):
276 if map[j
] & 0xffff == 0xffff:
279 print "0x%04x," % (map[j
] & 0xffff),
284 # Finally we generate the hash table lookup function. The hash function and
285 # linear probing algorithm matches the hash table generated above.
289 anv_lookup_entrypoint(const char *name)
291 static const uint32_t prime_factor = %d;
292 static const uint32_t prime_step = %d;
293 const struct anv_entrypoint *e;
298 for (p = name; *p; p++)
299 hash = hash * prime_factor + *p;
308 } while (e->hash != hash);
310 if (strcmp(name, strings + e->name) != 0)
313 return anv_resolve_entrypoint(i);
315 """ % (prime_factor
, prime_step
, hash_mask
)