11 #ifndef OOPS_BASE_MODELSPACECOVARIANCEBASE_H_ 12 #define OOPS_BASE_MODELSPACECOVARIANCEBASE_H_ 17 #include <boost/noncopyable.hpp> 18 #include <boost/ptr_container/ptr_vector.hpp> 20 #include "eckit/config/LocalConfiguration.h" 26 #include "oops/util/abor1_cpp.h" 27 #include "oops/util/Logger.h" 40 template <
typename MODEL>
46 typedef typename boost::ptr_vector<LinearVariableChangeBase_>
ChvarVec_;
47 typedef typename ChvarVec_::iterator
iter_;
48 typedef typename ChvarVec_::const_iterator
icst_;
49 typedef typename ChvarVec_::const_reverse_iterator
ircst_;
53 const Geometry_ &,
const eckit::Configuration &);
74 template <
typename MODEL>
90 static std::map < std::string, CovarianceFactory<MODEL> * > &
getMakers() {
91 static std::map < std::string, CovarianceFactory<MODEL> * > makers_;
98 template<
class MODEL,
class COVAR>
114 template <
typename MODEL>
116 if (getMakers().find(
name) != getMakers().
end()) {
117 Log::error() <<
name <<
" already registered in covariance factory." << std::endl;
118 ABORT(
"Element already registered in CovarianceFactory.");
120 getMakers()[
name] =
this;
125 template <
typename MODEL>
127 const eckit::Configuration &
conf,
131 const std::string
id =
conf.getString(
"covariance");
132 Log::trace() <<
"ModelSpaceCovarianceBase type = " <<
id << std::endl;
133 typename std::map<std::string, CovarianceFactory<MODEL>*>::iterator jcov = getMakers().find(
id);
134 if (jcov == getMakers().
end()) {
135 Log::error() <<
id <<
" does not exist in CovarianceFactory." << std::endl;
136 Log::error() <<
"CovarianceFactory has " << getMakers().size() <<
" elements:" << std::endl;
138 jj = getMakers().
begin(); jj != getMakers().end(); ++jj) {
139 Log::error() <<
"A " << jj->first <<
" B" << std::endl;
141 ABORT(
"Element does not exist in CovarianceFactory.");
143 return (*jcov).second->make(
conf, resol,
vars,
xb, fg);
148 template <
typename MODEL>
151 const eckit::Configuration &
conf) {
152 if (
conf.has(
"variable_changes")) {
153 std::vector<eckit::LocalConfiguration> chvarconfs;
154 conf.get(
"variable_changes", chvarconfs);
155 for (
const auto & config : chvarconfs) {
163 template <
typename MODEL>
166 if (chvars_.size()) {
168 boost::scoped_ptr<Increment_> dxchvarin(
new Increment_(dxi));
169 for (
ircst_ it = chvars_.rbegin(); it != chvars_.rend(); ++it) {
170 Increment_ dxchvarout = it->multiplyAD(*dxchvarin);
175 this->doMultiply(*dxchvarin, dxchvarout);
179 for (
icst_ it = chvars_.begin(); it != chvars_.end(); ++it) {
180 Increment_ dxchvarout = it->multiply(*dxchvarin);
185 this->doMultiply(dxi, dxo);
191 template <
typename MODEL>
194 if (chvars_.size()) {
196 boost::scoped_ptr<Increment_> dxchvarin(
new Increment_(dxi));
197 for (
ircst_ it = chvars_.rbegin(); it != chvars_.rend(); ++it) {
198 Increment_ dxchvarout = it->multiplyInverse(*dxchvarin);
203 this->doInverseMultiply(*dxchvarin, dxchvarout);
207 for (
icst_ it = chvars_.begin(); it != chvars_.end(); ++it) {
208 Increment_ dxchvarout = it->multiplyInverseAD(*dxchvarin);
213 this->doInverseMultiply(dxi, dxo);
221 #endif // OOPS_BASE_MODELSPACECOVARIANCEBASE_H_
Geometry< MODEL > Geometry_
ChvarVec_::const_iterator icst_
************************************************************************GNU Lesser General Public License **This file is part of the GFDL Flexible Modeling System(FMS). ! *! *FMS is free software without even the implied warranty of MERCHANTABILITY or *FITNESS FOR A PARTICULAR PURPOSE See the GNU General Public License *for more details **You should have received a copy of the GNU Lesser General Public *License along with FMS If see< http:! ***********************************************************************!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !! MPP_TRANSMIT !! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! subroutine MPP_TRANSMIT_(put_data, put_len, to_pe, get_data, get_len, from_pe, block, tag, recv_request, send_request)!a message-passing routine intended to be reminiscent equally of both MPI and SHMEM!put_data and get_data are contiguous MPP_TYPE_ arrays!at each call, your put_data array is put to to_pe 's get_data! your get_data array is got from from_pe 's put_data!i.e we assume that typically(e.g updating halo regions) each PE performs a put _and_ a get!special PE designations:! NULL_PE:to disable a put or a get(e.g at boundaries)! ANY_PE:if remote PE for the put or get is to be unspecific! ALL_PES:broadcast and collect operations(collect not yet implemented)!ideally we would not pass length, but this f77-style call performs better(arrays passed by address, not descriptor)!further, this permits< length > contiguous words from an array of any rank to be passed(avoiding f90 rank conformance check)!caller is responsible for completion checks(mpp_sync_self) before and after integer, intent(in) ::put_len, to_pe, get_len, from_pe MPP_TYPE_, intent(in) ::put_data(*) MPP_TYPE_, intent(out) ::get_data(*) logical, intent(in), optional ::block integer, intent(in), optional ::tag integer, intent(out), optional ::recv_request, send_request logical ::block_comm integer ::i MPP_TYPE_, allocatable, save ::local_data(:) !local copy used by non-parallel code(no SHMEM or MPI) integer ::comm_tag integer ::rsize if(.NOT.module_is_initialized) call mpp_error(FATAL, 'MPP_TRANSMIT:You must first call mpp_init.') if(to_pe.EQ.NULL_PE .AND. from_pe.EQ.NULL_PE) return block_comm=.true. if(PRESENT(block)) block_comm=block if(debug) then call SYSTEM_CLOCK(tick) write(stdout_unit,'(a, i18, a, i6, a, 2i6, 2i8)')&'T=', tick, ' PE=', pe, ' MPP_TRANSMIT begin:to_pe, from_pe, put_len, get_len=', to_pe, from_pe, put_len, get_len end if comm_tag=DEFAULT_TAG if(present(tag)) comm_tag=tag!do put first and then get if(to_pe.GE.0 .AND. to_pe.LT.npes) then!use non-blocking sends if(debug .and.(current_clock.NE.0)) call SYSTEM_CLOCK(start_tick)!z1l:truly non-blocking send.! if(request(to_pe).NE.MPI_REQUEST_NULL) then !only one message from pe-> to_pe in queue *PE waiting for to_pe ! call error else get_len so only do gets but you cannot have a pure get with MPI call a get means do a wait to ensure put on remote PE is complete error call increase mpp_nml request_multiply call MPP_TRANSMIT end
CovarianceFactory(const std::string &)
Encapsulates the model state.
virtual ModelSpaceCovarianceBase< MODEL > * make(const eckit::Configuration &, const Geometry_ &, const Variables &, const State_ &, const State_ &)=0
ChvarVec_::iterator iter_
The namespace for the main oops code.
Geometry< MODEL > Geometry_
virtual void doInverseMultiply(const Increment_ &, Increment_ &) const =0
LinearVariableChangeBase< MODEL > LinearVariableChangeBase_
virtual ~CovarianceFactory()
void inverseMultiply(const Increment_ &, Increment_ &) const
static ModelSpaceCovarianceBase< MODEL > * create(const eckit::Configuration &, const Geometry_ &, const Variables &, const State_ &, const State_ &)
CovarMaker(const std::string &name)
LinearVariableChangeFactory Factory.
Base class for generic variable transform.
ChvarVec_::const_reverse_iterator ircst_
Abstract base class for model space error covariances.
virtual ~ModelSpaceCovarianceBase()
Geometry< MODEL > Geometry_
Increment Class: Difference between two states.
virtual ModelSpaceCovarianceBase< MODEL > * make(const eckit::Configuration &conf, const Geometry_ &resol, const Variables &vars, const State_ &xb, const State_ &fg)
ModelSpaceCovarianceBase(const State_ &, const State_ &, const Geometry_ &, const eckit::Configuration &)
Increment< MODEL > Increment_
virtual void randomize(Increment_ &) const =0
void multiply(const Increment_ &, Increment_ &) const
boost::ptr_vector< LinearVariableChangeBase_ > ChvarVec_
virtual void doMultiply(const Increment_ &, Increment_ &) const =0
static std::map< std::string, CovarianceFactory< MODEL > *> & getMakers()
************************************************************************GNU Lesser General Public License **This file is part of the GFDL Flexible Modeling System(FMS). ! *! *FMS is free software without even the implied warranty of MERCHANTABILITY or *FITNESS FOR A PARTICULAR PURPOSE See the GNU General Public License *for more details **You should have received a copy of the GNU Lesser General Public *License along with FMS If see< http:! ***********************************************************************!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !! MPP_TRANSMIT !! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! subroutine MPP_TRANSMIT_(put_data, put_len, to_pe, get_data, get_len, from_pe, block, tag, recv_request, send_request)!a message-passing routine intended to be reminiscent equally of both MPI and SHMEM!put_data and get_data are contiguous MPP_TYPE_ arrays!at each call, your put_data array is put to to_pe 's get_data! your get_data array is got from from_pe 's put_data!i.e we assume that typically(e.g updating halo regions) each PE performs a put _and_ a get!special PE designations:! NULL_PE:to disable a put or a get(e.g at boundaries)! ANY_PE:if remote PE for the put or get is to be unspecific! ALL_PES:broadcast and collect operations(collect not yet implemented)!ideally we would not pass length, but this f77-style call performs better(arrays passed by address, not descriptor)!further, this permits< length > contiguous words from an array of any rank to be passed(avoiding f90 rank conformance check)!caller is responsible for completion checks(mpp_sync_self) before and after integer, intent(in) ::put_len, to_pe, get_len, from_pe MPP_TYPE_, intent(in) ::put_data(*) MPP_TYPE_, intent(out) ::get_data(*) logical, intent(in), optional ::block integer, intent(in), optional ::tag integer, intent(out), optional ::recv_request, send_request logical ::block_comm integer ::i MPP_TYPE_, allocatable, save ::local_data(:) !local copy used by non-parallel code(no SHMEM or MPI) integer ::comm_tag integer ::rsize if(.NOT.module_is_initialized) call mpp_error(FATAL, 'MPP_TRANSMIT:You must first call mpp_init.') if(to_pe.EQ.NULL_PE .AND. from_pe.EQ.NULL_PE) return block_comm=.true. if(PRESENT(block)) block_comm=block if(debug) then call SYSTEM_CLOCK(tick) write(stdout_unit,'(a, i18, a, i6, a, 2i6, 2i8)')&'T=', tick, ' PE=', pe, ' MPP_TRANSMIT begin:to_pe, from_pe, put_len, get_len=', to_pe, from_pe, put_len, get_len end if comm_tag=DEFAULT_TAG if(present(tag)) comm_tag=tag!do put first and then get if(to_pe.GE.0 .AND. to_pe.LT.npes) then!use non-blocking sends if(debug .and.(current_clock.NE.0)) call SYSTEM_CLOCK(start_tick)!z1l:truly non-blocking send.! if(request(to_pe).NE.MPI_REQUEST_NULL) then !only one message from pe-> to_pe in queue *PE waiting for to_pe ! call error else get_len so only do gets but you cannot have a pure get with MPI call a get means do a wait to ensure put on remote PE is complete error call increase mpp_nml request_multiply call MPP_TRANSMIT get_len end if return end subroutine MPP_TRANSMIT_ ! MPP_BROADCAST ! subroutine but that doesn t allow !broadcast to a subset of PEs This version and mpp_transmit will remain !backward compatible intent(inout) MPP_BROADCAST begin