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
|
{
Copyright (c) 1998-2002 by Florian Klaempfl
Helper routines for register allocator
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 rgbase;
{$i fpcdefs.inc}
interface
uses
cpuBase,cgBase;
type
TRegNameTable = array[tregisterindex] of string[7];
TRegisterIndexTable = array[tregisterindex] of tregisterindex;
function findreg_by_number_table(r:Tregister;const regnumber_index:TRegisterIndexTable):tregisterindex;
function findreg_by_name_table(const s:string;const regname_table:TRegNameTable;const regname_index:TRegisterIndexTable):byte;
implementation
function findreg_by_name_table(const s:string;const regname_table:TRegNameTable;const regname_index:TRegisterIndexTable):byte;
var
i,p,q : tregisterindex;
begin
p:=Low(tregisterindex);
q:=high(tregisterindex);
repeat
i:=(p+q) shr 1;
if s>regname_table[regname_index[i]] then
p:=i+1
else
q:=i;
until p=q;
if regname_table[regname_index[p]]=s then
result:=regname_index[p]
else
result:=0;
end;
function findreg_by_number_table(r:Tregister;const regnumber_index:TRegisterIndexTable):tregisterindex;
var
i,p,q : longint;
begin
p:=Low(tregisterindex);
q:=high(tregisterindex);
repeat
i:=(p+q) shr 1;
if r>regnumber_table[regnumber_index[i]] then
p:=i+1
else
q:=i;
until p=q;
if regnumber_table[regnumber_index[p]]=r then
result:=regnumber_index[p]
else
result:=0;
end;
end.
|
