arnaucube/circom
1
0
Fork 0
mirror of https://github.com/arnaucube/circom.git synced 2026-02-06 18:56:40 +01:00
Code Issues Packages Projects Releases Wiki Activity

High Removed array

Browse Source
This commit is contained in:
Jordi Baylina
2020-09-19 18:36:35 +02:00
parent fc01aad8b6
commit f9f1d0c13e
1 changed files with 6 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/compiler.js
View File

@@ -340,6 +340,7 @@ async function reduceConstrains(ctx) {
possibleConstraints[i] = ctx.constraints.length - i -1; possibleConstraints[i] = ctx.constraints.length - i -1;
} }
let totalRemoved = 0;
while (possibleConstraints.length >0) { while (possibleConstraints.length >0) {
if (possibleConstraints.length>1<<20) { if (possibleConstraints.length>1<<20) {
nextPossibleConstraints = new BigArray(); nextPossibleConstraints = new BigArray();
@@ -359,7 +360,7 @@ async function reduceConstrains(ctx) {
if (!c) continue; if (!c) continue;
// Limit of number of lelements removed per step // Limit of number of lelements removed per step
if (nRemoved>500000) { if (nRemoved>5000000) {
nextPossibleConstraints[possibleConstraints[i]] = true; nextPossibleConstraints[possibleConstraints[i]] = true;
continue; continue;
} }
@@ -409,7 +410,7 @@ async function reduceConstrains(ctx) {
const cts = Object.keys(sig2constraint[isolatedSignal]); const cts = Object.keys(sig2constraint[isolatedSignal]);
for (let k=0; k<cts.length; k++) { for (let k=0; k<cts.length; k++) {
nextPossibleConstraints[cts[k]] = true; if (ctx.constraints[cts[k]]) nextPossibleConstraints[cts[k]] = true;
} }
} }
} }
@@ -464,6 +465,9 @@ async function reduceConstrains(ctx) {
} }
*/ */
possibleConstraints = nextPossibleConstraints; possibleConstraints = nextPossibleConstraints;
totalRemoved += nRemoved;
if (ctx.verbose) console.log(`Removed: ${totalRemoved} TotalConstraints: ${ctx.constraints.length}` );
} }