Martin Povišer 568418b50b opt_lut: Replace -dlogic with -tech ice40

2024-01-15 12:35:21 +01:00

..

Makefile.inc

Add opt_ffinv pass.

2022-05-13 23:02:30 +02:00

muxpack.cc

Fixing old e-mail addresses and deadnames

2021-06-08 00:39:36 +02:00

opt_clean.cc

dft_tag: Implement $overwrite_tag and $original_tag

2023-09-13 11:32:36 +02:00

opt_demorgan.cc

Fixing old e-mail addresses and deadnames

2021-06-08 00:39:36 +02:00

opt_dff.cc

Fitting help messages to 80 character width

2022-08-24 10:40:57 +12:00

opt_expr.cc

Fix translation bug: The old code really checks for the presense of a node, not an edge in glift and flatten.

2023-10-05 17:01:42 -07:00

opt_ffinv.cc

Fixes for some of clang scan-build detected issues

2023-01-17 12:58:08 +01:00

opt_lut_ins.cc

ecp5_gsr -> lattice_gsr, change opt_lut_ins to accept lattice as tech

2023-08-22 10:50:11 +02:00

opt_lut.cc

opt_lut: Replace -dlogic with -tech ice40

2024-01-15 12:35:21 +01:00

opt_mem_feedback.cc

kernel/mem: Introduce transparency masks.

2021-08-11 00:04:16 +02:00

opt_mem_priority.cc

opt_mem_priority: Fix non-ascii char in help message.

2021-12-09 00:56:14 +01:00

opt_mem_widen.cc

Add opt_mem_widen pass.

2021-08-14 01:06:23 +02:00

opt_mem.cc

opt_mem: Remove constant-value bit lanes.

2022-05-07 23:13:16 +02:00

opt_merge.cc

Explicitly use uint64_t as the type of fingerprint to avoid type mismatch with some compilers.

2023-10-03 15:02:02 -07:00

opt_muxtree.cc

opt_muxtree: Update port_off and port_idx even for constant bits

2021-06-11 12:06:35 +01:00

opt_reduce.cc

opt_reduce: Fix use-after-free.

2022-07-23 17:27:26 +02:00

opt_share.cc

opt_share: Fix input confusion with ANDNOT, ORNOT gates

2023-07-20 20:58:52 +01:00

opt.cc

opt_merge: Add -keepdc option required for formal verification

2022-04-01 21:03:20 +02:00

pmux2shiftx.cc

Fixing old e-mail addresses and deadnames

2021-06-08 00:39:36 +02:00

rmports.cc

Fixing old e-mail addresses and deadnames

2021-06-08 00:39:36 +02:00

share.cc

Speed up TopoSort. The main sorting algorithm implementation in TopoSort::sort_worker is 11-12x faster. Overall, the complete sequence of building the graph and sorting is about 2.5-3x faster. The overall impact in e.g. the replace_const_cells optimization pass is a ~25% speedup. End-to-end impact on our synthesis flow is about 3%.

2023-09-20 15:49:05 -07:00

wreduce.cc

wreduce: Group reconnections

2023-08-04 14:43:59 +01:00