| /openjdk9/hotspot/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/ |
| H A D | MultiBranchData.java | 56 int alen = arrayLen() - 2; // get rid of default case here.
57 //assert(alen % perCaseCellCount == 0, "must be even");
58 return (alen / perCaseCellCount);
|
| /openjdk9/jdk/src/java.base/unix/native/launcher/ |
| H A D | jexec.c | 161 size_t alen = 0; /* length of new array */ local
174 alen = (argc + 2) * (sizeof (const char *));
175 if (alen <= 0 || alen > INT_MAX / sizeof(char *)) {
178 nargv = (const char **) malloc(alen);
|
| /openjdk9/jdk/test/tools/pack200/pack200-verifier/src/xmlkit/ |
| H A D | XMLKit.java | 412 int alen = parts.length
415 System.arraycopy(old.parts, old.parts.length - alen,
416 parts, parts.length - alen,
417 alen);
431 int alen = attrLength();
432 int plen = size + (makeFrozen ? 0 : NEED_SLOP) + alen;
435 System.arraycopy(parts, parts.length - alen, copy.parts, plen - alen, alen);
469 int alen
[all...] |
| /openjdk9/jdk/src/java.desktop/share/classes/sun/font/ |
| H A D | GlyphList.java | 227 public boolean setFromChars(FontInfo info, char[] chars, int off, int alen, argument
234 len = alen;
235 if (alen < 0) {
238 len = alen;
|
| /openjdk9/jdk/src/java.base/share/classes/java/util/concurrent/ |
| H A D | Exchanger.java | 355 int alen = a.length;
360 if (j < 0 || j >= alen)
361 j = alen - 1;
|
| /openjdk9/jdk/src/java.desktop/share/classes/sun/awt/image/ |
| H A D | PNGImageDecoder.java | 196 int alen = len;
197 if(red_map!=null) alen = red_map.length;
198 alpha_map = new byte[alen];
199 System.arraycopy(buf,st,alpha_map,0,len<alen ? len : alen);
200 while (--alen>=len) alpha_map[alen] = (byte)0xFF;
|
| /openjdk9/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/arrays/ |
| H A D | IntArrayData.java | 207 final int alen = array.length;
208 if (safeIndex >= alen) {
|
| H A D | NumberArrayData.java | 150 final int alen = array.length;
151 if (safeIndex >= alen) {
|
| H A D | ObjectArrayData.java | 127 final int alen = array.length;
128 if (safeIndex >= alen) {
|
| /openjdk9/jdk/src/java.base/unix/native/libnet/ |
| H A D | net_util_md.c | 1457 int arg, alen; local
1483 alen = sizeof(arg);
1486 getsockopt(fd, SOL_SOCKET, SO_REUSEADDR, (char *)&arg, &alen) == 0)
1494 alen = sizeof(arg);
1495 if (getsockopt(fd, SOL_SOCKET, SO_TYPE, (char *)&arg, &alen) == 0)
|
| /openjdk9/jdk/test/java/lang/invoke/ |
| H A D | InvokeGenericTest.java | 262 int alen = a.length, blen = b.length;
264 T[] c = Arrays.copyOf(a, alen + blen);
265 System.arraycopy(b, 0, c, alen, blen);
|
| H A D | MethodHandlesTest.java | 291 int alen = a.length, blen = b.length;
293 T[] c = Arrays.copyOf(a, alen + blen);
294 System.arraycopy(b, 0, c, alen, blen);
|
| H A D | BigArityTest.java | 349 int alen = 1, blen = b.length;
350 Object[] c = new Object[alen + blen];
352 System.arraycopy(b, 0, c, alen, blen);
|
| /openjdk9/hotspot/src/share/vm/opto/ |
| H A D | macroArrayCopy.cpp | 1258 Node* alen = ac->in(ArrayCopyNode::SrcLen); local
1259 assert(alen != NULL, "need src len");
1262 alen,
1266 alen = ac->in(ArrayCopyNode::DestLen);
1267 assert(alen != NULL, "need dest len");
1270 alen,
|
| H A D | graphKit.cpp | 1165 Node *alen; local
1168 alen = _gvn.transform( new LoadRangeNode(0, immutable_memory(), r_adr, TypeInt::POS));
1170 alen = alloc->Ideal_length();
1172 if (ccast != alen) {
1173 alen = _gvn.transform(ccast);
1176 return alen;
|
| /openjdk9/jdk/src/java.base/share/classes/java/math/ |
| H A D | MutableBigInteger.java | 286 int alen = intLen - ints;
287 if (alen < blen)
289 if (alen > blen)
295 for (int i = offset, j = b.offset; i < alen + offset; i++, j++) {
|
| H A D | BigInteger.java | 1782 int alen = a.mag.length;
1785 int largest = Math.max(alen, blen);
|
| /openjdk9/hotspot/src/share/vm/oops/ |
| H A D | methodData.hpp | 1883 int alen = array_len() - 2; // get rid of default case here.
1884 assert(alen % per_case_cell_count == 0, "must be even");
1885 return (alen / per_case_cell_count);
|
| /openjdk9/hotspot/src/share/vm/prims/ |
| H A D | unsafe.cpp | 905 int alen = cp_patches_h->length();
907 for (int i = alen-1; i >= 0; i--) {
|