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 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455
|
//
// File: BaseArray.java
// Package: gov.llnl.sidl
// Revision: $Revision: 4434 $
// Modified: $Date: 2005-03-17 09:05:29 -0800 (Thu, 17 Mar 2005) $
// Description: base array for the sidl Java runtime system
//
// Copyright (c) 2000-2001, The Regents of the University of Calfornia.
// Produced at the Lawrence Livermore National Laboratory.
// Written by the Components Team <components@llnl.gov>
// UCRL-CODE-2002-054
// All rights reserved.
//
// This file is part of Babel. For more information, see
// http://www.llnl.gov/CASC/components/. Please read the COPYRIGHT file
// for Our Notice and the LICENSE file for the GNU Lesser General Public
// License.
//
// This program is free software; you can redistribute it and/or modify it
// under the terms of the GNU Lesser General Public License (as published by
// the Free Software Foundation) version 2.1 dated February 1999.
//
// This program is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the IMPLIED WARRANTY OF
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the terms and
// conditions of the GNU Lesser General Public License for more details.
//
// You should have recieved a copy of the GNU Lesser General Public License
// along with this program; if not, write to the Free Software Foundation,
// Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
package gov.llnl.sidl;
/**
* Class <code>BaseArray</code> is the base array for all sidl Java arrays
* in the run-time system. This class provides basic support for bounds
* checking and management of the IOR array pointer object.
*/
public abstract class BaseArray {
protected long d_array;
protected boolean d_owner;
static {
gov.llnl.sidl.BaseClass._registerNatives("gov.llnl.sidl.BaseArray");
}
/**
* Construct an empty array object. This object must be allocated before
* any actions are performed on the array data.
*/
protected BaseArray() {
d_array = 0;
d_owner = true;
}
/**
* Create an array using an IOR array pointer. The pointer value may be
* zero (representing null). If the owner flag is true, then the array
* will be deallocated when this object disappears.
*/
protected BaseArray(long array, boolean owner) {
d_array = array;
d_owner = owner;
}
/**
* Destroy existing array data (if present and owner) and assign the
* new array pointer and owner.
*/
protected void reset(long array, boolean owner) {
destroy();
d_array = array;
d_owner = owner;
}
/**
* Check whether the array referenced by this object is null.
*/
public boolean isNull() {
return d_array == 0;
}
/**
* Native method returns the enumerated type of this array
*/
public native int _type();
/**
* Native method to get the dimension of the array. This method
* will be implemented in subclasses as a native method.
*/
public native int _dim();
/**
* Native method to fetch the specified lower bound of the array.
* This method will be implemented in subclasses as a native method.
* The specified array dimension must be between zero and the array
* dimension minus one. Invalid values will have unpredictable (but
* almost certainly bad) results.
*/
public native int _lower(int dim);
/**
* Native method to fetch the specified upper bound of the array.
* This method will be implemented in subclasses as a native method.
* The specified array dimension must be between zero and the array
* dimension minus one. Invalid values will have unpredictable (but
* almost certainly bad) results.
*/
public native int _upper(int dim);
/**
* Routine to get the length of the array at the specified dimension
*/
public int _length(int dim) {
return 1 + _upper(dim) - lower(dim);
}
/**
* Native method to fetch the stride of the specified dimen of the array.
* This method will be implemented in subclasses as a native method.
* The specified array dimension must be between zero and the array
* dimension minus one. Invalid values will have unpredictable (but
* almost certainly bad) results.
*/
public native int _stride(int dim);
/**
* Native method returns true if array is ColumnOrder.
* This method will be implemented in subclasses as a native method.
*/
public native boolean _isColumnOrder();
/**
* Native method returns true if array if RowOrder.
* This method will be implemented in subclasses as a native method.
*/
public native boolean _isRowOrder();
/**
* Native method adds 1 to array's reference count. Not for users
* but for internal babel stuff.
*/
public native void _addRef();
/**
* Method smartCopy returns a a copy of a borrowed array, or
* increments the reference count of an array that manages it's
* own data. Useful if you wish to keep a copy of an incoming array
*/
public native BaseArray _smartCopy();
/** Deallocate deletes java's reference to the array (calls deleteRef)
* But does not (nessecarily) case the array to be GCed.
*/
public native void _deallocate();
/**
* Native method to destroy the array. This will be called by the
* object finalizer if the array is owned by this object.
*/
public native void _destroy();
/**
* Abstract method to reallocate array data using the specified dimension,
* lower bounds, and upper bounds. This routine assumes that the dimension
* and indices are valid.
*/
public abstract void _reallocate(int dim, int[] lower, int[] upper, boolean isRow);
/**
* Destroy the existing array and make it null. This method deallocates
* the IOR array reference if we are the owner and the reference is not
* null. The new array reference is null.
*/
public void destroy() {
if (d_owner && (d_array != 0)) {
_destroy();
}
d_array = 0;
d_owner = true;
}
/**
* Return the pointer to the implementation of the Array (A special
* function for Object arrays, No touchie!
*
*/
public long get_ior_pointer() {
return d_array;
}
/**
* Set the pointer to the implementation of the Array (A special
* function for Object arrays, No touchie!
*
*/
public void set_ior_pointer(long p) {
d_array = p;
}
/**
* Return the array owner flag (A special function for Object arrays, No touchie!
*/
public boolean get_owner() {
return d_owner;
}
/**
* Return the array owner flag (A special function for Object arrays, No touchie!
*/
public void set_owner(boolean p) {
d_owner = p;
}
/**
* The finalizer of this object deallocates the IOR array reference if
* we are the owner and the referece is not null.
*/
protected void finalize() throws Throwable {
destroy();
}
/**
* Reallocate array data using the specified dimension and lower and
* upper bounds. Old array data is deleted. Each of the lower and upper
* bounds arrays must contain <code>dim</code> elements. Upper array
* bounds are inclusive. An array index out of bounds exception is thrown
* if any of the indices are invalid.
*/
public void reallocate(int dim, int[] lower, int[] upper, boolean isRow) {
destroy();
if ((lower == null) || (upper == null)) {
throw new ArrayIndexOutOfBoundsException("Null array index argument");
}
if ((dim > lower.length) || (dim > upper.length)) {
throw new ArrayIndexOutOfBoundsException("Array dimension mismatch");
}
for (int d = 0; d < dim; d++) {
if (upper[d]+1 < lower[d]) { //An array with 0, -1 as bounds is an empty array.
throw new ArrayIndexOutOfBoundsException("Upper bound less than lower");
}
}
_reallocate(dim, lower, upper, isRow);
}
/**
* Return the dimension of the array. If the array is null, then the
* dimension is zero.
*/
public int dim() {
return isNull() ? 0 : _dim();
}
/**
* Throw a <code>NullPointerException</code> if the array is null.
*/
protected void checkNullArray() {
if (isNull()) {
throw new NullPointerException("Array data has not been allocated");
}
}
/**
* Check that the array is equal to the specified rank. If the array
* ranks do not match, an <code>ArrayIndexOutOfBoundsException</code>
* is thrown. This routine assumes that the array is not null.
*/
protected void checkDimension(int d) {
if (d != _dim()) {
throw new ArrayIndexOutOfBoundsException("Illegal array dimension : "+d);
}
}
/**
* Check that the index is valid for the specified dimension. An
* <code>ArrayIndexOutOfBoundsException</code> is thrown if the index
* is out of bounds. This routine assumes both that the array pointer
* is not null and that the dimension argument is valid.
*/
protected void checkIndexBounds(int i, int d) {
if ((i < _lower(d)) || (i > _upper(d))) {
throw new ArrayIndexOutOfBoundsException("Index "+d+" out of bounds: "+i);
}
}
/**
* Check that the index is valid for the array. A null pointer exception
* is thrown if the arry is null. An array index out of bounds exception
* is thrown if the index is out of bounds.
*/
protected void checkBounds(int i) {
checkNullArray();
checkDimension(1);
checkIndexBounds(i, 0);
}
/**
* Check that the indices are valid for the array. A null pointer
* exception is thrown if the arry is null. An array index out of
* bounds exception is thrown if the index is out of bounds.
*/
protected void checkBounds(int i, int j) {
checkNullArray();
checkDimension(2);
checkIndexBounds(i, 0);
checkIndexBounds(j, 1);
}
/**
* Check that the indices are valid for the array. A null pointer
* exception is thrown if the arry is null. An array index out of
* bounds exception is thrown if the index is out of bounds.
*/
protected void checkBounds(int i, int j, int k) {
checkNullArray();
checkDimension(3);
checkIndexBounds(i, 0);
checkIndexBounds(j, 1);
checkIndexBounds(k, 2);
}
/**
* Check that the indices are valid for the array. A null pointer
* exception is thrown if the arry is null. An array index out of
* bounds exception is thrown if the index is out of bounds.
*/
protected void checkBounds(int i, int j, int k, int l) {
checkNullArray();
checkDimension(4);
checkIndexBounds(i, 0);
checkIndexBounds(j, 1);
checkIndexBounds(k, 2);
checkIndexBounds(l, 3);
}
/**
* Check that the indices are valid for the array. A null pointer
* exception is thrown if the arry is null. An array index out of
* bounds exception is thrown if the index is out of bounds.
*/
protected void checkBounds(int i, int j, int k, int l, int m) {
checkNullArray();
checkDimension(5);
checkIndexBounds(i, 0);
checkIndexBounds(j, 1);
checkIndexBounds(k, 2);
checkIndexBounds(l, 3);
checkIndexBounds(m, 4);
}
/**
* Check that the indices are valid for the array. A null pointer
* exception is thrown if the arry is null. An array index out of
* bounds exception is thrown if the index is out of bounds.
*/
protected void checkBounds(int i, int j, int k, int l, int m, int n) {
checkNullArray();
checkDimension(6);
checkIndexBounds(i, 0);
checkIndexBounds(j, 1);
checkIndexBounds(k, 2);
checkIndexBounds(l, 3);
checkIndexBounds(m, 4);
checkIndexBounds(n, 5);
}
/**
* Check that the indices are valid for the array. A null pointer
* exception is thrown if the arry is null. An array index out of
* bounds exception is thrown if the index is out of bounds.
*/
protected void checkBounds(int i, int j, int k, int l, int m, int n, int o) {
checkNullArray();
checkDimension(7);
checkIndexBounds(i, 0);
checkIndexBounds(j, 1);
checkIndexBounds(k, 2);
checkIndexBounds(l, 3);
checkIndexBounds(m, 4);
checkIndexBounds(n, 5);
checkIndexBounds(o, 6);
}
/**
* Return the lower index of the array corresponding to the specified
* array dimension. This routine will throw a null pointer exception
* if the object is null or an array index out of bounds exception if
* the specified array dimension is not valid.
*/
public int lower(int dim) {
checkNullArray();
return _lower(dim);
}
/**
* Return the upper index of the array corresponding to the specified
* array dimension. The array runs from the lower bound to the upper
* bound, inclusive. This routine will throw a null pointer exception
* if the object is null or an array index out of bounds exception if
* the specified array dimension is not valid.
*/
public int upper(int dim) {
checkNullArray();
return _upper(dim);
}
/**
* Return the stride of the array corresponding to the specified
* array dimension. This routine will throw a null pointer exception
* if the object is null or an array index out of bounds exception if
* the specified array dimension is not valid.
*/
public int stride(int dim) {
checkNullArray();
return _stride(dim);
}
/**
* Holder class for inout and out arguments.
*/
public static class Holder {
private gov.llnl.sidl.BaseArray d_obj;
/**
* Create a holder with a null holdee object.
*/
public Holder() {
d_obj = null;
}
/**
* Create a holder with the specified object.
*/
public Holder(gov.llnl.sidl.BaseArray obj) {
d_obj = obj;
}
/**
* Set the value of the holdee object.
*/
public void set(gov.llnl.sidl.BaseArray obj) {
d_obj = obj;
}
/**
* Get the value of the holdee object.
*/
public gov.llnl.sidl.BaseArray get() {
return d_obj;
}
}
}
|