Home
last modified time | relevance | path

Searched +full:p +full:- +full:limit (Results 1 – 25 of 1075) sorted by relevance

12345678910>>...43

/third_party/skia/third_party/externals/freetype/src/gxvalid/
Dgxvjust.c7 * Copyright (C) 2005-2021 by
22 * Development of gxlayout is supported by the Information-technology
45 * https://developer.apple.com/fonts/TrueType-Reference-Manual/RM06/Chap6just.html
47 * ----------------------------------------------
53 * ----------------------------------------------
77 if ( gid < gxvalid->face->num_glyphs ) in gxv_just_check_max_gid()
82 msg_tag, gid, gxvalid->face->num_glyphs )); in gxv_just_check_max_gid()
89 FT_Bytes limit, in gxv_just_wdp_entry_validate() argument
92 FT_Bytes p = table; in gxv_just_wdp_entry_validate() local
105 justClass = FT_NEXT_ULONG( p ); in gxv_just_wdp_entry_validate()
[all …]
Dgxvcommn.c7 * Copyright (C) 2004-2021 by
22 * Development of gxlayout is supported by the Information-technology
53 return *(FT_UShort*)a - *(FT_UShort*)b; in gxv_compare_ushort_offset()
62 FT_UShort limit, in gxv_set_length_by_ushort_offset() argument
73 buff[nmemb] = limit; in gxv_set_length_by_ushort_offset()
78 if ( buff[nmemb] > limit ) in gxv_set_length_by_ushort_offset()
93 *(length[i]) = (FT_UShort)( buff[j + 1] - buff[j] ); in gxv_set_length_by_ushort_offset()
118 return -1; in gxv_compare_ulong_offset()
131 FT_ULong limit, in gxv_set_length_by_ulong_offset() argument
142 buff[nmemb] = limit; in gxv_set_length_by_ulong_offset()
[all …]
/third_party/skia/third_party/externals/freetype/src/psaux/
Dpsconv.c7 * Copyright (C) 2006-2021 by
37 /* digits (both decimal and non-decimal) into numbers. */
45 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
46 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
47 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
48 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, -1, -1, -1, -1, -1, -1,
49 -1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
50 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, -1,
51 -1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
52 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, -1,
[all …]
/third_party/icu/icu4c/source/common/
Dlocaleprioritylist.cpp25 return locale->hashCode(); in hashLocale()
42 int32_t diff = other.weight - weight; // descending: other-this in compare()
44 return index - other.index; in compare()
50 return static_cast<const LocaleAndWeight *>(left)-> in compareLocaleAndWeight()
54 const char *skipSpaces(const char *p, const char *limit) { in skipSpaces() argument
55 while (p < limit && *p == ' ') { ++p; } in skipSpaces()
56 return p; in skipSpaces()
59 int32_t findTagLength(const char *p, const char *limit) { in findTagLength() argument
60 // Look for accept-language delimiters. in findTagLength()
63 for (q = p; q < limit; ++q) { in findTagLength()
[all …]
Dnormalizer2impl.cpp6 * Copyright (C) 2009-2014, International Business Machines
11 * encoding: UTF-8
50 * UTF-8 lead byte for minNoMaybeCP.
66 * Returns the code point from one single well-formed UTF-8 byte sequence
69 * Trie UTF-8 macros do not assemble whole code points (for efficiency).
71 * We should not need it for normalization-inert data (norm16==0).
72 * Illegal sequences yield the error value norm16==0 just like real normalization-inert code points.
78 switch(cpLimit-cpStart) { in codePointFromValidUTF8()
94 * Returns the last code point in [start, p[ if it is valid and in U+1000..U+D7FF.
97 UChar32 previousHangulOrJamo(const uint8_t *start, const uint8_t *p) { in previousHangulOrJamo() argument
[all …]
/third_party/skia/third_party/externals/icu/source/common/
Dlocaleprioritylist.cpp25 return locale->hashCode(); in hashLocale()
42 int32_t diff = other.weight - weight; // descending: other-this in compare()
44 return index - other.index; in compare()
50 return static_cast<const LocaleAndWeight *>(left)-> in compareLocaleAndWeight()
54 const char *skipSpaces(const char *p, const char *limit) { in skipSpaces() argument
55 while (p < limit && *p == ' ') { ++p; } in skipSpaces()
56 return p; in skipSpaces()
59 int32_t findTagLength(const char *p, const char *limit) { in findTagLength() argument
60 // Look for accept-language delimiters. in findTagLength()
63 for (q = p; q < limit; ++q) { in findTagLength()
[all …]
Dnormalizer2impl.cpp6 * Copyright (C) 2009-2014, International Business Machines
11 * encoding: UTF-8
50 * UTF-8 lead byte for minNoMaybeCP.
66 * Returns the code point from one single well-formed UTF-8 byte sequence
69 * Trie UTF-8 macros do not assemble whole code points (for efficiency).
71 * We should not need it for normalization-inert data (norm16==0).
72 * Illegal sequences yield the error value norm16==0 just like real normalization-inert code points.
78 switch(cpLimit-cpStart) { in codePointFromValidUTF8()
94 * Returns the last code point in [start, p[ if it is valid and in U+1000..U+D7FF.
97 UChar32 previousHangulOrJamo(const uint8_t *start, const uint8_t *p) { in previousHangulOrJamo() argument
[all …]
/third_party/pcre2/pcre2/doc/html/
Dpcre2limits.html7 <p>
9 </p>
10 <p>
18 <P>
21 </P>
22 <P>
24 for the 8-bit and 16-bit libraries if PCRE2 is compiled with the default
27 an internal linkage size of 3 or 4 (when building the 16-bit library, 3 is
30 documentation for details. In these cases the limit is substantially larger.
31 However, the speed of execution is slower. In the 32-bit library, the internal
[all …]
/third_party/icu/icu4c/source/i18n/
Dutf16collationiterator.cpp5 * Copyright (C) 2010-2014, International Business Machines
34 pos(newText + (other.pos - other.start)), in UTF16CollationIterator()
35 limit(other.limit == NULL ? NULL : newText + (other.limit - other.start)) { in UTF16CollationIterator()
45 return (pos - start) == (o.pos - o.start); in operator ==()
56 return (int32_t)(pos - start); in getOffset()
61 if(pos == limit) { in handleNextCE32()
71 if(pos == limit) { return 0; } in handleGetTrailSurrogate()
79 if(limit == NULL) { in foundNULTerminator()
80 limit = --pos; in foundNULTerminator()
89 if(pos == limit) { in nextCodePoint()
[all …]
/third_party/skia/third_party/externals/icu/source/i18n/
Dutf16collationiterator.cpp5 * Copyright (C) 2010-2014, International Business Machines
34 pos(newText + (other.pos - other.start)), in UTF16CollationIterator()
35 limit(other.limit == NULL ? NULL : newText + (other.limit - other.start)) { in UTF16CollationIterator()
45 return (pos - start) == (o.pos - o.start); in operator ==()
56 return (int32_t)(pos - start); in getOffset()
61 if(pos == limit) { in handleNextCE32()
71 if(pos == limit) { return 0; } in handleGetTrailSurrogate()
79 if(limit == NULL) { in foundNULTerminator()
80 limit = --pos; in foundNULTerminator()
89 if(pos == limit) { in nextCodePoint()
[all …]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/
DFCDUTF16CollationIterator.java6 * Copyright (C) 2010-2014, International Business Machines
32 public FCDUTF16CollationIterator(CollationData data, boolean numeric, CharSequence s, int p) { in FCDUTF16CollationIterator() argument
33 super(data, numeric, s, p); in FCDUTF16CollationIterator()
35 segmentStart = p; in FCDUTF16CollationIterator()
59 return (pos - rawStart) == (o.pos - /*o.*/ rawStart); in equals()
62 return (segmentStart - rawStart) == (o.segmentStart - /*o.*/ rawStart) && in equals()
63 (pos - start) == (o.pos - o.start); in equals()
78 limit = rawLimit; in resetToOffset()
85 return pos - rawStart; in getOffset()
87 return segmentStart - rawStart; in getOffset()
[all …]
DCollationRootElements.java6 * Copyright (C) 2013-2014, International Business Machines
22 * This class takes and returns 16-bit secondary and tertiary weights.
41 * Mask for getting the primary range step value from a primary-range-end element.
46 * Index of the first CE with a non-zero tertiary weight.
51 * Index of the first CE with a non-zero secondary weight.
55 * Index of the first CE with a non-zero primary weight.
79 * This is the upper limit for tertiaries of primary/secondary CEs.
80 * This minus one is the lower limit for tertiaries of tertiary CEs.
97 return elements[(int)elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastTertiaryCE()
102 * This is the lower limit for secondaries of primary CEs.
[all …]
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
DFCDUTF16CollationIterator.java5 * Copyright (C) 2010-2014, International Business Machines
30 public FCDUTF16CollationIterator(CollationData data, boolean numeric, CharSequence s, int p) { in FCDUTF16CollationIterator() argument
31 super(data, numeric, s, p); in FCDUTF16CollationIterator()
33 segmentStart = p; in FCDUTF16CollationIterator()
57 return (pos - rawStart) == (o.pos - /*o.*/ rawStart); in equals()
60 return (segmentStart - rawStart) == (o.segmentStart - /*o.*/ rawStart) && in equals()
61 (pos - start) == (o.pos - o.start); in equals()
76 limit = rawLimit; in resetToOffset()
83 return pos - rawStart; in getOffset()
85 return segmentStart - rawStart; in getOffset()
[all …]
DCollationRootElements.java5 * Copyright (C) 2013-2014, International Business Machines
21 * This class takes and returns 16-bit secondary and tertiary weights.
39 * Mask for getting the primary range step value from a primary-range-end element.
44 * Index of the first CE with a non-zero tertiary weight.
49 * Index of the first CE with a non-zero secondary weight.
53 * Index of the first CE with a non-zero primary weight.
77 * This is the upper limit for tertiaries of primary/secondary CEs.
78 * This minus one is the lower limit for tertiaries of tertiary CEs.
95 return elements[(int)elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastTertiaryCE()
100 * This is the lower limit for secondaries of primary CEs.
[all …]
/third_party/rust/crates/nix/src/sys/
Dquota.rs25 fn as_int(&self) -> c_int { in as_int()
63 … /// Handles 32-bit UIDs/GIDs and quota limits up to 2<sup>32</sup> bytes/2<sup>32</sup> inodes.
67 /// Handles 32-bit UIDs/GIDs and quota limits of 2<sup>64</sup> bytes/2<sup>64</sup> inodes.
76 /// The block hard & soft limit fields.
80 /// The inode hard & soft limit fields.
84 /// The disk use time limit field.
86 /// The file quote time limit field.
92 /// The time limit fields.
105 fn default() -> Dqblk { in default()
121 /// The absolute limit on disk quota blocks allocated.
[all …]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/lang/
DUCharacterNameIterator.java6 * Copyright (C) 1996-2011, International Business Machines Corporation and *
18 * <p>Class enabling iteration of the codepoints and their names.</p>
19 * <p>Result of each iteration contains a valid codepoint that has valid
20 * name.</p>
21 * <p>See UCharacter.getNameIterator() for an example of use.</p>
26 // public methods ----------------------------------------------------
29 * <p>Gets the next result for this iteration and returns
30 * true if we are not at the end of the iteration, false otherwise.</p>
31 * <p>If the return boolean is a false, the contents of elements will not
32 * be updated.</p>
[all …]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/lang/
DUCharacterNameIterator.java5 * Copyright (C) 1996-2011, International Business Machines Corporation and *
17 * <p>Class enabling iteration of the codepoints and their names.</p>
18 * <p>Result of each iteration contains a valid codepoint that has valid
19 * name.</p>
20 * <p>See UCharacter.getNameIterator() for an example of use.</p>
26 // public methods ----------------------------------------------------
29 * <p>Gets the next result for this iteration and returns
30 * true if we are not at the end of the iteration, false otherwise.</p>
31 * <p>If the return boolean is a false, the contents of elements will not
32 * be updated.</p>
[all …]
/third_party/skia/third_party/externals/freetype/src/sfnt/
Dttcpal.c7 * Copyright (C) 2018-2021 by
78 FT_Memory memory = face->root.memory; in tt_face_load_cpal()
81 FT_Byte* p = NULL; in tt_face_load_cpal() local
89 error = face->goto_table( face, TTAG_CPAL, stream, &table_size ); in tt_face_load_cpal()
99 p = table; in tt_face_load_cpal()
104 cpal->version = FT_NEXT_USHORT( p ); in tt_face_load_cpal()
105 if ( cpal->version > 1 ) in tt_face_load_cpal()
108 face->palette_data.num_palette_entries = FT_NEXT_USHORT( p ); in tt_face_load_cpal()
109 face->palette_data.num_palettes = FT_NEXT_USHORT( p ); in tt_face_load_cpal()
111 cpal->num_colors = FT_NEXT_USHORT( p ); in tt_face_load_cpal()
[all …]
/third_party/skia/gm/
Dbug6783.cpp4 * Use of this source code is governed by a BSD-style license that can be
22 // [0,limit), and the old incorrect logic was:
24 // limit = ulp_before(limit)
25 // val = val - floor(val/limit)*limit (This is repeat; mirror is similar.)
29 // val = val - floor(val/limit)*limit
30 // val = min(val, ulp_before(limit))
38 SkPaint p; variable
39 p.setColor(SK_ColorYELLOW);
40 surface->getCanvas()->drawPaint(p);
41 p.setColor(SK_ColorBLUE);
[all …]
/third_party/lzma/C/
DLzmaDec.c1 /* LzmaDec.c -- LZMA Decoder
2 2023-04-07 : Igor Pavlov : Public domain */
24 #define IF_BIT_0(p) ttt = *(p); NORMALIZE; bound = (range >> kNumBitModelTotalBits) * (UInt32)ttt; … argument
25 #define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits… argument
26 #define UPDATE_1(p) range -= bound; code -= bound; *(p) = (CLzmaProb)(ttt - (ttt >> kNumMoveBits)); argument
27 #define GET_BIT2(p, i, A0, A1) IF_BIT_0(p) \ argument
28 { UPDATE_0(p) i = (i + i); A0; } else \
29 { UPDATE_1(p) i = (i + i) + 1; A1; }
33 #define REV_BIT(p, i, A0, A1) IF_BIT_0(p + i) \ argument
34 { UPDATE_0(p + i) A0; } else \
[all …]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
DTransliterator.java6 * Copyright (C) 1996-2016, International Business Machines Corporation and
41 * <p>
47 * <p>
50 * <p>
53 …* seem to limit the complexity of the transliteration operation. In practice, subclasses perform c…
58 * <p>
61 * <p>
70 …terated and to use {@link Replaceable} objects instead of strings, in order to preserve out-of-band
73 * <p>
76 * <p>
[all …]
DReplaceable.java6 * Copyright (C) 1996-2016, International Business Machines Corporation and *
21 * <p>An implicit aspect of the <code>Replaceable</code> API is that
27 * <p><code>Replaceable</code> specifies ranges using a start
28 * offset and a limit offset. The range of characters thus specified
29 * includes the characters at offset start..limit-1. That is, the
30 * start offset is inclusive, and the limit offset is exclusive.
32 * <p><code>Replaceable</code> also includes API to access characters
36 * <p>For a subclass to support metadata, typical behavior of
57 * Returns the number of 16-bit code units in the text.
58 * @return number of 16-bit code units in text
[all …]
/third_party/skia/third_party/externals/freetype/src/type42/
Dt42parse.c7 * Copyright (C) 2002-2021 by
106 #define T1_Add_Table( p, i, o, l ) (p)->funcs.add( (p), i, o, l ) argument
107 #define T1_Release_Table( p ) \ argument
110 if ( (p)->funcs.release ) \
111 (p)->funcs.release( p ); \
114 #define T1_Skip_Spaces( p ) (p)->root.funcs.skip_spaces( &(p)->root ) argument
115 #define T1_Skip_PS_Token( p ) (p)->root.funcs.skip_PS_token( &(p)->root ) argument
117 #define T1_ToInt( p ) \ argument
118 (p)->root.funcs.to_int( &(p)->root )
119 #define T1_ToBytes( p, b, m, n, d ) \ argument
[all …]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DReplaceable.java5 * Copyright (C) 1996-2016, International Business Machines Corporation and *
20 * <p>An implicit aspect of the <code>Replaceable</code> API is that
26 * <p><code>Replaceable</code> specifies ranges using a start
27 * offset and a limit offset. The range of characters thus specified
28 * includes the characters at offset start..limit-1. That is, the
29 * start offset is inclusive, and the limit offset is exclusive.
31 * <p><code>Replaceable</code> also includes API to access characters
35 * <p>For a subclass to support metadata, typical behavior of
57 * Returns the number of 16-bit code units in the text.
58 * @return number of 16-bit code units in text
[all …]
/third_party/icu/icu4j/main/classes/translit/src/com/ibm/icu/text/
DTransliterator.java5 * Copyright (C) 1996-2016, International Business Machines Corporation and
40 * <p>
46 * <p>
49 * <p>
52 …* seem to limit the complexity of the transliteration operation. In practice, subclasses perform c…
57 * <p>
60 * <p>
69 …terated and to use {@link Replaceable} objects instead of strings, in order to preserve out-of-band
72 * <p>
75 * <p>
[all …]

12345678910>>...43