mirror of
https://github.com/mist64/perfect6502.git
synced 2024-12-28 11:31:50 +00:00
clean up
This commit is contained in:
parent
78cec2a778
commit
ef30dcb753
@ -63,7 +63,6 @@ int transistors_on[TRANSISTORS/sizeof(int)+1];
|
|||||||
void
|
void
|
||||||
set_transistors_on(transnum_t t, BOOL state)
|
set_transistors_on(transnum_t t, BOOL state)
|
||||||
{
|
{
|
||||||
// /*DEBUG*/if (t>>5 > sizeof(transistors_on)) printf
|
|
||||||
if (state)
|
if (state)
|
||||||
transistors_on[t>>5] |= 1 << (t & 31);
|
transistors_on[t>>5] |= 1 << (t & 31);
|
||||||
else
|
else
|
||||||
@ -88,7 +87,6 @@ setupNodesAndTransistors()
|
|||||||
{
|
{
|
||||||
count_t i;
|
count_t i;
|
||||||
for (i = 0; i < sizeof(segdefs)/sizeof(*segdefs); i++) {
|
for (i = 0; i < sizeof(segdefs)/sizeof(*segdefs); i++) {
|
||||||
//printf("%d %d\n", __LINE__, i);
|
|
||||||
nodes_pullup[i] = segdefs[i];
|
nodes_pullup[i] = segdefs[i];
|
||||||
nodes_state[i] = STATE_FL;
|
nodes_state[i] = STATE_FL;
|
||||||
nodes_gatecount[i] = 0;
|
nodes_gatecount[i] = 0;
|
||||||
@ -218,7 +216,6 @@ getNodeValue()
|
|||||||
count_t i;
|
count_t i;
|
||||||
for (i = 0; i < groupcount; i++) {
|
for (i = 0; i < groupcount; i++) {
|
||||||
nodenum_t nn = group[i];
|
nodenum_t nn = group[i];
|
||||||
//printf("%d %d\n", __LINE__, nn);
|
|
||||||
if (nodes_pullup[nn])
|
if (nodes_pullup[nn])
|
||||||
return STATE_PU;
|
return STATE_PU;
|
||||||
if (nodes_pulldown[nn])
|
if (nodes_pulldown[nn])
|
||||||
@ -375,7 +372,6 @@ setLow(nodenum_t nn)
|
|||||||
#ifdef DEBUG
|
#ifdef DEBUG
|
||||||
printf("%s nn=%d\n", __func__, nn);
|
printf("%s nn=%d\n", __func__, nn);
|
||||||
#endif
|
#endif
|
||||||
//printf("%d %d\n", __LINE__, nn);
|
|
||||||
nodes_pullup[nn] = NO;
|
nodes_pullup[nn] = NO;
|
||||||
nodes_pulldown[nn] = YES;
|
nodes_pulldown[nn] = YES;
|
||||||
nodenum_t list[NODES];
|
nodenum_t list[NODES];
|
||||||
@ -389,7 +385,6 @@ setHigh(nodenum_t nn)
|
|||||||
#ifdef DEBUG
|
#ifdef DEBUG
|
||||||
printf("%s nn=%d\n", __func__, nn);
|
printf("%s nn=%d\n", __func__, nn);
|
||||||
#endif
|
#endif
|
||||||
//printf("%d %d\n", __LINE__, nn);
|
|
||||||
nodes_pullup[nn] = YES;
|
nodes_pullup[nn] = YES;
|
||||||
nodes_pulldown[nn] = NO;
|
nodes_pulldown[nn] = NO;
|
||||||
nodenum_t list[NODES];
|
nodenum_t list[NODES];
|
||||||
@ -426,11 +421,9 @@ writeDataBus(uint8_t x)
|
|||||||
}
|
}
|
||||||
if ((x & 1) == 0) {
|
if ((x & 1) == 0) {
|
||||||
nodes_pulldown[nn] = YES;
|
nodes_pulldown[nn] = YES;
|
||||||
//printf("%d %d\n", __LINE__, nn);
|
|
||||||
nodes_pullup[nn] = NO;
|
nodes_pullup[nn] = NO;
|
||||||
} else {
|
} else {
|
||||||
nodes_pulldown[nn] = NO;
|
nodes_pulldown[nn] = NO;
|
||||||
//printf("%d %d\n", __LINE__, nn);
|
|
||||||
nodes_pullup[nn] = YES;
|
nodes_pullup[nn] = YES;
|
||||||
}
|
}
|
||||||
recalcs[recalcscount++] = nn;
|
recalcs[recalcscount++] = nn;
|
||||||
|
Loading…
Reference in New Issue
Block a user