Home
last modified time | relevance | path

Searched refs:worstCase (Results 1 – 25 of 56) sorted by relevance

123

/dports/www/firefox-esr/firefox-91.8.0/parser/html/
H A DnsHtml5TokenizerCppSupplement.h21 mozilla::CheckedInt<int32_t> worstCase(strBufLen); in EnsureBufferSpace()
22 worstCase += aLength; in EnsureBufferSpace()
23 worstCase += charRefBufLen; in EnsureBufferSpace()
28 worstCase += 2; in EnsureBufferSpace()
29 if (!worstCase.isValid()) { in EnsureBufferSpace()
32 if (worstCase.value() > MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
41 if (worstCase.value() < MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
44 worstCase += 1; in EnsureBufferSpace()
47 mozilla::RoundUpPow2(worstCase.value())); in EnsureBufferSpace()
51 } else if (worstCase.value() > strBuf.length) { in EnsureBufferSpace()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/parser/html/
H A DnsHtml5TokenizerCppSupplement.h21 mozilla::CheckedInt<int32_t> worstCase(strBufLen); in EnsureBufferSpace()
22 worstCase += aLength; in EnsureBufferSpace()
23 worstCase += charRefBufLen; in EnsureBufferSpace()
28 worstCase += 2; in EnsureBufferSpace()
29 if (!worstCase.isValid()) { in EnsureBufferSpace()
32 if (worstCase.value() > MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
41 if (worstCase.value() < MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
44 worstCase += 1; in EnsureBufferSpace()
47 mozilla::RoundUpPow2(worstCase.value())); in EnsureBufferSpace()
51 } else if (worstCase.value() > strBuf.length) { in EnsureBufferSpace()
[all …]
/dports/lang/spidermonkey60/firefox-60.9.0/parser/html/
H A DnsHtml5TokenizerCppSupplement.h21 mozilla::CheckedInt<int32_t> worstCase(strBufLen); in EnsureBufferSpace()
22 worstCase += aLength; in EnsureBufferSpace()
23 worstCase += charRefBufLen; in EnsureBufferSpace()
28 worstCase += 2; in EnsureBufferSpace()
29 if (!worstCase.isValid()) { in EnsureBufferSpace()
32 if (worstCase.value() > MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
41 if (worstCase.value() < MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
44 worstCase += 1; in EnsureBufferSpace()
47 mozilla::RoundUpPow2(worstCase.value())); in EnsureBufferSpace()
51 } else if (worstCase.value() > strBuf.length) { in EnsureBufferSpace()
[all …]
/dports/www/firefox-legacy/firefox-52.8.0esr/parser/html/
H A DnsHtml5TokenizerCppSupplement.h22 CheckedInt<int32_t> worstCase(strBufLen); in EnsureBufferSpace()
23 worstCase += aLength; in EnsureBufferSpace()
24 worstCase += charRefBufLen; in EnsureBufferSpace()
29 worstCase += 2; in EnsureBufferSpace()
30 if (!worstCase.isValid()) { in EnsureBufferSpace()
33 if (worstCase.value() > MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
38 if (!tokenHandler->EnsureBufferSpace(worstCase.value())) { in EnsureBufferSpace()
42 if (worstCase.value() < MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
45 worstCase += 1; in EnsureBufferSpace()
47 strBuf = jArray<char16_t,int32_t>::newFallibleJArray(mozilla::RoundUpPow2(worstCase.value())); in EnsureBufferSpace()
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/parser/html/
H A DnsHtml5TokenizerCppSupplement.h21 mozilla::CheckedInt<int32_t> worstCase(strBufLen); in EnsureBufferSpace()
22 worstCase += aLength; in EnsureBufferSpace()
23 worstCase += charRefBufLen; in EnsureBufferSpace()
28 worstCase += 2; in EnsureBufferSpace()
29 if (!worstCase.isValid()) { in EnsureBufferSpace()
32 if (worstCase.value() > MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
41 if (worstCase.value() < MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
44 worstCase += 1; in EnsureBufferSpace()
47 mozilla::RoundUpPow2(worstCase.value())); in EnsureBufferSpace()
51 } else if (worstCase.value() > strBuf.length) { in EnsureBufferSpace()
[all …]
/dports/www/firefox/firefox-99.0/parser/html/
H A DnsHtml5TokenizerCppSupplement.h21 mozilla::CheckedInt<int32_t> worstCase(strBufLen); in EnsureBufferSpace()
22 worstCase += aLength; in EnsureBufferSpace()
23 worstCase += charRefBufLen; in EnsureBufferSpace()
28 worstCase += 2; in EnsureBufferSpace()
29 if (!worstCase.isValid()) { in EnsureBufferSpace()
32 if (worstCase.value() > MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
41 if (worstCase.value() < MAX_POWER_OF_TWO_IN_INT32) { in EnsureBufferSpace()
44 worstCase += 1; in EnsureBufferSpace()
47 mozilla::RoundUpPow2(worstCase.value())); in EnsureBufferSpace()
51 } else if (worstCase.value() > strBuf.length) { in EnsureBufferSpace()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/wuffs/src/script/
H A Dprint-deflate-huff-table-size.go184 worstCase struct { member
205 z.worstCase.nAssignedCodes[1] = 2
207 z.worstCase.nAssignedCodes[n] = 0
227 z.worstCase.nAssignedCodes.fillPrimaryValues(z.primLen)
239 details += fmt.Sprintf("%3d", z.worstCase.nAssignedCodes[n])
243 nSecondary := z.worstCase.nSecondary
284 if z.worstCase.nSecondary < nSecondary {
285 z.worstCase.nSecondary = nSecondary
286 z.worstCase.nAssignedCodes = z.currCase.nAssignedCodes
287 z.worstCase.nAssignedCodes[codeLen] = nCodes
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/wuffs/src/script/
H A Dprint-deflate-huff-table-size.go184 worstCase struct { member
205 z.worstCase.nAssignedCodes[1] = 2
207 z.worstCase.nAssignedCodes[n] = 0
227 z.worstCase.nAssignedCodes.fillPrimaryValues(z.primLen)
239 details += fmt.Sprintf("%3d", z.worstCase.nAssignedCodes[n])
243 nSecondary := z.worstCase.nSecondary
284 if z.worstCase.nSecondary < nSecondary {
285 z.worstCase.nSecondary = nSecondary
286 z.worstCase.nAssignedCodes = z.currCase.nAssignedCodes
287 z.worstCase.nAssignedCodes[codeLen] = nCodes
/dports/lang/elm/elm-compiler-bootstrap-0.19.1/0.19.1/packages/elm/browser/1.0.1/src/Debugger/
H A DReport.elm61 worstCase Fine (List.map evaluateChange changes)
64 worstCase : Status -> List Status -> Status
65 worstCase status statusList = function
74 worstCase Risky rest
77 worstCase status rest
/dports/java/jtiger/jtiger-2.1.0376/src/org/jtiger/report/html/
H A DOverallResultConverterFactory.java83 TestResultType worstCase = TestResultType.values()[0]; in getResult() local
91 if(type != null && type.compareTo(worstCase) > 0) in getResult()
93 worstCase = type; in getResult()
97 return mapping.getResultMapping(worstCase); in getResult()
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/native/sun/font/layout/
H A DTibetanLayoutEngine.cpp87 le_int32 worstCase = count * 3; // worst case is 3 for Khmer TODO check if 2 is enough in characterProcessing() local
89 outChars = LE_NEW_ARRAY(LEUnicode, worstCase); in characterProcessing()
96 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success); in characterProcessing()
H A DKhmerLayoutEngine.cpp81 le_int32 worstCase = count * 3; // worst case is 3 for Khmer TODO check if 2 is enough in characterProcessing() local
83 outChars = LE_NEW_ARRAY(LEUnicode, worstCase); in characterProcessing()
90 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success); in characterProcessing()
H A DIndicLayoutEngine.cpp131 le_int32 worstCase = count * IndicReordering::getWorstCaseExpansion(fScriptCode); in characterProcessing() local
133 outChars = LE_NEW_ARRAY(LEUnicode, worstCase); in characterProcessing()
140 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success); in characterProcessing()
H A DHangulLayoutEngine.cpp246 le_int32 worstCase = count * 3; in characterProcessing() local
248 outChars = LE_NEW_ARRAY(LEUnicode, worstCase); in characterProcessing()
255 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success); in characterProcessing()
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/native/sun/font/layout/
H A DTibetanLayoutEngine.cpp87 le_int32 worstCase = count * 3; // worst case is 3 for Khmer TODO check if 2 is enough in characterProcessing() local
89 outChars = LE_NEW_ARRAY(LEUnicode, worstCase); in characterProcessing()
96 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success); in characterProcessing()
H A DKhmerLayoutEngine.cpp81 le_int32 worstCase = count * 3; // worst case is 3 for Khmer TODO check if 2 is enough in characterProcessing() local
83 outChars = LE_NEW_ARRAY(LEUnicode, worstCase); in characterProcessing()
90 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success); in characterProcessing()
H A DIndicLayoutEngine.cpp131 le_int32 worstCase = count * IndicReordering::getWorstCaseExpansion(fScriptCode); in characterProcessing() local
133 outChars = LE_NEW_ARRAY(LEUnicode, worstCase); in characterProcessing()
140 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success); in characterProcessing()
H A DHangulLayoutEngine.cpp246 le_int32 worstCase = count * 3; in characterProcessing() local
248 outChars = LE_NEW_ARRAY(LEUnicode, worstCase); in characterProcessing()
255 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success); in characterProcessing()
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/workhorse/vendor/gitlab.com/gitlab-org/gitaly/v14/internal/praefect/reconciler/
H A Dreconciler_benchmark_test.go28 func benchmarkReconcile(b *testing.B, numRepositories int, worstCase bool) {
37 if worstCase {
/dports/devel/gitlab-shell/gitlab-shell-65b8ec55bebd0aea64ac52b9878bafcc2ad992d3/vendor/gitlab.com/gitlab-org/gitaly/v14/internal/praefect/reconciler/
H A Dreconciler_benchmark_test.go29 func benchmarkReconcile(b *testing.B, numRepositories int, worstCase bool) {
38 if worstCase {
/dports/textproc/gitlab-elasticsearch-indexer/gitlab-elasticsearch-indexer-ef1440548effec15831eda2d246dacc43233cefb/vendor/gitlab.com/gitlab-org/gitaly/v14/internal/praefect/reconciler/
H A Dreconciler_benchmark_test.go28 func benchmarkReconcile(b *testing.B, numRepositories int, worstCase bool) {
37 if worstCase {
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/cpp/src/arrow/vendored/uriparser/
H A DUriQuery.c220 const int worstCase = (normalizeBreaks == URI_TRUE ? 6 : 3); in URI_FUNC() local
226 if ((keyLen >= INT_MAX / worstCase) || (valueLen >= INT_MAX / worstCase)) { in URI_FUNC()
229 keyRequiredChars = worstCase * keyLen; in URI_FUNC()
230 valueRequiredChars = worstCase * valueLen; in URI_FUNC()
/dports/databases/arrow/apache-arrow-6.0.1/cpp/src/arrow/vendored/uriparser/
H A DUriQuery.c220 const int worstCase = (normalizeBreaks == URI_TRUE ? 6 : 3); in URI_FUNC() local
226 if ((keyLen >= INT_MAX / worstCase) || (valueLen >= INT_MAX / worstCase)) { in URI_FUNC()
229 keyRequiredChars = worstCase * keyLen; in URI_FUNC()
230 valueRequiredChars = worstCase * valueLen; in URI_FUNC()
/dports/net/uriparser/uriparser-0.9.6/src/
H A DUriQuery.c220 const int worstCase = (normalizeBreaks == URI_TRUE ? 6 : 3); in URI_FUNC() local
226 if ((keyLen >= INT_MAX / worstCase) || (valueLen >= INT_MAX / worstCase)) { in URI_FUNC()
229 keyRequiredChars = worstCase * keyLen; in URI_FUNC()
230 valueRequiredChars = worstCase * valueLen; in URI_FUNC()
/dports/security/vault/vault-1.8.2/vendor/github.com/apache/arrow/cpp/src/arrow/vendored/uriparser/
H A DUriQuery.c220 const int worstCase = (normalizeBreaks == URI_TRUE ? 6 : 3); in URI_FUNC() local
226 if ((keyLen >= INT_MAX / worstCase) || (valueLen >= INT_MAX / worstCase)) { in URI_FUNC()
229 keyRequiredChars = worstCase * keyLen; in URI_FUNC()
230 valueRequiredChars = worstCase * valueLen; in URI_FUNC()

123