make sure using nonmutated A

Author: jClugstor

ext/LinearSolveForwardDiffExt.jl

@@ -51,11 +51,10 @@ function linearsolve_forwarddiff_solve(cache::DualLinearCache, alg, args...; kwa
 
     rhs_list = xp_linsolve_rhs(uu, ∂_A, ∂_b)
 
-    partial_prob = LinearProblem(cache.cache.A, rhs_list[1])
+    new_A = nodual_value(cache.prob.A)
+    partial_prob = LinearProblem(new_A, rhs_list[1])
     partial_cache = init(partial_prob, alg, args...; kwargs...)
 
-    Main.@infiltrate
-
     for i in eachindex(rhs_list)
         partial_cache.b = rhs_list[i]
         rhs_list[i] = copy(solve!(partial_cache, alg).u)
@@ -110,7 +109,8 @@ function xp_linsolve_rhs(uu, ∂_A::Union{<:Partials, <:AbstractArray{<:Partials
     b_list = partials_to_list(∂_b)
 
     Auu = [A * uu for A in A_list]
-    b_list .- Auu
+
+    return b_list .- Auu
 end
 
 function xp_linsolve_rhs(
@@ -119,13 +119,12 @@ function xp_linsolve_rhs(
 
     Auu = [A * uu for A in A_list]
 
-    -Auu
+    return -Auu
 end
 
 function xp_linsolve_rhs(
         uu, ∂_A::Nothing, ∂_b::Union{<:Partials, <:AbstractArray{<:Partials}})
     b_list = partials_to_list(∂_b)
-    Main.@infiltrate
     b_list
 end