mirrors/yosys
3
0
Fork 0
mirror of https://github.com/YosysHQ/yosys synced 2025-10-31 03:32:29 +00:00
Code Activity
15679 commits 122 branches 59 tags 72 MiB
Commit graph

15679 commits

This branch
This branch
All branches
Author SHA1 Message Date
Robert O'Callahan
652190bd50 Hash strings 8 bytes at a time 2025-09-01 02:45:57 +00:00
Robert O'Callahan
c2ad2a407a Optimize Const::hash_into to hash packed bits efficiently 2025-09-01 02:45:57 +00:00
Robert O'Callahan
7814aa0c31 Use fast path for 32-bit Const integer constructor in more places 2025-09-01 02:45:57 +00:00
Robert O'Callahan
ec52d6c649 Fast path for Const::operator== 2025-09-01 02:45:57 +00:00
Robert O'Callahan
60099e5005 Make Const::as_bool and Const::as_int work with packed bits without decaying to vector<State> 2025-09-01 02:45:57 +00:00
Robert O'Callahan
e206b059f6 Make Const::Const(long long) constructor use packed bits internally if possible 2025-09-01 02:45:57 +00:00
Robert O'Callahan
31fc0f53e5 Deprecate Const::bitvectorize() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
e41bf86cc3 Deprecate Const::bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
f9ee5e4c31 Update tests to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
975bbf2d6d Update techlibs to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
360a625785 Update kernel to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
67e4a0a48a Update passes/hierarchy to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
bebd10377b Update passes/tests to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
a8cc9202b9 Update passes/techmap to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
510eac4ad0 Update passes/sat to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
32b53f177c Update passes/proc to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
bab72e0af7 Update passes/opt to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
d4e2fa0c4f Update passes/memory to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
7c3cf9cc42 Update passes/fsm to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
d318775d97 Update passes/cmds to avoid bits() 2025-09-01 02:45:57 +00:00
Robert O'Callahan
24a95bd6cf Update frontends to avoid bits() 2025-09-01 02:45:56 +00:00
Robert O'Callahan
c89a4da607 Update backends to avoid bits() 2025-09-01 02:45:56 +00:00
Robert O'Callahan
e151fbc5df Update Const API with alternatives to direct use of bits() 
In particular, `Const::resize()`, `Const::set()`, and `Const::iterator`.
 2025-09-01 02:44:23 +00:00
Robert O'Callahan
8bae779bb8 Fix Const::const_iterator tag to be bidirectional_iterator_tag 2025-08-31 23:43:27 +00:00
Robert O'Callahan
4657768506 Fix const_iterator postincrement behavior 2025-08-31 23:42:53 +00:00
Emil J
c5d096b7b8
Merge pull request #5308 from YosysHQ/emil/opt_muxtree-refactor 
opt_muxtree: refactor
 2025-08-25 16:48:01 +02:00
Emil J. Tywoniak
b45e5854bf opt_muxtree: comment wording 2025-08-25 16:36:07 +02:00
Emil J
2163b3ebe4
Merge pull request #5313 from rocallahan/hash-ref 
hash_ops should take all parameters by reference instead of requiring copies of vectors, tuples etc
 2025-08-25 16:31:36 +02:00
Miodrag Milanović
c7e6275d0d
Merge pull request #5045 from danderson/push-nwpulrqymkqp 
techlibs/lattice: add missing clock muxes to ECP5 block ram blackboxes
 2025-08-25 15:28:34 +02:00
Emil J
a67a3ca49c
Merge pull request #4497 from YosysHQ/emil/bitpattern-comments 
bitpattern: comments
 2025-08-25 15:25:37 +02:00
