| /third_party/skia/third_party/externals/freetype/src/gxvalid/ |
| D | gxvjust.c | 7 * 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 …]
|
| /third_party/protobuf/src/google/protobuf/ |
| D | varint_shuffle_test.cc | 1 // Protocol Buffers - Google's data interchange format
4 // Use of this source code is governed by a BSD-style
6 // https://developers.google.com/open-source/licenses/bsd
39 int NaiveParse(const char* p, int32_t& res) { in NaiveParse() argument
41 auto r = ToInt32(*p); in NaiveParse()
42 while (*p++ & 0x80) { in NaiveParse()
44 if (len < 5) r += Shl(ToInt32(*p) - 1, len * 7); in NaiveParse()
51 int NaiveParse(const char* p, int64_t& res) { in NaiveParse() argument
53 auto r = ToInt64(*p); in NaiveParse()
54 while (*p++ & 0x80) { in NaiveParse()
[all …]
|
| /third_party/skia/m133/third_party/externals/icu/source/common/ |
| D | localeprioritylist.cpp | 25 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 …]
|
| D | normalizer2impl.cpp | 6 * 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/icu/icu4c/source/common/ |
| D | localeprioritylist.cpp | 25 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 …]
|
| D | normalizer2impl.cpp | 6 * 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/ |
| D | localeprioritylist.cpp | 25 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 …]
|
| D | normalizer2impl.cpp | 6 * 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/freetype/src/psaux/ |
| D | psconv.c | 7 * 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/cups/doc/help/ |
| D | accounting.html | 2 <!-- SECTION: Getting Started -->
5 <LINK REL="STYLESHEET" TYPE="text/css" HREF="../cups-printable.css">
11 <P>CUPS supports a variety of printer accounting schemes. Aside from the
12 built-in <A HREF="#QUOTAS">quota</A> and <A HREF="#PAGELOG">page logging</A>
13 support, there are several third-party solutions that can be found online.</P>
18 <P>CUPS supports page and size-based quotas for each printer.
21 can limit every user to 5 pages per day on an expensive printer, but
22 you cannot limit every user except Johnny.</P>
24 <P>The <CODE>job-k-limit</CODE>, <CODE>job-page-limit</CODE>, and <CODE>job-quota-period</CODE>
26 The <CODE>job-quota-period</CODE> option determines the time interval for
[all …]
|
| /third_party/pcre2/pcre2/doc/html/ |
| D | pcre2limits.html | 7 <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/iptables/iptables/tests/shell/testcases/ipt-save/dumps/ |
| D | ipt-save-filter.txt | 1 # Generated by iptables-save v1.2.4 on Mon Mar 17 19:59:10 2003
6 :WLAN - [0:0]
7 :accept_log - [0:0]
8 :block - [0:0]
9 :in_icmp - [0:0]
10 :in_trusted - [0:0]
11 :reject_log - [0:0]
12 :wlanout - [0:0]
13 -A INPUT -i wlan0 -j WLAN
14 -A INPUT -s 127.0.0.1/32 -d 127.0.0.1/32 -i lo -j ACCEPT
[all …]
|
| /third_party/rust/crates/nix/src/sys/ |
| D | quota.rs | 25 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/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| D | FCDUTF16CollationIterator.java | 5 * 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 …]
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/ |
| D | FCDUTF16CollationIterator.java | 6 * 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 …]
|
| /third_party/skia/m133/third_party/externals/icu/source/i18n/ |
| D | utf16collationiterator.cpp | 5 * Copyright (C) 2010-2014, International Business Machines
34 pos(newText + (other.pos - other.start)), in UTF16CollationIterator()
35 limit(other.limit == nullptr ? nullptr : 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 == nullptr) { in foundNULTerminator()
80 limit = --pos; in foundNULTerminator()
89 if(pos == limit) { in nextCodePoint()
[all …]
|
| /third_party/icu/icu4c/source/i18n/ |
| D | utf16collationiterator.cpp | 5 * 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/ |
| D | utf16collationiterator.cpp | 5 * 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/icu4j/main/classes/core/src/com/ibm/icu/lang/ |
| D | UCharacterNameIterator.java | 5 * 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/icu/ohos_icu4j/src/main/java/ohos/global/icu/lang/ |
| D | UCharacterNameIterator.java | 6 * 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/iptables/iptables/tests/shell/testcases/ebtables/ |
| D | 0002-ebtables-save-restore_0 | 3 set -e
4 #set -x
7 [[ $XT_MULTI == *xtables-nft-multi ]] || { echo "skip $XT_MULTI"; exit 0; }
11 $XT_MULTI ebtables --init-table
12 $XT_MULTI ebtables -A INPUT -p IPv4 -i lo -j ACCEPT
13 $XT_MULTI ebtables -P FORWARD DROP
14 $XT_MULTI ebtables -A OUTPUT -s ff:ff:ff:ff:ff:ff/ff:ff:ff:ff:ff:ff -j DROP
15 $XT_MULTI ebtables -N foo
16 $XT_MULTI ebtables -A foo -p length --802_3-sap 0x23 -j ACCEPT
17 $XT_MULTI ebtables -A foo -p length --802_3-sap 0xaa --802_3-type 0x1337 -j ACCEPT
[all …]
|
| /third_party/grpc/src/core/ext/transport/chttp2/transport/ |
| D | hpack_parse_result.h | 7 // http://www.apache.org/licenses/LICENSE-2.0
42 // Non-Errors
48 // Moved from - used to denote a HpackParseResult that has been moved into a
53 // Stream Errors - result in a stream cancellation
62 // Hard metadata limit exceeded by the total set of metadata
65 // Hard metadata limit exceeded by a single key string
67 // Hard metadata limit exceeded by a single value string
74 // Connection Errors - result in the tcp connection closing
131 return state_ == nullptr || state_->status.get() == HpackParseStatus::kOk; in ok()
134 return state_ != nullptr && IsStreamError(state_->status.get()); in stream_error()
[all …]
|
| /third_party/skia/gm/ |
| D | bug6783.cpp | 4 * 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/skia/m133/gm/ |
| D | bug6783.cpp | 4 * 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/skia/third_party/externals/freetype/src/sfnt/ |
| D | ttcpal.c | 7 * 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 …]
|