Searched refs:reverse (Results 1 - 25 of 140) sorted by relevance

123456

/openjdk10/jdk/src/java.base/share/classes/sun/security/provider/certpath/
H A DX509CertificatePair.java48 * CA. The reverse certificate of the CertificatePair contains a certificate
49 * issued by this CA to another CA. When both the forward and the reverse
61 * reverse [1] Certificate OPTIONAL
79 private X509Certificate reverse; field in class:X509CertificatePair
96 * @param reverse The reverse component of the certificate pair
100 public X509CertificatePair(X509Certificate forward, X509Certificate reverse) argument
102 if (forward == null && reverse == null) {
108 this.reverse = reverse;
[all...]
/openjdk10/nashorn/test/script/basic/
H A DJDK-8015355.js53 Object.defineProperty([,,],"0",{ writable: false }).reverse();
91 Array.prototype.reverse.call(Object.defineProperty([,,],"0",{ writable: false }));
117 Array.prototype.reverse.apply(Object.defineProperty([,,],"0",{ writable: false }));
/openjdk10/hotspot/src/share/vm/interpreter/
H A Drewriter.hpp195 void scan_method(Method* m, bool reverse, bool* invokespecial_error);
197 void rewrite_member_reference(address bcp, int offset, bool reverse);
198 void maybe_rewrite_invokehandle(address opc, int cp_index, int cache_index, bool reverse);
199 void rewrite_invokedynamic(address bcp, int offset, bool reverse);
200 void maybe_rewrite_ldc(address bcp, int offset, bool is_wide, bool reverse);
201 void rewrite_invokespecial(address bcp, int offset, bool reverse, bool* invokespecial_error);
H A Drewriter.cpp164 void Rewriter::rewrite_member_reference(address bcp, int offset, bool reverse) { argument
166 if (!reverse) {
171 maybe_rewrite_invokehandle(p - 1, cp_index, cache_index, reverse);
177 maybe_rewrite_invokehandle(p - 1, pool_index, cache_index, reverse);
185 void Rewriter::rewrite_invokespecial(address bcp, int offset, bool reverse, bool* invokespecial_error) { argument
187 if (!reverse) {
196 rewrite_member_reference(bcp, offset, reverse);
199 rewrite_member_reference(bcp, offset, reverse);
205 void Rewriter::maybe_rewrite_invokehandle(address opc, int cp_index, int cache_index, bool reverse) { argument
206 if (!reverse) {
252 rewrite_invokedynamic(address bcp, int offset, bool reverse) argument
318 maybe_rewrite_ldc(address bcp, int offset, bool is_wide, bool reverse) argument
359 scan_method(Method* method, bool reverse, bool* invokespecial_error) argument
[all...]
/openjdk10/jdk/test/java/lang/Long/
H A DBitTwiddle.java64 .reverse().toString();
66 String actual = leftpad(toBinaryString(reverse(x)), 64);
69 throw new RuntimeException("reverse: \n" +
76 if (highestOneBit(x) != reverse(lowestOneBit(reverse(x))))
96 if (numberOfLeadingZeros(x) != numberOfTrailingZeros(reverse(x)))
113 if (bitCount(x) != bitCount(reverse(x)))
H A DToString.java72 sbN.reverse();
73 sbP.reverse();
/openjdk10/jdk/test/java/lang/Integer/
H A DBitTwiddle.java64 .reverse().toString();
66 String actual = leftpad(toBinaryString(reverse(x)), 32);
69 throw new RuntimeException("reverse: \n" +
76 if (highestOneBit(x) != reverse(lowestOneBit(reverse(x))))
96 if (numberOfLeadingZeros(x) != numberOfTrailingZeros(reverse(x)))
113 if (bitCount(x) != bitCount(reverse(x)))
H A DToString.java72 sbN.reverse();
73 sbP.reverse();
/openjdk10/jdk/src/java.desktop/share/native/libfontmanager/layout/
H A DArabicLayoutEngine.h153 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
161 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
236 * @param reverse - if <code>TRUE</code>, the output will be in reverse order
244 virtual void mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, le_bool mirror,
255 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
261 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
H A DArabicLayoutEngine.cpp132 void ArabicOpenTypeLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, argument
145 OpenTypeLayoutEngine::adjustGlyphPositions(chars, offset, count, reverse, glyphStorage, success);
155 adjustMarkGlyphs(&chars[offset], count, reverse, glyphStorage, &filter, success);
203 void UnicodeArabicOpenTypeLayoutEngine::mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, le_bool /*mirror*/, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument
216 if (reverse) {
221 glyphStorage.allocateGlyphArray(count, reverse, success);
228 void UnicodeArabicOpenTypeLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, argument
242 adjustMarkGlyphs(&chars[offset], count, reverse, glyphStorage, &filter, success);
H A DGXLayoutEngine.h144 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse,
H A DGXLayoutEngine2.h143 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse,
H A DThaiLayoutEngine.h156 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
163 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
H A DLayoutEngine.h267 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
274 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
303 * text with the ability to store the glyphs in reverse order, and by supporting
311 * @param reverse - if <code>TRUE</code>, the output will be in reverse order
321 virtual void mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, le_bool mirror, LEGlyphStorage &glyphStorage, LEErrorCode &success);
349 * @param reverse - <code>TRUE</code> if the glyph array has been reordered
357 static void adjustMarkGlyphs(const LEUnicode chars[], le_int32 charCount, le_bool reverse, LEGlyphStorage &glyphStorage, LEGlyphFilter *markFilter, LEErrorCode &success);
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements/src/org/graalvm/compiler/replacements/nodes/
H A DReverseBytesNode.java61 return IntegerStamp.stampForMask(valueStamp.getBits(), Integer.reverse((int) valueStamp.downMask()) & mask, Integer.reverse((int) valueStamp.upMask()) & mask);
63 return IntegerStamp.stampForMask(valueStamp.getBits(), Long.reverse(valueStamp.downMask()), Long.reverse(valueStamp.upMask()));
/openjdk10/jdk/src/java.base/share/classes/java/io/
H A DDeleteOnExitHook.java77 // reverse the list to maintain previous jdk deletion order.
79 Collections.reverse(toBeDeleted);
/openjdk10/jdk/test/javax/net/ssl/DTLS/
H A DReordered.java62 Collections.reverse(packets);
/openjdk10/langtools/test/tools/javac/api/
H A DTestGetElementReferenceData.java34 sb.reverse( /*getElement:METHOD:java.lang.StringBuilder.reverse()*/);
/openjdk10/langtools/test/tools/javac/processing/options/testCommandLineClasses/
H A DTest.java53 test(reverse(names));
56 test(reverse(names));
85 <T> List<T> reverse(List<T> list) { method in class:Test
87 Collections.reverse(newList);
/openjdk10/langtools/test/tools/javap/classfile/deps/
H A DGetDeps.java80 SortedRecorder r = new SortedRecorder(reverse);
106 reverse = true;
132 boolean reverse; field in class:GetDeps
167 public SortedRecorder(boolean reverse) { argument
168 this.reverse = reverse;
172 Location o = (reverse ? d.getTarget() : d.getOrigin());
175 Comparator<Dependency> c = (reverse ? originComparator : targetComparator);
206 boolean reverse; field in class:GetDeps.SortedRecorder
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/arrays/
H A DIteratorAction.java103 final boolean reverse = iter.isReverse();
107 index = iter.nextIndex() + (reverse ? 1 : -1);
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/calc/
H A DFloatConvertNode.java86 public Constant reverse(Constant c, ConstantReflectionProvider constantReflection) { method in class:FloatConvertNode
87 FloatConvertOp reverse = ArithmeticOpTable.forStamp(stamp()).getFloatConvert(op.reverse());
88 return reverse.foldConstant(c);
111 if (other.isLossless() && other.op == this.op.reverse()) {
H A DConvertNode.java41 Constant reverse(Constant c, ConstantReflectionProvider constantReflection); method in interface:ConvertNode
54 * @return true iff reverse(convert(c)) == c for all c
/openjdk10/jdk/test/java/util/Collections/
H A DBigBinarySearch.java87 Comparator<Integer> reverse = Collections.reverseOrder();
88 Comparator<Integer> natural = Collections.reverseOrder(reverse);
98 checkBinarySearch(big, i, reverse);
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.common/src/org/graalvm/compiler/core/common/calc/
H A DFloatConvert.java49 public FloatConvert reverse() { method in class:FloatConvert

Completed in 222 milliseconds

123456