X 29 block-sha1/sha1.c #define SHA_ROT(X,l,r) (((X) << (l)) | ((X) >> (r))) X 30 block-sha1/sha1.c #define SHA_ROL(X,n) SHA_ROT(X,n,32-(n)) X 31 block-sha1/sha1.c #define SHA_ROR(X,n) SHA_ROT(X,32-(n),n) X 2754 compat/nedmalloc/malloc.c.h unsigned int X = S >> TREEBIN_SHIFT;\ X 2755 compat/nedmalloc/malloc.c.h if (X == 0)\ X 2757 compat/nedmalloc/malloc.c.h else if (X > 0xFFFF)\ X 2761 compat/nedmalloc/malloc.c.h __asm__("bsrl\t%1, %0\n\t" : "=r" (K) : "rm" (X));\ X 2769 compat/nedmalloc/malloc.c.h size_t X = S >> TREEBIN_SHIFT;\ X 2770 compat/nedmalloc/malloc.c.h if (X == 0)\ X 2772 compat/nedmalloc/malloc.c.h else if (X > 0xFFFF)\ X 2775 compat/nedmalloc/malloc.c.h unsigned int K = _bit_scan_reverse (X); \ X 2783 compat/nedmalloc/malloc.c.h size_t X = S >> TREEBIN_SHIFT;\ X 2784 compat/nedmalloc/malloc.c.h if (X == 0)\ X 2786 compat/nedmalloc/malloc.c.h else if (X > 0xFFFF)\ X 2790 compat/nedmalloc/malloc.c.h _BitScanReverse((DWORD *) &K, X);\ X 2798 compat/nedmalloc/malloc.c.h size_t X = S >> TREEBIN_SHIFT;\ X 2799 compat/nedmalloc/malloc.c.h if (X == 0)\ X 2801 compat/nedmalloc/malloc.c.h else if (X > 0xFFFF)\ X 2804 compat/nedmalloc/malloc.c.h unsigned int Y = (unsigned int)X;\ X 2856 compat/nedmalloc/malloc.c.h #define compute_bit2idx(X, I)\ X 2859 compat/nedmalloc/malloc.c.h __asm__("bsfl\t%1, %0\n\t" : "=r" (J) : "rm" (X));\ X 2864 compat/nedmalloc/malloc.c.h #define compute_bit2idx(X, I)\ X 2867 compat/nedmalloc/malloc.c.h J = _bit_scan_forward (X); \ X 2872 compat/nedmalloc/malloc.c.h #define compute_bit2idx(X, I)\ X 2875 compat/nedmalloc/malloc.c.h _BitScanForward((DWORD *) &J, X);\ X 2880 compat/nedmalloc/malloc.c.h #define compute_bit2idx(X, I) I = ffs(X)-1 X 2883 compat/nedmalloc/malloc.c.h #define compute_bit2idx(X, I)\ X 2885 compat/nedmalloc/malloc.c.h unsigned int Y = X - 1;\ X 3549 compat/nedmalloc/malloc.c.h #define insert_large_chunk(M, X, S) {\ X 3554 compat/nedmalloc/malloc.c.h X->index = I;\ X 3555 compat/nedmalloc/malloc.c.h X->child[0] = X->child[1] = 0;\ X 3558 compat/nedmalloc/malloc.c.h *H = X;\ X 3559 compat/nedmalloc/malloc.c.h X->parent = (tchunkptr)H;\ X 3560 compat/nedmalloc/malloc.c.h X->fd = X->bk = X;\ X 3572 compat/nedmalloc/malloc.c.h *C = X;\ X 3573 compat/nedmalloc/malloc.c.h X->parent = T;\ X 3574 compat/nedmalloc/malloc.c.h X->fd = X->bk = X;\ X 3585 compat/nedmalloc/malloc.c.h T->fd = F->bk = X;\ X 3586 compat/nedmalloc/malloc.c.h X->fd = F;\ X 3587 compat/nedmalloc/malloc.c.h X->bk = T;\ X 3588 compat/nedmalloc/malloc.c.h X->parent = 0;\ X 3617 compat/nedmalloc/malloc.c.h #define unlink_large_chunk(M, X) {\ X 3618 compat/nedmalloc/malloc.c.h tchunkptr XP = X->parent;\ X 3620 compat/nedmalloc/malloc.c.h if (X->bk != X) {\ X 3621 compat/nedmalloc/malloc.c.h tchunkptr F = X->fd;\ X 3622 compat/nedmalloc/malloc.c.h R = X->bk;\ X 3633 compat/nedmalloc/malloc.c.h if (((R = *(RP = &(X->child[1]))) != 0) ||\ X 3634 compat/nedmalloc/malloc.c.h ((R = *(RP = &(X->child[0]))) != 0)) {\ X 3648 compat/nedmalloc/malloc.c.h tbinptr* H = treebin_at(M, X->index);\ X 3649 compat/nedmalloc/malloc.c.h if (X == *H) {\ X 3651 compat/nedmalloc/malloc.c.h clear_treemap(M, X->index);\ X 3654 compat/nedmalloc/malloc.c.h if (XP->child[0] == X) \ X 3665 compat/nedmalloc/malloc.c.h if ((C0 = X->child[0]) != 0) {\ X 3673 compat/nedmalloc/malloc.c.h if ((C1 = X->child[1]) != 0) {\ X 169 compat/winansi.c sbi.dwSize.X - sbi.dwCursorPosition.X, sbi.dwCursorPosition, X 21 ctype.c X, X, X, X, X, X, X, X, X, Z, Z, X, X, Z, X, X, /* 0.. 15 */ X 22 ctype.c X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, /* 16.. 31 */ X 28 ctype.c A, A, A, A, A, A, A, A, A, A, A, R, R, U, P, X, /* 112..127 */ X 8 mailmap.c #define debug_str(X) ((X) ? (X) : "(none)") X 12 test-sigchain.c X(two) X 13 test-sigchain.c X(three) X 14 test-sigchain.c #undef X