Home
last modified time | relevance | path

Searched refs:Len (Results 1 – 22 of 22) sorted by relevance

/titanic_53/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]++; in tr_static_init()
294 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
295 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
296 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
305 static_dtree[n].Len = 5; in tr_static_init()
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
346 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
510 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
[all …]
H A Ddeflate.h79 #define Len dl.len macro
/titanic_53/usr/src/contrib/zlib/
H A Dtrees.c161 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
167 send_bits(s, tree[c].Code, tree[c].Len); }
291 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
292 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
293 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
294 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
303 static_dtree[n].Len = 5; in tr_static_init()
338 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
344 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
508 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
[all …]
H A Ddeflate.h80 #define Len dl.len macro
/titanic_53/usr/src/uts/common/sys/scsi/adapters/smrt/
H A Dsmrt_ciss.h277 uint32_t Len; member
282 uint32_t Len; member
/titanic_53/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]++; in ct_static_init()
1717 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in ct_static_init()
1718 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in ct_static_init()
1719 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in ct_static_init()
1728 static_dtree[n].Len = 5; in ct_static_init()
1739 if (static_dtree[0].Len == 0) {
1870 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
[all …]
/titanic_53/usr/src/uts/common/io/cpqary3/
H A Dcpqary3_ciss.h192 uint32_t Len; /* 12 */ member
197 uint32_t Len; member
H A Dcpqary3_ioctl.c485 cmdlist->SG[0].Len = bmic_pass->buf_len; in cpqary3_ioctl_fil_bmic()
762 cmdlist->SG[0].Len = scsi_pass->buf_len; in cpqary3_ioctl_fil_scsi()
860 cmdlist->SG[0].Len = bmic_pass->buf_len; in cpqary3_ioctl_fil_bmic_sas()
H A Dcpqary3_noe.c194 cmdlist->SG[0].Len = NOE_BUFFER_LENGTH; in cpqary3_send_NOE_command()
H A Dcpqary3_mem.c357 memp->cmdlist_memaddr->ErrDesc.Len = sizeof (ErrorInfo_t); in cpqary3_cmdlist_occupy()
H A Dcpqary3_util.c379 memp->cmdlist_memaddr->SG[0].Len = (uint32_t)bufsz; in cpqary3_synccmd_alloc()
H A Dcpqary3_scsi.c160 cmdlistp->SG[cntr].Len = (uint32_t) in cpqary3_build_cmdlist()
/titanic_53/usr/src/uts/sparc/ml/
H A Dfd_asm.s67 #define Len %l6 /* data length counter */ macro
/titanic_53/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]++; in tr_static_init()
2518 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
2519 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
2520 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
2530 static_dtree[n].Len = 5; in tr_static_init()
2680 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
2684 bits = tree[tree[n].Dad].Len + 1;
[all …]
/titanic_53/usr/src/uts/common/io/scsi/adapters/smrt/
H A Dsmrt_commands.c199 smcm->smcm_va_cmd->ErrDesc.Len = sizeof (ErrorInfo_t); in smrt_command_alloc_impl()
276 smcm->smcm_va_cmd->SG[0].Len = (uint32_t)len; in smrt_command_attach_internal()
H A Dsmrt_hba.c549 smcm->smcm_va_cmd->SG[i].Len = in smrt_tran_start()
/titanic_53/usr/src/lib/iconv_modules/hi_IN/
H A DUTF-8%iscii91.c62 #define ucs2_from_utf8(mUCS, Ch, Ct, Mask, Len) \ argument
64 for ((Ct) = 1; (Ct) < (Len); ++(Ct)) { \
/titanic_53/usr/src/boot/lib/libz/doc/
H A Drfc1951.txt419 initially in tree[I].Len; the codes are produced in
442 len = tree[n].Len;
/titanic_53/usr/src/contrib/ast/src/cmd/INIT/
H A Dratz.c1286 #define Len dl.len macro
/titanic_53/usr/src/uts/intel/io/acpica/
H A Dchanges.txt5427 iASL: Implemented Min/Max/Len/Gran validation for address resource
6572 verbosity of this debug level. Len Brown.
8990 machines (with assistance from Len Brown.)
10250 Len Brown.
/titanic_53/usr/src/cmd/look/
H A Dwords13360 Len
/titanic_53/usr/src/cmd/spell/
H A Dlist13358 Len