| /third_party/skia/third_party/externals/freetype/src/gzip/ |
| H A D | infblock.c | 43 However, static trees define 32 codes (all 5 bits) to fill out the
75 ZFREE(z, s->sub.trees.blens); in inflate_blocks_reset()
218 s->sub.trees.table = t = (uInt)b & 0x3fff; in inflate_blocks()
229 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL) in inflate_blocks()
235 s->sub.trees.index = 0; in inflate_blocks()
240 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10)) in inflate_blocks()
243 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7; in inflate_blocks()
246 while (s->sub.trees in inflate_blocks()
[all...] |
| H A D | infutil.h | 20 DTREE, /* get length, distance trees for a dynamic block */
42 } trees; /* if DTREE, decoding info for trees */ member
|
| /third_party/skia/third_party/externals/brotli/csharp/org/brotli/dec/ |
| H A D | HuffmanTreeGroup.cs | 8 /// <summary>Contains a collection of huffman trees with the same alphabet size.</summary>
22 internal int[] trees;
field in Org.Brotli.Dec.HuffmanTreeGroup
32 group.trees = new int[n];
in Init()
35 /// <summary>Decodes Huffman trees from input stream and constructs lookup tables.</summary>
41 int n = group.trees.Length;
in Decode()
44 group.trees[i] = next;
in Decode()
|
| H A D | Decode.cs | 438 state.literalTree = state.hGroup0.trees[state.literalTreeIndex];
in DecodeLiteralBlockSwitch()
447 state.treeCommandOffset = state.hGroup1.trees[state.blockTypeRb[3]];
in DecodeCommandBlockSwitch()
515 state.hGroup0.trees = null;
in ReadMetablockInfo()
517 state.hGroup1.trees = null;
in ReadMetablockInfo()
519 state.hGroup2.trees = null;
in ReadMetablockInfo()
603 state.literalTree = state.hGroup0.trees[0];
in ReadMetablockHuffmanCodesAndContextMaps()
604 state.treeCommandOffset = state.hGroup1.trees[0];
in ReadMetablockHuffmanCodesAndContextMaps()
772 prevByte1 = ReadSymbol(state.hGroup0.codes, state.hGroup0.trees[literalTreeIndex], br);
in Decompress()
804 state.distanceCode = ReadSymbol(state.hGroup2.codes, state.hGroup2.trees[state.distContextMap[state.distContextMapSlice + (state.copyLength > 4 ? 3 : state.copyLength - 2)] & unchecked((int)(0xFF))], br);
in Decompress()
|
| /third_party/node/tools/icu/ |
| H A D | icutrim.py | 194 # list of all trees
195 trees = {} variable
212 if tree not in config.get("trees", {}):
214 mytree = trees[tree]
218 if isinstance(config["trees"][tree], basestring):
219 treeStr = config["trees"][tree]
225 config["trees"][tree] = config["variables"][treeStr]
226 myconfig = config["trees"][tree]
257 trees[tree] = mytree
284 trees[tre
[all...] |
| /third_party/json/tools/serve_header/ |
| H A D | serve_header.py | 152 self.trees = set([])
162 # recursively scan base_dir for working trees
179 # skip source trees in build directories
186 if not tree in self.trees:
193 self.trees.add(tree)
198 trees = set([])
199 # check if any working trees have been removed
201 while self.trees:
202 tree = self.trees.pop()
211 trees
[all...] |
| /third_party/zlib/contrib/delphi/ |
| H A D | zlibd32.mak | 22 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
24 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
60 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| /third_party/zlib/contrib/pascal/ |
| H A D | zlibd32.mak | 22 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
24 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
60 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| /third_party/rust/crates/proc-macro2/src/ |
| H A D | parse.rs | 169 let mut trees = TokenStreamBuilder::new(); variables
175 if let Ok((rest, ())) = doc_comment(input, &mut trees) {
186 None => return Ok(trees.build()),
205 let frame = (open_delimiter, trees);
209 trees = TokenStreamBuilder::new();
227 let mut g = Group::new(open_delimiter, trees.build());
234 trees = outer;
235 trees.push_token_from_parser(TokenTree::Group(crate::Group::_new_fallback(g)));
247 trees.push_token_from_parser(tt);
913 fn doc_comment<'a>(input: Cursor<'a>, trees
[all...] |
| H A D | wrapper.rs | 187 fn from_iter<I: IntoIterator<Item = TokenTree>>(trees: I) -> Self { in from_iter()
190 trees.into_iter().map(into_compiler_token).collect(), in from_iter()
193 TokenStream::Fallback(trees.into_iter().collect()) in from_iter()
|
| /third_party/zlib/watcom/ |
| H A D | watcom_l.mak | 10 trees.c uncompr.c zutil.c
15 trees.obj uncompr.obj zutil.obj
32 wlib -b -c $(ZLIB_LIB) -+trees.obj -+uncompr.obj -+zutil.obj
|
| H A D | watcom_f.mak | 10 trees.c uncompr.c zutil.c
15 trees.obj uncompr.obj zutil.obj
32 wlib -b -c $(ZLIB_LIB) -+trees.obj -+uncompr.obj -+zutil.obj
|
| /third_party/skia/third_party/externals/libpng/contrib/pngminim/encoder/ |
| H A D | makefile | 32 trees$(C) zutil$(C)
35 #ZH = zlib.h crc32.h deflate.h trees.h zutil.h
36 ZH = zlib.h crc32.h deflate.h trees.h zutil.h
51 trees$(O) zutil$(O)
|
| /third_party/rust/crates/syn/tests/common/ |
| H A D | eq.rs | 684 let mut this_trees = self.trees(); in eq()
685 let mut other_trees = other.trees(); in eq()
722 trees: &mut impl Iterator<Item = &'a TokenTree>, in doc_comment()
728 match trees.next() { in doc_comment()
739 let stream = match trees.next() { in doc_comment()
743 let mut trees = stream.trees(); in doc_comment() variables
744 match trees.next() { in doc_comment()
754 match trees.next() { in doc_comment()
764 match trees in doc_comment()
[all...] |
| /third_party/node/deps/openssl/openssl/crypto/x509/ |
| H A D | v3_ncons.c | 29 STACK_OF(GENERAL_SUBTREE) *trees, BIO *bp,
187 STACK_OF(GENERAL_SUBTREE) *trees,
192 if (sk_GENERAL_SUBTREE_num(trees) > 0)
194 for (i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++) {
197 tree = sk_GENERAL_SUBTREE_value(trees, i);
|
| /third_party/openssl/crypto/x509/ |
| H A D | v3_ncons.c | 29 STACK_OF(GENERAL_SUBTREE) *trees, BIO *bp,
187 STACK_OF(GENERAL_SUBTREE) *trees,
192 if (sk_GENERAL_SUBTREE_num(trees) > 0)
194 for (i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++) {
197 tree = sk_GENERAL_SUBTREE_value(trees, i);
|