Dear all, I think I've accumulated enough changes to launch this preview of the new bc handling. It is now almost fully implemented for the scalar (excluding the user field Dirichlet), but not yet for the fluid, therefore the don't merge. I do want the CI to run through, to see what complaints, I guess.
Major changes
The bc_t type
Adds an abstract interface for the constructor and the corresponding deferred routine init. Takes json_file and coef_t. Some derived types now use this to parse the JSON they need, e.g. the Dong condition, the Blasius, etc.
Some descendants also implement an init_from_componets in order to construct without JSON.
Add an abstract interface for finalization and the corresponding deferred routine finalize. Most types just call the finalize_base in bc_t, but symmetry and non_normal run their logic for determining the normal direction here.
Added generic apply for scalar and vector, which looks at whether we are on the device and calls the corresponding routine. Before, one had to use a bc_list to do that. I haven't actually used this yet, so maybe these will be removed later on.
In the step routines for the solvers, we need to be able to distinguish between weak and strong bcs. So bc_t no has an additional component strong = .true. to mark a bc as strong or weak.
The bc_list_t type
Moved to a separate file.
All the subroutines like bc_list_add are now TBPs, which simplifies use statements quite a bit, and is generally the way to go.
I mimic as much as possible the implementation of the field_list_t. Some differences remain though, e.g. for the bc_list we track both the capacity of the list and the number of allocated items. We need to think a bit more about this.
The apply_ routines are augmented with an optional strong parameter, which will lead to only applying strong or weak bcs. As a result, we can use a single list to store all the bcs and then call apply with either strong=.true. or strong=.false. when needed in the step routines.
The zero_dirichlet_t type
This is a rebranding of what used to the noslip_wall. The bc just assigns both vectors and scalars to zero. What I realized is that we have a lot of places in the code where we use a zero-valued Dirichlet for the purpose of marking boundaries for the linear solver routines. Using zero_dirichlet_t helps with clarity there.
The bc_factory subroutine
A factory that inits, marks, and finalizes a bc.
The marking is for a single zone, with the index taken from the JSON. (more on the new structure JSON below).
Currently set up to work with the scalar. What I realized is that construction of user-drives bcs requires knowledge of the scheme. So perhaps, what will happen is that each scheme has its own factory.
Does not support the field_dirichlet_t yet.
The scalar_scheme_t type
Uses a single bc_list called bcs to store the boundary conditions and constructs them with a factory. This results in quite a bit of cleanup here and there.
No longer uses bclabels.
Instead, the keyword boundary_conditions is used, which is an array of JSON objects, similar to how we do sources and simcomps. Each object has the type and zone_index keyword + other keywords needed, for that type.
The RB examples are updated to demonstrate the new layout.
I don't like that with the current structure we have a lot of "no-op" routines in bc types, that don't implement either the scalar or vector apply. Or sometimes neither, as in the case of e.g. symmetry. One could split all types int scalar and vector, but mixed types would still fall out of this classification. Some mixed types, however, a just wrappers around several simple types as components. I have to look at this more.
The big work is to accommodate the new bc structure in fluid_scheme. I don't think it will become as "clean" as scalar because there are quite a bit of auxiliary bcs that are defined and will probably remain as additional components of the type.
Support for field_dirichlet should be added. I will wait for the small cleanup of those I've done in PR #1261 to be merged first.
Dear all, I think I've accumulated enough changes to launch this preview of the new bc handling. It is now almost fully implemented for the scalar (excluding the user field Dirichlet), but not yet for the fluid, therefore the don't merge. I do want the CI to run through, to see what complaints, I guess.
Major changes
The
bc_ttypeinit. Takesjson_fileandcoef_t. Some derived types now use this to parse the JSON they need, e.g. the Dong condition, the Blasius, etc.init_from_componetsin order to construct without JSON.finalize. Most types just call thefinalize_baseinbc_t, butsymmetryandnon_normalrun their logic for determining the normal direction here.bc_listto do that. I haven't actually used this yet, so maybe these will be removed later on.steproutines for the solvers, we need to be able to distinguish between weak and strong bcs. Sobc_tno has an additional componentstrong = .true.to mark a bc as strong or weak.The
bc_list_ttypebc_list_addare now TBPs, which simplifiesusestatements quite a bit, and is generally the way to go.field_list_t. Some differences remain though, e.g. for thebc_listwe track both the capacity of the list and the number of allocated items. We need to think a bit more about this.apply_routines are augmented with an optionalstrongparameter, which will lead to only applying strong or weak bcs. As a result, we can use a single list to store all the bcs and then call apply with eitherstrong=.true.orstrong=.false.when needed in thesteproutines.The
zero_dirichlet_ttypeThis is a rebranding of what used to the
noslip_wall. The bc just assigns both vectors and scalars to zero. What I realized is that we have a lot of places in the code where we use a zero-valued Dirichlet for the purpose of marking boundaries for the linear solver routines. Usingzero_dirichlet_thelps with clarity there.The
bc_factorysubroutinescheme. So perhaps, what will happen is that eachschemehas its own factory.field_dirichlet_tyet.The
scalar_scheme_ttypebc_listcalledbcsto store the boundary conditions and constructs them with a factory. This results in quite a bit of cleanup here and there.bclabels.boundary_conditionsis used, which is an array of JSON objects, similar to how we do sources and simcomps. Each object has thetypeandzone_indexkeyword + other keywords needed, for that type.Remaining work
fluid_scheme. I don't think it will become as "clean" as scalar because there are quite a bit of auxiliary bcs that are defined and will probably remain as additional components of the type.