View Javadoc
1   //******************************************************************************
2   //
3   // File:    Unsigned8BitIntegerMatrixBuf_1.java
4   // Package: edu.rit.mp.buf
5   // Unit:    Class edu.rit.mp.buf.Unsigned8BitIntegerMatrixBuf_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.IntegerOp;
46  import edu.rit.pj.reduction.Op;
47  import edu.rit.util.Range;
48  
49  /**
50   * Class Unsigned8BitIntegerMatrixBuf_1 provides a buffer for a matrix of
51   * unsigned 8-bit integer items sent or received using the Message Protocol
52   * (MP). The matrix row and column strides must both be 1. While an instance of
53   * class Unsigned8BitIntegerMatrixBuf_1 may be constructed directly, normally
54   * you will use a factory method in class {@linkplain
55   * edu.rit.mp.Unsigned8BitIntegerBuf Unsigned8BitIntegerBuf}. See that class for
56   * further information.
57   *
58   * @author Alan Kaminsky
59   * @version 05-Apr-2009
60   */
61  public class Unsigned8BitIntegerMatrixBuf_1
62          extends Unsigned8BitIntegerMatrixBuf {
63  
64  // Exported constructors.
65      /**
66       * Construct a new unsigned 8-bit integer matrix buffer. It is assumed that
67       * the rows and columns of <code>theMatrix</code> are allocated and that each
68       * row of <code>theMatrix</code> has the same number of columns.
69       *
70       * @param theMatrix Matrix.
71       * @param theRowRange Range of rows to include. The stride is assumed to be
72       * 1.
73       * @param theColRange Range of columns to include. The stride is assumed to
74       * be 1.
75       */
76      public Unsigned8BitIntegerMatrixBuf_1(int[][] theMatrix,
77              Range theRowRange,
78              Range theColRange) {
79          super(theMatrix, theRowRange, theColRange);
80      }
81  
82  // Exported operations.
83      /**
84       * {@inheritDoc}
85       *
86       * Obtain the given item from this buffer.
87       * <P>
88       * The <code>get()</code> method must not block the calling thread; if it does,
89       * all message I/O in MP will be blocked.
90       */
91      public int get(int i) {
92          return myMatrix[i2r(i) + myLowerRow][i2c(i) + myLowerCol];
93      }
94  
95      /**
96       * {@inheritDoc}
97       *
98       * Store the given item in this buffer.
99       * <P>
100      * The <code>put()</code> method must not block the calling thread; if it does,
101      * all message I/O in MP will be blocked.
102      */
103     public void put(int i,
104             int item) {
105         myMatrix[i2r(i) + myLowerRow][i2c(i) + myLowerCol] = item;
106     }
107 
108     /**
109      * {@inheritDoc}
110      *
111      * Create a buffer for performing parallel reduction using the given binary
112      * operation. The results of the reduction are placed into this buffer.
113      * @exception ClassCastException (unchecked exception) Thrown if this
114      * buffer's element data type and the given binary operation's argument data
115      * type are not the same.
116      */
117     public Buf getReductionBuf(Op op) {
118         return new Unsigned8BitIntegerMatrixReductionBuf_1(myMatrix, myRowRange, myColRange, (IntegerOp) op);
119     }
120 
121 // Hidden operations.
122     /**
123      * {@inheritDoc}
124      *
125      * Send as many items as possible from this buffer to the given byte buffer.
126      * <P>
127      * The <code>sendItems()</code> method must not block the calling thread; if it
128      * does, all message I/O in MP will be blocked.
129      */
130     protected int sendItems(int i,
131             ByteBuffer buffer) {
132         int n = 0;
133         int r = i2r(i);
134         int row = r + myLowerRow;
135         int c = i2c(i);
136         int col = c + myLowerCol;
137         int ncols = Math.min(myColCount - c, buffer.remaining());
138         while (r < myRowCount && ncols > 0) {
139             int[] myMatrix_row = myMatrix[row];
140             while (c < ncols) {
141                 buffer.put((byte) myMatrix_row[col]);
142                 ++c;
143                 ++col;
144             }
145             n += ncols;
146             ++r;
147             ++row;
148             c = 0;
149             col = myLowerCol;
150             ncols = Math.min(myColCount, buffer.remaining());
151         }
152         return n;
153     }
154 
155     /**
156      * {@inheritDoc}
157      *
158      * Receive as many items as possible from the given byte buffer to this
159      * buffer.
160      * <P>
161      * The <code>receiveItems()</code> method must not block the calling thread; if
162      * it does, all message I/O in MP will be blocked.
163      */
164     protected int receiveItems(int i,
165             int num,
166             ByteBuffer buffer) {
167         num = Math.min(num, buffer.remaining());
168         int n = 0;
169         int r = i2r(i);
170         int row = r + myLowerRow;
171         int c = i2c(i);
172         int col = c + myLowerCol;
173         int ncols = Math.min(myColCount - c, num);
174         while (r < myRowCount && ncols > 0) {
175             int[] myMatrix_row = myMatrix[row];
176             for (c = 0; c < ncols; ++c) {
177                 myMatrix_row[col] = buffer.get() & 0xFF;
178                 ++col;
179             }
180             num -= ncols;
181             n += ncols;
182             ++r;
183             ++row;
184             col = myLowerCol;
185             ncols = Math.min(myColCount, num);
186         }
187         return n;
188     }
189 
190 }