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