| /openjdk7/jdk/src/share/classes/java/util/ |
| H A D | RegularEnumSet.java | 40 * presence of universe[k] in this set.
44 RegularEnumSet(Class<E>elementType, Enum[] universe) { argument
45 super(elementType, universe);
53 if (universe.length != 0)
54 elements = -1L >>> -universe.length;
58 if (universe.length != 0) {
60 elements &= -1L >>> -universe.length; // Mask unused bits
104 return (E) universe[Long.numberOfTrailingZeros(lastReturned)];
|
| H A D | EnumSet.java | 91 final Enum[] universe; field in class:EnumSet
95 EnumSet(Class<E>elementType, Enum[] universe) { argument
97 this.universe = universe;
108 Enum[] universe = getUniverse(elementType);
109 if (universe == null)
112 if (universe.length <= 64)
113 return new RegularEnumSet<>(elementType, universe);
115 return new JumboEnumSet<>(elementType, universe);
|
| H A D | JumboEnumSet.java | 41 * element of this array represents the presence of universe[64*j +i]
49 JumboEnumSet(Class<E>elementType, Enum[] universe) { argument
50 super(elementType, universe);
51 elements = new long[(universe.length + 63) >>> 6];
73 elements[elements.length - 1] >>>= -universe.length;
74 size = universe.length;
80 elements[elements.length - 1] &= (-1L >>> -universe.length);
81 size = universe.length - size;
136 return (E) universe[(lastReturnedIndex << 6)
|
| /openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
| H A D | psTasks.hpp | 56 universe = 1, enumerator in enum:ScavengeRootsTask::RootType
|
| H A D | pcTasks.hpp | 93 universe = 1, enumerator in enum:MarkFromRootsTask::RootType
|
| H A D | psTasks.cpp | 36 #include "memory/universe.hpp"
57 case universe:
|
| H A D | pcTasks.cpp | 33 #include "memory/universe.hpp"
81 case universe:
|
| H A D | psScavenge.cpp | 417 q->enqueue(new ScavengeRootsTask(ScavengeRootsTask::universe));
|
| H A D | psParallelCompact.cpp | 2410 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::universe));
|
| /openjdk7/jdk/test/java/util/EnumMap/ |
| H A D | EnumMapBash.java | 54 Enum[] universe = enumClass.getEnumConstants();
60 int mapSize = universe.length * 7 / 8;
66 Enum[] perm = (Enum[]) universe.clone();
111 for (int i=0; i<universe.length; i += 2) {
112 if (m.put((T)universe[i], (T)universe[i]) != null)
116 for (int i=0; i<universe.length; i++)
117 if (m.containsValue(universe[i]) != (i%2==0))
119 if (m.put((T)universe[0], (T)universe[
[all...] |
| /openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/utilities/ |
| H A D | ReversePtrsAnalysis.java | 65 Universe universe = vm.getUniverse();
66 CollectedHeap collHeap = universe.heap();
|
| /openjdk7/jdk/test/java/util/EnumSet/ |
| H A D | EnumSetBash.java | 55 Enum[] universe = EnumSet.allOf(enumClass).toArray(new Enum[0]);
61 AddRandoms(s1, universe);
62 AddRandoms(s2, universe);
170 static <T extends Enum<T>> void AddRandoms(EnumSet<T> s, Enum[] universe) { argument
171 for (int i=0; i < universe.length * 2 / 3; i++) {
172 T e = (T) universe[rnd.nextInt(universe.length)];
|
| /openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/runtime/ |
| H A D | VM.java | 43 universe, object heap, interpreter, etc. It is a Singleton and
78 private Universe universe; field in class:VM
272 // Note that we don't construct universe, heap, threads,
567 if (universe == null) {
568 universe = new Universe();
570 return universe;
|
| /openjdk7/jdk/src/share/classes/java/lang/ |
| H A D | Class.java | 3057 T[] universe = getEnumConstantsShared();
3058 if (universe == null)
3061 Map<String, T> m = new HashMap<>(2 * universe.length);
3062 for (T constant : universe)
|
| /openjdk7/hotspot/src/share/vm/utilities/ |
| H A D | debug.cpp | 38 #include "memory/universe.hpp"
459 extern "C" void universe() { function
460 Command c("universe");
469 Command c("universe verify");
|
| /openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/utilities/soql/ |
| H A D | sa.js | 58 sa.heap = sa.vm.universe.heap();
|