|
|
1.1 root 1: /* llib-lmp 1.2 86/03/13 */
2: /* LINTLIBRARY */
3: #include <stdio.h>
4: #include <mp.h>
5: gcd(a,b,c) MINT *a,*b,*c; {}
6: invert(a, b, c) MINT *a, *b, *c; {}
7: m_add(a,b,c) struct mint *a,*b,*c; {}
8: madd(a,b,c) struct mint *a,*b,*c; {}
9: m_sub(a,b,c) struct mint *a,*b,*c; {}
10: msub(a,b,c) struct mint *a,*b,*c; {}
11: mdiv(a,b,q,r) MINT *a,*b,*q,*r; {}
12: int m_dsb(q,n,a,b) short *a,*b; { return 0; }
13: long m_trq(v1,v2,u1,u2,u3) { return 0L; }
14: m_div(a,b,q,r) MINT *a,*b,*q,*r; {}
15: int m_in(a,b,f) MINT *a; FILE *f; { return EOF; }
16: m_out(a,b,f) MINT *a; FILE *f; {}
17: sdiv(a,n,q,r) MINT *a,*q; short n; short *r; {}
18: s_div(a,n,q,r) MINT *a,*q; short n; short *r; {}
19: int min(a) MINT *a; { return 0; }
20: int omin(a) MINT *a; { return 0; }
21: mout(a) MINT *a; {}
22: omout(a) MINT *a; {}
23: fmout(a,f) MINT *a; FILE *f; {}
24: int fmin(a,f) MINT *a; FILE *f; {}
25: int msqrt(a,b,r) MINT *a,*b,*r; { return 0; }
26: mult(a,b,c) struct mint *a,*b,*c; {}
27: m_mult(a,b,c) struct mint *a,*b,*c; {}
28: tradd(a,b,c) long c; int *a; union g {long xx; struct half yy;} *b; {}
29: pow(a,b,c,d) MINT *a,*b,*c,*d; {}
30: rpow(a,n,b) MINT *a,*b; {}
31: move(a,b) MINT *a,*b; {}
32: dummy(){}
33: /* VARARGS */
34: short * xalloc(nint,s) char *s; { static short sh; return &sh; }
35: fatal(s) char *s; { /* NOTREACHED */ }
36: xfree(c) MINT *c; {}
37: mcan(a) MINT *a; {}
38: MINT * itom(n) { static MINT m; return &m; }
39: int mcmp(a,b) MINT *a,*b; { return 0; }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.