Searched refs:Code (Results 126 - 150 of 190) sorted by relevance

12345678

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/libvorbis/doc/
H A D02-bitpacking.tex103 Code the 4 bit integer value '12' [b1100] into an empty bytestream.
H A D05-comment.tex150 International Standard Recording Code for the
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/libvorbis/doc/
H A D02-bitpacking.tex103 Code the 4 bit integer value '12' [b1100] into an empty bytestream.
H A D05-comment.tex150 International Standard Recording Code for the
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/libvorbis/doc/
H A D02-bitpacking.tex103 Code the 4 bit integer value '12' [b1100] into an empty bytestream.
H A D05-comment.tex150 International Standard Recording Code for the
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/pppd/pppdump/
H A Dzlib.c196 #define Code fc.code macro
972 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1590 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
1596 send_bits(s, tree[c].Code, tree[c].Len); }
1729 static_dtree[n].Code = bi_reverse(n, 5);
1962 tree[n].Code = bi_reverse(next_code[len]++, len);
1965 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
3179 6. There are up to 286 literal/length codes. Code 256 represents the
3194 10. In the tree reconstruction algorithm, Code = Code
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/pppd/pppdump/
H A Dzlib.c196 #define Code fc.code macro
972 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1590 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
1596 send_bits(s, tree[c].Code, tree[c].Len); }
1729 static_dtree[n].Code = bi_reverse(n, 5);
1962 tree[n].Code = bi_reverse(next_code[len]++, len);
1965 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
3179 6. There are up to 286 literal/length codes. Code 256 represents the
3194 10. In the tree reconstruction algorithm, Code = Code
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/pppd/pppdump/
H A Dzlib.c196 #define Code fc.code macro
972 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1590 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
1596 send_bits(s, tree[c].Code, tree[c].Len); }
1729 static_dtree[n].Code = bi_reverse(n, 5);
1962 tree[n].Code = bi_reverse(next_code[len]++, len);
1965 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
3179 6. There are up to 286 literal/length codes. Code 256 represents the
3194 10. In the tree reconstruction algorithm, Code = Code
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/staging/otus/80211core/
H A Dcoid.c2464 void zfiWlanSetRegulatory(zdev_t* dev, u8_t CCS, u16_t Code, u8_t bfirstChannel) argument
2472 /* Reset Regulation Table by Country Code */
2473 zfHpGetRegulationTablefromCountry(dev, Code);
2477 /* Reset Regulation Table by Region Code */
2478 zfHpGetRegulationTablefromRegionCode(dev, Code);
H A Dpub_zfi.h740 extern void zfiWlanSetRegulatory(zdev_t* dev, u8_t CCS, u16_t Code, u8_t bfirstChannel);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/staging/otus/80211core/
H A Dcoid.c2464 void zfiWlanSetRegulatory(zdev_t* dev, u8_t CCS, u16_t Code, u8_t bfirstChannel) argument
2472 /* Reset Regulation Table by Country Code */
2473 zfHpGetRegulationTablefromCountry(dev, Code);
2477 /* Reset Regulation Table by Region Code */
2478 zfHpGetRegulationTablefromRegionCode(dev, Code);
H A Dpub_zfi.h740 extern void zfiWlanSetRegulatory(zdev_t* dev, u8_t CCS, u16_t Code, u8_t bfirstChannel);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/pppd/common/
H A Dzlib.c321 #define Code fc.code macro
1303 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1986 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
1992 send_bits(s, tree[c].Code, tree[c].Len); }
2129 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
2360 tree[n].Code = bi_reverse(next_code[len]++, len);
2363 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
3647 6. There are up to 286 literal/length codes. Code 256 represents the
3662 10. In the tree reconstruction algorithm, Code = Code
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/pppd/common/
H A Dzlib.c321 #define Code fc.code macro
1303 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1986 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
1992 send_bits(s, tree[c].Code, tree[c].Len); }
2129 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
2360 tree[n].Code = bi_reverse(next_code[len]++, len);
2363 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
3647 6. There are up to 286 literal/length codes. Code 256 represents the
3662 10. In the tree reconstruction algorithm, Code = Code
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/pppd/common/
H A Dzlib.c321 #define Code fc.code macro
1303 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1986 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
1992 send_bits(s, tree[c].Code, tree[c].Len); }
2129 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
2360 tree[n].Code = bi_reverse(next_code[len]++, len);
2363 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
3647 6. There are up to 286 literal/length codes. Code 256 represents the
3662 10. In the tree reconstruction algorithm, Code = Code
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba-3.5.8/lib/zlib/contrib/masmx86/
H A Dinffas32.asm85 db 'Fast decoding Code from Chris Anderson'
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/zlib/contrib/masmx86/
H A Dinffas32.asm85 db 'Fast decoding Code from Chris Anderson'
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/samba-3.5.8/lib/zlib/contrib/masmx86/
H A Dinffas32.asm85 db 'Fast decoding Code from Chris Anderson'
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/zlib/contrib/masmx86/
H A Dinffas32.asm85 db 'Fast decoding Code from Chris Anderson'
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba-3.5.8/lib/zlib/contrib/masmx86/
H A Dinffas32.asm85 db 'Fast decoding Code from Chris Anderson'
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/zlib/contrib/masmx86/
H A Dinffas32.asm85 db 'Fast decoding Code from Chris Anderson'
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/staging/slicoss/
H A Dslicoss.c2297 seq_printf(seq, "ifevents: Code violations : %8.8X\n",
2298 adapter->if_events.Code);
2662 adapter->if_events.Code++;
2704 adapter->if_events.Code++;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/wget/lib/
H A Dvasnprintf.c199 # define IF_LINT(Code) Code
201 # define IF_LINT(Code) /* empty */
556 Code copied from gnulib's integer_length.c. */
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/staging/slicoss/
H A Dslicoss.c2297 seq_printf(seq, "ifevents: Code violations : %8.8X\n",
2298 adapter->if_events.Code);
2662 adapter->if_events.Code++;
2704 adapter->if_events.Code++;

Completed in 221 milliseconds

12345678