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
|
// file kernel/n/h/shift.h: shift of natural integers
/*-----------------------------------------------------------------------+
| Copyright 2005-2006, Michel Quercia (michel.quercia@prepas.org) |
| |
| This file is part of Numerix. Numerix is free software; you can |
| redistribute it and/or modify it under the terms of the GNU Lesser |
| General Public License as published by the Free Software Foundation; |
| either version 2.1 of the License, or (at your option) any later |
| version. |
| |
| The Numerix Library 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 |
| Lesser General Public License for more details. |
| |
| You should have received a copy of the GNU Lesser General Public |
| License along with the GNU MP Library; see the file COPYING. If not, |
| write to the Free Software Foundation, Inc., 59 Temple Place - |
| Suite 330, Boston, MA 02111-1307, USA. |
+-----------------------------------------------------------------------+
| |
| Dcalages |
| |
+-----------------------------------------------------------------------*/
/* ---------------------------------------- Dcalage par adresses dcroissantes
entre :
a = naturel de longueur la > 0
b = naturel de longueur la
k = entier tel que 0 <= k < HW
sortie :
b <- a >> k
retourne a mod 2^k
remarque :
b peut recouvrir le haut de a
*/
chiffre xn(shift_down)(chiffre *a, long la, chiffre *b, int k);
/* ---------------------------------------- Dcalage par adresses croissantes
entre :
a = naturel de longueur la > 0
b = naturel de longueur la
k = entier tel que 0 <= k < HW
sortie :
b <- a << k
retourne les k bits de poids fort de a
remarque :
b peut recouvrir le bas de a
*/
chiffre xn(shift_up)(chiffre *a, long la, chiffre *b, int k);
|
