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
|
{
Copyright (c) 1998-2002 by Florian Klaempfl
Generate PowerPC assembler for math 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 nppcmat;
{$I fpcdefs.inc}
interface
uses
node, nmat;
type
tppcmoddivnode = class(tmoddivnode)
function pass_1: tnode; override;
procedure pass_generate_code override;
end;
tppcshlshrnode = class(tshlshrnode)
procedure pass_generate_code override;
end;
tppcunaryminusnode = class(tunaryminusnode)
procedure pass_generate_code override;
end;
tppcnotnode = class(tnotnode)
procedure pass_generate_code override;
end;
implementation
uses
sysutils,
globtype, systems,constexp,
cutils, verbose, globals,
symconst, symdef,
aasmbase, aasmcpu, aasmtai,aasmdata,
defutil,
cgbase, cgutils, cgobj, pass_1, pass_2,
ncon, procinfo, nbas, nld, nadd,
cpubase, cpuinfo,
ncgutil, cgcpu, rgobj;
{*****************************************************************************
TPPCMODDIVNODE
*****************************************************************************}
function tppcmoddivnode.pass_1: tnode;
var
statementnode : tstatementnode;
temp_left, temp_right : ttempcreatenode;
left_copy, right_copy : tnode;
block : tblocknode;
begin
result := nil;
(*
// this code replaces all mod nodes by the equivalent div/mul/sub sequence
// on node level, which might be advantageous when doing CSE on that level
// However, optimal modulo code for some cases (in particular a 'x mod 2^n-1'
// operation) can not be expressed using nodes, so this is commented out for now
if (nodetype = modn) then begin
block := internalstatements(statementnode);
temp_left := ctempcreatenode.create(left.resultdef, left.resultdef.size, tt_persistent, true);
addstatement(statementnode, temp_left);
addstatement(statementnode, cassignmentnode.create(ctemprefnode.create(temp_left), left.getcopy));
if (right.nodetype <> ordconstn) then begin
// implementated optimization: use temps to store the right value, otherwise
// it is calculated twice when simply copying it which might result in side
// effects
temp_right := ctempcreatenode.create(right.resultdef, right.resultdef.size, tt_persistent, true);
addstatement(statementnode, temp_right);
addstatement(statementnode, cassignmentnode.create(ctemprefnode.create(temp_right), right.getcopy));
addstatement(statementnode, cassignmentnode.create(ctemprefnode.create(temp_left),
caddnode.create(subn, ctemprefnode.create(temp_left),
caddnode.create(muln, cmoddivnode.create(divn, ctemprefnode.create(temp_left), ctemprefnode.create(temp_right)),
ctemprefnode.create(temp_right)))));
addstatement(statementnode, ctempdeletenode.create(temp_right));
end else begin
// in case this is a modulo by a constant operation, do not use a temp for the
// right hand side, because otherwise the div optimization will not recognize this
// fact (and there is no constant propagator/recognizer in the compiler),
// resulting in suboptimal code.
addstatement(statementnode, cassignmentnode.create(ctemprefnode.create(temp_left),
caddnode.create(subn, ctemprefnode.create(temp_left),
caddnode.create(muln, cmoddivnode.create(divn, ctemprefnode.create(temp_left), right.getcopy),
right.getcopy))));
end;
addstatement(statementnode, ctempdeletenode.create_normal_temp(temp_left));
addstatement(statementnode, ctemprefnode.create(temp_left));
result := block;
end;
*)
if (not assigned(result)) then
result := inherited pass_1;
if not assigned(result) then
include(current_procinfo.flags, pi_do_call);
end;
procedure tppcmoddivnode.pass_generate_code;
const { signed overflow }
divops: array[boolean, boolean] of tasmop =
((A_DIVDU, A_DIVDU_),(A_DIVD, A_DIVDO_));
divcgops : array[boolean] of TOpCG = (OP_DIV, OP_IDIV);
zerocond: tasmcond = (dirhint: DH_Plus; simple: true; cond:C_NE; cr: RS_CR7);
tcgsize2native : array[OS_8..OS_S128] of tcgsize = (
OS_64, OS_64, OS_64, OS_64, OS_NO,
OS_S64, OS_S64, OS_S64, OS_S64, OS_NO
);
var
power : longint;
op : tasmop;
numerator, divider,
resultreg : tregister;
size : TCgSize;
hl : tasmlabel;
done: boolean;
procedure genOrdConstNodeMod;
var
modreg, maskreg, tempreg : tregister;
isNegPower : boolean;
begin
if (tordconstnode(right).value = 0) then begin
internalerror(2005061702);
end else if (abs(tordconstnode(right).value.svalue) = 1) then begin
{ x mod +/-1 is always zero }
cg.a_load_const_reg(current_asmdata.CurrAsmList, OS_INT, 0, resultreg);
end else if (ispowerof2(tordconstnode(right).value, power)) then begin
if (is_signed(right.resultdef)) then begin
tempreg := cg.getintregister(current_asmdata.CurrAsmList, OS_INT);
maskreg := cg.getintregister(current_asmdata.CurrAsmList, OS_INT);
modreg := cg.getintregister(current_asmdata.CurrAsmList, OS_INT);
cg.a_load_const_reg(current_asmdata.CurrAsmList, OS_INT, abs(tordconstnode(right).value.svalue)-1, modreg);
cg.a_op_const_reg_reg(current_asmdata.CurrAsmList, OP_SAR, OS_INT, 63, numerator, maskreg);
cg.a_op_reg_reg_reg(current_asmdata.CurrAsmList, OP_AND, OS_INT, numerator, modreg, tempreg);
current_asmdata.CurrAsmList.concat(taicpu.op_reg_reg_reg(A_ANDC, maskreg, maskreg, modreg));
current_asmdata.CurrAsmList.concat(taicpu.op_reg_reg_const(A_SUBFIC, modreg, tempreg, 0));
current_asmdata.CurrAsmList.concat(taicpu.op_reg_reg_reg(A_SUBFE, modreg, modreg, modreg));
cg.a_op_reg_reg_reg(current_asmdata.CurrAsmList, OP_AND, OS_INT, modreg, maskreg, maskreg);
cg.a_op_reg_reg_reg(current_asmdata.CurrAsmList, OP_OR, OS_INT, maskreg, tempreg, resultreg);
end else begin
cg.a_op_const_reg_reg(current_asmdata.CurrAsmList, OP_AND, OS_INT, tordconstnode(right).value-1, numerator,
resultreg);
end;
end else begin
cg.a_op_const_reg_reg(current_asmdata.CurrAsmList, divCgOps[is_signed(right.resultdef)], OS_INT,
tordconstnode(right).value, numerator, resultreg);
cg.a_op_const_reg_reg(current_asmdata.CurrAsmList, OP_MUL, OS_INT, tordconstnode(right).value.svalue, resultreg,
resultreg);
cg.a_op_reg_reg_reg(current_asmdata.CurrAsmList, OP_SUB, OS_INT, resultreg, numerator, resultreg);
end;
end;
begin
secondpass(left);
secondpass(right);
location_copy(location,left.location);
{ put numerator in register }
size:=def_cgsize(left.resultdef);
location_force_reg(current_asmdata.CurrAsmList,left.location,
size,true);
location_copy(location,left.location);
numerator := location.register;
resultreg := location.register;
if (location.loc = LOC_CREGISTER) then begin
location.loc := LOC_REGISTER;
location.register := cg.getintregister(current_asmdata.CurrAsmList,size);
resultreg := location.register;
end else if (nodetype = modn) or (right.nodetype = ordconstn) then begin
{ for a modulus op, and for const nodes we need the result register
to be an extra register }
resultreg := cg.getintregister(current_asmdata.CurrAsmList,size);
end;
done := false;
if (cs_opt_level1 in current_settings.optimizerswitches) and (right.nodetype = ordconstn) then begin
if (nodetype = divn) then
cg.a_op_const_reg_reg(current_asmdata.CurrAsmList, divCgOps[is_signed(right.resultdef)],
size, tordconstnode(right).value, numerator, resultreg)
else
genOrdConstNodeMod;
done := true;
end;
if (not done) then begin
{ load divider in a register if necessary }
location_force_reg(current_asmdata.CurrAsmList,right.location,def_cgsize(right.resultdef),true);
if (right.nodetype <> ordconstn) then
current_asmdata.CurrAsmList.concat(taicpu.op_reg_reg_const(A_CMPDI, NR_CR7,
right.location.register, 0))
else begin
if (tordconstnode(right).value = 0) then
internalerror(2005100301);
end;
divider := right.location.register;
{ select the correct opcode according to the sign of the result, whether we need
overflow checking }
op := divops[is_signed(right.resultdef), cs_check_overflow in current_settings.localswitches];
current_asmdata.CurrAsmList.concat(taicpu.op_reg_reg_reg(op, resultreg, numerator,
divider));
if (nodetype = modn) then begin
{ multiply with the divisor again, taking care of the correct size }
current_asmdata.CurrAsmList.concat(taicpu.op_reg_reg_reg(A_MULLD,resultreg,
divider,resultreg));
current_asmdata.CurrAsmList.concat(taicpu.op_reg_reg_reg(A_SUB,location.register,
numerator,resultreg));
resultreg := location.register;
end;
end;
{ set result location }
location.loc:=LOC_REGISTER;
location.register:=resultreg;
if right.nodetype <> ordconstn then begin
current_asmdata.getjumplabel(hl);
current_asmdata.CurrAsmList.concat(taicpu.op_cond_sym(A_BC,zerocond,hl));
cg.a_call_name(current_asmdata.CurrAsmList,'FPC_DIVBYZERO',false);
cg.a_label(current_asmdata.CurrAsmList,hl);
end;
{ unsigned division/module can only overflow in case of division by zero
(but checking this overflow flag is more convoluted than performing a
simple comparison with 0) }
if is_signed(right.resultdef) then
cg.g_overflowcheck(current_asmdata.CurrAsmList,location,resultdef);
end;
{*****************************************************************************
TPPCSHLRSHRNODE
*****************************************************************************}
procedure tppcshlshrnode.pass_generate_code;
var
resultreg, hregister1, hregister2 : tregister;
op: topcg;
asmop1, asmop2: tasmop;
shiftval: aint;
begin
secondpass(left);
secondpass(right);
{ load left operators in a register }
location_force_reg(current_asmdata.CurrAsmList, left.location,
def_cgsize(left.resultdef), true);
location_copy(location, left.location);
resultreg := location.register;
hregister1 := location.register;
if (location.loc = LOC_CREGISTER) then begin
location.loc := LOC_REGISTER;
resultreg := cg.getintregister(current_asmdata.CurrAsmList, OS_INT);
location.register := resultreg;
end;
{ determine operator }
if nodetype = shln then
op := OP_SHL
else
op := OP_SHR;
{ shifting by a constant directly coded: }
if (right.nodetype = ordconstn) then begin
// result types with size < 32 bits have their shift values masked
// differently... :/
shiftval := tordconstnode(right).value and (tcgsize2size[def_cgsize(resultdef)] * 8 -1);
cg.a_op_const_reg_reg(current_asmdata.CurrAsmList, op, def_cgsize(resultdef),
shiftval, hregister1, resultreg)
end else begin
{ load shift count in a register if necessary }
location_force_reg(current_asmdata.CurrAsmList, right.location,
def_cgsize(right.resultdef), true);
hregister2 := right.location.register;
cg.a_op_reg_reg_reg(current_asmdata.CurrAsmList, op, def_cgsize(resultdef), hregister2,
hregister1, resultreg);
end;
end;
{*****************************************************************************
TPPCUNARYMINUSNODE
*****************************************************************************}
procedure tppcunaryminusnode.pass_generate_code;
var
src1: tregister;
op: tasmop;
begin
secondpass(left);
begin
if left.location.loc in [LOC_SUBSETREG,LOC_CSUBSETREG,LOC_SUBSETREF,LOC_CSUBSETREF] then
location_force_reg(current_asmdata.CurrAsmList,left.location,left.location.size,true);
location_copy(location, left.location);
location.loc := LOC_REGISTER;
case left.location.loc of
LOC_FPUREGISTER, LOC_REGISTER:
begin
src1 := left.location.register;
location.register := src1;
end;
LOC_CFPUREGISTER, LOC_CREGISTER:
begin
src1 := left.location.register;
if left.location.loc = LOC_CREGISTER then
location.register := cg.getintregister(current_asmdata.CurrAsmList, OS_INT)
else
location.register := cg.getfpuregister(current_asmdata.CurrAsmList, location.size);
end;
LOC_REFERENCE, LOC_CREFERENCE:
begin
if (left.resultdef.typ = floatdef) then begin
src1 := cg.getfpuregister(current_asmdata.CurrAsmList,
left.location.size);
location.register := src1;
cg.a_loadfpu_ref_reg(current_asmdata.CurrAsmList,
left.location.size,left.location.size,
left.location.reference, src1);
end else begin
src1 := cg.getintregister(current_asmdata.CurrAsmList, OS_64);
location.register := src1;
cg.a_load_ref_reg(current_asmdata.CurrAsmList, OS_64, OS_64,
left.location.reference, src1);
end;
end;
end;
{ choose appropriate operand }
if left.resultdef.typ <> floatdef then begin
if not (cs_check_overflow in current_settings.localswitches) then
op := A_NEG
else
op := A_NEGO_;
location.loc := LOC_REGISTER;
end else begin
op := A_FNEG;
location.loc := LOC_FPUREGISTER;
end;
{ emit operation }
current_asmdata.CurrAsmList.concat(taicpu.op_reg_reg(op, location.register, src1));
end;
cg.g_overflowcheck(current_asmdata.CurrAsmList, location, resultdef);
end;
{*****************************************************************************
TPPCNOTNODE
*****************************************************************************}
procedure tppcnotnode.pass_generate_code;
var
hl: tasmlabel;
begin
if is_boolean(resultdef) then
begin
{ if the location is LOC_JUMP, we do the secondpass after the
labels are allocated
}
if left.expectloc = LOC_JUMP then
begin
hl := current_procinfo.CurrTrueLabel;
current_procinfo.CurrTrueLabel := current_procinfo.CurrFalseLabel;
current_procinfo.CurrFalseLabel := hl;
secondpass(left);
maketojumpbool(current_asmdata.CurrAsmList, left, lr_load_regvars);
hl := current_procinfo.CurrTrueLabel;
current_procinfo.CurrTrueLabel := current_procinfo.CurrFalseLabel;
current_procinfo.CurrFalseLabel := hl;
location.loc := LOC_JUMP;
end
else
begin
secondpass(left);
case left.location.loc of
LOC_FLAGS:
begin
location_copy(location, left.location);
inverse_flags(location.resflags);
end;
LOC_REGISTER, LOC_CREGISTER,
LOC_REFERENCE, LOC_CREFERENCE,
LOC_SUBSETREG, LOC_CSUBSETREG,
LOC_SUBSETREF, LOC_CSUBSETREF:
begin
location_force_reg(current_asmdata.CurrAsmList, left.location,
def_cgsize(left.resultdef), true);
current_asmdata.CurrAsmList.concat(taicpu.op_reg_const(A_CMPDI,
left.location.register, 0));
location_reset(location, LOC_FLAGS, OS_NO);
location.resflags.cr := RS_CR0;
location.resflags.flag := F_EQ;
end;
else
internalerror(2003042401);
end;
end;
end
else
begin
secondpass(left);
location_force_reg(current_asmdata.CurrAsmList, left.location,
def_cgsize(left.resultdef), true);
location_copy(location, left.location);
location.loc := LOC_REGISTER;
location.register := cg.getintregister(current_asmdata.CurrAsmList, OS_INT);
{ perform the NOT operation }
cg.a_op_reg_reg(current_asmdata.CurrAsmList, OP_NOT, def_cgsize(resultdef),
left.location.register,
location.register);
end;
end;
begin
cmoddivnode := tppcmoddivnode;
cshlshrnode := tppcshlshrnode;
cunaryminusnode := tppcunaryminusnode;
cnotnode := tppcnotnode;
end.
|