Searched refs:Len (Results 1 - 13 of 13) sorted by relevance

/illumos-gate/usr/src/uts/common/zmod/
H A Dtrees.c167 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
173 send_bits(s, tree[c].Code, tree[c].Len); }
295 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
296 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
297 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
298 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
307 static_dtree[n].Len = 5;
342 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
348 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
512 tree[s->heap[s->heap_max]].Len
[all...]
H A Ddeflate.h76 #define Len dl.len macro
/illumos-gate/usr/src/boot/lib/libz/
H A Dtrees.c163 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
169 send_bits(s, tree[c].Code, tree[c].Len); }
293 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
294 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
295 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
296 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
305 static_dtree[n].Len = 5;
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
346 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
510 tree[s->heap[s->heap_max]].Len
[all...]
H A Ddeflate.h79 #define Len dl.len macro
/illumos-gate/usr/src/uts/sparc/ml/
H A Dfd_asm.s67 #define Len %l6 /* data length counter */ define
116 ld [Fdc + FD_RLEN], Len
132 sub Len, 0x1, Len ! predecrement length...
138 3: tst Len ! if (len == 0) send TC
146 4: st Len, [Fdc + FD_RLEN]
157 st Len, [Fdc + FD_RLEN]
193 7: st Len, [Fdc + FD_RLEN]
245 add Adr, 10, Len ! put an upper bound on it..
260 cmp Adr, Len ! alread
[all...]
/illumos-gate/usr/src/uts/common/io/cpqary3/
H A Dcpqary3_ciss.h192 uint32_t Len; /* 12 */ member in struct:_ErrDescriptor_t
197 uint32_t Len; member in struct:_SGDescriptor_t
H A Dcpqary3_ioctl.c485 cmdlist->SG[0].Len = bmic_pass->buf_len;
762 cmdlist->SG[0].Len = scsi_pass->buf_len;
860 cmdlist->SG[0].Len = bmic_pass->buf_len;
H A Dcpqary3_noe.c194 cmdlist->SG[0].Len = NOE_BUFFER_LENGTH;
H A Dcpqary3_mem.c357 memp->cmdlist_memaddr->ErrDesc.Len = sizeof (ErrorInfo_t);
H A Dcpqary3_util.c379 memp->cmdlist_memaddr->SG[0].Len = (uint32_t)bufsz;
H A Dcpqary3_scsi.c160 cmdlistp->SG[cntr].Len = (uint32_t)
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c198 #define Len dl.len macro
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); }
1716 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
1717 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
1718 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
1719 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
1728 static_dtree[n].Len = 5;
1739 if (static_dtree[0].Len == 0) {
1870 tree[s->heap[s->heap_max]].Len
[all...]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c343 #define Len dl.len macro
2378 #define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
2384 send_bits(s, tree[c].Code, tree[c].Len); }
2517 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
2518 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
2519 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
2520 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
2530 static_dtree[n].Len = 5;
2680 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
2684 bits = tree[tree[n].Dad].Len
[all...]

Completed in 133 milliseconds