Mercurial > hg > truffle

comparison agent/src/share/classes/sun/jvm/hotspot/utilities/soql/JSJavaArray.java @ 0:a61af66fc99e jdk7-b24

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Initial load
author duke
date Sat, 01 Dec 2007 00:00:00 +0000
parents
children c18cbe5936b8
comparison
equal deleted inserted replaced
-1:000000000000 0:a61af66fc99e
1 /*
2 * Copyright 2003-2007 Sun Microsystems, Inc. All Rights Reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
24
25 package sun.jvm.hotspot.utilities.soql;
26
27 import sun.jvm.hotspot.oops.*;
28
29 /**
30 This is JavaScript wrapper for Java Array.
31 */
32
33 public abstract class JSJavaArray extends JSJavaObject {
34 public JSJavaArray(Array array, JSJavaFactory fac) {
35 super(array, fac);
36 type = (JSJavaArrayKlass) fac.newJSJavaKlass(array.getKlass());
37 }
38
39 public final Array getArray() {
40 return (Array) getOop();
41 }
42
43 public final JSJavaClass getJSJavaClass() {
44 return type.getJSJavaClass();
45 }
46
47 public Object get(String name) {
48 if (name.equals("length")) {
49 return new Integer((int)getArray().getLength());
50 } else {
51 return super.get(name);
52 }
53 }
54
55 public Object get(int index) {
56 return (isInRange(index)) ? type.getFieldValue(index, getArray())
57 : super.get(index);
58 }
59
60 public Object[] getIds() {
61 Object[] superFields = super.getIds();
62 final int len = (int) getArray().getLength();
63 Object[] res = new Object[superFields.length + len];
64 for (int i = 0; i < len; i++) {
65 res[i] = new Integer(i);
66 }
67 System.arraycopy(superFields, 0, res, len, superFields.length);
68 return res;
69 }
70
71 public boolean has(String name) {
72 if (name.equals("length")) {
73 return true;
74 } else {
75 return super.has(name);
76 }
77 }
78
79 public boolean has(int index) {
80 if (isInRange(index)) {
81 return true;
82 } else {
83 return super.has(index);
84 }
85 }
86
87 public void put(String name, Object value) {
88 if (! name.equals("length")) {
89 super.put(name, value);
90 }
91 }
92
93 public void put(int index, Object value) {
94 if (! isInRange(index)) {
95 super.put(index, value);
96 }
97 }
98
99 //-- Internals only below this point
100 private boolean isInRange(int index) {
101 return index >= 0 && index < getArray().getLength();
102 }
103
104 private JSJavaArrayKlass type;
105 }