/macosx-10.9.5/xnu-2422.115.4/osfmk/i386/ |
H A D | machine_check.h | 41 * Macro BITS(n,m) returns the number of bits between bit(n) and bit(m), 44 #define BITS(n,m) ((n)-(m)+1) macro 53 uint64_t count :BITS(7,0); 59 uint64_t mcg_reserved2 :BITS(15,13); 60 uint64_t mcg_ext_cnt :BITS(23,16); 121 uint64_t mca_error :BITS(15,0); 122 uint64_t model_specific_error :BITS(31,16); 123 uint64_t other_information :BITS(56,32); 133 uint64_t mca_error :BITS(15,0); 134 uint64_t model_specific_error :BITS(3 [all...] |
/macosx-10.9.5/zlib-53/zlib/contrib/infback9/ |
H A D | infback9.c | 157 #define BITS(n) \ macro 285 lastblock = BITS(1); 287 switch (BITS(2)) { 349 state->nlen = BITS(5) + 257; 351 state->ndist = BITS(5) + 1; 353 state->ncode = BITS(4) + 4; 366 state->lens[order[state->have++]] = (unsigned short)BITS(3); 387 here = lencode[BITS(lenbits)]; 406 copy = 3 + BITS(2); 413 copy = 3 + BITS( [all...] |
/macosx-10.9.5/sudo-72/src/zlib/ |
H A D | infback.c | 190 #define BITS(n) \ macro 300 state->last = BITS(1); 302 switch (BITS(2)) { 361 state->nlen = BITS(5) + 257; 363 state->ndist = BITS(5) + 1; 365 state->ncode = BITS(4) + 4; 380 state->lens[order[state->have++]] = (unsigned short)BITS(3); 401 here = state->lencode[BITS(state->lenbits)]; 419 copy = 3 + BITS(2); 426 copy = 3 + BITS( [all...] |
H A D | inflate.c | 505 #define BITS(n) \ macro 547 the requested bits are not available. The typical use of the BITS macros 551 ... do something with BITS(n) ... 555 input left to load n bits into the accumulator, or it continues. BITS(n) 560 and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. 576 keep[want++] = BITS(n); 665 ((BITS(8) << 8) + (hold >> 8)) % 31) { 670 if (BITS(4) != Z_DEFLATED) { 676 len = BITS(4) + 8; 839 state->last = BITS( [all...] |
/macosx-10.9.5/xnu-2422.115.4/libkern/zlib/ |
H A D | infback.c | 210 #define BITS(n) \ macro 320 state->last = BITS(1); 322 switch (BITS(2)) { 381 state->nlen = BITS(5) + 257; 383 state->ndist = BITS(5) + 1; 385 state->ncode = BITS(4) + 4; 400 state->lens[order[state->have++]] = (unsigned short)BITS(3); 421 this = state->lencode[BITS(state->lenbits)]; 440 copy = 3 + BITS(2); 447 copy = 3 + BITS( [all...] |
H A D | inflate.c | 479 #define BITS(n) \ macro 521 the requested bits are not available. The typical use of the BITS macros 525 ... do something with BITS(n) ... 529 input left to load n bits into the accumulator, or it continues. BITS(n) 534 and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. 550 keep[want++] = BITS(n); 639 ((BITS(8) << 8) + (hold >> 8)) % 31) { 644 if (BITS(4) != Z_DEFLATED) { 650 len = BITS(4) + 8; 811 state->last = BITS( [all...] |
/macosx-10.9.5/zlib-53/zlib/ |
H A D | infback.c | 181 #define BITS(n) \ macro 291 state->last = BITS(1); 293 switch (BITS(2)) { 352 state->nlen = BITS(5) + 257; 354 state->ndist = BITS(5) + 1; 356 state->ncode = BITS(4) + 4; 371 state->lens[order[state->have++]] = (unsigned short)BITS(3); 392 here = state->lencode[BITS(state->lenbits)]; 411 copy = 3 + BITS(2); 418 copy = 3 + BITS( [all...] |
H A D | inflate.c | 485 #define BITS(n) \ macro 527 the requested bits are not available. The typical use of the BITS macros 531 ... do something with BITS(n) ... 535 input left to load n bits into the accumulator, or it continues. BITS(n) 540 and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. 556 keep[want++] = BITS(n); 645 ((BITS(8) << 8) + (hold >> 8)) % 31) { 650 if (BITS(4) != Z_DEFLATED) { 656 len = BITS(4) + 8; 819 state->last = BITS( [all...] |
/macosx-10.9.5/bind9-45.100/bind9/contrib/idn/idnkit-1.0-src/util/ |
H A D | SparseMap.pm | 53 # BITS => [8, 7, 6], # 3-level map, 2nd level bits=7, 3rd = 6. 58 croak "BITS unspecified" unless exists $self->{BITS}; 59 croak "BITS is not an array reference" 60 unless ref($self->{BITS}) eq 'ARRAY'; 63 $self->{MAXLV} = @{$self->{BITS}} - 1; 113 my @bits = @{$self->{BITS}}; 149 my @bits = @{$self->{BITS}}; 286 my $bits = $self->{BITS}; 313 @map = ($v) x (1 << $self->{BITS} [all...] |
H A D | generate_normalize_data.pl | 119 my $canon_class = SparseMap::Int->new(BITS => [@canon_class_bits], 125 my $decomp = SparseMap::Int->new(BITS => [@decomp_bits], 131 my $comp = SparseMap::Int->new(BITS => [@comp_bits], 137 my $upper = SparseMap::Int->new(BITS => [@casemap_bits], 141 my $lower = SparseMap::Int->new(BITS => [@casemap_bits], 147 my $casemap_ctx = SparseMap::Int->new(BITS => [@casemap_ctx_bits], 153 my $folding = SparseMap::Int->new(BITS => [@folding_bits],
|
H A D | generate_nameprep_data.pl | 96 my $map = SparseMap::Int->new(BITS => [@map_bits], 129 my $proh = SparseMap::Bit->new(BITS => [@proh_bits], 157 my $unas = SparseMap::Bit->new(BITS => [@unas_bits], 185 my $bidi = SparseMap::Int->new(BITS => [@bidi_bits],
|
/macosx-10.9.5/ksh-20/ksh/src/lib/libcmd/ |
H A D | stty.c | 101 #define BITS 2 macro 308 { "cr0", BITS, O_FLAG, IG|SS, CRDLY, CR0 }, 309 { "cr1", BITS, O_FLAG, US, CRDLY, CR1 }, 310 { "cr2", BITS, O_FLAG, US, CRDLY, CR2 }, 311 { "cr3", BITS, O_FLAG, US, CRDLY, CR3 }, 314 { "nl0", BITS, O_FLAG, IG|US, NLDLY, NL0 }, 315 { "nl1", BITS, O_FLAG, US, NLDLY, NL1 }, 320 { "tab0", BITS, O_FLAG, IG|SS, TABDLY, TAB0 }, 323 { "tab1", BITS, O_FLAG, US, TABDLY, TAB1 }, 326 { "tab2", BITS, O_FLA [all...] |
/macosx-10.9.5/rsync-42/rsync/zlib/ |
H A D | inflate.c | 450 #define BITS(n) \ macro 492 the requested bits are not available. The typical use of the BITS macros 496 ... do something with BITS(n) ... 500 input left to load n bits into the accumulator, or it continues. BITS(n) 505 and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. 521 keep[want++] = BITS(n); 610 ((BITS(8) << 8) + (hold >> 8)) % 31) { 615 if (BITS(4) != Z_DEFLATED) { 621 len = BITS(4) + 8; 782 state->last = BITS( [all...] |
/macosx-10.9.5/cxxfilt-11/cxxfilt/opcodes/ |
H A D | arc-dis.c | 61 #define BITS(word,s,e) (((word) << (31 - e)) >> (s + (31 - e))) macro 62 #define OPCODE(word) (BITS ((word), 27, 31)) 63 #define FIELDA(word) (BITS ((word), 21, 26)) 64 #define FIELDB(word) (BITS ((word), 15, 20)) 65 #define FIELDC(word) (BITS ((word), 9, 14)) 69 #define FIELDD(word) (BITS (((signed int)word), 0, 8)) 86 state->nullifyMode = BITS (state->words[0], 5, 6); \ 87 cond = BITS (state->words[0], 0, 4); \ 96 cond = BITS (state->words[0], 0, 4); \ 579 switch (BITS (stat [all...] |
/macosx-10.9.5/ksh-20/ksh/src/lib/libast/vmalloc/ |
H A D | vmbest.c | 155 if(SIZE(node) & BITS) 199 { nextb = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) ); 437 s = SIZE(fp); /**/ASSERT(!(s&BITS)); 439 size = (size&~BITS) + s + sizeof(Head_t); 441 else size &= ~BITS; 454 { /**/ASSERT((s&BITS) == 0); 683 /**/ ASSERT((ALIGN%(BITS+1)) == 0 ); 703 SIZE(np) = ((s&~BITS) - (size+sizeof(Head_t)))|JUNK|BUSY; 705 SIZE(tp) |= s&BITS; 758 { SIZE(np) &= ~BITS; [all...] |
H A D | vmstat.c | 85 { s = SIZE(b)&~BITS; 106 b = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) );
|
H A D | vmhdr.h | 182 /* Blocks are allocated such that their sizes are 0%(BITS+1) 188 #define BITS (07) /* (BUSY|PFREE|JUNK) */ macro 189 #define ALIGNB (8) /* size must be a multiple of BITS+1 */ 191 #define ISBITS(w) ((w) & BITS) 192 #define CLRBITS(w) ((w) &= ~BITS) 193 #define CPYBITS(w,f) ((w) |= ((f)&BITS) ) 241 ** It should also be a multiple of ALIGNB==(BITS+1) so the size field 242 ** of Block_t will always be 0%(BITS+1) as noted above. 431 #define PFDATA(d) ((Head_t*)((Vmuchar_t*)(d)+(SIZE(BLOCK(d))&~BITS)-sizeof(Head_t)) ) 455 #define DBBSIZE(d) (SIZE(DBBLOCK(d)) & ~BITS) [all...] |
H A D | vmtrace.c | 275 else s = SIZE(b)&~BITS; 279 b = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) );
|
H A D | vmpool.c | 83 (s = (SIZE(tp) & ~BITS) + sizeof(Head_t)) >= size ) 89 { s = (SIZE(tp) & ~BITS) + sizeof(Head_t); 320 if(seg->size == (s = SIZE(fp)&~BITS))
|
/macosx-10.9.5/file_cmds-230/compress/ |
H A D | zopen.c | 75 #define BITS 16 /* Default bits. */ macro 78 /* A code_int must be able to hold 2**BITS values of type int, and also -1. */ 123 char_type zs_buf[BITS]; 136 char_type zs_gbuf[BITS]; 178 * the codetab. The tab_suffix table needs 2**BITS characters. We get this 189 #define de_stack ((char_type *)&tab_suffixof(1 << BITS)) 357 * Maintain a BITS character long buffer (so that 8 codes will 489 if (maxbits > BITS || maxbits < 12) { 536 * bound by 1 << BITS - 256. 698 bits < 0 || bits > BITS) { [all...] |
/macosx-10.9.5/vim-53/runtime/syntax/ |
H A D | mib.vim | 14 syn keyword mibImplicit ACCESS ANY AUGMENTS BEGIN BIT BITS BOOLEAN CHOICE
|
H A D | modula3.vim | 22 syn keyword modula3Keyword ARRAY AS BITS BITSIZE BOOLEAN BRANDED BY BYTESIZE
|
/macosx-10.9.5/ksh-20/ksh/src/cmd/INIT/ |
H A D | ratz.c | 2664 #define BITS(n) \ macro 2706 the requested bits are not available. The typical use of the BITS macros 2710 ... do something with BITS(n) ... 2714 input left to load n bits into the accumulator, or it continues. BITS(n) 2719 and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. 2735 keep[want++] = BITS(n); 2824 ((BITS(8) << 8) + (hold >> 8)) % 31) { 2829 if (BITS(4) != Z_DEFLATED) { 2835 len = BITS(4) + 8; 2996 state->last = BITS( [all...] |
/macosx-10.9.5/tcl-102/tcl_ext/tclx/tclx/generic/ |
H A D | tclExtdInt.h | 65 # define BITS(type) (BITSPERBYTE * (int)sizeof(type)) macro 66 # define HIBITI (1 << BITS(int) - 1)
|
/macosx-10.9.5/tcl-102/tcl_ext/tklib/tklib/modules/ico/ |
H A D | ico0.tcl | 30 variable BITS 31 array set BITS [list {} 0 0000 0 0001 1 0010 2 0011 3 0100 4 \ 436 variable BITS 443 lset colors $y $x [lindex $palette $BITS($bits)] 457 variable BITS 466 lset colors $y $x "#$BITS($b3)$BITS($b2)$BITS($b1)"
|