Len                35 third_party/harfbuzz-ng/src/hb-utf-private.hh #define HB_UTF8_COMPUTE(Char, Mask, Len) \
Len                36 third_party/harfbuzz-ng/src/hb-utf-private.hh   if (Char < 128) { Len = 1; Mask = 0x7f; } \
Len                37 third_party/harfbuzz-ng/src/hb-utf-private.hh   else if ((Char & 0xe0) == 0xc0) { Len = 2; Mask = 0x1f; } \
Len                38 third_party/harfbuzz-ng/src/hb-utf-private.hh   else if ((Char & 0xf0) == 0xe0) { Len = 3; Mask = 0x0f; } \
Len                39 third_party/harfbuzz-ng/src/hb-utf-private.hh   else if ((Char & 0xf8) == 0xf0) { Len = 4; Mask = 0x07; } \
Len                40 third_party/harfbuzz-ng/src/hb-utf-private.hh   else Len = 0;
Len               168 third_party/zlib/trees.c #  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
Len               174 third_party/zlib/trees.c        send_bits(s, tree[c].Code, tree[c].Len); }
Len               298 third_party/zlib/trees.c     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
Len               299 third_party/zlib/trees.c     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
Len               300 third_party/zlib/trees.c     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
Len               301 third_party/zlib/trees.c     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
Len               310 third_party/zlib/trees.c         static_dtree[n].Len = 5;
Len               345 third_party/zlib/trees.c                 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
Len               351 third_party/zlib/trees.c                 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
Len               516 third_party/zlib/trees.c     tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
Len               520 third_party/zlib/trees.c         bits = tree[tree[n].Dad].Len + 1;
Len               522 third_party/zlib/trees.c         tree[n].Len = (ush)bits;
Len               532 third_party/zlib/trees.c         if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
Len               562 third_party/zlib/trees.c             if ((unsigned) tree[m].Len != (unsigned) bits) {
Len               563 third_party/zlib/trees.c                 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
Len               564 third_party/zlib/trees.c                 s->opt_len += ((long)bits - (long)tree[m].Len)
Len               566 third_party/zlib/trees.c                 tree[m].Len = (ush)bits;
Len               605 third_party/zlib/trees.c         int len = tree[n].Len;
Len               645 third_party/zlib/trees.c             tree[n].Len = 0;
Len               658 third_party/zlib/trees.c         s->opt_len--; if (stree) s->static_len -= stree[node].Len;
Len               719 third_party/zlib/trees.c     int nextlen = tree[0].Len; /* length of next code */
Len               725 third_party/zlib/trees.c     tree[max_code+1].Len = (ush)0xffff; /* guard */
Len               728 third_party/zlib/trees.c         curlen = nextlen; nextlen = tree[n+1].Len;
Len               764 third_party/zlib/trees.c     int nextlen = tree[0].Len; /* length of next code */
Len               773 third_party/zlib/trees.c         curlen = nextlen; nextlen = tree[n+1].Len;
Len               827 third_party/zlib/trees.c         if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
Len               857 third_party/zlib/trees.c         send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
Len              1121 third_party/zlib/trees.c     s->last_eob_len = ltree[END_BLOCK].Len;