summaryrefslogtreecommitdiff
path: root/src/mesa/drivers/dri/r300/radeon_program.c
blob: 41cedbe61dc5cfe563b0e94c04122cd20ce44caf (plain)
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
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
/*
 * Copyright (C) 2008 Nicolai Haehnle.
 *
 * All Rights Reserved.
 *
 * 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 COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS 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.
 *
 */

#include "radeon_program.h"


/**
 * Initialize a compiler structure with a single mixed clause
 * containing all instructions from the source program.
 */
void radeonCompilerInit(
	struct radeon_compiler *compiler,
	GLcontext *ctx,
	struct gl_program *source)
{
	struct radeon_clause* clause;

	_mesa_memset(compiler, 0, sizeof(*compiler));
	compiler->Source = source;
	compiler->Ctx = ctx;

	compiler->NumTemporaries = source->NumTemporaries;

	clause = radeonCompilerInsertClause(compiler, 0, CLAUSE_MIXED);
	clause->NumInstructions = 0;
	while(source->Instructions[clause->NumInstructions].Opcode != OPCODE_END)
		clause->NumInstructions++;
	clause->ReservedInstructions = clause->NumInstructions;
	clause->Instructions = _mesa_alloc_instructions(clause->NumInstructions);
	_mesa_copy_instructions(clause->Instructions, source->Instructions, clause->NumInstructions);
}


/**
 * Free all data that is referenced by the compiler structure.
 * However, the compiler structure itself is not freed.
 */
void radeonCompilerCleanup(struct radeon_compiler *compiler)
{
	radeonCompilerEraseClauses(compiler, 0, compiler->NumClauses);
}


/**
 * Allocate and return a unique temporary register.
 */
int radeonCompilerAllocateTemporary(struct radeon_compiler *compiler)
{
	if (compiler->NumTemporaries >= 256) {
		_mesa_problem(compiler->Ctx, "radeonCompiler: Too many temporaries");
		return 0;
	}

	return compiler->NumTemporaries++;
}


/**
 * \p position index of the new clause; later clauses are moved
 * \p type of the new clause; one of CLAUSE_XXX
 * \return a pointer to the new clause
 */
struct radeon_clause* radeonCompilerInsertClause(
	struct radeon_compiler *compiler,
	int position, int type)
{
	struct radeon_clause* oldClauses = compiler->Clauses;
	struct radeon_clause* clause;

	assert(position >= 0 && position <= compiler->NumClauses);

	compiler->Clauses = (struct radeon_clause *)
		_mesa_malloc((compiler->NumClauses+1) * sizeof(struct radeon_clause));
	if (oldClauses) {
		_mesa_memcpy(compiler->Clauses, oldClauses,
			position*sizeof(struct radeon_clause));
		_mesa_memcpy(compiler->Clauses+position+1, oldClauses+position,
			(compiler->NumClauses - position) * sizeof(struct radeon_clause));
		_mesa_free(oldClauses);
	}
	compiler->NumClauses++;

	clause = compiler->Clauses + position;
	_mesa_memset(clause, 0, sizeof(*clause));
	clause->Type = type;

	return clause;
}


/**
 * Remove clauses in the range [start, end)
 */
void radeonCompilerEraseClauses(
	struct radeon_compiler *compiler,
	int start, int end)
{
	struct radeon_clause* oldClauses = compiler->Clauses;
	int i;

	assert(0 <= start);
	assert(start <= end);
	assert(end <= compiler->NumClauses);

	if (end == start)
		return;

	for(i = start; i < end; ++i) {
		struct radeon_clause* clause = oldClauses + i;
		_mesa_free_instructions(clause->Instructions, clause->NumInstructions);
	}

	if (start > 0 || end < compiler->NumClauses) {
		compiler->Clauses = (struct radeon_clause*)
			_mesa_malloc((compiler->NumClauses+start-end) * sizeof(struct radeon_clause));
		_mesa_memcpy(compiler->Clauses, oldClauses,
			start * sizeof(struct radeon_clause));
		_mesa_memcpy(compiler->Clauses + start, oldClauses + end,
			(compiler->NumClauses - end) * sizeof(struct radeon_clause));
		compiler->NumClauses -= end - start;
	} else {
		compiler->Clauses = 0;
		compiler->NumClauses = 0;
	}

	_mesa_free(oldClauses);
}


/**
 * Insert new instructions at the given position, initialize them as NOPs
 * and return a pointer to the first new instruction.
 */
struct prog_instruction* radeonClauseInsertInstructions(
	struct radeon_compiler *compiler,
	struct radeon_clause *clause,
	int position, int count)
{
	int newNumInstructions = clause->NumInstructions + count;

	assert(position >= 0 && position <= clause->NumInstructions);

	if (newNumInstructions <= clause->ReservedInstructions) {
		memmove(clause->Instructions + position + count, clause->Instructions + position,
			(clause->NumInstructions - position) * sizeof(struct prog_instruction));
	} else {
		struct prog_instruction *oldInstructions = clause->Instructions;

		clause->ReservedInstructions *= 2;
		if (newNumInstructions > clause->ReservedInstructions)
			clause->ReservedInstructions = newNumInstructions;

		clause->Instructions = (struct prog_instruction*)
			_mesa_malloc(clause->ReservedInstructions * sizeof(struct prog_instruction));

		if (oldInstructions) {
			_mesa_memcpy(clause->Instructions, oldInstructions,
				position * sizeof(struct prog_instruction));
			_mesa_memcpy(clause->Instructions + position + count, oldInstructions + position,
				(clause->NumInstructions - position) * sizeof(struct prog_instruction));

			_mesa_free(oldInstructions);
		}
	}

	clause->NumInstructions = newNumInstructions;
	_mesa_init_instructions(clause->Instructions + position, count);
	return clause->Instructions + position;
}


/**
 * Transform the given clause in the following way:
 *  1. Replace it with an empty clause
 *  2. For every instruction in the original clause, try the given
 *     transformations in order.
 *  3. If one of the transformations returns GL_TRUE, assume that it
 *     has emitted the appropriate instruction(s) into the new clause;
 *     otherwise, copy the instruction verbatim.
 *
 * \note The transformation is currently not recursive; in other words,
 * instructions emitted by transformations are not transformed.
 *
 * \note The transform is called 'local' because it can only look at
 * one instruction at a time.
 */
void radeonClauseLocalTransform(
	struct radeon_compiler *compiler,
	struct radeon_clause *clause,
	int num_transformations,
	struct radeon_program_transformation* transformations)
{
	struct radeon_program_transform_context context;
	struct radeon_clause source;
	int ip;

	source = *clause;
	clause->Instructions = 0;
	clause->NumInstructions = 0;
	clause->ReservedInstructions = 0;

	context.compiler = compiler;
	context.dest = clause;
	context.src = &source;

	for(ip = 0; ip < source.NumInstructions; ++ip) {
		struct prog_instruction *instr = source.Instructions + ip;
		int i;

		for(i = 0; i < num_transformations; ++i) {
			struct radeon_program_transformation* t = transformations + i;

			if (t->function(&context, instr, t->userData))
				break;
		}

		if (i >= num_transformations) {
			struct prog_instruction *tgt =
				radeonClauseInsertInstructions(compiler, clause, clause->NumInstructions, 1);
			_mesa_copy_instructions(tgt, instr, 1);
		}
	}

	_mesa_free_instructions(source.Instructions, source.NumInstructions);
}