/usr/include/FLINT/mpz_extras.h is in libflint-dev 1.011-2.2.
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 | /*============================================================================
Copyright (C) 2007, William Hart
This file is part of FLINT.
FLINT 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.
FLINT 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 FLINT; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
===============================================================================*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdint.h>
#include <gmp.h>
#ifndef FLINT_MPZ_EXTRAS_H
#define FLINT_MPZ_EXTRAS_H
#ifdef __cplusplus
extern "C" {
#endif
#define mpz_t mpz_t
/*-----------------------------------------------------------------------------
Memory Management Functions
-----------------------------------------------------------------------------*/
mpz_t* F_mpz_alloc(void);
void F_mpz_release(void);
/*-----------------------------------------------------------------------------
Modular Arithmetic
-----------------------------------------------------------------------------*/
void F_mpz_mulmod(mpz_t, mpz_t, mpz_t, mpz_t);
/*
sets res to a*b modulo p
assumes a and b are not (much) bigger than p and that res is not p
*/
static inline void mulmod2(mpz_t res, mpz_t a, mpz_t b, mpz_t p)
{
mpz_mul(res,a,b);
mpz_fdiv_r(res,res,p);
}
unsigned long F_mpz_mulmod_ui(mpz_t, mpz_t, mpz_t, unsigned long);
long F_mpz_powm_long(long, long, long);
int F_mpz_sqrtmod(mpz_t, mpz_t, mpz_t);
void F_mpz_sqrtmodpklift(mpz_t, mpz_t, mpz_t, mpz_t);
void F_mpz_sqrtmodptopk(mpz_t, mpz_t, mpz_t, mpz_t, int);
int F_mpz_sqrtmodpk(mpz_t, mpz_t, mpz_t, int);
/*-----------------------------------------------------------------------------
Number Theoretic
-----------------------------------------------------------------------------*/
void F_mpz_CRT(mpz_t, mpz_t, mpz_t, mpz_t, mpz_t, mpz_t);
/*===================================================================================
Montgomery routines
====================================================================================*/
unsigned long F_mpz_mont_red(mpz_t res, mpz_t a, mpz_t m);
void F_mpz_mont_mul(mpz_t res, mpz_t a, mpz_t b, mpz_t m, mpz_t R, unsigned long n);
void F_mpz_expmod_mont(mpz_t res, mpz_t a, mpz_t exp, mpz_t m);
/*===================================================================================
Burnikel_Ziegler Division
====================================================================================*/
void F_mpz_divrem_BZ(mpz_t Q, mpz_t R, mpz_t A, mpz_t B);
void F_mpz_rem_BZ(mpz_t R, mpz_t A, mpz_t B);
void F_mpz_mulmod_BZ(mpz_t res, mpz_t a, mpz_t b, mpz_t m);
void F_mpz_expmod_BZ(mpz_t res, mpz_t a, mpz_t exp, mpz_t m);
/*===================================================================================
Large integer multiplication
====================================================================================*/
void F_mpz_mul(mpz_t res, mpz_t a, mpz_t b);
void __F_mpz_mul(mpz_t res, mpz_t a, mpz_t b, unsigned long twk);
#ifdef __cplusplus
}
#endif
#endif
|