1 //******************************************************************************
2 //
3 // File: ByteMatrixBuf_1.java
4 // Package: edu.rit.mp.buf
5 // Unit: Class edu.rit.mp.buf.ByteMatrixBuf_1
6 //
7 // This Java source file is copyright (C) 2009 by Alan Kaminsky. All rights
8 // reserved. For further information, contact the author, Alan Kaminsky, at
9 // ark@cs.rit.edu.
10 //
11 // This Java source file is part of the Parallel Java Library ("PJ"). PJ is free
12 // software; you can redistribute it and/or modify it under the terms of the GNU
13 // General Public License as published by the Free Software Foundation; either
14 // version 3 of the License, or (at your option) any later version.
15 //
16 // PJ is distributed in the hope that it will be useful, but WITHOUT ANY
17 // WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
18 // A PARTICULAR PURPOSE. See the GNU General Public License for more details.
19 //
20 // Linking this library statically or dynamically with other modules is making a
21 // combined work based on this library. Thus, the terms and conditions of the GNU
22 // General Public License cover the whole combination.
23 //
24 // As a special exception, the copyright holders of this library give you
25 // permission to link this library with independent modules to produce an
26 // executable, regardless of the license terms of these independent modules, and
27 // to copy and distribute the resulting executable under terms of your choice,
28 // provided that you also meet, for each linked independent module, the terms
29 // and conditions of the license of that module. An independent module is a module
30 // which is not derived from or based on this library. If you modify this library,
31 // you may extend this exception to your version of the library, but you are not
32 // obligated to do so. If you do not wish to do so, delete this exception
33 // statement from your version.
34 //
35 // A copy of the GNU General Public License is provided in the file gpl.txt. You
36 // may also obtain a copy of the GNU General Public License on the World Wide
37 // Web at http://www.gnu.org/licenses/gpl.html.
38 //
39 //******************************************************************************
40 package edu.rit.mp.buf;
41
42 import java.nio.ByteBuffer;
43
44 import edu.rit.mp.Buf;
45 import edu.rit.pj.reduction.ByteOp;
46 import edu.rit.pj.reduction.Op;
47 import edu.rit.util.Range;
48
49 /**
50 * Class ByteMatrixBuf_1 provides a buffer for a matrix of byte items sent or
51 * received using the Message Protocol (MP). The matrix row and column strides
52 * must both be 1. While an instance of class ByteMatrixBuf_1 may be constructed
53 * directly, normally you will use a factory method in class {@linkplain
54 * edu.rit.mp.ByteBuf ByteBuf}. See that class for further information.
55 *
56 * @author Alan Kaminsky
57 * @version 05-Apr-2009
58 */
59 public class ByteMatrixBuf_1
60 extends ByteMatrixBuf {
61
62 // Exported constructors.
63 /**
64 * Construct a new byte matrix buffer. It is assumed that the rows and
65 * columns of <code>theMatrix</code> are allocated and that each row of
66 * <code>theMatrix</code> has the same number of columns.
67 *
68 * @param theMatrix Matrix.
69 * @param theRowRange Range of rows to include. The stride is assumed to be
70 * 1.
71 * @param theColRange Range of columns to include. The stride is assumed to
72 * be 1.
73 */
74 public ByteMatrixBuf_1(byte[][] theMatrix,
75 Range theRowRange,
76 Range theColRange) {
77 super(theMatrix, theRowRange, theColRange);
78 }
79
80 // Exported operations.
81 /**
82 * {@inheritDoc}
83 *
84 * Obtain the given item from this buffer.
85 * <P>
86 * The <code>get()</code> method must not block the calling thread; if it does,
87 * all message I/O in MP will be blocked.
88 */
89 public byte get(int i) {
90 return myMatrix[i2r(i) + myLowerRow][i2c(i) + myLowerCol];
91 }
92
93 /**
94 * {@inheritDoc}
95 *
96 * Store the given item in this buffer.
97 * <P>
98 * The <code>put()</code> method must not block the calling thread; if it does,
99 * all message I/O in MP will be blocked.
100 */
101 public void put(int i,
102 byte item) {
103 myMatrix[i2r(i) + myLowerRow][i2c(i) + myLowerCol] = item;
104 }
105
106 /**
107 * {@inheritDoc}
108 *
109 * Create a buffer for performing parallel reduction using the given binary
110 * operation. The results of the reduction are placed into this buffer.
111 * @exception ClassCastException (unchecked exception) Thrown if this
112 * buffer's element data type and the given binary operation's argument data
113 * type are not the same.
114 */
115 public Buf getReductionBuf(Op op) {
116 return new ByteMatrixReductionBuf_1(myMatrix, myRowRange, myColRange, (ByteOp) op);
117 }
118
119 // Hidden operations.
120 /**
121 * {@inheritDoc}
122 *
123 * Send as many items as possible from this buffer to the given byte buffer.
124 * <P>
125 * The <code>sendItems()</code> method must not block the calling thread; if it
126 * does, all message I/O in MP will be blocked.
127 */
128 protected int sendItems(int i,
129 ByteBuffer buffer) {
130 int n = 0;
131 int r = i2r(i);
132 int row = r + myLowerRow;
133 int c = i2c(i);
134 int col = c + myLowerCol;
135 int ncols = Math.min(myColCount - c, buffer.remaining());
136 while (r < myRowCount && ncols > 0) {
137 buffer.put(myMatrix[row], col, ncols);
138 n += ncols;
139 ++r;
140 ++row;
141 c = 0;
142 col = myLowerCol;
143 ncols = Math.min(myColCount, buffer.remaining());
144 }
145 return n;
146 }
147
148 /**
149 * {@inheritDoc}
150 *
151 * Receive as many items as possible from the given byte buffer to this
152 * buffer.
153 * <P>
154 * The <code>receiveItems()</code> method must not block the calling thread; if
155 * it does, all message I/O in MP will be blocked.
156 */
157 protected int receiveItems(int i,
158 int num,
159 ByteBuffer buffer) {
160 num = Math.min(num, buffer.remaining());
161 int n = 0;
162 int r = i2r(i);
163 int row = r + myLowerRow;
164 int c = i2c(i);
165 int col = c + myLowerCol;
166 int ncols = Math.min(myColCount - c, num);
167 while (r < myRowCount && ncols > 0) {
168 buffer.get(myMatrix[row], col, ncols);
169 num -= ncols;
170 n += ncols;
171 ++r;
172 ++row;
173 col = myLowerCol;
174 ncols = Math.min(myColCount, num);
175 }
176 return n;
177 }
178
179 }