Kokkos Node API and Local Linear Algebra Kernels Version of the Day
Kokkos_StandardNodeMemoryModel.hpp
00001 //@HEADER
00002 // ************************************************************************
00003 // 
00004 //          Kokkos: Node API and Parallel Node Kernels
00005 //              Copyright (2008) Sandia Corporation
00006 // 
00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
00008 // the U.S. Government retains certain rights in this software.
00009 // 
00010 // Redistribution and use in source and binary forms, with or without
00011 // modification, are permitted provided that the following conditions are
00012 // met:
00013 //
00014 // 1. Redistributions of source code must retain the above copyright
00015 // notice, this list of conditions and the following disclaimer.
00016 //
00017 // 2. Redistributions in binary form must reproduce the above copyright
00018 // notice, this list of conditions and the following disclaimer in the
00019 // documentation and/or other materials provided with the distribution.
00020 //
00021 // 3. Neither the name of the Corporation nor the names of the
00022 // contributors may be used to endorse or promote products derived from
00023 // this software without specific prior written permission.
00024 //
00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00036 //
00037 // Questions? Contact Michael A. Heroux (maherou@sandia.gov) 
00038 // 
00039 // ************************************************************************
00040 //@HEADER
00041 
00042 #ifndef KOKKOS_STANDARD_NODE_MEMORY_MODEL_HPP_
00043 #define KOKKOS_STANDARD_NODE_MEMORY_MODEL_HPP_
00044 
00045 #include "Kokkos_NodeAPIConfigDefs.hpp"
00046 #include "Kokkos_BufferMacros.hpp"
00047 
00048 #include <cstdlib>
00049 #include <algorithm>
00050 #include <Teuchos_ArrayRCP.hpp>
00051 #include <Teuchos_ArrayView.hpp>
00052 
00053 namespace Kokkos {
00054 
00058   class StandardNodeMemoryModel {
00059     public:
00061       static const bool isHostNode = true;
00062       static const bool isCUDANode = false;
00063 
00065 
00079       template <class T> inline
00080       ArrayRCP<T> allocBuffer(size_t size) {
00081         ArrayRCP<T> buff;
00082         if (size > 0) {
00083           buff = arcp<T>(size);
00084         }
00085         if (isHostNode == false) {
00086           MARK_COMPUTE_BUFFER(buff);
00087         }
00088         return buff;
00089       }
00090 
00102       template <class T> inline
00103       void copyFromBuffer(size_t size, const ArrayRCP<const T> &buffSrc, const ArrayView<T> &hostDest) {
00104         if (isHostNode == false) {
00105           CHECK_COMPUTE_BUFFER(buffSrc);
00106         }
00107         ArrayRCP<T> buffDest = arcpFromArrayView(hostDest);
00108         copyBuffers(size,buffSrc,buffDest);
00109       }
00110 
00122       template <class T> inline
00123       void copyToBuffer(size_t size, const ArrayView<const T> &hostSrc, const ArrayRCP<T> &buffDest) {
00124         if (isHostNode == false) {
00125           CHECK_COMPUTE_BUFFER(buffDest);
00126         }
00127         ArrayRCP<const T> buffSrc = arcpFromArrayView(hostSrc);
00128         copyBuffers<T>(size,buffSrc,buffDest);
00129       }
00130 
00139       template <class T> inline
00140       void copyBuffers(size_t size, const ArrayRCP<const T> &buffSrc, const ArrayRCP<T> &buffDest) {
00141         if (isHostNode == false) {
00142           CHECK_COMPUTE_BUFFER(buffSrc);
00143           CHECK_COMPUTE_BUFFER(buffDest);
00144         }
00145         ArrayView<const T> av_src = buffSrc(0,size);
00146         ArrayView<T>       av_dst = buffDest(0,size);
00147         std::copy(av_src.begin(),av_src.end(),av_dst.begin());
00148       }
00149 
00151       template <class T> inline
00152       ArrayRCP<const T> viewBuffer(size_t size, ArrayRCP<const T> buff) {
00153         if (isHostNode == false) {
00154           CHECK_COMPUTE_BUFFER(buff);
00155         }
00156         return buff.persistingView(0,size);
00157       }
00158 
00160       template <class T> inline
00161       ArrayRCP<T> viewBufferNonConst(ReadWriteOption rw, size_t size, const ArrayRCP<T> &buff) {
00162         if (isHostNode == false) {
00163           CHECK_COMPUTE_BUFFER(buff);
00164         }
00165         return buff.persistingView(0,size);
00166       }
00167 
00168       inline void readyBuffers(ArrayView<ArrayRCP<const char> > buffers, ArrayView<ArrayRCP<char> > ncBuffers) {
00169 #ifdef HAVE_KOKKOS_DEBUG
00170         if (isHostNode == false) {
00171           for (size_t i=0; i < (size_t)buffers.size(); ++i) {
00172             CHECK_COMPUTE_BUFFER(buffers[i]);
00173           }
00174           for (size_t i=0; i < (size_t)ncBuffers.size(); ++i) {
00175             CHECK_COMPUTE_BUFFER(ncBuffers[i]);
00176           }
00177         }
00178 #endif
00179         (void)buffers;
00180         (void)ncBuffers;
00181       }
00182 
00183 
00185   };
00186 
00187 } // end of namespace Kokkos
00188 
00189 #endif
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends