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
|
/* Copyright (c) 1998 by Inria Lorraine. All Rights Reserved */
/***
NAME
lpack
PURPOSE
NOTES
HISTORY
Serge Steer / Eric Fleury - Mar 13, 1998: Created.
$Log: lpack.c,v $
Revision 1.1 1998/03/27 13:44:22 fleury
Premier ajout de lpack.
version OK
***/
#include <stdio.h>
#include "../machine.h"
#include "../stack-c.h"
#define IADR(l) ((l)+(l)-1)
#define SADR(l) (((l)/2)+1)
#define ODD(x) ((x)+((x)%2))
#ifdef __STDC__
extern void F2C(bpak)(int *il, int *pack, int *n, int *nmax);
extern void F2C(cpak)(int *il, int *pack, int *n, int *nmax);
extern void F2C(ppak)(int *il, int *pack, int *n, int *nmax);
extern void F2C(mpak)(int *il, int *pack, int *n, int *nmax);
extern void F2C(spak)(int *il, int *pack, int *n, int *nmax);
extern void F2C(sppak)(int *il, int *pack, int *n, int *nmax);
extern void F2C(bsppak)(int *il, int *pack, int *n, int *nmax);
#else
extern void F2C(bpak)();
extern void F2C(cpak)();
extern void F2C(ppak)();
extern void F2C(mpak)();
extern void F2C(spak)();
extern void F2C(sppak)();
extern void F2C(bsppak)();
#endif
#ifdef __STDC__
void
C2F(lpak)(int *il, int *pack, int *np, int *npmax)
#else
int C2F(lpak)(il, pack, np, npmax)
int *il;
int *pack;
int *np;
int *npmax;
#endif
{
int nmax; /* size of the free space on the stack */
int kp; /* pack tab index */
int ne, type, size; /* nb elt */
int nk; /* size of the packing tab for a list elt. */
int i; /* loop index */
int ilp, ill, li, l; /* @ computation */
int padding; /* nb of padding double */
int p_i, p_size;
int *ptr;
/* nb element of the list */
ne = istk(*il)[1];
/* (void) fprintf(stderr, "nb elt: %d\n", ne);*/
/* first pack the list header */
*np = 2;
if ((*np) > (*npmax)) {
return;
}
pack[0] = ODD(ne + 3);
pack[1] = 0;
kp = 2;
/* loop on objects */
ilp = *il + 2;
l = SADR(ilp + ne + 1);
for (i = 1; i <= ne; ++i) {
li = istk(ilp)[i-1];
ill = IADR(l + li -1);
type = istk(ill)[0];
size = istk(ilp)[i] - istk(ilp)[i-1];
nmax = *npmax - kp;
/* (void) fprintf(stderr, "elet=%d:type=%d:size=%d:li=%d\n",
i, type, size, li);*/
switch (type){
case 1: /* scalar matrix */
F2C(spak)(&ill, &pack[kp], &nk, &nmax);
break;
case 2: /* polynomial matrix */
F2C(ppak)(&ill, &pack[kp], &nk, &nmax);
break;
case 4: /* boolean matrix */
F2C(bpak)(&ill, &pack[kp], &nk, &nmax);
break;
case 5: /* sparse matrix */
F2C(sppak)(&ill, &pack[kp], &nk, &nmax);
break;
case 6: /* boolean sparse matrix */
F2C(bsppak)(&ill, &pack[kp], &nk, &nmax);
break;
case 10: /* character matrix */
F2C(cpak)(&ill, &pack[kp], &nk, &nmax);
break;
case 11: /* un-compiled function */
F2C(mpak)(&ill, &pack[kp], &nk, &nmax);
break;
case 13: /* compiled function */
F2C(mpak)(&ill, &pack[kp], &nk, &nmax);
break;
case 15: /* list */
F2C(lpak)(&ill, &pack[kp], &nk, &nmax);
break;
case 16: /* typed list (tlist) */
C2F(lpak)(&ill, &pack[kp], &nk, &nmax);
break;
default:
(void) fprintf(stderr, "ERROR: unknow type\n");
return;
}
/* Complete the padding */
ptr = &pack[kp];
p_size = 0;
for (p_i = 0; p_i < nk; p_i += 2) {
p_size += ptr[p_i]/2 + ptr[p_i] % 2;
p_size += ptr[p_i+1];
}
padding = size - p_size;
if (padding) {
ptr[nk-1] += padding;
}
/* Update the pack index */
kp += nk;
if(nk > nmax) {
*np = *npmax + 1;
return;
}
}
*np = kp;
/* (void) fprintf(stderr, "PACK[0..%d]=", *np);
for (i = 0; i < *np; ++i) {
(void) fprintf(stderr, "%d:", pack[i]);
}
(void) fprintf(stderr, "\n");*/
return;
} /* lpak_ */
|
