| ▼ documentation | |
| ► bambu101 | |
| ► basic_usage | |
| icrc.c | |
| ► IP_Integration | |
| ► module_lib | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► everest_summer_school | |
| ► Exercise1 | |
| icrc.c | |
| ► Exercise3 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Exercise4 | |
| ap_example.cpp | |
| ► tutorial_date_2022 | |
| ► 01-introduction | |
| ► Exercise1 | |
| icrc.c | |
| ► Exercise2 | |
| ► solution | |
| minmax.c | |
| ► Exercise4 | |
| proxies.c | |
| ► Exercise5 | |
| LUdecomposition.c | |
| ► Exercise6 | |
| main_test.c | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► Exercise7 | |
| aggregate.h | |
| less.c | |
| qsort.c | |
| test.c | |
| ► Exercise8 | |
| Keccak.c | |
| ► Exercise9 | |
| tree.c | |
| ► 03-optimizations | |
| ► Exercise1 | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► Exercise3 | |
| ► solution | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► Exercise4 | |
| ► solution | |
| module.c | |
| test_panda.py | |
| ► 04-simd | |
| ► Exercise1 | |
| histogram.c | |
| histogram.h | |
| ► Exercise2 | |
| histogram.c | |
| histogram.h | |
| ► Exercise3 | |
| histogram.c | |
| histogram.h | |
| ► 05-context-switch | |
| ► Exercise1 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Exercise2 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Exercise3 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Exercise4 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► tutorial_fpl_2017 | |
| ► lab2 | |
| ► materials | |
| ► 2.1 | |
| hint.c | |
| ► 2.2 | |
| module.c | |
| ► 2.3 | |
| module.c | |
| ► 2.4 | |
| adpcm.c | |
| ► 2.5 | |
| adpcm.c | |
| ► 2.6 | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► solutions | |
| ► 2.1 | |
| module.c | |
| ► 2.2 | |
| module.c | |
| ► 2.3 | |
| module.c | |
| ► 2.4 | |
| adpcm.c | |
| ► 2.5 | |
| adpcm.c | |
| ► 2.6 | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► 2.7 | |
| module.c | |
| test_panda.py | |
| ► lab3 | |
| ► materials | |
| ► 3.1 | |
| adpcm.c | |
| ► 3.2 | |
| adpcm.c | |
| ► 3.3 | |
| imem.h | |
| mips.c | |
| ► 3.4 | |
| imem.h | |
| mips.c | |
| ► 3.5 | |
| imem.h | |
| mips.c | |
| ► 3.6 | |
| imem.h | |
| mips.c | |
| ► solutions | |
| ► 3.1 | |
| adpcm.c | |
| ► 3.2 | |
| adpcm.c | |
| ► 3.3 | |
| imem.h | |
| mips.c | |
| ► 3.4 | |
| imem.h | |
| mips.c | |
| ► 3.5 | |
| imem.h | |
| mips.c | |
| ► 3.6 | |
| imem.h | |
| mips.c | |
| ► lab4 | |
| ► materials | |
| ► 4.1 | |
| checksum.c | |
| checksum.h | |
| main.c | |
| ► 4.2 | |
| main.c | |
| operations.c | |
| ► lab5 | |
| ► materials | |
| ► 5.1 | |
| module.c | |
| ► solutions | |
| ► 5.1 | |
| module.c | |
| ► tutorial_fpl_2022 | |
| ► 01-introduction | |
| ► Exercise1 | |
| icrc.c | |
| ► Exercise2 | |
| ► solution | |
| minmax.c | |
| ► Exercise4 | |
| proxies.c | |
| ► Exercise5 | |
| LUdecomposition.c | |
| ► Exercise5a | |
| common.h | |
| helm.c | |
| ► Exercise6 | |
| main_test.c | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► Exercise7 | |
| aggregate.h | |
| less.c | |
| qsort.c | |
| test.c | |
| ► Exercise8 | |
| Keccak.c | |
| ► Exercise9 | |
| tree.c | |
| ► 03-optimizations | |
| ► Exercise1 | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► Exercise3 | |
| ► solution | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► Exercise4 | |
| module.c | |
| ► Exercise5 | |
| ► solution | |
| module.c | |
| ► Exercise6 | |
| module.c | |
| test_panda.py | |
| ► 04-axi | |
| ► Exercise1 | |
| read.c | |
| ► Exercise2 | |
| sum.c | |
| ► Exercise3 | |
| maxNumbers.c | |
| ► tutorial_fpt_2017 | |
| ► debugging | |
| ► first | |
| main.c | |
| operations.c | |
| ► intro | |
| ► fifth | |
| main_test.c | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► first | |
| module.c | |
| ► fourth | |
| module.c | |
| ► second | |
| module.c | |
| ► sixth | |
| aggregate.h | |
| less.c | |
| qsort.c | |
| test.c | |
| ► third | |
| ► include | |
| Keccak.h | |
| ► src | |
| ► chi | |
| chi.c | |
| ► iota | |
| iota.c | |
| ► pi | |
| pi.c | |
| ► rho | |
| rho.c | |
| ► theta | |
| theta.c | |
| keccak_coproc.c | |
| ► memory | |
| ► fifth | |
| ► solution | |
| imem.h | |
| mips.c | |
| imem.h | |
| mips.c | |
| ► first | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► fourth | |
| ► solution | |
| imem.h | |
| mips.c | |
| imem.h | |
| mips.c | |
| ► second | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► sixth | |
| ► solution | |
| imem.h | |
| mips.c | |
| imem.h | |
| mips.c | |
| ► third | |
| ► solution | |
| imem.h | |
| mips.c | |
| imem.h | |
| mips.c | |
| ► optimizations | |
| ► first | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► fourth | |
| ► solution | |
| module.c | |
| test_panda.py | |
| ► second | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► third | |
| ► solution | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► target | |
| ► first | |
| ► solution | |
| module.c | |
| hint.c | |
| ► second | |
| ► solution | |
| module.c | |
| module.c | |
| ► third | |
| ► solution | |
| module.c | |
| module.c | |
| ► tutorial_hpca_2023 | |
| ► 01-introduction | |
| ► Exercise1 | |
| icrc.c | |
| ► Exercise2 | |
| ► solution | |
| minmax.c | |
| ► Exercise4 | |
| proxies.c | |
| ► Exercise5 | |
| LUdecomposition.c | |
| ► Exercise5a | |
| common.h | |
| helm.c | |
| ► Exercise6 | |
| main_test.c | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► Exercise7 | |
| aggregate.h | |
| less.c | |
| qsort.c | |
| test.c | |
| ► Exercise8 | |
| Keccak.c | |
| ► Exercise9 | |
| tree.c | |
| ► 03-optimizations | |
| ► Exercise1 | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► Exercise3 | |
| ► solution | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► Exercise4 | |
| module.c | |
| ► Exercise5 | |
| ► solution | |
| module.c | |
| ► Exercise6 | |
| module.c | |
| test_panda.py | |
| ► 04-axi | |
| ► Exercise1 | |
| read.c | |
| ► Exercise2 | |
| sum.c | |
| ► Exercise3 | |
| maxNumbers.c | |
| ► Exercise4 | |
| mmult.c | |
| ► tutorial_ics_2021 | |
| ► 01-introduction | |
| ► Exercise1 | |
| icrc.c | |
| ► Exercise2 | |
| tree.c | |
| ► Exercise3 | |
| Keccak.c | |
| ► Exercise4 | |
| LUdecomposition.c | |
| ► Exercise5 | |
| main_test.c | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► Exercise6 | |
| aggregate.h | |
| less.c | |
| qsort.c | |
| test.c | |
| ► 02-target_customization | |
| ► Exercise1 | |
| ► solution | |
| minmax.c | |
| hint.c | |
| ► 03-optimizations | |
| ► Exercise1 | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► Exercise3 | |
| ► solution | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► Exercise4 | |
| ► solution | |
| module.c | |
| test_panda.py | |
| ► 04-simd | |
| ► Exercise1 | |
| histogram.c | |
| histogram.h | |
| ► Exercise2 | |
| histogram.c | |
| histogram.h | |
| ► Exercise3 | |
| histogram.c | |
| histogram.h | |
| ► 05-context-switch | |
| ► Exercise1 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Exercise2 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Exercise3 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Exercise4 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► tutorial_isc_2022 | |
| ► 01-introduction | |
| ► Exercise1 | |
| icrc.c | |
| ► Exercise2 | |
| ► solution | |
| minmax.c | |
| ► Exercise4 | |
| proxies.c | |
| ► Exercise5 | |
| LUdecomposition.c | |
| ► Exercise5a | |
| common.h | |
| helm.c | |
| ► Exercise6 | |
| main_test.c | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► Exercise7 | |
| aggregate.h | |
| less.c | |
| qsort.c | |
| test.c | |
| ► Exercise8 | |
| Keccak.c | |
| ► Exercise9 | |
| tree.c | |
| ► 03-optimizations | |
| ► Exercise1 | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► Exercise3 | |
| ► solution | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► Exercise4 | |
| ► solution | |
| module.c | |
| test_panda.py | |
| ► 04-simd | |
| ► Exercise1 | |
| histogram.c | |
| histogram.h | |
| ► Exercise2 | |
| histogram.c | |
| histogram.h | |
| ► Exercise3 | |
| histogram.c | |
| histogram.h | |
| ► 05-context-switch | |
| ► Exercise1 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Exercise2 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Exercise3 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Exercise4 | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► tutorial_isc_2023 | |
| ► 01-introduction | |
| ► Exercise1 | |
| icrc.c | |
| ► Exercise2 | |
| ► solution | |
| minmax.c | |
| ► Exercise4 | |
| proxies.c | |
| ► Exercise5 | |
| LUdecomposition.c | |
| ► Exercise5a | |
| common.h | |
| helm.c | |
| ► Exercise6 | |
| main_test.c | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► Exercise7 | |
| aggregate.h | |
| less.c | |
| qsort.c | |
| test.c | |
| ► Exercise8 | |
| Keccak.c | |
| ► Exercise9 | |
| tree.c | |
| ► 03-optimizations | |
| ► Exercise1 | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► Exercise3 | |
| ► solution | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► Exercise4 | |
| module.c | |
| ► Exercise5 | |
| ► solution | |
| module.c | |
| ► Exercise6 | |
| module.c | |
| test_panda.py | |
| ► 04-axi | |
| ► Exercise1 | |
| read.c | |
| ► Exercise2 | |
| sum.c | |
| ► Exercise3 | |
| maxNumbers.c | |
| ► Exercise4 | |
| mmult.c | |
| ► tutorial_pact_2019 | |
| ► Context-Switch | |
| ► first | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► fourth | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► second | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► third | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► Introduction | |
| ► fifth | |
| main_test.c | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► first | |
| module.c | |
| ► fourth | |
| module.c | |
| ► second | |
| module.c | |
| ► sixth | |
| aggregate.h | |
| less.c | |
| qsort.c | |
| test.c | |
| ► third | |
| ► include | |
| Keccak.h | |
| ► src | |
| ► chi | |
| chi.c | |
| ► iota | |
| iota.c | |
| ► pi | |
| pi.c | |
| ► rho | |
| rho.c | |
| ► theta | |
| theta.c | |
| keccak_coproc.c | |
| ► Optimization | |
| ► first | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► fourth | |
| ► solution | |
| module.c | |
| test_panda.py | |
| ► second | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► third | |
| ► solution | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► SIMD | |
| ► first | |
| histogram.c | |
| histogram.h | |
| ► second | |
| histogram.c | |
| histogram.h | |
| ► third | |
| histogram.c | |
| histogram.h | |
| ► Target-Customization | |
| ► first | |
| ► solution | |
| module.c | |
| hint.c | |
| ► second | |
| ► solution | |
| module.c | |
| module.c | |
| ► third | |
| ► solution | |
| module.c | |
| module.c | |
| ► tutorial_pact_2022 | |
| ► 01-introduction | |
| ► Exercise1 | |
| icrc.c | |
| ► Exercise2 | |
| ► solution | |
| minmax.c | |
| ► Exercise4 | |
| proxies.c | |
| ► Exercise5 | |
| LUdecomposition.c | |
| ► Exercise5a | |
| common.h | |
| helm.c | |
| ► Exercise6 | |
| main_test.c | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► Exercise7 | |
| aggregate.h | |
| less.c | |
| qsort.c | |
| test.c | |
| ► Exercise8 | |
| Keccak.c | |
| ► Exercise9 | |
| tree.c | |
| ► 03-optimizations | |
| ► Exercise1 | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► Exercise3 | |
| ► solution | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► Exercise4 | |
| ► solution | |
| module.c | |
| test_panda.py | |
| ► 04-simd | |
| ► Exercise1 | |
| histogram.c | |
| histogram.h | |
| ► Exercise2 | |
| histogram.c | |
| histogram.h | |
| ► Exercise3 | |
| histogram.c | |
| histogram.h | |
| ► tutorial_pnnl_2019 | |
| ► intro | |
| ► first | |
| module.c | |
| ► memory | |
| ► fifth | |
| ► solution | |
| imem.h | |
| mips.c | |
| imem.h | |
| mips.c | |
| ► first | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► fourth | |
| ► solution | |
| imem.h | |
| mips.c | |
| imem.h | |
| mips.c | |
| ► second | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► sixth | |
| ► solution | |
| imem.h | |
| mips.c | |
| imem.h | |
| mips.c | |
| ► third | |
| ► solution | |
| imem.h | |
| mips.c | |
| imem.h | |
| mips.c | |
| ► optimizations | |
| ► first | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ► second | |
| ► solution | |
| adpcm.c | |
| adpcm.c | |
| ▼ examples | |
| ► add_device_simple | |
| module.c | |
| ► arf | |
| module.c | |
| ► arf_res_sharing | |
| module.c | |
| ► breakout | |
| btn_ctrl.c | |
| btn_ctrl.h | |
| get_ticks.c | |
| get_ticks.h | |
| main.c | |
| plot.c | |
| plot.h | |
| sevensegments_ctrl.c | |
| sevensegments_ctrl.h | |
| ► CHStone | |
| ► CHStone | |
| ► adpcm | |
| adpcm.c | |
| ► aes | |
| aes.c | |
| aes.h | |
| aes_dec.c | |
| aes_enc.c | |
| aes_func.c | |
| aes_key.c | |
| ► blowfish | |
| bf.c | |
| bf_cfb64.c | |
| bf_enc.c | |
| bf_locl.h | |
| bf_pi.h | |
| bf_skey.c | |
| blowfish.h | |
| ► dfadd | |
| dfadd.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► dfdiv | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► dfmul | |
| dfmul.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► dfsin | |
| dfsin.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► gsm | |
| add.c | |
| gsm.c | |
| lpc.c | |
| private.h | |
| ► jpeg | |
| chenidct.c | |
| decode.c | |
| decode.h | |
| global.h | |
| huffman.c | |
| huffman.h | |
| init.h | |
| jfif_read.c | |
| jpeg2bmp.c | |
| main.c | |
| marker.c | |
| ► mips | |
| imem.h | |
| mips.c | |
| ► motion | |
| config.h | |
| getbits.c | |
| getvlc.c | |
| getvlc.h | |
| global.h | |
| motion.c | |
| mpeg2.c | |
| mpeg2dec.h | |
| ► sha | |
| sha.c | |
| sha.h | |
| sha_driver.c | |
| ► cpp_examples | |
| ► fir_filter | |
| coef1.cpp | |
| ► gcd_example | |
| gcd.cc | |
| ► Xilinx_Examples | |
| ► Math | |
| ► atan2_cordic | |
| cordic.h | |
| cordic_atan2.cpp | |
| cordic_test.cpp | |
| read_file.h | |
| ► fp_accum | |
| fp_accum.cpp | |
| ► squared_difference_accumulate | |
| ► src | |
| diff_sq_acc.cpp | |
| diff_sq_acc.h | |
| ► tb | |
| diff_sq_acc_tb.cpp | |
| ► crc | |
| spec.c | |
| ► crypto_designs | |
| ► multi-keccak | |
| ► include | |
| Keccak.h | |
| ► src | |
| ► chi | |
| chi.c | |
| ► iota | |
| iota.c | |
| ► pi | |
| pi.c | |
| ► rho | |
| rho.c | |
| ► theta | |
| theta.c | |
| keccak_coproc.c | |
| tb_keccak.c | |
| Keccak.c | |
| ► discrepancy-parallel | |
| ► blackscholes | |
| black_scholes.c | |
| black_scholes.h | |
| fixedptc.c | |
| fixedptc.h | |
| main.c | |
| ► dfdiv | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► dfsin | |
| dfsin.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► hash | |
| hash.c | |
| hash.h | |
| ► los | |
| los.c | |
| los.h | |
| ► mandelbrot | |
| mandelbrot.c | |
| ► mcml | |
| fixedptc.c | |
| fixedptc.h | |
| tiny_fixed.c | |
| tiny_fixed.h | |
| ► fft_example | |
| fft_float.c | |
| ► file_simulate | |
| module.c | |
| ► fortran | |
| euclid.copy.f | |
| euclid.f | |
| ► function_pointers | |
| ► bsearch | |
| ► glibc | |
| aggregate.h | |
| bsearch-specialized.c | |
| bsearch.c | |
| less.c | |
| test-specialized.c | |
| test.c | |
| ► musl | |
| aggregate.h | |
| bsearch-specialized.c | |
| bsearch.c | |
| less.c | |
| test-specialized.c | |
| test.c | |
| ► newlib | |
| aggregate.h | |
| bsearch-specialized.c | |
| bsearch.c | |
| less.c | |
| test-specialized.c | |
| test.c | |
| ► uclibc | |
| aggregate.h | |
| bsearch-specialized.c | |
| bsearch.c | |
| less.c | |
| test-specialized.c | |
| test.c | |
| tb.c | |
| ► filtering_pipeline | |
| filter.c | |
| filter.h | |
| inverse.c | |
| laplacian.c | |
| main.c | |
| mypgm.c | |
| mypgm.h | |
| sharpen.c | |
| sobel.c | |
| test.c | |
| ► qsort | |
| ► glibc | |
| aggregate.h | |
| less.c | |
| qsort-specialized.c | |
| qsort.c | |
| test-specialized.c | |
| test.c | |
| ► musl | |
| atomic.h | |
| less.c | |
| qsort-specialized.c | |
| qsort.c | |
| test-specialized.c | |
| test.c | |
| ► uclibc | |
| aggregate.h | |
| less.c | |
| qsort-specialized.c | |
| qsort.c | |
| test-specialized.c | |
| test.c | |
| tb.c | |
| ► simple_raytrace | |
| simple_raytrace.c | |
| ► hls_study | |
| ► adpcm_encode | |
| ► not-optimized | |
| adpcm.c | |
| ► optimized | |
| adpcm.c | |
| ► aes_decrypt | |
| ► not-optimized | |
| aes.c | |
| aes.h | |
| aes_dec.c | |
| aes_enc.c | |
| aes_func.c | |
| aes_key.c | |
| ► optimized | |
| aes.c | |
| aes.h | |
| aes_dec.c | |
| aes_enc.c | |
| aes_func.c | |
| aes_key.c | |
| ► aes_encrypt | |
| ► not-optimized | |
| aes.c | |
| aes.h | |
| aes_dec.c | |
| aes_enc.c | |
| aes_func.c | |
| aes_key.c | |
| ► optimized | |
| aes.c | |
| aes.h | |
| aes_dec.c | |
| aes_enc.c | |
| aes_func.c | |
| aes_key.c | |
| ► bellmanford | |
| ► not-optimized | |
| bellmanford.c | |
| ► optimized | |
| bellmanford.c | |
| ► blowfish-BF_cfb64_encrypt | |
| ► not-optimized | |
| bf.c | |
| bf_cfb64.c | |
| bf_enc.c | |
| bf_locl.h | |
| bf_pi.h | |
| bf_skey.c | |
| blowfish.h | |
| ► optimized | |
| bf.c | |
| bf_cfb64.c | |
| bf_enc.c | |
| bf_locl.h | |
| bf_pi.h | |
| bf_skey.c | |
| blowfish.h | |
| ► optimized-area | |
| bf.c | |
| bf_cfb64.c | |
| bf_enc.c | |
| bf_locl.h | |
| bf_pi.h | |
| bf_skey.c | |
| blowfish.h | |
| ► dfadd | |
| ► not-optimized | |
| dfadd.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► optimized | |
| dfadd.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► dfdiv | |
| ► not-optimized | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► optimized | |
| dfdiv.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► dfmul | |
| ► not-optimized | |
| dfmul.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► optimized | |
| dfmul.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► dfsin | |
| ► not-optimized | |
| dfsin.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► optimized | |
| dfsin.c | |
| milieu.h | |
| softfloat.c | |
| softfloat.h | |
| SPARC-GCC.h | |
| ► gsm | |
| ► not-optimized | |
| add.c | |
| gsm.c | |
| lpc.c | |
| private.h | |
| ► optimized | |
| add.c | |
| gsm.c | |
| lpc.c | |
| private.h | |
| ► jpeg | |
| ► not-optimized | |
| chenidct.c | |
| decode.c | |
| decode.h | |
| global.h | |
| huffman.c | |
| huffman.h | |
| init.h | |
| jfif_read.c | |
| jpeg2bmp.c | |
| main.c | |
| marker.c | |
| ► optimized | |
| chenidct.c | |
| decode.c | |
| decode.h | |
| global.h | |
| huffman.c | |
| huffman.h | |
| init.h | |
| jfif_read.c | |
| jpeg2bmp.c | |
| main.c | |
| marker.c | |
| ► mips | |
| ► not-optimized | |
| imem.h | |
| mips.c | |
| ► optimized | |
| imem.h | |
| mips.c | |
| ► mm | |
| ► not-optimized | |
| module.c | |
| module.h | |
| tb.c | |
| ► optimized | |
| module.c | |
| module.h | |
| ► motion | |
| ► not-optimized | |
| config.h | |
| getbits.c | |
| getvlc.c | |
| getvlc.h | |
| global.h | |
| motion.c | |
| mpeg2.c | |
| mpeg2dec.h | |
| ► optimized | |
| config.h | |
| getbits.c | |
| getvlc.c | |
| getvlc.h | |
| global.h | |
| motion.c | |
| mpeg2.c | |
| mpeg2dec.h | |
| ► satd | |
| ► not-optimized | |
| main.c | |
| ► optimized | |
| main.c | |
| ► sha | |
| ► not-optimized | |
| sha.c | |
| sha.h | |
| sha_driver.c | |
| ► optimized | |
| sha.c | |
| sha.h | |
| sha_driver.c | |
| ► sobel | |
| ► not-optimized | |
| sobel.c | |
| ► optimized | |
| sobel.c | |
| ► sobel-legup | |
| sobel.c | |
| ► sobel-legup2 | |
| sobel.c | |
| ► IP_integration | |
| main_test.c | |
| module1.c | |
| module2.c | |
| module_lib.h | |
| printer1.c | |
| printer2.c | |
| top.c | |
| ► led_example | |
| btn_ctrl.c | |
| btn_ctrl.h | |
| led_example.c | |
| leds_ctrl.c | |
| leds_ctrl.h | |
| sevensegments_ctrl.c | |
| sevensegments_ctrl.h | |
| sw_ctrl.c | |
| sw_ctrl.h | |
| ► libm | |
| libm-test.c | |
| test-float.c | |
| ► MachSuite | |
| ► MachSuite | |
| ► aes | |
| ► aes | |
| aes.c | |
| aes.h | |
| aes_test.c | |
| generate.c | |
| local_support.c | |
| ► backprop | |
| ► backprop | |
| backprop.c | |
| backprop.h | |
| generate.c | |
| local_support.c | |
| ► bfs | |
| ► bulk | |
| bfs.c | |
| bfs.h | |
| generate.c | |
| local_support.c | |
| matspy.py | |
| ► queue | |
| bfs.c | |
| bfs.h | |
| generate.c | |
| local_support.c | |
| ► common | |
| ► test | |
| test_support.c | |
| harness.c | |
| support.c | |
| support.h | |
| ► fft | |
| ► strided | |
| fft.c | |
| fft.h | |
| fft_test.c | |
| generate.c | |
| local_support.c | |
| ► transpose | |
| fft.c | |
| fft.h | |
| fft_test.c | |
| generate.c | |
| local_support.c | |
| ► gemm | |
| ► blocked | |
| gemm.c | |
| gemm.h | |
| generate.c | |
| local_support.c | |
| ► ncubed | |
| gemm.c | |
| gemm.h | |
| generate.c | |
| local_support.c | |
| ► kmp | |
| ► kmp | |
| generate.c | |
| kmp.c | |
| kmp.h | |
| kmp_test.c | |
| local_support.c | |
| TR.h | |
| ► md | |
| ► grid | |
| generate.c | |
| local_support.c | |
| md.c | |
| md.h | |
| ► knn | |
| generate.c | |
| local_support.c | |
| md.c | |
| md.h | |
| md_kernel_test.c | |
| point_stats.py | |
| ► nw | |
| ► nw | |
| generate.c | |
| local_support.c | |
| nw.c | |
| nw.h | |
| nw_test.c | |
| ► sort | |
| ► merge | |
| generate.c | |
| local_support.c | |
| sort.c | |
| sort.h | |
| ► radix | |
| generate.c | |
| local_support.c | |
| sort.c | |
| sort.h | |
| ► spmv | |
| ► crs | |
| generate.c | |
| local_support.c | |
| spmv.c | |
| spmv.h | |
| spmv_test.c | |
| symmetry.py | |
| ► ellpack | |
| generate.c | |
| local_support.c | |
| spmv.c | |
| spmv.h | |
| spmv_test.c | |
| ► stencil | |
| ► stencil2d | |
| generate.c | |
| local_support.c | |
| stencil.c | |
| stencil.h | |
| ► stencil3d | |
| generate.c | |
| local_support.c | |
| stencil.c | |
| stencil.h | |
| ► templates | |
| support.c | |
| ► viterbi | |
| ► viterbi | |
| generate.c | |
| local_support.c | |
| viterbi.c | |
| viterbi.h | |
| ► mm | |
| module.c | |
| ► mm_float | |
| module.c | |
| ► omp_simd | |
| ► add | |
| ► extracted | |
| add.c | |
| add.h | |
| ► modified | |
| add.c | |
| add.h | |
| ► original | |
| add.c | |
| add.h | |
| ► blackscholes | |
| ► inlined | |
| black_scholes.c | |
| black_scholes.h | |
| fixedptc.c | |
| fixedptc.h | |
| main.c | |
| seed.h | |
| ► modified | |
| black_scholes.c | |
| black_scholes.h | |
| fixedptc.c | |
| fixedptc.h | |
| main.c | |
| seed.h | |
| ► original | |
| black_scholes.c | |
| black_scholes.h | |
| fixedptc.c | |
| fixedptc.h | |
| main.c | |
| seed.h | |
| ► reduced | |
| black_scholes.c | |
| black_scholes.h | |
| fixedptc.c | |
| fixedptc.h | |
| main.c | |
| seed.h | |
| ► boxfilter | |
| ► modified | |
| boxfilter.c | |
| boxfilter.h | |
| ► original | |
| boxfilter.c | |
| boxfilter.h | |
| ► dotproduct | |
| ► modified | |
| dotproduct.c | |
| dotproduct.h | |
| ► original | |
| dotproduct.c | |
| dotproduct.h | |
| ► histogram | |
| ► modified | |
| histogram.c | |
| histogram.h | |
| ► original | |
| histogram.c | |
| histogram.h | |
| ► mandelbrot | |
| ► modified | |
| mandelbrot.c | |
| ► original | |
| mandelbrot.c | |
| ► perfecthash | |
| ► modified | |
| perfecthash.c | |
| perfecthash.h | |
| ► original | |
| perfecthash.c | |
| perfecthash.h | |
| ► onnx | |
| ► 00_lenet | |
| lenet_tvm.py | |
| ► 01_vecmul_a | |
| 01_onnx_build.py | |
| 01_tvm_compile.py | |
| 01_vecmul_a.cc | |
| 01_vecmul_a.wrapper.c | |
| vecmul_a.cc | |
| ► 02_vecmul_b | |
| 02_onnx_build.py | |
| 02_tvm_compile.py | |
| 02_vecmul_b.cc | |
| 02_vecmul_b.wrapper.c | |
| ► 04_dense_a | |
| 04_dense_a.cc | |
| 04_dense_a.parallel.c | |
| 04_onnx_build.py | |
| 04_tvm_compile.py | |
| ► 05_dense_b | |
| 05_dense_b.cc | |
| 05_dense_b.parallel.c | |
| 05_onnx_build.py | |
| 05_tvm_compile.py | |
| ► 06_softmax_a | |
| 06_onnx_build.py | |
| 06_softmax_a.cc | |
| 06_softmax_a.wrapper.c | |
| 06_tvm_compile.py | |
| ► 07_softmax_b | |
| 07_onnx_build.py | |
| 07_softmax_b.cc | |
| 07_softmax_b.wrapper.c | |
| 07_tvm_compile.py | |
| ► 09_conv2d_a | |
| 09_conv2d_a.cc | |
| 09_conv2d_a.parallel.c | |
| 09_onnx_build.py | |
| 09_tvm_compile.py | |
| conv_a.cc | |
| ► 11_conv2d_b | |
| 11_conv2d_b.cc | |
| 11_conv2d_b.parallel.c | |
| 11_onnx_build.py | |
| 11_tvm_compile.py | |
| ► 12_maxp_a | |
| 12_maxp_a.cc | |
| 12_maxp_a.wrapper.c | |
| 12_onnx_build.py | |
| 12_tvm_compile.py | |
| ► 13_maxp_b | |
| 13_maxp_b.cc | |
| 13_maxp_b.wrapper.c | |
| 13_onnx_build.py | |
| 13_tvm_compile.py | |
| ► 15_thxprlsg | |
| 15_onnx_build.py | |
| 15_thxprlsg.cc | |
| 15_thxprlsg.wrapper.c | |
| 15_tvm_compile.py | |
| ► common | |
| ► dlpack | |
| dlpack.h | The common header of DLPack |
| c_backend_api.h | |
| c_runtime_api.h | |
| ► e1_mlp | |
| e1_mlp.cc | |
| e1_mlp.parallel.c | |
| e1_onnx_build.py | |
| e1_tvm_compile.py | |
| ► e2_conv | |
| e2_onnx_build.py | |
| e2_tvm_compile.py | |
| ► i1_alexnet | |
| i1_tvm_compile.py | |
| ► i2_zfnet | |
| i2_tvm_compile.py | |
| ► i3_vgg16 | |
| i3_tvm_compile.py | |
| ► i4_googlenet | |
| download_convert.py | |
| i4_tvm_compile.py | |
| ► i5_resnet152v1 | |
| i5_tvm_compile.py | |
| ► parallel_omp | |
| ► bfs | |
| bfs.c | |
| graph.h | |
| ► parallel_queries | |
| ► common | |
| atominIncrement.c | |
| data.c | |
| load_graph.c | |
| simple_API.h | |
| ► trinityq1 | |
| lubm_trinityq1.c | |
| ► trinityq2 | |
| lubm_trinityq2.c | |
| ► trinityq3 | |
| lubm_trinityq3.c | |
| ► trinityq4 | |
| lubm_trinityq4.c | |
| ► trinityq5 | |
| lubm_trinityq5.c | |
| ► trinityq6 | |
| lubm_trinityq6.c | |
| ► trinityq7 | |
| lubm_trinityq7.c | |
| ► PolyBench | |
| ► PolyBenchC | |
| ► datamining | |
| ► correlation | |
| correlation.c | |
| correlation.h | |
| ► covariance | |
| covariance.c | |
| covariance.h | |
| ► linear-algebra | |
| ► blas | |
| ► gemm | |
| gemm.c | |
| gemm.h | |
| ► gemver | |
| gemver.c | |
| gemver.h | |
| ► gesummv | |
| gesummv.c | |
| gesummv.h | |
| ► symm | |
| symm.c | |
| symm.h | |
| ► syr2k | |
| syr2k.c | |
| syr2k.h | |
| ► syrk | |
| syrk.c | |
| syrk.h | |
| ► trmm | |
| trmm.c | |
| trmm.h | |
| ► kernels | |
| ► 2mm | |
| 2mm.c | |
| 2mm.h | |
| ► 3mm | |
| 3mm.c | |
| 3mm.h | |
| ► atax | |
| atax.c | |
| atax.h | |
| ► bicg | |
| bicg.c | |
| bicg.h | |
| ► doitgen | |
| doitgen.c | |
| doitgen.h | |
| ► mvt | |
| mvt.c | |
| mvt.h | |
| ► solvers | |
| ► cholesky | |
| cholesky.c | |
| cholesky.h | |
| ► durbin | |
| durbin.c | |
| durbin.h | |
| ► gramschmidt | |
| gramschmidt.c | |
| gramschmidt.h | |
| ► lu | |
| lu.c | |
| lu.h | |
| ► ludcmp | |
| ludcmp.c | |
| ludcmp.h | |
| ► trisolv | |
| trisolv.c | |
| trisolv.h | |
| ► medley | |
| ► deriche | |
| deriche.c | |
| deriche.h | |
| ► floyd-warshall | |
| floyd-warshall.c | |
| floyd-warshall.h | |
| ► nussinov | |
| nussinov.c | |
| nussinov.h | |
| Nussinov.orig.c | |
| ► stencils | |
| ► adi | |
| adi.c | |
| adi.h | |
| ► fdtd-2d | |
| fdtd-2d.c | |
| fdtd-2d.h | |
| ► heat-3d | |
| heat-3d.c | |
| heat-3d.h | |
| ► jacobi-1d | |
| jacobi-1d.c | |
| jacobi-1d.h | |
| ► jacobi-2d | |
| jacobi-2d.c | |
| jacobi-2d.h | |
| ► seidel-2d | |
| seidel-2d.c | |
| seidel-2d.h | |
| ► utilities | |
| polybench.c | |
| polybench.h | |
| template-for-new-benchmark.c | |
| ► pong | |
| btn_ctrl.c | |
| btn_ctrl.h | |
| get_ticks.c | |
| get_ticks.h | |
| main.c | |
| plot.c | |
| plot.h | |
| sevensegments_ctrl.c | |
| sevensegments_ctrl.h | |
| ► python-bindings | |
| main.c | |
| pysum.py | |
| sum.c | |
| sum.h | |
| ► rosetta | |
| ► digit-recognition | |
| digitrec_sw.c | |
| digitrec_sw.h | |
| typedefs.h | |
| ► sha-256 | |
| sha-256.c | |
| sha-256.h | |
| ► simple_asm | |
| asm.c | |
| c_stub.c | |
| ► softfloat | |
| ► src | |
| f64div.c | |
| f64mul.c | |
| f64sub.c | |
| f64sum.c | |
| fdiv.c | |
| fmul.c | |
| fsub.c | |
| fsum.c | |
| ► taste | |
| source_file.c | |
| ► truefloat | |
| ► add | |
| add.c | |
| add.h | |
| local_support.c | |
| ► common | |
| harness.c | |
| support.c | |
| support.h | |
| ► div | |
| div.c | |
| div.h | |
| local_support.c | |
| ► exp | |
| exp.c | |
| exp.h | |
| local_support.c | |
| ► mul | |
| local_support.c | |
| mul.c | |
| mul.h | |
| ► pow | |
| local_support.c | |
| pow.c | |
| pow.h | |
| ► sqrt | |
| local_support.c | |
| sqrt.c | |
| sqrt.h | |
| ► sub | |
| local_support.c | |
| sub.c | |
| sub.h | |
| ► VGA | |
| DE1_pin_assignments.qsf | |
| delay.c | |
| leds_ctrl.c | |
| plot.c | |
| vgatest.c | |
| ► VGA_Nexys4 | |
| btn_ctrl.c | |
| btn_ctrl.h | |
| delay.c | |
| delay.h | |
| leds_ctrl.c | |
| leds_ctrl.h | |
| plot.c | |
| plot.h | |
| sw_ctrl.c | |
| sw_ctrl.h | |
| vgatest.c | |
| ▼ src | |
| ► algorithms | |
| ► clique_covering | |
| check_clique.hpp | |
| clique_covering.cpp | |
| clique_covering.hpp | This header file includes four different algorithms heuristically solving the clique covering problem |
| clique_covering_graph.hpp | |
| degree_coloring.hpp | Boost-based implementation of a heuristic sequential coloring algorithm based on the descandant degree ordering of vertices |
| dsatur2_coloring.hpp | Boost-based implementation of a heuristic sequential coloring algorithm based on the work of Daniel Brelaz (Version 2) |
| dsatur_coloring.hpp | Boost-based implementation of a heuristic sequential coloring algorithm based on the work of Daniel Brelaz (Version 1) |
| filter_clique.hpp | |
| maxclique_dsatur_coloring.hpp | Boost-based implementation of an exact sequential coloring algorithm based on the work of Olivier Coudert and Daniel Brelaz |
| test_degree_coloring.cpp | |
| test_dsatur2_coloring.cpp | |
| test_dsatur_coloring.cpp | |
| test_maxclique_dsatur_coloring.cpp | |
| ► dominance | |
| Dominance.hpp | |
| weak_dominance.cpp | |
| weak_dominance.hpp | Class specifying weak dominance calculus |
| ► graph_helpers | |
| cyclic_topological_sort.hpp | File used to compute the topological sort in a cyclic graph |
| ► loops_detection | |
| loop.cpp | Implementation of the loop representation |
| loop.hpp | Interface of a loop |
| loops.cpp | Implementation of loops finding algorithm |
| loops.hpp | Interface of loops finding algorithm |
| ► behavior | |
| application_manager.cpp | Implementation of some methods to manage a generic C application |
| application_manager.hpp | Definition of the class representing a generic C application |
| basic_block.cpp | Class implementation of the basic_block structure |
| basic_block.hpp | Class specification of the basic_block structure |
| basic_blocks_graph_constructor.cpp | This class provides methods to build a basic blocks graph |
| basic_blocks_graph_constructor.hpp | This class provides methods to build a basic blocks graph |
| behavioral_writer_helper.cpp | Implement all structs used to write a graph in the dot format |
| behavioral_writer_helper.hpp | Collect all structs used to write a graph in the dot format |
| call_graph.cpp | Call graph hierarchy |
| call_graph.hpp | Call graph hierarchy |
| call_graph_manager.cpp | |
| call_graph_manager.hpp | Wrapper to call graph |
| cdfg_edge_info.cpp | Data structures used to represent an edge in operation and basic block graphs |
| cdfg_edge_info.hpp | Data structures used to represent an edge in operation and basic block graphs |
| function_behavior.cpp | A brief description of the C++ Source File |
| function_behavior.hpp | A brief description of the C++ Header File |
| level_constructor.cpp | Data structore used to build the topological order of the operations vertices |
| level_constructor.hpp | Data structore used to build the topological order of the operations vertices |
| op_graph.cpp | Data structures used in operations graph |
| op_graph.hpp | Data structures used in operations graph |
| operations_graph_constructor.cpp | This class provides methods to build a operations graph |
| operations_graph_constructor.hpp | This class provides methods to build an operations graph |
| OrderedInstructions.cpp | |
| OrderedInstructions.hpp | |
| profiling_information.cpp | Class implementation for storing profiling information |
| profiling_information.hpp | Class specification for storing profiling information |
| ► circuit | |
| cg_node.cpp | Node, edge and graph description of the graph associated with a structural description |
| cg_node.hpp | Node, edge and graph description of the graph associated with a structural description |
| NP_functionality.cpp | Not parsed functionality manager |
| NP_functionality.hpp | Not parsed functionality manager |
| structural_manager.cpp | Implementation of the class that manages the creation of the graph associated with the circuit |
| structural_manager.hpp | Class implementation of the structural_manager |
| structural_objects.cpp | This class represents a base circuit object |
| structural_objects.hpp | This class describes all classes used to represent a structural object |
| structuralIO.cpp | Input and output functions used to read and write the structural data structures |
| structuralIO.hpp | Input and output functions used to read and write the structural data structures |
| ► constants | |
| aadl_constants.hpp | Constants used in aadl parser |
| allocation_constants.hpp | Constants used by HLS constants |
| bambu_results_xml.hpp | Constant strings used in bambu results |
| compiler_constants.hpp | |
| compiler_xml.hpp | |
| constraints_xml.hpp | Xml nodes used in HLS constraints file |
| copyrights_strings.hpp | It collects all the common strings covering PandA copyrights issues |
| cost_latency_table.hpp | Default table used by THR LLVM optimization step |
| data_xml.hpp | Xml nodes for generic data xml files |
| experimental_setup_xml.hpp | Xml nodes used in file specifying experimental setup |
| file_IO_constants.hpp | Constants used in Input/Output |
| host_profiling_constants.hpp | Constants used in host profiling library |
| host_profiling_xml.hpp | Xml nodes of host profiling data |
| latex_table_constants.hpp | Default value for latex tables |
| latex_table_xml.hpp | Xml nodes used in file specifying latex table format |
| pragma_constants.hpp | Constant strings used in pragma identification |
| synthesis_constants.hpp | Constants used in synthesis wrappers |
| taste_constants.hpp | Constants used in taste |
| technology_xml.hpp | Xml nodes used in technology libraries files |
| testbench_generation_constants.hpp | Constants used in testbench generation |
| ► design_flows | |
| ► backend | |
| ► ToC | |
| ► progModels | |
| actor_graph_backend.cpp | |
| actor_graph_backend.hpp | Abstract class to write an actor graphs |
| c_backend.cpp | Simple class used to drive the backend in order to be able to print c source code |
| c_backend.hpp | Simple class used to drive the backend in order to be able to print c source code |
| ► source_code_writers | |
| basic_blocks_profiling_c_writer.cpp | This file contains the routines necessary to create a C executable program with instrumented edges for profiling of executions of single basic blocks |
| basic_blocks_profiling_c_writer.hpp | This file contains the routines necessary to create a C executable program with instrumented edges for profiling of executions of single basic blocks |
| c_writer.cpp | This file contains the routines necessary to create a C executable program starting from an abstract decription of the threads composing the application |
| c_writer.hpp | This file contains the routines necessary to create a C executable program |
| discrepancy_analysis_c_writer.cpp | |
| discrepancy_analysis_c_writer.hpp | |
| discrepancy_instruction_writer.cpp | Specialization of the instrunction writer for the discrepancy analysis |
| discrepancy_instruction_writer.hpp | Specialization of the instruction writer for the discrepancy analysis |
| edge_c_writer.cpp | This file contains the routines necessary to create a C executable program with instrumented edges |
| edge_c_writer.hpp | This file contains the routines necessary to create a C executable program with instrumented edges |
| hls_c_writer.cpp | |
| hls_c_writer.hpp | |
| hls_instruction_writer.cpp | Simple class to print single instruction |
| hls_instruction_writer.hpp | Simple class to print single instruction |
| instruction_writer.cpp | Simple class to print single instruction |
| instruction_writer.hpp | Simple class to print single instruction |
| c_backend_information.cpp | Base class to pass information to a c backend |
| c_backend_information.hpp | Base class to pass information to a c backend |
| c_backend_step_factory.cpp | Factory class to create c backend |
| c_backend_step_factory.hpp | Factory class to create c backend |
| ► ToDataFile | |
| generate_fu_list.cpp | Class for generating the list of functional untis to be characterized |
| generate_fu_list.hpp | Class for generating the list of functional untis to be characterized |
| to_data_file_step.cpp | Base class for data backend |
| to_data_file_step.hpp | Base class for data backend |
| to_data_file_step_factory.cpp | Factory for to data file step |
| to_data_file_step_factory.hpp | Factory for to data file step |
| translator.cpp | |
| translator.hpp | Dump information read already read from profiling file to other files |
| ► ToHDL | |
| ► writer | |
| sv_writer.cpp | |
| sv_writer.hpp | |
| verilog_writer.cpp | Write system verilog provided descriptions |
| verilog_writer.hpp | Class for system verilog writing |
| VHDL_writer.cpp | This class implements the methods to write VHDL descriptions |
| VHDL_writer.hpp | This class defines the methods to write VHDL descriptions |
| HDL_manager.cpp | Implementation of the base methods for writing HDL descriptions |
| HDL_manager.hpp | This class writes different HDL based descriptions (VHDL, Verilog, SystemC) starting from a structural representation |
| language_writer.cpp | This classes starting from a structural representation write different HDL based descriptions (VHDL, Verilog, SystemC) |
| language_writer.hpp | This class writes different HDL based descriptions (VHDL, Verilog, SystemC) starting from a structural representation |
| ► technology | |
| fix_characterization.cpp | Step to fix components characterization |
| fix_characterization.hpp | Step to fix components characterization |
| functional_unit_step.cpp | Abstract class to iterate over all the cells of a template |
| functional_unit_step.hpp | Abstract class to iterate over all the cells of a template |
| load_builtin_technology.cpp | |
| load_builtin_technology.hpp | This class load builtin components in technology manager |
| load_default_technology.cpp | This class loads default technology libraries |
| load_default_technology.hpp | This class loads default technology libraries |
| load_device_technology.cpp | This class loads device dependent technology information |
| load_device_technology.hpp | This class loads device dependent technology information |
| load_file_technology.cpp | This class loads a technology library from a file specified at command line |
| load_file_technology.hpp | This class loads a technology library from a file specified at command line |
| load_technology.cpp | Pseudo step to force dependencies from all load_*_technology steps |
| load_technology.hpp | Pseudo step to force dependencies from all load_*_technology steps |
| technology_flow_step.cpp | Base class for technology flow steps |
| technology_flow_step.hpp | Base class for technology flow steps |
| technology_flow_step_factory.cpp | Factory for technology flow step |
| technology_flow_step_factory.hpp | Factory for technology flow step |
| write_technology.cpp | Step to writes technology as xml file |
| write_technology.hpp | Step to writes technology as xml file |
| design_flow.cpp | |
| design_flow.hpp | This class contains the base representation for design flow |
| design_flow_aux_step.cpp | Class for describing auxiliary steps in design flow |
| design_flow_aux_step.hpp | Class for describing auxiliary steps in design flow |
| design_flow_factory.cpp | Factory for creating design flows |
| design_flow_factory.hpp | Factory for creating design flows |
| design_flow_graph.cpp | Base class for design_flow |
| design_flow_graph.hpp | Classes to describe design flow graph |
| design_flow_manager.cpp | Wrapper of design_flow |
| design_flow_manager.hpp | Wrapper of design_flow |
| design_flow_step.cpp | Base class for step of design flow |
| design_flow_step.hpp | Base class for step of design flow |
| design_flow_step_factory.cpp | Pure virtual base class for all the design flow step factory |
| design_flow_step_factory.hpp | Pure virtual base class for all the design flow step factory |
| non_deterministic_flows.cpp | Design flow to check different non deterministic flows |
| non_deterministic_flows.hpp | Design flow to check different non deterministic flows |
| ► frontend_analysis | |
| ► behavior_analysis | |
| add_bb_ecfg_edges.cpp | Analysis step which extends basic blocks cfg |
| add_bb_ecfg_edges.hpp | Analysis step which extends basic block cfg |
| add_op_exit_flow_edges.cpp | |
| add_op_exit_flow_edges.hpp | Analysis step which adds flow edges for scheduling to operation graphs |
| add_op_loop_flow_edges.cpp | |
| add_op_loop_flow_edges.hpp | Analysis step which adds flow edges for scheduling to operation graphs |
| add_op_phi_flow_edges.cpp | Analysis step which adds flow edges from the computation of the condition(s) of gimple_cond and gimple_multi_way_if to phi |
| add_op_phi_flow_edges.hpp | Analysis step which adds flow edges from the computation of the condition(s) of gimple_cond and gimple_multi_way_if to phi |
| AddArtificialCallFlowEdges.cpp | Analysis step which adds flow edges to builtin bambu time functions |
| AddArtificialCallFlowEdges.hpp | Analysis step which adds flow edges to builtin bambu time functions |
| basic_blocks_profiling.cpp | Analysis step performing a dynamic profiling of basic blocks execution |
| basic_blocks_profiling.hpp | Analysis step performing a dynamic profiling of basic blocks execution |
| bb_cdg_computation.cpp | Analysis step performing basic block control dependence computation |
| bb_cdg_computation.hpp | Analysis step computing basic block control dependencies |
| bb_feedback_edges_computation.cpp | Analysis step computing feedback edges of basic block control flow graph |
| bb_feedback_edges_computation.hpp | |
| bb_order_computation.cpp | Analysis step computing a topological order of the basic_block |
| bb_order_computation.hpp | |
| bb_reachability_computation.cpp | Analysis step computing reachability between operations |
| bb_reachability_computation.hpp | Analysis step computing reachability between basic blocks |
| data_dependence_computation.cpp | Base class for different data dependence computation |
| data_dependence_computation.hpp | Base class for different data dependence computation |
| dom_post_dom_computation.cpp | Analysis step performing dominators and post dominators computation |
| dom_post_dom_computation.hpp | Analysis step performing dominators and post dominators computation |
| host_profiling.cpp | Analysis step performing profiling of loops, paths or both |
| host_profiling.hpp | Abstract class for passes performing a dynamic profiling of loops, paths or both by means of predependence |
| loops_computation.cpp | Analysis step performing loops computation |
| loops_computation.hpp | Analysis step performing loops computation |
| op_cdg_computation.cpp | Analysis step performing operation control dependence computation |
| op_cdg_computation.hpp | Analysis step computing operation control dependencies |
| op_feedback_edges_computation.cpp | Analysis step computing Analysis step computing feedback edges for operation control flow graph |
| op_feedback_edges_computation.hpp | Analysis step computing feedback edges for operation control flow graph |
| op_order_computation.cpp | Analysis step computing a topological order of the operations |
| op_order_computation.hpp | Analysis step computing a topological order of the operations |
| op_reachability_computation.cpp | Analysis step computing reachability between operations |
| op_reachability_computation.hpp | Analysis step computing reachability between operations |
| scalar_ssa_data_dependence_computation.cpp | Analysis step performing data flow analysis based on ssa variables |
| scalar_ssa_data_dependence_computation.hpp | Analysis step performing data flow analysis based on ssa variables |
| virtual_aggregate_data_flow_analysis.cpp | Analysis step performing aggregate variable computation on the basis of gcc virtual operands |
| virtual_aggregate_data_flow_analysis.hpp | Analysis step performing aggregate variable computation on the basis of gcc virtual operands |
| ► IR_analysis | |
| basic_blocks_cfg_computation.cpp | Build basic block control flow graph data structure starting from the tree_manager |
| basic_blocks_cfg_computation.hpp | Build basic block control flow graph data structure starting from the tree_manager |
| bit_lattice.cpp | |
| bit_lattice.hpp | |
| Bit_Value.cpp | Full implementation of Bit Value analysis as described in BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations Mihai Budiu Seth Copen Goldstein http://www.cs.cmu.edu/~seth/papers/budiu-tr00.pdf This technical report is an extension of the following paper: Mihai Budiu, Majd Sakr, Kip Walker, Seth Copen Goldstein: BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations |
| Bit_Value.hpp | Full implementation of Bit Value analysis as described in BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations Mihai Budiu Seth Copen Goldstein http://www.cs.cmu.edu/~seth/papers/budiu-tr00.pdf |
| Bit_Value_backward.cpp | |
| Bit_Value_forward.cpp | |
| Bit_Value_opt.cpp | |
| Bit_Value_opt.hpp | Class performing some optimizations on the IR exploiting Bit Value analysis |
| BitValueIPA.cpp | Created on: June 27, 2016 |
| BitValueIPA.hpp | Created on: June 27, 2016 |
| BitValueRange.cpp | Class performing some optimizations on the IR exploiting Bit Value analysis but executed after Range Analysis |
| BitValueRange.hpp | Class performing some optimizations on the IR exploiting Bit Value analysis but executed after Range Analysis |
| block_fix.cpp | Analysis step which modifies the control flow graph of the tree to make it more compliant and simple |
| block_fix.hpp | Analysis step that modifies the control flow graph of the tree to make it more compliant |
| call_expr_fix.cpp | Analysis step which fix a non-void list of parameters to function with void as input parameter type |
| call_expr_fix.hpp | Analysis step which fix a non-void list of parameters to function with void as input parameter type |
| call_graph_builtin_call.cpp | |
| call_graph_builtin_call.hpp | This file contains the declaration of the CallGraphBuiltinCall pass that will add function called through a built in to the call graph |
| call_graph_computation.cpp | Build call_graph data structure starting from the tree_manager |
| call_graph_computation.hpp | Build call_graph data structure starting from the tree_manager |
| check_system_type.cpp | Analyse srcp of variables and types to detect system ones; the identified one are flagged |
| check_system_type.hpp | Analyse srcp of variables and types to detect system ones; the identified one are flagged |
| compute_implicit_calls.cpp | Class to determine the variable to be stored in memory |
| compute_implicit_calls.hpp | Determine variables to be stored in memory |
| CSE.cpp | Common subexpression elimination step |
| CSE.hpp | CSE analysis |
| dataflow_cg_ext.cpp | Dataflow call graph extension |
| dataflow_cg_ext.hpp | Dataflow call graph extension |
| dead_code_elimination.cpp | Eliminate dead code |
| dead_code_elimination.hpp | Eliminate dead code |
| dead_code_eliminationIPA.cpp | |
| dead_code_eliminationIPA.hpp | |
| determine_memory_accesses.cpp | Class to determine the variable to be stored in memory |
| determine_memory_accesses.hpp | Determine variables to be stored in memory |
| eSSA.cpp | |
| eSSA.hpp | |
| extract_omp_atomic.cpp | Analysis step extracting openmp atomic |
| extract_omp_atomic.hpp | Analysis step extracting openmp atomic |
| extract_omp_for.cpp | Analysis step extracting openmp for |
| extract_omp_for.hpp | Analysis step extracting openmp for |
| extract_patterns.cpp | |
| extract_patterns.hpp | Class extracting patterns extending the GCC/CLANG IR |
| fanout_opt.cpp | Fanout optimization step |
| fanout_opt.hpp | Fanout optimization step |
| FixStructsPassedByValue.cpp | |
| FixStructsPassedByValue.hpp | |
| FixVdef.cpp | Simplifies memory dependency data structure by merging memdeps in virtual dependencies |
| FixVdef.hpp | Merge memory dependencies in virtual dependencies |
| FunctionCallOpt.cpp | |
| FunctionCallOpt.hpp | |
| FunctionCallTypeCleanup.cpp | |
| FunctionCallTypeCleanup.hpp | |
| hdl_function_decl_fix.cpp | Pre-analysis step fixing names of functions which clash with signal names |
| hdl_function_decl_fix.hpp | Pre-analysis step fixing names of functions which clash with signal names |
| hdl_var_decl_fix.cpp | Pre-analysis step fixing var_decl duplication and HDL name conflicts |
| hdl_var_decl_fix.hpp | Pre-analysis step fixing var_decl duplication and HDL name conflicts |
| hls_div_cg_ext.cpp | Step that extends the call graph with the soft-float calls where appropriate |
| hls_div_cg_ext.hpp | Step that extends the call graph with the division and modulus function calls where appropriate |
| HWCallInjection.cpp | |
| HWCallInjection.hpp | |
| InterfaceInfer.cpp | Load parsed protocol interface attributes |
| InterfaceInfer.hpp | Load parsed protocol interface attributes |
| IR_lowering.cpp | Decompose some complex gimple statements into a set of simpler operations |
| IR_lowering.hpp | Decompose some complex gimple statements into set of simple operations |
| IR_lowering_exec.cpp | |
| loops_analysis_bambu.cpp | Analysis step performing loops analysis |
| loops_analysis_bambu.hpp | |
| lut_transformation.cpp | Identify and optimize lut expressions |
| lut_transformation.hpp | Identify and optmize lut expressions |
| multi_way_if.cpp | Analysis step rebuilding multi-way if |
| multi_way_if.hpp | Analysis step rebuilding multi-way if |
| multiple_entry_if_reduction.cpp | This class implements the reduction of blocks with n input and m output These operations can be done if the BB contains only conditional statements and phi First duplicate the block on all the n input and add the respective connections to predecessor and successors (bidirectional) Each duplicate starts as an empty one with only connections Then the new BB is populated by conditional functions derivated from the original statement list |
| multiple_entry_if_reduction.hpp | Class performing the reduction of n input - m output BB by duplicating the BB over all its predecessors, modifing the statements in order to keep the ssa and moving the phi to all the successor changing their results' ssa name NOTE: this works if the BB is composed only conditions and phi statements |
| NI_SSA_liveness.cpp | Non-Iterative liveness analysis for SSA based gimple descriptions |
| NI_SSA_liveness.hpp | Non-Iterative liveness analysis for SSA based gimple descriptions |
| operations_cfg_computation.cpp | Analysis step creating the control flow graph of the operations |
| operations_cfg_computation.hpp | Analysis step creating the control flow graph for the operations |
| parm2ssa.cpp | Pre-analysis step computing the relation between parm_decl and the associated ssa_name |
| parm2ssa.hpp | Pre-analysis step computing the relation between parm_decl and the associated ssa_name |
| parm_decl_taken_address_fix.cpp | |
| parm_decl_taken_address_fix.hpp | |
| phi_opt.cpp | Analysis step that improves the IR w.r.t |
| phi_opt.hpp | Analysis step that optimize the phis starting from the IR |
| pragma_analysis.cpp | Pre-analysis step fixing pragma definitions |
| pragma_analysis.hpp | Analysis step that recognizes the pragma calls in the specification |
| Range.cpp | |
| Range.hpp | |
| Range_Analysis.cpp | |
| Range_Analysis.hpp | |
| rebuild_initializations.cpp | Rebuild initialization where it is possible |
| rebuild_initializations.hpp | Rebuild initialization where it is possible |
| remove_clobber_ga.cpp | Analysis step that removes clobber gimple_assign introduced by GCC v4.7 and greater |
| remove_clobber_ga.hpp | Analysis step that removes clobber gimple_assign introduced by GCC v4.7 and greater |
| remove_ending_if.cpp | Collapse and if and its "then" branch only if it is shorter than one cycle and the else is a BB composed only by return and PHI statements |
| remove_ending_if.hpp | |
| short_circuit_taf.cpp | Analysis step rebuilding a short circuit in a single gimple_cond with the condition in three address form |
| short_circuit_taf.hpp | Analysis step rebuilding a short circuit in a single gimple_cond with the condition in three address form |
| simple_code_motion.cpp | Analysis step that performs some simple code motions over the IR |
| simple_code_motion.hpp | Analysis step that performs some simple code motions over the IR |
| soft_float_cg_ext.cpp | Step that extends the call graph with the soft-float calls where appropriate |
| soft_float_cg_ext.hpp | Step that extends the call graph with the soft-float calls where appropriate |
| split_return.cpp | Simple transformations that remove almost empty basic blocks having a single phi and a return statement |
| split_return.hpp | |
| string_cst_fix.cpp | Pre-analysis step fixing readonly initializations and string_cst references |
| string_cst_fix.hpp | Pre-analysis step fixing readonly initializations and string_cst references |
| switch_fix.cpp | Analysis step that modifies the control flow graph to fix switches |
| switch_fix.hpp | Analysis step that modifies the control flow graph to fix switches |
| update_schedule.cpp | Analysis step which updates the schedule of all the instructions |
| update_schedule.hpp | Analysis step which updates the schedule of all the instructions |
| use_counting.cpp | Analysis step counting how many times a ssa_name is used |
| use_counting.hpp | Analysis step counting how many time a ssa_name is used |
| var_computation.cpp | Analyzes operations and creates the sets of read and written variables |
| var_computation.hpp | Analyzes operations and creates the sets of read and written variables |
| var_decl_fix.cpp | Pre-analysis step fixing var_decl duplication |
| var_decl_fix.hpp | Pre-analysis step fixing var_decl duplication |
| vectorize.cpp | This class contains the methods for vectorize loop or whole function |
| vectorize.hpp | This class contains the methods for vectorize loop or whole function |
| virtual_phi_nodes_split.cpp | Insert a temporary assignment for each phi use |
| virtual_phi_nodes_split.hpp | |
| ► IR_manipulation | |
| build_virtual_phi.cpp | Analysis step building phi of vops |
| build_virtual_phi.hpp | Analysis step building phi of vops |
| commutative_expr_restructuring.cpp | Analysis step restructuring tree of commutative expressions to reduce the critical path delay |
| commutative_expr_restructuring.hpp | Analysis step restructing tree of commutative expressions to reduce the critical path delay |
| cond_expr_restructuring.cpp | Analysis step restructuring tree of cond_expr to reduce critical path delay |
| cond_expr_restructuring.hpp | Analysis step restructing tree of cond_expr to reduce critical path delay |
| create_tree_manager.cpp | Implementation of the class for creating the tree_manager starting from the source code files |
| create_tree_manager.hpp | Class that creates the tree_manager starting from the source code files |
| extract_gimple_cond_op.cpp | Analysis step that extract condition from gimple_cond |
| extract_gimple_cond_op.hpp | Analysis step that extract condition from gimple_cond |
| predicate_statements.cpp | This class contains the methods for setting predicates for instructions which cannot be speculated |
| predicate_statements.hpp | This class contains the methods for setting predicates of instructions which cannot be speculated |
| sdc_code_motion.cpp | Analysis step performing code motion speculation on the basis of sdc results |
| sdc_code_motion.hpp | Analysis step performing code motion speculation on the basis of sdc results |
| serialize_mutual_exclusions.cpp | This class contains the methods for remove mutual exclusions from simd loops |
| serialize_mutual_exclusions.hpp | This class contains the methods for remove mutual exclusions from simd loops |
| un_comparison_lowering.cpp | Step that replace uneq_expr, ltgt_expr, unge_expr, ungt_expr, unle_expr and unlt_expr |
| un_comparison_lowering.hpp | Step that replace uneq_expr, ltgt_expr, unge_expr, ungt_expr, unle_expr and unlt_expr |
| ► source_code_manipulation | |
| create_address_translation.cpp | Writes source code of hdl module to translate addresses from pci address space to bambu address space |
| create_address_translation.hpp | Writes source code of hdl module to translate addresses from pci address space to bambu address space |
| pragma_substitution.cpp | Analysis step that replaces the pragmas in the specification with calls |
| pragma_substitution.hpp | Analysis step that replaces the pragmas in the specification with calls |
| application_frontend_flow_step.cpp | This class contains the base representation for a generic frontend flow step which works on the whole function |
| application_frontend_flow_step.hpp | This class contains the base representation for a generic frontend flow step which works on the whole function |
| bambu_frontend_flow.cpp | The step representing the frontend flow for bambu |
| bambu_frontend_flow.hpp | The step representing the frontend flow for bambu |
| complete_bb_graph.cpp | This class models the ending of execution of all steps which can modify control flow graph of basic blocks |
| complete_bb_graph.hpp | This class models the ending of execution of all steps which can modify control flow graph of basic blocks |
| complete_call_graph.cpp | This class models the ending of execution of all functions which can add a function to call graph |
| complete_call_graph.hpp | This class models the ending of execution of all functions which can add a function to call graph |
| find_max_transformations.cpp | Analysis step to find transformation which breaks synthesis flow by launching bambu with different values of –max-transformations |
| find_max_transformations.hpp | Analysis step to find transformation which breaks synthesis flow by launching bambu with different values of –max-transformations |
| frontend_flow_step.cpp | This class contains the base representation for a generic frontend flow step |
| frontend_flow_step.hpp | This class contains the base representation for a generic frontend flow step |
| frontend_flow_step_factory.cpp | |
| frontend_flow_step_factory.hpp | This class contains the methods to create a frontend flow step |
| function_frontend_flow_step.cpp | This class contains the base representation for a generic frontend flow step |
| function_frontend_flow_step.hpp | This class contains the base representation for a generic frontend flow step which works on a single function |
| symbolic_application_frontend_flow_step.cpp | This class models the application of a analysis to all the functions of an application |
| symbolic_application_frontend_flow_step.hpp | This class models the application of a analysis to all the functions of an application |
| ► graph | |
| edge_info.hpp | Base class description of data information associated with each edge of a graph |
| graph.cpp | Class specification of the graph structures |
| graph.hpp | Class specification of the graph structures |
| graph_info.hpp | Base class for graph property |
| node_info.cpp | Base class description of data information associated with each node of a graph |
| node_info.hpp | Base class description of data information associated with each node of a graph |
| typed_node_info.cpp | |
| typed_node_info.hpp | Base class description of data information associated with each node of a graph |
| Vertex.hpp | Data structures used to manage set of vertexes |
| ► HLS | |
| ► architecture_creation | |
| ► controller_creation | |
| control_flow_checker.cpp | |
| control_flow_checker.hpp | |
| controller_creator_base_step.cpp | Base class for all controller creation algorithms |
| controller_creator_base_step.hpp | Base class for all the controller creation algorithms |
| controller_cs.cpp | |
| controller_cs.hpp | Base class for all the controller creation algorithms |
| fsm_controller.cpp | Starting from the FSM graph, it builds a state transition table |
| fsm_controller.hpp | Header class for the creation of the classical FSM controller |
| pipeline_controller.cpp | Starting from the FSM graph, it generates a shift register for control |
| pipeline_controller.hpp | Header class for the creation of a shift register controlling a pipeline |
| ► datapath_creation | |
| classic_datapath.cpp | Base class for usual datapath creation |
| classic_datapath.hpp | Base class for usual datapath creation |
| datapath_creator.cpp | |
| datapath_creator.hpp | |
| datapath_cs.cpp | |
| datapath_cs.hpp | |
| datapath_parallel_cs.cpp | |
| datapath_parallel_cs.hpp | |
| top_entity.cpp | Implementation of the class creating the top entity |
| top_entity.hpp | Base class for the top entity creation |
| top_entity_cs.cpp | Base class for top entity for context_switch |
| top_entity_cs.hpp | |
| top_entity_parallel_cs.cpp | |
| top_entity_parallel_cs.hpp | |
| TopEntityMemoryMapped.cpp | Construction of top entity memory mapped interface |
| TopEntityMemoryMapped.hpp | Construction of top entity memory mapped interface |
| ► backend | |
| generate_hdl.cpp | Implementation of the class to generate HDL code |
| generate_hdl.hpp | Class used to generate HDL files |
| generate_simulation_scripts.cpp | Wrapper used to generate simulation scripts |
| generate_simulation_scripts.hpp | Wrapper used to generate simulation scripts |
| generate_synthesis_scripts.cpp | Wrapper used to generate synthesis scripts |
| generate_synthesis_scripts.hpp | Wrapper used to generate synthesis scripts |
| generate_taste_hdl_architecture.cpp | Implementation of the class to generate the top HDL taste architecture |
| generate_taste_hdl_architecture.hpp | Implementation of the class to generate the top HDL taste architecture |
| generate_taste_synthesis_script.cpp | Wrapper used to generate synthesis script for taste |
| generate_taste_synthesis_script.hpp | Wrapper used to generate synthesis script for taste |
| ► binding | |
| ► interconnection | |
| conn_binding.cpp | Class implementation of the interconnection binding data structure |
| conn_binding.hpp | Data structure used to store the interconnection binding of datapath elements |
| conn_binding_creator.cpp | Base class for all interconnection binding algorithms |
| conn_binding_creator.hpp | Base class for all interconnection binding algorithms |
| conn_binding_cs.cpp | Connect the new component instantiated by the flow context_switch |
| conn_binding_cs.hpp | |
| connection_obj.hpp | |
| direct_conn.hpp | Class adopted to represent direct connections inside the datapath |
| mux_conn.hpp | Class adopt to represent a mux connection |
| mux_connection_binding.cpp | Implementation of mux_connection_binding class |
| mux_connection_binding.hpp | Class to manage mux-based interconnections based on the FSM controller |
| parallel_memory_conn_binding.cpp | |
| parallel_memory_conn_binding.hpp | Data structure used to store the interconnection binding of datapath elements when parallel memory controller is adopted |
| port_swapping.cpp | Implementation of the port swapping algorithm described in the following paper: Hao Cong, Song Chen and T |
| port_swapping.hpp | Implementation of the port swapping algorithm described in the following paper: Hao Cong, Song Chen and T |
| ► module | |
| cdfc_module_binding.cpp | Class implementation of the module binding algorithm |
| cdfc_module_binding.hpp | Module binding based on the analysis of the control data flow chained graph |
| easy_module_binding.cpp | Class implementation of the partial module binding based on simple conditions |
| easy_module_binding.hpp | Partial module binding based on simple conditions |
| fu_binding.cpp | Class implementation of the functional-unit binding data structure |
| fu_binding.hpp | Data structure used to store the functional-unit binding of the vertexes |
| fu_binding_creator.cpp | Implementation of module binding class |
| fu_binding_creator.hpp | Base class for all module binding algorithms |
| fu_binding_cs.cpp | Derived class to add module scheduler, mem_ctrl_parallel and bind correctly the channels |
| fu_binding_cs.hpp | Derived class to add module scheduler, mem_ctrl_parallel and bind correctly the channels |
| module_binding_check.hpp | |
| parallel_memory_fu_binding.cpp | Data structure used to store the functional-unit binding of the vertices |
| parallel_memory_fu_binding.hpp | Data structure used to store the functional-unit binding of the vertices |
| unique_binding.cpp | Class implementation of a unique binding algorithm |
| unique_binding.hpp | Class to create a unique binding |
| ► register | |
| ► algorithms | |
| chordal_coloring_register.cpp | Class implementation of register allocation algorithm based on chordal algorithm |
| chordal_coloring_register.hpp | Class specification of the register allocation algorithms based on chordal algorithm |
| compatibility_based_register.cpp | Base class specification for register allocation algorithm based on a compatibility graph |
| compatibility_based_register.hpp | Base class specification for register allocation algorithm based on a compatibility graph |
| conflict_based_register.cpp | Base class specification for register allocation algorithm based on a conflict graph |
| conflict_based_register.hpp | Base class specification for register allocation algorithm based on a conflict graph |
| network_flow.cpp | This class contains a network flow graph representation and min cost flow algorithm |
| network_flow.hpp | This class contains a network flow graph representation and min cost flow algorithm |
| unique_binding_register.cpp | Class implementation of unique binding register allocation algorithm |
| unique_binding_register.hpp | Class specification of unique binding register allocation algorithm |
| vertex_coloring_register.cpp | Class implementation of a coloring based register allocation algorithm |
| vertex_coloring_register.hpp | Class specification of a coloring based register allocation algorithm |
| weighted_clique_register.cpp | Weighted clique covering register allocation procedure |
| weighted_clique_register.hpp | Weighted clique covering register allocation procedure |
| reg_binding.cpp | Class implementation of the register binding data structure |
| reg_binding.hpp | Data structure used to store the register binding of variables |
| reg_binding_creator.cpp | Base class for all register allocation algorithms |
| reg_binding_creator.hpp | Base class for all the register allocation algorithms |
| reg_binding_cs.cpp | |
| reg_binding_cs.hpp | |
| Variable.hpp | Data structures used to manage set of variables |
| ► storage_value_insertion | |
| storage_value_information.cpp | This package is used to define the storage value scheme adopted by the register allocation algorithms |
| storage_value_information.hpp | This package is used to define the storage value scheme adopted by the register allocation algorithms |
| storage_value_information_fsm.cpp | This package is used to define the storage value scheme adopted by the register allocation algorithms |
| storage_value_information_fsm.hpp | This package is used to define the storage value scheme adopted by the register allocation algorithms |
| storage_value_information_pipeline.cpp | |
| storage_value_information_pipeline.hpp | |
| storage_value_insertion.cpp | This package is used to define the storage value scheme adopted by the register allocation algorithms |
| storage_value_insertion.hpp | This package is used to define the storage value scheme adopted by the register allocation algorithms |
| values_scheme.cpp | Class implementation of values scheme for the storage value insertion phase |
| values_scheme.hpp | Class specification of values scheme for the storage value insertion phase |
| ► chaining | |
| chaining.cpp | Class supporting the chaining optimization in high level synthesis |
| chaining.hpp | Class supporting the chaining optimization in high level synthesis |
| chaining_information.cpp | Class containing information about chaining |
| chaining_information.hpp | Class containing information about chaining |
| sched_based_chaining_computation.cpp | Chaining computation starting from the results of the scheduling step |
| sched_based_chaining_computation.hpp | Chaining computation starting from the results of the scheduling step |
| ► evaluation | |
| ► exact | |
| simulation_evaluation.cpp | |
| simulation_evaluation.hpp | |
| synthesis_evaluation.cpp | |
| synthesis_evaluation.hpp | |
| dry_run_evaluation.cpp | |
| dry_run_evaluation.hpp | |
| evaluation.cpp | |
| evaluation.hpp | Class to compute evaluations about high-level synthesis |
| evaluation_base_step.cpp | Base class to compute evaluations about high-level synthesis |
| evaluation_base_step.hpp | Base class to compute evaluations about high-level synthesis |
| ► function_allocation | |
| fun_dominator_allocation.cpp | Function allocation based on the dominator tree of the call graph |
| fun_dominator_allocation.hpp | Class to allocate function in HLS based on dominators |
| function_allocation.cpp | Base class to allocate functions in high-level synthesis |
| function_allocation.hpp | Base class to allocate functions in high-level synthesis |
| functions.cpp | |
| functions.hpp | Datastructure to describe functions allocation in high-level synthesis |
| omp_function_allocation.cpp | Class to allocate function in HLS based on dominators and openmp information |
| omp_function_allocation.hpp | Class to allocate function in HLS based on dominators and openmp information |
| omp_function_allocation_CS.cpp | |
| omp_function_allocation_CS.hpp | |
| omp_functions.cpp | Datastructure to describe functions allocation in high-level synthesis |
| omp_functions.hpp | Datastructure to describe functions allocation in high-level synthesis |
| ► hls_flow | |
| ► synthesis | |
| hls_synthesis_flow.cpp | Definition of the class to create the structural description of a function |
| hls_synthesis_flow.hpp | Definition of the class to create the structural description of a function |
| omp_body_loop_synthesis_flow.cpp | Definition of the class to create the structural description for body loop of openmp for |
| omp_body_loop_synthesis_flow.hpp | Definition of the class to create the structural description for body loop of openmp for |
| omp_for_wrapper_cs_synthesis_flow.cpp | |
| omp_for_wrapper_cs_synthesis_flow.hpp | |
| standard_hls.cpp | Implementation of the methods to create the structural description of the component |
| standard_hls.hpp | Definition of the class to create the structural description of the component |
| virtual_hls.cpp | A brief description of the C++ Source File |
| virtual_hls.hpp | Basic HLS flow |
| classical_synthesis_flow.cpp | |
| classical_synthesis_flow.hpp | Classical synthesis flow |
| dominator_allocation.cpp | Composed pass to wrap function and memory dominator allocation |
| dominator_allocation.hpp | Composed pass to wrap function and memory dominator allocation |
| initialize_hls.cpp | Step which initializes HLS data structure |
| initialize_hls.hpp | Step which intializes hls data structur |
| write_hls_summary.cpp | Class to dump hls summary |
| write_hls_summary.hpp | Class to dump hls summary |
| ► interface | |
| ► minimal | |
| minimal_interface.cpp | Class to generate minimal interfaces for high-level synthesis |
| minimal_interface.hpp | Class to generate minimal interfaces for high-level synthesis |
| ► WB4 | |
| WB4_interface.cpp | Class to generate WB4 interfaces for high-level synthesis |
| WB4_interface.hpp | Class to generate WB4 interfaces for high-level synthesis |
| WB4Intercon_interface.cpp | Implementation of WB4Intercon_interface |
| WB4Intercon_interface.hpp | Module for the generation of the top WB4 component |
| cs_interface.cpp | Class to generate the interface for the context switch project |
| cs_interface.hpp | Class to generate the interface for the context switch project |
| module_interface.cpp | Base class for all module interfaces |
| module_interface.hpp | Base class to model interfaces for high-level synthesis |
| taste_interface_generation.cpp | Class to generate interface for taste architecture |
| taste_interface_generation.hpp | Class to generate interface for taste architecture |
| ► liveness | |
| FSM_NI_SSA_liveness.cpp | Liveness analysis exploiting the SSA form of the IR |
| FSM_NI_SSA_liveness.hpp | Liveness analysis exploiting the SSA form of the IR |
| liveness.cpp | Class used to store liveness results |
| liveness.hpp | Class specification to contain liveness information |
| liveness_computer.cpp | Some method for the abstract class |
| liveness_computer.hpp | Class specification for algorithms that compute the liveness of variables |
| ► memory | |
| mem_dominator_allocation.cpp | Memory allocation based on the dominator tree of the call graph |
| mem_dominator_allocation.hpp | Class to allocate memories in HLS based on dominators |
| mem_dominator_allocation_cs.cpp | |
| mem_dominator_allocation_cs.hpp | |
| memory.cpp | Data structure describing function allocation in high-level synthesis |
| memory.hpp | Datastructure to represent memory information in high-level synthesis |
| memory_allocation.cpp | Base class to allocate memories in high-level synthesis |
| memory_allocation.hpp | Base class to allocate memories in high-level synthesis |
| memory_cs.hpp | |
| memory_symbol.hpp | Datastructure to represent a memory symbol in HLS |
| ► module_allocation | |
| add_library.cpp | Implementation of the class to add the current module to the technology library |
| add_library.hpp | This step adds the current module to the technology library |
| allocation.cpp | Wrapper for technology used by the high-level synthesis flow |
| allocation.hpp | This package is used by all HLS packages to manage resource constraints and characteristics |
| allocation_information.cpp | This package is used by all HLS packages to manage resource constraints and characteristics |
| allocation_information.hpp | This package is used by all HLS packages to manage resource constraints and characteristics |
| hls_function_bit_value.cpp | Wrapper for bit value analysis in the HLS context |
| hls_function_bit_value.hpp | Proxy class calling the bit value analysis just before the hls_bit_value step taking into account the results of the memory hls_bit_value |
| omp_allocation.cpp | This package is used by all HLS packages to manage resource constraints and characteristics |
| omp_allocation.hpp | This package is used by all HLS packages to manage resource constraints and characteristics |
| ► module_generator | |
| ASMModuleGenerator.cpp | |
| ASMModuleGenerator.hpp | |
| BuiltinWaitCallModuleGenerator.cpp | |
| BuiltinWaitCallModuleGenerator.hpp | |
| BuiltinWaitCallNModuleGenerator.cpp | |
| BuiltinWaitCallNModuleGenerator.hpp | |
| ModuleGenerator.cpp | |
| ModuleGenerator.hpp | |
| ModuleGeneratorManager.cpp | |
| ModuleGeneratorManager.hpp | |
| OpenCSModuleGenerator.cpp | |
| OpenCSModuleGenerator.hpp | |
| OpenModuleGenerator.cpp | |
| OpenModuleGenerator.hpp | |
| OpenNModuleGenerator.cpp | |
| OpenNModuleGenerator.hpp | |
| OpenP1NModuleGenerator.cpp | |
| OpenP1NModuleGenerator.hpp | |
| PrintfCSModuleGenerator.cpp | |
| PrintfCSModuleGenerator.hpp | |
| PrintfModuleGenerator.cpp | |
| PrintfModuleGenerator.hpp | |
| PrintfNModuleGenerator.cpp | |
| PrintfNModuleGenerator.hpp | |
| PrintfP1NModuleGenerator.cpp | |
| PrintfP1NModuleGenerator.hpp | |
| Read_acknowledgeModuleGenerator.cpp | |
| Read_acknowledgeModuleGenerator.hpp | |
| Read_axisModuleGenerator.cpp | |
| Read_axisModuleGenerator.hpp | |
| Read_fifoModuleGenerator.cpp | |
| Read_fifoModuleGenerator.hpp | |
| Read_handshakeModuleGenerator.cpp | |
| Read_handshakeModuleGenerator.hpp | |
| Read_noneModuleGenerator.cpp | |
| Read_noneModuleGenerator.hpp | |
| Read_validModuleGenerator.cpp | |
| Read_validModuleGenerator.hpp | |
| ReadWrite_arrayModuleGenerator.cpp | |
| ReadWrite_arrayModuleGenerator.hpp | |
| ReadWrite_m_axiModuleGenerator.cpp | |
| ReadWrite_m_axiModuleGenerator.hpp | |
| ReadWriteDP_arrayModuleGenerator.cpp | |
| ReadWriteDP_arrayModuleGenerator.hpp | |
| TestbenchAcknowledgeModuleGenerator.cpp | |
| TestbenchAcknowledgeModuleGenerator.hpp | |
| TestbenchArrayModuleGenerator.cpp | |
| TestbenchArrayModuleGenerator.hpp | |
| TestbenchAXIMModuleGenerator.cpp | |
| TestbenchAXIMModuleGenerator.hpp | |
| TestbenchAxisModuleGenerator.cpp | |
| TestbenchAxisModuleGenerator.hpp | |
| TestbenchDUTModuleGenerator.cpp | |
| TestbenchDUTModuleGenerator.hpp | |
| TestbenchFifoModuleGenerator.cpp | |
| TestbenchFifoModuleGenerator.hpp | |
| TestbenchHandshakeModuleGenerator.cpp | |
| TestbenchHandshakeModuleGenerator.hpp | |
| TestbenchNoneModuleGenerator.cpp | |
| TestbenchNoneModuleGenerator.hpp | |
| TestbenchOvalidModuleGenerator.cpp | |
| TestbenchOvalidModuleGenerator.hpp | |
| TestbenchValidModuleGenerator.cpp | |
| TestbenchValidModuleGenerator.hpp | |
| Write_acknowledgeModuleGenerator.cpp | |
| Write_acknowledgeModuleGenerator.hpp | |
| Write_axisModuleGenerator.cpp | |
| Write_axisModuleGenerator.hpp | |
| Write_fifoModuleGenerator.cpp | |
| Write_fifoModuleGenerator.hpp | |
| Write_handshakeModuleGenerator.cpp | |
| Write_handshakeModuleGenerator.hpp | |
| Write_none_registeredModuleGenerator.cpp | |
| Write_none_registeredModuleGenerator.hpp | |
| Write_noneModuleGenerator.cpp | |
| Write_noneModuleGenerator.hpp | |
| Write_validModuleGenerator.cpp | |
| Write_validModuleGenerator.hpp | |
| ► scheduling | |
| ASLAP.cpp | Class implementation for ASLAP class methods |
| ASLAP.hpp | Class specifying ALAP and ASAP algorithms |
| parametric_list_based.cpp | Class implementation of the parametric_list_based structure |
| parametric_list_based.hpp | Class definition of the list_based structure |
| priority.cpp | Set of classes used to define different priority schemes |
| priority.hpp | This package is used to drive the list based algorithm with different type of priority schemes |
| rehashed_heap.hpp | This package provides the class used to represent the priority queues adopted by the list based algorithm |
| schedule.cpp | Class implementation of the schedule data structure |
| schedule.hpp | Data structure used to store the schedule of the operations |
| scheduling.cpp | Base class for all scheduling algorithms |
| scheduling.hpp | Base class for all scheduling algorithms |
| sdc_scheduling.cpp | Implementation of the sdc scheduling |
| sdc_scheduling.hpp | Class definition of the sdc scheduling |
| ► simulation | |
| c_initialization_flex_lexer.hpp | Header file for LEX based lexer for C initialization string |
| c_initialization_parser.cpp | Interface to parse the initialization of c variable |
| c_initialization_parser.hpp | Interface to parse the initialization of c variable |
| c_initialization_parser_functor.cpp | Specification of the abstract functor used during parsing of C initialization string |
| c_initialization_parser_functor.hpp | Specification of the abstract functor used during parsing of C initialization string |
| c_initialization_parser_node.hpp | Specification of the data structure associated with a node during c initialization parsing |
| compute_reserved_memory.cpp | Specification of the functor used to compute size of objects starting from C initialization string |
| compute_reserved_memory.hpp | Specification of the functor used to compute size of objects starting from C initialization string |
| CTestbenchExecution.cpp | |
| CTestbenchExecution.hpp | |
| memory_initialization_c_writer.cpp | |
| memory_initialization_c_writer.hpp | Functor used to write c code which writes initialization of the memory |
| memory_initialization_writer.cpp | Functor used to write initialization of the memory |
| memory_initialization_writer.hpp | Functor used to write initialization of the memory |
| memory_initialization_writer_base.cpp | |
| memory_initialization_writer_base.hpp | Abstract base class for functor used to write initialization of the memory |
| SimulationInformation.hpp | |
| test_vector_parser.cpp | |
| test_vector_parser.hpp | |
| testbench_generation.cpp | Generate HDL testbench for the top-level kernel testing |
| testbench_generation.hpp | Generate HDL testbench for the top-level kernel testing |
| ► stg | |
| BB_based_stg.cpp | |
| BB_based_stg.hpp | |
| state_transition_graph.cpp | File contanining the structures necessary to manage a graph that will represent a state transition graph |
| state_transition_graph.hpp | This file contains the structures needed to manage a graph that will represent the state transition graph |
| state_transition_graph_manager.cpp | |
| state_transition_graph_manager.hpp | This file contains the structures needed to manage a graph that will represent the state transition graph |
| StateTransitionGraph_constructor.cpp | File containing the structures necessary to manage a graph that will represent a state transition graph |
| StateTransitionGraph_constructor.hpp | File contanining the structures necessary to manage a graph that will represent a state transition graph |
| STG_creator.cpp | Base class for all STG creation algorithms |
| STG_creator.hpp | Base class for all the STG creation algorithms |
| ► vcd | |
| CallGraphUnfolding.cpp | |
| CallGraphUnfolding.hpp | |
| CallSitesCollectorVisitor.cpp | |
| CallSitesCollectorVisitor.hpp | |
| Discrepancy.hpp | |
| HWDiscrepancyAnalysis.cpp | |
| HWDiscrepancyAnalysis.hpp | |
| HWPathComputation.cpp | |
| HWPathComputation.hpp | |
| UnfoldedCallGraph.hpp | |
| UnfoldedCallInfo.hpp | |
| UnfoldedFunctionInfo.hpp | |
| vcd_trace_head.cpp | |
| vcd_trace_head.hpp | |
| vcd_utility.cpp | |
| vcd_utility.hpp | |
| VcdSignalSelection.cpp | |
| VcdSignalSelection.hpp | |
| ► virtual_components | |
| adder_conn_obj.hpp | Class implementation of the adder connection module |
| commandport_obj.hpp | Base class for all command ports into datapath |
| conv_conn_obj.hpp | Class implementation of the connection module converting the type and the size of connection objects |
| dataport_obj.hpp | Base class for all dataports into datapath |
| funit_obj.hpp | Base class for all register into datapath |
| generic_obj.cpp | Base class for all resources into datapath |
| generic_obj.hpp | Base class for all resources into datapath |
| multi_unbounded_obj.hpp | Base class for all unbounded objects added to datapath |
| mux_obj.cpp | |
| mux_obj.hpp | Base class for multiplexer into datapath |
| register_obj.hpp | Base class for all register into datapath |
| hls.cpp | Data structure implementation for high-level synthesis flow |
| hls.hpp | Data structure definition for high-level synthesis flow |
| hls_constraints.cpp | Data structure implementation for HLS constraints |
| hls_constraints.hpp | Data structure definition for HLS constraints |
| hls_device.cpp | HLS specialization of generic_device |
| hls_device.hpp | HLS specialization of generic_device |
| hls_flow_step_factory.cpp | Factory for scheduling |
| hls_flow_step_factory.hpp | Factory for hls flow step |
| hls_function_step.cpp | Base class for all HLS algorithms |
| hls_function_step.hpp | |
| hls_manager.cpp | Data structure containing all the information for HLS |
| hls_manager.hpp | Data structure representing the entire HLS information |
| hls_step.cpp | |
| hls_step.hpp | |
| ► ilp | |
| CbcBranchUser.hpp | |
| glpk_solver.cpp | Linear Programming solver according to the newer syntax (from version 4.35) of the GLPK solver |
| glpk_solver.hpp | Linear Programming solver according to the newer syntax (from version 4.35) of the GLPK solver |
| meilp_solver.cpp | This class provide an interface to lp_solve and glpk solvers |
| meilp_solver.hpp | This class provide an interface to different solvers |
| objective_function.cpp | This file gives the implementation of the objective_function class |
| objective_function.hpp | This file defines the objective function class |
| problem_dim.cpp | This file implements the problem_dim struct |
| problem_dim.hpp | This file defines the problem_dim struct |
| ► intermediate_representations | |
| ► aadl_asn | |
| aadl_information.cpp | The information collected from aadl file |
| aadl_information.hpp | The information collected from aadl file |
| asn_type.cpp | Data classes storing information for asn types |
| asn_type.hpp | Data classes storing information for asn types |
| ► hls | |
| hls_function_ir.cpp | Base class for intermediate representation used by HLS ifunction steps |
| hls_function_ir.hpp | Base class for intermediate representation used by HLS ifunction steps |
| hls_ir.cpp | Base class for intermediate representation used by HLS steps |
| hls_ir.hpp | Base class for intermediate representation used by HLS steps |
| intermediate_representation.cpp | Base class for intermediate representation |
| intermediate_representation.hpp | Base class for intermediate representation |
| ► parser | |
| ► aadl | |
| aadl_lexer.hpp | Header file for LEX based lexer for aadl file |
| aadl_parser.cpp | Specification of the aadl parsing interface function |
| aadl_parser.hpp | Specification of the aadl parsing interface function |
| aadl_parser_node.cpp | Specification of the data structure associated with a node during aadl parsing |
| aadl_parser_node.hpp | Specification of the data structure associated with a node during aadl parsing |
| ► asn | |
| asn_lexer.hpp | Header file for LEX based lexer for asn file |
| asn_parser.cpp | Specification of the asn parsing interface function |
| asn_parser.hpp | Specification of the asn parsing interface function |
| asn_parser_node.cpp | Specification of the data structure associated with a node during asn parsing |
| asn_parser_node.hpp | Specification of the data structure associated with a node during asn parsing |
| ► compiler | |
| parse_tree.cpp | Implementation of the tree parsing interface function |
| parse_tree.hpp | Specification of the tree (GCC raw) parsing interface function |
| token_interface.cpp | Implementation of interface to token objects |
| token_interface.hpp | A simple interface to token object of the raw files |
| treeLexer.hpp | Header file for LEX based lexer for GCC raw files |
| ► data_xml | |
| data_xml_parser.cpp | Parse xml file containing generic data |
| data_xml_parser.hpp | Parse xml file containing generic data |
| ► discrepancy | |
| discrepancyLexer.hpp | |
| DiscrepancyOpInfo.cpp | |
| DiscrepancyOpInfo.hpp | |
| parse_discrepancy.cpp | |
| parse_discrepancy.hpp | |
| ► polixml | |
| xml_dom_parser.cpp | XML DOM parser |
| xml_dom_parser.hpp | XML DOM parser |
| xmlLexer.hpp | Header file for LEX based lexer for the xml format |
| ► pragma | |
| PragmaParser.cpp | Parsing pragma from C sources |
| PragmaParser.hpp | Parsing pragma from C sources |
| ► vcd | |
| sig_variation.cpp | |
| sig_variation.hpp | |
| vcd_parser.cpp | |
| vcd_parser.hpp | |
| parser_flow_step.cpp | This class contains the base representation for a generic parser step |
| parser_flow_step.hpp | This class contains the base representation for a generic parser step |
| parser_flow_step_factory.cpp | Factory for parser flow step |
| parser_flow_step_factory.hpp | Factory for parser flow step |
| ► polixml | |
| polixml.hpp | |
| xml_att_decl_node.hpp | |
| xml_attribute.hpp | |
| xml_comment_node.hpp | |
| xml_document.hpp | |
| xml_element.hpp | |
| xml_node.cpp | |
| xml_node.hpp | |
| xml_text_node.hpp | |
| ► pragma | |
| pragma_manager.cpp | Implementation for methods used to manage pragma annotations |
| pragma_manager.hpp | Manager for pragma annotations |
| ► technology | |
| area_info.cpp | Collect information about resource area |
| area_info.hpp | Collect information about resource area |
| generic_device.cpp | Generic device description |
| generic_device.hpp | Generic device description |
| library_manager.cpp | Class implementation of the manager of the specific technology library |
| library_manager.hpp | Class specification of the manager for each library |
| parse_technology.cpp | Implementation of the technology parsing interface function |
| parse_technology.hpp | Input function used to read the technology data structures |
| RTL_characterization.cpp | Class implementing RTL characterization |
| RTL_characterization.hpp | Class for performing RTL characterization |
| technology_manager.cpp | Class implementation of the manager of the technology library structures |
| technology_manager.hpp | Class specification of the manager of the technology library data structures |
| technology_node.cpp | Class implementation of the technology node description |
| technology_node.hpp | Class specification of the data structures used to manage technology information |
| technology_wishbone.hpp | Utility header to access wishbone technology library |
| time_info.cpp | Collect information about resource performance |
| time_info.hpp | Collect information about resource performance |
| ► tree | |
| behavioral_helper.cpp | |
| behavioral_helper.hpp | |
| ext_tree_node.cpp | Class implementation of the tree_node structures not present in gcc intermediate representation |
| ext_tree_node.hpp | Classes specification of the tree_node data structures not present in the gcc |
| function_decl_refs.cpp | Tree node visitor collecting the function_decl referred by starting from a given node |
| function_decl_refs.hpp | Tree node visitor collecting the function_decl referred by starting from a given node |
| gimple_writer.cpp | |
| gimple_writer.hpp | Tree node writer |
| prettyPrintVertex.cpp | Helper class supporting the printing of vertexes of a graph |
| prettyPrintVertex.hpp | Helper class supporting the printing of vertexes of a graph |
| raw_writer.cpp | Tree node writer |
| raw_writer.hpp | Tree node writer |
| tree_basic_block.cpp | Data structure describing a basic block at tree level |
| tree_basic_block.hpp | Data structure describing a basic block at tree level |
| tree_common.hpp | This C++ header file contains common macros for the tree structure |
| tree_helper.cpp | This file collects some utility functions |
| tree_helper.hpp | This file collects some utility functions |
| tree_manager.cpp | Class implementation of the manager of the tree structures extracted from the raw file |
| tree_manager.hpp | Class specification of the manager of the tree structures extracted from the raw file |
| tree_manipulation.cpp | Class implementing some useful functions to create tree nodes and to manipulate the tree manager |
| tree_manipulation.hpp | Class defining some useful functions to create tree nodes and to manipulate the tree manager |
| tree_node.cpp | Class implementation of the tree_node structures |
| tree_node.hpp | Classes specification of the tree_node data structures |
| tree_node_dup.cpp | Tree node duplication class |
| tree_node_dup.hpp | Tree node duplication class |
| tree_node_factory.cpp | Tree node factory |
| tree_node_factory.hpp | Tree node factory |
| tree_node_finder.cpp | Tree node finder |
| tree_node_finder.hpp | Tree node finder |
| tree_node_mask.cpp | Tree node mask |
| tree_node_mask.hpp | Tree node mask |
| tree_nodes_merger.cpp | Tree node merger classes |
| tree_nodes_merger.hpp | Tree node merger classess |
| tree_reindex.cpp | Class implementation of the tree_reindex support class |
| tree_reindex.hpp | Class specification of the tree_reindex support class |
| type_casting.cpp | Tree node visitor collecting the types used in type casting |
| type_casting.hpp | Tree node visitor collecting the types used in type casting |
| var_pp_functor.cpp | Helper for reading data about internal representation after behavioral_manager analysis about specification produced from tree |
| var_pp_functor.hpp | |
| ► utility | |
| APInt.cpp | |
| APInt.hpp | |
| augmented_vector.hpp | Class for representing augmented vector based on std::vector |
| cpu_stats.cpp | Utility managing CPU statistics |
| cpu_stats.hpp | Utility managing CPU statistics |
| cpu_time.hpp | Include a set of utilities used to manage CPU time measures |
| custom_map.hpp | Redefinition of map to manage ordered/unordered structures |
| custom_set.hpp | Redefinition of set to manage ordered/unordered structures |
| dbgPrintHelper.hpp | File containing functions and utilities to support the printing of debug messagges |
| exceptions.cpp | Exceptions managed by PandA |
| exceptions.hpp | Exceptions managed by PandA |
| Factory.hpp | Generic factory class implementation with self-registering derived classes |
| fileIO.cpp | Utility function used to read files |
| fileIO.hpp | Utility function used to read files |
| gzstream.hpp | |
| hash_helper.hpp | This file collects some hash functors |
| indented_output_stream.cpp | |
| indented_output_stream.hpp | Class to print indented code |
| Lexer_utilities.hpp | Macro used to instantiate LEX based lexers |
| math_function.hpp | Mathematical utility function not provided by standard libraries |
| panda_types.hpp | |
| refcount.hpp | Template definition of refcount |
| simple_indent.cpp | Implementation of the simple pretty print functor |
| simple_indent.hpp | Simple pretty print functor |
| Statistics.cpp | This file collects some algebric statistical functions |
| Statistics.hpp | This file collects some algebric statistical functions |
| string_manipulation.cpp | Auxiliary methods for manipulating string |
| string_manipulation.hpp | Auxiliary methods for manipulating string |
| strong_typedef.hpp | This class macros for the definition of strong typedef |
| utility.cpp | This file collects some utility functions and macros |
| utility.hpp | This file collects some utility functions and macros |
| visitor.hpp | Visitor/walker design pattern |
| xml_helper.hpp | Some macro used to interface with the XML library |
| ► wrapper | |
| ► compiler | |
| compiler_wrapper.cpp | |
| compiler_wrapper.hpp | Implementation of the wrapper to Gcc for C sources |
| ► flopoco | |
| flopoco_wrapper.cpp | Implementation of the wrapper to FloPoCo for VHDL code generation |
| flopoco_wrapper.hpp | Wrapper to FloPoCo for VHDL code generation |
| FPAssign.cpp | FPAssign module for flopoco |
| FPAssign.hpp | FPAssign module for flopoco |
| FPge_expr.cpp | |
| FPge_expr.hpp | FPge_expr module for flopoco |
| FPgt_expr.cpp | FPgt_expr module for flopoco |
| FPgt_expr.hpp | FPgt_expr module for flopoco |
| FPle_expr.cpp | |
| FPle_expr.hpp | FPle_expr module for flopoco |
| FPlt_expr.cpp | |
| FPlt_expr.hpp | FPlt_expr module for flopoco |
| ► simulation | |
| ► modelsim | |
| modelsimWrapper.cpp | Implementation of the wrapper to modelsim compiler and simulator |
| modelsimWrapper.hpp | Wrapper to modelsim |
| ► verilator | |
| VerilatorWrapper.cpp | Wrapper to Verilator simulator |
| VerilatorWrapper.hpp | Wrapper to Verilator simulator |
| ► xsim | |
| VIVADO_xsim_wrapper.cpp | Implementation of the wrapper to XSIM |
| VIVADO_xsim_wrapper.hpp | Wrapper to XSIM by XILINX VIVADO |
| SimulationTool.cpp | Implementation of some methods for the interface with simulation tools |
| SimulationTool.hpp | Abstract class for a generic simulation tool |
| ► synthesis | |
| ► altera | |
| AlteraBackendFlow.cpp | Implementation of the wrapper to Altera tools |
| AlteraBackendFlow.hpp | Wrapper to implement a synthesis tools by Altera |
| AlteraWrapper.cpp | Implementation of the wrapper to Altera tools |
| AlteraWrapper.hpp | Wrapper to synthesis tools by Altera |
| quartus_13_report_wrapper.cpp | Implementation of the wrapper to quartus reporting tool |
| quartus_13_report_wrapper.hpp | Wrapper to invoke quartus_report tool by Altera |
| quartus_13_wrapper.cpp | Wrapper to quartus 13.x |
| quartus_13_wrapper.hpp | Wrapper to quartus 13.x and newer |
| quartus_power_wrapper.cpp | |
| quartus_power_wrapper.hpp | |
| quartus_report_wrapper.cpp | Implementation of the wrapper to quartus reporting tool |
| quartus_report_wrapper.hpp | Wrapper to invoke quartus_report tool by Altera |
| quartus_wrapper.cpp | Wrapper to quartus 14.0 and newer |
| quartus_wrapper.hpp | Wrapper to quartus 14.0 and newer |
| ► lattice | |
| lattice_flow_wrapper.cpp | Implementation of the wrapper to lattice_flow |
| lattice_flow_wrapper.hpp | Wrapper to invoke lattice_flow tool by Lattice |
| LatticeBackendFlow.cpp | Implementation of the wrapper to Lattice tools |
| LatticeBackendFlow.hpp | Wrapper to implement a synthesis tools by Lattice |
| LatticeWrapper.cpp | Implementation of the wrapper to Lattice tools |
| LatticeWrapper.hpp | Wrapper to synthesis tools by Lattice |
| ► nanoxplore | |
| NanoXploreBackendFlow.cpp | Wrapper to NanoXplore synthesis tools |
| NanoXploreBackendFlow.hpp | Wrapper to NanoXplore synthesis tools
|
| NanoXploreWrapper.cpp | Implementation of the wrapper to NanoXplore tools |
| NanoXploreWrapper.hpp | Wrapper to synthesis tools by NanoXplore |
| nxpython_flow_wrapper.cpp | Implementation of the wrapper to nxpython_flow |
| nxpython_flow_wrapper.hpp | Wrapper to invoke nxpython_flow tool by NANOXPLORE |
| ► xilinx | |
| ► ise | |
| map_wrapper.cpp | Implementation of the wrapper to MAP |
| map_wrapper.hpp | Wrapper to map by XILINX |
| ngdbuild_wrapper.cpp | Implementation of the wrapper to NGDBUILD |
| ngdbuild_wrapper.hpp | Wrapper to ngdbuild by XILINX |
| par_wrapper.cpp | Implementation of the wrapper to MAP |
| par_wrapper.hpp | Wrapper to par by XILINX |
| trce_wrapper.cpp | Implementation of the wrapper to TRCE |
| trce_wrapper.hpp | Wrapper to trce by XILINX |
| xst_wrapper.cpp | Implementation of the wrapper to XST |
| xst_wrapper.hpp | Wrapper to XST by XILINX |
| vivado_flow_wrapper.cpp | Implementation of the wrapper to vivado_flow |
| vivado_flow_wrapper.hpp | Wrapper to invoke vivado_flow tool by XILINX |
| xilinx_taste_backend_flow.cpp | Wrapper to implement a synthesis tools by Xilinx targeting Taste architecture |
| xilinx_taste_backend_flow.hpp | Wrapper to implement a synthesis tools by Xilinx targeting Taste architecture |
| XilinxBackendFlow.cpp | Implementation of the wrapper to Xilinx tools |
| XilinxBackendFlow.hpp | Wrapper to implement a synthesis tools by Xilinx |
| XilinxWrapper.cpp | Implementation of the wrapper to Xilinx tools |
| XilinxWrapper.hpp | Wrapper to synthesis tools by Xilinx |
| BackendFlow.cpp | This file contains the implementation of the methods for the class defining the backend flow |
| BackendFlow.hpp | This file contains the definition of the configurable flow for generating and executing synthesis scripts |
| bash_flow_wrapper.cpp | Implementation of the wrapper to bash_flow |
| bash_flow_wrapper.hpp | Wrapper to invoke a generic bash script |
| BashBackendFlow.cpp | Backend based on a simple bash script |
| BashBackendFlow.hpp | Backend based on a simple bash script |
| DesignParameters.hpp | This file contains the definition of the parameters for the synthesis tools |
| SynthesisTool.cpp | Implementation of some methods for the interface to synthesis tools |
| SynthesisTool.hpp | Abstract class for a generic synthesis tool |
| xml_script_command.cpp | Classes for handling configuration files |
| xml_script_command.hpp | Classes for handling configuration files |
| ToolManager.cpp | Implementation of the tool manager |
| ToolManager.hpp | Class to manage a wrapped tool |
| bambu.cpp | High level Synthesis tool |
| BambuParameter.cpp | This file contains the implementation of some methods for parameter parsing in Bambu tool |
| BambuParameter.hpp | |
| constant_strings.hpp | Constant strings |
| eucalyptus.cpp | Tool for estimation of RTL descriptions |
| EucalyptusParameter.cpp | This file contains the implementation of some methods for parameter parsing in Eucalyptus tool |
| EucalyptusParameter.hpp | |
| global_variables.cpp | Global variables used by each tool |
| Parameter.cpp | |
| Parameter.hpp | This class is used to manage the command-line or XML options |
| spider.cpp | Parser for deep profiling information |
| SpiderParameter.cpp | |
| SpiderParameter.hpp | |
| tree-panda-gcc-Parameter.cpp | |
| tree-panda-gcc-Parameter.hpp | |
| tree-panda-gcc.cpp | Panda working as cross compiler targeting tree nodes.. |
1.8.13