T. Meissner 83bea18388 | 9 years ago | |
---|---|---|
common | 9 years ago | |
sim | 9 years ago | |
syn | 9 years ago | |
test | 9 years ago | |
.gitignore | 10 years ago | |
LICENSE.md | 10 years ago | |
README.md | 9 years ago |
A OHDL licensed library of reusable components for VHDL designs and testbenches
##sim (Non) synthesible components for testbenches
Package with various assertion procedures.
assert_true(x[, str, level])
checks if boolean x = falseassert_false(x[, str, level])
checks if boolean x = falseassert_equal(x, y[, str, level])
checks if x = yassert_unequal(x, y[, str, level])
checks if x /= yAll of the assert_* procedures have following optional parameters:
str
print string str to console instead implemented onelevel
severity level (note, warning, error, failure)Package with various components general useful for simulation
wait_cycles(x, n)
waits for n rising edges on std_logic signal xspi_master()
configurable master for SPI protocol, supports all cpol/cpha modesspi_slave()
configurable slave for SPI protocol, supports all cpol/cpha modesPackage with various implementations of queue types:
t_simple_queue
simple array based FIFO queuet_list_queue
linked list FIFO queue using access typesPackage with implementation of dictionary (aka associative array) type:
t_dict
linked list dictionary using access typesSynthesizable components for implementing in FPGA
Configurable SPI master with support modes 0-3 and simple VAI local backend.
Configurable SPI slave with support modes 0-3 and simple VAI local backend.
Simple WishBone bus master with support of classic single write & read
Simple WishBone bus slave with support of classic single write & read and register backend
##test Unit tests for each component
Unit tests for components of QueueP package
Unit tests for components of SimP package
Unit tests for SpiMasterE and SpiSlaveE components
Unit tests for WishBoneMasterE and WishBoneSlaveE components
Common utilities
Common functions useful for simulation/synthesis
and_reduce(x)
returns and of all items in x, collapsed to one std_logic/booleanor_reduce(x)
returns or of all items in x, collapsed to one std_logic/booleanxor_reduce(x)
returns xor of items in x, collapsed to one std_logiceven_parity(x)
returns even parity of xodd_parity(x)
returns odd parity of xcount_ones(x)
returns number of '1' in xone_hot(x)
returns true if x is one-hot coded, false otherwiseis_unknown(x)
returns true if x contains 'U' bit, false otherwiseuint_to_slv(x, l)
returns std_logic_vector (unsigned) with length l converted from x (natural)slv_to_uint(x)
returns natural converted from x (std_logic_vector) (unsigned)uint_bitsize(x)
returns number of bits needed for given x (natural)To run the tests, you have to install GHDL. You can get it from http://sourceforge.net/projects/ghdl-updates/.
If you use the 0.31 version of GHDL, you need the VHDL-2008 proposed packages because libvhdl uses various VHDL-2008 features. To get the needed files, you can use the get_vhdl_2008.sh script which downloads the files into the vhdl_2008 folder and patches the env_c.vhdl file to get in compiled with GHDL.
If you build GHDL from actual source or use another simulator with VHDL-2008 support, you don't need these packages. Instead you have to outcomment the references to these packages from the source files.
libvhdl also uses the OSVVM library to generate random data for the unit tests. We use version OSVVM version 2014.01. You can find it under the OSVVM folder in the test/ directory. If you use another simulator with full OSVVM support, you can download newer versions of the library from http://osvvm.org.
Another useful tool is GTKWave, install it if you want to use the waveform files generated by some of the tests.
Type make
to do all tests. You should see the successfully running tests like this:
$ make
ghdl -a --std=02 ../sim/QueueP.vhd QueueT.vhd
ghdl -e --std=02 QueueT
ghdl -r --std=02 QueueT
QueueT.vhd:52:5:@0ms:(report note): INFO: t_simple_queue test finished successfully
QueueT.vhd:87:5:@0ms:(report note): INFO: t_list_queue test finished successfully