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
|
/* Copyright (c) 1997 by Inria Lorraine. All Rights Reserved */
/***
NAME
pvm_grp
PURPOSE
NOTES
HISTORY
fleury - Nov 25, 1997: Created.
$Id: pvm_grp.c,v 1.5 2005/01/07 20:49:25 cornet Exp $
***/
#include <stdio.h>
#include <string.h>
#ifdef WIN32
#include "../../pvm3/include/pvm3.h"
#else
#include "pvm3.h"
#endif
#include "../machine.h"
#include "../calelm/sci_tools.h"
#include "sci_pvm.h"
void C2F(scipvmbcast)(char *group, int *l,
int *pack, int *n,
double *buff,
int *msgtag, int *res)
{
int info, bufid;
double *ptr_double;
int *ptr_int;
int i;
/* (void) fprintf(stderr, "BCAST: %s,%d:%d:%d\n", group, *n, pack[0], pack[1]);*/
bufid = pvm_initsend(PvmDataDefault);
if (bufid < 0) {
(void) fprintf(stderr, "Error pvm_bcast: -init- %d\n", bufid);
*res = bufid;
return;
}
/* Pack the size of the packing vector */
info = pvm_pkint(n, 1, 1);
if (info < 0) {
(void) fprintf(stderr, "Error pvm_bcast: -pack- %d\n", info);
pvm_freebuf(bufid);
*res = info;
return;
}
/* Pack the packing vector */
info = pvm_pkint(pack, *n, 1);
if (info < 0) {
(void) fprintf(stderr, "Error pvm_bcast: -pack- %d\n", info);
pvm_freebuf(bufid);
*res = info;
return;
}
/* Pack the msg using the packing vector info */
ptr_double = buff;
ptr_int = (int*) buff;
for (i = 0; i < *n; i+=2) {
if (pack[i] > 0) { /* have to pack some int */
info = pvm_pkint(ptr_int, pack[i], 1);
if (info < 0) {
(void) fprintf(stderr, "Error pvm_bcast: -pack- %d\n", info);
pvm_freebuf(bufid);
*res = info;
return;
}
ptr_int += pack[i] + (pack[i] % 2);
ptr_double += ((pack[i]-1)/2 + 1);
}
if (pack[i+1] > 0) { /* have to pack some double */
info = pvm_pkdouble(ptr_double, pack[i+1], 1);
if (info < 0) {
(void) fprintf(stderr, "Error pvm_bcast: -pack- %d\n", info);
pvm_freebuf(bufid);
*res = info;
return;
}
ptr_int += (pack[i+1]*2);
ptr_double += pack[i+1];
}
}
*res = pvm_bcast(group, *msgtag);
} /* scipvmbcast */
void C2F(scipvmreduce)(char *func, int *l1,
double *buff, int *m, int *n, int *msgtag,
char *group, int *l2, int *rootginst, int *res)
{
int type, datatype;
int size;
void (*op)(int *, void *, void *, int *, int *);
/* Check the type of the buff */
type = TYPE(buff);
size = *m * *n;
switch (type)
{
case TYPE_DOUBLE :
datatype = PVM_DOUBLE;
break;
case TYPE_COMPLEX :
datatype = PVM_DCPLX;
SciToF77(buff, size, size);
break;
default :
(void) fprintf(stderr, "Error pvm_reduce: Not scalar type\n");
*res = PvmBadMsg;
return;
}
/* Check the reduction operation */
if (!strcmp(func, "Max")) {
op = PvmMax;
}
else if (!strcmp(func, "Min")) {
op = PvmMin;
}
else if (!strcmp(func, "Sum")) {
op = PvmSum;
}
else if (!strcmp(func, "Pro")) {
op = PvmProduct;
}
else {
(void) fprintf(stderr, "Error pvm_reduce: Unknow reduction operation %s\n", func);
*res = PvmBadMsg;
return;
}
*res = pvm_reduce(op, buff, size, datatype, *msgtag, group, *rootginst);
if (type == TYPE_COMPLEX)
F77ToSci(buff, size, size);
return;
}
|
