Searched defs:codes (Results 1 - 21 of 21) sorted by relevance

/external/webp/src/utils/
H A Dhuffman_encode.h24 uint8_t extra_bits; // extra bits for escape codes
27 // Struct to represent the tree codes (depth and bits array).
31 uint16_t* codes; // Symbol Codes. member in struct:__anon15076
H A Dhuffman.c176 // Get Huffman codes from the code lengths.
177 int* const codes = local
178 (int*)WebPSafeMalloc((uint64_t)code_lengths_size, sizeof(*codes));
179 if (codes == NULL) goto End;
181 if (!HuffmanCodeLengthsToCodes(code_lengths, code_lengths_size, codes)) {
188 if (!TreeAddSymbol(tree, symbol, codes[symbol], code_lengths[symbol])) {
195 free(codes);
204 const int* const codes,
212 assert(codes != NULL);
220 if (codes[
202 HuffmanTreeBuildExplicit(HuffmanTree* const tree, const int* const code_lengths, const int* const codes, const int* const symbols, int max_symbol, int num_symbols) argument
[all...]
/external/dropbear/libtomcrypt/src/misc/base64/
H A Dbase64_encode.c21 static const char *codes = variable
51 *p++ = codes[(in[0] >> 2) & 0x3F];
52 *p++ = codes[(((in[0] & 3) << 4) + (in[1] >> 4)) & 0x3F];
53 *p++ = codes[(((in[1] & 0xf) << 2) + (in[2] >> 6)) & 0x3F];
54 *p++ = codes[in[2] & 0x3F];
62 *p++ = codes[(a >> 2) & 0x3F];
63 *p++ = codes[(((a & 3) << 4) + (b >> 4)) & 0x3F];
64 *p++ = (i+1 < inlen) ? codes[(((b & 0xf) << 2)) & 0x3F] : '=';
/external/zlib/src/contrib/infback9/
H A Dinflate9.h30 Read deflate codes:
43 code FAR *next; /* next available space in codes[] */
46 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
/external/qemu/distrib/sdl-1.2.15/src/video/Xext/extensions/
H A Dextutil.h51 XExtCodes *codes; /* the extension protocol codes */ member in struct:_XExtDisplayInfo
66 XExtCodes* /* codes */
73 XExtCodes* /* codes */
80 XExtCodes* /* codes */
87 XExtCodes* /* codes */
94 XExtCodes* /* codes */
101 XExtCodes* /* codes */
107 XExtCodes* /* codes */
128 XExtCodes* /* codes */,
[all...]
/external/qemu/distrib/sdl-1.2.15/src/video/windx5/
H A DSDL_dx5yuv.c129 DWORD *codes; local
135 codes = SDL_malloc(numcodes*sizeof(*codes));
136 if ( codes ) {
137 IDirectDraw2_GetFourCCCodes(ddraw2, &numcodes, codes);
139 fprintf(stderr, "Code %d: 0x%x\n", i, PrintFOURCC(codes[i]));
141 SDL_free(codes);
144 fprintf(stderr, "No FOURCC codes supported\n");
/external/qemu/distrib/zlib-1.2.3/
H A Dinflate.h68 Read deflate codes:
102 code const FAR *lencode; /* starting table for length/literal codes */
103 code const FAR *distcode; /* starting table for distance codes */
111 code FAR *next; /* next available space in codes[] */
114 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
/external/zlib/src/contrib/puff/
H A Dpuff.c49 * - Fix fixed codes table error
63 * 1.8 9 Jan 2004 - Added some comments on no distance codes case
91 #define MAXLCODES 286 /* maximum number of literal/length codes */
92 #define MAXDCODES 30 /* maximum number of distance codes */
93 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
94 #define FIXLCODES 288 /* number of fixed literal/length codes */
218 * - The codes as stored in the compressed data are bit-reversed relative to
219 * a simple integer ordering of codes of the same lengths. Hence below the
225 * - The first code for the shortest length is all zeros. Subsequent codes of
230 * - Incomplete codes ar
435 local int codes(struct state *s, function
[all...]
/external/libvorbis/lib/
H A Dsharedbook.c340 ogg_uint32_t *codes=_make_words(s->lengthlist,s->entries,c->used_entries); local
343 if(codes==NULL)goto err_out;
346 codes[i]=bitreverse(codes[i]);
347 codep[i]=codes+i;
356 int position=codep[i]-codes;
361 c->codelist[sortindex[i]]=codes[i];
362 _ogg_free(codes);
/external/zlib/src/
H A Dinflate.h72 Read deflate codes in fixed or dynamic block:
106 code const FAR *lencode; /* starting table for length/literal codes */
107 code const FAR *distcode; /* starting table for distance codes */
115 code FAR *next; /* next available space in codes[] */
118 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
/external/chromium/testing/gmock/test/
H A Dgmock-more-actions_test.cc671 int codes[] = { 97, 98, 99 }; local
672 Action<MyFunction> a = SetArrayArgument<1>(codes, codes + 3);
/external/chromium/net/http/
H A Dhttp_response_headers.cc90 // response map to track response codes that are invalid.
91 // TODO(gavinp): Greatly prune the collected codes once we learn which
100 std::vector<int> codes; local
101 codes.reserve(
103 codes.push_back(0);
106 codes.push_back(i);
107 return codes;
137 // the existence of unusual HTTP response codes. As it happens
912 // A response received with any other status code (e.g. status codes 302
/external/freetype/src/cff/
H A Dcfftypes.h85 FT_UShort codes[256]; member in struct:CFF_EncodingRec_
/external/v8/test/cctest/
H A Dtest-regexp.cc1318 byte codes[1024]; local
1319 RegExpMacroAssemblerIrregexp m(Vector<byte>(codes, 1024));
/external/webp/src/dec/
H A Dvp8l.c33 // Five Huffman codes are used at each meta code:
34 // 1. green + length prefix codes + color cache codes,
38 // 5. distance prefix codes.
241 if (simple_code) { // Read symbols, codes & code lengths directly.
243 int codes[2]; local
249 codes[0] = 0;
254 codes[1] = 1;
257 ok = HuffmanTreeBuildExplicit(tree, code_lengths, codes, symbols,
317 // use meta Huffman codes
[all...]
/external/webp/src/enc/
H A Dvp8l.c188 // Iterate over all histograms and get the aggregate number of codes used.
191 HuffmanTreeCode* const codes = &huffman_codes[5 * i]; local
196 codes[k].num_symbols = num_symbols;
201 // Allocate and Set Huffman codes.
203 uint16_t* codes; local
206 sizeof(*lengths) + sizeof(*codes));
211 codes = (uint16_t*)mem_buf;
212 lengths = (uint8_t*)&codes[total_length_size];
215 huffman_codes[i].codes = codes;
224 HuffmanTreeCode* const codes = &huffman_codes[5 * i]; local
430 const HuffmanTreeCode* const codes = huffman_codes + 5 * histogram_ix; local
493 HuffmanTreeCode* const codes = &huffman_codes[i]; local
596 HuffmanTreeCode* const codes = &huffman_codes[i]; local
[all...]
/external/v8/src/
H A Djsregexp.cc594 // 3) From the nodes we generate either byte codes or native code
620 // The code generated (whether as byte codes or native code) maintains
1377 // character codes in their equivalence class.
5323 EmbeddedVector<byte, 1024> codes; local
5324 RegExpMacroAssemblerIrregexp macro_assembler(codes);
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dcom.ibm.icu_4.2.1.v20100412.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.ui.ide_3.6.2.M20101117-0800.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 450 milliseconds