diff --git a/.github/workflows/template-cleanup.yml b/.github/workflows/template-cleanup.yml
new file mode 100644
index 0000000..8c394eb
--- /dev/null
+++ b/.github/workflows/template-cleanup.yml
@@ -0,0 +1,62 @@
+# Workflow to cleanup projects created from this template
+# Adapted from workflow of the same name in https://github.com/JetBrains/intellij-platform-plugin-template
+# SPDX-License-Identifier: Apache-2.0
+
+name: Template Cleanup
+on:
+ push:
+ branches: [main]
+
+jobs:
+ # Triggered on first push to repos created from the template
+ template-cleanup:
+ name: Template Cleanup
+ permissions:
+ contents: write
+ runs-on: ubuntu-latest
+ if: github.event.repository.name != 'chisel-template'
+ steps:
+
+ - name: Checkout
+ uses: actions/checkout@v4
+ with:
+ # These are needed to make ad-m/github-push-action work
+ # https://github.com/ad-m/github-push-action/tree/d91a481090679876dfc4178fef17f286781251df#example-workflow-file
+ persist-credentials: false
+ fetch-depth: 0
+
+ - name: Cleanup
+ run: |
+ export LC_CTYPE=C
+ export LANG=C
+
+ # Prepare variables
+ NAME="${GITHUB_REPOSITORY##*/}"
+ ORG="$GITHUB_REPOSITORY_OWNER"
+ SAFE_ORG=$(echo $ORG | sed 's/[^a-zA-Z0-9]//g' | tr '[:upper:]' '[:lower:]')
+ GROUP="com.github.$SAFE_ORG"
+
+ # Replace placeholders
+ sed -i "s/%NAME%/$NAME/g" build.sbt build.sc README.md src/test/scala/gcd/*
+ sed -i "s/%REPOSITORY%/${GITHUB_REPOSITORY/\//\\/}/g" README.md
+ sed -i "s/%ORGANIZATION%/$GROUP/g" build.sbt
+
+ # Remove lines marked with #REMOVE-ON-CLEANUP#
+ sed -i '/#REMOVE-ON-CLEANUP#/d' README.md
+
+ rm -rf \
+ .github/workflows/template-cleanup.yml \
+ LICENSE
+
+ - name: Commit
+ run: |
+ git config --local user.email "action@github.com"
+ git config --local user.name "GitHub Action"
+ git add .
+ git commit -m "Template cleanup"
+
+ - name: Push changes
+ uses: ad-m/github-push-action@v0.8.0
+ with:
+ branch: main
+ github_token: ${{ secrets.GITHUB_TOKEN }}
diff --git a/.github/workflows/test.yml b/.github/workflows/test.yml
new file mode 100644
index 0000000..cbd456f
--- /dev/null
+++ b/.github/workflows/test.yml
@@ -0,0 +1,59 @@
+name: Continuous Integration
+
+on:
+ push:
+ tags: ['*']
+ branches: ['main']
+ pull_request:
+ workflow_dispatch:
+
+env:
+ verilator-version: v5.012
+ verilator-install-dir: verilator-install
+
+jobs:
+ ci:
+ name: ci
+ runs-on: ubuntu-latest
+ steps:
+ - name: Checkout
+ uses: actions/checkout@v4
+ - name: Cleanup
+ run: sed -i "s/%NAME%/test/g" build.sc
+ - name: Cache Scala
+ uses: coursier/cache-action@v6
+ - name: Setup Scala
+ uses: coursier/setup-action@v1
+ with:
+ jvm: adopt:11
+ apps: sbt mill
+ - name: Setup Dependencies
+ run: |
+ sudo apt-get install ccache
+ - name: Get Cached Verilator
+ id: get-cached-verilator
+ uses: actions/cache@v4
+ with:
+ path: ${{ env.verilator-install-dir }}
+ key: verilator-${{ env.verilator-version }}
+ - name: Install Verilator
+ if: steps.get-cached-verilator.outputs.cache-hit != 'true'
+ run: |
+ sudo apt-get install git help2man perl python3 make autoconf g++ flex bison numactl perl-doc libfl-dev
+ git clone https://github.com/verilator/verilator
+ unset VERILATOR_ROOT
+ cd verilator
+ git checkout ${{ env.verilator-version }}
+ autoconf
+ ./configure --prefix=$(pwd)/../${{ env.verilator-install-dir }}
+ make
+ make install
+ - name: Set PATH
+ run: |
+ echo "$(pwd)/${{ env.verilator-install-dir }}/bin" >> $GITHUB_PATH
+ echo VERILATOR_ROOT="$(pwd)/${{ env.verilator-install-dir }}/share/verilator" >> $GITHUB_ENV
+ ln -sf $(pwd)/${{ env.verilator-install-dir }}/bin/verilator_bin $(pwd)/${{ env.verilator-install-dir }}/share/verilator/verilator_bin
+ - name: SBT Test
+ run: sbt test
+ - name: mill Test
+ run: mill _.test
diff --git a/.gitignore b/.gitignore
index 6f33875..12033d3 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,7 +1,6 @@
-# Created by https://www.toptal.com/developers/gitignore/api/xilinxise
-# Edit at https://www.toptal.com/developers/gitignore?templates=xilinxise
-
-### XilinxISE ###
+### Project Specific stuff
+test_run_dir/*
+### XilinxISE template
# intermediate build files
*.bgn
*.bit
@@ -46,16 +45,6 @@
*_usage.xml
*_xst.xrpt
-# iMPACT generated files
-_impactbatch.log
-impact.xsl
-impact_impact.xwbt
-ise_impact.cmd
-webtalk_impact.xml
-
-# Core Generator generated files
-xaw2verilog.log
-
# project-wide generated files
*.gise
par_usage_statistics.html
@@ -65,10 +54,288 @@ webtalk_pn.xml
# generated folders
iseconfig/
-isim/
xlnx_auto_0_xdb/
xst/
_ngo/
_xmsgs/
+### Eclipse template
+*.pydevproject
+.metadata
+.gradle
+bin/
+tmp/
+*.tmp
+*.bak
+*.swp
+*~.nib
+local.properties
+.settings/
+.loadpath
+
+# Eclipse Core
+.project
+
+# External tool builders
+.externalToolBuilders/
+
+# Locally stored "Eclipse launch configurations"
+*.launch
+
+# CDT-specific
+.cproject
+
+# JDT-specific (Eclipse Java Development Tools)
+.classpath
+
+# Java annotation processor (APT)
+.factorypath
+
+# PDT-specific
+.buildpath
+
+# sbteclipse plugin
+.target
+
+# TeXlipse plugin
+.texlipse
+### C template
+# Object files
+*.o
+*.ko
+*.obj
+*.elf
+
+# Precompiled Headers
+*.gch
+*.pch
+
+# Libraries
+*.lib
+*.a
+*.la
+*.lo
+
+# Shared objects (inc. Windows DLLs)
+*.dll
+*.so
+*.so.*
+*.dylib
+
+# Executables
+*.exe
+*.out
+*.app
+*.i*86
+*.x86_64
+*.hex
+
+# Debug files
+*.dSYM/
+### SBT template
+# Simple Build Tool
+# http://www.scala-sbt.org/release/docs/Getting-Started/Directories.html#configuring-version-control
+
+target/
+lib_managed/
+src_managed/
+project/boot/
+.history
+.cache
+### Emacs template
+# -*- mode: gitignore; -*-
+*~
+\#*\#
+/.emacs.desktop
+/.emacs.desktop.lock
+*.elc
+auto-save-list
+tramp
+.\#*
+
+# Org-mode
+.org-id-locations
+*_archive
+
+# flymake-mode
+*_flymake.*
+
+# eshell files
+/eshell/history
+/eshell/lastdir
+
+# elpa packages
+/elpa/
+
+# reftex files
+*.rel
+
+# AUCTeX auto folder
+/auto/
+
+# cask packages
+.cask/
+### Vim template
+[._]*.s[a-w][a-z]
+[._]s[a-w][a-z]
+*.un~
+Session.vim
+.netrwhist
+*~
+### JetBrains template
+# Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio
+
+*.iml
+
+## Directory-based project format:
+.idea/
+# if you remove the above rule, at least ignore the following:
+
+# User-specific stuff:
+# .idea/workspace.xml
+# .idea/tasks.xml
+# .idea/dictionaries
+
+# Sensitive or high-churn files:
+# .idea/dataSources.ids
+# .idea/dataSources.xml
+# .idea/sqlDataSources.xml
+# .idea/dynamic.xml
+# .idea/uiDesigner.xml
+
+# Gradle:
+# .idea/gradle.xml
+# .idea/libraries
+
+# Mongo Explorer plugin:
+# .idea/mongoSettings.xml
+
+## File-based project format:
+*.ipr
+*.iws
+
+## Plugin-specific files:
+
+# IntelliJ
+/out/
+
+# mpeltonen/sbt-idea plugin
+.idea_modules/
+
+# JIRA plugin
+atlassian-ide-plugin.xml
+
+# Crashlytics plugin (for Android Studio and IntelliJ)
+com_crashlytics_export_strings.xml
+crashlytics.properties
+crashlytics-build.properties
+### C++ template
+# Compiled Object files
+*.slo
+*.lo
+*.o
+*.obj
+
+# Precompiled Headers
+*.gch
+*.pch
+
+# Compiled Dynamic libraries
+*.so
+*.dylib
+*.dll
+
+# Fortran module files
+*.mod
+
+# Compiled Static libraries
+*.lai
+*.la
+*.a
+*.lib
+
+# Executables
+*.exe
+*.out
+*.app
+### OSX template
+.DS_Store
+.AppleDouble
+.LSOverride
+
+# Icon must end with two \r
+Icon
+
+# Thumbnails
+._*
+
+# Files that might appear in the root of a volume
+.DocumentRevisions-V100
+.fseventsd
+.Spotlight-V100
+.TemporaryItems
+.Trashes
+.VolumeIcon.icns
+
+# Directories potentially created on remote AFP share
+.AppleDB
+.AppleDesktop
+Network Trash Folder
+Temporary Items
+.apdisk
+### Xcode template
+# Xcode
+#
+# gitignore contributors: remember to update Global/Xcode.gitignore, Objective-C.gitignore & Swift.gitignore
+
+## Build generated
+build/
+DerivedData
+
+## Various settings
+*.pbxuser
+!default.pbxuser
+*.mode1v3
+!default.mode1v3
+*.mode2v3
+!default.mode2v3
+*.perspectivev3
+!default.perspectivev3
+xcuserdata
+
+## Other
+*.xccheckout
+*.moved-aside
+*.xcuserstate
+### Scala template
+*.class
+*.log
+/.bsp
+
+# sbt specific
+.cache
+.history
+.lib/
+dist/*
+target/
+lib_managed/
+src_managed/
+project/boot/
+project/plugins/project/
+
+# Scala-IDE specific
+.scala_dependencies
+.worksheet
+### Java template
+*.class
+
+# Mobile Tools for Java (J2ME)
+.mtj.tmp/
+
+# Package Files #
+*.jar
+*.war
+*.ear
+
+# virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml
+hs_err_pid*
-# End of https://www.toptal.com/developers/gitignore/api/xilinxise
diff --git a/.mill-version b/.mill-version
new file mode 100644
index 0000000..62d5dbd
--- /dev/null
+++ b/.mill-version
@@ -0,0 +1 @@
+0.11.5
diff --git a/LICENSE b/LICENSE
index f288702..68a49da 100644
--- a/LICENSE
+++ b/LICENSE
@@ -1,674 +1,24 @@
- GNU GENERAL PUBLIC LICENSE
- Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc.
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
- Preamble
-
- The GNU General Public License is a free, copyleft license for
-software and other kinds of works.
-
- The licenses for most software and other practical works are designed
-to take away your freedom to share and change the works. By contrast,
-the GNU General Public License is intended to guarantee your freedom to
-share and change all versions of a program--to make sure it remains free
-software for all its users. We, the Free Software Foundation, use the
-GNU General Public License for most of our software; it applies also to
-any other work released this way by its authors. You can apply it to
-your programs, too.
-
- When we speak of free software, we are referring to freedom, not
-price. Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-them if you wish), that you receive source code or can get it if you
-want it, that you can change the software or use pieces of it in new
-free programs, and that you know you can do these things.
-
- To protect your rights, we need to prevent others from denying you
-these rights or asking you to surrender the rights. Therefore, you have
-certain responsibilities if you distribute copies of the software, or if
-you modify it: responsibilities to respect the freedom of others.
-
- For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must pass on to the recipients the same
-freedoms that you received. You must make sure that they, too, receive
-or can get the source code. And you must show them these terms so they
-know their rights.
-
- Developers that use the GNU GPL protect your rights with two steps:
-(1) assert copyright on the software, and (2) offer you this License
-giving you legal permission to copy, distribute and/or modify it.
-
- For the developers' and authors' protection, the GPL clearly explains
-that there is no warranty for this free software. For both users' and
-authors' sake, the GPL requires that modified versions be marked as
-changed, so that their problems will not be attributed erroneously to
-authors of previous versions.
-
- Some devices are designed to deny users access to install or run
-modified versions of the software inside them, although the manufacturer
-can do so. This is fundamentally incompatible with the aim of
-protecting users' freedom to change the software. The systematic
-pattern of such abuse occurs in the area of products for individuals to
-use, which is precisely where it is most unacceptable. Therefore, we
-have designed this version of the GPL to prohibit the practice for those
-products. If such problems arise substantially in other domains, we
-stand ready to extend this provision to those domains in future versions
-of the GPL, as needed to protect the freedom of users.
-
- Finally, every program is threatened constantly by software patents.
-States should not allow patents to restrict development and use of
-software on general-purpose computers, but in those that do, we wish to
-avoid the special danger that patents applied to a free program could
-make it effectively proprietary. To prevent this, the GPL assures that
-patents cannot be used to render the program non-free.
-
- The precise terms and conditions for copying, distribution and
-modification follow.
-
- TERMS AND CONDITIONS
-
- 0. Definitions.
-
- "This License" refers to version 3 of the GNU General Public License.
-
- "Copyright" also means copyright-like laws that apply to other kinds of
-works, such as semiconductor masks.
-
- "The Program" refers to any copyrightable work licensed under this
-License. Each licensee is addressed as "you". "Licensees" and
-"recipients" may be individuals or organizations.
-
- To "modify" a work means to copy from or adapt all or part of the work
-in a fashion requiring copyright permission, other than the making of an
-exact copy. The resulting work is called a "modified version" of the
-earlier work or a work "based on" the earlier work.
-
- A "covered work" means either the unmodified Program or a work based
-on the Program.
-
- To "propagate" a work means to do anything with it that, without
-permission, would make you directly or secondarily liable for
-infringement under applicable copyright law, except executing it on a
-computer or modifying a private copy. Propagation includes copying,
-distribution (with or without modification), making available to the
-public, and in some countries other activities as well.
-
- To "convey" a work means any kind of propagation that enables other
-parties to make or receive copies. Mere interaction with a user through
-a computer network, with no transfer of a copy, is not conveying.
-
- An interactive user interface displays "Appropriate Legal Notices"
-to the extent that it includes a convenient and prominently visible
-feature that (1) displays an appropriate copyright notice, and (2)
-tells the user that there is no warranty for the work (except to the
-extent that warranties are provided), that licensees may convey the
-work under this License, and how to view a copy of this License. If
-the interface presents a list of user commands or options, such as a
-menu, a prominent item in the list meets this criterion.
-
- 1. Source Code.
-
- The "source code" for a work means the preferred form of the work
-for making modifications to it. "Object code" means any non-source
-form of a work.
-
- A "Standard Interface" means an interface that either is an official
-standard defined by a recognized standards body, or, in the case of
-interfaces specified for a particular programming language, one that
-is widely used among developers working in that language.
-
- The "System Libraries" of an executable work include anything, other
-than the work as a whole, that (a) is included in the normal form of
-packaging a Major Component, but which is not part of that Major
-Component, and (b) serves only to enable use of the work with that
-Major Component, or to implement a Standard Interface for which an
-implementation is available to the public in source code form. A
-"Major Component", in this context, means a major essential component
-(kernel, window system, and so on) of the specific operating system
-(if any) on which the executable work runs, or a compiler used to
-produce the work, or an object code interpreter used to run it.
-
- The "Corresponding Source" for a work in object code form means all
-the source code needed to generate, install, and (for an executable
-work) run the object code and to modify the work, including scripts to
-control those activities. However, it does not include the work's
-System Libraries, or general-purpose tools or generally available free
-programs which are used unmodified in performing those activities but
-which are not part of the work. For example, Corresponding Source
-includes interface definition files associated with source files for
-the work, and the source code for shared libraries and dynamically
-linked subprograms that the work is specifically designed to require,
-such as by intimate data communication or control flow between those
-subprograms and other parts of the work.
-
- The Corresponding Source need not include anything that users
-can regenerate automatically from other parts of the Corresponding
-Source.
-
- The Corresponding Source for a work in source code form is that
-same work.
-
- 2. Basic Permissions.
-
- All rights granted under this License are granted for the term of
-copyright on the Program, and are irrevocable provided the stated
-conditions are met. This License explicitly affirms your unlimited
-permission to run the unmodified Program. The output from running a
-covered work is covered by this License only if the output, given its
-content, constitutes a covered work. This License acknowledges your
-rights of fair use or other equivalent, as provided by copyright law.
-
- You may make, run and propagate covered works that you do not
-convey, without conditions so long as your license otherwise remains
-in force. You may convey covered works to others for the sole purpose
-of having them make modifications exclusively for you, or provide you
-with facilities for running those works, provided that you comply with
-the terms of this License in conveying all material for which you do
-not control copyright. Those thus making or running the covered works
-for you must do so exclusively on your behalf, under your direction
-and control, on terms that prohibit them from making any copies of
-your copyrighted material outside their relationship with you.
-
- Conveying under any other circumstances is permitted solely under
-the conditions stated below. Sublicensing is not allowed; section 10
-makes it unnecessary.
-
- 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
-
- No covered work shall be deemed part of an effective technological
-measure under any applicable law fulfilling obligations under article
-11 of the WIPO copyright treaty adopted on 20 December 1996, or
-similar laws prohibiting or restricting circumvention of such
-measures.
-
- When you convey a covered work, you waive any legal power to forbid
-circumvention of technological measures to the extent such circumvention
-is effected by exercising rights under this License with respect to
-the covered work, and you disclaim any intention to limit operation or
-modification of the work as a means of enforcing, against the work's
-users, your or third parties' legal rights to forbid circumvention of
-technological measures.
-
- 4. Conveying Verbatim Copies.
-
- You may convey verbatim copies of the Program's source code as you
-receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice;
-keep intact all notices stating that this License and any
-non-permissive terms added in accord with section 7 apply to the code;
-keep intact all notices of the absence of any warranty; and give all
-recipients a copy of this License along with the Program.
-
- You may charge any price or no price for each copy that you convey,
-and you may offer support or warranty protection for a fee.
-
- 5. Conveying Modified Source Versions.
-
- You may convey a work based on the Program, or the modifications to
-produce it from the Program, in the form of source code under the
-terms of section 4, provided that you also meet all of these conditions:
-
- a) The work must carry prominent notices stating that you modified
- it, and giving a relevant date.
-
- b) The work must carry prominent notices stating that it is
- released under this License and any conditions added under section
- 7. This requirement modifies the requirement in section 4 to
- "keep intact all notices".
-
- c) You must license the entire work, as a whole, under this
- License to anyone who comes into possession of a copy. This
- License will therefore apply, along with any applicable section 7
- additional terms, to the whole of the work, and all its parts,
- regardless of how they are packaged. This License gives no
- permission to license the work in any other way, but it does not
- invalidate such permission if you have separately received it.
-
- d) If the work has interactive user interfaces, each must display
- Appropriate Legal Notices; however, if the Program has interactive
- interfaces that do not display Appropriate Legal Notices, your
- work need not make them do so.
-
- A compilation of a covered work with other separate and independent
-works, which are not by their nature extensions of the covered work,
-and which are not combined with it such as to form a larger program,
-in or on a volume of a storage or distribution medium, is called an
-"aggregate" if the compilation and its resulting copyright are not
-used to limit the access or legal rights of the compilation's users
-beyond what the individual works permit. Inclusion of a covered work
-in an aggregate does not cause this License to apply to the other
-parts of the aggregate.
-
- 6. Conveying Non-Source Forms.
-
- You may convey a covered work in object code form under the terms
-of sections 4 and 5, provided that you also convey the
-machine-readable Corresponding Source under the terms of this License,
-in one of these ways:
-
- a) Convey the object code in, or embodied in, a physical product
- (including a physical distribution medium), accompanied by the
- Corresponding Source fixed on a durable physical medium
- customarily used for software interchange.
-
- b) Convey the object code in, or embodied in, a physical product
- (including a physical distribution medium), accompanied by a
- written offer, valid for at least three years and valid for as
- long as you offer spare parts or customer support for that product
- model, to give anyone who possesses the object code either (1) a
- copy of the Corresponding Source for all the software in the
- product that is covered by this License, on a durable physical
- medium customarily used for software interchange, for a price no
- more than your reasonable cost of physically performing this
- conveying of source, or (2) access to copy the
- Corresponding Source from a network server at no charge.
-
- c) Convey individual copies of the object code with a copy of the
- written offer to provide the Corresponding Source. This
- alternative is allowed only occasionally and noncommercially, and
- only if you received the object code with such an offer, in accord
- with subsection 6b.
-
- d) Convey the object code by offering access from a designated
- place (gratis or for a charge), and offer equivalent access to the
- Corresponding Source in the same way through the same place at no
- further charge. You need not require recipients to copy the
- Corresponding Source along with the object code. If the place to
- copy the object code is a network server, the Corresponding Source
- may be on a different server (operated by you or a third party)
- that supports equivalent copying facilities, provided you maintain
- clear directions next to the object code saying where to find the
- Corresponding Source. Regardless of what server hosts the
- Corresponding Source, you remain obligated to ensure that it is
- available for as long as needed to satisfy these requirements.
-
- e) Convey the object code using peer-to-peer transmission, provided
- you inform other peers where the object code and Corresponding
- Source of the work are being offered to the general public at no
- charge under subsection 6d.
-
- A separable portion of the object code, whose source code is excluded
-from the Corresponding Source as a System Library, need not be
-included in conveying the object code work.
-
- A "User Product" is either (1) a "consumer product", which means any
-tangible personal property which is normally used for personal, family,
-or household purposes, or (2) anything designed or sold for incorporation
-into a dwelling. In determining whether a product is a consumer product,
-doubtful cases shall be resolved in favor of coverage. For a particular
-product received by a particular user, "normally used" refers to a
-typical or common use of that class of product, regardless of the status
-of the particular user or of the way in which the particular user
-actually uses, or expects or is expected to use, the product. A product
-is a consumer product regardless of whether the product has substantial
-commercial, industrial or non-consumer uses, unless such uses represent
-the only significant mode of use of the product.
-
- "Installation Information" for a User Product means any methods,
-procedures, authorization keys, or other information required to install
-and execute modified versions of a covered work in that User Product from
-a modified version of its Corresponding Source. The information must
-suffice to ensure that the continued functioning of the modified object
-code is in no case prevented or interfered with solely because
-modification has been made.
-
- If you convey an object code work under this section in, or with, or
-specifically for use in, a User Product, and the conveying occurs as
-part of a transaction in which the right of possession and use of the
-User Product is transferred to the recipient in perpetuity or for a
-fixed term (regardless of how the transaction is characterized), the
-Corresponding Source conveyed under this section must be accompanied
-by the Installation Information. But this requirement does not apply
-if neither you nor any third party retains the ability to install
-modified object code on the User Product (for example, the work has
-been installed in ROM).
-
- The requirement to provide Installation Information does not include a
-requirement to continue to provide support service, warranty, or updates
-for a work that has been modified or installed by the recipient, or for
-the User Product in which it has been modified or installed. Access to a
-network may be denied when the modification itself materially and
-adversely affects the operation of the network or violates the rules and
-protocols for communication across the network.
-
- Corresponding Source conveyed, and Installation Information provided,
-in accord with this section must be in a format that is publicly
-documented (and with an implementation available to the public in
-source code form), and must require no special password or key for
-unpacking, reading or copying.
-
- 7. Additional Terms.
-
- "Additional permissions" are terms that supplement the terms of this
-License by making exceptions from one or more of its conditions.
-Additional permissions that are applicable to the entire Program shall
-be treated as though they were included in this License, to the extent
-that they are valid under applicable law. If additional permissions
-apply only to part of the Program, that part may be used separately
-under those permissions, but the entire Program remains governed by
-this License without regard to the additional permissions.
-
- When you convey a copy of a covered work, you may at your option
-remove any additional permissions from that copy, or from any part of
-it. (Additional permissions may be written to require their own
-removal in certain cases when you modify the work.) You may place
-additional permissions on material, added by you to a covered work,
-for which you have or can give appropriate copyright permission.
-
- Notwithstanding any other provision of this License, for material you
-add to a covered work, you may (if authorized by the copyright holders of
-that material) supplement the terms of this License with terms:
-
- a) Disclaiming warranty or limiting liability differently from the
- terms of sections 15 and 16 of this License; or
-
- b) Requiring preservation of specified reasonable legal notices or
- author attributions in that material or in the Appropriate Legal
- Notices displayed by works containing it; or
-
- c) Prohibiting misrepresentation of the origin of that material, or
- requiring that modified versions of such material be marked in
- reasonable ways as different from the original version; or
-
- d) Limiting the use for publicity purposes of names of licensors or
- authors of the material; or
-
- e) Declining to grant rights under trademark law for use of some
- trade names, trademarks, or service marks; or
-
- f) Requiring indemnification of licensors and authors of that
- material by anyone who conveys the material (or modified versions of
- it) with contractual assumptions of liability to the recipient, for
- any liability that these contractual assumptions directly impose on
- those licensors and authors.
-
- All other non-permissive additional terms are considered "further
-restrictions" within the meaning of section 10. If the Program as you
-received it, or any part of it, contains a notice stating that it is
-governed by this License along with a term that is a further
-restriction, you may remove that term. If a license document contains
-a further restriction but permits relicensing or conveying under this
-License, you may add to a covered work material governed by the terms
-of that license document, provided that the further restriction does
-not survive such relicensing or conveying.
-
- If you add terms to a covered work in accord with this section, you
-must place, in the relevant source files, a statement of the
-additional terms that apply to those files, or a notice indicating
-where to find the applicable terms.
-
- Additional terms, permissive or non-permissive, may be stated in the
-form of a separately written license, or stated as exceptions;
-the above requirements apply either way.
-
- 8. Termination.
-
- You may not propagate or modify a covered work except as expressly
-provided under this License. Any attempt otherwise to propagate or
-modify it is void, and will automatically terminate your rights under
-this License (including any patent licenses granted under the third
-paragraph of section 11).
-
- However, if you cease all violation of this License, then your
-license from a particular copyright holder is reinstated (a)
-provisionally, unless and until the copyright holder explicitly and
-finally terminates your license, and (b) permanently, if the copyright
-holder fails to notify you of the violation by some reasonable means
-prior to 60 days after the cessation.
-
- Moreover, your license from a particular copyright holder is
-reinstated permanently if the copyright holder notifies you of the
-violation by some reasonable means, this is the first time you have
-received notice of violation of this License (for any work) from that
-copyright holder, and you cure the violation prior to 30 days after
-your receipt of the notice.
-
- Termination of your rights under this section does not terminate the
-licenses of parties who have received copies or rights from you under
-this License. If your rights have been terminated and not permanently
-reinstated, you do not qualify to receive new licenses for the same
-material under section 10.
-
- 9. Acceptance Not Required for Having Copies.
-
- You are not required to accept this License in order to receive or
-run a copy of the Program. Ancillary propagation of a covered work
-occurring solely as a consequence of using peer-to-peer transmission
-to receive a copy likewise does not require acceptance. However,
-nothing other than this License grants you permission to propagate or
-modify any covered work. These actions infringe copyright if you do
-not accept this License. Therefore, by modifying or propagating a
-covered work, you indicate your acceptance of this License to do so.
-
- 10. Automatic Licensing of Downstream Recipients.
-
- Each time you convey a covered work, the recipient automatically
-receives a license from the original licensors, to run, modify and
-propagate that work, subject to this License. You are not responsible
-for enforcing compliance by third parties with this License.
-
- An "entity transaction" is a transaction transferring control of an
-organization, or substantially all assets of one, or subdividing an
-organization, or merging organizations. If propagation of a covered
-work results from an entity transaction, each party to that
-transaction who receives a copy of the work also receives whatever
-licenses to the work the party's predecessor in interest had or could
-give under the previous paragraph, plus a right to possession of the
-Corresponding Source of the work from the predecessor in interest, if
-the predecessor has it or can get it with reasonable efforts.
-
- You may not impose any further restrictions on the exercise of the
-rights granted or affirmed under this License. For example, you may
-not impose a license fee, royalty, or other charge for exercise of
-rights granted under this License, and you may not initiate litigation
-(including a cross-claim or counterclaim in a lawsuit) alleging that
-any patent claim is infringed by making, using, selling, offering for
-sale, or importing the Program or any portion of it.
-
- 11. Patents.
-
- A "contributor" is a copyright holder who authorizes use under this
-License of the Program or a work on which the Program is based. The
-work thus licensed is called the contributor's "contributor version".
-
- A contributor's "essential patent claims" are all patent claims
-owned or controlled by the contributor, whether already acquired or
-hereafter acquired, that would be infringed by some manner, permitted
-by this License, of making, using, or selling its contributor version,
-but do not include claims that would be infringed only as a
-consequence of further modification of the contributor version. For
-purposes of this definition, "control" includes the right to grant
-patent sublicenses in a manner consistent with the requirements of
-this License.
-
- Each contributor grants you a non-exclusive, worldwide, royalty-free
-patent license under the contributor's essential patent claims, to
-make, use, sell, offer for sale, import and otherwise run, modify and
-propagate the contents of its contributor version.
-
- In the following three paragraphs, a "patent license" is any express
-agreement or commitment, however denominated, not to enforce a patent
-(such as an express permission to practice a patent or covenant not to
-sue for patent infringement). To "grant" such a patent license to a
-party means to make such an agreement or commitment not to enforce a
-patent against the party.
-
- If you convey a covered work, knowingly relying on a patent license,
-and the Corresponding Source of the work is not available for anyone
-to copy, free of charge and under the terms of this License, through a
-publicly available network server or other readily accessible means,
-then you must either (1) cause the Corresponding Source to be so
-available, or (2) arrange to deprive yourself of the benefit of the
-patent license for this particular work, or (3) arrange, in a manner
-consistent with the requirements of this License, to extend the patent
-license to downstream recipients. "Knowingly relying" means you have
-actual knowledge that, but for the patent license, your conveying the
-covered work in a country, or your recipient's use of the covered work
-in a country, would infringe one or more identifiable patents in that
-country that you have reason to believe are valid.
-
- If, pursuant to or in connection with a single transaction or
-arrangement, you convey, or propagate by procuring conveyance of, a
-covered work, and grant a patent license to some of the parties
-receiving the covered work authorizing them to use, propagate, modify
-or convey a specific copy of the covered work, then the patent license
-you grant is automatically extended to all recipients of the covered
-work and works based on it.
-
- A patent license is "discriminatory" if it does not include within
-the scope of its coverage, prohibits the exercise of, or is
-conditioned on the non-exercise of one or more of the rights that are
-specifically granted under this License. You may not convey a covered
-work if you are a party to an arrangement with a third party that is
-in the business of distributing software, under which you make payment
-to the third party based on the extent of your activity of conveying
-the work, and under which the third party grants, to any of the
-parties who would receive the covered work from you, a discriminatory
-patent license (a) in connection with copies of the covered work
-conveyed by you (or copies made from those copies), or (b) primarily
-for and in connection with specific products or compilations that
-contain the covered work, unless you entered into that arrangement,
-or that patent license was granted, prior to 28 March 2007.
-
- Nothing in this License shall be construed as excluding or limiting
-any implied license or other defenses to infringement that may
-otherwise be available to you under applicable patent law.
-
- 12. No Surrender of Others' Freedom.
-
- If conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License. If you cannot convey a
-covered work so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you may
-not convey it at all. For example, if you agree to terms that obligate you
-to collect a royalty for further conveying from those to whom you convey
-the Program, the only way you could satisfy both those terms and this
-License would be to refrain entirely from conveying the Program.
-
- 13. Use with the GNU Affero General Public License.
-
- Notwithstanding any other provision of this License, you have
-permission to link or combine any covered work with a work licensed
-under version 3 of the GNU Affero General Public License into a single
-combined work, and to convey the resulting work. The terms of this
-License will continue to apply to the part which is the covered work,
-but the special requirements of the GNU Affero General Public License,
-section 13, concerning interaction through a network will apply to the
-combination as such.
-
- 14. Revised Versions of this License.
-
- The Free Software Foundation may publish revised and/or new versions of
-the GNU General Public License from time to time. Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
- Each version is given a distinguishing version number. If the
-Program specifies that a certain numbered version of the GNU General
-Public License "or any later version" applies to it, you have the
-option of following the terms and conditions either of that numbered
-version or of any later version published by the Free Software
-Foundation. If the Program does not specify a version number of the
-GNU General Public License, you may choose any version ever published
-by the Free Software Foundation.
-
- If the Program specifies that a proxy can decide which future
-versions of the GNU General Public License can be used, that proxy's
-public statement of acceptance of a version permanently authorizes you
-to choose that version for the Program.
-
- Later license versions may give you additional or different
-permissions. However, no additional obligations are imposed on any
-author or copyright holder as a result of your choosing to follow a
-later version.
-
- 15. Disclaimer of Warranty.
-
- THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
-APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
-HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
-OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
-IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
-ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
- 16. Limitation of Liability.
-
- IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
-THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
-USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
-DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
-PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
-EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGES.
-
- 17. Interpretation of Sections 15 and 16.
-
- If the disclaimer of warranty and limitation of liability provided
-above cannot be given local legal effect according to their terms,
-reviewing courts shall apply local law that most closely approximates
-an absolute waiver of all civil liability in connection with the
-Program, unless a warranty or assumption of liability accompanies a
-copy of the Program in return for a fee.
-
- END OF TERMS AND CONDITIONS
-
- How to Apply These Terms to Your New Programs
-
- If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
- To do so, attach the following notices to the program. It is safest
-to attach them to the start of each source file to most effectively
-state the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-
- Copyright (C)
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program. If not, see .
-
-Also add information on how to contact you by electronic and paper mail.
-
- If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
- Copyright (C)
- This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
- This is free software, and you are welcome to redistribute it
- under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License. Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
- You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-.
-
- The GNU General Public License does not permit incorporating your program
-into proprietary programs. If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library. If this is what you want to do, use the GNU Lesser General
-Public License instead of this License. But first, please read
-.
+This is free and unencumbered software released into the public domain.
+
+Anyone is free to copy, modify, publish, use, compile, sell, or
+distribute this software, either in source code form or as a compiled
+binary, for any purpose, commercial or non-commercial, and by any
+means.
+
+In jurisdictions that recognize copyright laws, the author or authors
+of this software dedicate any and all copyright interest in the
+software to the public domain. We make this dedication for the benefit
+of the public at large and to the detriment of our heirs and
+successors. We intend this dedication to be an overt act of
+relinquishment in perpetuity of all present and future rights to this
+software under copyright law.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
+OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
+
+For more information, please refer to
diff --git a/README.md b/README.md
index 356e05e..db79f5a 100644
--- a/README.md
+++ b/README.md
@@ -1,2 +1,111 @@
-# clkr
-HyperDbg's HDL module for hardware-level debugging
+Chisel Project Template
+=======================
+
+You've done the [Chisel Bootcamp](https://github.com/freechipsproject/chisel-bootcamp), and now you
+are ready to start your own Chisel project. The following procedure should get you started
+with a clean running [Chisel3](https://www.chisel-lang.org/) project.
+
+## Make your own Chisel3 project
+
+### Dependencies
+
+#### JDK 8 or newer
+
+We recommend LTS releases Java 8 and Java 11. You can install the JDK as your operating system recommends, or use the prebuilt binaries from [AdoptOpenJDK](https://adoptopenjdk.net/).
+
+#### SBT or mill
+
+SBT is the most common build tool in the Scala community. You can download it [here](https://www.scala-sbt.org/download.html).
+mill is another Scala/Java build tool without obscure DSL like SBT. You can download it [here](https://github.com/com-lihaoyi/mill/releases)
+
+#### Verilator
+
+The test with `svsim` needs Verilator installed.
+See Verilator installation instructions [here](https://verilator.org/guide/latest/install.html).
+
+### How to get started
+
+#### Create a repository from the template
+
+This repository is a Github template. You can create your own repository from it by clicking the green `Use this template` in the top right.
+Please leave `Include all branches` **unchecked**; checking it will pollute the history of your new repository.
+For more information, see ["Creating a repository from a template"](https://docs.github.com/en/free-pro-team@latest/github/creating-cloning-and-archiving-repositories/creating-a-repository-from-a-template).
+
+#### Wait for the template cleanup workflow to complete
+
+After using the template to create your own blank project, please wait a minute or two for the `Template cleanup` workflow to run which will removes some template-specific stuff from the repository (like the LICENSE).
+Refresh the repository page in your browser until you see a 2nd commit by `actions-user` titled `Template cleanup`.
+
+
+#### Clone your repository
+
+Once you have created a repository from this template and the `Template cleanup` workflow has completed, you can click the green button to get a link for cloning your repository.
+Note that it is easiest to push to a repository if you set up SSH with Github, please see the [related documentation](https://docs.github.com/en/free-pro-team@latest/github/authenticating-to-github/connecting-to-github-with-ssh). SSH is required for pushing to a Github repository when using two-factor authentication.
+
+```sh
+git clone git@github.com:%REPOSITORY%.git
+cd %NAME%
+```
+(The variables wrapped in `%` will be filled in by the template cleanup)
+
+#### Set project organization and name in build.sbt
+
+The cleanup workflow will have attempted to provide sensible defaults for `ThisBuild / organization` and `name` in the `build.sbt`.
+Feel free to use your text editor of choice to change them as you see fit.
+
+#### Clean up the README.md file
+
+Again, use you editor of choice to make the README specific to your project.
+
+#### Add a LICENSE file
+
+It is important to have a LICENSE for open source (or closed source) code.
+This template repository has the Unlicense in order to allow users to add any license they want to derivative code.
+The Unlicense is stripped when creating a repository from this template so that users do not accidentally unlicense their own work.
+
+For more information about a license, check out the [Github Docs](https://docs.github.com/en/free-pro-team@latest/github/building-a-strong-community/adding-a-license-to-a-repository).
+
+#### Commit your changes
+```sh
+git commit -m 'Starting %NAME%'
+git push origin main
+```
+
+### Did it work?
+
+You should now have a working Chisel3 project.
+
+You can run the included test with:
+```sh
+sbt test
+```
+
+Alternatively, if you use Mill:
+```sh
+mill %NAME%.test
+```
+
+You should see a whole bunch of output that ends with something like the following lines
+```
+[info] Tests: succeeded 1, failed 0, canceled 0, ignored 0, pending 0
+[info] All tests passed.
+[success] Total time: 5 s, completed Dec 16, 2020 12:18:44 PM
+```
+If you see the above then...
+
+### It worked!
+
+You are ready to go. We have a few recommended practices and things to do.
+
+* Use packages and following conventions for [structure](https://www.scala-sbt.org/1.x/docs/Directories.html) and [naming](http://docs.scala-lang.org/style/naming-conventions.html)
+* Package names should be clearly reflected in the testing hierarchy
+* Build tests for all your work
+* Read more about testing in SBT in the [SBT docs](https://www.scala-sbt.org/1.x/docs/Testing.html)
+* This template includes a [test dependency](https://www.scala-sbt.org/1.x/docs/Library-Dependencies.html#Per-configuration+dependencies) on [ScalaTest](https://www.scalatest.org/). This, coupled with `svsim` (included with Chisel) and `verilator`, are a starting point for testing Chisel generators.
+ * You can remove this dependency in the build.sbt file if you want to
+* Change the name of your project in the build.sbt file
+* Change your README.md
+
+## Problems? Questions?
+
+Check out the [Chisel Users Community](https://www.chisel-lang.org/community.html) page for links to get in contact!
diff --git a/build.sbt b/build.sbt
new file mode 100644
index 0000000..9742b43
--- /dev/null
+++ b/build.sbt
@@ -0,0 +1,24 @@
+// See README.md for license details.
+
+ThisBuild / scalaVersion := "2.13.12"
+ThisBuild / version := "0.1.0"
+ThisBuild / organization := "%ORGANIZATION%"
+
+val chiselVersion = "6.0.0"
+
+lazy val root = (project in file("."))
+ .settings(
+ name := "%NAME%",
+ libraryDependencies ++= Seq(
+ "org.chipsalliance" %% "chisel" % chiselVersion,
+ "org.scalatest" %% "scalatest" % "3.2.16" % "test",
+ ),
+ scalacOptions ++= Seq(
+ "-language:reflectiveCalls",
+ "-deprecation",
+ "-feature",
+ "-Xcheckinit",
+ "-Ymacro-annotations",
+ ),
+ addCompilerPlugin("org.chipsalliance" % "chisel-plugin" % chiselVersion cross CrossVersion.full),
+ )
diff --git a/build.sc b/build.sc
new file mode 100644
index 0000000..0addcbe
--- /dev/null
+++ b/build.sc
@@ -0,0 +1,30 @@
+// import Mill dependency
+import mill._
+import mill.define.Sources
+import mill.modules.Util
+import mill.scalalib.TestModule.ScalaTest
+import scalalib._
+// support BSP
+import mill.bsp._
+
+object %NAME% extends SbtModule { m =>
+ override def millSourcePath = os.pwd
+ override def scalaVersion = "2.13.12"
+ override def scalacOptions = Seq(
+ "-language:reflectiveCalls",
+ "-deprecation",
+ "-feature",
+ "-Xcheckinit",
+ )
+ override def ivyDeps = Agg(
+ ivy"org.chipsalliance::chisel:6.0.0",
+ )
+ override def scalacPluginIvyDeps = Agg(
+ ivy"org.chipsalliance:::chisel-plugin:6.0.0",
+ )
+ object test extends SbtModuleTests with TestModule.ScalaTest {
+ override def ivyDeps = m.ivyDeps() ++ Agg(
+ ivy"org.scalatest::scalatest::3.2.16"
+ )
+ }
+}
diff --git a/clkr/RAM.vhd b/clkr/RAM.vhd
deleted file mode 100644
index c5c43de..0000000
--- a/clkr/RAM.vhd
+++ /dev/null
@@ -1,74 +0,0 @@
-LIBRARY IEEE;
-USE IEEE.STD_LOGIC_1164.ALL;
-USE ieee.numeric_std.ALL;
-
--- A 128x8 single-port RAM in VHDL
-ENTITY RAM IS
- PORT (
- RAM_ADDR : IN std_logic_vector(6 DOWNTO 0); -- Address to write/read RAM
- RAM_DATA_IN : IN std_logic_vector(7 DOWNTO 0); -- Data to write into RAM
- RAM_WR : IN std_logic; -- Write enable
- RAM_CLOCK : IN std_logic; -- clock input for RAM
- RAM_DATA_OUT : OUT std_logic_vector(7 DOWNTO 0) -- Data output of RAM
- );
-END RAM;
-
-ARCHITECTURE Behavioral OF RAM IS
-
- -- define the new type for the 128x8 RAM
- TYPE RAM_ARRAY IS ARRAY (0 TO 127) OF std_logic_vector (7 DOWNTO 0);
-
- -- initial values in the RAM
- SIGNAL RAM : RAM_ARRAY := (
- x"55", x"66", x"77", x"67", -- 0x00:
- x"99", x"00", x"00", x"11", -- 0x04:
- x"00", x"00", x"00", x"00", -- 0x08:
- x"00", x"00", x"00", x"00", -- 0x0C:
- x"00", x"00", x"00", x"00", -- 0x10:
- x"00", x"00", x"00", x"00", -- 0x14:
- x"00", x"00", x"00", x"00", -- 0x18:
- x"00", x"00", x"00", x"00", -- 0x1C:
- x"00", x"00", x"00", x"00", -- 0x20:
- x"00", x"00", x"00", x"00", -- 0x24:
- x"00", x"00", x"00", x"00", -- 0x28:
- x"00", x"00", x"00", x"00", -- 0x2C:
- x"00", x"00", x"00", x"00", -- 0x30:
- x"00", x"00", x"00", x"00", -- 0x34:
- x"00", x"00", x"00", x"00", -- 0x38:
- x"00", x"00", x"00", x"00", -- 0x3C:
- x"00", x"00", x"00", x"00", -- 0x40:
- x"00", x"00", x"00", x"00", -- 0x44:
- x"00", x"00", x"00", x"00", -- 0x48:
- x"00", x"00", x"00", x"00", -- 0x4C:
- x"00", x"00", x"00", x"00", -- 0x50:
- x"00", x"00", x"00", x"00", -- 0x54:
- x"00", x"00", x"00", x"00", -- 0x58:
- x"00", x"00", x"00", x"00", -- 0x5C:
- x"00", x"00", x"00", x"00",
- x"00", x"00", x"00", x"00",
- x"00", x"00", x"00", x"00",
- x"00", x"00", x"00", x"00",
- x"00", x"00", x"00", x"00",
- x"00", x"00", x"00", x"00",
- x"00", x"00", x"00", x"00",
- x"00", x"00", x"00", x"00"
- );
-BEGIN
-
- PROCESS (RAM_CLOCK)
- BEGIN
- IF (rising_edge(RAM_CLOCK)) THEN
- IF (RAM_WR = '1') THEN -- when write enable = 1,
- -- write input data into RAM at the provided address
- RAM(to_integer(unsigned(RAM_ADDR))) <= RAM_DATA_IN;
-
- -- The index of the RAM array type needs to be integer so
- -- converts RAM_ADDR from std_logic_vector -> Unsigned -> Interger using numeric_std library
- END IF;
- END IF;
- END PROCESS;
-
- -- Data to be read out
- RAM_DATA_OUT <= RAM(to_integer(unsigned(RAM_ADDR)));
-
-END Behavioral;
\ No newline at end of file
diff --git a/clkr/RAM_INIT_isim_beh.exe b/clkr/RAM_INIT_isim_beh.exe
deleted file mode 100644
index fb891a9..0000000
Binary files a/clkr/RAM_INIT_isim_beh.exe and /dev/null differ
diff --git a/clkr/REGISTER_FILE_isim_beh.exe b/clkr/REGISTER_FILE_isim_beh.exe
deleted file mode 100644
index fb891a9..0000000
Binary files a/clkr/REGISTER_FILE_isim_beh.exe and /dev/null differ
diff --git a/clkr/RamInit.vhd b/clkr/RamInit.vhd
deleted file mode 100644
index d6861d2..0000000
--- a/clkr/RamInit.vhd
+++ /dev/null
@@ -1,34 +0,0 @@
-LIBRARY IEEE;
-USE IEEE.STD_LOGIC_1164.ALL;
-USE IEEE.STD_LOGIC_TEXTIO.ALL;
-
-LIBRARY STD;
-
-USE STD.TEXTIO.ALL;
-
-ENTITY RAM_INIT IS
- PORT (
- CLK : IN STD_LOGIC;
- PERFORM_INIT : IN STD_LOGIC
- );
-END RAM_INIT;
-
-ARCHITECTURE Behavioral OF RAM_INIT IS
-
- FILE FIN : TEXT OPEN READ_MODE IS "input.dat";
-
-BEGIN
-
- PROCESS (CLK)
- VARIABLE RD_LINE : LINE;
- VARIABLE HEX : STD_LOGIC_VECTOR(3 DOWNTO 0);
- BEGIN
- IF PERFORM_INIT = '1' THEN
- WHILE NOT ENDFILE(FIN) LOOP
- readline(FIN, RD_LINE);
- hread(RD_LINE, HEX);
- END LOOP;
- END IF;
- END PROCESS;
-
-END Behavioral;
\ No newline at end of file
diff --git a/clkr/RegFile.vhd b/clkr/RegFile.vhd
deleted file mode 100644
index 9d6aaa1..0000000
--- a/clkr/RegFile.vhd
+++ /dev/null
@@ -1,43 +0,0 @@
-LIBRARY IEEE;
-USE IEEE.STD_LOGIC_1164.ALL;
-USE IEEE.NUMERIC_STD.ALL;
-
-ENTITY REGISTER_FILE IS
- PORT (
- OUT_REG_A : OUT STD_LOGIC_VECTOR(63 DOWNTO 0);
- OUT_REG_B : OUT STD_LOGIC_VECTOR(63 DOWNTO 0);
- INPUT_VAL : IN STD_LOGIC_VECTOR(63 DOWNTO 0);
- WRITE_ENABLE : IN STD_LOGIC;
- SEL_REG_A : IN STD_LOGIC_VECTOR(3 DOWNTO 0);
- SEL_REG_B : IN STD_LOGIC_VECTOR(3 DOWNTO 0);
- WRITE_REG_SEL : IN STD_LOGIC_VECTOR(3 DOWNTO 0);
- CLK : IN STD_LOGIC
- );
-END REGISTER_FILE;
-
-ARCHITECTURE Behavioral OF REGISTER_FILE IS
- TYPE REGISTER_FILE_TYPE IS ARRAY(0 TO 15) OF STD_LOGIC_VECTOR(63 DOWNTO 0);
- SIGNAL REGISTERS : REGISTER_FILE_TYPE;
-BEGIN
-
- RegFile : PROCESS (CLK) IS
- BEGIN
- IF rising_edge(CLK) THEN
-
- -- Read A and B before bypass
- OUT_REG_A <= registers(to_integer(unsigned(SEL_REG_A)));
- OUT_REG_B <= registers(to_integer(unsigned(SEL_REG_B)));
-
- -- Write and bypass
- IF WRITE_ENABLE = '1' THEN
- registers(to_integer(unsigned(WRITE_REG_SEL))) <= INPUT_VAL; -- Write
- IF SEL_REG_A = WRITE_REG_SEL THEN -- Bypass for read A
- OUT_REG_A <= INPUT_VAL;
- END IF;
- IF SEL_REG_B = WRITE_REG_SEL THEN -- Bypass for read B
- OUT_REG_B <= INPUT_VAL;
- END IF;
- END IF;
- END IF;
- END PROCESS;
-END Behavioral;
\ No newline at end of file
diff --git a/clkr/TOP_isim_beh1.wdb b/clkr/TOP_isim_beh1.wdb
deleted file mode 100644
index 6f8bfa7..0000000
Binary files a/clkr/TOP_isim_beh1.wdb and /dev/null differ
diff --git a/clkr/Top.vhd b/clkr/Top.vhd
deleted file mode 100644
index 4b89c41..0000000
--- a/clkr/Top.vhd
+++ /dev/null
@@ -1,72 +0,0 @@
-LIBRARY IEEE;
-USE IEEE.STD_LOGIC_1164.ALL;
-
-ENTITY TOP IS
- PORT (INPUT_CLK : IN STD_LOGIC_VECTOR (0 DOWNTO 0));
-END TOP;
-
-ARCHITECTURE Behavioral OF TOP IS
-
- -- RAM signals
- SIGNAL RAM_ADDR : STD_LOGIC_VECTOR(6 DOWNTO 0) := "0000100";
- SIGNAL RAM_DATA_IN : STD_LOGIC_VECTOR(7 DOWNTO 0);
- SIGNAL RAM_WR : STD_LOGIC;
- SIGNAL RAM_CLOCK : STD_LOGIC;
- SIGNAL RAM_DATA_OUT : STD_LOGIC_VECTOR(7 DOWNTO 0);
-
- -- RAM initialization signal
- SIGNAL IS_RAM_INITALIZED : STD_LOGIC := '0';
- SIGNAL PERFORM_RAM_INIT : STD_LOGIC := '0';
-
- -- Clock signal for testing purposes
- SIGNAL CLK : STD_LOGIC := '0';
-
- -- Instantiate components
- COMPONENT RAM
- PORT (
- RAM_ADDR : IN STD_LOGIC_VECTOR(6 DOWNTO 0); -- Address to write/read RAM
- RAM_DATA_IN : IN STD_LOGIC_VECTOR(7 DOWNTO 0); -- Data to write into RAM
- RAM_WR : IN STD_LOGIC; -- Write enable
- RAM_CLOCK : IN STD_LOGIC; -- clock input for RAM
- RAM_DATA_OUT : OUT STD_LOGIC_VECTOR(7 DOWNTO 0) -- Data output of RAM
- );
- END COMPONENT;
-
- COMPONENT RAM_INIT
- PORT (
- CLK : IN STD_LOGIC;
- PERFORM_INIT : IN STD_LOGIC
- );
- END COMPONENT;
-
-BEGIN
-
- -- Using RAM
- RAM_UNT: RAM PORT MAP (RAM_ADDR => RAM_ADDR,
- RAM_DATA_IN => RAM_DATA_IN,
- RAM_WR => RAM_WR,
- RAM_CLOCK => CLK,
- RAM_DATA_OUT => RAM_DATA_OUT
- );
-
- -- Initialize RAM
- RAM_INITIALIZE: RAM_INIT PORT MAP (CLK => CLK,
- PERFORM_INIT => PERFORM_RAM_INIT
- );
-
- PROCESS
- BEGIN
- IF IS_RAM_INITALIZED = '0'
- THEN
- PERFORM_RAM_INIT <= '1';
- END IF;
- END PROCESS;
-
- -- Create testing signal
- PROCESS
- BEGIN
- CLK <= NOT CLK;
- WAIT FOR 1 ns;
- END PROCESS;
-
-END Behavioral;
\ No newline at end of file
diff --git a/clkr/Top_isim_beh.exe b/clkr/Top_isim_beh.exe
deleted file mode 100644
index fb891a9..0000000
Binary files a/clkr/Top_isim_beh.exe and /dev/null differ
diff --git a/clkr/Top_isim_beh.wdb b/clkr/Top_isim_beh.wdb
deleted file mode 100644
index 3fdede4..0000000
Binary files a/clkr/Top_isim_beh.wdb and /dev/null differ
diff --git a/clkr/clkr.xise b/clkr/clkr.xise
deleted file mode 100644
index 4dad1b3..0000000
--- a/clkr/clkr.xise
+++ /dev/null
@@ -1,352 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/clkr/fuse.log b/clkr/fuse.log
deleted file mode 100644
index 344577e..0000000
--- a/clkr/fuse.log
+++ /dev/null
@@ -1,25 +0,0 @@
-Running: C:\Xilinx\14.7\ISE_DS\ISE\bin\nt64\unwrapped\fuse.exe -intstyle ise -incremental -o C:/Users/sina/Desktop/HyperDbg/clkr/clkr/TOP_isim_beh.exe -prj C:/Users/sina/Desktop/HyperDbg/clkr/clkr/TOP_beh.prj work.TOP
-ISim P.20131013 (signature 0x7708f090)
-Number of CPUs detected in this system: 8
-Turning on mult-threading, number of parallel sub-compilation jobs: 16
-Determining compilation order of HDL files
-Parsing VHDL file "C:/Users/sina/Desktop/HyperDbg/clkr/clkr/RamInit.vhd" into library work
-Parsing VHDL file "C:/Users/sina/Desktop/HyperDbg/clkr/clkr/RAM.vhd" into library work
-Parsing VHDL file "C:/Users/sina/Desktop/HyperDbg/clkr/clkr/Top.vhd" into library work
-WARNING:HDLCompiler:1369 - "C:/Users/sina/Desktop/HyperDbg/clkr/clkr/Top.vhd" Line 57: Possible infinite loop; process does not have a wait statement
-Starting static elaboration
-Completed static elaboration
-Compiling package standard
-Compiling package std_logic_1164
-Compiling package numeric_std
-Compiling package textio
-Compiling package std_logic_textio
-Compiling architecture behavioral of entity RAM [ram_default]
-Compiling architecture behavioral of entity RAM_INIT [ram_init_default]
-Compiling architecture behavioral of entity top
-Time Resolution for simulation is 1ps.
-Waiting for 1 sub-compilation(s) to finish...
-Compiled 10 VHDL Units
-Built simulation executable C:/Users/sina/Desktop/HyperDbg/clkr/clkr/TOP_isim_beh.exe
-Fuse Memory Usage: 36456 KB
-Fuse CPU Usage: 640 ms
diff --git a/clkr/fuse.xmsgs b/clkr/fuse.xmsgs
deleted file mode 100644
index a20abda..0000000
--- a/clkr/fuse.xmsgs
+++ /dev/null
@@ -1,12 +0,0 @@
-
-
-
-"C:/Users/sina/Desktop/HyperDbg/clkr/clkr/Top.vhd" Line 57: Possible infinite loop; process does not have a wait statement
-
-
-
-
diff --git a/clkr/fuseRelaunch.cmd b/clkr/fuseRelaunch.cmd
deleted file mode 100644
index 32e102a..0000000
--- a/clkr/fuseRelaunch.cmd
+++ /dev/null
@@ -1 +0,0 @@
--intstyle "ise" -incremental -o "C:/Users/sina/Desktop/HyperDbg/clkr/clkr/TOP_isim_beh.exe" -prj "C:/Users/sina/Desktop/HyperDbg/clkr/clkr/TOP_beh.prj" "work.TOP"
diff --git a/clkr/input.dat b/clkr/input.dat
deleted file mode 100644
index 87e7edb..0000000
--- a/clkr/input.dat
+++ /dev/null
@@ -1,5 +0,0 @@
-55
-85
-69
-55
-55
\ No newline at end of file
diff --git a/clkr/isim.cmd b/clkr/isim.cmd
deleted file mode 100644
index fff18e8..0000000
--- a/clkr/isim.cmd
+++ /dev/null
@@ -1,3 +0,0 @@
-onerror {resume}
-wave add /
-run 1000 ns;
diff --git a/clkr/isim.log b/clkr/isim.log
deleted file mode 100644
index 8592119..0000000
--- a/clkr/isim.log
+++ /dev/null
@@ -1,30 +0,0 @@
-ISim log file
-Running: C:\Users\sina\Desktop\HyperDbg\clkr\clkr\TOP_isim_beh.exe -intstyle ise -gui -tclbatch isim.cmd -wdb C:/Users/sina/Desktop/HyperDbg/clkr/clkr/TOP_isim_beh.wdb
-ISim P.20131013 (signature 0x7708f090)
-----------------------------------------------------------------------
-INFO:Security:51 - The XILINXD_LICENSE_FILE environment variable is not set.
-INFO:Security:53 - The LM_LICENSE_FILE environment variable is not set.
-INFO:Security:68a - user is sina, on host DESKTOP-8H0ML4R.
-WARNING:Security:43 - No license file was found in the standard Xilinx license directory.
-WARNING:Security:44 - Since no license file was found,
- please run the Xilinx License Configuration Manager
- (xlcm or "Manage Xilinx Licenses")
- to assist in obtaining a license.
-ERROR:Security:14 - No feature was available for 'ISIM'.
-
-No such feature exists.
-Feature: ISIM
-License path: C:/.Xilinx;C:\Xilinx\14.7\ISE_DS\ISE\/coregen/core_licenses\Xilinx.lic;C:\Xilinx\14.7\ISE_DS\ISE\/coregen/core_licenses\XilinxFree.lic;C:\Xilinx\14.7\ISE_DS\EDK/data/core_licenses\Xilinx.lic;
-FLEXnet Licensing error:-5,357
-For further information, refer to the FLEXnet Licensing documentation,
-available at "www.flexerasoftware.com".
-----------------------------------------------------------------------
-WARNING: A full ISim License cannot be checked out due to the issues listed above. Please use Xilinx License Configuration Manager to fix these issues in order to check out a full ISim license.
-WARNING: ISim will run in Lite mode. Please refer to the ISim documentation for more information on the differences between the Lite and the Full version.
-This is a Lite version of ISim.
-Time resolution is 1 ps
-# onerror resume
-# wave add /
-# run 1000 ns
-Simulator is doing circuit initialization process.
-Stopped at time : 0 fs : File "C:/Users/sina/Desktop/HyperDbg/clkr/clkr/Top.vhd" Line 59
diff --git a/clkr/xilinxsim.ini b/clkr/xilinxsim.ini
deleted file mode 100644
index 600496d..0000000
--- a/clkr/xilinxsim.ini
+++ /dev/null
@@ -1 +0,0 @@
-work=isim/work
diff --git a/project/build.properties b/project/build.properties
new file mode 100644
index 0000000..b19d4e1
--- /dev/null
+++ b/project/build.properties
@@ -0,0 +1 @@
+sbt.version = 1.9.7
diff --git a/project/plugins.sbt b/project/plugins.sbt
new file mode 100644
index 0000000..5708f81
--- /dev/null
+++ b/project/plugins.sbt
@@ -0,0 +1 @@
+logLevel := Level.Warn
diff --git a/src/main/scala/gcd/DecoupledGCD.scala b/src/main/scala/gcd/DecoupledGCD.scala
new file mode 100644
index 0000000..1cd2993
--- /dev/null
+++ b/src/main/scala/gcd/DecoupledGCD.scala
@@ -0,0 +1,73 @@
+// See README.md for license details.
+
+package gcd
+
+import chisel3._
+import chisel3.util.Decoupled
+
+class GcdInputBundle(val w: Int) extends Bundle {
+ val value1 = UInt(w.W)
+ val value2 = UInt(w.W)
+}
+
+class GcdOutputBundle(val w: Int) extends Bundle {
+ val value1 = UInt(w.W)
+ val value2 = UInt(w.W)
+ val gcd = UInt(w.W)
+}
+
+/**
+ * Compute Gcd using subtraction method.
+ * Subtracts the smaller from the larger until register y is zero.
+ * value input register x is then the Gcd.
+ * Unless first input is zero then the Gcd is y.
+ * Can handle stalls on the producer or consumer side
+ */
+class DecoupledGcd(width: Int) extends Module {
+ val input = IO(Flipped(Decoupled(new GcdInputBundle(width))))
+ val output = IO(Decoupled(new GcdOutputBundle(width)))
+
+ val xInitial = Reg(UInt())
+ val yInitial = Reg(UInt())
+ val x = Reg(UInt())
+ val y = Reg(UInt())
+ val busy = RegInit(false.B)
+ val resultValid = RegInit(false.B)
+
+ input.ready := ! busy
+ output.valid := resultValid
+ output.bits := DontCare
+
+ when(busy) {
+ when(x > y) {
+ x := x - y
+ }.otherwise {
+ y := y - x
+ }
+ when(x === 0.U || y === 0.U) {
+ when(x === 0.U) {
+ output.bits.gcd := y
+ }.otherwise {
+ output.bits.gcd := x
+ }
+
+ output.bits.value1 := xInitial
+ output.bits.value2 := yInitial
+ resultValid := true.B
+
+ when(output.ready && resultValid) {
+ busy := false.B
+ resultValid := false.B
+ }
+ }
+ }.otherwise {
+ when(input.valid) {
+ val bundle = input.deq()
+ x := bundle.value1
+ y := bundle.value2
+ xInitial := bundle.value1
+ yInitial := bundle.value2
+ busy := true.B
+ }
+ }
+}
diff --git a/src/main/scala/gcd/GCD.scala b/src/main/scala/gcd/GCD.scala
new file mode 100644
index 0000000..07e434c
--- /dev/null
+++ b/src/main/scala/gcd/GCD.scala
@@ -0,0 +1,34 @@
+// See README.md for license details.
+
+package gcd
+
+import chisel3._
+
+/**
+ * Compute GCD using subtraction method.
+ * Subtracts the smaller from the larger until register y is zero.
+ * value in register x is then the GCD
+ */
+class GCD extends Module {
+ val io = IO(new Bundle {
+ val value1 = Input(UInt(16.W))
+ val value2 = Input(UInt(16.W))
+ val loadingValues = Input(Bool())
+ val outputGCD = Output(UInt(16.W))
+ val outputValid = Output(Bool())
+ })
+
+ val x = Reg(UInt())
+ val y = Reg(UInt())
+
+ when(x > y) { x := x - y }
+ .otherwise { y := y - x }
+
+ when(io.loadingValues) {
+ x := io.value1
+ y := io.value2
+ }
+
+ io.outputGCD := x
+ io.outputValid := y === 0.U
+}
diff --git a/src/test/scala/gcd/GCDSpec.scala b/src/test/scala/gcd/GCDSpec.scala
new file mode 100644
index 0000000..e8c7ce8
--- /dev/null
+++ b/src/test/scala/gcd/GCDSpec.scala
@@ -0,0 +1,68 @@
+// See README.md for license details.
+
+package gcd
+
+import chisel3._
+import chisel3.experimental.BundleLiterals._
+import chisel3.simulator.EphemeralSimulator._
+import org.scalatest.freespec.AnyFreeSpec
+import org.scalatest.matchers.must.Matchers
+
+/**
+ * This is a trivial example of how to run this Specification
+ * From within sbt use:
+ * {{{
+ * testOnly gcd.GCDSpec
+ * }}}
+ * From a terminal shell use:
+ * {{{
+ * sbt 'testOnly gcd.GCDSpec'
+ * }}}
+ * Testing from mill:
+ * {{{
+ * mill %NAME%.test.testOnly gcd.GCDSpec
+ * }}}
+ */
+class GCDSpec extends AnyFreeSpec with Matchers {
+
+ "Gcd should calculate proper greatest common denominator" in {
+ simulate(new DecoupledGcd(16)) { dut =>
+ val testValues = for { x <- 0 to 10; y <- 0 to 10} yield (x, y)
+ val inputSeq = testValues.map { case (x, y) => (new GcdInputBundle(16)).Lit(_.value1 -> x.U, _.value2 -> y.U) }
+ val resultSeq = testValues.map { case (x, y) =>
+ (new GcdOutputBundle(16)).Lit(_.value1 -> x.U, _.value2 -> y.U, _.gcd -> BigInt(x).gcd(BigInt(y)).U)
+ }
+
+ dut.reset.poke(true.B)
+ dut.clock.step()
+ dut.reset.poke(false.B)
+ dut.clock.step()
+
+ var sent, received, cycles: Int = 0
+ while (sent != 100 && received != 100) {
+ assert(cycles <= 1000, "timeout reached")
+
+ if (sent < 100) {
+ dut.input.valid.poke(true.B)
+ dut.input.bits.value1.poke(testValues(sent)._1.U)
+ dut.input.bits.value2.poke(testValues(sent)._2.U)
+ if (dut.input.ready.peek().litToBoolean) {
+ sent += 1
+ }
+ }
+
+ if (received < 100) {
+ dut.output.ready.poke(true.B)
+ if (dut.output.valid.peekValue().asBigInt == 1) {
+ dut.output.bits.gcd.expect(BigInt(testValues(received)._1).gcd(testValues(received)._2))
+ received += 1
+ }
+ }
+
+ // Step the simulation forward.
+ dut.clock.step()
+ cycles += 1
+ }
+ }
+ }
+}