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
|
/*
* Copyright © 2019 Google LLC
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
#ifndef TU_CS_H
#define TU_CS_H
#include "tu_private.h"
#include "registers/adreno_pm4.xml.h"
void
tu_cs_init(struct tu_cs *cs, enum tu_cs_mode mode, uint32_t initial_size);
void
tu_cs_init_external(struct tu_cs *cs, uint32_t *start, uint32_t *end);
void
tu_cs_finish(struct tu_device *dev, struct tu_cs *cs);
void
tu_cs_begin(struct tu_cs *cs);
void
tu_cs_end(struct tu_cs *cs);
VkResult
tu_cs_begin_sub_stream(struct tu_device *dev,
struct tu_cs *cs,
uint32_t size,
struct tu_cs *sub_cs);
VkResult
tu_cs_alloc(struct tu_device *dev,
struct tu_cs *cs,
uint32_t count,
uint32_t size,
struct ts_cs_memory *memory);
struct tu_cs_entry
tu_cs_end_sub_stream(struct tu_cs *cs, struct tu_cs *sub_cs);
VkResult
tu_cs_reserve_space(struct tu_device *dev,
struct tu_cs *cs,
uint32_t reserved_size);
void
tu_cs_reset(struct tu_device *dev, struct tu_cs *cs);
VkResult
tu_cs_add_entries(struct tu_cs *cs, struct tu_cs *target);
/**
* Discard all entries. This allows \a cs to be reused while keeping the
* existing BOs and command packets intact.
*/
static inline void
tu_cs_discard_entries(struct tu_cs *cs)
{
assert(cs->mode == TU_CS_MODE_GROW);
cs->entry_count = 0;
}
/**
* Get the size needed for tu_cs_emit_call.
*/
static inline uint32_t
tu_cs_get_call_size(const struct tu_cs *cs)
{
assert(cs->mode == TU_CS_MODE_GROW);
/* each CP_INDIRECT_BUFFER needs 4 dwords */
return cs->entry_count * 4;
}
/**
* Assert that we did not exceed the reserved space.
*/
static inline void
tu_cs_sanity_check(const struct tu_cs *cs)
{
assert(cs->start <= cs->cur);
assert(cs->cur <= cs->reserved_end);
assert(cs->reserved_end <= cs->end);
}
/**
* Emit a uint32_t value into a command stream, without boundary checking.
*/
static inline void
tu_cs_emit(struct tu_cs *cs, uint32_t value)
{
assert(cs->cur < cs->reserved_end);
*cs->cur = value;
++cs->cur;
}
/**
* Emit an array of uint32_t into a command stream, without boundary checking.
*/
static inline void
tu_cs_emit_array(struct tu_cs *cs, const uint32_t *values, uint32_t length)
{
assert(cs->cur + length <= cs->reserved_end);
memcpy(cs->cur, values, sizeof(uint32_t) * length);
cs->cur += length;
}
static inline unsigned
tu_odd_parity_bit(unsigned val)
{
/* See: http://graphics.stanford.edu/~seander/bithacks.html#ParityParallel
* note that we want odd parity so 0x6996 is inverted.
*/
val ^= val >> 16;
val ^= val >> 8;
val ^= val >> 4;
val &= 0xf;
return (~0x6996 >> val) & 1;
}
/**
* Emit a type-4 command packet header into a command stream.
*/
static inline void
tu_cs_emit_pkt4(struct tu_cs *cs, uint16_t regindx, uint16_t cnt)
{
tu_cs_emit(cs, CP_TYPE4_PKT | cnt | (tu_odd_parity_bit(cnt) << 7) |
((regindx & 0x3ffff) << 8) |
((tu_odd_parity_bit(regindx) << 27)));
}
/**
* Emit a type-7 command packet header into a command stream.
*/
static inline void
tu_cs_emit_pkt7(struct tu_cs *cs, uint8_t opcode, uint16_t cnt)
{
tu_cs_emit(cs, CP_TYPE7_PKT | cnt | (tu_odd_parity_bit(cnt) << 15) |
((opcode & 0x7f) << 16) |
((tu_odd_parity_bit(opcode) << 23)));
}
static inline void
tu_cs_emit_wfi(struct tu_cs *cs)
{
tu_cs_emit_pkt7(cs, CP_WAIT_FOR_IDLE, 0);
}
static inline void
tu_cs_emit_qw(struct tu_cs *cs, uint64_t value)
{
tu_cs_emit(cs, (uint32_t) value);
tu_cs_emit(cs, (uint32_t) (value >> 32));
}
static inline void
tu_cs_emit_write_reg(struct tu_cs *cs, uint16_t reg, uint32_t value)
{
tu_cs_emit_pkt4(cs, reg, 1);
tu_cs_emit(cs, value);
}
/**
* Emit a CP_INDIRECT_BUFFER command packet.
*/
static inline void
tu_cs_emit_ib(struct tu_cs *cs, const struct tu_cs_entry *entry)
{
assert(entry->bo);
assert(entry->size && entry->offset + entry->size <= entry->bo->size);
assert(entry->size % sizeof(uint32_t) == 0);
assert(entry->offset % sizeof(uint32_t) == 0);
tu_cs_emit_pkt7(cs, CP_INDIRECT_BUFFER, 3);
tu_cs_emit_qw(cs, entry->bo->iova + entry->offset);
tu_cs_emit(cs, entry->size / sizeof(uint32_t));
}
/**
* Emit a CP_INDIRECT_BUFFER command packet for each entry in the target
* command stream.
*/
static inline void
tu_cs_emit_call(struct tu_cs *cs, const struct tu_cs *target)
{
assert(target->mode == TU_CS_MODE_GROW);
for (uint32_t i = 0; i < target->entry_count; i++)
tu_cs_emit_ib(cs, target->entries + i);
}
#endif /* TU_CS_H */
|
