bit 302 lib/replace/crypt.c int bit, sg; bit 311 lib/replace/crypt.c for(bit = 0; bit < 56; bit++) { bit 312 lib/replace/crypt.c comes_from_bit = pc1[bit] - 1; bit 314 lib/replace/crypt.c mask2 = longmask[bit % 28 + 4]; bit 317 lib/replace/crypt.c do_pc1[comes_from_bit / 8][bit / 28][j] |= mask2; bit 326 lib/replace/crypt.c for(bit = 0; bit < 48; bit++) { bit 327 lib/replace/crypt.c comes_from_bit = pc2[bit] - 1; bit 329 lib/replace/crypt.c mask2 = BITMASK(bit % 24); bit 350 lib/replace/crypt.c for(bit = 0; bit < 48; bit++) { bit 353 lib/replace/crypt.c comes_from = perm32[esel[bit]-1]-1; bit 358 lib/replace/crypt.c eperm32tab[comes_from / 8][j][bit / 24] |= BITMASK(bit % 24); bit 420 lib/replace/crypt.c for(bit=48; bit--;) { bit 421 lib/replace/crypt.c e_inverse[esel[bit] - 1 ] = bit; bit 422 lib/replace/crypt.c e_inverse[esel[bit] - 1 + 32] = bit + 48; bit 430 lib/replace/crypt.c for(bit = 0; bit < 64; bit++) { bit 437 lib/replace/crypt.c o_long = bit / 32; /* 0..1 */ bit 438 lib/replace/crypt.c o_bit = bit % 32; /* 0..31 */ bit 447 lib/replace/crypt.c comes_from_f_bit = final_perm[bit] - 1; /* 0..63 */ bit 50 lib/util/idtree.c #define set_bit(bit, v) (v) |= (1<<(bit)) bit 51 lib/util/idtree.c #define clear_bit(bit, v) (v) &= ~(1<<(bit)) bit 52 lib/util/idtree.c #define test_bit(bit, v) ((v) & (1<<(bit))) bit 28 source3/include/smb_macros.h #define BITSETW(ptr,bit) ((SVAL(ptr,0) & (1<<(bit)))!=0) bit 129 source4/heimdal/lib/gssapi/mech/gss_mech_switch.c int bit = 7*(bytes-1); bit 131 source4/heimdal/lib/gssapi/mech/gss_mech_switch.c *res = (number >> bit) & 0x7f; bit 243 source4/heimdal/lib/hcrypto/bn.c BN_is_bit_set(const BIGNUM *bn, int bit) bit 248 source4/heimdal/lib/hcrypto/bn.c if ((bit / 8) > hi->length || hi->length == 0) bit 251 source4/heimdal/lib/hcrypto/bn.c return p[hi->length - 1 - (bit / 8)] & is_set[bit % 8]; bit 255 source4/heimdal/lib/hcrypto/bn.c BN_set_bit(BIGNUM *bn, int bit) bit 260 source4/heimdal/lib/hcrypto/bn.c if ((bit / 8) > hi->length || hi->length == 0) { bit 261 source4/heimdal/lib/hcrypto/bn.c size_t len = (bit + 7) / 8; bit 272 source4/heimdal/lib/hcrypto/bn.c p[hi->length - 1 - (bit / 8)] |= is_set[bit % 8]; bit 277 source4/heimdal/lib/hcrypto/bn.c BN_clear_bit(BIGNUM *bn, int bit) bit 282 source4/heimdal/lib/hcrypto/bn.c if ((bit / 8) > hi->length || hi->length == 0) bit 285 source4/heimdal/lib/hcrypto/bn.c p[hi->length - 1 - (bit / 8)] &= (unsigned char)(~(is_set[bit % 8])); bit 3454 source4/rpc_server/samr/dcesrv_samr.c #define IFSET(bit) if (bit & r->in.info->info21.fields_present) bit 3489 source4/rpc_server/samr/dcesrv_samr.c #define IFSET(bit) if (bit & r->in.info->info23.info.fields_present) bit 3545 source4/rpc_server/samr/dcesrv_samr.c #define IFSET(bit) if (bit & r->in.info->info25.info.fields_present) bit 1172 source4/torture/raw/acls.c uint32_t bit = (1<<i); bit 1173 source4/torture/raw/acls.c io.ntcreatex.in.access_mask = bit; bit 1175 source4/torture/raw/acls.c if (expected_bits & bit) { bit 1178 source4/torture/raw/acls.c bit, expected_bits); bit 1181 source4/torture/raw/acls.c CHECK_ACCESS_FLAGS(io.ntcreatex.out.file.fnum, bit | SEC_FILE_READ_ATTRIBUTE); bit 1187 source4/torture/raw/acls.c bit, expected_bits);