/macosx-10.9.5/cxxfilt-11/cxxfilt/libiberty/ |
H A D | ffs.c | 1 /* ffs -- Find the first bit set in the parameter 5 Find the first (least significant) bit set in @var{valu}. Bits are 6 numbered from right to left, starting with bit 1 (corresponding to the 16 register int bit; local 21 for (bit = 1; !(valu & 1); bit++) 24 return bit;
|
/macosx-10.9.5/bind9-45.100/bind9/lib/dns/include/dns/ |
H A D | bit.h | 18 /* $Id: bit.h,v 1.14 2007/06/19 23:47:16 tbox Exp $ */ 23 /*! \file dns/bit.h */ 30 #define DNS_BIT_SET(bit, bitset) \ 31 (*(bitset) |= ((dns_bitset_t)1 << (bit))) 32 #define DNS_BIT_CLEAR(bit, bitset) \ 33 (*(bitset) &= ~((dns_bitset_t)1 << (bit))) 34 #define DNS_BIT_CHECK(bit, bitset) \ 35 ISC_TF((*(bitset) & ((dns_bitset_t)1 << (bit))) \ 36 == ((dns_bitset_t)1 << (bit)))
|
/macosx-10.9.5/libpcap-42/libpcap/Win32/Src/ |
H A D | ffs.c | 47 register int bit; local 51 for (bit = 1; !(mask & 1); bit++) 53 return(bit);
|
/macosx-10.9.5/ruby-104/ruby/ext/digest/sha2/ |
H A D | sha2ossl.c | 4 #define SHA_Finish(bit) \ 5 void SHA##bit##_Finish(SHA##bit##_CTX *ctx, char *buf) \ 6 { SHA##bit##_Final((unsigned char *)buf, ctx);}
|
/macosx-10.9.5/xnu-2422.115.4/bsd/sys/ |
H A D | bitstring.h | 70 /* byte of the bitstring bit is in */ 71 #define _bit_byte(bit) \ 72 ((bit) >> 3) 74 /* mask for the bit within its byte */ 75 #define _bit_mask(bit) \ 76 (1 << ((bit) & 0x7)) 87 /* is bit N of bitstring name set? */ 88 #define bit_test(name, bit) \ 89 ((name)[_bit_byte(bit)] & _bit_mask(bit)) [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/autoconf/m4/ |
H A D | linux_mixed_64_32.m4 | 2 # Some Linux machines run a 64-bit kernel with a 32-bit userspace. 'uname -m' 6 [AC_CACHE_CHECK(for 32-bit userspace on 64-bit system,llvm_cv_linux_mixed,
|
/macosx-10.9.5/llvmCore-3425.0.33/projects/sample/autoconf/m4/ |
H A D | linux_mixed_64_32.m4 | 2 # Some Linux machines run a 64-bit kernel with a 32-bit userspace. 'uname -m' 6 [AC_CACHE_CHECK(for 32-bit userspace on 64-bit system,llvm_cv_linux_mixed,
|
/macosx-10.9.5/Libc-997.90.3/string/FreeBSD/ |
H A D | strcspn.c | 41 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to 45 u_long bit; local 52 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */ 61 bit = BIT(*charset); 62 tbl[idx] |= bit; 67 bit = BIT(*s1); 68 if ((tbl[idx] & bit) != 0)
|
H A D | strspn.c | 41 * NB: idx and bit are temporaries whose use causes gcc 3.4.2 to 45 u_long bit; local 52 #if LONG_BIT == 64 /* always better to unroll on 64-bit architectures */ 60 bit = BIT(*charset); 61 tbl[idx] |= bit; 66 bit = BIT(*s1); 67 if ((tbl[idx] & bit) == 0)
|
/macosx-10.9.5/ruby-104/ruby/lib/rdoc/markup/ |
H A D | attributes.rb | 2 # We manage a set of attributes. Each attribute has a symbol name and a bit 26 # Returns a unique bit for +name+ 49 @name_to_bitmap.each do |name, bit| 50 res << name if (bitmap & bit) != 0 62 @name_to_bitmap.each do |name, bit| 63 next if bit == @special 65 yield name.to_s if (bitmap & bit) != 0
|
/macosx-10.9.5/objc4-551.1/runtime/ |
H A D | objc-layout.mm | 78 uint8_t bit = (uint8_t)((bits[i/8] >> (i % 8)) & 1); 79 if (bit) break; 84 uint8_t bit = (uint8_t)((bits[i/8] >> (i % 8)) & 1); 85 if (!bit) break; 128 size_t bit; 129 for (bit = which; bit < which + count && bit < bits.bitCount; bit++) { 130 bits.bits[bit/ [all...] |
/macosx-10.9.5/bzip2-29/bzip2/ |
H A D | unzcrash.c | 6 and then repeatedly decompress it, each time with a different bit of 7 the compressed data inverted, so as to test all possible one-bit errors. 64 void flip_bit ( int bit ) 66 int byteno = bit / 8; 67 int bitno = bit % 8; 69 //fprintf ( stderr, "(byte %d bit %d mask %d)", 78 int bit; local 102 for (bit = 0; bit < nZ*8; bit [all...] |
/macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/ |
H A D | test_rand.c | 156 int bit, i; local 162 for (bit = 0; bit < 8 && c; bit++) { 164 bits[bit]++; 169 for (bit = 0; bit < 8; bit++) { 171 res = ((double)abs(len - bits[bit] * 2)) / (double)len; 174 bit, bi [all...] |
/macosx-10.9.5/Libc-997.90.3/include/ |
H A D | bitstring.h | 45 /* byte of the bitstring bit is in */ 46 #define _bit_byte(bit) \ 47 ((bit) >> 3) 49 /* mask for the bit within its byte */ 50 #define _bit_mask(bit) \ 51 (1 << ((bit)&0x7)) 67 /* is bit N of bitstring name set? */ 68 #define bit_test(name, bit) \ 69 ((name)[_bit_byte(bit)] & _bit_mask(bit)) [all...] |
/macosx-10.9.5/ICU-511.35/icuSources/layoutex/ |
H A D | LXUtilities.cpp | 14 // Finds the high bit by binary searching 23 le_int8 bit = 0; local 27 bit += 16; 32 bit += 8; 37 bit += 4; 42 bit += 2; 47 bit += 1; 50 return bit;
|
/macosx-10.9.5/libdispatch-339.92.1/src/shims/ |
H A D | atomic_sfb.h | 72 typeof(*p) val, bit; local 81 "bts %[_bit], %[_p] \n\t" /* cf = prev bit val */ 87 : [_p] "=m" (*p), [_val] "=&r" (val), [_bit] "=&r" (bit) 88 : [_all_ones] "i" ((typeof(bit))UINT_MAX) : "memory", "cc"); 99 "bts %[_bit], %[_p] \n\t" /* cf = prev bit val */ 105 : [_p] "=m" (*p), [_val] "=&r" (val), [_bit] "=&r" (bit) 106 : [_all_ones] "i" ((typeof(bit))UINT_MAX), 107 [_max] "g" ((typeof(bit))max) : "memory", "cc"); 109 return (unsigned int)bit;
|
/macosx-10.9.5/dtrace-118.1/test/cmd/baddof/ |
H A D | baddof.c | 88 int bit, i; local 97 * We are going iterate through, flipping one bit and attempting 100 for (bit = 0; bit < len * 8; bit++) { 101 saved = buf[bit / 8]; 102 buf[bit / 8] ^= (1 << (bit % 8)); 104 if ((bit % 100) == 0) 105 printf("%d\n", bit); [all...] |
/macosx-10.9.5/ntfs-83/kext/ |
H A D | ntfs_bitmap.h | 53 * @start_bit: first bit to set 57 * Set @count bits starting at bit @start_bit in the bitmap described by the 74 * @start_bit: first bit to set 77 * Set @count bits starting at bit @start_bit in the bitmap described by the 93 * @start_bit: first bit to clear 96 * Clear @count bits starting at bit @start_bit in the bitmap described by the 110 * ntfs_bitmap_set_bit - set a bit in a bitmap 112 * @bit: bit to set 114 * Set bit 120 ntfs_bitmap_set_bit(ntfs_inode *ni, const s64 bit) argument 136 ntfs_bitmap_clear_bit(ntfs_inode *ni, const s64 bit) argument [all...] |
H A D | ntfs_bitmap.c | 54 * @start_bit: first bit to set 59 * Set @count bits starting at bit @start_bit in the bitmap described by the 79 u8 bit; local 99 /* Get the page containing the first bit (@start_bit). */ 110 bit = start_bit & 7; 112 if (bit) { 114 while ((bit & 7) && cnt) { 117 *byte |= 1 << bit++; 119 *byte &= ~(1 << bit++); 172 bit [all...] |
/macosx-10.9.5/groff-38/groff/src/libs/libxutil/ |
H A D | XFontName.c | 14 unsigned int *attrp, unsigned int bit) 28 *attrp |= bit; 36 unsigned int *attrp, unsigned int bit) 42 name = extractStringField (name, buf, sizeof (buf), attrp, bit); 45 if (!(*attrp & bit)) 65 #define GetString(field,bit)\ 68 &attributes, bit))) \ 71 #define GetUnsigned(field,bit)\ 74 &attributes, bit))) \ 124 #define PutString(field, bit)\ 13 extractStringField(char *name, char *buffer, int size, unsigned int *attrp, unsigned int bit) argument 35 extractUnsignedField(char *name, unsigned int *result, unsigned int *attrp, unsigned int bit) argument [all...] |
/macosx-10.9.5/ntp-88/libntp/ |
H A D | atolfp.c | 95 register u_long bit; local 101 bit = 0x80000000; 102 while (bit != 0) { 105 tmp |= bit; 108 bit >>= 1;
|
/macosx-10.9.5/dcerpc-58/dcerpc/idl_compiler/ |
H A D | acf_y.y | 154 } bit; 427 if (acf->acf_interface_attr.bit.code) 429 if (acf->acf_interface_attr.bit.nocode) 431 if (acf->acf_interface_attr.bit.decode) 433 if (acf->acf_interface_attr.bit.encode) 435 if (acf->acf_interface_attr.bit.explicit_handle) 437 if (acf->acf_interface_attr.bit.in_line) 439 if (acf->acf_interface_attr.bit.out_of_line) 441 if (acf->acf_interface_attr.bit.auto_handle) 443 if (acf->acf_interface_attr.bit [all...] |
H A D | fe_pvt.h | 288 #define FE_SET(word,bit) ((word) |= (bit)) 289 #define FE_TEST(word,bit) (((word) & (bit)) != 0) 290 #define FE_CLEAR(word,bit) ((word) &= ~(bit))
|
/macosx-10.9.5/xnu-2422.115.4/osfmk/vm/ |
H A D | vm_external.c | 74 * The implementation uses bit arrays to record whether 76 * convenience, these bit arrays come in various sizes. 83 * For a 32-bit machine with 4KB pages, the largest size 246 uint64_t bit, byte; local 250 bit = atop_64(offset); 251 byte = bit >> 3; 252 if (map[byte] & (1 << (bit & 07))) { 264 uint64_t bit, byte; local 269 bit = atop_64(offset); 270 byte = bit >> 279 uint64_t bit, byte; local [all...] |
/macosx-10.9.5/xnu-2422.115.4/osfmk/i386/ |
H A D | lock.h | 95 * General bit-lock routines. 98 #define bit_lock(bit,l) \ 106 "r" (bit), "m" (*(volatile int *)(l)) : \ 109 #define bit_unlock(bit,l) \ 113 "r" (bit), "m" (*(volatile int *)(l))); 121 #define i_bit_set(bit,l) \ 125 "r" (bit), "m" (*(volatile int *)(l))); 127 #define i_bit_clear(bit,l) \ 131 "r" (bit), "m" (*(volatile int *)(l)));
|