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
|
{
Copyright (c) 1998-2004 by Florian Klaempfl and David Zhang
Generate MIPSEL assembler for in set/case nodes
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
****************************************************************************
}
unit ncpuset;
{$i fpcdefs.inc}
interface
uses
globtype,
nset,
ncgset;
type
tcpucasenode = class(tcgcasenode)
protected
procedure optimizevalues(var max_linear_list: aint; var max_dist: aword); override;
function has_jumptable: boolean; override;
procedure genjumptable(hp: pcaselabel; min_, max_: aint); override;
end;
implementation
uses
globals,
systems,
constexp,
cpubase,
aasmbase, aasmtai, aasmcpu, aasmdata,
cgbase, cgutils, cgobj,
procinfo;
procedure tcpucasenode.optimizevalues(var max_linear_list: aint; var max_dist: aword);
begin
{ give the jump table a higher priority }
max_dist := (max_dist * 3) div 2;
end;
function tcpucasenode.has_jumptable: boolean;
begin
has_jumptable := True;
end;
procedure tcpucasenode.genjumptable(hp: pcaselabel; min_, max_: aint);
var
table: tasmlabel;
last: TConstExprInt;
indexreg, jmpreg, basereg: tregister;
href: treference;
jumpsegment: TAsmlist;
procedure genitem(t: pcaselabel);
var
i: aint;
begin
if assigned(t^.less) then
genitem(t^.less);
{ fill possible hole }
for i := last.svalue+1 to t^._low.svalue-1 do
jumpSegment.concat(Tai_const.Create_sym(elselabel));
for i := t^._low.svalue to t^._high.svalue do
jumpSegment.concat(Tai_const.Create_sym(blocklabel(t^.blockid)));
last := t^._high;
if assigned(t^.greater) then
genitem(t^.greater);
end;
begin
jumpsegment := current_procinfo.aktlocaldata;
if not (jumptable_no_range) then
begin
{ case expr less than min_ => goto elselabel }
cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, opsize, jmp_lt, aint(min_), hregister, elselabel);
{ case expr greater than max_ => goto elselabel }
cg.a_cmp_const_reg_label(current_asmdata.CurrAsmList, opsize, jmp_gt, aint(max_), hregister, elselabel);
end;
current_asmdata.getjumplabel(table);
indexreg := cg.getaddressregister(current_asmdata.CurrAsmList);
cg.a_op_const_reg_reg(current_asmdata.CurrAsmList, OP_SHL, OS_ADDR, 2, hregister, indexreg);
{ create reference }
reference_reset_symbol(href, table, 0, sizeof(aint));
href.offset := (-aint(min_)) * 4;
basereg := cg.getaddressregister(current_asmdata.CurrAsmList);
cg.a_loadaddr_ref_reg(current_asmdata.CurrAsmList, href, basereg);
jmpreg := cg.getaddressregister(current_asmdata.CurrAsmList);
reference_reset(href, sizeof(aint));
href.index := indexreg;
href.base := basereg;
cg.a_load_ref_reg(current_asmdata.CurrAsmList, OS_ADDR, OS_ADDR, href, jmpreg);
current_asmdata.CurrAsmList.concat(taicpu.op_reg(A_JR, jmpreg));
{ Delay slot }
current_asmdata.CurrAsmList.concat(taicpu.op_none(A_NOP));
{ generate jump table }
if not(cs_opt_size in current_settings.optimizerswitches) then
jumpSegment.concat(Tai_Align.Create_Op(4, 0));
jumpSegment.concat(Tai_label.Create(table));
last := min_;
genitem(hp);
end;
begin
ccasenode := tcpucasenode;
end.
|
