| /illumos-gate/usr/src/uts/intel/sys/acpi/ |
| H A D | acpiosxf.h | 79 UINT32 Code; member in struct:acpi_signal_fatal_info
|
| H A D | acstruct.h | 171 ACPI_OBJECT_INTEGER *Code; member in struct:acpi_aml_operands::__anon340
|
| H A D | actbl1.h | 1292 UINT16 Code; member in struct:acpi_nfit_control_region
|
| /illumos-gate/usr/src/uts/common/zmod/ |
| H A D | deflate.h | 74 #define Code fc.code macro
|
| /illumos-gate/usr/src/boot/lib/libz/ |
| H A D | deflate.h | 77 #define Code fc.code macro
|
| /illumos-gate/usr/src/boot/sys/boot/efi/include/ |
| H A D | efiip.h | 61 UINT8 Code; member in struct:__anon168
251 UINT8 Code; member in struct:__anon182
|
| H A D | efipxebc.h | 22 EFI PXE Base Code Protocol
31 // PXE Base Code protocol
89 UINT8 Code; member in struct:__anon210
225 // PXE Base Code Mode structure
269 // PXE Base Code Interface Function definitions
401 // PXE Base Code Protocol structure
|
| /illumos-gate/usr/src/uts/common/sys/fibre-channel/fca/emlxs/ |
| H A D | emlxs_queue.h | 13 * When distributing Covered Code, include this CDDL HEADER in each
81 uint32_t Code: 8; member in struct:CQE_CmplWQ
93 uint32_t Code: 8; member in struct:CQE_CmplWQ
113 uint32_t Code: 8; member in struct:CQE_RelWQ
124 uint32_t Code: 8; member in struct:CQE_RelWQ
146 uint32_t Code: 8; member in struct:CQE_UnsolRcv
163 uint32_t Code: 8; member in struct:CQE_UnsolRcv
187 uint32_t Code: 8; member in struct:CQE_UnsolRcvV1
204 uint32_t Code: 8; member in struct:CQE_UnsolRcvV1
235 uint32_t Code member in struct:CQE_XRI_Abort
249 uint32_t Code: 8; member in struct:CQE_XRI_Abort
[all...] |
| /illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/ |
| H A D | zlib.c | 196 #define Code fc.code macro
972 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
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); }
1729 static_dtree[n].Code = bi_reverse(n, 5);
1962 tree[n].Code = bi_reverse(next_code[len]++, len);
1965 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
3179 6. There are up to 286 literal/length codes. Code 256 represents the
3194 10. In the tree reconstruction algorithm, Code = Code
[all...] |
| /illumos-gate/usr/src/uts/common/io/ppp/spppcomp/ |
| H A D | zlib.c | 341 #define Code fc.code macro
1492 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1632 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
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); }
2531 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
2784 tree[n].Code = bi_reverse(next_code[len]++, len);
2788 n, (isgraph(n) ? n : ' '), len, tree[n].Code,
4265 * 6. There are up to 286 literal/length codes. Code 256 represents the
4280 * 10. In the tree reconstruction algorithm, Code
[all...] |