diff for duplicates of <20180319232342.GX30522@ZenIV.linux.org.uk> diff --git a/a/content_digest b/N1/content_digest index 54093f7..32c4adc 100644 --- a/a/content_digest +++ b/N1/content_digest @@ -27,7 +27,8 @@ David S . Miller <davem@davemloft.net> sparclinux@vger.kernel.org Ingo Molnar <mingo@redhat.com> - " Jiri Slaby <jslaby@suse.com>\0" + Jiri Slaby <jslaby@suse.com> + " the arch/x86 maintainers <x86@kernel.org>\0" "\00:1\0" "b\0" "On Mon, Mar 19, 2018 at 10:29:20AM +0100, Ingo Molnar wrote:\n" @@ -283,4 +284,4 @@ "See above. It *can* be done. Not by cpp alone, of course - you need compiler\n" involvement. -d2bafacfb3dd50352a19f69dc8d32a4e2d239fa954494d4e71dc04467083e4a7 +9c4fc5e495df8b8775cd6a9d45abf2b9744948ffe7a4e6d7b8738cae18b6aafa
diff --git a/a/1.txt b/N2/1.txt index 2303903..a021d81 100644 --- a/a/1.txt +++ b/N2/1.txt @@ -106,8 +106,7 @@ almost certainly not fit for inclusion. Consider that as a theoretical exercise, please. Again, don't read further if you are easily squicked. You've been warned. -=============================================================================== -Look: +=======================================Look: * we can generate enum {S0 = __TYPE_IS_LL(int), S1 = __TYPE_IS_LL(loff_t), @@ -119,7 +118,7 @@ our case). enum {OFF0 = 0, OFF1 = STEP(OFF0 + S0, S1), OFF2 = STEP(OFF1 + S1, S2)}; at the same time, with STEP(base, big) defined as base + 1 for something like x86, (big ? ((base) | 1) + 1 : (base) + 1) for arm and friends, -base + 1 + (big && base == 3) for s390. Again, compile-time calculations. +base + 1 + (big && base = 3) for s390. Again, compile-time calculations. For x86 - (0, 1, 3), for arm - (0, 2, 4), etc. * we can generate C_S_moron((__force int)(S0 ? PAIR(OFF0) : ARG(OFF0)), @@ -127,8 +126,8 @@ For x86 - (0, 1, 3), for arm - (0, 2, 4), etc. (__force size_t)(S2 ? PAIR(OFF2) : ARG(OFF2))); in the body of wrapper. With PAIR(n) defined as either ((u64)ARG(n) << 32) | ARG(n+1) or ((u64)ARG(n+1) << 32) | ARG(n) (depending upon endianness) and ARG(n) -defined as (n == 0 ? a0 : n == 1 ? a1 : n == 2 ? a2 : n == 3 ? a3 : - n == 4 ? a4 : n == 5 ? a5 : a6) +defined as (n = 0 ? a0 : n = 1 ? a1 : n = 2 ? a2 : n = 3 ? a3 : + n = 4 ? a4 : n = 5 ? a5 : a6) Note that each of those suckers expands to a cascade of conditional expressions with all conditions being integer constant expressions, no more than one of those being true. In our case that crap will fold into diff --git a/a/content_digest b/N2/content_digest index 54093f7..aee8dfd 100644 --- a/a/content_digest +++ b/N2/content_digest @@ -138,8 +138,7 @@ "exercise, please.\n" "\n" "Again, don't read further if you are easily squicked. You've been warned.\n" - "===============================================================================\n" - "Look:\n" + "=======================================Look:\n" "* we can generate\n" "\tenum {S0 = __TYPE_IS_LL(int),\n" "\t S1 = __TYPE_IS_LL(loff_t),\n" @@ -151,7 +150,7 @@ "\tenum {OFF0 = 0, OFF1 = STEP(OFF0 + S0, S1), OFF2 = STEP(OFF1 + S1, S2)};\n" "at the same time, with STEP(base, big) defined as base + 1 for something like\n" "x86, (big ? ((base) | 1) + 1 : (base) + 1) for arm and friends,\n" - "base + 1 + (big && base == 3) for s390. Again, compile-time calculations.\n" + "base + 1 + (big && base = 3) for s390. Again, compile-time calculations.\n" "For x86 - (0, 1, 3), for arm - (0, 2, 4), etc.\n" "* we can generate\n" "\tC_S_moron((__force int)(S0 ? PAIR(OFF0) : ARG(OFF0)),\n" @@ -159,8 +158,8 @@ "\t\t (__force size_t)(S2 ? PAIR(OFF2) : ARG(OFF2)));\n" "in the body of wrapper. With PAIR(n) defined as either ((u64)ARG(n) << 32) | ARG(n+1)\n" "or ((u64)ARG(n+1) << 32) | ARG(n) (depending upon endianness) and ARG(n)\n" - "defined as (n == 0 ? a0 : n == 1 ? a1 : n == 2 ? a2 : n == 3 ? a3 :\n" - "\t n == 4 ? a4 : n == 5 ? a5 : a6)\n" + "defined as (n = 0 ? a0 : n = 1 ? a1 : n = 2 ? a2 : n = 3 ? a3 :\n" + "\t n = 4 ? a4 : n = 5 ? a5 : a6)\n" "Note that each of those suckers expands to a cascade of conditional\n" "expressions with all conditions being integer constant expressions,\n" "no more than one of those being true. In our case that crap will fold into\n" @@ -283,4 +282,4 @@ "See above. It *can* be done. Not by cpp alone, of course - you need compiler\n" involvement. -d2bafacfb3dd50352a19f69dc8d32a4e2d239fa954494d4e71dc04467083e4a7 +72407129c21901a051ab8d0307f331cd11471d375f6f9a1903d72d09cbabc981
This is an external index of several public inboxes, see mirroring instructions on how to clone and mirror all data and code used by this external index.