Files
bholman cb40fed3b9 Introduce Coco 3 Plus for MiSTer
Add original-firmware Sound & Speech, four configurable Multi-Pak sockets,
bounded per-slot ROM allocation and a nine-page menu organized around devices
and media. Repair inherited clock/reset/CPU-memory/video paths and add explicit
conditional external-I/O timing contracts. Preserve native Main startup-file
ordering, saved layouts, stock-core separation and the coco3plus media profile.

Provide native Windows tool downloads, pinned ToolShed ROM assembly, fresh
Quartus builds, functional and fitted timing checks, reviewed release packaging
and passwordless SSH installation with backups. Retain original component
notices, document contribution copyright and keep SSC ROM inputs outside Git.

Validation: Quartus17.0.2 Build602 seed5, zero errors; 15 functional jobs,
368 both-corner timing scopes and eight tooling-integrity checks pass.
The renamed build reaches Disk BASIC, PRINT1+1 returns2 and SSC loads ready.
Physical cold power cycling and conditional board-delay assumptions remain
separate. Full original upstream histories are preserved before this single
consolidated implementation commit.
2026-11-18 16:00:45 -07:00

273 lines
7.2 KiB
Verilog

// Original Coco 3 Plus contributions: Copyright (c) 2026 Brian K. Holman.
// Original component notices/terms retained; see COPYRIGHT.md and LICENSING.md.
////////////////////////////////////////////////////////////////////////////////
// Project Name: CoCo3FPGA Version 4.0
// File Name: 6551rx.v
//
// CoCo3 in an FPGA
//
// Revision: 4.0 07/10/16
////////////////////////////////////////////////////////////////////////////////
//
// CPU section copyrighted by John Kent
// The FDC co-processor copyrighted Daniel Wallner.
// SDRAM Controller copyrighted by XESS Corp.
//
////////////////////////////////////////////////////////////////////////////////
//
// Color Computer 3 compatible system on a chip
//
// Version : 4.0
//
// Copyright (c) 2008 Gary Becker ([email protected])
//
// All rights reserved
//
// Redistribution and use in source and synthezised forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
//
// Redistributions in synthesized form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// Neither the name of the author nor the names of other contributors may
// be used to endorse or promote products derived from this software without
// specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// Please report bugs to the author, but before you do so, please
// make sure that this is not a derivative work and that
// you have the latest version of this file.
//
// The latest version of this file can be found at:
// http://groups.yahoo.com/group/CoCo3FPGA
//
// File history :
//
// 1.0 Full Release
// 2.0 Partial Release
// 3.0 Full Release
// 3.0.0.1 Update to fix DoD interrupt issue
// 3.0.1.0 Update to fix 32/40 CoCO3 Text issue and add 2 Meg max memory
// 4.0.X.X Full Release
////////////////////////////////////////////////////////////////////////////////
// Gary Becker
// [email protected]
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////
// MISTer Conversion by Stan Hodge and Alan Steremberg (& Gary Becker)
// [email protected]
//
// 1/11/22 Changed to be super synchronus
////////////////////////////////////////////////////////////////////////////////
module uart51_rx(
RESET_N,
CLK,
BAUD_CLK,
//E,
//REG_READ,
RX_DATA,
RX_BUFFER,
// RX_READY,
RX_WORD,
RX_PAR_DIS,
RX_PARITY,
PARITY_ERR,
// OVERRUN,
FRAME,
READY
);
input RESET_N;
input CLK;
input BAUD_CLK;
//input E;
//input REG_READ;
input RX_DATA;
output [7:0] RX_BUFFER;
reg [7:0] RX_BUFFER;
// input RX_READY;
// reg RX_READY;
input [1:0] RX_WORD;
input RX_PAR_DIS;
input [1:0] RX_PARITY;
output PARITY_ERR;
reg PARITY_ERR;
// output OVERRUN;
// reg OVERRUN;
output FRAME;
reg FRAME;
output READY;
reg READY;
reg [5:0] STATE;
reg [2:0] BIT;
// reg [1:0] READ_STATE;
reg RX_DATA0;
reg RX_DATA1;
// Even though we are checking the state machine using the E clock
// The clock can be up to 1/3 the speed of the bit clock
// Only the first three bits are checks and the state machine
// has three states that will compare
//always @ (negedge E or negedge RESET_N)
//begin
// if(~RESET_N)
// begin
// RX_READY <= 1'b0;
// READ_STATE <= 2'b00;
// end
// else
// case (READ_STATE)
// 2'b00:
// begin
// if(STATE[5:2] == 4'b1110) //Stop bit
// begin
// RX_READY <= 1'b1;
// READ_STATE <= 2'b01;
// end
// end
// 2'b01:
// begin
// if(REG_READ)
// begin
// RX_READY <= 1'b0;
// READ_STATE <= 2'b10;
// end
// end
// 2'b10:
// begin
// if(STATE[5:3] != 3'b111)
// READ_STATE <= 2'b00;
// end
// endcase
//end
always @ (posedge CLK or negedge RESET_N)
begin
if(!RESET_N)
begin
RX_BUFFER <= 8'h00;
STATE <= 6'b000000;
// OVERRUN <= 1'b0;
FRAME <= 1'b0;
BIT <= 3'b000;
RX_DATA0 <= 1'b1;
RX_DATA1 <= 1'b1;
READY <= 1'b0;
PARITY_ERR <= 1'b0;
end
else
begin
if (BAUD_CLK)
begin
RX_DATA0 <= RX_DATA;
RX_DATA1 <= RX_DATA0;
case (STATE)
6'b000000: // States 0-15 will be start bit
begin
BIT <= 3'b000;
if(~RX_DATA1)
STATE <= 6'b000001;
end
6'b001111: // End of start bit, flag data not ready
begin // If data is not retrieved before this, then overrun
READY <= 1'b0;
STATE <= 6'b010000;
end
6'b010111: // Each data bit is states 16-31, the middle is 23
begin
RX_BUFFER[BIT] <= RX_DATA1;
// OVERRUN <= RX_READY;
STATE <= 6'b011000;
end
6'b011111: // End of the data bits
begin
if(BIT == 3'b111)
begin
STATE <= 6'b100000;
end
else
begin
if((RX_WORD == 2'b01) && (BIT == 3'b110))
begin
STATE <= 6'b100000;
end
else
begin
if((RX_WORD == 2'b10) && (BIT == 3'b101))
begin
STATE <= 6'b100000;
end
else
begin
if((RX_WORD == 2'b11) && (BIT == 3'b100))
begin
STATE <= 6'b100000;
end
else
begin
BIT <= BIT + 1'b1;
STATE <= 6'b010000;
end
end
end
end
end
6'b100000: // First tick of Stop or Parity, Parity is 32 - 47
begin
if(RX_PAR_DIS)
STATE <= 6'b110001; // get stop
else
STATE <= 6'b100001; // get parity
end
6'b100111: // Middle of Parity is 39
begin
PARITY_ERR <= ~RX_PARITY[1] & // Get but do not check Parity if 1 is set
(((RX_BUFFER[0] ^ RX_BUFFER[1])
^ (RX_BUFFER[2] ^ RX_BUFFER[3]))
^((RX_BUFFER[4] ^ RX_BUFFER[5])
^ (RX_BUFFER[6] ^ RX_BUFFER[7])) // clear bit #8 if only 7 bits
^ (~RX_PARITY[0] ^ RX_DATA1));
STATE <= 6'b101000;
// 1 bit early for timing reasons
end
6'b110111: // first stop bit is 32 or 48 then 49 - 63
begin
// OVERRUN <= 1'b0;
FRAME <= !RX_DATA1; // if data != 1 then not stop bit
READY <= 1'b1;
STATE <= 6'b111000;
end
// In case of a framing error, wait until data is 1 then start over
// We skipped this check for 6 clock cycles so CPU speed is not a factor
// in the RX_READY state machine above
6'b111000:
begin
if(RX_DATA1)
STATE <= 6'b000000;
end
default:
STATE <= STATE + 1'b1;
endcase
end
end
end
endmodule