summaryrefslogtreecommitdiffstatshomepage
path: root/src/mame/drivers/atarigx2.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/mame/drivers/atarigx2.c')
-rw-r--r--src/mame/drivers/atarigx2.c58
1 files changed, 29 insertions, 29 deletions
diff --git a/src/mame/drivers/atarigx2.c b/src/mame/drivers/atarigx2.c
index b98d83a91d9..de9aa82ab14 100644
--- a/src/mame/drivers/atarigx2.c
+++ b/src/mame/drivers/atarigx2.c
@@ -168,41 +168,41 @@ this should be generalized to cover other regions of the table, and the scarcity
in those regions precludes applying the same kind of analysis.
int parameters3[16][2] = {
- {0x003a, 0x0032},
- {0x0076, 0x0064},
- {0x00ee, 0x00c8},
- {0x01dc, 0x0190},
- {0x01b0, 0x012A},
- {0x0168, 0x005C},
- {0x00d8, 0x00b8},
- {0x01b0, 0x0172},
- {0x016a, 0x00ee},
- {0x00de, 0x01de},
- {0x01be, 0x01b6},
- {0x0174, 0x0164},
- {0x00e2, 0x00c0},
- {0x01c6, 0x0180},
- {0x0186, 0x010a},
- {0x0104, 0x001c}
+ {0x003a, 0x0032},
+ {0x0076, 0x0064},
+ {0x00ee, 0x00c8},
+ {0x01dc, 0x0190},
+ {0x01b0, 0x012A},
+ {0x0168, 0x005C},
+ {0x00d8, 0x00b8},
+ {0x01b0, 0x0172},
+ {0x016a, 0x00ee},
+ {0x00de, 0x01de},
+ {0x01be, 0x01b6},
+ {0x0174, 0x0164},
+ {0x00e2, 0x00c0},
+ {0x01c6, 0x0180},
+ {0x0186, 0x010a},
+ {0x0104, 0x001c}
};
// every output bit is a linear function on the input bits except by
// a quadratic term always involving bit #0 of the input
UINT32 ftest4(UINT32 num)
{
- UINT32 accum = 0;
-
- for (int i=0; i<16; ++i)
- {
- int b1 = weight(num&parameters3[i][0])&1; // <- linear function (parameters3[i][0] acts as a mask determining which bits are added)
- int b2 = weight(num&parameters3[i][1])&1; // <- idem
- b2 &= BIT(num, 0); // quadratic term
- int b3 = b1 ^ b2;
-
- accum ^= (b3 << i);
- }
-
- return accum;
+ UINT32 accum = 0;
+
+ for (int i=0; i<16; ++i)
+ {
+ int b1 = weight(num&parameters3[i][0])&1; // <- linear function (parameters3[i][0] acts as a mask determining which bits are added)
+ int b2 = weight(num&parameters3[i][1])&1; // <- idem
+ b2 &= BIT(num, 0); // quadratic term
+ int b3 = b1 ^ b2;
+
+ accum ^= (b3 << i);
+ }
+
+ return accum;
}
*********************/