Home
last modified time | relevance | path

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

/dragonfly/sys/vfs/hammer2/zlib/
H A Dhammer2_zlib_trees.c169 send_bits(s, tree[c].Code, tree[c].Len); }
306 static_dtree[n].Len = 5; in tr_static_init()
517 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
519 tree[n].Len = (ush)bits; in gen_bitlen()
563 tree[m].Len = (ush)bits; in gen_bitlen()
604 int len = tree[n].Len; in gen_codes()
644 tree[n].Len = 0; in build_tree()
719 int nextlen = tree[0].Len; /* length of next code */ in scan_tree()
725 tree[max_code+1].Len = (ush)0xffff; /* guard */ in scan_tree()
728 curlen = nextlen; nextlen = tree[n+1].Len; in scan_tree()
[all …]
H A Dhammer2_zlib_deflate.h71 #define Len dl.len macro
/dragonfly/contrib/zlib-1.2/
H A Dtrees.c167 send_bits(s, tree[c].Code, tree[c].Len); }
303 static_dtree[n].Len = 5; in tr_static_init()
512 bits = tree[tree[n].Dad].Len + 1;
514 tree[n].Len = (ush)bits;
557 tree[m].Len = (ush)bits;
597 int len = tree[n].Len;
637 tree[n].Len = 0;
711 int nextlen = tree[0].Len; /* length of next code */
717 tree[max_code+1].Len = (ush)0xffff; /* guard */
720 curlen = nextlen; nextlen = tree[n+1].Len;
[all …]
H A Ddeflate.h82 #define Len dl.len macro
/dragonfly/usr.sbin/makefs/hammer2/zlib/
H A Dhammer2_zlib_trees.c169 send_bits(s, tree[c].Code, tree[c].Len); }
306 static_dtree[n].Len = 5; in tr_static_init()
517 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
519 tree[n].Len = (ush)bits; in gen_bitlen()
563 tree[m].Len = (ush)bits; in gen_bitlen()
604 int len = tree[n].Len; in gen_codes()
644 tree[n].Len = 0; in build_tree()
719 int nextlen = tree[0].Len; /* length of next code */ in scan_tree()
725 tree[max_code+1].Len = (ush)0xffff; /* guard */ in scan_tree()
728 curlen = nextlen; nextlen = tree[n+1].Len; in scan_tree()
[all …]
H A Dhammer2_zlib_deflate.h71 #define Len dl.len macro
/dragonfly/sbin/hammer2/zlib/
H A Dhammer2_zlib_trees.c169 send_bits(s, tree[c].Code, tree[c].Len); }
306 static_dtree[n].Len = 5; in tr_static_init()
517 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
519 tree[n].Len = (ush)bits; in gen_bitlen()
563 tree[m].Len = (ush)bits; in gen_bitlen()
604 int len = tree[n].Len; in gen_codes()
644 tree[n].Len = 0; in build_tree()
719 int nextlen = tree[0].Len; /* length of next code */ in scan_tree()
725 tree[max_code+1].Len = (ush)0xffff; /* guard */ in scan_tree()
728 curlen = nextlen; nextlen = tree[n+1].Len; in scan_tree()
[all …]
H A Dhammer2_zlib_deflate.h71 #define Len dl.len macro
/dragonfly/contrib/diffutils/lib/
H A Dnstrftime.c152 # define memset_byte(P, Len, Byte) \ argument
153 do { size_t _i; for (_i = 0; _i < Len; _i++) fputc (Byte, P); } while (0)
154 # define memset_space(P, Len) memset_byte (P, Len, ' ') argument
155 # define memset_zero(P, Len) memset_byte (P, Len, '0') argument
157 # define memset_space(P, Len) (wmemset (P, L' ', Len), (P) += (Len)) argument
158 # define memset_zero(P, Len) (wmemset (P, L'0', Len), (P) += (Len)) argument
160 # define memset_space(P, Len) (memset (P, ' ', Len), (P) += (Len)) argument
161 # define memset_zero(P, Len) (memset (P, '0', Len), (P) += (Len)) argument
/dragonfly/contrib/cvs-1.12/lib/
H A Dstrftime.c159 # define memset_space(P, Len) (wmemset (P, L' ', Len), (P) += (Len)) argument
160 # define memset_zero(P, Len) (wmemset (P, L'0', Len), (P) += (Len)) argument
162 # define memset_space(P, Len) (memset (P, ' ', Len), (P) += (Len)) argument
163 # define memset_zero(P, Len) (memset (P, '0', Len), (P) += (Len)) argument
/dragonfly/sys/contrib/dev/acpica/source/compiler/
H A Daslcodegen.c354 UINT32 Len; in CgWriteAmlOpcode() member
416 PkgLen.Len = (UINT32) Op->Asl.Value.Integer; in CgWriteAmlOpcode()
434 PkgLen.Len = Op->Asl.AmlSubtreeLength + Op->Asl.AmlPkgLenBytes; in CgWriteAmlOpcode()
464 PkgLen.Len >>= 4; in CgWriteAmlOpcode()
/dragonfly/sys/net/
H A Dzlib.c336 #define Len dl.len macro
1985 send_bits(s, tree[c].Code, tree[c].Len); }
2122 static_dtree[n].Len = 5; in tr_static_init()
2270 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
2272 tree[n].Len = (ush)bits; in gen_bitlen()
2312 if (tree[m].Len != (unsigned) bits) { in gen_bitlen()
2316 tree[m].Len = (ush)bits; in gen_bitlen()
2358 int len = tree[n].Len; in gen_codes()
2400 tree[n].Len = 0; in build_tree()
2484 curlen = nextlen; nextlen = tree[n+1].Len; in scan_tree()
[all …]
/dragonfly/stand/contrib/edk2/MdePkg/Include/Uefi/
H A DUefiPxe.h712 PXE_UINT8 Len; ///< sizeof(PXE_HW_UNDI). member
809 PXE_UINT8 Len; ///< sizeof(PXE_SW_UNDI). member
/dragonfly/stand/contrib/edk2/MdePkg/Include/IndustryStandard/
H A DAcpi10.h118 UINT16 Len;
/dragonfly/share/dict/
H A Dpropernames654 Len
H A Dweb2105527 Len
/dragonfly/contrib/wpa_supplicant/src/eap_server/
H A Deap_server.c143 eap_copy_data((dst), (dst ## Len), (src), (src ## Len))
/dragonfly/contrib/tcp_wrappers/
H A DREADME1024 (cs.psu.edu), John A. Kunze (violet.berkeley.edu), Daniel Len Schales
/dragonfly/contrib/dialog/
H A DCHANGES1536 using Watcom 10.6 (patch by Len Meakin).
/dragonfly/sys/contrib/dev/acpica/
H A Dchanges.txt8434 iASL: Implemented Min/Max/Len/Gran validation for address resource
9579 verbosity of this debug level. Len Brown.
11997 machines (with assistance from Len Brown.)
13257 Len Brown.
/dragonfly/contrib/diffutils/doc/
H A Ddiffutils.info130 Richard Stallman, and Len Tower. Wayne Davison designed and implemented
/dragonfly/games/fortune/datfiles/
H A Dfortunes44526 -- Len Cool, "American Pie"