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 
00064 
00078       template <class T> inline
00079       ArrayRCP<T> allocBuffer(size_t size) {
00080         ArrayRCP<T> buff;
00081         if (size > 0) {
00082           buff = arcp<T>(size);
00083         }
00084         if (isHostNode == false) {
00085           MARK_COMPUTE_BUFFER(buff);
00086         }
00087         return buff;
00088       }
00089 
00101       template <class T> inline
00102       void copyFromBuffer(size_t size, const ArrayRCP<const T> &buffSrc, const ArrayView<T> &hostDest) {
00103         if (isHostNode == false) {
00104           CHECK_COMPUTE_BUFFER(buffSrc);
00105         }
00106         ArrayRCP<T> buffDest = arcpFromArrayView(hostDest);
00107         copyBuffers(size,buffSrc,buffDest);
00108       }
00109 
00121       template <class T> inline
00122       void copyToBuffer(size_t size, const ArrayView<const T> &hostSrc, const ArrayRCP<T> &buffDest) {
00123         if (isHostNode == false) {
00124           CHECK_COMPUTE_BUFFER(buffDest);
00125         }
00126         ArrayRCP<const T> buffSrc = arcpFromArrayView(hostSrc);
00127         copyBuffers<T>(size,buffSrc,buffDest);
00128       }
00129 
00138       template <class T> inline
00139       void copyBuffers(size_t size, const ArrayRCP<const T> &buffSrc, const ArrayRCP<T> &buffDest) {
00140         if (isHostNode == false) {
00141           CHECK_COMPUTE_BUFFER(buffSrc);
00142           CHECK_COMPUTE_BUFFER(buffDest);
00143         }
00144         ArrayView<const T> av_src = buffSrc(0,size);
00145         ArrayView<T>       av_dst = buffDest(0,size);
00146         std::copy(av_src.begin(),av_src.end(),av_dst.begin());
00147       }
00148 
00150       template <class T> inline
00151       ArrayRCP<const T> viewBuffer(size_t size, ArrayRCP<const T> buff) {
00152         if (isHostNode == false) {
00153           CHECK_COMPUTE_BUFFER(buff);
00154         }
00155         return buff.persistingView(0,size);
00156       }
00157 
00159       template <class T> inline
00160       ArrayRCP<T> viewBufferNonConst(ReadWriteOption rw, size_t size, const ArrayRCP<T> &buff) {
00161         if (isHostNode == false) {
00162           CHECK_COMPUTE_BUFFER(buff);
00163         }
00164         return buff.persistingView(0,size);
00165       }
00166 
00167       inline void readyBuffers(ArrayView<ArrayRCP<const char> > buffers, ArrayView<ArrayRCP<char> > ncBuffers) {
00168 #ifdef HAVE_KOKKOS_DEBUG
00169         if (isHostNode == false) {
00170           for (size_t i=0; i < (size_t)buffers.size(); ++i) {
00171             CHECK_COMPUTE_BUFFER(buffers[i]);
00172           }
00173           for (size_t i=0; i < (size_t)ncBuffers.size(); ++i) {
00174             CHECK_COMPUTE_BUFFER(ncBuffers[i]);
00175           }
00176         }
00177 #endif
00178         (void)buffers;
00179         (void)ncBuffers;
00180       }
00181 
00182 
00184   };
00185 
00186 } // end of namespace Kokkos
00187 
00188 #endif
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends