Skip to content

Commit

Permalink
Remove initial condition
Browse files Browse the repository at this point in the history
  • Loading branch information
huiyuxie committed Sep 2, 2024
1 parent 442b106 commit fe188bb
Show file tree
Hide file tree
Showing 10 changed files with 7 additions and 32 deletions.
4 changes: 2 additions & 2 deletions src/solvers/dg_1d.jl
Original file line number Diff line number Diff line change
Expand Up @@ -645,8 +645,8 @@ end
# Put everything together into a single function
# Ref: `rhs!` function in Trixi.jl

function rhs_gpu!(du_cpu, u_cpu, t, mesh::TreeMesh{1}, equations, initial_condition,
boundary_conditions, source_terms::Source, dg::DGSEM, cache) where {Source}
function rhs_gpu!(du_cpu, u_cpu, t, mesh::TreeMesh{1}, equations, boundary_conditions,
source_terms::Source, dg::DGSEM, cache) where {Source}
du, u = copy_to_device!(du_cpu, u_cpu)

cuda_volume_integral!(du, u, mesh, have_nonconservative_terms(equations), equations,
Expand Down
4 changes: 2 additions & 2 deletions src/solvers/dg_2d.jl
Original file line number Diff line number Diff line change
Expand Up @@ -1061,8 +1061,8 @@ end
# Put everything together into a single function
# Ref: `rhs!` function in Trixi.jl

function rhs_gpu!(du_cpu, u_cpu, t, mesh::TreeMesh{2}, equations, initial_condition,
boundary_conditions, source_terms::Source, dg::DGSEM, cache) where {Source}
function rhs_gpu!(du_cpu, u_cpu, t, mesh::TreeMesh{2}, equations, boundary_conditions,
source_terms::Source, dg::DGSEM, cache) where {Source}
du, u = copy_to_device!(du_cpu, u_cpu)

cuda_volume_integral!(du, u, mesh, have_nonconservative_terms(equations), equations,
Expand Down
4 changes: 2 additions & 2 deletions src/solvers/dg_3d.jl
Original file line number Diff line number Diff line change
Expand Up @@ -1113,8 +1113,8 @@ end
# Put everything together into a single function
# Ref: `rhs!` function in Trixi.jl

function rhs_gpu!(du_cpu, u_cpu, t, mesh::TreeMesh{3}, equations, initial_condition,
boundary_conditions, source_terms::Source, dg::DGSEM, cache) where {Source}
function rhs_gpu!(du_cpu, u_cpu, t, mesh::TreeMesh{3}, equations, boundary_conditions,
source_terms::Source, dg::DGSEM, cache) where {Source}
du, u = copy_to_device!(du_cpu, u_cpu)

cuda_volume_integral!(du, u, mesh, have_nonconservative_terms(equations), equations,
Expand Down
3 changes: 1 addition & 2 deletions src/solvers/solvers.jl
Original file line number Diff line number Diff line change
Expand Up @@ -10,8 +10,7 @@ function rhs_gpu!(du_ode, u_ode, semi::SemidiscretizationHyperbolic, t)
u = wrap_array(u_ode, mesh, equations, solver, cache)
du = wrap_array(du_ode, mesh, equations, solver, cache)

rhs_gpu!(du, u, t, mesh, equations, initial_condition, boundary_conditions, source_terms,
solver, cache)
rhs_gpu!(du, u, t, mesh, equations, boundary_conditions, source_terms, solver, cache)

return nothing
end
Expand Down
4 changes: 0 additions & 4 deletions test/test_adevction_mortar.jl
Original file line number Diff line number Diff line change
Expand Up @@ -13,10 +13,6 @@ isdir(outdir) && rm(outdir, recursive = true)
# CPU kernels, which corresponds to requiring equality of about half of the significant digits
# (see https://docs.julialang.org/en/v1/base/math/#Base.isapprox).

# Basically, this heuristic method first checks whether this error bound (sometimes it is further
# relaxed) is satisfied. Any new methods and optimizations introduced later should at least satisfy
# this error bound.

# Test precision of the semidiscretization process
@testset "Test Linear Advection Mortar" begin
@testset "Linear Advection 2D" begin
Expand Down
4 changes: 0 additions & 4 deletions test/test_advection_basic.jl
Original file line number Diff line number Diff line change
Expand Up @@ -13,10 +13,6 @@ isdir(outdir) && rm(outdir, recursive = true)
# CPU kernels, which corresponds to requiring equality of about half of the significant digits
# (see https://docs.julialang.org/en/v1/base/math/#Base.isapprox).

# Basically, this heuristic method first checks whether this error bound (sometimes it is further
# relaxed) is satisfied. Any new methods and optimizations introduced later should at least satisfy
# this error bound.

# Test precision of the semidiscretization process
@testset "Test Linear Advection Basic" begin
@testset "Linear Advection 1D" begin
Expand Down
4 changes: 0 additions & 4 deletions test/test_euler_ec.jl
Original file line number Diff line number Diff line change
Expand Up @@ -13,10 +13,6 @@ isdir(outdir) && rm(outdir, recursive = true)
# CPU kernels, which corresponds to requiring equality of about half of the significant digits
# (see https://docs.julialang.org/en/v1/base/math/#Base.isapprox).

# Basically, this heuristic method first checks whether this error bound (sometimes it is further
# relaxed) is satisfied. Any new methods and optimizations introduced later should at least satisfy
# this error bound.

# Test precision of the semidiscretization process
@testset "Test Compressible Euler Flux Differencing" begin
@testset "Compressible Euler 1D" begin
Expand Down
4 changes: 0 additions & 4 deletions test/test_euler_source_terms.jl
Original file line number Diff line number Diff line change
Expand Up @@ -13,10 +13,6 @@ isdir(outdir) && rm(outdir, recursive = true)
# CPU kernels, which corresponds to requiring equality of about half of the significant digits
# (see https://docs.julialang.org/en/v1/base/math/#Base.isapprox).

# Basically, this heuristic method first checks whether this error bound (sometimes it is further
# relaxed) is satisfied. Any new methods and optimizations introduced later should at least satisfy
# this error bound.

# Test precision of the semidiscretization process
@testset "Test Compressible Euler Source Terms" begin
@testset "Compressible Euler 1D" begin
Expand Down
4 changes: 0 additions & 4 deletions test/test_hypdiff_nonperiodic.jl
Original file line number Diff line number Diff line change
Expand Up @@ -13,10 +13,6 @@ isdir(outdir) && rm(outdir, recursive = true)
# CPU kernels, which corresponds to requiring equality of about half of the significant digits
# (see https://docs.julialang.org/en/v1/base/math/#Base.isapprox).

# Basically, this heuristic method first checks whether this error bound (sometimes it is further
# relaxed) is satisfied. Any new methods and optimizations introduced later should at least satisfy
# this error bound.

# Test precision of the semidiscretization process
@testset "Test Hyperbolic Diffusion Boundary Conditions" begin
@testset "Compressible Euler 1D" begin
Expand Down
4 changes: 0 additions & 4 deletions test/test_shallowwater_well_balanced.jl
Original file line number Diff line number Diff line change
Expand Up @@ -13,10 +13,6 @@ isdir(outdir) && rm(outdir, recursive = true)
# CPU kernels, which corresponds to requiring equality of about half of the significant digits
# (see https://docs.julialang.org/en/v1/base/math/#Base.isapprox).

# Basically, this heuristic method first checks whether this error bound (sometimes it is further
# relaxed) is satisfied. Any new methods and optimizations introduced later should at least satisfy
# this error bound.

# Test precision of the semidiscretization process
@testset "Test Shallow Water Well Balanced" begin
@testset "Shallow Water 1D" begin
Expand Down

0 comments on commit fe188bb

Please sign in to comment.