1 /**************************************************************************
2 *
3 * Copyright 2010 Luca Barbieri
4 *
5 * Permission is hereby granted, free of charge, to any person obtaining
6 * a copy of this software and associated documentation files (the
7 * "Software"), to deal in the Software without restriction, including
8 * without limitation the rights to use, copy, modify, merge, publish,
9 * distribute, sublicense, and/or sell copies of the Software, and to
10 * permit persons to whom the Software is furnished to do so, subject to
11 * the following conditions:
12 *
13 * The above copyright notice and this permission notice (including the
14 * next paragraph) shall be included in all copies or substantial
15 * portions of the Software.
16 *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
18 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
19 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
20 * IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
21 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
22 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
23 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
24 *
25 **************************************************************************/
26
27 #ifndef U_LINKAGE_H_
28 #define U_LINKAGE_H_
29
30 #include "pipe/p_compiler.h"
31 #include "pipe/p_shader_tokens.h"
32
33 struct util_semantic_set
34 {
35 unsigned long masks[256 / 8 / sizeof(unsigned long)];
36 };
37
38 static INLINE boolean
util_semantic_set_contains(struct util_semantic_set * set,unsigned char value)39 util_semantic_set_contains(struct util_semantic_set *set, unsigned char value)
40 {
41 return !!(set->masks[value / (sizeof(long) * 8)] & (1 << (value / (sizeof(long) * 8))));
42 }
43
44 unsigned util_semantic_set_from_program_file(struct util_semantic_set *set, const struct tgsi_token *tokens, enum tgsi_file_type file);
45
46 /* efficient_slots is the number of slots such that hardware performance is
47 * the same for using that amount, with holes, or less slots but with less
48 * holes.
49 *
50 * num_slots is the size of the layout array and hardware limit instead.
51 *
52 * efficient_slots == 0 or efficient_slots == num_slots are typical settings.
53 */
54 void util_semantic_layout_from_set(unsigned char *layout, const struct util_semantic_set *set, unsigned efficient_slots, unsigned num_slots);
55
56 static INLINE void
util_semantic_table_from_layout(unsigned char * table,size_t table_size,unsigned char * layout,unsigned char first_slot_value,unsigned char num_slots)57 util_semantic_table_from_layout(unsigned char *table, size_t table_size, unsigned char *layout,
58 unsigned char first_slot_value, unsigned char num_slots)
59 {
60 unsigned char i;
61 memset(table, 0xff, table_size);
62
63 for(i = 0; i < num_slots; ++i)
64 table[layout[i]] = first_slot_value + i;
65 }
66
67 #endif /* U_LINKAGE_H_ */
68