luke/verilator
1
0
Fork 0
mirror of https://github.com/verilator/verilator.git synced 2026-10-06 01:54:01 +02:00
Code Issues Packages Projects Releases Wiki Activity

Fix MinGW compile issues, msg2636.

Browse Source
This commit is contained in:
Wilson Snyder
2018-09-20 18:09:19 -04:00
parent d4159811d2
commit a8519a7a53
4 changed files with 20 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/V3Partition.cpp
+3 -3
View File
@@ -347,7 +347,7 @@ private:
}
void go() {
// Generate a pseudo-random graph
uint16_t rngState[3] = { 0xdead, 0xbeef, 0xf000 };
vluint64_t rngState[2] = {VL_ULL(0x12345678), VL_ULL(0x9abcdef0)};
// Create 50 vertices
for (unsigned i = 0; i < 50; ++i) {
m_vx[i] = new V3GraphVertex(&m_graph);
@@ -355,8 +355,8 @@ private:
// Create 250 edges at random. Edges must go from
// lower-to-higher index vertices, so we get a DAG.
for (unsigned i = 0; i < 250; ++i) {
unsigned idx1 = nrand48(rngState) % 50;
unsigned idx2 = nrand48(rngState) % 50;
unsigned idx1 = V3Os::rand64(rngState) % 50;
unsigned idx2 = V3Os::rand64(rngState) % 50;
if (idx1 > idx2) {
new V3GraphEdge(&m_graph, m_vx[idx2], m_vx[idx1], 1);
} else if (idx2 > idx1) {