/usr/include/givaro/modular-integer.inl is in libgivaro-dev 4.0.2-8ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | // ==========================================================================
// $Source: /var/lib/cvs/Givaro/src/kernel/zpz/givzpzInt.inl,v $
// Copyright(c)'1994-2009 by The Givaro group
// This file is part of Givaro.
// Givaro is governed by the CeCILL-B license under French law
// and abiding by the rules of distribution of free software.
// see the COPYRIGHT file for more details.
// Authors: JG Dumas
// $Id: givzpzInt.inl,v 1.11 2011-02-02 17:16:43 briceboyer Exp $
// ==========================================================================
#ifndef __GIVARO_zpz_int_INL
#define __GIVARO_zpz_int_INL
// Description:
// ---------
// -- normalized operations
// ---------
// r = a*b
#define __GIVARO_ZPZInteger_N_MUL(r,p,a,b) { Integer::mul(r,a,b); Integer::modin(r,p); }
// r *= a
#define __GIVARO_ZPZInteger_N_MULIN(r,p,a) { Integer::mulin(r,a); Integer::modin(r,p); }
// r = a - b
#define __GIVARO_ZPZInteger_N_SUB(r,p,a,b) { Integer::sub(r,a,b); if (sign(r) < 0) Integer::addin(r,p); }
// r -= a
#define __GIVARO_ZPZInteger_N_SUBIN(r,p,a) { Integer::subin(r,a) ; if ( sign(r) < 0) Integer::addin(r,p); }
// r = a+b
#define __GIVARO_ZPZInteger_N_ADD(r,p,a,b) { Integer::add(r,a,b); if (r >= p) Integer::subin(r,p); }
// r += a
#define __GIVARO_ZPZInteger_N_ADDIN(r,p,a) { Integer::addin(r,a); if (r >= p) Integer::subin(r,p); }
// r <- a*b+c % p
#define __GIVARO_ZPZInteger_N_MULADD(r,p,a,b,c) { Integer::axpy(r,a,b,c); Integer::modin(r,p); }
#define __GIVARO_ZPZInteger_N_MULADDIN(r,p,a,b) { Integer::axpyin(r,a,b); Integer::modin(r,p); }
// a*b-c
#define __GIVARO_ZPZInteger_N_MULSUB(r,p,a,b,c) { Integer::axmy(r,a,b,c); Integer::modin(r,p); }
// a*b-c
#define __GIVARO_ZPZInteger_N_SUBMULIN(r,p,a,b) { Integer::maxpyin(r,a,b); Integer::modin(r,p) ; }
#define __GIVARO_ZPZInteger_N_NEG(r,p,a) { if (isZero(a)) r=a; else Integer::sub(r,p,a); }
#define __GIVARO_ZPZInteger_N_NEGIN(r,p) { if (! isZero(r)) Integer::sub(r,p,r); }
namespace Givaro {
// ------------------------- Arithmetic functions
inline Modular<Integer>::Element&
Modular<Integer>::mul (Element& r, const Element& a, const Element& b) const
{
__GIVARO_ZPZInteger_N_MUL(r,_p,a,b); return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::sub (Element& r, const Element& a, const Element& b) const
{
__GIVARO_ZPZInteger_N_SUB(r,_p,a,b); return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::add (Element& r, const Element& a, const Element& b) const
{
__GIVARO_ZPZInteger_N_ADD(r,_p,a,b); return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::neg (Element& r, const Element& a) const
{
__GIVARO_ZPZInteger_N_NEG(r,_p,a); return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::negin (Element& r) const
{
__GIVARO_ZPZInteger_N_NEGIN(r,_p);
return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::inv (Element& r, const Element& a) const
{
return ::Givaro::inv(r,a,_p);
}
inline Modular<Integer>::Element&
Modular<Integer>::div (Element& r, const Element& a, const Element& b) const
{
Element ib;
inv(ib, b);
__GIVARO_ZPZInteger_N_MUL(r,_p,a,ib);
return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::mulin (Element& r, const Element& a) const
{
__GIVARO_ZPZInteger_N_MULIN(r,_p, a);
return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::divin (Element& r, const Element& a) const
{
Modular<Integer>::Element ia;
inv(ia, a);
return mulin(r, ia);
}
inline Modular<Integer>::Element&
Modular<Integer>::addin (Element& r, const Element& a) const
{
__GIVARO_ZPZInteger_N_ADDIN(r,_p, a);
return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::subin (Element& r, const Element& a) const
{
__GIVARO_ZPZInteger_N_SUBIN(r,_p, a);
return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::invin (Element& r) const
{
Element t = r;
return ::Givaro::inv(r,t,_p);
}
inline Modular<Integer>::Element&
Modular<Integer>::axpy (Element& r, const Element& a, const Element& b, const Element& c) const
{
__GIVARO_ZPZInteger_N_MULADD(r, _p, a, b, c);
return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::axpyin (Element& r, const Element& a, const Element& b) const
{
__GIVARO_ZPZInteger_N_MULADDIN(r, _p, a, b);
return r;
}
inline Modular<Integer>::Element&
Modular<Integer>::axmy (Element& r, const Element& a, const Element& b, const Element& c) const
{
__GIVARO_ZPZInteger_N_MULSUB(r, _p, a, b, c);
return r;
}
// r = c - a*b
inline Modular<Integer>::Element&
Modular<Integer>::maxpy (Element& r, const Element& a, const Element& b, const Element& c) const
{
Element tmp = c;
__GIVARO_ZPZInteger_N_SUBMULIN(tmp, _p, a, b );
return r = (Modular<Integer>::Element)tmp;
}
// r -= a*b
inline Modular<Integer>::Element&
Modular<Integer>::maxpyin (Element& r, const Element& a, const Element& b) const
{
__GIVARO_ZPZInteger_N_SUBMULIN(r, _p, a, b );
return r;
}
// r = a*b - r
inline Modular<Integer>::Element&
Modular<Integer>::axmyin (Element& r, const Element& a, const Element& b) const
{
maxpyin(r,a,b);
return negin(r);
}
// --------------------
// ----- Initialisation
inline typename Modular<Integer>::Element&
Modular<Integer>::init(Element& x) const
{
return x = zero;
}
inline typename Modular<Integer>::Element&
Modular<Integer>::assign ( Element& r, const Element& a ) const
{
return r = a;
}
// ------------
// ----- Reduce
inline typename Modular<Integer>::Element&
Modular<Integer>::reduce(Element& r, const Element& a) const
{
r = a % static_cast<Element>(_p);
if (r < 0) r = static_cast<Element>(r + _p);
return r;
}
inline typename Modular<Integer>::Element&
Modular<Integer>::reduce(Element& r) const
{
r %= static_cast<Element>(_p);
if (r < 0) r = static_cast<Element>(r + _p);
return r;
}
//----- IO
inline std::ostream& Modular<Integer>::write (std::ostream& s ) const
{
return s << "Modular<Integer> modulo " << residu();
}
inline std::istream& Modular<Integer>::read (std::istream& s, Element& a) const
{
s >> a;
init(a, a);
return s;
}
inline std::ostream& Modular<Integer>::write (std::ostream& s, const Element& a) const
{
return s << a;
}
} // namespace Givaro
#endif // __GIVARO_zpz_int_INL
|