root / man / man3 / HPL_max.3 @ 1
Historique | Voir | Annoter | Télécharger (1,08 ko)
1 | 1 | equemene | .TH HPL_max 3 "September 10, 2008" "HPL 2.0" "HPL Library Functions" |
---|---|---|---|
2 | 1 | equemene | .SH NAME |
3 | 1 | equemene | HPL_max \- Combine (max) two buffers. |
4 | 1 | equemene | .SH SYNOPSIS |
5 | 1 | equemene | \fB\&#include "hpl.h"\fR |
6 | 1 | equemene | |
7 | 1 | equemene | \fB\&void\fR |
8 | 1 | equemene | \fB\&HPL_max(\fR |
9 | 1 | equemene | \fB\&const int\fR |
10 | 1 | equemene | \fI\&N\fR, |
11 | 1 | equemene | \fB\&const void *\fR |
12 | 1 | equemene | \fI\&IN\fR, |
13 | 1 | equemene | \fB\&void *\fR |
14 | 1 | equemene | \fI\&INOUT\fR, |
15 | 1 | equemene | \fB\&const HPL_T_TYPE\fR |
16 | 1 | equemene | \fI\&DTYPE\fR |
17 | 1 | equemene | \fB\&);\fR |
18 | 1 | equemene | .SH DESCRIPTION |
19 | 1 | equemene | \fB\&HPL_max\fR |
20 | 1 | equemene | combines (max) two buffers. |
21 | 1 | equemene | .SH ARGUMENTS |
22 | 1 | equemene | .TP 8 |
23 | 1 | equemene | N (input) const int |
24 | 1 | equemene | On entry, N specifies the length of the buffers to be |
25 | 1 | equemene | combined. N must be at least zero. |
26 | 1 | equemene | .TP 8 |
27 | 1 | equemene | IN (input) const void * |
28 | 1 | equemene | On entry, IN points to the input-only buffer to be combined. |
29 | 1 | equemene | .TP 8 |
30 | 1 | equemene | INOUT (input/output) void * |
31 | 1 | equemene | On entry, INOUT points to the input-output buffer to be |
32 | 1 | equemene | combined. On exit, the entries of this array contains the |
33 | 1 | equemene | combined results. |
34 | 1 | equemene | .TP 8 |
35 | 1 | equemene | DTYPE (input) const HPL_T_TYPE |
36 | 1 | equemene | On entry, DTYPE specifies the type of the buffers operands. |
37 | 1 | equemene | .SH SEE ALSO |
38 | 1 | equemene | .BR HPL_broadcast \ (3), |
39 | 1 | equemene | .BR HPL_reduce \ (3), |
40 | 1 | equemene | .BR HPL_all_reduce \ (3), |
41 | 1 | equemene | .BR HPL_barrier \ (3), |
42 | 1 | equemene | .BR HPL_min \ (3), |
43 | 1 | equemene | .BR HPL_sum \ (3). |