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
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
|
/**************************************************************************
*
* Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas.
* 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, sub license, 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 NON-INFRINGEMENT.
* IN NO EVENT SHALL TUNGSTEN GRAPHICS 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.
*
**************************************************************************/
/*
* Authors:
* Zack Rusin zack@tungstengraphics.com
*/
#ifdef MESA_LLVM
#include "gallivm.h"
#include "gallivm_p.h"
#include "instructions.h"
#include "loweringpass.h"
#include "storage.h"
#include "tgsitollvm.h"
#include "pipe/p_context.h"
#include "pipe/p_shader_tokens.h"
#include "pipe/tgsi/exec/tgsi_exec.h"
#include "pipe/tgsi/util/tgsi_dump.h"
#include <llvm/Module.h>
#include <llvm/CallingConv.h>
#include <llvm/Constants.h>
#include <llvm/DerivedTypes.h>
#include <llvm/Instructions.h>
#include <llvm/ModuleProvider.h>
#include <llvm/Pass.h>
#include <llvm/PassManager.h>
#include <llvm/ParameterAttributes.h>
#include <llvm/Support/PatternMatch.h>
#include <llvm/ExecutionEngine/JIT.h>
#include <llvm/ExecutionEngine/Interpreter.h>
#include <llvm/ExecutionEngine/GenericValue.h>
#include <llvm/Support/MemoryBuffer.h>
#include <llvm/LinkAllPasses.h>
#include <llvm/Analysis/Verifier.h>
#include <llvm/Analysis/LoopPass.h>
#include <llvm/Target/TargetData.h>
#include <llvm/Bitcode/ReaderWriter.h>
#include <llvm/Transforms/Utils/Cloning.h>
#include <sstream>
#include <fstream>
#include <iostream>
static int GLOBAL_ID = 0;
using namespace llvm;
static inline
void AddStandardCompilePasses(PassManager &PM)
{
PM.add(new LoweringPass());
PM.add(createVerifierPass()); // Verify that input is correct
PM.add(createLowerSetJmpPass()); // Lower llvm.setjmp/.longjmp
//PM.add(createStripSymbolsPass(true));
PM.add(createRaiseAllocationsPass()); // call %malloc -> malloc inst
PM.add(createCFGSimplificationPass()); // Clean up disgusting code
PM.add(createPromoteMemoryToRegisterPass());// Kill useless allocas
PM.add(createGlobalOptimizerPass()); // Optimize out global vars
PM.add(createGlobalDCEPass()); // Remove unused fns and globs
PM.add(createIPConstantPropagationPass());// IP Constant Propagation
PM.add(createDeadArgEliminationPass()); // Dead argument elimination
PM.add(createInstructionCombiningPass()); // Clean up after IPCP & DAE
PM.add(createCFGSimplificationPass()); // Clean up after IPCP & DAE
PM.add(createPruneEHPass()); // Remove dead EH info
PM.add(createFunctionInliningPass()); // Inline small functions
PM.add(createArgumentPromotionPass()); // Scalarize uninlined fn args
PM.add(createTailDuplicationPass()); // Simplify cfg by copying code
PM.add(createInstructionCombiningPass()); // Cleanup for scalarrepl.
PM.add(createCFGSimplificationPass()); // Merge & remove BBs
PM.add(createScalarReplAggregatesPass()); // Break up aggregate allocas
PM.add(createInstructionCombiningPass()); // Combine silly seq's
PM.add(createCondPropagationPass()); // Propagate conditionals
PM.add(createTailCallEliminationPass()); // Eliminate tail calls
PM.add(createCFGSimplificationPass()); // Merge & remove BBs
PM.add(createReassociatePass()); // Reassociate expressions
PM.add(createLoopRotatePass());
PM.add(createLICMPass()); // Hoist loop invariants
PM.add(createLoopUnswitchPass()); // Unswitch loops.
PM.add(createLoopIndexSplitPass()); // Index split loops.
PM.add(createInstructionCombiningPass()); // Clean up after LICM/reassoc
PM.add(createIndVarSimplifyPass()); // Canonicalize indvars
PM.add(createLoopUnrollPass()); // Unroll small loops
PM.add(createInstructionCombiningPass()); // Clean up after the unroller
PM.add(createGVNPass()); // Remove redundancies
PM.add(createSCCPPass()); // Constant prop with SCCP
// Run instcombine after redundancy elimination to exploit opportunities
// opened up by them.
PM.add(createInstructionCombiningPass());
PM.add(createCondPropagationPass()); // Propagate conditionals
PM.add(createDeadStoreEliminationPass()); // Delete dead stores
PM.add(createAggressiveDCEPass()); // SSA based 'Aggressive DCE'
PM.add(createCFGSimplificationPass()); // Merge & remove BBs
PM.add(createSimplifyLibCallsPass()); // Library Call Optimizations
PM.add(createDeadTypeEliminationPass()); // Eliminate dead types
PM.add(createConstantMergePass()); // Merge dup global constants
}
void gallivm_prog_delete(struct gallivm_prog *prog)
{
delete prog->module;
prog->module = 0;
prog->function = 0;
free(prog);
}
static inline void
constant_interpolation(float (*inputs)[16][4],
const struct tgsi_interp_coef *coefs,
unsigned attrib,
unsigned chan)
{
unsigned i;
for (i = 0; i < QUAD_SIZE; ++i) {
inputs[i][attrib][chan] = coefs[attrib].a0[chan];
}
}
static inline void
linear_interpolation(float (*inputs)[16][4],
const struct tgsi_interp_coef *coefs,
unsigned attrib,
unsigned chan)
{
unsigned i;
for( i = 0; i < QUAD_SIZE; i++ ) {
const float x = inputs[i][0][0];
const float y = inputs[i][0][1];
inputs[i][attrib][chan] =
coefs[attrib].a0[chan] +
coefs[attrib].dadx[chan] * x +
coefs[attrib].dady[chan] * y;
}
}
static inline void
perspective_interpolation(float (*inputs)[16][4],
const struct tgsi_interp_coef *coefs,
unsigned attrib,
unsigned chan )
{
unsigned i;
for( i = 0; i < QUAD_SIZE; i++ ) {
const float x = inputs[i][0][0];
const float y = inputs[i][0][1];
/* WPOS.w here is really 1/w */
const float w = 1.0f / inputs[i][0][3];
assert(inputs[i][0][3] != 0.0);
inputs[i][attrib][chan] =
(coefs[attrib].a0[chan] +
coefs[attrib].dadx[chan] * x +
coefs[attrib].dady[chan] * y) * w;
}
}
void gallivm_ir_dump(struct gallivm_ir *ir, const char *file_prefix)
{
if (!ir || !ir->module)
return;
if (file_prefix) {
std::ostringstream stream;
stream << file_prefix;
stream << ir->id;
stream << ".ll";
std::string name = stream.str();
std::ofstream out(name.c_str());
if (!out) {
std::cerr<<"Can't open file : "<<stream.str()<<std::endl;;
return;
}
out << (*ir->module);
out.close();
} else {
const llvm::Module::FunctionListType &funcs = ir->module->getFunctionList();
llvm::Module::FunctionListType::const_iterator itr;
std::cout<<"; ---------- Start shader "<<ir->id<<std::endl;
for (itr = funcs.begin(); itr != funcs.end(); ++itr) {
const llvm::Function &func = (*itr);
std::string name = func.getName();
const llvm::Function *found = 0;
if (name.find("vs_shader") != std::string::npos ||
name.find("fs_shader") != std::string::npos ||
name.find("function") != std::string::npos)
found = &func;
if (found) {
std::cout<<*found<<std::endl;
}
}
std::cout<<"; ---------- End shader "<<ir->id<<std::endl;
}
}
void gallivm_prog_inputs_interpolate(struct gallivm_prog *prog,
float (*inputs)[16][4],
const struct tgsi_interp_coef *coef)
{
for (int i = 0; i < prog->num_interp; ++i) {
const gallivm_interpolate &interp = prog->interpolators[i];
switch (interp.type) {
case TGSI_INTERPOLATE_CONSTANT:
constant_interpolation(inputs, coef, interp.attrib, interp.chan);
break;
case TGSI_INTERPOLATE_LINEAR:
linear_interpolation(inputs, coef, interp.attrib, interp.chan);
break;
case TGSI_INTERPOLATE_PERSPECTIVE:
perspective_interpolation(inputs, coef, interp.attrib, interp.chan);
break;
default:
assert( 0 );
}
}
}
struct gallivm_ir * gallivm_ir_new(enum gallivm_shader_type type)
{
struct gallivm_ir *ir =
(struct gallivm_ir *)calloc(1, sizeof(struct gallivm_ir));
++GLOBAL_ID;
ir->id = GLOBAL_ID;
ir->type = type;
return ir;
}
void gallivm_ir_set_layout(struct gallivm_ir *ir,
enum gallivm_vector_layout layout)
{
ir->layout = layout;
}
void gallivm_ir_set_components(struct gallivm_ir *ir, int num)
{
ir->num_components = num;
}
void gallivm_ir_fill_from_tgsi(struct gallivm_ir *ir,
const struct tgsi_token *tokens)
{
std::cout << "Creating llvm from: " <<std::endl;
tgsi_dump(tokens, 0);
llvm::Module *irmod = tgsi_to_llvmir(ir, tokens);
llvm::Module *mod = tgsi_to_llvm(ir, tokens);
ir->module = mod;
gallivm_ir_dump(ir, 0);
}
void gallivm_ir_delete(struct gallivm_ir *ir)
{
delete ir->module;
free(ir);
}
struct gallivm_prog * gallivm_ir_compile(struct gallivm_ir *ir)
{
struct gallivm_prog *prog =
(struct gallivm_prog *)calloc(1, sizeof(struct gallivm_prog));
llvm::Module *mod = llvm::CloneModule(ir->module);
prog->num_consts = ir->num_consts;
memcpy(prog->interpolators, ir->interpolators, sizeof(prog->interpolators));
prog->num_interp = ir->num_interp;
/* Run optimization passes over it */
PassManager passes;
passes.add(new TargetData(mod));
AddStandardCompilePasses(passes);
passes.run(*mod);
prog->module = mod;
return prog;
}
#endif /* MESA_LLVM */
|