/openjdk10/jdk/test/java/nio/Buffer/ |
H A D | Order.java | 26 * @summary Unit test for X-Buffer.order methods 46 ck(bb.asCharBuffer().order(), bb.order()); 47 ck(bb.asShortBuffer().order(), bb.order()); 48 ck(bb.asIntBuffer().order(), bb.order()); 49 ck(bb.asLongBuffer().order(), bb.order()); 50 ck(bb.asFloatBuffer().order(), b [all...] |
H A D | OrderDouble.java | 37 ck(buf.asReadOnlyBuffer().order(), expected); 38 ck(buf.duplicate().order(), expected); 39 ck(buf.slice().order(), expected); 45 ck(buf.order(), nord); 49 ck(buf.order(), nord); 53 ck(buf.order(), nord);
|
H A D | OrderFloat.java | 37 ck(buf.asReadOnlyBuffer().order(), expected); 38 ck(buf.duplicate().order(), expected); 39 ck(buf.slice().order(), expected); 45 ck(buf.order(), nord); 49 ck(buf.order(), nord); 53 ck(buf.order(), nord);
|
H A D | OrderShort.java | 37 ck(buf.asReadOnlyBuffer().order(), expected); 38 ck(buf.duplicate().order(), expected); 39 ck(buf.slice().order(), expected); 45 ck(buf.order(), nord); 49 ck(buf.order(), nord); 53 ck(buf.order(), nord);
|
H A D | OrderChar.java | 37 ck(buf.asReadOnlyBuffer().order(), expected); 38 ck(buf.duplicate().order(), expected); 39 ck(buf.slice().order(), expected); 45 ck(buf.order(), nord); 49 ck(buf.order(), nord); 53 ck(buf.order(), nord);
|
H A D | OrderLong.java | 37 ck(buf.asReadOnlyBuffer().order(), expected); 38 ck(buf.duplicate().order(), expected); 39 ck(buf.slice().order(), expected); 45 ck(buf.order(), nord); 49 ck(buf.order(), nord); 53 ck(buf.order(), nord);
|
H A D | OrderInt.java | 37 ck(buf.asReadOnlyBuffer().order(), expected); 38 ck(buf.duplicate().order(), expected); 39 ck(buf.slice().order(), expected); 45 ck(buf.order(), nord); 49 ck(buf.order(), nord); 53 ck(buf.order(), nord);
|
/openjdk10/jdk/test/java/awt/Focus/FocusTraversalPolicy/ |
H A D | LayoutFTPTest.java | 162 Map<String, String> order = new HashMap<String, String>(); 163 order.put("btn 0", "btn 1"); 164 order.put("btn 1", "btn 2"); 165 order.put("btn 2", "btn 100"); 166 order.put("btn 100", "btn 101"); 167 order.put("btn 101", "btn 102"); 168 order.put("btn 102", "btn 200"); 169 order.put("btn 200", "btn 201"); 170 order.put("btn 201", "btn 202"); 171 order [all...] |
H A D | DefaultFTPTest.java | 161 Map<String, String> order = new HashMap<String, String>(); 162 order.put("btn 0", "btn 1"); 163 order.put("btn 1", "btn 2"); 164 order.put("btn 2", "btn 100"); 165 order.put("btn 100", "btn 101"); 166 order.put("btn 101", "btn 102"); 167 order.put("btn 102", "btn 200"); 168 order.put("btn 200", "btn 201"); 169 order.put("btn 201", "btn 202"); 170 order [all...] |
/openjdk10/jdk/src/jdk.internal.jvmstat/share/classes/sun/jvmstat/perfdata/monitor/ |
H A D | AbstractPerfDataBufferPrologue.java | 44 * jbyte byte_order; // byte order of the buffer 103 // set the byte order 104 this.byteBuffer.order(getByteOrder()); 114 ByteOrder order = byteBuffer.order(); 115 byteBuffer.order(ByteOrder.BIG_ENDIAN); 121 // restore the byte order 122 byteBuffer.order(order); 127 * Get the byte order [all...] |
/openjdk10/hotspot/src/jdk.aot/share/classes/jdk.tools.jaotc.binformat/src/jdk/tools/jaotc/binformat/macho/ |
H A D | MachOByteBuffer.java | 35 buf.order(ByteOrder.LITTLE_ENDIAN); 37 buf.order(ByteOrder.BIG_ENDIAN);
|
/openjdk10/jdk/src/java.base/share/classes/jdk/internal/jimage/decompressor/ |
H A D | CompressedResourceHeader.java | 92 public byte[] getBytes(ByteOrder order) { argument 93 Objects.requireNonNull(order); 95 buffer.order(order); 109 public static CompressedResourceHeader readFromResource(ByteOrder order, argument 111 Objects.requireNonNull(order); 117 buffer.order(order);
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.common/src/org/graalvm/compiler/core/common/alloc/ |
H A D | ComputeBlockOrder.java | 37 * machine code generator. The machine code generation order will start with the first block and 43 * The machine code generator order includes reordering of loop headers such that the backward jump 48 * The linear scan register allocator order has an additional mechanism that prevents merge nodes 52 * algorithm sets the linear scan order number of the block that corresponds to its index in the 53 * linear scan order. 58 * The initial capacities of the worklists used for iteratively finding the block order. 64 * merge node when calculating the linear scan order. A high value means that predecessors of 70 * Computes the block order used for the linear scan register allocator. 75 List<T> order = new ArrayList<>(); 78 computeLinearScanOrder(order, worklis 100 computeCodeEmittingOrder(List<T> order, PriorityQueue<T> worklist, BitSet visitedBlocks) argument 110 computeLinearScanOrder(List<T> order, PriorityQueue<T> worklist, BitSet visitedBlocks) argument 132 addPathToLinearScanOrder(T block, List<T> order, PriorityQueue<T> worklist, BitSet visitedBlocks) argument 162 addPathToCodeEmittingOrder(T initialBlock, List<T> order, PriorityQueue<T> worklist, BitSet visitedBlocks) argument 202 addBlock(T header, List<T> order) argument 247 checkOrder(List<? extends AbstractBlockBase<?>> order, int expectedBlockCount) argument [all...] |
/openjdk10/hotspot/src/jdk.aot/share/classes/jdk.tools.jaotc.binformat/src/jdk/tools/jaotc/binformat/elf/ |
H A D | ElfByteBuffer.java | 36 buf.order(ByteOrder.LITTLE_ENDIAN); 38 buf.order(ByteOrder.BIG_ENDIAN);
|
/openjdk10/jdk/src/java.desktop/share/native/libfontmanager/layout/ |
H A D | LookupProcessor.cpp | 94 for (le_uint16 order = 0; order < lookupOrderCount && LE_SUCCESS(success); order += 1) { 95 le_uint16 lookup = lookupOrderArray[order]; 99 _LETRACE("Processing order#%d/%d", order, lookupOrderCount); 144 le_int32 LookupProcessor::selectLookups(const LEReferenceTo<FeatureTable> &featureTable, FeatureMask featureMask, le_int32 order, LEErrorCode &success) argument 147 le_uint32 store = (le_uint32)order; 164 return store - order; 225 le_int32 count, order local [all...] |
/openjdk10/hotspot/src/jdk.aot/share/classes/jdk.tools.jaotc.binformat/src/jdk/tools/jaotc/binformat/pecoff/ |
H A D | PECoffByteBuffer.java | 34 buf.order(ByteOrder.LITTLE_ENDIAN);
|
/openjdk10/jdk/src/jdk.rmic/share/classes/sun/tools/asm/ |
H A D | ConstantPoolData.java | 50 * Return the order of the constant 52 int order() { method in class:ConstantPoolData
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/asm/ |
H A D | ArrayDataPointerConstant.java | 46 byteBuffer.order(ByteOrder.nativeOrder()); 54 byteBuffer.order(ByteOrder.nativeOrder()); 62 byteBuffer.order(ByteOrder.nativeOrder()); 70 byteBuffer.order(ByteOrder.nativeOrder()); 78 byteBuffer.order(ByteOrder.nativeOrder());
|
/openjdk10/jdk/src/java.base/share/classes/java/text/ |
H A D | CollationElementIterator.java | 68 * The key of a character is an integer composed of primary order(short), 69 * secondary order(byte), and tertiary order(byte). Java strictly defines 93 * <code>CollationElementIterator.next</code> returns the collation order 94 * of the next character. A collation order consists of primary order, 95 * secondary order and tertiary order. The data type of the collation 96 * order is <strong>int</strong>. The first 16 bits of a collation order 362 primaryOrder(int order) argument 372 secondaryOrder(int order) argument 382 tertiaryOrder(int order) argument 392 strengthOrder(int order) argument 489 getMaxExpansion(int order) argument 638 isIgnorable(int order) argument [all...] |
H A D | RBTableBuilder.java | 94 // the combining characters must be in their canonical order 110 // Since rules can be specified in any order in the string 119 int order = 0; 140 order = increment(entry.getStrength(), order); 144 addExpandOrder(groupChars, expChars, order); 148 addOrder(Character.toCodePoint(ch, groupChars.charAt(1)), order); 150 addContractOrder(groupChars, order); 154 addOrder(ch, order); 189 // If so, just map the precomposed character to that order [all...] |
/openjdk10/jdk/src/jdk.crypto.ec/share/native/libsunec/impl/ |
H A D | ecl.c | 69 MP_DIGITS(&group->order) = 0; 80 MP_CHECKOK(mp_init(&group->order, kmflag)); 94 const mp_int *geny, const mp_int *order, int cofactor) 112 MP_CHECKOK(mp_copy(order, &group->order)); 135 const mp_int *geny, const mp_int *order, int cofactor) 155 MP_CHECKOK(mp_copy(order, &group->order)); 180 const mp_int *order, int cofactor) 198 MP_CHECKOK(mp_copy(order, 92 ECGroup_consGFp(const mp_int *irr, const mp_int *curvea, const mp_int *curveb, const mp_int *genx, const mp_int *geny, const mp_int *order, int cofactor) argument 133 ECGroup_consGFp_mont(const mp_int *irr, const mp_int *curvea, const mp_int *curveb, const mp_int *genx, const mp_int *geny, const mp_int *order, int cofactor) argument 177 ECGroup_consGF2m(const mp_int *irr, const unsigned int irr_arr[5], const mp_int *curvea, const mp_int *curveb, const mp_int *genx, const mp_int *geny, const mp_int *order, int cofactor) argument 223 mp_int irr, curvea, curveb, genx, geny, order; local [all...] |
/openjdk10/hotspot/test/native/gc/g1/ |
H A D | test_bufferingOopClosure.cpp | 203 for (int order = 0; order < FakeRoots::MaxOrder; order++) { 204 testCount(0, 0, order); 205 testCount(10, 0, order); 206 testCount(0, 10, order); 207 testCount(10, 10, order); 208 testCount(bl, 10, order); 209 testCount(10, bl, order); 210 testCount(bl, bl, order); [all...] |
/openjdk10/jdk/test/java/text/Collator/ |
H A D | IteratorTest.java | 212 * represented as strings. The character's collation order is determined, 225 int order = iter.next(); 227 if (order == NULLORDER || iter.next() != NULLORDER) { 233 int expansion = iter.getMaxExpansion(order); 253 int order; 254 while ((order = iter.next()) != NULLORDER) { 261 orders[size++] = order; 279 int order; 280 while ((order = iter.next()) != NULLORDER) { 281 buf.append( Integer.toHexString(order) [all...] |
/openjdk10/hotspot/src/os_cpu/linux_ppc/vm/ |
H A D | atomic_linux_ppc.hpp | 303 inline void cmpxchg_pre_membar(cmpxchg_memory_order order) { argument 304 if (order != memory_order_relaxed) { 312 inline void cmpxchg_post_membar(cmpxchg_memory_order order) { argument 313 if (order != memory_order_relaxed) { 326 cmpxchg_memory_order order) const { 347 cmpxchg_pre_membar(order); 386 cmpxchg_post_membar(order); 396 cmpxchg_memory_order order) const { 406 cmpxchg_pre_membar(order); 436 cmpxchg_post_membar(order); [all...] |
/openjdk10/hotspot/src/os_cpu/aix_ppc/vm/ |
H A D | atomic_aix_ppc.hpp | 305 inline void cmpxchg_pre_membar(cmpxchg_memory_order order) { argument 306 if (order != memory_order_relaxed) { 314 inline void cmpxchg_post_membar(cmpxchg_memory_order order) { argument 315 if (order != memory_order_relaxed) { 328 cmpxchg_memory_order order) const { 349 cmpxchg_pre_membar(order); 388 cmpxchg_post_membar(order); 398 cmpxchg_memory_order order) const { 408 cmpxchg_pre_membar(order); 438 cmpxchg_post_membar(order); [all...] |