r300/compiler: use null-terminated array of transformation functions
[mesa.git] / src / mesa / drivers / dri / r300 / compiler / radeon_program.c
1 /*
2 * Copyright (C) 2008 Nicolai Haehnle.
3 *
4 * All Rights Reserved.
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining
7 * a copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sublicense, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
13 *
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial
16 * portions of the Software.
17 *
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
19 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
21 * IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
22 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
23 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
24 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 *
26 */
27
28 #include "radeon_program.h"
29
30 #include <stdio.h>
31
32 #include "radeon_compiler.h"
33
34
35 /**
36 * Transform the given clause in the following way:
37 * 1. Replace it with an empty clause
38 * 2. For every instruction in the original clause, try the given
39 * transformations in order.
40 * 3. If one of the transformations returns GL_TRUE, assume that it
41 * has emitted the appropriate instruction(s) into the new clause;
42 * otherwise, copy the instruction verbatim.
43 *
44 * \note The transformation is currently not recursive; in other words,
45 * instructions emitted by transformations are not transformed.
46 *
47 * \note The transform is called 'local' because it can only look at
48 * one instruction at a time.
49 */
50 void radeonLocalTransform(
51 struct radeon_compiler * c,
52 struct radeon_program_transformation* transformations)
53 {
54 struct rc_instruction * inst = c->Program.Instructions.Next;
55
56 while(inst != &c->Program.Instructions) {
57 struct rc_instruction * current = inst;
58 int i;
59
60 inst = inst->Next;
61
62 for(i = 0; transformations[i].function; ++i) {
63 struct radeon_program_transformation* t = transformations + i;
64
65 if (t->function(c, current, t->userData))
66 break;
67 }
68 }
69 }
70
71 /**
72 * Left multiplication of a register with a swizzle
73 */
74 struct rc_src_register lmul_swizzle(unsigned int swizzle, struct rc_src_register srcreg)
75 {
76 struct rc_src_register tmp = srcreg;
77 int i;
78 tmp.Swizzle = 0;
79 tmp.Negate = 0;
80 for(i = 0; i < 4; ++i) {
81 rc_swizzle swz = GET_SWZ(swizzle, i);
82 if (swz < 4) {
83 tmp.Swizzle |= GET_SWZ(srcreg.Swizzle, swz) << (i*3);
84 tmp.Negate |= GET_BIT(srcreg.Negate, swz) << i;
85 } else {
86 tmp.Swizzle |= swz << (i*3);
87 }
88 }
89 return tmp;
90 }
91
92 unsigned int rc_find_free_temporary(struct radeon_compiler * c)
93 {
94 char used[RC_REGISTER_MAX_INDEX];
95 unsigned int i;
96 struct rc_instruction * rcinst;
97
98 memset(used, 0, sizeof(used));
99
100 for (rcinst = c->Program.Instructions.Next; rcinst != &c->Program.Instructions; rcinst = rcinst->Next) {
101 const struct rc_sub_instruction *inst = &rcinst->U.I;
102 const struct rc_opcode_info *opcode = rc_get_opcode_info(inst->Opcode);
103 unsigned int k;
104
105 for (k = 0; k < opcode->NumSrcRegs; k++) {
106 if (inst->SrcReg[k].File == RC_FILE_TEMPORARY)
107 used[inst->SrcReg[k].Index] = 1;
108 }
109
110 if (opcode->HasDstReg) {
111 if (inst->DstReg.File == RC_FILE_TEMPORARY)
112 used[inst->DstReg.Index] = 1;
113 }
114 }
115
116 for (i = 0; i < RC_REGISTER_MAX_INDEX; i++) {
117 if (!used[i])
118 return i;
119 }
120
121 rc_error(c, "Ran out of temporary registers\n");
122 return 0;
123 }
124
125
126 struct rc_instruction *rc_alloc_instruction(struct radeon_compiler * c)
127 {
128 struct rc_instruction * inst = memory_pool_malloc(&c->Pool, sizeof(struct rc_instruction));
129
130 memset(inst, 0, sizeof(struct rc_instruction));
131
132 inst->U.I.Opcode = RC_OPCODE_ILLEGAL_OPCODE;
133 inst->U.I.DstReg.WriteMask = RC_MASK_XYZW;
134 inst->U.I.SrcReg[0].Swizzle = RC_SWIZZLE_XYZW;
135 inst->U.I.SrcReg[1].Swizzle = RC_SWIZZLE_XYZW;
136 inst->U.I.SrcReg[2].Swizzle = RC_SWIZZLE_XYZW;
137
138 return inst;
139 }
140
141 void rc_insert_instruction(struct rc_instruction * after, struct rc_instruction * inst)
142 {
143 inst->Prev = after;
144 inst->Next = after->Next;
145
146 inst->Prev->Next = inst;
147 inst->Next->Prev = inst;
148 }
149
150 struct rc_instruction *rc_insert_new_instruction(struct radeon_compiler * c, struct rc_instruction * after)
151 {
152 struct rc_instruction * inst = rc_alloc_instruction(c);
153
154 rc_insert_instruction(after, inst);
155
156 return inst;
157 }
158
159 void rc_remove_instruction(struct rc_instruction * inst)
160 {
161 inst->Prev->Next = inst->Next;
162 inst->Next->Prev = inst->Prev;
163 }
164
165 /**
166 * Return the number of instructions in the program.
167 */
168 unsigned int rc_recompute_ips(struct radeon_compiler * c)
169 {
170 unsigned int ip = 0;
171 struct rc_instruction * inst;
172
173 for(inst = c->Program.Instructions.Next;
174 inst != &c->Program.Instructions;
175 inst = inst->Next) {
176 inst->IP = ip++;
177 }
178
179 c->Program.Instructions.IP = 0xcafedead;
180
181 return ip;
182 }