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
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
|
/**************************************************************************
*
* 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
*/
#include "llvmtgsi.h"
#include "instructions.h"
#include "storage.h"
#include "pipe/p_context.h"
#include "pipe/tgsi/exec/tgsi_exec.h"
#include "pipe/tgsi/exec/tgsi_token.h"
#include "pipe/tgsi/exec/tgsi_build.h"
#include "pipe/tgsi/exec/tgsi_util.h"
#include "pipe/tgsi/exec/tgsi_parse.h"
#include "pipe/tgsi/exec/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 <sstream>
#include <fstream>
#include <iostream>
#ifdef MESA_LLVM
struct gallivm_prog {
llvm::Module *module;
void *function;
int num_consts;
int id;
};
struct gallivm_cpu_engine {
llvm::ExecutionEngine *engine;
};
using namespace llvm;
#include "llvm_base_shader.cpp"
static int GLOBAL_ID = 0;
static inline void AddStandardCompilePasses(PassManager &PM) {
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
}
static void
translate_declaration(llvm::Module *module,
Storage *storage,
struct tgsi_full_declaration *decl,
struct tgsi_full_declaration *fd)
{
if (decl->Declaration.File == TGSI_FILE_TEMPORARY) {
switch( decl->Declaration.Declare ) {
case TGSI_DECLARE_RANGE: {
int start = decl->u.DeclarationRange.First;
int end = decl->u.DeclarationRange.Last;
for (int i = start; i <= end; ++i) {
storage->declareTemp(i);
}
}
break;
default:
assert( 0 );
}
}
}
static void
translate_immediate(llvm::Module *module,
struct tgsi_full_immediate *imm)
{
}
static void
translate_instruction(llvm::Module *module,
Storage *storage,
Instructions *instr,
struct tgsi_full_instruction *inst,
struct tgsi_full_instruction *fi,
unsigned instno)
{
llvm::Value *inputs[4];
inputs[0] = 0;
inputs[1] = 0;
inputs[2] = 0;
inputs[3] = 0;
for (int i = 0; i < inst->Instruction.NumSrcRegs; ++i) {
struct tgsi_full_src_register *src = &inst->FullSrcRegisters[i];
llvm::Value *val = 0;
llvm::Value *indIdx = 0;
if (src->SrcRegister.Indirect) {
indIdx = storage->addrElement(src->SrcRegisterInd.Index);
indIdx = storage->extractIndex(indIdx);
}
if (src->SrcRegister.File == TGSI_FILE_CONSTANT) {
val = storage->constElement(src->SrcRegister.Index, indIdx);
} else if (src->SrcRegister.File == TGSI_FILE_INPUT) {
val = storage->inputElement(src->SrcRegister.Index, indIdx);
} else if (src->SrcRegister.File == TGSI_FILE_TEMPORARY) {
val = storage->tempElement(src->SrcRegister.Index);
} else if (src->SrcRegister.File == TGSI_FILE_OUTPUT) {
val = storage->outputElement(src->SrcRegister.Index, indIdx);
} else {
fprintf(stderr, "ERROR: not supported llvm source %d\n", src->SrcRegister.File);
return;
}
int swizzle = 0;
int xstart = 1000;
const int NO_SWIZZLE = TGSI_SWIZZLE_X * 1000 + TGSI_SWIZZLE_Y * 100 +
TGSI_SWIZZLE_Z * 10 + TGSI_SWIZZLE_W;
for (int k = 0; k < 4; ++k) {
swizzle += tgsi_util_get_full_src_register_extswizzle(src, k) * xstart;
xstart /= 10;
}
if (swizzle != NO_SWIZZLE) {
/*fprintf(stderr, "XXXXXXXX swizzle = %d\n", swizzle);*/
val = storage->shuffleVector(val, swizzle);
}
inputs[i] = val;
}
/*if (inputs[0])
instr->printVector(inputs[0]);
if (inputs[1])
instr->printVector(inputs[1]);*/
llvm::Value *out = 0;
switch (inst->Instruction.Opcode) {
case TGSI_OPCODE_ARL: {
out = instr->arl(inputs[0]);
}
break;
case TGSI_OPCODE_MOV: {
out = inputs[0];
}
break;
case TGSI_OPCODE_LIT: {
out = instr->lit(inputs[0]);
}
break;
case TGSI_OPCODE_RCP: {
out = instr->rcp(inputs[0]);
}
break;
case TGSI_OPCODE_RSQ: {
out = instr->rsq(inputs[0]);
}
break;
case TGSI_OPCODE_EXP:
break;
case TGSI_OPCODE_LOG:
break;
case TGSI_OPCODE_MUL: {
out = instr->mul(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_ADD: {
out = instr->add(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_DP3: {
out = instr->dp3(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_DP4: {
out = instr->dp4(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_DST: {
out = instr->dst(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_MIN: {
out = instr->min(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_MAX: {
out = instr->max(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_SLT: {
out = instr->slt(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_SGE: {
out = instr->sge(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_MAD: {
out = instr->madd(inputs[0], inputs[1], inputs[2]);
}
break;
case TGSI_OPCODE_SUB: {
out = instr->sub(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_LERP: {
out = instr->lerp(inputs[0], inputs[1], inputs[2]);
}
break;
case TGSI_OPCODE_CND:
break;
case TGSI_OPCODE_CND0:
break;
case TGSI_OPCODE_DOT2ADD:
break;
case TGSI_OPCODE_INDEX:
break;
case TGSI_OPCODE_NEGATE:
break;
case TGSI_OPCODE_FRAC: {
out = instr->frc(inputs[0]);
}
break;
case TGSI_OPCODE_CLAMP:
break;
case TGSI_OPCODE_FLOOR: {
out = instr->floor(inputs[0]);
}
break;
case TGSI_OPCODE_ROUND:
break;
case TGSI_OPCODE_EXPBASE2: {
out = instr->ex2(inputs[0]);
}
break;
case TGSI_OPCODE_LOGBASE2: {
out = instr->lg2(inputs[0]);
}
break;
case TGSI_OPCODE_POWER: {
out = instr->pow(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_CROSSPRODUCT: {
out = instr->cross(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_MULTIPLYMATRIX:
break;
case TGSI_OPCODE_ABS: {
out = instr->abs(inputs[0]);
}
break;
case TGSI_OPCODE_RCC:
break;
case TGSI_OPCODE_DPH: {
out = instr->dph(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_COS:
break;
case TGSI_OPCODE_DDX:
break;
case TGSI_OPCODE_DDY:
break;
case TGSI_OPCODE_KILP:
break;
case TGSI_OPCODE_PK2H:
break;
case TGSI_OPCODE_PK2US:
break;
case TGSI_OPCODE_PK4B:
break;
case TGSI_OPCODE_PK4UB:
break;
case TGSI_OPCODE_RFL:
break;
case TGSI_OPCODE_SEQ:
break;
case TGSI_OPCODE_SFL:
break;
case TGSI_OPCODE_SGT: {
out = instr->sgt(inputs[0], inputs[1]);
}
break;
case TGSI_OPCODE_SIN:
break;
case TGSI_OPCODE_SLE:
break;
case TGSI_OPCODE_SNE:
break;
case TGSI_OPCODE_STR:
break;
case TGSI_OPCODE_TEX:
break;
case TGSI_OPCODE_TXD:
break;
case TGSI_OPCODE_TXP:
break;
case TGSI_OPCODE_UP2H:
break;
case TGSI_OPCODE_UP2US:
break;
case TGSI_OPCODE_UP4B:
break;
case TGSI_OPCODE_UP4UB:
break;
case TGSI_OPCODE_X2D:
break;
case TGSI_OPCODE_ARA:
break;
case TGSI_OPCODE_ARR:
break;
case TGSI_OPCODE_BRA:
break;
case TGSI_OPCODE_CAL: {
instr->cal(inst->InstructionExtLabel.Label,
storage->outputPtr(),
storage->inputPtr(),
storage->constPtr());
return;
}
break;
case TGSI_OPCODE_RET: {
instr->end();
return;
}
break;
case TGSI_OPCODE_SSG:
break;
case TGSI_OPCODE_CMP:
break;
case TGSI_OPCODE_SCS:
break;
case TGSI_OPCODE_TXB:
break;
case TGSI_OPCODE_NRM:
break;
case TGSI_OPCODE_DIV:
break;
case TGSI_OPCODE_DP2:
break;
case TGSI_OPCODE_TXL:
break;
case TGSI_OPCODE_BRK: {
instr->brk();
return;
}
break;
case TGSI_OPCODE_IF: {
instr->ifop(inputs[0]);
storage->setCurrentBlock(instr->currentBlock());
return; //just update the state
}
break;
case TGSI_OPCODE_LOOP:
break;
case TGSI_OPCODE_REP:
break;
case TGSI_OPCODE_ELSE: {
instr->elseop();
storage->setCurrentBlock(instr->currentBlock());
return; //only state update
}
break;
case TGSI_OPCODE_ENDIF: {
instr->endif();
storage->setCurrentBlock(instr->currentBlock());
return; //just update the state
}
break;
case TGSI_OPCODE_ENDLOOP:
break;
case TGSI_OPCODE_ENDREP:
break;
case TGSI_OPCODE_PUSHA:
break;
case TGSI_OPCODE_POPA:
break;
case TGSI_OPCODE_CEIL:
break;
case TGSI_OPCODE_I2F:
break;
case TGSI_OPCODE_NOT:
break;
case TGSI_OPCODE_TRUNC: {
out = instr->trunc(inputs[0]);
}
break;
case TGSI_OPCODE_SHL:
break;
case TGSI_OPCODE_SHR:
break;
case TGSI_OPCODE_AND:
break;
case TGSI_OPCODE_OR:
break;
case TGSI_OPCODE_MOD:
break;
case TGSI_OPCODE_XOR:
break;
case TGSI_OPCODE_SAD:
break;
case TGSI_OPCODE_TXF:
break;
case TGSI_OPCODE_TXQ:
break;
case TGSI_OPCODE_CONT:
break;
case TGSI_OPCODE_EMIT:
break;
case TGSI_OPCODE_ENDPRIM:
break;
case TGSI_OPCODE_BGNLOOP2: {
instr->beginLoop();
storage->setCurrentBlock(instr->currentBlock());
return;
}
break;
case TGSI_OPCODE_BGNSUB: {
instr->bgnSub(instno, storage);
storage->setCurrentBlock(instr->currentBlock());
storage->pushTemps();
return;
}
break;
case TGSI_OPCODE_ENDLOOP2: {
instr->endLoop();
storage->setCurrentBlock(instr->currentBlock());
return;
}
break;
case TGSI_OPCODE_ENDSUB: {
instr->endSub();
storage->setCurrentBlock(instr->currentBlock());
storage->popArguments();
storage->popTemps();
return;
}
break;
case TGSI_OPCODE_NOISE1:
break;
case TGSI_OPCODE_NOISE2:
break;
case TGSI_OPCODE_NOISE3:
break;
case TGSI_OPCODE_NOISE4:
break;
case TGSI_OPCODE_NOP:
break;
case TGSI_OPCODE_TEXBEM:
break;
case TGSI_OPCODE_TEXBEML:
break;
case TGSI_OPCODE_TEXREG2AR:
break;
case TGSI_OPCODE_TEXM3X2PAD:
break;
case TGSI_OPCODE_TEXM3X2TEX:
break;
case TGSI_OPCODE_TEXM3X3PAD:
break;
case TGSI_OPCODE_TEXM3X3TEX:
break;
case TGSI_OPCODE_TEXM3X3SPEC:
break;
case TGSI_OPCODE_TEXM3X3VSPEC:
break;
case TGSI_OPCODE_TEXREG2GB:
break;
case TGSI_OPCODE_TEXREG2RGB:
break;
case TGSI_OPCODE_TEXDP3TEX:
break;
case TGSI_OPCODE_TEXDP3:
break;
case TGSI_OPCODE_TEXM3X3:
break;
case TGSI_OPCODE_TEXM3X2DEPTH:
break;
case TGSI_OPCODE_TEXDEPTH:
break;
case TGSI_OPCODE_BEM:
break;
case TGSI_OPCODE_M4X3:
break;
case TGSI_OPCODE_M3X4:
break;
case TGSI_OPCODE_M3X3:
break;
case TGSI_OPCODE_M3X2:
break;
case TGSI_OPCODE_NRM4:
break;
case TGSI_OPCODE_CALLNZ:
break;
case TGSI_OPCODE_IFC:
break;
case TGSI_OPCODE_BREAKC:
break;
case TGSI_OPCODE_KIL:
break;
case TGSI_OPCODE_END:
instr->end();
return;
break;
default:
fprintf(stderr, "ERROR: Unknown opcode %d\n",
inst->Instruction.Opcode);
assert(0);
break;
}
if (!out) {
fprintf(stderr, "ERROR: unsupported opcode %d\n",
inst->Instruction.Opcode);
assert(!"Unsupported opcode");
}
switch( inst->Instruction.Saturate ) {
case TGSI_SAT_NONE:
break;
case TGSI_SAT_ZERO_ONE:
/*TXT( "_SAT" );*/
break;
case TGSI_SAT_MINUS_PLUS_ONE:
/*TXT( "_SAT[-1,1]" );*/
break;
default:
assert( 0 );
}
for (int i = 0; i < inst->Instruction.NumDstRegs; ++i) {
struct tgsi_full_dst_register *dst = &inst->FullDstRegisters[i];
if (dst->DstRegister.File == TGSI_FILE_OUTPUT) {
storage->store(dst->DstRegister.Index, out, dst->DstRegister.WriteMask);
} else if (dst->DstRegister.File == TGSI_FILE_TEMPORARY) {
storage->setTempElement(dst->DstRegister.Index, out, dst->DstRegister.WriteMask);
} else if (dst->DstRegister.File == TGSI_FILE_ADDRESS) {
storage->setAddrElement(dst->DstRegister.Index, out, dst->DstRegister.WriteMask);
} else {
fprintf(stderr, "ERROR: unsupported LLVM destination!");
assert(!"wrong destination");
}
}
}
static llvm::Module *
tgsi_to_llvm(struct gallivm_prog *prog, const struct tgsi_token *tokens)
{
llvm::Module *mod = createBaseShader();
struct tgsi_parse_context parse;
struct tgsi_full_instruction fi;
struct tgsi_full_declaration fd;
unsigned instno = 0;
Function* shader = mod->getFunction("execute_shader");
std::ostringstream stream;
stream << "execute_shader";
stream << prog->id;
std::string func_name = stream.str();
shader->setName(func_name.c_str());
Function::arg_iterator args = shader->arg_begin();
Value *ptr_OUT = args++;
ptr_OUT->setName("OUT");
Value *ptr_IN = args++;
ptr_IN->setName("IN");
Value *ptr_CONST = args++;
ptr_CONST->setName("CONST");
BasicBlock *label_entry = new BasicBlock("entry", shader, 0);
tgsi_parse_init(&parse, tokens);
fi = tgsi_default_full_instruction();
fd = tgsi_default_full_declaration();
Storage storage(label_entry, ptr_OUT, ptr_IN, ptr_CONST);
Instructions instr(mod, shader, label_entry);
while(!tgsi_parse_end_of_tokens(&parse)) {
tgsi_parse_token(&parse);
switch (parse.FullToken.Token.Type) {
case TGSI_TOKEN_TYPE_DECLARATION:
translate_declaration(mod, &storage,
&parse.FullToken.FullDeclaration,
&fd);
break;
case TGSI_TOKEN_TYPE_IMMEDIATE:
translate_immediate(mod,
&parse.FullToken.FullImmediate);
break;
case TGSI_TOKEN_TYPE_INSTRUCTION:
translate_instruction(mod, &storage, &instr,
&parse.FullToken.FullInstruction,
&fi, instno);
++instno;
break;
default:
assert(0);
}
}
tgsi_parse_free(&parse);
prog->num_consts = storage.numConsts();
return mod;
}
/*!
Translates the TGSI tokens into LLVM format. Translated representation
is stored in the gallivm_prog and returned.
After calling this function the gallivm_prog can either be used with a custom
code generator to generate machine code for the GPU which the code generator
addresses or it can be jit compiled with gallivm_cpu_jit_compile and executed
with gallivm_prog_exec to run the module on the CPU.
*/
struct gallivm_prog *
gallivm_from_tgsi(const struct tgsi_token *tokens)
{
std::cout << "Creating llvm from: " <<std::endl;
++GLOBAL_ID;
struct gallivm_prog *gallivm =
(struct gallivm_prog *)calloc(1, sizeof(struct gallivm_prog));
gallivm->id = GLOBAL_ID;
tgsi_dump(tokens, 0);
llvm::Module *mod = tgsi_to_llvm(gallivm, tokens);
gallivm->module = mod;
gallivm_prog_dump(gallivm, 0);
/* Run optimization passes over it */
PassManager passes;
passes.add(new TargetData(mod));
AddStandardCompilePasses(passes);
passes.run(*mod);
gallivm->module = mod;
gallivm_prog_dump(gallivm, 0);
return gallivm;
}
void gallivm_prog_delete(struct gallivm_prog *prog)
{
llvm::Module *mod = static_cast<llvm::Module*>(prog->module);
delete mod;
prog->module = 0;
prog->function = 0;
free(prog);
}
typedef void (*vertex_shader_runner)(float (*ainputs)[PIPE_MAX_SHADER_INPUTS][4],
float (*dests)[PIPE_MAX_SHADER_INPUTS][4],
float (*aconsts)[4],
int num_vertices,
int num_inputs,
int num_attribs,
int num_consts);
/*!
This function is used to execute the gallivm_prog in software. Before calling
this function the gallivm_prog has to be JIT compiled with the gallivm_cpu_jit_compile
function.
*/
int gallivm_prog_exec(struct gallivm_prog *prog,
float (*inputs)[PIPE_MAX_SHADER_INPUTS][4],
float (*dests)[PIPE_MAX_SHADER_INPUTS][4],
float (*consts)[4],
int num_vertices,
int num_inputs,
int num_attribs)
{
vertex_shader_runner runner = reinterpret_cast<vertex_shader_runner>(prog->function);
assert(runner);
runner(inputs, dests, consts, num_vertices, num_inputs,
num_attribs, prog->num_consts);
return 0;
}
void gallivm_prog_dump(struct gallivm_prog *prog, const char *file_prefix)
{
llvm::Module *mod;
if (!prog || !prog->module)
return;
mod = static_cast<llvm::Module*>(prog->module);
if (file_prefix) {
std::ostringstream stream;
stream << file_prefix;
stream << prog->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 << (*mod);
out.close();
} else {
std::ostringstream stream;
stream << "execute_shader";
stream << prog->id;
std::string func_name = stream.str();
llvm::Function *func = mod->getFunction(func_name.c_str());
assert(func);
std::cout<<"; ---------- Start shader "<<prog->id<<std::endl;
std::cout<<*mod<<std::endl;
std::cout<<"; ---------- End shader "<<prog->id<<std::endl;
}
}
/*!
This function creates a CPU based execution engine for the given gallivm_prog.
gallivm_cpu_engine should be used as a singleton throughout the library. Before
executing gallivm_prog_exec one needs to call gallivm_cpu_jit_compile.
The gallivm_prog instance which is being passed to the constructor is being
automatically JIT compiled so one shouldn't call gallivm_cpu_jit_compile
with it again.
*/
struct gallivm_cpu_engine * gallivm_cpu_engine_create(struct gallivm_prog *prog)
{
struct gallivm_cpu_engine *cpu = (struct gallivm_cpu_engine *)
calloc(1, sizeof(struct gallivm_cpu_engine));
llvm::Module *mod = static_cast<llvm::Module*>(prog->module);
llvm::ExistingModuleProvider *mp = new llvm::ExistingModuleProvider(mod);
llvm::ExecutionEngine *ee = llvm::ExecutionEngine::create(mp, false);
cpu->engine = ee;
llvm::Function *func = mod->getFunction("run_vertex_shader");
prog->function = ee->getPointerToFunctionOrStub(func);
return cpu;
}
/*!
This function JIT compiles the given gallivm_prog with the given cpu based execution engine.
The reference to the generated machine code entry point will be stored
in the gallivm_prog program. After executing this function one can call gallivm_prog_exec
in order to execute the gallivm_prog on the CPU.
*/
void gallivm_cpu_jit_compile(struct gallivm_cpu_engine *cpu, struct gallivm_prog *prog)
{
llvm::Module *mod = static_cast<llvm::Module*>(prog->module);
llvm::ExistingModuleProvider *mp = new llvm::ExistingModuleProvider(mod);
llvm::ExecutionEngine *ee = cpu->engine;
assert(ee);
ee->addModuleProvider(mp);
llvm::Function *func = mod->getFunction("run_vertex_shader");
prog->function = ee->getPointerToFunctionOrStub(func);
}
void gallivm_cpu_engine_delete(struct gallivm_cpu_engine *cpu)
{
free(cpu);
}
#endif /* MESA_LLVM */
|