trunk/src/emu/netlist/devices/nld_signal.h
| r31057 | r31058 | |
| 39 | 39 | { |
| 40 | 40 | const char *sIN[8] = { "A", "B", "C", "D", "E", "F", "G", "H" }; |
| 41 | 41 | |
| 42 | | register_output("Q", m_Q); |
| 42 | register_output("Q", m_Q[0]); |
| 43 | 43 | for (int i=0; i < _numdev; i++) |
| 44 | 44 | { |
| 45 | 45 | register_input(sIN[i], m_i[i]); |
| r31057 | r31058 | |
| 49 | 49 | |
| 50 | 50 | ATTR_COLD void reset() |
| 51 | 51 | { |
| 52 | | m_Q.initial(1); |
| 52 | m_Q[0].initial(1); |
| 53 | 53 | m_active = 1; |
| 54 | 54 | } |
| 55 | 55 | |
| r31057 | r31058 | |
| 90 | 90 | for (int j = i + 1; j < _numdev; j++) |
| 91 | 91 | this->m_i[j].inactivate(); |
| 92 | 92 | |
| 93 | | OUTLOGIC(this->m_Q, _check ^ (1 ^ _invert), times[_check ^ (1 ^ _invert)]);// ? 15000 : 22000); |
| 93 | OUTLOGIC(this->m_Q[0], _check ^ (1 ^ _invert), times[_check ^ (1 ^ _invert)]);// ? 15000 : 22000); |
| 94 | 94 | return; |
| 95 | 95 | } |
| 96 | 96 | } |
| 97 | | OUTLOGIC(this->m_Q,_check ^ (_invert), times[_check ^ (_invert)]);// ? 22000 : 15000); |
| 97 | OUTLOGIC(this->m_Q[0],_check ^ (_invert), times[_check ^ (_invert)]);// ? 22000 : 15000); |
| 98 | 98 | } |
| 99 | 99 | |
| 100 | 100 | public: |
| 101 | 101 | netlist_ttl_input_t m_i[_numdev]; |
| 102 | | netlist_ttl_output_t m_Q; |
| 102 | netlist_ttl_output_t m_Q[1]; |
| 103 | 103 | INT32 m_active; |
| 104 | 104 | }; |
| 105 | 105 | |
| r31057 | r31058 | |
| 114 | 114 | |
| 115 | 115 | ATTR_COLD void start() |
| 116 | 116 | { |
| 117 | | register_output("Q", m_Q); |
| 117 | register_output("Q", m_Q[0]); |
| 118 | 118 | register_input("A", m_i[0]); |
| 119 | 119 | register_input("B", m_i[1]); |
| 120 | 120 | |
| r31057 | r31058 | |
| 123 | 123 | |
| 124 | 124 | ATTR_COLD void reset() |
| 125 | 125 | { |
| 126 | | m_Q.initial(1); |
| 126 | m_Q[0].initial(1); |
| 127 | 127 | m_active = 1; |
| 128 | 128 | } |
| 129 | 129 | |
| r31057 | r31058 | |
| 171 | 171 | res = _invert ^ _check; |
| 172 | 172 | break; |
| 173 | 173 | } |
| 174 | | OUTLOGIC(m_Q, res, times[res]);// ? 22000 : 15000); |
| 174 | OUTLOGIC(m_Q[0], res, times[res]);// ? 22000 : 15000); |
| 175 | 175 | } |
| 176 | 176 | |
| 177 | 177 | public: |
| 178 | 178 | netlist_ttl_input_t m_i[2]; |
| 179 | | netlist_ttl_output_t m_Q; |
| 179 | netlist_ttl_output_t m_Q[1]; |
| 180 | 180 | INT32 m_active; |
| 181 | 181 | |
| 182 | 182 | }; |
trunk/src/emu/netlist/devices/nld_truthtable.h
| r31057 | r31058 | |
| 10 | 10 | |
| 11 | 11 | #include "../nl_base.h" |
| 12 | 12 | |
| 13 | | template<int m_NI, int m_NO> |
| 13 | #define NETLIB_TRUTHTABLE(_name, _nIN, _nOUT, _state) \ |
| 14 | class NETLIB_NAME(_name) : public nld_truthtable_t<_nIN, _nOUT, _state> \ |
| 15 | { \ |
| 16 | public: \ |
| 17 | NETLIB_NAME(_name)() \ |
| 18 | : nld_truthtable_t<_nIN, _nOUT, _state>(&m_ttbl, m_desc) { } \ |
| 19 | private: \ |
| 20 | static truthtable_t m_ttbl; \ |
| 21 | static const char *m_desc[]; \ |
| 22 | } |
| 23 | |
| 24 | |
| 25 | template<int m_NI, int m_NO, int has_state> |
| 14 | 26 | class nld_truthtable_t : public netlist_device_t |
| 15 | 27 | { |
| 16 | 28 | public: |
| 17 | 29 | |
| 18 | | static const int m_size = (1 << (2 * m_NI + m_NO)); |
| 30 | static const int m_num_bits = m_NI + has_state * (m_NI + m_NO); |
| 31 | static const int m_size = (1 << (m_num_bits)); |
| 19 | 32 | |
| 20 | | nld_truthtable_t() |
| 21 | | : netlist_device_t(), m_active(1) |
| 33 | struct truthtable_t |
| 22 | 34 | { |
| 35 | truthtable_t() : m_initialized(false) {} |
| 36 | UINT32 m_outs[m_size]; |
| 37 | UINT8 m_timing[m_size][m_NO]; |
| 38 | netlist_time m_timing_nt[16]; |
| 39 | bool m_initialized; |
| 40 | }; |
| 41 | |
| 42 | nld_truthtable_t(truthtable_t *ttbl, const char *desc[]) |
| 43 | : netlist_device_t(), m_last_state(0), m_active(1), m_ttp(ttbl), m_desc(desc) |
| 44 | { |
| 23 | 45 | } |
| 24 | 46 | |
| 25 | 47 | ATTR_COLD virtual void start() |
| 26 | 48 | { |
| 49 | pstring ttline = pstring(m_desc[0]); |
| 50 | { |
| 51 | nl_util::pstring_list io = nl_util::split(ttline,"|"); |
| 52 | // checks |
| 53 | assert(io.count() == 2); |
| 54 | nl_util::pstring_list inout = nl_util::split(io[0], ","); |
| 55 | assert(inout.count() == m_num_bits); |
| 56 | nl_util::pstring_list out = nl_util::split(io[1], ","); |
| 57 | assert(out.count() == m_NO); |
| 58 | |
| 59 | for (int i=0; i < m_NI; i++) |
| 60 | { |
| 61 | register_input(inout[i], m_i[i]); |
| 62 | } |
| 63 | for (int i=0; i < m_NO; i++) |
| 64 | { |
| 65 | register_output(out[i], m_Q[i]); |
| 66 | } |
| 67 | } |
| 68 | setup_tt(); |
| 69 | // FIXME: save state |
| 27 | 70 | } |
| 28 | 71 | |
| 29 | | ATTR_COLD void help(UINT32 outs[], int cur, nl_util::pstring_list list, UINT64 state, UINT64 ignore, UINT16 val) |
| 72 | ATTR_COLD void help(int cur, nl_util::pstring_list list, |
| 73 | UINT64 state, UINT64 ignore, UINT16 val, UINT8 timing_index[m_NO]) |
| 30 | 74 | { |
| 31 | 75 | pstring elem = list[cur]; |
| 32 | 76 | int start = 0; |
| r31057 | r31058 | |
| 54 | 98 | const UINT64 nstate = state | (i << cur); |
| 55 | 99 | const UINT64 nignore = ignore | (ign << cur); |
| 56 | 100 | |
| 57 | | if (cur < list.count() - 1) |
| 101 | if (cur < m_num_bits - 1) |
| 58 | 102 | { |
| 59 | | help(outs, cur + 1, list, nstate, nignore, val); |
| 103 | help(cur + 1, list, nstate, nignore, val, timing_index); |
| 60 | 104 | } |
| 61 | 105 | else |
| 62 | 106 | { |
| 63 | 107 | // cutoff previous inputs and outputs for ignore |
| 64 | | outs[nstate] = val | ((nignore & ((1 << m_NI)-1)) << m_NO); |
| 108 | m_ttp->m_outs[nstate] = val | ((nignore & ((1 << m_NI)-1)) << m_NO); |
| 109 | for (int j=0; j<m_NO; j++) |
| 110 | m_ttp->m_timing[nstate][j] = timing_index[j]; |
| 65 | 111 | } |
| 66 | 112 | } |
| 67 | 113 | } |
| 68 | 114 | |
| 69 | | ATTR_COLD void setup_tt(const char **truthtable, UINT32 outs[]) |
| 115 | ATTR_COLD void setup_tt() |
| 70 | 116 | { |
| 117 | if (m_ttp->m_initialized) |
| 118 | return; |
| 119 | |
| 120 | const char **truthtable = m_desc; |
| 71 | 121 | pstring ttline = pstring(truthtable[0]); |
| 72 | 122 | truthtable++; |
| 73 | | { |
| 74 | | nl_util::pstring_list io = nl_util::split(ttline,"|"); |
| 75 | | // checks |
| 76 | | assert(io.count() == 2); |
| 77 | | nl_util::pstring_list inout = nl_util::split(io[0], ","); |
| 78 | | assert(inout.count() == 2 * m_NI + m_NO); |
| 79 | | nl_util::pstring_list out = nl_util::split(io[1], ","); |
| 80 | | assert(out.count() == m_NO); |
| 123 | ttline = pstring(truthtable[0]); |
| 124 | truthtable++; |
| 81 | 125 | |
| 82 | | for (int i=0; i < m_NI; i++) |
| 83 | | { |
| 84 | | register_input(inout[i], m_i[i]); |
| 85 | | } |
| 86 | | for (int i=0; i < m_NO; i++) |
| 87 | | { |
| 88 | | register_output(out[i], m_Q[i]); |
| 89 | | } |
| 90 | | //save(NAME(m_active)); |
| 91 | | ttline = pstring(truthtable[0]); |
| 92 | | truthtable++; |
| 93 | | } |
| 94 | | |
| 95 | 126 | for (int j=0; j < m_size; j++) |
| 96 | | outs[j] = -1; |
| 127 | m_ttp->m_outs[j] = -1; |
| 97 | 128 | |
| 129 | for (int j=0; j < 16; j++) |
| 130 | m_ttp->m_timing_nt[j] = netlist_time::zero; |
| 131 | |
| 98 | 132 | while (!ttline.equals("")) |
| 99 | 133 | { |
| 100 | 134 | nl_util::pstring_list io = nl_util::split(ttline,"|"); |
| 101 | 135 | // checks |
| 102 | | assert(io.count() == 2); |
| 136 | assert(io.count() == 3); |
| 103 | 137 | nl_util::pstring_list inout = nl_util::split(io[0], ","); |
| 104 | | assert(inout.count() == 2 * m_NI + m_NO); |
| 138 | assert(inout.count() == m_num_bits); |
| 105 | 139 | nl_util::pstring_list out = nl_util::split(io[1], ","); |
| 106 | 140 | assert(out.count() == m_NO); |
| 141 | nl_util::pstring_list times = nl_util::split(io[2], ","); |
| 142 | assert(times.count() == m_NO); |
| 107 | 143 | |
| 108 | 144 | UINT16 val = 0; |
| 145 | UINT8 tindex[m_NO]; |
| 109 | 146 | for (int j=0; j<m_NO; j++) |
| 147 | { |
| 110 | 148 | if (out[j].equals("1")) |
| 111 | 149 | val = val | (1 << j); |
| 150 | netlist_time t = netlist_time::from_nsec(times[j].as_long()); |
| 151 | int k=0; |
| 152 | while (m_ttp->m_timing_nt[k] != netlist_time::zero && m_ttp->m_timing_nt[k] != t) |
| 153 | k++; |
| 154 | m_ttp->m_timing_nt[k] = t; |
| 155 | tindex[j] = k; |
| 156 | } |
| 112 | 157 | |
| 113 | | help(outs, 0, inout, 0 , 0 , val); |
| 158 | help(0, inout, 0 , 0 , val, tindex); |
| 114 | 159 | ttline = pstring(truthtable[0]); |
| 115 | 160 | truthtable++; |
| 116 | 161 | } |
| 117 | 162 | for (int j=0; j < m_size; j++) |
| 118 | | printf("%05x %04x %04x\n", j, outs[j] & ((1 << m_NO)-1), outs[j] >> m_NO); |
| 119 | | m_ttp = outs; |
| 163 | printf("%05x %04x %04x %04x\n", j, m_ttp->m_outs[j] & ((1 << m_NO)-1), |
| 164 | m_ttp->m_outs[j] >> m_NO, m_ttp->m_timing[j][0]); |
| 165 | for (int k=0; m_ttp->m_timing_nt[k] != netlist_time::zero; k++) |
| 166 | printf("%d %f\n", k, m_ttp->m_timing_nt[k].as_double() * 1000000.0); |
| 167 | |
| 168 | m_ttp->m_initialized = true; |
| 169 | |
| 120 | 170 | } |
| 121 | 171 | |
| 122 | 172 | ATTR_COLD void reset() |
| r31057 | r31058 | |
| 128 | 178 | |
| 129 | 179 | ATTR_HOT ATTR_ALIGN void update() |
| 130 | 180 | { |
| 131 | | const netlist_time times[2] = { NLTIME_FROM_NS(15), NLTIME_FROM_NS(22)}; |
| 181 | //const netlist_time times[2] = { NLTIME_FROM_NS(15), NLTIME_FROM_NS(22)}; |
| 132 | 182 | |
| 133 | 183 | // FIXME: this check is needed because update is called during startup as well |
| 134 | 184 | if (UNEXPECTED(USE_DEACTIVE_DEVICE && m_active == 0)) |
| r31057 | r31058 | |
| 141 | 191 | state = state | (INPLOGIC(m_i[i]) << i); |
| 142 | 192 | } |
| 143 | 193 | |
| 144 | | const UINT32 nstate = state | (m_last_state << m_NI); |
| 145 | | const UINT32 out = m_ttp[nstate] & ((1 << m_NO) - 1); |
| 146 | | const UINT32 ign = m_ttp[nstate] >> m_NO; |
| 194 | const UINT32 nstate = (has_state ? state | (m_last_state << m_NI) : state); |
| 195 | const UINT32 out = m_ttp->m_outs[nstate] & ((1 << m_NO) - 1); |
| 196 | const UINT32 ign = m_ttp->m_outs[nstate] >> m_NO; |
| 197 | if (has_state) m_last_state = (state << m_NO) | out; |
| 147 | 198 | |
| 148 | 199 | for (int i=0; i< m_NI; i++) |
| 149 | 200 | if (ign & (1 << i)) |
| 150 | 201 | m_i[i].inactivate(); |
| 151 | 202 | |
| 152 | 203 | for (int i=0; i<m_NO; i++) |
| 153 | | OUTLOGIC(m_Q[i], (out >> i) & 1, times[(out >> i) & 1]);// ? 22000 : 15000); |
| 154 | | m_last_state = (state << m_NO) | out; |
| 204 | // OUTLOGIC(m_Q[i], (out >> i) & 1, times[(out >> i) & 1]);// ? 22000 : 15000); |
| 205 | OUTLOGIC(m_Q[i], (out >> i) & 1, m_ttp->m_timing_nt[m_ttp->m_timing[nstate][i]]);// ? 22000 : 15000); |
| 155 | 206 | |
| 156 | 207 | } |
| 157 | 208 | |
| r31057 | r31058 | |
| 175 | 226 | } |
| 176 | 227 | #endif |
| 177 | 228 | |
| 178 | | public: |
| 179 | 229 | netlist_ttl_input_t m_i[m_NI]; |
| 180 | 230 | netlist_ttl_output_t m_Q[m_NO]; |
| 181 | 231 | |
| 182 | | UINT32 *m_ttp; |
| 232 | private: |
| 233 | |
| 234 | UINT32 m_last_state; |
| 183 | 235 | INT32 m_active; |
| 184 | | UINT32 m_last_state; |
| 236 | |
| 237 | truthtable_t *m_ttp; |
| 238 | const char **m_desc; |
| 185 | 239 | }; |
| 186 | 240 | |
| 187 | 241 | #endif /* NLD_TRUTHTABLE_H_ */ |