Miodrag Milanovic
dd5cc66b95 Merge branch 'Jiahui17-bugfix/remove-hardcoded-soname' 2025-08-25 07:47:01 +02:00
Miodrag Milanovic
9f0904d048 Makefile: fix hardcoded -install_name for libyosys.so 2025-08-25 07:46:34 +02:00
Miodrag Milanovic
c6b8f0eed7 Merge branch 'bugfix/remove-hardcoded-soname' of github.com:Jiahui17/yosys into Jiahui17-bugfix/remove-hardcoded-soname 2025-08-25 07:45:26 +02:00
Robert O'Callahan
b5aa3ab9f7 hash_ops should take all parameters by reference instead of requiring copies of vectors, tuples etc 2025-08-25 03:09:04 +00:00
github-actions[bot]
6fdcdd41de Bump version 2025-08-22 00:23:32 +00:00
Emil J
65109822b4
Merge pull request #5305 from rocallahan/opt-merge-perf 
Use commutative hashing in `OptMergePass` instead of allocating containers and sorting them to get canonical hashes
 2025-08-21 17:58:55 +02:00
Emil J. Tywoniak
4dea774171 opt_muxtree: refactor 2025-08-21 12:52:22 +02:00
Ethan Mahintorabi
d10190606c verilog: Lower required bison version to 3.6 
We're currently on version 3.6 of bison at Google, and Yosys
still correctly builds with it. This should better reflect
the actual requirements rather than an overly restrictive
check. If features from 3.8 are required it seems like bumping
would be appropriate.

Signed-off-by: Ethan Mahintorabi <ethanmoon@google.com>
 2025-08-21 08:26:33 +01:00
Ethan Mahintorabi
7f0130efce verilog: Fix missing sstream include 
Signed-off-by: Ethan Mahintorabi <ethanmoon@google.com>
 2025-08-21 08:26:20 +01:00
github-actions[bot]
4926e846f6 Bump version 2025-08-21 00:22:37 +00:00
Robert O'Callahan
8c04e5266c Use commutative hashing instead of expensive allocation and sorting 
For one of our large circuits, this improves the `OptMergePass` runtime
from about 150s to about 130s. It's also simpler code.
 2025-08-20 19:35:22 +00:00
Robert O'Callahan
7d0ea0d64f Refactor call to sorted_pmux_in to avoid copying the connection dictionary 2025-08-20 19:35:22 +00:00
Emil J
025d7a5641
Merge pull request #5290 from rocallahan/opt-mux-perf 
Make `OptMuxtreePass` int-indexed vectors into hashtables
 2025-08-20 20:00:26 +02:00
Jannis Harder
c9ad7b7ad0
Merge pull request #5284 from jix/fix_5282 
check: Limit detailed cell edge checking for $pmux and $bmux
 2025-08-20 14:27:19 +02:00
Emil J
ba8af7ad8f
Merge pull request #5302 from rocallahan/commutative-hash 
Improve commutative hashing.
 2025-08-20 10:43:00 +02:00
Emil J. Tywoniak
01de9fb453 hashlib: extend unit test with subset collisions, shorten runtime 2025-08-20 00:08:23 +02:00
Robert O'Callahan
3a5742ffd2 Improve commutative hashing. 
The simple XOR `commutative_eat()` implementation produces a lot of collisions.
https://www.preprints.org/manuscript/201710.0192/v1/download is a useful reference on this topic.

Running the included `hashTest.cc` without the hashlib changes, I get 49,580,349 collisions.
The 49,995,000 (i,j) pairs (0 <= i < 10000, i < j < 10000) hash into only 414,651 unique hash values.
We get simple collisions like (0,1) colliding with (2,3).

With the hashlib changes, we get only 707,099 collisions and 49,287,901 unique hash values.
Much better! The `commutative_hash` implementation corresponds to `Sum(4)` in the paper
mentioned above.
 2025-08-19 21:45:52 +00:00
Emil J
b0d709f6cf
Merge pull request #5294 from rocallahan/precision-tests 
Add tests for dynamic precision and with with an int parameter
 2025-08-19 16:42:49 +02:00
Miodrag Milanović
5fd9f54482
Merge pull request #5300 from donn/wheel_fixes 
wheels: bison 3.8 on almalinux + memory pressure easing
 2025-08-19 11:44:12 +02:00
github-actions[bot]
bfc9a322e2 Bump version 2025-08-19 00:24:35 +00:00