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
|
/* This code is part of the tng compression routines.
*
* Written by Daniel Spangberg
* Copyright (c) 2010, 2013, The GROMACS development team.
*
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the Revised BSD License.
*/
#include <stdio.h>
#include <stdlib.h>
#include "../../include/compression/tng_compress.h"
/* 64 bit integers are not required in this part of the program. But
they improve the running speed if present. If 64 bit integers are
available define the symbol HAVE64BIT. It should get automatically
defined by the defines in my64bit.h */
#include "../../include/compression/my64bit.h"
#include "../../include/compression/widemuldiv.h"
#ifndef TRAJNG_X86_GCC_INLINE_MULDIV
#if defined(__GNUC__) && defined(__i386__)
#define TRAJNG_X86_GCC_INLINE_MULDIV
#endif /* gcc & i386 */
#if defined(__GNUC__) && defined(__x86_64__)
#define TRAJNG_X86_GCC_INLINE_MULDIV
#endif /* gcc & x86_64 */
#endif /* TRAJNG X86 GCC INLINE MULDIV */
/* Multiply two 32 bit unsigned integers returning a 64 bit unsigned value (in two integers) */
void Ptngc_widemul(unsigned int i1, unsigned int i2, unsigned int *ohi, unsigned int *olo)
{
#if defined(TRAJNG_X86_GCC_INLINE_MULDIV)
__asm__ __volatile__ ("mull %%edx\n\t"
: "=a" (i1), "=d" (i2)
: "a" (i1),"d" (i2)
: "cc");
*ohi=i2;
*olo=i1;
#else /* TRAJNG X86 GCC INLINE MULDIV */
#ifdef HAVE64BIT
my_uint64_t res= ((my_uint64_t)i1) * ((my_uint64_t)i2);
*olo=res & 0xFFFFFFFFU;
*ohi=(res>>32) & 0xFFFFFFFFU;
#else /* HAVE64BIT */
unsigned int bits=16;
unsigned int L_m=(1<<bits)-1; /* Lower bits mask. */
unsigned int a_U,a_L; /* upper and lower half of a */
unsigned int b_U,b_L; /* upper and lower half of b */
unsigned int x_UU,x_UL,x_LU,x_LL; /* temporary storage. */
unsigned int x,x_U,x_L; /* temporary storage. */
/* Extract partial ints */
a_L=i1 & L_m;
a_U=i1>>bits;
b_L=i2 & L_m;
b_U=i2>>bits;
/* Do a*a=>2a multiply where a is half number of bits in an int */
x=a_L*b_L;
x_LL=x & L_m;
x_LU=x>>bits;
x=a_U*b_L;
x_LU+=x & L_m;
x_UL=x>>bits;
x=a_L*b_U;
x_LU+=x & L_m;
x_UL+=x>>bits;
x=a_U*b_U;
x_UL+=x & L_m;
x_UU=x>>bits;
/* Combine results */
x_UL+=x_LU>>bits;
x_LU&=L_m;
x_UU+=x_UL>>bits;
x_UL&=L_m;
x_U=(x_UU<<bits)|x_UL;
x_L=(x_LU<<bits)|x_LL;
/* Write back results */
*ohi=x_U;
*olo=x_L;
#endif /* HAVE64BIT */
#endif /* TRAJNG X86 GCC INLINE MULDIV */
}
/* Divide a 64 bit unsigned value in hi:lo with the 32 bit value i and
return the result in result and the remainder in remainder */
void Ptngc_widediv(unsigned int hi, unsigned int lo, unsigned int i, unsigned int *result, unsigned int *remainder)
{
#if defined(TRAJNG_X86_GCC_INLINE_MULDIV)
__asm__ __volatile__ ("divl %%ecx\n\t"
: "=a" (lo), "=d" (hi)
: "a" (lo),"d" (hi), "c" (i)
: "cc");
*result=lo;
*remainder=hi;
#else /* TRAJNG X86 GCC INLINE MULDIV */
#ifdef HAVE64BIT
my_uint64_t v= (((my_uint64_t)hi)<<32) | ((my_uint64_t)lo);
my_uint64_t res=v/((my_uint64_t)i);
my_uint64_t rem=v-res*((my_uint64_t)i);
*result=(unsigned int)res;
*remainder=(unsigned int)rem;
#else /* HAVE64BIT */
unsigned int res;
unsigned int rmask;
unsigned int s_U,s_L;
unsigned int bits=16U;
unsigned int bits2=bits*2U;
unsigned int hibit=bits2-1U;
unsigned int hibit_mask=1U<<hibit;
unsigned int allbits=(hibit_mask-1U)|hibit_mask;
/* Do division. */
rmask=hibit_mask;
res=0;
s_U=i>>(bits2-hibit);
s_L=(i<<hibit)&0xFFFFFFFFU;
while (rmask)
{
if ((s_U<hi) || ((s_U==hi) && (s_L<=lo)))
{
/* Subtract */
hi-=s_U;
if (s_L>lo)
{
unsigned int t;
hi--; /* Borrow */
t=allbits-s_L;
lo+=t+1;
}
else
lo-=s_L;
/* Set bit. */
res|=rmask;
}
rmask>>=1;
s_L>>=1;
if (s_U & 1U)
s_L|=hibit_mask;
s_U>>=1;
}
*remainder=lo;
*result=res;
#endif /* HAVE64BIT */
#endif /* TRAJNG X86 GCC INLINE MULDIV */
}
/* Add a unsigned int to a largeint. j determines which value in the
largeint to add v1 to. */
static void largeint_add_gen(unsigned int v1, unsigned int *largeint, int n, int j)
{
/* Add with carry. unsigned ints in C wrap modulo 2**bits when "overflowed". */
unsigned int v2=(v1+largeint[j])&0xFFFFFFFFU; /* Add and cap at 32 bits */
unsigned int carry=0;
if ((((unsigned int)-1)&0xFFFFFFFFU) -v1<largeint[j])
carry=1;
largeint[j]=v2;
j++;
while ((j<n) && carry)
{
v2=(largeint[j]+carry)&0xFFFFFFFFU;
carry=0;
if ((((unsigned int)-1)&0xFFFFFFFFU) -1<largeint[j])
carry=1;
largeint[j]=v2;
j++;
}
}
/* Add a unsigned int to a largeint. */
void Ptngc_largeint_add(unsigned int v1, unsigned int *largeint, int n)
{
largeint_add_gen(v1,largeint,n,0);
}
/* Multiply v1 with largeint_in and return result in largeint_out */
void Ptngc_largeint_mul(unsigned int v1, unsigned int *largeint_in, unsigned int *largeint_out, int n)
{
int i;
for (i=0; i<n; i++)
largeint_out[i]=0U;
for (i=0; i<n; i++)
{
if (largeint_in[i]!=0U)
{
unsigned int lo,hi;
Ptngc_widemul(v1,largeint_in[i],&hi,&lo); /* 32x32->64 mul */
largeint_add_gen(lo,largeint_out,n,i);
if (i+1<n)
largeint_add_gen(hi,largeint_out,n,i+1);
}
}
}
/* Return the remainder from dividing largeint_in with v1. Result of the division is returned in largeint_out */
unsigned int Ptngc_largeint_div(unsigned int v1, unsigned int *largeint_in, unsigned int *largeint_out, int n)
{
unsigned int result,remainder=0;
int i;
unsigned int hi, lo;
/* Boot */
hi=0U;
i=n;
while (i)
{
lo=largeint_in[i-1];
Ptngc_widediv(hi,lo,v1,&result,&remainder);
largeint_out[i-1]=result;
hi=remainder;
i--;
}
return remainder;
}
|
