B 69 lib/md5.c ctx->B = 0xefcdab89; B 93 lib/md5.c set_uint32 (r + 1 * sizeof ctx->B, SWAP (ctx->B)); B 236 lib/md5.c uint32_t B = ctx->B; B 253 lib/md5.c uint32_t B_save = B; B 289 lib/md5.c OP (A, B, C, D, 7, 0xd76aa478); B 290 lib/md5.c OP (D, A, B, C, 12, 0xe8c7b756); B 291 lib/md5.c OP (C, D, A, B, 17, 0x242070db); B 292 lib/md5.c OP (B, C, D, A, 22, 0xc1bdceee); B 293 lib/md5.c OP (A, B, C, D, 7, 0xf57c0faf); B 294 lib/md5.c OP (D, A, B, C, 12, 0x4787c62a); B 295 lib/md5.c OP (C, D, A, B, 17, 0xa8304613); B 296 lib/md5.c OP (B, C, D, A, 22, 0xfd469501); B 297 lib/md5.c OP (A, B, C, D, 7, 0x698098d8); B 298 lib/md5.c OP (D, A, B, C, 12, 0x8b44f7af); B 299 lib/md5.c OP (C, D, A, B, 17, 0xffff5bb1); B 300 lib/md5.c OP (B, C, D, A, 22, 0x895cd7be); B 301 lib/md5.c OP (A, B, C, D, 7, 0x6b901122); B 302 lib/md5.c OP (D, A, B, C, 12, 0xfd987193); B 303 lib/md5.c OP (C, D, A, B, 17, 0xa679438e); B 304 lib/md5.c OP (B, C, D, A, 22, 0x49b40821); B 320 lib/md5.c OP (FG, A, B, C, D, 1, 5, 0xf61e2562); B 321 lib/md5.c OP (FG, D, A, B, C, 6, 9, 0xc040b340); B 322 lib/md5.c OP (FG, C, D, A, B, 11, 14, 0x265e5a51); B 323 lib/md5.c OP (FG, B, C, D, A, 0, 20, 0xe9b6c7aa); B 324 lib/md5.c OP (FG, A, B, C, D, 5, 5, 0xd62f105d); B 325 lib/md5.c OP (FG, D, A, B, C, 10, 9, 0x02441453); B 326 lib/md5.c OP (FG, C, D, A, B, 15, 14, 0xd8a1e681); B 327 lib/md5.c OP (FG, B, C, D, A, 4, 20, 0xe7d3fbc8); B 328 lib/md5.c OP (FG, A, B, C, D, 9, 5, 0x21e1cde6); B 329 lib/md5.c OP (FG, D, A, B, C, 14, 9, 0xc33707d6); B 330 lib/md5.c OP (FG, C, D, A, B, 3, 14, 0xf4d50d87); B 331 lib/md5.c OP (FG, B, C, D, A, 8, 20, 0x455a14ed); B 332 lib/md5.c OP (FG, A, B, C, D, 13, 5, 0xa9e3e905); B 333 lib/md5.c OP (FG, D, A, B, C, 2, 9, 0xfcefa3f8); B 334 lib/md5.c OP (FG, C, D, A, B, 7, 14, 0x676f02d9); B 335 lib/md5.c OP (FG, B, C, D, A, 12, 20, 0x8d2a4c8a); B 338 lib/md5.c OP (FH, A, B, C, D, 5, 4, 0xfffa3942); B 339 lib/md5.c OP (FH, D, A, B, C, 8, 11, 0x8771f681); B 340 lib/md5.c OP (FH, C, D, A, B, 11, 16, 0x6d9d6122); B 341 lib/md5.c OP (FH, B, C, D, A, 14, 23, 0xfde5380c); B 342 lib/md5.c OP (FH, A, B, C, D, 1, 4, 0xa4beea44); B 343 lib/md5.c OP (FH, D, A, B, C, 4, 11, 0x4bdecfa9); B 344 lib/md5.c OP (FH, C, D, A, B, 7, 16, 0xf6bb4b60); B 345 lib/md5.c OP (FH, B, C, D, A, 10, 23, 0xbebfbc70); B 346 lib/md5.c OP (FH, A, B, C, D, 13, 4, 0x289b7ec6); B 347 lib/md5.c OP (FH, D, A, B, C, 0, 11, 0xeaa127fa); B 348 lib/md5.c OP (FH, C, D, A, B, 3, 16, 0xd4ef3085); B 349 lib/md5.c OP (FH, B, C, D, A, 6, 23, 0x04881d05); B 350 lib/md5.c OP (FH, A, B, C, D, 9, 4, 0xd9d4d039); B 351 lib/md5.c OP (FH, D, A, B, C, 12, 11, 0xe6db99e5); B 352 lib/md5.c OP (FH, C, D, A, B, 15, 16, 0x1fa27cf8); B 353 lib/md5.c OP (FH, B, C, D, A, 2, 23, 0xc4ac5665); B 356 lib/md5.c OP (FI, A, B, C, D, 0, 6, 0xf4292244); B 357 lib/md5.c OP (FI, D, A, B, C, 7, 10, 0x432aff97); B 358 lib/md5.c OP (FI, C, D, A, B, 14, 15, 0xab9423a7); B 359 lib/md5.c OP (FI, B, C, D, A, 5, 21, 0xfc93a039); B 360 lib/md5.c OP (FI, A, B, C, D, 12, 6, 0x655b59c3); B 361 lib/md5.c OP (FI, D, A, B, C, 3, 10, 0x8f0ccc92); B 362 lib/md5.c OP (FI, C, D, A, B, 10, 15, 0xffeff47d); B 363 lib/md5.c OP (FI, B, C, D, A, 1, 21, 0x85845dd1); B 364 lib/md5.c OP (FI, A, B, C, D, 8, 6, 0x6fa87e4f); B 365 lib/md5.c OP (FI, D, A, B, C, 15, 10, 0xfe2ce6e0); B 366 lib/md5.c OP (FI, C, D, A, B, 6, 15, 0xa3014314); B 367 lib/md5.c OP (FI, B, C, D, A, 13, 21, 0x4e0811a1); B 368 lib/md5.c OP (FI, A, B, C, D, 4, 6, 0xf7537e82); B 369 lib/md5.c OP (FI, D, A, B, C, 11, 10, 0xbd3af235); B 370 lib/md5.c OP (FI, C, D, A, B, 2, 15, 0x2ad7d2bb); B 371 lib/md5.c OP (FI, B, C, D, A, 9, 21, 0xeb86d391); B 375 lib/md5.c B += B_save; B 382 lib/md5.c ctx->B = B; B 80 lib/md5.h uint32_t B; B 1715 lib/mini-gmp.c double B; B 1736 lib/mini-gmp.c B = 4.0 * (double) (GMP_LIMB_HIGHBIT >> 1); B 1737 lib/mini-gmp.c Bi = 1.0 / B; B 1738 lib/mini-gmp.c for (rn = 1; x >= B; rn++) B 1750 lib/mini-gmp.c x = B * x; B 1774 lib/mini-gmp.c double B = 4.0 * (double) (GMP_LIMB_HIGHBIT >> 1); B 1789 lib/mini-gmp.c x = B*x; B 1809 lib/mini-gmp.c double B, Bi; B 1819 lib/mini-gmp.c B = 4.0 * (double) (GMP_LIMB_HIGHBIT >> 1); B 1820 lib/mini-gmp.c Bi = 1.0 / B; B 1826 lib/mini-gmp.c if (d >= B) B 1840 lib/mini-gmp.c d = B * (d - f); B 56 lib/sha1.c ctx->B = 0xefcdab89; B 81 lib/sha1.c set_uint32 (r + 1 * sizeof ctx->B, SWAP (ctx->B)); B 212 lib/sha1.c #define F1(B,C,D) ( D ^ ( B & ( C ^ D ) ) ) B 213 lib/sha1.c #define F2(B,C,D) (B ^ C ^ D) B 214 lib/sha1.c #define F3(B,C,D) ( ( B & C ) | ( D & ( B | C ) ) ) B 215 lib/sha1.c #define F4(B,C,D) (B ^ C ^ D) B 229 lib/sha1.c uint32_t b = ctx->B; B 247 lib/sha1.c #define R(A,B,C,D,E,F,K,M) do { E += rol( A, 5 ) \ B 248 lib/sha1.c + F( B, C, D ) \ B 251 lib/sha1.c B = rol( B, 30 ); \ B 346 lib/sha1.c b = ctx->B += b; B 51 lib/sha1.h uint32_t B; B 289 lib/sha256.c #define F2(A,B,C) ( ( A & B ) | ( C & ( A | B ) ) ) B 329 lib/sha256.c #define R(A,B,C,D,E,F,G,H,K,M) do { t0 = SS0(A) + F2(A,B,C); \ B 314 lib/sha512.c #define F2(A, B, C) u64or (u64and (A, B), u64and (C, u64or (A, B))) B 356 lib/sha512.c #define R(A, B, C, D, E, F, G, H, K, M) \ B 359 lib/sha512.c u64 t0 = u64plus (SS0 (A), F2 (A, B, C)); \ B 166 src/gmalloc.c #define ADDRESS(B) ((void *) (((B) - 1) * BLOCKSIZE + _heapbase)) B 6697 src/image.c #define COLOR_INTENSITY(R, G, B) ((2 * (R) + 3 * (G) + (B)) / 6) B 283 src/intervals.c INTERVAL B = A->left; B 284 src/intervals.c INTERVAL c = B->right; B 289 src/intervals.c eassert (LENGTH (B) > 0); B 295 src/intervals.c set_interval_left (INTERVAL_PARENT (A), B); B 297 src/intervals.c set_interval_right (INTERVAL_PARENT (A), B); B 299 src/intervals.c copy_interval_parent (B, A); B 302 src/intervals.c set_interval_right (B, A); B 303 src/intervals.c set_interval_parent (A, B); B 311 src/intervals.c A->total_length -= TOTAL_LENGTH (B) - TOTAL_LENGTH0 (c); B 316 src/intervals.c B->total_length = old_total; B 317 src/intervals.c eassert (LENGTH (B) > 0); B 319 src/intervals.c return B; B 334 src/intervals.c INTERVAL B = A->right; B 335 src/intervals.c INTERVAL c = B->left; B 340 src/intervals.c eassert (LENGTH (B) > 0); B 346 src/intervals.c set_interval_left (INTERVAL_PARENT (A), B); B 348 src/intervals.c set_interval_right (INTERVAL_PARENT (A), B); B 350 src/intervals.c copy_interval_parent (B, A); B 353 src/intervals.c set_interval_left (B, A); B 354 src/intervals.c set_interval_parent (A, B); B 362 src/intervals.c A->total_length -= TOTAL_LENGTH (B) - TOTAL_LENGTH0 (c); B 367 src/intervals.c B->total_length = old_total; B 368 src/intervals.c eassert (LENGTH (B) > 0); B 370 src/intervals.c return B; B 17 test/lisp/cedet/semantic-utest-ia-resources/testfriends.cpp friend class B; B 30 test/lisp/cedet/semantic-utest-ia-resources/testfriends.cpp int B::testB() { B 36 test/lisp/cedet/semantic-utest-ia-resources/testfriends.cpp int B::testAB() { // %1% ( ( "testfriends.cpp" ) ( "B" "B::testAB" ) ) B 111 test/manual/cedet/tests/testsppreplace.c #define mf_Amacro(B) int B Amacro(B) B 177 test/manual/etags/c-src/emacs/src/gmalloc.c #define ADDRESS(B) ((void *) (((B) - 1) * BLOCKSIZE + _heapbase)) B 51 test/manual/etags/cp-src/c.C A<float,B<int> > A<B<float>,int>::f(A<int>* x) {} B 55 test/manual/etags/cp-src/c.C const A::B::T& abt = abc; B 74 test/manual/etags/cp-src/c.C struct B { B(); }; B 75 test/manual/etags/cp-src/c.C void B::B() {} B 16 test/manual/etags/cp-src/fail.C typedef B T2; B 31 test/manual/etags/cp-src/fail.C int A::B::f() { return 2; } B 34 test/manual/etags/cp-src/fail.C A::B::C abc(-37); B 41 test/manual/etags/cp-src/fail.C class D : public A::B::C { B 35 test/manual/noverlay/itree-tests.c static struct itree_node A, B, C, D, E; B 461 test/manual/noverlay/itree-tests.c tree.root = &B; B 462 test/manual/noverlay/itree-tests.c A.parent = &B; B.parent = NULL; C.parent = &D; D.parent = &B; E.parent = &D; B 464 test/manual/noverlay/itree-tests.c B.left = &A; B.right = &D; B 466 test/manual/noverlay/itree-tests.c A.offset = B.offset = C.offset = D.offset = E.offset = 0; B 467 test/manual/noverlay/itree-tests.c A.otick = B.otick = C.otick = D.otick = E.otick = tree.otick; B 480 test/manual/noverlay/itree-tests.c B.red = A.red = C.red = E.red = false; B 482 test/manual/noverlay/itree-tests.c itree_remove_fix (&tree, &A, &B); B 485 test/manual/noverlay/itree-tests.c ck_assert (! B.red); B 489 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (A.parent, &B); B 490 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.left, &A); B 491 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.right, &C); B 492 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (C.parent, &B); B 495 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (D.left, &B); B 503 test/manual/noverlay/itree-tests.c B.red = D.red = A.red = C.red = E.red = false; B 504 test/manual/noverlay/itree-tests.c itree_remove_fix (&tree, &A, &B); B 507 test/manual/noverlay/itree-tests.c ck_assert (! B.red); B 511 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (A.parent, &B); B 512 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.left, &A); B 513 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.right, &D); B 516 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (tree.root, &B); B 524 test/manual/noverlay/itree-tests.c B.red = C.red = true; B 525 test/manual/noverlay/itree-tests.c itree_remove_fix (&tree, &A, &B); B 528 test/manual/noverlay/itree-tests.c ck_assert (! B.red); B 532 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (A.parent, &B); B 533 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.left, &A); B 534 test/manual/noverlay/itree-tests.c ck_assert_ptr_null (B.right); B 536 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (C.left, &B); B 546 test/manual/noverlay/itree-tests.c B.red = C.red = E.red = true; B 548 test/manual/noverlay/itree-tests.c itree_remove_fix (&tree, &A, &B); B 551 test/manual/noverlay/itree-tests.c ck_assert (! B.red); B 555 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (A.parent, &B); B 556 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.left, &A); B 557 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.right, &C); B 558 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (C.parent, &B); B 572 test/manual/noverlay/itree-tests.c tree.root = &B; B 573 test/manual/noverlay/itree-tests.c A.parent = &B; B.parent = NULL; C.parent = &D; D.parent = &B; E.parent = &D; B 575 test/manual/noverlay/itree-tests.c B.right = &A; B.left = &D; B 589 test/manual/noverlay/itree-tests.c B.red = A.red = C.red = E.red = false; B 591 test/manual/noverlay/itree-tests.c itree_remove_fix (&tree, &A, &B); B 594 test/manual/noverlay/itree-tests.c ck_assert (! B.red); B 598 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (A.parent, &B); B 599 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.right, &A); B 600 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.left, &C); B 601 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (C.parent, &B); B 604 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (D.right, &B); B 612 test/manual/noverlay/itree-tests.c B.red = D.red = A.red = C.red = E.red = false; B 613 test/manual/noverlay/itree-tests.c itree_remove_fix (&tree, &A, &B); B 616 test/manual/noverlay/itree-tests.c ck_assert (! B.red); B 620 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (A.parent, &B); B 621 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.right, &A); B 622 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.left, &D); B 625 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (tree.root, &B); B 633 test/manual/noverlay/itree-tests.c B.red = C.red = true; B 634 test/manual/noverlay/itree-tests.c itree_remove_fix (&tree, &A, &B); B 637 test/manual/noverlay/itree-tests.c ck_assert (! B.red); B 641 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (A.parent, &B); B 642 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.right, &A); B 643 test/manual/noverlay/itree-tests.c ck_assert_ptr_null (B.left); B 645 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (C.right, &B); B 655 test/manual/noverlay/itree-tests.c B.red = C.red = E.red = true; B 657 test/manual/noverlay/itree-tests.c itree_remove_fix (&tree, &A, &B); B 660 test/manual/noverlay/itree-tests.c ck_assert (! B.red); B 664 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (A.parent, &B); B 665 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.right, &A); B 666 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (B.left, &C); B 667 test/manual/noverlay/itree-tests.c ck_assert_ptr_eq (C.parent, &B);