/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph/src/org/graalvm/compiler/graph/ |
H A D | NodeUnionFind.java | 33 private int[] rank; field in class:NodeUnionFind 42 rank = new int[graph.nodeIdCount()]; 77 if (rank[aRoot] < rank[bRoot]) { 81 if (rank[aRoot] == rank[bRoot]) { 82 rank[aRoot]++;
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements.test/src/org/graalvm/compiler/replacements/test/ |
H A D | NewMultiArrayTest.java | 46 private static int rank(ResolvedJavaType type) { method in class:NewMultiArrayTest 65 assert rank(arrayType) == dimensions.length; 66 int rank = dimensions.length; 67 ValueNode[] dimensionNodes = new ValueNode[rank]; 68 for (int i = 0; i < rank; i++) { 102 for (int rank : new int[]{1, 2, 10, 50, 100, 200, 254, 255}) { 103 while (rank(arrayType) != rank) { 107 dimensions = new int[rank]; 108 for (int i = 0; i < rank; [all...] |
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot/src/org/graalvm/compiler/hotspot/nodes/ |
H A D | DimensionsNode.java | 52 protected final int rank; field in class:DimensionsNode 54 public DimensionsNode(@InjectedNodeParameter WordTypes wordTypes, int rank) { argument 56 this.rank = rank; 62 int size = rank * 4; 71 public static native Word allocaDimsArray(@ConstantNodeParameter int rank); argument
|
/openjdk9/jdk/src/jdk.internal.ed/share/classes/jdk/internal/editor/spi/ |
H A D | BuildInEditorProvider.java | 36 * @return the rank of a provider, greater is better. 38 int rank(); method in interface:BuildInEditorProvider
|
/openjdk9/hotspot/src/share/vm/runtime/ |
H A D | mutex.hpp | 94 // NOTE: It is critical that the rank 'special' be the lowest (earliest) 96 // The rank native is only for use in Mutex's created by JVM_RawMonitorCreate, 98 // The rank safepoint is used only for synchronization in reaching a 100 // currently. While at a safepoint no mutexes of rank safepoint are held 102 // The rank named "leaf" is probably historical (and should 103 // be changed) -- mutexes of this rank aren't really leaf mutexes 139 debug_only(int _rank;) // rank (to avoid/detect potential deadlocks) 198 Monitor(int rank, const char *name, bool allow_vm_block = false, 241 debug_only(int rank() const { return _rank; }) 266 PaddedMonitor(int rank, cons argument 316 PaddedMutex(int rank, const char *name, bool allow_vm_block = false, SafepointCheckRequired safepoint_check_required = _safepoint_check_always) argument [all...] |
H A D | mutex.cpp | 933 assert(rank() > Mutex::special, "Potential deadlock with special or lesser rank mutex"); 1027 assert(rank() == native, "invariant"); 1103 if (least != NULL && least->rank() <= special) { 1106 name(), rank(), least->name(), least->rank()); 1107 assert(false, "Shouldn't block(wait) while holding a lock of rank special"); 1240 if (tmp->rank() < res->rank()) { 1246 // in increasing rank orde [all...] |
H A D | mutexLocker.hpp | 55 extern Monitor* CodeCache_lock; // a lock on the CodeCache, rank is special, use MutexLockerEx 164 assert(mutex->rank() != Mutex::special, 172 assert(mutex->rank() != Mutex::special, 207 assert(mutex->rank() > Mutex::special || no_safepoint_check, 208 "Mutexes with rank special or lower should not do safepoint checks");
|
/openjdk9/jaxws/src/jdk.xml.bind/share/classes/com/sun/tools/internal/xjc/reader/ |
H A D | RawTypeSet.java | 104 private final int rank; field in class:RawTypeSet.Mode 106 Mode(int rank) { argument 107 this.rank = rank; 111 switch(Math.max(this.rank,that.rank)) {
|
/openjdk9/jdk/src/jdk.editpad/share/classes/jdk/editpad/ |
H A D | EditPadProvider.java | 41 * @return the rank of a provider, greater is better. 44 public int rank() { method in class:EditPadProvider
|
/openjdk9/langtools/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/taglets/ |
H A D | ParamTaglet.java | 66 * a name/rank number map. If the array is null, then 70 * @return a name-rank number map. 77 int rank = 0; 82 result.put(name, String.valueOf(rank)); 83 rank++; 284 of a rank of a parameter to its name. This is 307 String rank = rankMap.get(ch.getParameterName(dt)); 308 if (rank != null && alreadyDocumented.contains(rank)) { 317 alreadyDocumented.add(rank); [all...] |
/openjdk9/hotspot/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/ |
H A D | Klass.java | 196 /** Array class with specific rank */ 197 public Klass arrayKlass(int rank) { return arrayKlassImpl(false, rank); } argument 201 public Klass arrayKlassOrNull(int rank) { return arrayKlassImpl(true, rank); } argument 204 public Klass arrayKlassImpl(boolean orNull, int rank) { argument
|
/openjdk9/langtools/src/jdk.javadoc/share/classes/com/sun/tools/doclets/internal/toolkit/taglets/ |
H A D | ParamTaglet.java | 57 * a name/rank number map. If the array is null, then 61 * @return a name-rank number map. 263 * of a rank of a parameter to its name. This is 283 String rank = rankMap.get(pt.parameterName()); 284 if (rank != null && alreadyDocumented.contains(rank)) { 293 alreadyDocumented.add(rank);
|
/openjdk9/jdk/src/java.desktop/macosx/classes/sun/font/ |
H A D | CFontManager.java | 84 int rank = 4; 100 ", Font " + fontName + " rank="+rank); 104 family = new FontFamily(familyName, false, rank); 106 } else if (family.getRank() >= rank) {
|
/openjdk9/hotspot/src/share/vm/oops/ |
H A D | typeArrayKlass.hpp | 68 oop multi_allocate(int rank, jint* sizes, TRAPS);
|
H A D | arrayKlass.hpp | 79 virtual oop multi_allocate(int rank, jint* sizes, TRAPS);
|
H A D | klass.hpp | 445 // array class with specific rank 446 Klass* array_klass(int rank, TRAPS) { return array_klass_impl(false, rank, THREAD); } argument 453 Klass* array_klass_or_null(int rank); 463 virtual Klass* array_klass_impl(bool or_null, int rank, TRAPS);
|
H A D | objArrayKlass.cpp | 195 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) { argument 203 if (rank > 1) { 207 oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL); 214 for (int i = 0; i < rank - 1; ++i) {
|
H A D | objArrayKlass.hpp | 75 oop multi_allocate(int rank, jint* sizes, TRAPS);
|
H A D | typeArrayKlass.cpp | 124 oop TypeArrayKlass::multi_allocate(int rank, jint* last_size, TRAPS) { argument 126 assert(rank == 1, "just checking");
|
/openjdk9/jdk/test/jdk/editpad/ |
H A D | EditPadTest.java | 194 if (provider == null || p.rank() > provider.rank()) {
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot/src/org/graalvm/compiler/hotspot/replacements/ |
H A D | NewObjectSnippets.java | 375 public static Object newmultiarray(KlassPointer hub, @ConstantParameter int rank, @VarargsParameter int[] dimensions) { argument 376 Word dims = DimensionsNode.allocaDimsArray(rank); 378 for (int i = 0; i < rank; i++) { 381 return newArrayCall(HotSpotBackend.NEW_MULTI_ARRAY, hub, rank, dims); 385 public static Object newmultiarrayPIC(KlassPointer hub, @ConstantParameter int rank, @VarargsParameter int[] dimensions) { argument 387 return newmultiarray(hubPIC, rank, dimensions); 391 public static native Object newArrayCall(@ConstantNodeParameter ForeignCallDescriptor descriptor, KlassPointer hub, int rank, Word dims); argument 657 int rank = newmultiarrayNode.dimensionCount(); 658 ValueNode[] dims = new ValueNode[rank]; 668 args.addConst("rank", ran [all...] |
/openjdk9/hotspot/src/share/vm/jvmci/ |
H A D | jvmciRuntime.hpp | 136 static void new_multi_array(JavaThread* thread, Klass* klass, int rank, jint* dims);
|
/openjdk9/jdk/src/java.desktop/share/classes/sun/font/ |
H A D | Font2D.java | 44 * believe all are assigned FONT_CONFIG rank, it is conceivable that if 46 * family of its siblings which were assigned FONT_CONFIG rank. Giving 47 * them the same rank is the easy solution for now at least. 180 void setRank(int rank) { argument 181 fontRank = rank;
|
H A D | FontFamily.java | 87 public FontFamily(String name, boolean isLogFont, int rank) { argument 90 familyRank = rank; 247 /* Allow a lower-rank font only if its a file font 254 " of lower rank " + font.getRank() + 256 " of rank " + familyRank);
|
/openjdk9/hotspot/src/share/vm/ci/ |
H A D | ciReplay.cpp | 774 int rank = 0; local 775 while (field_signature[rank] == '[') { 776 rank++; 778 int* dims = NEW_RESOURCE_ARRAY(int, rank); 780 for (int i = 1; i < rank; i++) { 783 value = kelem->multi_allocate(rank, dims, CHECK);
|