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
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
|
/*
* Copyright © 2017 Gert Wollny
*
* 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.
*/
#include "st_glsl_to_tgsi_temprename.h"
#include <tgsi/tgsi_info.h>
#include <tgsi/tgsi_strings.h>
#include <program/prog_instruction.h>
#include <limits>
#include <cstdlib>
/* std::sort is significantly faster than qsort */
#define USE_STL_SORT
#ifdef USE_STL_SORT
#include <algorithm>
#endif
#ifndef NDEBUG
#include <iostream>
#include <iomanip>
#include <program/prog_print.h>
#include <util/debug.h>
using std::cerr;
using std::setw;
#endif
/* If <windows.h> is included this is defined and clashes with
* std::numeric_limits<>::max()
*/
#ifdef max
#undef max
#endif
using std::numeric_limits;
/* Without c++11 define the nullptr for forward-compatibility
* and better readibility */
#if __cplusplus < 201103L
#define nullptr 0
#endif
#ifndef NDEBUG
/* Helper function to check whether we want to seen debugging output */
static inline bool is_debug_enabled ()
{
static int debug_enabled = -1;
if (debug_enabled < 0)
debug_enabled = env_var_as_boolean("GLSL_TO_TGSI_RENAME_DEBUG", false);
return debug_enabled > 0;
}
#define RENAME_DEBUG(X) if (is_debug_enabled()) do { X; } while (false);
#else
#define RENAME_DEBUG(X)
#endif
namespace {
enum prog_scope_type {
outer_scope, /* Outer program scope */
loop_body, /* Inside a loop */
if_branch, /* Inside if branch */
else_branch, /* Inside else branch */
switch_body, /* Inside switch statmenet */
switch_case_branch, /* Inside switch case statmenet */
switch_default_branch, /* Inside switch default statmenet */
undefined_scope
};
class prog_scope {
public:
prog_scope(prog_scope *parent, prog_scope_type type, int id,
int depth, int begin);
prog_scope_type type() const;
prog_scope *parent() const;
int nesting_depth() const;
int id() const;
int end() const;
int begin() const;
int loop_break_line() const;
const prog_scope *in_ifelse_scope() const;
const prog_scope *in_switchcase_scope() const;
const prog_scope *innermost_loop() const;
const prog_scope *outermost_loop() const;
const prog_scope *enclosing_conditional() const;
bool is_loop() const;
bool is_in_loop() const;
bool is_conditional() const;
bool break_is_for_switchcase() const;
bool contains_range_of(const prog_scope& other) const;
void set_end(int end);
void set_loop_break_line(int line);
private:
prog_scope_type scope_type;
int scope_id;
int scope_nesting_depth;
int scope_begin;
int scope_end;
int break_loop_line;
prog_scope *parent_scope;
};
/* Some storage class to encapsulate the prog_scope (de-)allocations */
class prog_scope_storage {
public:
prog_scope_storage(void *mem_ctx, int n);
~prog_scope_storage();
prog_scope * create(prog_scope *p, prog_scope_type type, int id,
int lvl, int s_begin);
private:
void *mem_ctx;
int current_slot;
prog_scope *storage;
};
class temp_comp_access {
public:
temp_comp_access();
void record_read(int line, prog_scope *scope);
void record_write(int line, prog_scope *scope);
lifetime get_required_lifetime();
private:
void propagate_lifetime_to_dominant_write_scope();
prog_scope *last_read_scope;
prog_scope *first_read_scope;
prog_scope *first_write_scope;
int first_write;
int last_read;
int last_write;
int first_read;
bool keep_for_full_loop;
};
class temp_access {
public:
temp_access();
void record_read(int line, prog_scope *scope, int swizzle);
void record_write(int line, prog_scope *scope, int writemask);
lifetime get_required_lifetime();
private:
void update_access_mask(int mask);
temp_comp_access comp[4];
int access_mask;
bool needs_component_tracking;
};
prog_scope_storage::prog_scope_storage(void *mc, int n):
mem_ctx(mc),
current_slot(0)
{
storage = ralloc_array(mem_ctx, prog_scope, n);
}
prog_scope_storage::~prog_scope_storage()
{
ralloc_free(storage);
}
prog_scope*
prog_scope_storage::create(prog_scope *p, prog_scope_type type, int id,
int lvl, int s_begin)
{
storage[current_slot] = prog_scope(p, type, id, lvl, s_begin);
return &storage[current_slot++];
}
prog_scope::prog_scope(prog_scope *parent, prog_scope_type type, int id,
int depth, int scope_begin):
scope_type(type),
scope_id(id),
scope_nesting_depth(depth),
scope_begin(scope_begin),
scope_end(-1),
break_loop_line(numeric_limits<int>::max()),
parent_scope(parent)
{
}
prog_scope_type prog_scope::type() const
{
return scope_type;
}
prog_scope *prog_scope::parent() const
{
return parent_scope;
}
int prog_scope::nesting_depth() const
{
return scope_nesting_depth;
}
bool prog_scope::is_loop() const
{
return (scope_type == loop_body);
}
bool prog_scope::is_in_loop() const
{
if (scope_type == loop_body)
return true;
if (parent_scope)
return parent_scope->is_in_loop();
return false;
}
const prog_scope *prog_scope::innermost_loop() const
{
if (scope_type == loop_body)
return this;
if (parent_scope)
return parent_scope->innermost_loop();
return nullptr;
}
const prog_scope *prog_scope::outermost_loop() const
{
const prog_scope *loop = nullptr;
const prog_scope *p = this;
do {
if (p->type() == loop_body)
loop = p;
p = p->parent();
} while (p);
return loop;
}
const prog_scope *prog_scope::enclosing_conditional() const
{
if (is_conditional())
return this;
if (parent_scope)
return parent_scope->enclosing_conditional();
return nullptr;
}
bool prog_scope::contains_range_of(const prog_scope& other) const
{
return (begin() <= other.begin()) && (end() >= other.end());
}
bool prog_scope::is_conditional() const
{
return scope_type == if_branch ||
scope_type == else_branch ||
scope_type == switch_case_branch ||
scope_type == switch_default_branch;
}
const prog_scope *prog_scope::in_ifelse_scope() const
{
if (scope_type == if_branch ||
scope_type == else_branch)
return this;
if (parent_scope)
return parent_scope->in_ifelse_scope();
return nullptr;
}
const prog_scope *prog_scope::in_switchcase_scope() const
{
if (scope_type == switch_case_branch ||
scope_type == switch_default_branch)
return this;
if (parent_scope)
return parent_scope->in_switchcase_scope();
return nullptr;
}
bool prog_scope::break_is_for_switchcase() const
{
if (scope_type == loop_body)
return false;
if (scope_type == switch_case_branch ||
scope_type == switch_default_branch ||
scope_type == switch_body)
return true;
if (parent_scope)
return parent_scope->break_is_for_switchcase();
return false;
}
int prog_scope::id() const
{
return scope_id;
}
int prog_scope::begin() const
{
return scope_begin;
}
int prog_scope::end() const
{
return scope_end;
}
void prog_scope::set_end(int end)
{
if (scope_end == -1)
scope_end = end;
}
void prog_scope::set_loop_break_line(int line)
{
if (scope_type == loop_body) {
break_loop_line = MIN2(break_loop_line, line);
} else {
if (parent_scope)
parent()->set_loop_break_line(line);
}
}
int prog_scope::loop_break_line() const
{
return break_loop_line;
}
temp_access::temp_access():
access_mask(0),
needs_component_tracking(false)
{
}
void temp_access::update_access_mask(int mask)
{
if (access_mask && access_mask != mask)
needs_component_tracking = true;
access_mask |= mask;
}
void temp_access::record_write(int line, prog_scope *scope, int writemask)
{
update_access_mask(writemask);
if (writemask & WRITEMASK_X)
comp[0].record_write(line, scope);
if (writemask & WRITEMASK_Y)
comp[1].record_write(line, scope);
if (writemask & WRITEMASK_Z)
comp[2].record_write(line, scope);
if (writemask & WRITEMASK_W)
comp[3].record_write(line, scope);
}
void temp_access::record_read(int line, prog_scope *scope, int swizzle)
{
int readmask = 0;
for (int idx = 0; idx < 4; ++idx) {
int swz = GET_SWZ(swizzle, idx);
readmask |= (1 << swz) & 0xF;
}
update_access_mask(readmask);
if (readmask & WRITEMASK_X)
comp[0].record_read(line, scope);
if (readmask & WRITEMASK_Y)
comp[1].record_read(line, scope);
if (readmask & WRITEMASK_Z)
comp[2].record_read(line, scope);
if (readmask & WRITEMASK_W)
comp[3].record_read(line, scope);
}
inline static lifetime make_lifetime(int b, int e)
{
lifetime lt;
lt.begin = b;
lt.end = e;
return lt;
}
lifetime temp_access::get_required_lifetime()
{
lifetime result = make_lifetime(-1, -1);
unsigned mask = access_mask;
while (mask) {
unsigned chan = u_bit_scan(&mask);
lifetime lt = comp[chan].get_required_lifetime();
if (lt.begin >= 0) {
if ((result.begin < 0) || (result.begin > lt.begin))
result.begin = lt.begin;
}
if (lt.end > result.end)
result.end = lt.end;
if (!needs_component_tracking)
break;
}
return result;
}
temp_comp_access::temp_comp_access():
last_read_scope(nullptr),
first_read_scope(nullptr),
first_write_scope(nullptr),
first_write(-1),
last_read(-1),
last_write(-1),
first_read(numeric_limits<int>::max())
{
}
void temp_comp_access::record_read(int line, prog_scope *scope)
{
last_read_scope = scope;
last_read = line;
if (first_read > line) {
first_read = line;
first_read_scope = scope;
}
}
void temp_comp_access::record_write(int line, prog_scope *scope)
{
last_write = line;
if (first_write < 0) {
first_write = line;
first_write_scope = scope;
}
}
void temp_comp_access::propagate_lifetime_to_dominant_write_scope()
{
first_write = first_write_scope->begin();
int lr = first_write_scope->end();
if (last_read < lr)
last_read = lr;
}
lifetime temp_comp_access::get_required_lifetime()
{
bool keep_for_full_loop = false;
/* This register component is not used at all, or only read,
* mark it as unused and ignore it when renaming.
* glsl_to_tgsi_visitor::renumber_registers will take care of
* eliminating registers that are not written to.
*/
if (last_write < 0)
return make_lifetime(-1, -1);
assert(first_write_scope);
/* Only written to, just make sure the register component is not
* reused in the range it is used to write to
*/
if (!last_read_scope)
return make_lifetime(first_write, last_write + 1);
const prog_scope *enclosing_scope_first_read = first_read_scope;
const prog_scope *enclosing_scope_first_write = first_write_scope;
/* We read before writing in a loop
* hence the value must survive the loops
*/
if ((first_read <= first_write) &&
first_read_scope->is_in_loop()) {
keep_for_full_loop = true;
enclosing_scope_first_read = first_read_scope->outermost_loop();
}
/* A conditional write within a nested loop must survive
* the outermost loop, but only if it is read outside
* the condition scope where we write.
*/
const prog_scope *conditional = enclosing_scope_first_write->enclosing_conditional();
if (conditional && conditional->is_in_loop() &&
!conditional->contains_range_of(*last_read_scope)) {
keep_for_full_loop = true;
enclosing_scope_first_write = conditional->outermost_loop();
}
/* Evaluate the scope that is shared by all: required first write scope,
* required first read before write scope, and last read scope.
*/
const prog_scope *enclosing_scope = enclosing_scope_first_read;
if (enclosing_scope_first_write->contains_range_of(*enclosing_scope))
enclosing_scope = enclosing_scope_first_write;
if (last_read_scope->contains_range_of(*enclosing_scope))
enclosing_scope = last_read_scope;
while (!enclosing_scope->contains_range_of(*enclosing_scope_first_write) ||
!enclosing_scope->contains_range_of(*last_read_scope)) {
enclosing_scope = enclosing_scope->parent();
assert(enclosing_scope);
}
/* Propagate the last read scope to the target scope */
while (enclosing_scope->nesting_depth() < last_read_scope->nesting_depth()) {
/* If the read is in a loop and we have to move up the scope we need to
* extend the life time to the end of this current loop because at this
* point we don't know whether the component was written before
* un-conditionally in the same loop.
*/
if (last_read_scope->is_loop())
last_read = last_read_scope->end();
last_read_scope = last_read_scope->parent();
}
/* If the variable has to be kept for the whole loop, and we
* are currently in a loop, then propagate the life time.
*/
if (keep_for_full_loop && first_write_scope->is_loop())
propagate_lifetime_to_dominant_write_scope();
/* Propagate the first_dominant_write scope to the target scope */
while (enclosing_scope->nesting_depth() < first_write_scope->nesting_depth()) {
/* Propagate lifetime if there was a break in a loop and the write was
* after the break inside that loop. Note, that this is only needed if
* we move up in the scopes.
*/
if (first_write_scope->loop_break_line() < first_write) {
keep_for_full_loop = true;
propagate_lifetime_to_dominant_write_scope();
}
first_write_scope = first_write_scope->parent();
/* Propagte lifetime if we are now in a loop */
if (keep_for_full_loop && first_write_scope->is_loop())
propagate_lifetime_to_dominant_write_scope();
}
/* The last write past the last read is dead code, but we have to
* ensure that the component is not reused too early, hence extend the
* lifetime past the last write.
*/
if (last_write >= last_read)
last_read = last_write + 1;
/* Here we are at the same scope, all is resolved */
return make_lifetime(first_write, last_read);
}
/* Helper class for sorting and searching the registers based
* on life times. */
class access_record {
public:
int begin;
int end;
int reg;
bool erase;
bool operator < (const access_record& rhs) const {
return begin < rhs.begin;
}
};
}
#ifndef NDEBUG
/* Function used for debugging. */
static void dump_instruction(int line, prog_scope *scope,
const glsl_to_tgsi_instruction& inst);
#endif
/* Scan the program and estimate the required register life times.
* The array lifetimes must be pre-allocated
*/
bool
get_temp_registers_required_lifetimes(void *mem_ctx, exec_list *instructions,
int ntemps, struct lifetime *lifetimes)
{
int line = 0;
int loop_id = 0;
int if_id = 0;
int switch_id = 0;
bool is_at_end = false;
bool ok = true;
int n_scopes = 1;
/* Count scopes to allocate the needed space without the need for
* re-allocation
*/
foreach_in_list(glsl_to_tgsi_instruction, inst, instructions) {
if (inst->op == TGSI_OPCODE_BGNLOOP ||
inst->op == TGSI_OPCODE_SWITCH ||
inst->op == TGSI_OPCODE_CASE ||
inst->op == TGSI_OPCODE_IF ||
inst->op == TGSI_OPCODE_UIF ||
inst->op == TGSI_OPCODE_ELSE ||
inst->op == TGSI_OPCODE_DEFAULT)
++n_scopes;
}
prog_scope_storage scopes(mem_ctx, n_scopes);
temp_access *acc = new temp_access[ntemps];
prog_scope *cur_scope = scopes.create(nullptr, outer_scope, 0, 0, line);
RENAME_DEBUG(cerr << "========= Begin shader ============\n");
foreach_in_list(glsl_to_tgsi_instruction, inst, instructions) {
if (is_at_end) {
assert(!"GLSL_TO_TGSI: shader has instructions past end marker");
break;
}
RENAME_DEBUG(dump_instruction(line, cur_scope, *inst));
switch (inst->op) {
case TGSI_OPCODE_BGNLOOP: {
cur_scope = scopes.create(cur_scope, loop_body, loop_id++,
cur_scope->nesting_depth() + 1, line);
break;
}
case TGSI_OPCODE_ENDLOOP: {
cur_scope->set_end(line);
cur_scope = cur_scope->parent();
assert(cur_scope);
break;
}
case TGSI_OPCODE_IF:
case TGSI_OPCODE_UIF: {
assert(num_inst_src_regs(inst) == 1);
const st_src_reg& src = inst->src[0];
if (src.file == PROGRAM_TEMPORARY)
acc[src.index].record_read(line, cur_scope, src.swizzle);
cur_scope = scopes.create(cur_scope, if_branch, if_id++,
cur_scope->nesting_depth() + 1, line + 1);
break;
}
case TGSI_OPCODE_ELSE: {
assert(cur_scope->type() == if_branch);
cur_scope->set_end(line - 1);
cur_scope = scopes.create(cur_scope->parent(), else_branch,
cur_scope->id(), cur_scope->nesting_depth(),
line + 1);
break;
}
case TGSI_OPCODE_END: {
cur_scope->set_end(line);
is_at_end = true;
break;
}
case TGSI_OPCODE_ENDIF: {
cur_scope->set_end(line - 1);
cur_scope = cur_scope->parent();
assert(cur_scope);
break;
}
case TGSI_OPCODE_SWITCH: {
assert(num_inst_src_regs(inst) == 1);
const st_src_reg& src = inst->src[0];
prog_scope *scope = scopes.create(cur_scope, switch_body, switch_id++,
cur_scope->nesting_depth() + 1, line);
/* We record the read only for the SWITCH statement itself, like it
* is used by the only consumer of TGSI_OPCODE_SWITCH in tgsi_exec.c.
*/
if (src.file == PROGRAM_TEMPORARY)
acc[src.index].record_read(line, cur_scope, src.swizzle);
cur_scope = scope;
break;
}
case TGSI_OPCODE_ENDSWITCH: {
cur_scope->set_end(line - 1);
/* Remove the case level, it might not have been
* closed with a break.
*/
if (cur_scope->type() != switch_body)
cur_scope = cur_scope->parent();
cur_scope = cur_scope->parent();
assert(cur_scope);
break;
}
case TGSI_OPCODE_CASE: {
/* Take care of tracking the registers. */
prog_scope *switch_scope = cur_scope->type() == switch_body ?
cur_scope : cur_scope->parent();
assert(num_inst_src_regs(inst) == 1);
const st_src_reg& src = inst->src[0];
if (src.file == PROGRAM_TEMPORARY)
acc[src.index].record_read(line, switch_scope, src.swizzle);
/* Fall through to allocate the scope. */
}
case TGSI_OPCODE_DEFAULT: {
prog_scope_type t = inst->op == TGSI_OPCODE_CASE ? switch_case_branch
: switch_default_branch;
prog_scope *switch_scope = (cur_scope->type() == switch_body) ?
cur_scope : cur_scope->parent();
assert(switch_scope->type() == switch_body);
prog_scope *scope = scopes.create(switch_scope, t,
switch_scope->id(),
switch_scope->nesting_depth() + 1,
line);
/* Previous case falls through, so scope was not yet closed. */
if ((cur_scope != switch_scope) && (cur_scope->end() == -1))
cur_scope->set_end(line - 1);
cur_scope = scope;
break;
}
case TGSI_OPCODE_BRK: {
if (cur_scope->break_is_for_switchcase()) {
cur_scope->set_end(line - 1);
} else {
cur_scope->set_loop_break_line(line);
}
break;
}
case TGSI_OPCODE_CAL:
case TGSI_OPCODE_RET:
/* These opcodes are not supported and if a subroutine would
* be called in a shader, then the lifetime tracking would have
* to follow that call to see which registers are used there.
* Since this is not done, we have to bail out here and signal
* that no register merge will take place.
*/
ok = false;
goto out;
default: {
for (unsigned j = 0; j < num_inst_src_regs(inst); j++) {
const st_src_reg& src = inst->src[j];
if (src.file == PROGRAM_TEMPORARY)
acc[src.index].record_read(line, cur_scope, src.swizzle);
}
for (unsigned j = 0; j < inst->tex_offset_num_offset; j++) {
const st_src_reg& src = inst->tex_offsets[j];
if (src.file == PROGRAM_TEMPORARY)
acc[src.index].record_read(line, cur_scope, src.swizzle);
}
for (unsigned j = 0; j < num_inst_dst_regs(inst); j++) {
const st_dst_reg& dst = inst->dst[j];
if (dst.file == PROGRAM_TEMPORARY)
acc[dst.index].record_write(line, cur_scope, dst.writemask);
}
}
}
++line;
}
RENAME_DEBUG(cerr << "==================================\n\n");
/* Make sure last scope is closed, even though no
* TGSI_OPCODE_END was given.
*/
if (cur_scope->end() < 0)
cur_scope->set_end(line - 1);
RENAME_DEBUG(cerr << "========= lifetimes ==============\n");
for(int i = 0; i < ntemps; ++i) {
RENAME_DEBUG(cerr << setw(4) << i);
lifetimes[i] = acc[i].get_required_lifetime();
RENAME_DEBUG(cerr << ": [" << lifetimes[i].begin << ", "
<< lifetimes[i].end << "]\n");
}
RENAME_DEBUG(cerr << "==================================\n\n");
out:
delete[] acc;
return ok;
}
/* Find the next register between [start, end) that has a life time starting
* at or after bound by using a binary search.
* start points at the beginning of the search range,
* end points at the element past the end of the search range, and
* the array comprising [start, end) must be sorted in ascending order.
*/
static access_record*
find_next_rename(access_record* start, access_record* end, int bound)
{
int delta = (end - start);
while (delta > 0) {
int half = delta >> 1;
access_record* middle = start + half;
if (bound <= middle->begin) {
delta = half;
} else {
start = middle;
++start;
delta -= half + 1;
}
}
return start;
}
#ifndef USE_STL_SORT
static int access_record_compare (const void *a, const void *b) {
const access_record *aa = static_cast<const access_record*>(a);
const access_record *bb = static_cast<const access_record*>(b);
return aa->begin < bb->begin ? -1 : (aa->begin > bb->begin ? 1 : 0);
}
#endif
/* This functions evaluates the register merges by using a binary
* search to find suitable merge candidates. */
void get_temp_registers_remapping(void *mem_ctx, int ntemps,
const struct lifetime* lifetimes,
struct rename_reg_pair *result)
{
access_record *reg_access = ralloc_array(mem_ctx, access_record, ntemps);
int used_temps = 0;
for (int i = 0; i < ntemps; ++i) {
if (lifetimes[i].begin >= 0) {
reg_access[used_temps].begin = lifetimes[i].begin;
reg_access[used_temps].end = lifetimes[i].end;
reg_access[used_temps].reg = i;
reg_access[used_temps].erase = false;
++used_temps;
}
}
#ifdef USE_STL_SORT
std::sort(reg_access, reg_access + used_temps);
#else
std::qsort(reg_access, used_temps, sizeof(access_record), access_record_compare);
#endif
access_record *trgt = reg_access;
access_record *reg_access_end = reg_access + used_temps;
access_record *first_erase = reg_access_end;
access_record *search_start = trgt + 1;
while (trgt != reg_access_end) {
access_record *src = find_next_rename(search_start, reg_access_end,
trgt->end);
if (src != reg_access_end) {
result[src->reg].new_reg = trgt->reg;
result[src->reg].valid = true;
trgt->end = src->end;
/* Since we only search forward, don't remove the renamed
* register just now, only mark it. */
src->erase = true;
if (first_erase == reg_access_end)
first_erase = src;
search_start = src + 1;
} else {
/* Moving to the next target register it is time to remove
* the already merged registers from the search range */
if (first_erase != reg_access_end) {
access_record *outp = first_erase;
access_record *inp = first_erase + 1;
while (inp != reg_access_end) {
if (!inp->erase)
*outp++ = *inp;
++inp;
}
reg_access_end = outp;
first_erase = reg_access_end;
}
++trgt;
search_start = trgt + 1;
}
}
ralloc_free(reg_access);
}
/* Code below used for debugging */
#ifndef NDEBUG
static const char swizzle_txt[] = "xyzw";
static const char *tgsi_file_names[PROGRAM_FILE_MAX] = {
"TEMP", "ARRAY", "IN", "OUT", "STATE", "CONST",
"UNIFORM", "WO", "ADDR", "SAMPLER", "SV", "UNDEF",
"IMM", "BUF", "MEM", "IMAGE"
};
static
void dump_instruction(int line, prog_scope *scope,
const glsl_to_tgsi_instruction& inst)
{
const struct tgsi_opcode_info *info = tgsi_get_opcode_info(inst.op);
int indent = scope->nesting_depth();
if ((scope->type() == switch_case_branch ||
scope->type() == switch_default_branch) &&
(info->opcode == TGSI_OPCODE_CASE ||
info->opcode == TGSI_OPCODE_DEFAULT))
--indent;
if (info->opcode == TGSI_OPCODE_ENDIF ||
info->opcode == TGSI_OPCODE_ELSE ||
info->opcode == TGSI_OPCODE_ENDLOOP ||
info->opcode == TGSI_OPCODE_ENDSWITCH)
--indent;
cerr << setw(4) << line << ": ";
for (int i = 0; i < indent; ++i)
cerr << " ";
cerr << tgsi_get_opcode_name(info->opcode) << " ";
bool has_operators = false;
for (unsigned j = 0; j < num_inst_dst_regs(&inst); j++) {
has_operators = true;
if (j > 0)
cerr << ", ";
const st_dst_reg& dst = inst.dst[j];
cerr << tgsi_file_names[dst.file];
if (dst.file == PROGRAM_ARRAY)
cerr << "(" << dst.array_id << ")";
cerr << "[" << dst.index << "]";
if (dst.writemask != TGSI_WRITEMASK_XYZW) {
cerr << ".";
if (dst.writemask & TGSI_WRITEMASK_X) cerr << "x";
if (dst.writemask & TGSI_WRITEMASK_Y) cerr << "y";
if (dst.writemask & TGSI_WRITEMASK_Z) cerr << "z";
if (dst.writemask & TGSI_WRITEMASK_W) cerr << "w";
}
}
if (has_operators)
cerr << " := ";
for (unsigned j = 0; j < num_inst_src_regs(&inst); j++) {
if (j > 0)
cerr << ", ";
const st_src_reg& src = inst.src[j];
cerr << tgsi_file_names[src.file]
<< "[" << src.index << "]";
if (src.swizzle != SWIZZLE_XYZW) {
cerr << ".";
for (int idx = 0; idx < 4; ++idx) {
int swz = GET_SWZ(src.swizzle, idx);
if (swz < 4) {
cerr << swizzle_txt[swz];
}
}
}
}
if (inst.tex_offset_num_offset > 0) {
cerr << ", TEXOFS: ";
for (unsigned j = 0; j < inst.tex_offset_num_offset; j++) {
if (j > 0)
cerr << ", ";
const st_src_reg& src = inst.tex_offsets[j];
cerr << tgsi_file_names[src.file]
<< "[" << src.index << "]";
if (src.swizzle != SWIZZLE_XYZW) {
cerr << ".";
for (int idx = 0; idx < 4; ++idx) {
int swz = GET_SWZ(src.swizzle, idx);
if (swz < 4) {
cerr << swizzle_txt[swz];
}
}
}
}
}
cerr << "\n";
}
#endif
|