1999-12-09 10:32:23 +01:00
|
|
|
/* IBM POWER lshift
|
|
|
|
|
*
|
2001-04-28 20:53:00 +02:00
|
|
|
* Copyright (C) 1992, 1994, 1999,
|
|
|
|
|
* 2000, 2001 Free Software Foundation, Inc.
|
1999-12-09 10:32:23 +01:00
|
|
|
*
|
|
|
|
|
* This file is part of GnuPG.
|
|
|
|
|
*
|
|
|
|
|
* GnuPG 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.
|
|
|
|
|
*
|
|
|
|
|
* GnuPG 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include "sysdep.h"
|
|
|
|
|
#include "asm-syntax.h"
|
|
|
|
|
|
1999-12-19 15:23:19 +01:00
|
|
|
/*
|
1999-12-09 10:32:23 +01:00
|
|
|
# INPUT PARAMETERS
|
|
|
|
|
# res_ptr r3
|
|
|
|
|
# s_ptr r4
|
|
|
|
|
# size r5
|
|
|
|
|
# cnt r6
|
1999-12-19 15:23:19 +01:00
|
|
|
*/
|
1999-12-09 10:32:23 +01:00
|
|
|
|
|
|
|
|
.toc
|
|
|
|
|
.extern mpihelp_lshift[DS]
|
|
|
|
|
.extern .mpihelp_lshift
|
|
|
|
|
.csect [PR]
|
|
|
|
|
.align 2
|
|
|
|
|
.globl mpihelp_lshift
|
|
|
|
|
.globl .mpihelp_lshift
|
|
|
|
|
.csect mpihelp_lshift[DS]
|
|
|
|
|
mpihelp_lshift:
|
|
|
|
|
.long .mpihelp_lshift, TOC[tc0], 0
|
|
|
|
|
.csect [PR]
|
|
|
|
|
.mpihelp_lshift:
|
|
|
|
|
sli 0,5,2
|
|
|
|
|
cax 9,3,0
|
|
|
|
|
cax 4,4,0
|
|
|
|
|
sfi 8,6,32
|
|
|
|
|
mtctr 5 # put limb count in CTR loop register
|
|
|
|
|
lu 0,-4(4) # read most significant limb
|
|
|
|
|
sre 3,0,8 # compute carry out limb, and init MQ register
|
|
|
|
|
bdz Lend2 # if just one limb, skip loop
|
|
|
|
|
lu 0,-4(4) # read 2:nd most significant limb
|
|
|
|
|
sreq 7,0,8 # compute most significant limb of result
|
|
|
|
|
bdz Lend # if just two limb, skip loop
|
|
|
|
|
Loop: lu 0,-4(4) # load next lower limb
|
|
|
|
|
stu 7,-4(9) # store previous result during read latency
|
|
|
|
|
sreq 7,0,8 # compute result limb
|
|
|
|
|
bdn Loop # loop back until CTR is zero
|
|
|
|
|
Lend: stu 7,-4(9) # store 2:nd least significant limb
|
|
|
|
|
Lend2: sle 7,0,6 # compute least significant limb
|
|
|
|
|
st 7,-4(9) # store it
|
|
|
|
|
br
|
|
|
|
|
|
