HomeSort by relevance Sort by last modified time
    Searched refs:bitlen (Results 1 - 25 of 48) sorted by null

1 2

  /external/iproute2/ip/
tcp_metrics.c 159 if (f.daddr.family && f.daddr.bitlen >= 0 &&
160 inet_addr_match(&daddr, &f.daddr, f.daddr.bitlen))
165 if (slen && f.saddr.family && f.saddr.bitlen >= 0 &&
166 inet_addr_match(&saddr, &f.saddr, f.saddr.bitlen))
317 f.daddr.bitlen = -1;
319 f.saddr.bitlen = -1;
339 if (f.saddr.bitlen >= 0)
343 if (f.saddr.bytelen && f.saddr.bytelen * 8 == f.saddr.bitlen) {
364 if (f.daddr.bitlen >= 0)
368 if (f.daddr.bytelen && f.daddr.bytelen * 8 == f.daddr.bitlen) {
    [all...]
ipmroute.c 100 if (tb[RTA_DST] && filter.mdst.bitlen > 0) {
106 if (inet_addr_match(&dst, &filter.mdst, filter.mdst.bitlen))
110 if (tb[RTA_SRC] && filter.msrc.bitlen > 0) {
116 if (inet_addr_match(&src, &filter.msrc, filter.msrc.bitlen))
191 filter.mdst.bitlen = -1;
192 filter.msrc.bitlen = -1;
ipmaddr.c 114 ma->addr.bitlen = len<<3;
138 m.addr.bitlen = 32;
190 ma->addr.bitlen = len<<3;
iproute.c 186 (r->rtm_family != filter.rdst.family || filter.rdst.bitlen > r->rtm_dst_len))
190 (filter.mdst.bitlen >= 0 && filter.mdst.bitlen < r->rtm_dst_len)))
193 (r->rtm_family != filter.rsrc.family || filter.rsrc.bitlen > r->rtm_src_len))
197 (filter.msrc.bitlen >= 0 && filter.msrc.bitlen < r->rtm_src_len)))
221 if (filter.rvia.bitlen>0) {
233 if (filter.rprefsrc.bitlen>0) {
240 if (filter.rdst.family && inet_addr_match(&dst, &filter.rdst, filter.rdst.bitlen))
242 if (filter.mdst.family && filter.mdst.bitlen >= 0 &
    [all...]
ipxfrm.c 1087 filter.id_src_mask = src.bitlen;
1100 filter.id_dst_mask = dst.bitlen;
1401 sel->prefixlen_s = src.bitlen;
1403 filter.sel_src_mask = src.bitlen;
1414 sel->prefixlen_d = dst.bitlen;
1416 filter.sel_dst_mask = dst.bitlen;
    [all...]
link_iptnl.c 269 ip6rdprefixlen = prefix.bitlen;
276 ip6rdrelayprefixlen = prefix.bitlen;
ipaddrlabel.c 180 req.ifal.ifal_prefixlen = prefix.bitlen;
ipl2tp.c 302 p->local_ip.bitlen = -1;
308 p->peer_ip.bitlen = -1;
314 p->local_ip.bitlen = -1;
320 p->peer_ip.bitlen = -1;
iprule.c 367 req.r.rtm_src_len = dst.bitlen;
373 req.r.rtm_dst_len = dst.bitlen;
iptunnel.c 541 ip6rd.prefixlen = prefix.bitlen;
548 ip6rd.relay_prefixlen = prefix.bitlen;
ipaddress.c 997 if (inet_addr_match(&dst, &filter.pfx, filter.pfx.bitlen))
    [all...]
ipneigh.c 244 if (inet_addr_match(&dst, &filter.pfx, filter.pfx.bitlen))
  /external/tcpdump/
print-domain.c 64 int bitlen, bytelen; local
70 if ((bitlen = *cp++) == 0)
71 bitlen = 256;
72 bytelen = (bitlen + 7) / 8;
88 int bitlen, slen, b; local
94 if ((bitlen = *cp) == 0)
95 bitlen = 256;
96 slen = (bitlen + 3) / 4;
101 for (bitp = cp + 1, b = bitlen; bitp < lim && b > 7; b -= 8, bitp++) {
114 ND_PRINT((ndo, "/%d]", bitlen));
131 int bitlen, elt; local
    [all...]
  /external/zopfli/src/zopflipng/lodepng/
lodepng_util.cpp 310 int makeFromLengths(const std::vector<unsigned long>& bitlen, unsigned long maxbitlen)
312 unsigned long numcodes = (unsigned long)(bitlen.size()), treepos = 0, nodefilled = 0;
315 for(unsigned long bits = 0; bits < numcodes; bits++) blcount[bitlen[bits]]++;
321 for(unsigned long n = 0; n < numcodes; n++) if(bitlen[n] != 0) tree1d[n] = nextcode[bitlen[n]]++;
324 for(unsigned long i = 0; i < bitlen[n]; i++) //the bits for this code
326 unsigned long bit = (tree1d[n] >> (bitlen[n] - i - 1)) & 1;
330 if(i + 1 == bitlen[n])
385 std::vector<unsigned long> bitlen(288, 8), bitlenD(32, 5);;
386 for(size_t i = 144; i <= 255; i++) bitlen[i] = 9
    [all...]
lodepng.cpp 631 static unsigned HuffmanTree_makeFromLengths(HuffmanTree* tree, const unsigned* bitlen,
637 for(i = 0; i < numcodes; i++) tree->lengths[i] = bitlen[i];
866 unsigned* bitlen = (unsigned*)lodepng_malloc(NUM_DEFLATE_CODE_SYMBOLS * sizeof(unsigned)); local
867 if(!bitlen) return 83; /*alloc fail*/
870 for(i = 0; i <= 143; i++) bitlen[i] = 8;
871 for(i = 144; i <= 255; i++) bitlen[i] = 9;
872 for(i = 256; i <= 279; i++) bitlen[i] = 7;
873 for(i = 280; i <= 287; i++) bitlen[i] = 8;
875 error = HuffmanTree_makeFromLengths(tree, bitlen, NUM_DEFLATE_CODE_SYMBOLS, 15);
877 lodepng_free(bitlen);
885 unsigned* bitlen = (unsigned*)lodepng_malloc(NUM_DISTANCE_SYMBOLS * sizeof(unsigned)); local
    [all...]
  /external/sl4a/Common/src/org/apache/commons/codec/binary/
Base64Codec.java 1019 int bitlen = bigInt.bitLength(); local
    [all...]
  /external/iproute2/lib/
utils.c 433 addr->bitlen = -1;
445 addr->bitlen = len * 8;
456 addr->bitlen = -1;
468 addr->bitlen = -1;
479 addr->bitlen = 20;
498 addr->bitlen = -1;
540 dst->bitlen = 0;
550 dst->bitlen = af_bit_len(dst->family);
554 || plen > dst->bitlen) {
559 dst->bitlen = plen
    [all...]
  /external/dhcpcd-6.8.2/crypt/
sha256.c 242 uint64_t bitlen; local
250 bitlen = len << 3;
253 ctx->count += bitlen;
  /external/toybox/toys/pending/
compress.c 261 static void len2huff(struct huff *huff, char bitlen[], int len)
268 for (i = 0; i<len; i++) huff->length[bitlen[i]]++;
274 for (i = 0; i<len; i++) if (bitlen[i]) huff->symbol[offset[bitlen[i]]++] = i;
  /bionic/libc/dns/nameser/
ns_name.c 1152 int bitlen; local
1162 if ((bitlen = *(lp + 1)) == 0)
1163 bitlen = 256;
1164 return((bitlen + 7 ) / 8 + 1);
  /external/iproute2/tc/
m_nat.c 64 sel->mask = htonl(~0u << (32 - addr.bitlen));
f_u32.c 348 if (addr.bitlen)
349 mask = htonl(0xFFFFFFFF << (32 - addr.bitlen));
383 plen = addr.bitlen;
f_flower.c 118 bits = addr.bitlen;
  /external/iproute2/include/
utils.h 61 __s16 bitlen; member in struct:__anon12500
  /external/iproute2/misc/
ss.c 1112 if (a->addr.bitlen) {
1114 if (!inet2_addr_match(&s->remote, &a->addr, a->addr.bitlen))
1128 if (a->addr.bitlen) {
1130 if (!inet2_addr_match(&s->local, &a->addr, a->addr.bitlen))
1227 cond->prefix_len = a->addr.bitlen;
1348 if (a->addr.bitlen) {
1357 b->addr.bitlen = len*8;
1371 a->addr.bitlen = 0;
1428 a.addr.bitlen = 8*strlen(p);
1436 a.addr.bitlen = 0
    [all...]

Completed in 3098 milliseconds

1 2