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
233
234
235
236
237
238
239
240
|
C Copyright (c) 2003-2010 University of Florida
C
C This program is free software; you can redistribute it and/or modify
C it under the terms of the GNU General Public License as published by
C the Free Software Foundation; either version 2 of the License, or
C (at your option) any later version.
C This program is distributed in the hope that it will be useful,
C but WITHOUT ANY WARRANTY; without even the implied warranty of
C MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
C GNU General Public License for more details.
C The GNU General Public License is included in this distribution
C in the file COPYRIGHT.
subroutine dump_block(array_table, narray_table,
* index_table,
* nindex_table, segment_table, nsegment_table,
* block_map_table, nblock_map_table,
* scalar_table, nscalar_table,
* address_table, op)
c--------------------------------------------------------------------------
c Print the first and last sample of a block.
c--------------------------------------------------------------------------
implicit none
include 'interpreter.h'
include 'mpif.h'
include 'trace.h'
include 'parallel_info.h'
#ifdef ALTIX
include 'sheap.h'
#endif
integer narray_table, nindex_table, nsegment_table,
* nblock_map_table
integer op(loptable_entry)
integer array_table(larray_table_entry, narray_table)
integer index_table(lindex_table_entry, nindex_table)
integer segment_table(lsegment_table_entry, nsegment_table)
integer block_map_table(lblock_map_entry, nblock_map_table)
integer nscalar_table
double precision scalar_table(nscalar_table)
integer*8 address_table(narray_table)
integer i, j, k
integer array, index(mx_array_index), nindex, ierr
integer block, blkndx, seg(mx_array_index)
integer find_current_block
integer*8 indblk, get_block_index
integer*8 daddr, get_index_from_base
integer type
integer stack
integer comm
integer val1(mx_array_index), val2(mx_array_index)
double precision x(1)
#ifdef ALTIX
pointer (dptr, x)
#else
common x
#endif
integer n, nb, proc, map, company_comm
integer na1,na2,ni1,ni2
integer pst_get_company_comm, pst_get_company_rank
company_comm = pst_get_company_comm(me)
proc = pst_get_company_rank(me)
#ifdef ALTIX
dptr = dshptr
#endif
c---------------------------------------------------------------------------
c Find the indices of the array block.
c---------------------------------------------------------------------------
array = op(c_result_array)
type = array_table(c_array_type,array)
nb = array_table(c_numblks, array)
map = array_table(c_block_map, array)
nindex = array_table(c_nindex, array)
n = 1
do i = 1, nindex
index(i) = array_table(c_index_array1+i-1,array)
seg(i) = index_table(c_current_seg,index(i))
c-------------------------------------------------------------------------
c Get segment ranges.
c-------------------------------------------------------------------------
call get_index_segment(index(i), seg(i), segment_table,
* nsegment_table, index_table,
* nindex_table, val1(i), val2(i))
n = n * (val2(i)-val1(i)+1)
enddo
c---------------------------------------------------------------------------
c Get array data address.
c---------------------------------------------------------------------------
if (type .eq. static_array) then
daddr = address_table(array)
indblk = get_index_from_base(daddr, x, 2)
print *,'Dump of static array ',array,' daddr = ',daddr,
* ' range = ',(val1(i),val2(i),i=1,nindex)
else
block = find_current_block(array, array_table(1,array),
* index_table, nindex_table,
* segment_table, nsegment_table,
* block_map_table, blkndx)
print *,'Task ',me,' at line number ',current_line,
* ' ARRAY ',array,' BLOCK ',block,' ind = ',
* (index(i),i=1,nindex),' seg = ',(seg(i),i=1,nindex),
* ' actual size = ',n
if (block .lt. 0) return
if (type .eq. distributed_array .and.
* block_map_table(c_processor,map+block-1).eq.proc) then
call dump_block_data(array,block)
else
call dump_block_data(array,block)
endif
stack = array_table(c_array_stack, array)
indblk = get_block_index(array, block, stack,
* blkndx, x, .true.)
endif
if (nindex .eq. 4) then
call print_samples(me, array, block,
* x(indblk), val1(1),val2(1),
* val1(2),val2(2),
* val1(3),val2(3),
* val1(4),val2(4))
else if (nindex .eq. 2) then
if (type .eq. static_array) then
na1 = array_table(c_index_range1,array)
na2 = array_table(c_index_range2,array)
ni1 = array_table(c_index_range1+1,array)
ni2 = array_table(c_index_range2+1,array)
else
na1 = val1(1)
na2 = val2(1)
ni1 = val1(2)
ni2 = val2(2)
endif
call print_samples2(me, array, block,
* x(indblk), val1(1),val2(1),
* val1(2),val2(2), na1,na2,ni1,ni2)
endif
return
end
subroutine print_samples(me, array, block, x,
* a1,a2,i1,i2,b1,b2,j1,j2)
implicit none
include 'trace.h'
integer me, array, block
integer a1,a2,b1,b2,i1,i2,j1,j2
double precision x(a1:a2,i1:i2,b1:b2,j1:j2)
integer a,b,i,j
double precision eps
double precision val
double precision xmax, xmin, sumsq
xmax = x(a1,i1,b1,j1)
xmin = x(a1,i1,b1,j1)
sumsq = 0.
do j = j1,j2
do b = b1,b2
do i = i1,i2
do a = a1,a2
xmax = max(x(a,i,b,j), xmax)
xmin = min(x(a,i,b,j), xmin)
sumsq = sumsq + x(a,i,b,j)*x(a,i,b,j)
enddo
enddo
enddo
enddo
print *,'Task ',me,' line ',current_line,
* ' Array, block = ',array,block,
* ' first = ',
* x(a1,i1,b1,j1),
* ' last = ',x(a2,i2,b2,j2),
* ' xmin, xmax, sumsq = ',xmin,xmax,sumsq,
* ' ranges ',a1,a2,i1,i2,b1,b2,j1,j2
return
end
subroutine print_samples2(me, array, block, x,
* a1,a2,i1,i2, na1, na2,ni1,ni2)
implicit none
include 'trace.h'
integer me, array, block
integer a1,a2,i1,i2
integer na1,na2,ni1,ni2
double precision x(na1:na2,ni1:ni2)
integer a,i
double precision eps
double precision val
double precision xmax, xmin, sumsq
xmax = x(a1,i1)
xmin = x(a1,i1)
sumsq = 0.
do i = i1,i2
do a = a1,a2
xmax = max(x(a,i), xmax)
xmin = min(x(a,i), xmin)
sumsq = sumsq + x(a,i)*x(a,i)
enddo
enddo
print *,'Task ',me,' line ',current_line,
* ' Array, block = ',array,block,
* ' first = ',
* x(a1,i1),
* ' last = ',x(a2,i2),
* ' xmin, xmax, sumsq = ',xmin,xmax,sumsq,
* ' ranges ',a1,a2,i1,i2
c do i = i1,i2
c do a = a1,a2
c print *,'Task ',me,' array, a,b ',array,a,i,' value ',
c * x(a,i)
c enddo
c enddo
return
end
|
