@@ -108,7 +108,6 @@ function alias_elimination!(state::TearingState)
108
108
109
109
lineqs = BitSet (old_to_new[e] for e in mm. nzrows)
110
110
for (ieq, eq) in enumerate (eqs)
111
- # TODO : fix this
112
111
ieq in lineqs && continue
113
112
eqs[ieq] = substitute (eq, subs)
114
113
end
@@ -275,14 +274,6 @@ function Base.in(i::Int, agk::AliasGraphKeySet)
275
274
1 <= i <= length (aliasto) && aliasto[i] != = nothing
276
275
end
277
276
278
- function reduce! (mm:: SparseMatrixCLIL , ag:: AliasGraph )
279
- for i in 1 : size (mm, 1 )
280
- adj_row = @view mm[i, :]
281
- locally_structure_simplify! (adj_row, nothing , ag)
282
- end
283
- mm
284
- end
285
-
286
277
function equality_diff_graph (ag:: AliasGraph , var_to_diff:: DiffGraph )
287
278
g = SimpleDiGraph {Int} (length (var_to_diff))
288
279
eqg = SimpleWeightedGraph {Int, Int} (length (var_to_diff))
@@ -484,7 +475,7 @@ function do_bareiss!(M, Mold, is_linear_variables)
484
475
end
485
476
end
486
477
bareiss_ops = ((M, i, j) -> nothing , myswaprows!,
487
- bareiss_update_virtual_colswap_mtk!, bareiss_zero!)
478
+ bareiss_update_virtual_colswap_mtk!, bareiss_zero!)
488
479
rank2, = bareiss! (M, bareiss_ops; find_pivot = find_and_record_pivot)
489
480
rank1 = something (rank1r[], rank2)
490
481
(rank1, rank2, pivots)
@@ -531,7 +522,9 @@ function reduce!(mm, mm_orig, ag, rank2, pivots = nothing)
531
522
end
532
523
533
524
function simple_aliases! (ag, graph, var_to_diff, mm_orig)
534
- echelon_mm, solvable_variables, (rank1, rank2, pivots) = aag_bareiss! (graph, var_to_diff, mm_orig)
525
+ echelon_mm, solvable_variables, (rank1, rank2, pivots) = aag_bareiss! (graph,
526
+ var_to_diff,
527
+ mm_orig)
535
528
536
529
# Step 2: Simplify the system using the Bareiss factorization
537
530
rk1vars = BitSet (@view pivots[1 : rank1])
0 commit comments