/openjdk10/jdk/src/java.desktop/share/native/libfontmanager/layout/ |
H A D | CoverageTables.cpp | 73 le_uint16 count = SWAPW(glyphCount); local 74 le_uint8 bit = OpenTypeUtilities::highBit(count); 76 le_uint16 extra = count - power; 80 if (count == 0) { 84 LEReferenceToArrayOf<TTGlyphID>(base, success, glyphArray, count); 112 le_uint16 count = SWAPW(rangeCount); local 114 LEReferenceToArrayOf<GlyphRangeRecord> rangeRecordArrayRef(base, success, rangeRecordArray, count);
|
H A D | ArabicLayoutEngine.cpp | 93 // Returns: output character count 94 le_int32 ArabicOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, argument 102 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) { 107 outChars = LE_NEW_ARRAY(LEUnicode, count); 114 glyphStorage.allocateGlyphArray(count, rightToLeft, success); 122 CanonShaping::reorderMarks(&chars[offset], count, rightToLeft, outChars, glyphStorage); 127 ArabicShaping::shape(chars, offset, count, max, rightToLeft, glyphStorage); 129 return count; 132 void ArabicOpenTypeLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_boo argument 203 mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, le_bool , LEGlyphStorage &glyphStorage, LEErrorCode &success) argument 228 adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument [all...] |
H A D | KhmerLayoutEngine.cpp | 68 // Returns: output character count 69 le_int32 KhmerOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument 76 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) { 81 le_int32 worstCase = count * 3; // worst case is 3 for Khmer TODO check if 2 is enough 100 le_int32 outCharCount = KhmerReordering::reorder(&chars[offset], count, fScriptCode, outChars, glyphStorage);
|
H A D | TibetanLayoutEngine.cpp | 74 // Returns: output character count 75 le_int32 TibetanOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument 82 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) { 87 le_int32 worstCase = count * 3; // worst case is 3 for Khmer TODO check if 2 is enough 106 le_int32 outCharCount = TibetanReordering::reorder(&chars[offset], count, fScriptCode, outChars, glyphStorage);
|
/openjdk10/jdk/test/java/rmi/MarshalledObject/ |
H A D | MOFilterTest.java | 82 int count = filter1.getCount(); 85 int expectedCount = withFilter ? count + 2 : count; 118 private int count; // count of calls to the filter field in class:MOFilterTest.CountingFilter 121 count = 0; 125 return count; 135 count++;
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot.test/src/org/graalvm/compiler/hotspot/test/ |
H A D | AheadOfTimeCompilationTest.java | 76 assertDeepEquals(1, getConstantNodes(result).count()); 79 assertDeepEquals(2, result.getNodes().filter(ReadNode.class).count()); 85 assertDeepEquals(1, getConstantNodes(result).count()); 87 assertDeepEquals(0, result.getNodes().filter(ReadNode.class).count()); 99 assertDeepEquals(1, filter.count()); 103 assertDeepEquals(1, result.getNodes().filter(ReadNode.class).count()); 111 assertDeepEquals(1, filter.count()); 115 assertDeepEquals(0, result.getNodes().filter(ReadNode.class).count()); 126 assertDeepEquals(1, filter.count()); 130 assertDeepEquals(2, result.getNodes().filter(ReadNode.class).count()); [all...] |
/openjdk10/jaxws/src/java.xml.ws/share/classes/com/sun/xml/internal/messaging/saaj/packaging/mime/util/ |
H A D | UUDecoderStream.java | 191 int count = line.charAt(0); 192 if (count < ' ') 201 count = (count - ' ') & 0x3f; 203 if (count == 0) { 211 int need = ((count * 8)+5)/6; 212 //System.out.println("count " + count + ", need " + need + ", len " + line.length()); 224 while (bufsize < count) { 225 // continue decoding until we get 'count' decode [all...] |
/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xpath/internal/axes/ |
H A D | ReverseAxesWalker.java | 114 * reverse axes count, for the moment this re-searches the axes 131 int count = m_proximityPositions[predicateIndex]; 133 if (count <= 0) 150 count++; 155 count++; 158 m_proximityPositions[predicateIndex] = count; 171 return count; 197 int count = 0; 213 // count = 1; 218 count [all...] |
/openjdk10/jdk/test/com/sun/net/httpserver/bugs/ |
H A D | B6393710.java | 109 int count = 0; 115 if (c == expected.charAt (count)) { 116 count ++; 117 if (count == expLen) { 121 count = 0; 135 int count = 0; 140 count ++; 142 if (count != 22) { 143 System.out.println ("Handler expected 22. got " + count);
|
/openjdk10/jdk/test/sun/net/www/protocol/http/ |
H A D | ChunkedErrorStream.java | 120 int count = 0, ret; 123 count += ret; 129 if (count == 0) 132 if (times >= 1 && count != (4096+10)) 133 throw new RuntimeException("Failed: ErrorStream returning " + count + 136 System.out.println("Read " + count + " bytes from the errorStream"); 177 /* count greater than 0, slow response */ 178 static int count = 0; field in class:ChunkedErrorStream.SecondHandler 186 if (count > 0) { 190 count [all...] |
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.jtt/src/org/graalvm/compiler/jtt/threads/ |
H A D | Object_wait01.java | 44 count++; 51 static volatile int count = 0; field in class:Object_wait01 56 count = 0; 60 while (count < i) { 64 return count >= i;
|
/openjdk10/hotspot/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/memory/ |
H A D | AltHashing.java | 31 int count = len; 36 while (count >= 4) { 42 count -= 4; 57 if (count > 0) { 60 switch (count) {
|
/openjdk10/hotspot/test/gc/stress/gcbasher/ |
H A D | ByteCursor.java | 79 int count = 0; 81 while (count < length) { 86 count++; 95 count += 2; 104 count += 3;
|
/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xml/internal/dtm/ref/ |
H A D | DTMAxisIterNodeList.java | 108 int count = m_cachedNodes.size(); 110 if (count > index) { 114 while (count <= index 117 count++; 120 m_last = count;
|
/openjdk10/jdk/src/java.base/share/classes/sun/security/tools/ |
H A D | PathList.java | 68 int count = 0; 72 urls[count++] = url; 75 if (urls.length != count) { 76 URL[] tmp = new URL[count]; 77 System.arraycopy(urls, 0, tmp, 0, count);
|
/openjdk10/jdk/src/java.base/share/classes/sun/text/normalizer/ |
H A D | VersionInfo.java | 68 int count = 0; 71 while (count < 4 && index < length) { 74 count ++; 81 array[count] *= 10; 82 array[count] += c;
|
/openjdk10/jdk/src/java.base/share/classes/java/util/ |
H A D | DoubleSummaryStatistics.java | 31 * A state object for collecting statistics such as count, min, max, sum, and 52 * This computes, in a single pass, the count of people, as well as the minimum, 64 private long count; field in class:DoubleSummaryStatistics 72 * Construct an empty instance with zero count, zero sum, 85 ++count; 100 count += other.count; 120 * Return the count of values recorded. 122 * @return the count of values 125 return count; [all...] |
H A D | IntSummaryStatistics.java | 31 * A state object for collecting statistics such as count, min, max, sum, and 52 * This computes, in a single pass, the count of people, as well as the minimum, 66 private long count; field in class:IntSummaryStatistics 72 * Construct an empty instance with zero count, zero sum, 85 ++count; 98 count += other.count; 105 * Returns the count of values recorded. 107 * @return the count of values 110 return count; [all...] |
H A D | LongSummaryStatistics.java | 32 * A state object for collecting statistics such as count, min, max, sum, and 53 * This computes, in a single pass, the count of people, as well as the minimum, 67 private long count; field in class:LongSummaryStatistics 73 * Construct an empty instance with zero count, zero sum, 96 ++count; 110 count += other.count; 117 * Returns the count of values recorded. 119 * @return the count of values 122 return count; [all...] |
/openjdk10/jdk/src/java.base/share/classes/java/io/ |
H A D | DataInputStream.java | 200 int count = in.read(b, off + n, len - n); 201 if (count < 0) 203 n += count; 611 int count = 0; 616 while (count < utflen) { 617 c = (int) bytearr[count] & 0xff; 619 count++; 623 while (count < utflen) { 624 c = (int) bytearr[count] & 0xff; 628 count [all...] |
/openjdk10/jdk/test/java/io/charStreams/ |
H A D | BufferSizes.java | 35 static int count = 1000; field in class:BufferSizes 41 = new BufferedInputStream(new ABCInputStream(count, chunk), sz); 43 = new BufferedOutputStream(new ABCOutputStream(count), sz); 58 = new BufferedReader(new InputStreamReader(new ABCInputStream(count, chunk)), sz); 60 = new BufferedWriter(new OutputStreamWriter(new ABCOutputStream(count)), sz);
|
/openjdk10/langtools/test/jdk/javadoc/doclet/DocRootSlash/ |
H A D | DocRootSlash.java | 74 int count = 0; 84 compareActualToExpected(++count, fileString); 115 void compareActualToExpected(int count, String str) { argument 120 Pattern.compile("Sub-test " + count + " Actual: " + prefix + ref1, Pattern.DOTALL); 122 Pattern.compile("Sub-test " + count + " Expect: " + prefix + ref1, Pattern.DOTALL);
|
/openjdk10/nashorn/samples/ |
H A D | javafoovars.js | 51 // count "foo"-s in the given .java files 62 // subclass SimpleTreeVisitor - to count variables called "foo" 80 // for each ".java" file in directory (recursively) count "foo". 87 var count = 0; 89 count = countFoo(p.toFile().getAbsolutePath()); 93 if (count != 0) { 94 print(name + ": " + count); 96 totalCount += count; 99 print("Total foo count: " + totalCount);
|
/openjdk10/langtools/test/tools/javac/lambda/lambdaExpression/ |
H A D | LambdaTest2.java | 35 private static int count = 0; field in class:LambdaTest2 49 test.method2((int n) -> { count += n; }); 50 assertTrue(count == 10); 62 test.method3(()-> { count++; }); 64 assertTrue(count == 11);
|
/openjdk10/jdk/src/java.base/share/classes/java/util/stream/ |
H A D | Streams.java | 153 * number of elements to a count lower than this threshold. 276 * number of elements to a count lower than this threshold. 298 int count; field in class:Streams.AbstractStreamBuilderImpl 301 // count == -1 for no elements 302 // count == -2 for one element held by first 311 return -count - 1; 325 // valid if count == 1 329 // non-null if count == 2 344 count = -2; 351 if (count [all...] |